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
  • 2000-2004  (14)
  • 1990-1994  (17)
  • 1985-1989  (10)
  • 1945-1949  (4)
  • 1
    Electronic Resource
    Electronic Resource
    An efficient algorithm for solving a special class of LP's (1986)
    Springer
    Computing 37 (1986), S. 219-226 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir betrachten Lineare Programme der Form {maxcx|1≤Ax≤b,L≤x≤U} mit nichtnegativen Vektorenl,b,L,U und einer 0–1 MatrixA, die von “Manhattan Skyline” Form ist, d. h. der Träger jeder Zeile vonA ist im Träger jeder folgenden Zeile enthalten. Wir stellen einenO(nm+nlogn)-Algorithmus zur Lösung solcher Probleme vor und untersuchen seinen Anwendungsbereich.
    Notes: Abstract We consider LP's of the form max {cx|l≤Ax≤b, L≤x≤U} where,l,b,L,U are nonnegative andA is a 0–1 matrix which looks like “Manhattan Skyline”, i.e. the support of each row is contained in the support of every subsequent row. AnO(nm+nlogn) algorithm is presented for solving the problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252513
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The Shapley value for cooperative games under precedence constraints (1992)
    Springer
    International journal of game theory 21 (1992), S. 249-266 
    Details
    ISSN: 1432-1270
    Keywords: Cooperative Game ; Shapley Value ; Precedence Constraint ; Marginal Contribution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Cooperative games are considered where only those coalitions of players are feasible that respect a given precedence structure on the set of players. Strengthening the classical symmetry axiom, we obtain three axioms that give rise to a unique Shapley value in this model. The Shapley value is seen to reflect the expected marginal contribution of a player to a feasible random coalition, which allows us to evaluate the Shapley value nondeterministically. We show that every exact algorithm for the Shapley value requires an exponential number of operations already in the classical case and that even restriction to simple games is #P-hard in general. Furthermore, we outline how the multi-choice cooperative games of Hsiao and Raghavan can be treated in our context, which leads to a Shapley value that does not depend on pre-assigned weights. Finally, the relationship between the Shapley value and the permission value of Gilles, Owen and van den Brink is discussed. Both refer to formally similar models of cooperative games but reflect complementary interpretations of the precedence constraints and thus give rise to fundamentally different solution concepts.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01258278
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Matroid matching in pseudomodular lattices (1989)
    Springer
    Combinatorica 9 (1989), S. 145-152 
    Details
    ISSN: 1439-6912
    Keywords: 05 B 35
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The matroid matching problem (also known as matroid parity problem) has been intensively studied by several authors. Starting from very special problems, in particular the matching problem and the matroid intersection problem, good characterizations have been obtained for more and more general classes of matroids. The two most recent ones are the class of representable matroids and, later on, the class of algebraic matroids (cf. [4] and [2]). We present a further step of generalization, showing that a good characterization can also be obtained for the class of socalled pseudomodular matroids, introduced by Björner and Lovász (cf. [1]). A small counterexample is included to show that pseudomodularity still does not cover all matroids that behave well with respect to matroid matching.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02124676
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Optimization and optimality test for the Max-Cut Problem (1990)
    Springer
    Mathematical methods of operations research 34 (1990), S. 195-206 
    Details
    ISSN: 1432-5217
    Keywords: Max-cut ; decision problem ; optimization problem ; polynomial transformation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Wir zeigen, daß folgende Probleme polynomial äquivalent sind: 1) Gegeben ein (gewichteter) GraphG, ein cutC vonG. Entscheide obC optimal ist oder nicht. 2) Gegeben ein (gewichteter) GraphG, ein cutC vonG. Entscheide, obC optimal ist oder nicht, und falls nicht, finde einen besseren cutC′. Eine Konsequenz hiervon ist, wie wir sehen werden, daß ein Optimalitätstest Orakel einen polynomialen Algorithmus zur approximativen Lösung von Max Cut Problemen liefert. Insbesondere folgt, daß das Erkennen von maximalen cuts in ungewichteten Graphen NP-schwer ist.
    Notes: Abstract We show that the following two problems are polynomially equivalent: 1) Given a (weighted) graphG, and a cutC ofG, decide whetherC is maximal or not. 2) Given a (weighted) graphG, and a cutC ofG, decide whetherC is maximal or not, and in case it is not, find a better solutionC′. As a consequence, an optimality testing oracle may be used to design a polynomial time algorithm for approximately solving the (weighted) Max-Cut Problem. This in turn implies that recognizing optimal cuts in an unweighted graph is NP-hard.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01415982
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Some order dimension bounds for communication complexity problems (1991)
    Springer
    Acta informatica 28 (1991), S. 593-601 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary We associate with a general (0, 1)-matrixM an ordered setP(M) and derive lower and upper bounds for the deterministic communication complexity ofM in terms of the order dimension ofP(M). We furthermore consider the special class of communication matricesM obtained as cliques vs. stable sets incidence matrices of comparability graphsG. We bound their complexity byO((logd)·(logn)), wheren is the number of nodes ofG andd is the order dimension of an orientation ofG. In this special case, our bound is shown to improve other well-known bounds obtained for the general cliques vs. stable set problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01463947
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Die Beschleunigung der Polymerisation ungesättigter Verbindungen mit Hilfe von Redoxsystemen (1949)
    Weinheim : Wiley-Blackwell
    Zeitschrift für die chemische Industrie 61 (1949), S. 471-474 
    Details
    ISSN: 0044-8249
    Keywords: Chemistry ; General Chemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: Die Polymerisation ungesättigter Verbindungen kann u. a. durch Peroxyde ausgelöst werden. Zusatz von Reduktionsmitteln wirkt beschleunigend, wie vor etwa 10 Jahren zuerst in Deutschland gefunden wurde. Dieses Redox-Polymerisationsverfahren ist von großer wissenschaftlicher und technischer Bedeutung.
    Additional Material: 3 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/ange.19490611203
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Low-Pressure chemical vapour deposition of tantalum pentoxide films for ulsi devices using tantalum pentaethoxide as precursor (1992)
    New York, NY [u.a.] : Wiley-Blackwell
    Advanced Materials for Optics and Electronics 1 (1992), S. 299-308 
    Details
    ISSN: 1057-9257
    Keywords: LPCVD ; Tantalum pentoxide ; High dielectric constant ; ULSI devices ; Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Physics
    Notes: A laminar flow low-pressure chemical vapour deposition (LPCVD) system (LAM IntegrityTM) has been used to deposit tantalum pentoxide (Ta2O5) from Ta(OEt)5 films in the presence of oxygen (O2) at 470 °C at a typical deposition rate of 4 nm min-1. Uniformities of 〈1.5% (SD 1σ) over a 150 mm silicon substrate were obtained. The layers were annealed under different conditions. It was discovered that the films did not change their stoichiometry as determined by Rutherford backscattering (RBS). The as-deposited films were amorphous but became crystalline (β-Ta2O5) at temperatures 〉 700 °C. The transmission electron microscopy (TEM) results on crystallisation behaviour were supported by X-ray diffraction data. The electrical properties of the Ta2O5 films have been characterised using MIS (metal/insulator/silicon) capacitor structures. Leakage values of 〈10-6 A cm-2 at 6 MV cm-1 equivalent applied electric field and breakdown strengths of 〉7 MV cm-1 at 1.6 μA were obtained for annealed layers. Compound dielectric constants (native silicon oxide thickness of about 2.5 nm plus Ta2O5 of various thicknesses) between 14 and 〉30 have been measured. The electrical properties reveal the potential use of Ta2O5 as a storage capacitor dielectric in 64 and 256 Mbit DRAM (dynamic random access memory) devices.
    Additional Material: 13 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/amo.860010607
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Über das Vorkommen von Chrysen in Erde (1947)
    New York, NY : Wiley-Blackwell
    Helvetica Chimica Acta 30 (1947), S. 1595-1599 
    Details
    ISSN: 0018-019X
    Keywords: Chemistry ; Organic Chemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/hlca.19470300624
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    facet.materialart.
    Unknown
    Acute myeloid leukemias with reciprocal rearrangements can be distinguished by specific gene expression profiles (2002)
    National Academy of Sciences
    Details
    Publication Date: 2002-07-08
    Print ISSN: 0027-8424
    Electronic ISSN: 1091-6490
    Topics: Biology , Medicine , Natural Sciences in General
    Published by National Academy of Sciences
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    Measurements of Behavior and Mobility of Polyatomic Ions (1949)
    American Physical Society
    Details
    Publication Date: 1949-03-01
    Print ISSN: 0031-899X
    Electronic ISSN: 1536-6065
    Topics: Physics
    Published by American Physical Society
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...