ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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)
  • Chemistry  (3)
  • Chemotactic peptide  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    FEBS Letters 165 (1984), S. 171-174 
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Peptide NH chemical shifts and their temperature dependences have been monitored as a function of concentration for the decapeptide, Boc-Aib-Pro-Val-Aib-Val-Ala-Aib-Ala-Aib-Aib-OMe in CDCl3 (0.001-0.06M) and (CD3)2SO (0.001-0.03M). The chemical shifts and temperature coefficients for all nine NH groups show no significant concentration dependence in (CD3)2SO. Seven NH groups yield low values of temperature coefficients over the entire range, while one yields an intermediate value. In CDCl3, the Aib(1) NH group shows a large concentration dependence of both chemical shift and temperature coefficient, in contrast to the other eight NH groups. The data suggest that in (CD3)2SO, the peptide adopts a 310 helical conformation and is monomeric over the entire concentration range. In CDCl3, the 310 helical peptide associates at a concentration of 0.01M, with the Aib(1) NH involved in an intermolecular hydrogen bond. Association does not disrupt the intramolecular hydrogen-bonding pattern in the decapeptide.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 0006-3525
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: t-Buthyoxycarbonyl-L-alanyl-α-aminiosobutyryl-L-alanyl-α-aminoisobutyryl-α-aminoisobutyric acid methyl ester (t-Boc-L-Ala-Aib-L-Ala-Aib-Aib-OMe), C24H43N5O8, an end-protected pentapeptide with a sequence corresponding to the 6th through the 10th residues in suzukacillin, crystallizes in the orthorhombic space group P212121 with a = 11.671, b = 14.534, c = 17.906 Å and z = 4. The molecule exists as a right-handed 310-helix with a pitch of 6.026 Å. The helix is stabilized by three 4 → 1 hydrogen bonds with the NH groups of Ala(3), Aib(4), and Aib(5) hydrogen bonding to the carbonyl oxygens of t-Boc, Ala(1), and Aib(2), respectively. The helical molecules arrange themselves in a head-to-tail fashion along the a direction in such a way that the NH groups of Ala(1) and Aib(2) hydrogen bond to the carbonyl oxygens of Aib(4) and Aib(5), respectively, of a translationally related molecule. The helical columns thus formed close-pack nearly hexagonally to form the crystal.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    X-Ray Spectrometry 24 (1995), S. 298-306 
    ISSN: 0049-8246
    Keywords: Chemistry ; Analytical Chemistry and Spectroscopy
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Physics
    Notes: Uranium and cerium were studied in nitric acid solutions after presentation to an energy-dispersive x-ray fluorescence (EDXRF) spectrometer on filter-paper fixed on Scotch tape. Ce Lα and U Lα peaks were used as analyte lines after excitation with a tungsten tube target at low potential (20 kV). These non-conventional excitation conditions were considered to be suitable for low contents of cerium strongly but high contents of uranium weakly in a nuclear fuel. Lower net integrated line intensities observed in an actinide as compared with a lanthanide are discussed along with the scattered, Auger and Coster-Kronig intensities responsible for the production of back-ground before calibrations with known concentrations. Difficulties in establishing an explicit relationship between these with change in matrix composition are discussed. The known concentrations of the mixed solutions when compared with the results from various computer programs using regression analysis showed that the algorithm developed by Plesch and Thiele for Siemens is better than the others. An accuracy of 〈2% was achieved. The importance of certified, standard or simulated reference materials is realized for quality analysis of occasional samples.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    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 ...
  • 6
    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 ...
  • 7
    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 ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...