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 Systems  (9)
  • Chemistry  (4)
  • Mathematical and Computer Sciences (General)  (4)
  • 2000-2004  (13)
  • 1970-1974  (4)
  • 1
    Electronic Resource
    Electronic Resource
    New York : Wiley-Blackwell
    Journal of Polymer Science: Polymer Letters Edition 11 (1973), S. 639-643 
    ISSN: 0360-6384
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York : Wiley-Blackwell
    Die Makromolekulare Chemie 151 (1972), S. 121-125 
    ISSN: 0025-116X
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Physics
    Description / Table of Contents: Die Störung der Metachromasie eines an einem Polyanion gebundenen Farbstoffs durch Cetylpyridiniumchlorid (CPCl) wurde quantitative abgeschätzt, indem die in der wässerigen Schicht verbliebenen Farbstoffmengen nach Schütteln der metachromatischen Lösung mit Tetrachlorkohlenstoff in An- und Abwesenheit von CPCl ermittelt wurden. Die Aufhebung der Metachromasie wurde außerdem aus der konduktometrischen Titration der Farbstoff/Polyanion-Lösung mit CPCl ermittelt. CPCl verdrängt die Farbstoffionen von den Polyanionen beinahe stöchiometrisch, was bei Natriumchlorid nicht der Fall ist. Dieses besondere Verhalten von CPCl wird seiner Neigung zur Bildung hydrophober Bindungen zugeschrieben. Es wurden Methylenblau und Kristallviolett als Farbstoffe sowie Chondroitinschwefelsäure und Heparin als Polyanionen verwendet
    Notes: The disturbance of metachromasia of a dye/polyanion system by cetyl pyridinium chloride (CPCl) has been estimated quantitatively from the difference of the amounts of dye left in the aqueous layer after carbon tetrachloride extraction of the metachromatic solution in the presence and absence of CPCl, as well as from conductometric titration of the dye/polyanion solution with CPCl. Results show that CPCl, unlike sodium chloride, displaces the dye ions from the polyanions almost stoichiometrically. This special behaviour of CPCl has been assigned to its tendency to form hydrophobic bonds. As dyes methylene blue and crystal violet, as polyanions chondroitin sulfate and heparin have been used.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York : Wiley-Blackwell
    Die Makromolekulare Chemie 163 (1973), S. 37-43 
    ISSN: 0025-116X
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Physics
    Description / Table of Contents: Die Substanzpolymerisation von N-Vinylcarbazol (NVC) wurde mit 3d-Metalloxid-Katalysatoren durchgeführt, und die folgende Reaktivitätsreihe für die untersuchten Oxide wurde vorgeschlagen: \documentclass{article}\pagestyle{empty}\begin{document}$$ {\rm V}_{\rm 2} {\rm O}_{\rm 5} {\rm 〉 MnO}_{\rm 2} {\rm 〉 TiO}_{\rm 2} {\rm 〉 Cr}_{\rm 2} {\rm O}_{\rm 3} {\rm 〉 NiO 〉 ZnO 〉 Cu}_{\rm 2} {\rm O 〉 CuO 〉 Co}_{\rm 3} {\rm O}_{\rm 4} {\rm andCoO} $$\end{document} wobei die Oxide des Kupfers und Kobalts nicht wirksam sind. Einige kinetische Untersuchungen wurden mit dem System NVC/MnO2 ausgeführt. Auf Grund der Verzögerung der Polymerisationsgeschwindigkeit bei Gegenwart von Wasser oder Thiophen wurde ein kationischer Mechanismus für die Polymerisation vorgeschlagen. Die Wirkungslosigkeit der Kupfer- und Kobaltoxide als Katalysatoren wurde vorläufig mit der Annahme gedeutet, daß sie eher oxydierend wirken als durch π-Komplex-Bindung. Rühren übt keinen Einfluß auf die Polymerisationsgeschwindigkeit aus.
    Notes: The bulk polymerization of N-Vinylcarbazole (NVC) is carried out using some 3 d-metal oxides as catalysts and the following order of reactivity is suggested for the various metal oxides studied: \documentclass{article}\pagestyle{empty}\begin{document}$$ {\rm V}_{\rm 2} {\rm O}_{\rm 5} {\rm 〉 MnO}_{\rm 2} {\rm 〉 TiO}_{\rm 2} {\rm 〉 Cr}_{\rm 2} {\rm O}_{\rm 3} {\rm 〉 NiO 〉 ZnO 〉 Cu}_{\rm 2} {\rm O 〉 CuO 〉 Co}_{\rm 3} {\rm O}_{\rm 4} {\rm andCoO} $$\end{document} the oxides of copper and cobalt being ineffective. Some kinetic studies are carried out with the NVC/MnO2 system. Endorsed by the observed retardation of the rate in the presence of water and thiophene a cationic mechanism is suggested for the polymerization. The incapability of the oxides of Cu and Co to act as good catalysts is tentatively explained by supposing that they act as oxidizing rather than π-complexing polymerization catalysts. Stirring does not show any influence on the rate of polymerization.
    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 : Wiley-Blackwell
    Journal of Polymer Science: Polymer Letters Edition 12 (1974), S. 543-543 
    ISSN: 0360-6384
    Keywords: Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2019-07-13
    Description: In this paper, we propose a distributed approach for mapping a single large application to a heterogeneous grid environment. To minimize the execution time of the parallel application, we distribute the mapping overhead to the available nodes of the grid. This approach not only provides a fast mapping of tasks to resources but is also scalable. We adopt a hierarchical grid model and accomplish the job of mapping tasks to this topology using a scheduler tree. Results show that our three-phase algorithm provides high quality mappings, and is fast and scalable.
    Keywords: Computer Systems
    Type: IEEE 5th International Conference on Cluster Computing; Dec 01, 2003 - Dec 04, 2003; Hong Kong; China
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2019-07-13
    Description: The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.
    Keywords: Computer Systems
    Type: Irregular; May 01, 2000; Cancun; Mexico
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2019-07-10
    Description: We present a complete specification of a new benchmark for measuring the performance of modern computer systems when solving scientific problems featuring irregular, dynamic memory accesses. It complements the existing NAS Parallel Benchmark suite. The benchmark involves the solution of a stylized heat transfer problem in a cubic domain, discretized on an adaptively refined, unstructured mesh.
    Keywords: Mathematical and Computer Sciences (General)
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2019-07-10
    Description: The overset grid methodology has significantly reduced time-to-solution of highfidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations. The solution process resolves the geometrical complexity of the problem domain by using separately generated but overlapping structured discretization grids that periodically exchange information through interpolation. However, high performance computations of such large-scale realistic applications must be handled efficiently on state-of-the-art parallel supercomputers. This paper analyzes the effects of various performance enhancement strategies on the parallel efficiency of an overset grid Navier-Stokes CFD application running on an SGI Origin2000 machinc. Specifically, the role of asynchronous communication, grid splitting, and grid grouping strategies are presented and discussed. Details of a sophisticated graph partitioning technique for grid grouping are also provided. Results indicate that performance depends critically on the level of latency hiding and the quality of load balancing across the processors.
    Keywords: Mathematical and Computer Sciences (General)
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2019-07-13
    Description: Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major technical hurdles, including distributed resource management and effective job scheduling, stand in the way of realizing these gains. In this paper, we propose a novel grid superscheduler architecture and three distributed job migration algorithms. We also model the critical interaction between the superscheduler and autonomous local schedulers. Extensive performance comparisons with ideal, central, and local schemes using real workloads from leading computational centers are conducted in a simulation environment. Additionally, synthetic workloads are used to perform a detailed sensitivity analysis of our superscheduler. Several key metrics demonstrate that substantial performance gains can be achieved via smart superscheduling in distributed computational grids.
    Keywords: Mathematical and Computer Sciences (General)
    Type: SC2003; Nov 15, 2003 - Nov 21, 2003; Phoenix, AZ; United States
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2019-07-13
    Description: Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.
    Keywords: Mathematical and Computer Sciences (General)
    Type: 2004 HPDC Conference; Jan 01, 2004; Unknown
    Format: application/pdf
    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...