A STUDY OF PENALTY FORMULATIONS USED IN THE NUMERICAL APPROXIMATION OF A RADIALLY SYMMETRIC ELASTICITY PROBLEM

We consider a class of two-dimensional problems in classical linear elasticity for which material overlapping occurs in the absence of singularities. Of course, material overlapping is not physically realistic, and one possible way to prevent it uses a constrained minimization theory. In this theory, a minimization problem consists of minimizing the total potential energy of a linear elastic body subject to the constraint that the deformation field must be locally invertible. Here, we use an interior and an exterior penalty formulation of the minimization problem together with both a standard finite element method and classical nonlinear programming techniques to compute the minimizers. We compare both formulations by solving a plane problem numerically in the context of the constrained minimization theory. The problem has a closed-form solution, which is used to validate the numerical results. This solution is regular everywhere, including the boundary. In particular, we show numerical results which indicate that, for a fixed finite element mesh, the sequences of numerical solutions obtained with both the interior and the exterior penalty formulations converge to the same limit function as the penalization is enforced. This limit function yields an approximate deformation field to the plane problem that is locally invertible at all points in the domain. As the mesh is refined, this field converges to the exact solution of the plane problem.

The random barrier-crossing problem

This paper addresses the time-variant reliability analysis of structures with random resistance or random system parameters. It deals with the problem of a random load process crossing a random barrier level. The implications of approximating the arrival rate of the first overload by an ensemble-crossing rate are studied. The error involved in this so-called ""ensemble-crossing rate"" approximation is described in terms of load process and barrier distribution parameters, and in terms of the number of load cycles. Existing results are reviewed, and significant improvements involving load process bandwidth, mean-crossing frequency and time are presented. The paper shows that the ensemble-crossing rate approximation can be accurate enough for problems where load process variance is large in comparison to barrier variance, but especially when the number of load cycles is small. This includes important practical applications like random vibration due to impact loadings and earthquake loading. Two application examples are presented, one involving earthquake loading and one involving a frame structure subject to wind and snow loadings. (C) 2007 Elsevier Ltd. All rights reserved.

No relationship found between point heteroplasmy in mitochondrial DNA control region and age range, sex and haplogroup in human hairs

The analysis of heteroplasmy (presence of more than one type of mitochondrial DNA in an individual) is used as a tool in human identification studies, anthropology, and most currently in studies that relate heteroplasmy with longevity. The frequency of heteroplasmy and its correlation with age has been analyzed using different tissues such as blood, muscle, heart, bone and brain and in different regions of mitochondrial DNA, but this analysis had never been performed using hair samples. In this study, samples of hair were sequenced in order to ascertain whether the presence or not of heteroplasmy varied according to age, sex and origin of haplogroup individuals. The samples were grouped by age (3 groups), gender (male and female) and haplogroup of origin (European, African and Native American), and analyzed using the chi-square statistical test (chi(2)). Based in statistical results obtained, we conclude that there is no relationship between heteroplasmy and sex, age and haplogroup origin using hair samples.

Ergonomic Planned Supply in an Automotive Assembly Line

The objective of this research is to identify the benefits of ergonomic improvements in workstations and in planned parts supply in an automotive assembly line. Another aim is to verify to what extent it is possible to create competitive advantages in the manufacturing area with reduction in vehicle assembly time by using technological investments in ergonomics with benefits to the worker and to the company. The Methods Time Measurement (MTM) methodology is chosen to measure the process time differences. To ensure a reliable comparison, a company in Brazil that has two different types of assembly line installations in the same plant was observed, and both assembly lines were under the same influences in terms of human resources, wages, food, and educational level of the staff. In this article, the first assembly line is called ""new"" and was built 6 years ago, with high investments in ergonomic solutions, in the supply system, and in the process. The other is called ""traditional"" and was built 23 years ago with few investments in the area. (C) 2010 Wiley Periodicals, Inc.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.

A Separation Principle for the Continuous-Time LQ-Problem With Markovian Jump Parameters

In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

GEITLERINEMA SPECIES (OSCILLATORIALES, CYANOBACTERIA) REVEALED BY CELLULAR MORPHOLOGY, ULTRASTRUCTURE, AND DNA SEQUENCING

Geitlerinema amphibium (C. Agardh ex Gomont) Anagn. and G. unigranulatum (Rama N. Singh) Komarek et M. T. P. Azevedo are morphologically close species with characteristics frequently overlapping. Ten strains of Geitlerinema (six of G. amphibium and four of G. unigranulatum) were analyzed by DNA sequencing and transmission electronic and optical microscopy. Among the investigated strains, the two species were not separated with respect to cellular dimensions, and cellular width was the most varying characteristic. The number and localization of granules, as well as other ultrastructural characteristics, did not provide a means to discriminate between the two species. The two species were not separated either by geography or environment. These results were further corroborated by the analysis of the cpcB-cpcA intergenic spacer (PC-IGS) sequences. Given the fact that morphology is very uniform, plus the coexistence of these populations in the same habitat, it would be nearly impossible to distinguish between them in nature. On the other hand, two of the analyzed strains were distinct from all others based on the PC-IGS sequences, in spite of their morphological similarity. PC-IGS sequences indicate that these two strains could be a different species of Geitlerinema. Using morphology, cell ultrastructure, and PC-IGS sequences, it is not possible to distinguish G. amphibium and G. unigranulatum. Therefore, they should be treated as one species, G. unigranulatum as a synonym of G. amphibium.

