Decontamination of pesticide packing using ionizing radiation

The Brazilian agriculture activities have consumed about 288,000 tons of pesticides per year conditioned in about 107,000,000 packing with weight of approximately 23,000 tons. The discharge of empty plastic packing of pesticides can be an environmental concern causing problems to human health, animals, and plants if done without inspection and monitoring. The objective of this work is to study the ionizing radiation effect in the main pesticides used in Brazil for plastic packing decontamination. Among the commercial pesticides, chlorpyrifos has significant importance because of its wide distribution and extensive use and persistence. The radiation-induced degradation of chlorpyrifos in liquid samples and in polyethylene pack was studied by gamma radiolysis. Packing of high-density polyethylene (HDPE) three layer coextruded, named COEX, contaminated with chlorpyrifos, were irradiated using both a multipurpose Co-60 gamma irradiator and a gamma source with 5000 Ci total activity Gamma cell type. The chemical analysis of the chlorpyrifos was made using a gas chromatography associated to the Mass Spectrometry—GCMS from Shimadzu Model QP 5000. Gamma radiation was efficient for removing chlorpyrifos from the plastic packing, in all studied cases.     

Reliability study of super-ellipsoid DEM in representing the packing structure of blast furnace

In industrial blast furnaces (BFs), the investigations involving the flow behaviors of particles and the resultant burden structure are essential to optimize its operation stability and energy consumption. With the advance of computing capability and mathematical model, the discrete element method (DEM) specialized in characterizing particle behavior has manifested its power in the investigation of BFs. In the framework of DEM, many particle models have been developed, but which model is more suitable for simulating the particle behaviors of BFs remains a question because real particles in BFs have large shape and size dispersity. Among these particle models, the super-ellipsoid model possesses the ability to change shape flexibly. Therefore, the focus of this study is to investigate whether the super-ellipsoid model can meet the requirement of authenticity and accuracy in simulating the behaviors of particles with large shape and size dispersity. To answer this question, a simplified BF charging system composed of a hopper and a storage bin is established. The charging process and the final packing structure are analyzed and compared between experiments and simulations with different shape indexes. The results show that super-ellipsoid particles have prominent advantages over spherical particles in terms of representing the real BF particles, and it can more reasonably reproduce the flow behaviors and packing structure of experimental particles. The computation cost of super-ellipsoid particles is also acceptable for engineering applications. Finally, the micro-scale characteristics of packing structure is analyzed and the single-ring charging process in industry-scale BF using super-ellipsoid particles is conducted.     

Optimal orientation field to manufacture magnetostrictive composites with high magnetostrictive performance

Magnetostrictive properties have relationship with the applied orientation field during the preparation of giant magnetostrictive composites. To understand the dependence of the optimal orientation field on particle volume fraction, composites with 20%, 30% and 50% particles by volume were fabricated by distributing Terfenol-D particles in an unsaturated polyester resin under various orientation fields. Their magnetostrictive properties were tested without pre-stress at room temperature. The results indicate that as the particle volume fraction increases, the optimal orientation field increases. The main reason for this phenomenon is the packing density for the composites with higher particle volume fraction is larger than that for those with lower particle content.     

ON TAYLOR'S CONJECTURE ABOUT THE PACKING MEASURES OF CARTESIAN PRODUCT SETS

1.IntroductionInthegeometryoffractals,Hausdorffmeasurealiddimensionplayaveryimportantrole.Olltheotherhand,therecelltilltroductionofpackingmeasureshasledtoagreaterunderstandillgofthegeometrictheoryoffractals,aspackingmeasuresbehaveillawnythatis'dual'toHausdoofmeasure8inmanyrespectsl2].Forexample,denotingHausdorffdimellsionandpackingdimensionbydimandDimrespectively,wehavedim(ExF)2dimE dimF,whileDim(ExF)5DimE DimF.Itiswell-kllowenthatifECRm,FCR",thenH(ExFW1T2)2b'H((E,W1)H(FW2)forsome…     

Integral decomposition in polyhedra

We say that a polyhedronP satisfies weak integral decomposition if whenever an integral vector is the sum ofk vectors inP it is also the sum ofk integral vectors inP. This property is related to rounding results for packing and covering problems. We study the property and two related properties, and give results concerning integral polymatroids, totally unimodular matrices and network flows, pairs of strongly-base-orderable matroids, and branchings in directed graphs.     

A MIP approach for some practical packing problems: Balancing constraints and tetris-like items

This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is quite frequent in space engineering and a real-world application deals with the Automated Transfer Vehicle project (funded by the European Space Agency), at present under development. A Mixed Integer Programming (MIP) approach is proposed. The three-dimensional single bin packing problem is considered. It consists of orthogonally placing, with possibility of rotation, the maximum number of parallelepipeds into a given parallelepiped. A MIP formulation of the problem is reported together with a MIP-based heuristic approach. Balancing conditions are furthermore examined, as well as the orthogonal placement (with rotation) of tetris-like items into a rectangular domain.Received: September 2003, Revised: February 2004, AMS classification: 90B99, 05B40, 90C90, 90C59Thanks are due to T. A. Ciriani for the important suggestions given for the whole paper and to S. Gliozzi (IBM, Business Consulting Services) for the significant support offered, in particular in discussing the topics presented in Sect. 2.1.     

The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds

This paper is the second of a two part series and describes new lower and upper bounds for a more general version of the Two-Dimensional Finite Bin Packing Problem (2BP) than the one considered in Part I (see Boschetti and Mingozzi 2002). With each item is associated an input parameter specifying if it has a fixed orientation or it can be rotated by . This problem contains as special cases the oriented and non-oriented 2BP. The new lower bound is based on the one described in Part I for the oriented 2BP. The computational results on the test problems derived from the literature show the effectiveness of the new proposed lower and upper bounds.     

Packing and covering with linear programming: A survey

This paper considers the polyhedral results and the min–max results on packing and covering problems of the decade. Since the strong perfect graph theorem (published in 2006), the main such results are available for the packing problem, however there are still important polyhedral questions that remain open. For the covering problem, the main questions are still open, although there has been important progress. We survey some of the main results with emphasis on those where linear programming and graph theory come together. They mainly concern the covering of cycles or dicycles in graphs or signed graphs, either with vertices or edges; this includes the multicut and integral multiflow problems.     

Solving the pallet loading problem

This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90° so long as they are placed with edges parallel to the pallet’s edges. The set of all PLP instances with an area ratio (pallet area divided by box area) less than 101 boxes can be represented by 3,080,730 equivalent classes. Our G5-heuristic finds optimal solutions to 3,073,724 of these 3,080,730 classes and in the remaining 7006 classes only differs from the best known bound by one box. We develop three other heuristics that solve another 54 instances. Finally, we solve the 6952 remaining classes with our exact HVZ algorithm. Only a subset of these classes has been solved previously.