ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
  • COMPUTER PROGRAMMING AND SOFTWARE  (3)
  • 85.30.De  (2)
  • Chemotactic peptide  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Conformationally constrained chemotactic peptide analogs of high biological activity
    Amsterdam : Elsevier
    FEBS Letters 165 (1984), S. 171-174 
    Details
    ISSN: 0014-5793
    Keywords: Chemotactic peptide ; Chemotaxis ; Formylpeptide ; Neutrophil
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Biology , Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    URL: http://linkinghub.elsevier.com/retrieve/pii/0014-5793(84)80163-5
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Non-exponential dark capacitance transients from red-emitting GaP LED's — Field and edge effects on the 0.75 eV centre (1986)
    Springer
    Applied physics 40 (1986), S. 129-132 
    Details
    ISSN: 1432-0630
    Keywords: 71.55.Fr ; 85.60.Jb ; 85.30.De
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract The origin of the non-exponential behaviour of the previously reported [2] dark capacitance transients from red-emitting GaP LED's has been investigated in detail. In particular, the effects of the electric field and the junction edge-region on hole-emission from the 0.75 eV level has been studied. A small apparent electric-field enhancement of the emission rate has been shown to be caused predominantly by junction edge effects.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00616489
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    “0.75 eV killer centre” in red-emitting GaP LEDs (1983)
    Springer
    Applied physics 32 (1983), S. 223-224 
    Details
    ISSN: 1432-0630
    Keywords: 71.55.Fr ; 85.60.Jb ; 85.30.De
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract Dark transient capacitance measurements have been used to investigate the deeplevel content of red GaP LEDs. Thermal emission rate data is obtained and the 0.75 eV “killer” centre is identified from the signature.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00820265
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    Approximate algorithms for partitioning and assignment problems (1986)
    In:  CASI
    Details
    Publication Date: 2019-06-28
    Description: The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy.
    Keywords: COMPUTER PROGRAMMING AND SOFTWARE
    Type: NASA-CR-178130 , ICASE-86-40 , NAS 1.26:178130
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 5
    facet.materialart.
    Unknown
    Efficient algorithms for a class of partitioning problems (1990)
    In:  CASI
    Details
    Publication Date: 2019-06-28
    Description: The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.
    Keywords: COMPUTER PROGRAMMING AND SOFTWARE
    Type: NASA-CR-182073 , NAS 1.26:182073 , ICASE-90-49 , AD-A227221
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 6
    facet.materialart.
    Unknown
    A comparative analysis of static and dynamic load balancing strategies (1986)
    In:  Other Sources
    Details
    Publication Date: 2019-06-28
    Description: The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but suboptimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the three strategies.
    Keywords: COMPUTER PROGRAMMING AND SOFTWARE
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...