Geographic variation of sex pheromone and mitochondrial DNA in Diatraea saccharalis (Fab., 1794) (Lepidoptera: Crambidae)

(9Z,11E)-hexadecadienal and (Z11)-hexadecenal, the main sex pheromone components of the sugarcane borer, Diatraea saccharalis, were identified and quantified from four Brazilian and one Colombian populations using GC-EAD, GC-MS and GC analyses. Three different ratios were observed, 9:1,6:1, and 3:1. The pheromone concentration for the major component, (9Z,11E)-hexadecadienal, varied from 6.8 ng/gland to 21.9 ng/gland and from 1.7 ng/gland to 6.5 to the minor component, (Z11)-hexadecenal. The 25 D. saccharalis cytochrome oxidase II sequences that were analyzed showed low intra-specific variation and represented only 11 haplotypes, with the most frequent being the one represented by specimens from Sao Paulo, Parana, and Pernambuco states. Specimens from Colombia showed the highest genetic divergence from the others haplotypes studied. Data on the genetic variability among specimens, more than their geographic proximity, were in agreement with data obtained from analyses of the pheromone extracts. Our data demonstrate a variation in pheromone composition and a covariation in haplotypes of the D. saccharalis populations studied. (C) 2010 Elsevier Ltd. All rights reserved.

DNA sequences generated by BCH codes over GF(4)

The question raised by researchers in the field of mathematical biology regarding the existence of error-correcting codes in the structure of the DNA sequences is answered positively. It is shown, for the first time, that DNA sequences such as proteins, targeting sequences and internal sequences are identified as codewords of BCH codes over Galois fields.

Associations between glutathione peroxidase-1 Pro198Leu polymorphism, selenium status, and DNA damage levels in obese women after consumption of Brazil nuts

Objective: Alterations in selenium (Se) status may result in suboptimal amounts of selenoproteins, which have been associated with increased oxidative stress levels. The Pro198Leu polymorphism at the glutathione peroxidase-1 (GPx1) gene is supposed to be functional. The response of Se status, GPx activity, and levels of DNA damage to a Se supplementation trial between the genotypes related to that polymorphism was investigated. Methods: A randomized trial was conducted with 37 morbidly obese women. Participants consumed one Brazil nut, which provided approximately 290 mu g of Se a day, for 8 wk. Blood Se concentrations, erythrocyte GPx activity, and DNA damage levels were measured at baseline and at 8 wk. The results were compared by genotypes. Results: The genotype frequencies were 0.487, 0.378, and 0.135 for Pro/Pro (the wild-type genotype), Pro/Leu, and Leu/Leu, respectively. At baseline, 100% of the subjects were Se deficient, and after the supplementation, there was an improvement in plasma Se (P < 0.001 for Pro/Pro and Pro/Leu, P < 0.05 for Leu/Leu), erythrocyte Se (P = 0.00 for Pro/Pro and Pro/Leu, P < 0.05 for Leu/Leu), and GPx activity (P = 0.00 for Pro/Pro, P < 0.00001 for Pro/Leu, P < 0.001 for Leu/Leu). In addition, the Pro/Pro group showed a decrease in DNA damage after Brazil nut consumption compared with baseline (P < 0.005), and those levels were higher in Leu/Leu subjects compared with those with the wild-type genotype (P < 0.05). Conclusion: Consumption of one unit of Brazil nuts daily effectively increases Se status and increases GPx activity in obese women, regardless of GPx1 Pro198Leu polymorphism. However, the evaluated biomarkers showed distinct results in response to the supplementation when the polymorphism was considered. (c) 2011 Elsevier Inc. All rights reserved.

Heteroplasmy in Hair: Study of Mitochondrial DNA Third Hypervariable Region in Hair and Blood Samples

Mitochondrial DNA (mtDNA) analysis has proved useful for forensic identification especially in cases where nuclear DNA is not available, such as with hair evidence. Heteroplasmy, the presence of more than one type of mtDNA in one individual, is a common situation often reported in the first and second mtDNA hypervariable regions (HV1/HV2), particularly in hair samples. However, there is no data about heteroplasmy frequency in the third mtDNA hypervariable region (HV3). To investigate possible heteroplasmy hotspots, HV3 from hair and blood samples of 100 individuals were sequenced and compared. No point heteroplasmy was observed, but length heteroplasmy was, both in C-stretch and CA repeat. To observe which CA ""alleles"" were present in each tissue, PCR products were cloned and re-sequenced. However, no variation among CA alleles was observed. Regarding forensic practice, we conclude that point heteroplasmy in HV3 is not as frequent as in the HV1/HV2.