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
  • Articles  (58)
  • Springer  (31)
  • Oxford University Press  (27)
  • 2015-2019  (46)
  • 1985-1989  (12)
  • Computer Science  (58)
Collection
  • Articles  (58)
Years
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 42 (1988), S. 327-345 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Most large-scale optimization problems exhibit structures that allow the possibility of attack via algorithms that exhibit a high level of parallelism. The emphasis of this paper is the development of parallel optimization algorithms for a class of convex, block-structured problems. Computational experience is cited for some large-scale problems arising from traffic assignment applications. The algorithms considered here have the property that they allow such problems to be decomposed into a set of smaller optimization problems at each major iteration. These smaller problems correspond to linear single-commodity networks in the traffic assignment case, and they may be solved in parallel. Results are given for the distributed solution of such problems on the CRYSTAL multicomputer.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 38 (1987), S. 341-345 
    ISSN: 1436-5057
    Keywords: Approximation ; n-dimensional grid
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein Verfahren zur Bestimmung einer Translation eines rechtwinkeligen Gitters mit der Eigenschaft, daß eine endliche Punktmenge des ℝN möglichst gut durch Gitterpunkte approximiert wird, angegeben.
    Notes: Abstract A procedure is given for translating a rectangular grid in such a way that a finite set of points in ℝN is approximated as good as possible by points of the translated grid.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computing 40 (1988), S. 75-83 
    ISSN: 1436-5057
    Keywords: 64Z8 ; Boundary value problems ; multiple shooting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein einfaches Iterationsverfahren vorgeschlagen, um die Lösung für eine gewisse Klasse von gewöhnlichen Randwertproblemen zu berechnen. Es ist auf solche Probleme anwendbar, die sich mit Hilfe der Greenschen Funktion in ein kontrahierendes Fixpunkt-Problem transformieren lassen. Es ist dem Mehrziel-Verfahren ähnlich, aber wesentlich einfacher.
    Notes: Abstract A simple iterative procedure is proposed for calculating the solution of a certain class of boundary value problems for ordinary differential equations. It works if the equation can be transformed into a contracting fixed point problem by means of a Green's function. It is similar to multiple shooting but much simpler.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 19 (1986), S. 13-28 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Paul and Reischuk devised space efficient simulations of logarithmic cost random access machines and multidimensional Turing machines. We simplify their general space reduction technique and extend it to other computational models, including pointer machines, which model computations on graphs and data structures. Every pointer machine of time complexityT(n) can be simulated by a pointer machine of space complexityO(T(n)/logT(n)).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 2 (1986), S. 278-290 
    ISSN: 1432-2315
    Keywords: Color science ; Computer graphics ; Human factors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The principles of tristimulus colorimetry are presented in tutorial fashion. The classic color matching experiments are described with an emphasis on the assumptions that are implicit in these tests and on the units of measure which should be used to record the results. The transformation to alternative sets of primaries is derived and the geometry of the resulting color spaces is illustrated. An annotated bibliography of relevant literature is also provided.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 40 (1988), S. 205-212 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Adaptive relaxation algorithms use anti-jamming schemes that require either a large amount of computation or a large amount of memory. In this paper we present a non-adaptive approach that possesses substantial cómputational and memory advantages over the adaptive schemes. The approach uses averaging and may be applied whenever the relaxation algorithm's point-to-set maps satisfy appropriate assumptions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Distributed computing 3 (1989), S. 130-145 
    ISSN: 1432-0452
    Keywords: Denotational semantics ; True concurrency ; Smyth powerdomain of streams
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a variety of denotational linear time semantics for a language with recursion and “true” concurrency in a form of synchronous co-operation, which in the literature is known as step semantics. We show that this can be done by a generalization of known results for interleaving semantics. A general method is presented to define semantical operators and denotational semantics in the Smyth powerdomain of streams. With this method, first a naive and then more sophisticated semantics for synchronous co-operation are developed, which include such features as interleaving and synchronization. Then we refine the semantics to deal with a bounded number of processors, subatomic actions, maximal parallelism and a real-time operator. Finally, it is indicated how to apply these ideas to branching-time models, where it becomes possible to analyze deadlock behaviour as well as a form of “true” concurrency.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract The “pharmacological dogma” that competitive antagonists cause parallel shifts to the right with sustained maximum effect of semi-logarithmic concentration-response curves of exogenous agonists may not be true if an endogenous agonist is present in the preparation. In this case, the antagonist and the exogenous agonist interfere in a complex way with an existing circuit of regulation between the response and the endogenous agonist. In consequence, it is difficult to determine the true shift in the concentration-response curves as induced by the antagonist, since a deviation of the curves in a non-parallel manner can be observed. The extent of this deviation may be used to learn more about the variables involved. The present paper discusses this phenomenon: The regulatory circuit of the (auto)receptor modulated release of neutrotransmitters is used as an example. Paired samples of data are analysed in this example. Since the extent of the non-parallel deviation also depends on the manner in which the paired samples are mathematically linked, two different ways of data evaluation have been used. A theoretical model of the relation between receptor activation and response is proposed which allows to evaluate experimental concentration-response curves by means of non-linear regression analysis. This evaluation yields quantitative information on the parameters of the regulatory circuit: the concentration of the endogenous agonist, itsK D value and the true shift of the concentration-response curve caused by the applied antagonist.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Acta informatica 24 (1987), S. 491-511 
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary Two denotational semantics for a language with simple concurrency are presented. The language has parallel composition in the form of the shuffle operation, in addition to the usual sequential concepts including full recursion. Two linear time models, both involving sets of finite and infinite streams, are given. The first model is order-theoretic and based on the Smyth order. The second model employs complete metric spaces. Various technical results are obtained relating the order-theoretic and metric notions. The paper culminates in the proof that the two semantics for the language considered coincide. The paper completes previous investigations of the same language, establishing the equivalence of altogether four semantic models for it.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2015-05-17
    Description: Spatial variations in the distribution and composition of populations inform urban development, health-risk analyses, disaster relief, and more. Despite the broad relevance and importance of such data, acquiring local census estimates in a timely and accurate manner is challenging because population counts can change rapidly, are often politically charged, and suffer from logistical and administrative challenges. These limitations necessitate the development of alternative or complementary approaches to population mapping. In this paper we develop an explicit connection between telecommunications data and the underlying population distribution of Milan, Italy. We go on to test the scale invariance of this connection and use telecommunications data in conjunction with high-resolution census data to create easily updated and potentially real time population estimates in time and space.
    Electronic ISSN: 2193-1127
    Topics: Computer Science
    Published by Springer
    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...