Surgical planning for resection of an ameloblastoma and reconstruction of the mandible using a selective laser sintering 3D biomodel

Ameloblastoma is a benign locally aggressive infiltrative odontogenic lesion. It is characterized by slow growth and painless swelling. The treatment for ameloblastoma varies from curettage to en bloc resection, and the reported recurrence rates after treatment are high; the safety margin of resection is important to avoid recurrence. Advances in technology brought about great benefits in dentistry; a new generation of computed tomography scanners and 3-dimensional images enhance the surgical planning and management of maxillofacial tumors. The development of new prototyping systems provides accurate 3D biomodels on which surgery can be simulated, especially in cases of ameloblastoma, in which the safety margin is important for treatment success. A case of mandibular follicular ameloblastoma is reported where a 3D biomodel was used before and during surgery.

Short report: Historical analysis of a near disaster: Anopheles gambiae in Brazil

Attributed to human-mediated dispersal, a species of the Anopheles gambiae complex invaded northeastern Brazil in 1930. This event is considered unique among the intercontinental introductions of disease vectors and the most serious one: ""Few threats to the future health of the Americas have equalled that inherent in the invasion of Brazil, in 1930, by Anopheles gambiae."" Because it was only in the 1960s that An. gambiae was recognized as a species complex now including seven species, the precise species identity of the Brazilian invader remains a mystery. Here we used historical DNA analysis of museum specimens, collected at the time of invasion from Brazil, and aimed at the identification of the Brazilian invader. Our results identify the arid-adapted Anopheles arabiensis as being the actual invading species. Establishing the identity of the species, in addition to being of intrinsic historical interest, can inform future threats of this sort especially in a changing environment. Furthermore, these results highlight the potential danger of human-mediated range expansions of insect disease vectors and the importance of museum collections in retrieving historical information.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.