Results 271 to 280 of about 1,002,043 (319)
Some of the next articles are maybe not open access.
Journal of the American Chemical Society
Organic photovoltaics (OPVs) suffer from a trade-off between efficient charge transport and suppressed nonradiative recombination due to the aggregation-induced luminance quenching of organic semiconductors.
Yuandong Sun +14 more
semanticscholar +1 more source
Organic photovoltaics (OPVs) suffer from a trade-off between efficient charge transport and suppressed nonradiative recombination due to the aggregation-induced luminance quenching of organic semiconductors.
Yuandong Sun +14 more
semanticscholar +1 more source
Angewandte Chemie, 2019
Mechanoluminescence (ML) and room-temperature photophosphorescence (RTP) were achieved in polymorphisms of a triphenylamine derivate with ortho-substitution, respectively.
Jinfeng Wang +10 more
semanticscholar +1 more source
Mechanoluminescence (ML) and room-temperature photophosphorescence (RTP) were achieved in polymorphisms of a triphenylamine derivate with ortho-substitution, respectively.
Jinfeng Wang +10 more
semanticscholar +1 more source
Mathematical Programming, 1998
A clutter (V, E) packs if the smallest number of vertices needed to intersect all the edges (i.e. a minimum transversal) is equal to the maximum number of pairwise disjoint edges (i.e. a maximum matching). This terminology is due to Seymour 1977. A clutter is minimally nonpacking if it does not pack but all its minors pack.
Cornuéjols, Gérard +2 more
openaire +2 more sources
A clutter (V, E) packs if the smallest number of vertices needed to intersect all the edges (i.e. a minimum transversal) is equal to the maximum number of pairwise disjoint edges (i.e. a maximum matching). This terminology is due to Seymour 1977. A clutter is minimally nonpacking if it does not pack but all its minors pack.
Cornuéjols, Gérard +2 more
openaire +2 more sources
Proceedings of the VLDB Endowment, 2022
The Agglomerative Hierarchical Clustering (AHC) algorithm is widely used in real-world applications. As data volumes continue to grow, efficient scale-out techniques for AHC are becoming increasingly important. In this paper, we propose a Partition-based distributed Agglomerative Hierarchical Clustering (PACk) algorithm using novel distance-based ...
Yue Wang +3 more
openaire +1 more source
The Agglomerative Hierarchical Clustering (AHC) algorithm is widely used in real-world applications. As data volumes continue to grow, efficient scale-out techniques for AHC are becoming increasingly important. In this paper, we propose a Partition-based distributed Agglomerative Hierarchical Clustering (PACk) algorithm using novel distance-based ...
Yue Wang +3 more
openaire +1 more source
1998
A nice exposition of the problem of placing integers in the cells of a square array, well-chosen for the `Mathematical Entertainments' column edited by D. Gale.
openaire +1 more source
A nice exposition of the problem of placing integers in the cells of a square array, well-chosen for the `Mathematical Entertainments' column edited by D. Gale.
openaire +1 more source
NASAL PACKING: The Rubber Pneumatic Pack
Archives of Otolaryngology - Head and Neck Surgery, 1951An improved model of the rubber pneumatic nasal pack previously described1has been developed after 15 yr. of experience with nasal packing methods. The earlier model of the nasal pack (Fig. 1) was unavailable during World War II owing to the rubber shortage, and the present change was felt advisable when production was resumed.
openaire +2 more sources
A Pack Is Not a 'Pack' Is Not a Pack
JAMA: The Journal of the American Medical Association, 1985To the Editor.— Magazines and newspapers are now advertising a new type of cigarette pack, a 25s pack, instead of the traditional pack of 20 cigarettes. This new marketing concept is "for smokers who prefer the convenience of five more cigarettes per pack." If the 25s pack is accepted by the consumer and widely marketed by the industry, smoking risk ...
openaire +2 more sources
Randomly Packed and Solidly Packed Spheres
Canadian Journal of Mathematics, 1964In the classical packing problem unit spheres are placed without overlapping in D-dimensional space. When D = 2, the densest packing is a familiar regular arrangement of circles, each circle touching six others. In this packing, circles cover a fraction π/√12 = 0.9069 . . . of the area of the plane.
openaire +1 more source
2017
This chapter focuses on the famous cutting stock/bin packing problem which was the first problem to be modeled by column generation. The compact equivalent counterpart of this problem has a very interesting structure of a particular flow problem. Two other packing problems for which we may show compact extended formulations are the robust knapsack ...
Lancia G., Serafini P.
openaire +2 more sources
This chapter focuses on the famous cutting stock/bin packing problem which was the first problem to be modeled by column generation. The compact equivalent counterpart of this problem has a very interesting structure of a particular flow problem. Two other packing problems for which we may show compact extended formulations are the robust knapsack ...
Lancia G., Serafini P.
openaire +2 more sources