Performance evaluation of packing materials in the removal of hydrogen sulphide in gas-phase biofilters: Polyurethane foam, sugarcane bagasse, and coconut fibre

The main objective of this work was to investigate three packing materials (polyurethane foam, sugar-cane bagasse, and coconut fibre) for biofiltration of a gaseous mixture containing hydrogen sulphide (H(2)S). Mixed cultures were obtained from two sources, aerated submerged biofilters and activated sludge, and were utilised as inoculums. Biofilters reached 100% removal efficiency after two clays of operation. The empty bed residence time was 495 for each of the biofilters. The reactors were operated simultaneously, and the inlet concentrations of H(2)S varied between 184 and 644 ppmv during the long-term continuous operation of the biofilters (100 clays). Average removal efficiencies remained above 99.3%, taking into consideration the entire period of operation. Average elimination capacities reached by the biofilters packed with polyurethane foam, coconut fibre, and sugarcane bagasse were in the range of 17.8-66.6; 18.9-68.8, and 18.7-72.9g m(-3) h(-1), respectively. Finally, we concluded that the packing materials tested in this work are appropriate for the long-term biofiltration of hydrogen sulphide. (C) 2010 Elsevier B.V. All rights reserved.

Replacement of Trays by Packing To Increase the Absorption Capacity of Acetone during Cellulose Acetate Spinning

All textile uses of cellulose acetate involve acetone recovery, which, because of safety issues, results in large installations, in order to work with dilute streams. This compromises the efficiency of all of the involved unit operations, in this case, acetone absorption in cold water, acetone distillation, and water chilling, making them more expensive. The present article proposes the improvement of the absorption of acetone in water, traditionally performed with sieve trays, by using structured packing instead. The advantageous implementation was enabled through the utilization of a calculation methodology based on concepts of thermodynamic equilibrium of the binary acetone/water system and empirical relations that allow the evaluation of the hydrodynamics of the proposed modification.

Aluminum Concentrations in Water of Elderly People`s Houses and Retirement Homes and Its Relation with Elderly Health

The purpose of this study was to determine the concentrations of aluminum (Al) and other metals in water samples from elderly people`s houses and retirement homes. Forty-six duplicate water samples from kitchen taps were collected in Ribeiro Preto/SP, Brazil. Metal levels were measured by atomic absorption spectrophotometer. Aluminum concentration exceeded the maximum allowed values in 26% of samples according to the Decree 518/2004 of the Brazilian Health Ministry. It was noted that 11% of elderly living at monitored houses, as well as 19% living at retirement homes presented Alzheimer disease diagnostic. These results suggest taking into account Al risks among vulnerable elderly population groups.

Orthogonal packing of identical rectangles within isotropic convex regions

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. 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.

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes. Journal of the Operational Research Society (2010) 61, 306-320. doi: 10.1057/jors.2008.141 Published online 4 February 2009

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.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

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.

Effect of repeated disinfections by microwave energy on the physical and mechanical properties of denture base acrylic resins

The present study evaluated the effect of repeated simulated microwave disinfection on physical and mechanical properties of Clássico, Onda-Cryl and QC-20 denture base acrylic resins. Aluminum patterns were included in metallic or plastic flasks with dental stone following the traditional packing method. The powder/liquid mixing ratio was established according to the manufacturer's instructions. After water-bath polymerization at 74ºC for 9 h, boiling water for 20 min or microwave energy at 900 W for 10 min, the specimens were deflasked after flask cooling and finished. Each specimen was immersed in 150 mL of distilled water and underwent 5 disinfection cycles in a microwave oven set at 650 W for 3 min. Non-disinfected and disinfected specimens were subjected to the following tets: Knoop hardness test was performed with 25 g load for 10 s, impact strength test was done using the Charpy system with 40 kpcm, and 3-point bending test (flexural strength) was performed at a crosshead speed of 0.5 mm/min until fracture. Data were analyzed statistically by ANOVA and Tukey's test (α= 0.05%). Repeated simulated microwave disinfections decreased the Knoop hardness of Clássico and Onda-Cryl resins and had no effect on the impact strength of QC-20. The flexural strength was similar for all tested resins.

