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
  • 1
    Electronic Resource
    Electronic Resource
    Intracellular Development of Infectious Bronchitis Virus (1967)
    [s.l.] : Nature Publishing Group
    Nature 216 (1967), S. 393-394 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] Coverslip cultures of chick embryo lung and kidney from 15 and 19 day embryonated eggs, respectively, were stained by coriphosphine7 before, and daily for 6 days after, infection with 1,000 EID^ of IB virus for each cover slip. The cultures were examined under a Reichert microscope with fluorescent ...
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/216393a0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A Method for Extracting and Stating Software Requirements that a User Interface Prototype Contains (2000)
    Springer
    Requirements engineering 5 (2000), S. 225-241 
    Details
    ISSN: 1432-010X
    Keywords: Key words:Case study – Requirements elicitation – Requirements extraction – Requirements prototyping – Requirements tracing – User interface prototyping
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: User interface and requirements prototyping is a requirements elicitation technique. A user interface and requirements prototype is built during the requirements engineering phase of a software system development. Along with the user interface prototype are produced various documents such as the system requirement specification. When a prototype and other documents exist, they may not describe the same functionality, particularly because there may be behaviour of the prototype, artefacts of prototyping, that may not be intended. The problem is that in later development stages, when there is a prototype and other documents, it is often difficult to reconcile the difference between the prototype and the other documents. This paper presents an approach for avoiding this difficulty. It demonstrates the approach by showing its application to parts of a real software development.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00010352
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    On the time required for reference count management in retention block-structured languages. Part 2 (1978)
    Springer
    International journal of parallel programming 7 (1978), S. 91-119 
    Details
    ISSN: 1573-7640
    Keywords: Block-structured languages ; retention vs. deletion ; contour model ; stack model ; reference counts ; lifetime checks ; time estimates
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, two implementations of generalized block-structured languages are presented and compared for time requirements. One implementation, the Lifetime Stack Model, implements the deletion strategy with lifetime checks; the other, the Partial Reference Count Contour Machine, implements the retention strategy. For a large subset of the lifetime well-stacking programs, those that run correctly on the first model, the two models are shown to require nearly the same order of magnitude of time. The use of full label values is shown to have a detrimental effect on the time efficiency of the latter model. Part 1, in Volume 7, Number 1, of this journal, gives a general description of the machines, some of their definitions, and proof of the results. Part 2, in this issue, serves as an appendix to Part 1 and contains most of the formal definitions of the machines.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00975882
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Time required for garbage collection in retention block-structured languages (1978)
    Springer
    International journal of parallel programming 7 (1978), S. 361-404 
    Details
    ISSN: 1573-7640
    Keywords: Block-structured languages ; retention vs. deletion ; contour model ; garbage collection ; time estimates
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper investigates the time requirements for an implementation of retention block-structured languages that uses a garbage collector as its sole means for recovering inaccessible storage. The usual three-pass markcompactify-and-update garbage collector is optimized to eliminate the need for the third pass in the event that the executed program is lifetime well-stacking.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00991820
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Language design methods based on semantic principles: Algol 68, a Language Designed using Semantic Principles (1980)
    Springer
    Acta informatica 15 (1980), S. 83-98 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary This note observes that Tennent's proposed language design method is that used by Algol 68's designers and points out how his proposed extensions to Pascal bring it closer to Algol 68. Some implications of his proposal are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00269810
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    The synthesis of A21978C analogs byStreptomyces roseosporus cultivated under carbon limitation and fed fatty acids (1990)
    Springer
    Biotechnology letters 12 (1990), S. 789-792 
    Details
    ISSN: 1573-6776
    Source: Springer Online Journal Archives 1860-2000
    Topics: Process Engineering, Biotechnology, Nutrition Technology
    Notes: Summary By employing carbon limited fed batch techniques, fatty acids of length C8 to C12 were successfully employed as precursors for biosynthesis of A21978C antibiotics. The efficiency of incorporation was related to the length of the lipid precursor, with C10-C12 fatty acids being the preferred substrates.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01022596
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Time required for reference count management in retention block-structured languages. Part 1 (1978)
    Springer
    International journal of parallel programming 7 (1978), S. 11-64 
    Details
    ISSN: 1573-7640
    Keywords: Block-structured languages ; retention vs. deletion ; contour model ; stack model ; reference counts ; lifetime checks ; time estimates
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, two implementations of generalized block-structured languages are presented and their time requirements compared. One implementation, the lifetime stack model (LSM), implements the deletion strategy with lifetime checks; the other, the partial reference count contour machine (PRCCM), implements the retention strategy. For a large subset of the lifetime well-stacking programs, which are precisely those that run correctly on the first model, the two models are shown to require nearly the same order of magnitude of time. The use of full-label values is shown to have a detrimental effect on the time efficiency of the latter model. Part 1, in this issue, gives a general description of the machines and part of their definitions, and proves the results. Part 2, in the next issue, serving as an appendix to Part 1, contains most of the formal definitions of the machines.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00991939
    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...