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
  • Springer  (23)
  • Wiley  (14)
  • 2020-2024  (1)
  • 1990-1994  (31)
  • 1970-1974  (5)
Collection
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    AI & society 8 (1994), S. 357-359 
    ISSN: 1435-5655
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Papers in regional science 27 (1971), S. 195-227 
    ISSN: 1435-5957
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geography , Economics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Bulletin of environmental contamination and toxicology 44 (1990), S. 165-172 
    ISSN: 1432-0800
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Medicine
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Policy sciences 3 (1972), S. 361-369 
    ISSN: 1573-0891
    Source: Springer Online Journal Archives 1860-2000
    Topics: Political Science , Economics
    Notes: Abstract This paper assesses the role program evaluation can play in assisting decisions on public programs. The author looks at evaluation from the standpoint of decisionmakers interested in finding out the “right” answers about their programs. The discussion focuses on the assistance that various types of evaluation can give to program managers and to policymakers concerned with legislative changes and budget levels. The paper includes recent examples of relevant evaluation work. The concluding section analyzes some of the problems decisionmakers face in trying to get reliable, useful evaluation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 10 (1993), S. 399-427 
    ISSN: 1432-0541
    Keywords: Knapsack problems ; Computational geometry ; Convexity ; Dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study a variety of geometric versions of the classical knapsack problem. In particular, we consider the following “fence enclosure” problem: given a setS ofn points in the plane with valuesv i ≥ 0, we wish to enclose a subset of the points with a fence (a simple closed curve) in order to maximize the “value” of the enclosure. The value of the enclosure is defined to be the sum of the values of the enclosed points minus the cost of the fence. We consider various versions of the problem, such as allowingS to consist of points and/or simple polygons. Other versions of the problems are obtained by restricting the total amount of fence available and also allowing the enclosure to consist of at mostM connected components. When there is an upper bound on the length of fence available, we show that the problem is NP-complete. We also provide polynomial-time algorithms for many versions of the fence problem when an unrestricted amount of fence is available.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 8 (1992), S. 55-88 
    ISSN: 1432-0541
    Keywords: Shortest paths ; Voronoi diagrams ; Rectilinear paths ; Wire routing ; Fixed orientation metrics ; Continuous Dijkstra algorithm ; Computational geometry ; Extremal graph theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present an algorithm for computingL 1 shortest paths among polygonal obstacles in the plane. Our algorithm employs the “continuous Dijkstra” technique of propagating a “wavefront” and runs in timeO(E logn) and spaceO(E), wheren is the number of vertices of the obstacles andE is the number of “events.” By using bounds on the density of certain sparse binary matrices, we show thatE =O(n logn), implying that our algorithm is nearly optimal. We conjecture thatE =O(n), which would imply our algorithm to be optimal. Previous bounds for our problem were quadratic in time and space. Our algorithm generalizes to the case of fixed orientation metrics, yielding anO(nɛ−1/2 log2 n) time andO(nɛ−1/2) space approximation algorithm for finding Euclidean shortest paths among obstacles. The algorithm further generalizes to the case of many sources, allowing us to compute anL 1 Voronoi diagram for source points that lie among a collection of polygonal obstacles.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 8 (1992), S. 431-459 
    ISSN: 1432-0541
    Keywords: Link distance ; Shortest paths ; Motion planning ; Computational geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a set of nonintersecting polygonal obstacles in the plane, thelink distance between two pointss andt is the minimum number of edges required to form a polygonal path connectings tot that avoids all obstacles. We present an algorithm that computes the link distance (and a corresponding minimum-link path) between two points in timeO(Eα(n) log2 n) (and spaceO(E)), wheren is the total number of edges of the obstacles,E is the size of the visibility graph, and α(n) denotes the extremely slowly growing inverse of Ackermann's function. We show how to extend our method to allow computation of a tree (rooted ats) of minimum-link paths froms to all obstacle vertices. This leads to a method of solving the query version of our problem (for query pointst).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1572-9001
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Abstract Closo-1-Sn-2,3-[Si(CH3)3]2-2,3-C2B4H4 (1) reacts with 1,10-phenanthroline to form the complex 1-(C12H8N2)Sn-2, 3-[Si(CH3)3]2-2,3-C2B4H4. When crystals of this complex were grown slowly from benzene, a crystalline modification (2) was obtained in which the unit cell consisted of four identical molecules of the base-stannacarborane and six benzene molecules of solvation. When the complex was sublimed, a second crystalline modification (3) was obtained whose unit cell consisted of two crystaliographically different molecules (3-1 and3-2). In all three forms the tin was not symmetrically bonded to the carborane but was slipped toward the boron side of the C2B3 face, and the phenanthroline molecules were oriented opposite to the cage carbons so that the plane of the base and the carborane faces gave acute dihedral angles. However, the three forms showed a great deal of variation in the extent of slippage and the magnitudes of the base-carborane dihedral angles. Since these distortions are common structural features of base-group 14-carborane and cyclopentadienyl systems, MNDO-SCF molecular orbital calculations were carried out on the model compounds 1-(C12H8N2)Sn-2,3-C2B4H6, 1-[C10H8N2)Sn-2, 3-C2B9H11, and [(C10H8N2)-SnC5(CH3)5]+ to determine what factors dictate the structures of these complexes. The results showed that competing bonding interactions give rise to a very broad minimum in energy as a function of slippage and base orientation. Small energy variations, such as those produced by crystal packing forces, could produce large structural changes. Complex2 crystallizes in the monoclinic space group P21/n witha=11.096 (9) Å,b=26.51(2) Å,c=11.729 (7) Å,β=107.43 (6) ∘,U=3291 (4) Å3, andZ=4. Full-matrix least-squares analysis converged atR=0.044 andR w=0.055. Complex3 crystallizes in the triclinic space group P¯1 witha=10.251 (3) Å,b= 13.845(9) Å;c=19.168 (9) Å,α=71.12 (5) ∘,β=89.29 (3) ∘,γ=84.62 (4) ∘,U=2562 (2) Å3, andZ=4. The structure refined atR=0.079 andR w=0.125.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Hydrobiologia 253 (1993), S. 103-121 
    ISSN: 1573-5117
    Keywords: bacteria ; phosphorus ; phosphorus cycling in lakes ; sediments
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract Cycling of phosphorus (P) at the sediment/water interface is generally considered to be an abiotic process. Sediment bacteria are assumed to play only an indirect role by accelerating the transfer of electron from electron donors to electron acceptors, thus providing the necessary conditions for redox-and pH-dependent, abiotic sorption/desorption or precipitation/dissolution reactions. Results summarized in this review suggest that (1) in eutrophic lakes, sediment bacteria contain as much P as settles with organic detritus during one year (2) in oligotrophic lakes, P incorporated in benthic bacterial biomass may exceed the yearly deposition of bioavailable P several times (3) storage and release of P by sediment bacteria are redox-dependent processes (4) an appreciable amount of P buried in the sediment is associated with the organic fraction (5) sediment bacteria not only regenerate PO4, they also contribute to the production of refractory, organic P compounds, and (6) in oligotrophic lakes, a larger fraction of the P settled with organic detritus is converted to refractory organic compounds by benthic microorganisms than in eutrophic lakes. From this we conclude that benthic bacteria do more than just mineralize organic P compounds. Especially in oligotrophic lakes, they also may regulate the flux of P across the sediment/water interface and contribute to its terminal burial by the production of refractory organic P compounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1573-1111
    Keywords: Tetraazacyclopentadecane ; macrocyclic polyamine ; anion complexation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Abstract Complexation stoichiometries and formation constants of tri- and tetra-protonated forms of 1,4,8,12-tetraazacyclopentadecane with NO 3 − , Cl−, IO 3 − and SO 4 2− ions are determined by pH potentiometric and13C NMR spectrometric measurements. Estimates of ΔH and ΔS are obtained from the values of the temperature dependent formation constants and acid dissociation constants. All four anions form only 1 : 1 complexes with the triprotonated amine species. NO 3 − and Cl− form 1 : 1 complexes only with the tetraprotonated amine, while IO 3 − and SO 4 2− form both 1 : 1 and 2 : 1 complexes. The complexation behavior is interpreted in terms of solvation and internal hydrogen bonding interactions.
    Type of Medium: Electronic Resource
    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...