Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Packing a trunk : a physically based approach with full motional freedom

Geometric packing problems may be formulated mathematically as constrained optimization problems. But finding a good solution is a challenging task. The more complicated the geometry of the container or the objects to be packed, the more complex the non-penetration constraints become. In this work we propose the use of a physics engine that simulates a system of colliding rigid bodies. It is a tool to resolve interpenetration conflicts and to optimize configurations locally. We develop an efficient and easy-to-implement physics engine that is specialized for collision detection and contact handling. In succession of the development of this engine a number of novel algorithms for distance calculation and intersection volume were designed and imple- mented, which are presented in this work. They are highly specialized to pro- vide fast responses for cuboids and triangles as input geometry whereas the concepts they are based on can easily be extended to other convex shapes. Especially noteworthy in this context is our ε-distance algorithm - a novel application that is not only very robust and fast but also compact in its im- plementation. Several state-of-the-art third party implementations are being presented and we show that our implementations beat them in runtime and robustness. The packing algorithm that lies on top of the physics engine is a Monte Carlo based approach implemented for packing cuboids into a container described by a triangle soup. We give an implementation for the SAE J1100 variant of the trunk packing problem. We compare this implementation to several established approaches and we show that it gives better results in faster time than these existing implementations.

Automatic grading and packing of prawns

Prawns are a substantial Australian resource but presently are processed in a very labour-intensive manner. A prototype system has been developed for automatically grading and packing prawns into single-layer 'consumer packs' in which each prawn is approximately straight and has the same orientation. The novel technology includes a machine vision system that has been specially programmed to calculate relevant parameters at high speed and a gripper mechanism that can acquire, straighten and place prawns of various sizes. The system can be implemented on board a trawler or in an onshore processing facility. © 1993.

Pentacene on Ni(111): room-temperature molecular packing and temperature-activated conversion to graphene

We investigate, using scanning tunnelling microscopy, the adsorption of pentacene on Ni(111) at room temperature and the behaviour of these monolayer films with annealing up to 700 °C. We observe the conversion of pentacene into graphene, which begins from as low as 220 °C with the coalescence of pentacene molecules into large planar aggregates. Then, by annealing at 350 °C for 20 minutes, these aggregates expand into irregular domains of graphene tens of nanometers in size. On surfaces where graphene and nickel carbide coexist, pentacene shows preferential adsorption on the nickel carbide phase. The same pentacene to graphene transformation was also achieved on Cu(111), but at a higher activation temperature, producing large graphene domains that exhibit a range of moiré superlattice periodicities.

Synthesis and characterisation of heterometallic molecular triangles using ambidentate linker: self-selection of a single linkage isomer

The coordination driven self-assembly of discrete molecular triangles from a non-symmetric ambidentate linker 5-pyrimidinecarboxylate (5-pmc) and Pd(II)/Pt(II) based 90◦ acceptors is presented. Despite the possibility of formation of a mixture of isomeric macrocycles (linkage isomers) due to different connectivity of the ambidentate linker, formation of a single and symmetrical linkage somer in both the cases is an interesting observation. Moreover, the reported macrocycles represent the first example of discrete metallamacrocycles of bridging 5-pmc. While solution composition in both the cases was characterised by multinuclear NMR study and electrospray ionization mass spectrometry (ESI-MS), the identity of the assemblies in the solid state was established by X-ray single crystals structure analysis. Variable temperature NMR study clearly ruled out the formation of any other macrocycles by [4 + 4] or [2 + 2] self-assembly of the reacting components.

Hantzsch 1,4-dihydropyridine esters and analogs: candidates for generating reproducible one-dimensional packing motifs

Examination of the symmetric Hantzsch 1,4-dihydropyridine ester derivatives of the prototypical nifedipine molecule indicates the tendency of this class of molecule to form a common packing motif. Crystal structure analysis of 2,6-dimethyl-1,4-dihydropyridine-3,5-dicarboxylic diesters and analogs reveals that they form extended chains, characterized as the C(6) packing motif, via intermolecular (amine) N-H...O=C (C3,C5 carbonyl) hydrogen bonds. In addition, all the prepared derivatives also satisfy the basic structural requirements for their high binding efficiency to the receptor. The reproducible C(6) packing motif observed among these compounds has a use in the design of solid-state materials.

Parallel packing of alpha-helices in crystals of the zervamicin IIA analog Boc-Trp-Ile-Ala-Aib-Ile-Val-Aib-Leu-Aib-Pro-OMe.2H2O.

An apolar synthetic analog of the first 10 residues at the NH2-terminal end of zervamicin IIA crystallizes in the triclinic space group P1 with cell dimensions a = 10.206 +/- 0.002 A, b = 12.244 +/- 0.002 A, c = 15.049 +/- 0.002 A, alpha = 93.94 +/- 0.01 degrees, beta = 95.10 +/- 0.01 degrees, gamma = 104.56 +/- 0.01 degrees, Z = 1, C60H97N11O13 X 2H2O. Despite the relatively few alpha-aminoisobutyric acid residues, the peptide maintains a helical form. The first intrahelical hydrogen bond is of the 3(10) type between N(3) and O(0), followed by five alpha-helix-type hydrogen bonds. Solution 1H NMR studies in chloroform also favor a helical conformation, with seven solvent-shielded NH groups. Continuous columns are formed by head-to-tail hydrogen bonds between the helical molecules along the helix axis. The absence of polar side chains precludes any lateral hydrogen bonds. Since the peptide crystallizes with one molecule in a triclinic space group, aggregation of the helical columns must necessarily be parallel rather than antiparallel. The packing of the columns is rather inefficient, as indicated by very few good van der Waals' contacts and the occurrence of voids between the molecules.

Packing for East Transport Artworks

Digital Image

Harvesting, packing, postharvest technology, transport and processing

This chapter provides updated information on avocado fruit quality parameters, sensory perception and maturity, production and postharvest factors affecting quality defects, disinfestation and storage (including pre-conditioning), predicting outturn quality and processing.

Orange Packing

Digital image

Central Packing - Rehovoth

Digital image