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
  • Euclid's algorithm  (1)
  • Heliothis virescens  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Deterrence of feeding and oviposition responses of adult Heliothis virescens by some compounds bitter-tasting to humans (1992)
    Springer
    Entomologia experimentalis et applicata 65 (1992), S. 81-93 
    Details
    ISSN: 1570-7458
    Keywords: Heliothis virescens ; Lepidoptera ; Noctuidae ; feeding behavior ; oviposition behavior ; electrophysiology ; deterrence ; antifeedant ; quinine ; quinidine ; atropine ; caffeine ; denatonium benzoate ; naringin ; sucrose octaacetate
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract Some compounds that are bitter-tasting to humans, both alkaloidal (quinine, quinidine, atropine, caffeine) and non-alkaloidal (denatonium benzoate, sucrose octaacetate, naringin), deterred feeding and oviposition by Heliothis virescens (F.) in laboratory and field cage experiments. Preliminary electrophysiological studies of gustatory sensilla on the ovipositor of H. virescens provided evidence of 3 neurons, one of which is responsive to sucrose. Preliminary indications are that responses of this neuron may be inhibited by quinine and denatonium benzoate.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00189720
    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...