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
  • 1
    ISSN: 1520-5835
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Macromolecules 24 (1991), S. 3388-3394 
    ISSN: 1520-5835
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Macromolecules 26 (1993), S. 5209-5212 
    ISSN: 1520-5835
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 61 (1993), S. 1-18 
    ISSN: 1436-4646
    Keywords: Combinatorial optimization ; (0, 1) matrices ; integrality of polyhedra
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A (0, 1) matrix is linear if it does not contain a 2×2 submatrix of all ones. In this paper we give polynomial algorithms to test whether a linear matrix is balanced or perfect. The algorithms are based on decomposition results previously obtained by the authors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 35-47 
    ISSN: 1436-4646
    Keywords: Perfect matrices ; balanced matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we define wheel matrices and characterize some properties of matrices that are perfect but not balanced. A consequence of our results is that if a matrixA is perfect then we can construct a polynomial number of submatricesA I,⋯,A n ofA such thatA is balanced if and only if all the submatricesA 1,⋯,A n ofA are perfect. This implies that if the problem of testing perfection is polynomially solvable, then so is the problem of testing balancedness.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 129-168 
    ISSN: 1436-4646
    Keywords: Polyhedral combinatorics ; integrality of polytopes ; decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Claude Berge defines a (0, 1) matrix A to be linear ifA does not contain a 2 × 2 submatrix of all ones.A(0, 1) matrixA is balanced ifA does not contain a square submatrix of odd order with two ones per row and column. The contraction of a rowi of a matrix consists of the removal of rowi and all the columns that have a 1 in the entry corresponding to rowi. In this paper we show that if a linear balanced matrixA does not belong to a subclass of totally unimodular matrices, thenA orA T contains a rowi such that the submatrix obtained by contracting rowi has a block-diagonal structure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 49-70 
    ISSN: 1436-4646
    Keywords: Equipartition polytope ; cut polytope ; Boolean quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The following basic clustering problem arises in different domains, ranging from physics, statistics and Boolean function minimization. Given a graphG = (V, E) and edge weightsc e , partition the setV into two sets of ⌈1/2|V|⌉ and ⌊1/2|V|⌋ nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized. Anequicut is a feasible solution of the above problem and theequicut polytope Q(G) is the convex hull of the incidence vectors of equicuts inG. In this paper we give some integer programming formulations of the equicut problem, study the dimension of the equicut polytope and describe some basic classes of facet-inducing inequalities forQ(G).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 71-90 
    ISSN: 1436-4646
    Keywords: Equipartition polytope ; cut polytope ; Boolean quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Theequipartition problem is defined as follows: given a graphG = (V, E) and edge weightsc e , partition the setV into two sets of ⌈1/2|V|⌉ and ⌊1/2|V|⌋ nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized. Anequicut is a feasible solution of the above problem and theequicut polytope Q(G) is the convex hull of the incidence vectors of equicuts inG. In this paper we describe some facet inducing inequalities of this polytope.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 77 (1993), S. 305-322 
    ISSN: 1573-2878
    Keywords: Newton method ; unconstrained optimization ; asynchronous parallel algorithms ; parallel computation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new approach to the solution of unconstrained optimization problems is introduced. It is based on the exploitation of parallel computation techniques and in particular on an asynchronous communication model for the data exchange among concurrent processes. The proposed approach arises by interpreting the Newton method as being composed of a set of iterative and independent tasks that can be mapped onto a parallel computing system for the execution. Numerical experiments on the resulting algorithm have been carried out to compare parallel versions using synchronous and asynchronous communication mechanisms in order to assess the benefits of the proposed approach on a variety of parallel computing architectures. It is pointed out that the proposed asynchronous Newton algorithm is preferable for medium and large-scale problems, in the context of both distributed and shared memory architectures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Bognor Regis [u.a.] : Wiley-Blackwell
    Journal of Polymer Science Part B: Polymer Physics 30 (1992), S. 1261-1271 
    ISSN: 0887-6266
    Keywords: sorption of gas in glassy polymers, compressible lattice model for ; glassy polymers, lattice compressibility and gas sorption thermodynamics in ; lattice models for gas sorption thermodynamics in glassy polymers ; Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Physics
    Notes: A compressible lattice model with holes, the glassy polymer lattice sorption model (GPLSM), was used to model the sorption of carbon dioxide, methane, and ethylene in glassy polycarbonate and carbon dioxide in glassy tetramethyl polycarbonate. For glassy polymers, an incompressible lattice model, such as the Flory-Huggins theory, requires concentration-dependent and physically unrealistic values for the lattice site volumes in order to satisfy lattice incompressibility. Rather than forcing lattice incompressibility, GPLSM was used and reasonable parameter values were obtained. The effect of conditioning on gas sorption in glassy polymers was analyzed quantitatively with GPLSM. The Henry's law constant decreases significantly upon gas conditioning, reflecting changes in the polymer matrix at infinite dilution. Treating the Henry's law constant as a hypothetical vapor pressure at infinite dilution, gas molecules in the conditioned polymer are less “volatile” than those in the unconditioned polymer. Flory-Huggins theory was used to model the sorption of carbon dioxide, methane, and ethylene in silicone rubber. Above the glass transition temperature, the criterion of lattice incompressibility for Flory-Huggins theory was satisfied with physically realistic and constant values for the lattice site volumes. © 1992 John Wiley & Sons, Inc.
    Additional Material: 13 Ill.
    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...