Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Cavernous angioma  (1)
  • Euclid's algorithm  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Cavernous angiomas of the internal auditory canal A case report and review of literature (1994)
    Springer
    Acta neurochirurgica 129 (1994), S. 100-104 
    Details
    ISSN: 0942-0940
    Keywords: Cavernous angioma ; internal auditory canal ; differential diagnosis ; facial nerve ; magnetic resonance imaging
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Summary Cavernous angiomas of the internal auditory canal (IAC) are rare. They are angiographically occult; and because the clinical symptoms are similar both in intracanalicular cavernous angiomas and acoustic tumors it had been difficult to differentiate pre-operatively both of these pathologies until the advent of magnetic resonance imaging (MRI). Even nowadays the correct diagnosis may be missed if the patient is imaged only with gadolinium enhanced MRI without prior obtaining a non-contrast MRI. These diagnostic difficulties are illustrated by the report of a related case. The importance of thorough neuroradiological investigations stressed and MRI features, surgical management and relevant literature concerning the cavernous angiomas of the internal auditory canal are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01400882
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Proportionate progress: A notion of fairness in resource allocation (1996)
    Springer
    Algorithmica 15 (1996), S. 600-625 
    Details
    ISSN: 1432-0541
    Keywords: Euclid's algorithm ; Fairness ; Network flow ; Periodic scheduling ; Resource allocation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a set ofn tasks andm resources, where each taskx has a rational weightx.w=x.e/x.p,0〈x.w〈1, aperiodic schedule is one that allocates a resource to a taskx for exactlyx.e time units in each interval [x.p·k, x.p·(k+1)) for allk∈N. We define a notion of proportionate progress, called P-fairness, and use it to design an efficient algorithm which solves the periodic scheduling problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01940883
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...