Influência de diferentes materiais de cobertura no conforto térmico de instalações para frangos de corte no oeste paulista

Este trabalho apresenta um estudo da influência de diferentes materiais de cobertura no conforto térmico de instalações destinadas à criação de frangos de corte. A pesquisa foi desenvolvida no Câmpus Experimental da UNESP de Dracena - SP. Quatro protótipos em escala real foram construídos, com área de 28 m² cada, cobertos com telha reciclada à base de embalagens longa vida, telha cerâmica, telha cerâmica pintada de branco e telha de fibrocimento. Os dados foram coletados durante o período de inverno de 2007, totalizando 90 dias. Com esses dados, foram calculados os índices de conforto térmico Carga Térmica Radiante (CTR) e a variável ambiental (Ta). Uma análise estatística por inferência e descritiva foi realizada com os valores do índice de conforto térmico e da variável ambiental. Com os resultados obtidos, é possível afirmar que a telha reciclada apresentou índices de conforto térmico semelhantes àqueles encontrados para as telhas cerâmicas. O protótipo coberto com telha de fibrocimento apresentou os maiores índices, e o coberto com telha cerâmica branca, os menores índices de conforto térmico. No entanto para o período de inverno e para os horários avaliados, todas as instalações apresentaram índices de conforto térmico fora da zona de termoneutralidade do frango de corte.

Evaluation of recycled tiles and OSB ceiling materials in closed broiler house prototypes

This study aimed at evaluating the thermal performance of a modular ceiling system for poultry houses. The reduced- and distorted-scale prototypes used ceiling modules made of reforested wood and were covered with recycled long-life package tiles. The following parameters were measured for 21 days: tile internal surface temperature (ST), globe temperature and humidity index (WBGT), and radiant heat load (RHL). Measurements were made at times of highest heat load (11:00 am, 13:00 pm, and 03:00 pm). Collected data were analyzed by "R" statistics software. Means were compared by multiple comparison test (Tukey) and linear regression was performed, both at 5% significance level. The results showed that the prototype with the ceiling was more efficient to reduce internal tile surface temperature; however, this was not sufficient to provide a comfortable environment for broilers during the growout. Therefore, other techniques to provide proper cooling are required in addition to the ceiling.

Structural properties of lipid reconstructs and lipid composition of normotensive and hypertensive rat vascular smooth muscle cell membranes

Multiple cell membrane alterations have been reported to be the cause of various forms of hypertension. The present study focuses on the lipid portion of the membranes, characterizing the microviscosity of membranes reconstituted with lipids extracted from the aorta and mesenteric arteries of spontaneously hypertensive (SHR) and normotensive control rat strains (WKY and NWR). Membrane-incorporated phospholipid spin labels were used to monitor the bilayer structure at different depths. The packing of lipids extracted from both aorta and mesenteric arteries of normotensive and hypertensive rats was similar. Lipid extract analysis showed similar phospholipid composition for all membranes. However, cholesterol content was lower in SHR arteries than in normotensive animal arteries. These findings contrast with the fact that the SHR aorta is hyporeactive while the SHR mesenteric artery is hyperreactive to vasopressor agents when compared to the vessels of normotensive animal strains. Hence, factors other than microviscosity of bulk lipids contribute to the vascular smooth muscle reactivity and hypertension of SHR. The excess cholesterol in the arteries of normotensive animal strains apparently is not dissolved in bulk lipids and is not directly related to vascular reactivity since it is present in both the aorta and mesenteric arteries. The lower cholesterol concentrations in SHR arteries may in fact result from metabolic differences due to the hypertensive state or to genes that co-segregate with those that determine hypertension during the process of strain selection.

Using sentinels to detect intersections of convex and nonconvex polygons

We describe finite sets of points, called sentinels, which allow us to decide if isometric copies of polygons, convex or not, intersect. As an example of the applicability of the concept of sentinel, we explain how they can be used to formulate an algorithm based on the optimization of differentiable models to pack polygons in convex sets. Mathematical subject classification: 90C53, 65K05.