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.

An electromechanical finite element model for piezoelectric energy harvester plates

Vibration-based energy harvesting has been investigated by several researchers over the last decade. The goal in this research field is to power small electronic components by converting the waste vibration energy available in their environment into electrical energy. Recent literature shows that piezoelectric transduction has received the most attention for vibration-to-electricity conversion. In practice, cantilevered beams and plates with piezoceramic layers are employed as piezoelectric energy harvesters. The existing piezoelectric energy harvester models are beam-type lumped parameter, approximate distributed parameter and analytical distributed parameter solutions. However, aspect ratios of piezoelectric energy harvesters in several cases are plate-like and predicting the power output to general (symmetric and asymmetric) excitations requires a plate-type formulation which has not been covered in the energy harvesting literature. In this paper. an electromechanically coupled finite element (FE) plate model is presented for predicting the electrical power output of piezoelectric energy harvester plates. Generalized Hamilton`s principle for electroelastic bodies is reviewed and the FE model is derived based on the Kirchhoff plate assumptions as typical piezoelectric energy harvesters are thin structures. Presence of conductive electrodes is taken into account in the FE model. The predictions of the FE model are verified against the analytical solution for a unimorph cantilever and then against the experimental and analytical results of a bimorph cantilever with a tip mass reported in the literature. Finally, an optimization problem is solved where the aluminum wing spar of an unmanned air vehicle (UAV) is modified to obtain a generator spar by embedding piezoceramics for the maximum electrical power without exceeding a prescribed mass addition limit. (C) 2009 Elsevier Ltd. All rights reserved.

Experimental investigation on the dynamic behaviour of a railway vehicle travelling through a turnout

Track critical locations with respect to the railway vehicle safety are the passages through the turnouts. The purpose of this investigation is to evaluate the safety of a railway vehicle crossing a turnout. In this study, the topography of a track turnout lay-out has been experimentally measured, and its geometric properties were synthesised. Results show that a constant wavelength vehicle oscillation occurs on the switches in the turnout and that the maximum lateral force at 65 km/h is almost 65% greater than those at low speeds (under 30 km/h).

Vehicle Dynamic Safety in Measured Rough Pavement

Dynamic vehicle behavior is used to identify safe traffic speed limits. The proposed methodology is based on the vehicle vertical wheel contact force response excited by measured pavement irregularities on the frequency domain. A quarter-car model is used to identify vehicle dynamic behavior. The vertical elevation of an unpaved road surface has been measured. The roughness spectral density is quantified as ISO Level C. Calculations for the vehicle inertance function were derived by using the vertical contact force transfer function weighed by the pavement spectral density roughness function in the frequency domain. The statistical contact load variation is obtained from the vehicle inertance density function integration. The vehicle safety behavior concept is based on its handling ability properties. The ability to generate tangential forces on the wheel/road contact interface is the key to vehicle handling. This ability is related to tire/pavement contact forces. A contribution to establish a traffic safety speed limit is obtained from the likelihood of the loss of driveability. The results show that at speeds faster than 25 km/h the likelihood of tire contact loss is possible when traveling on the measured road type. DOI: 10.1061/(ASCE)TE.19435436.0000216. (C) 2011 American Society of Civil Engineers.

Investigation of a method for predicting AUV derivatives

The paper addresses the problem of autonomous underwater vehicle (AUV) modelling and parameter estimation as a means to predict the dynamic performance of underwater vehicles and thus provide solid guidelines during their design phase. The use of analytical and semi-empirical (ASE) methods to estimate the hydrodynamic derivatives of a popular class of AUVs is discussed. A comparison is done with the results obtained by using computational fluid dynamics to evaluate the bare hull lift force distribution around a fully submerged body. An application is made to the estimation of the hydrodynamic derivatives of the MAYA AUV, an autonomous underwater vehicle developed under a joint Indian-Portuguese project. The estimates obtained were used to predict the turning diameter of the vehicle during sea trials. (C) 2008 Elsevier Ltd. All rights reserved.

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.

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.

The choice of the best among the shortest routes in transparent optical networks

This work introduces the problem of the best choice among M combinations of the shortest paths for dynamic provisioning of lightpaths in all-optical networks. To solve this problem in an optimized way (shortest path and load balance), a new fixed routing algorithm, named Best among the Shortest Routes (BSR), is proposed. The BSR`s performance is compared in terms of blocking probability and network utilization with Dijkstra`s shortest path algorithm and others algorithms proposed in the literature. The evaluated scenarios include several representative topologies for all-optical networking and different wavelength conversion architectures. For all studied scenarios, BSR achieved superior performance. (C) 2010 Elsevier B.V. All rights reserved.

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.

Photoinduced Nitric Oxide and Singlet Oxygen Release from ZnPC Liposome Vehicle Associated with the Nitrosyl Ruthenium Complex: Synergistic Effects in Photodynamic Therapy Application

Under continuous photolysis at 675 nm, liposomal zinc phthalocyanine associated with nitrosyl ruthenium complex [Ru(NH.NHq)(tpy)NO](3+) showed the detection and quantification of nitric oxide (NO) and singlet oxygen ((1)O(2)) release. Photophysical and photochemical results demonstrated that the interaction between the nitrosyl ruthenium complex and the photosensitizer can enable an electron transfer process from the photosensitizer to the nitrosyl ruthenium complex which leads to NO release. Synergistic action of both photosensitizers and the nitrosyl ruthenium complex results in the production of reactive oxygen species and reactive nitrogen species, which is a potent oxidizing agent to many biological tissues, in particular neoplastic cells.

O/W Nanoemulsion After 15 Years of Preparation: A Suitable Vehicle for Pharmaceutical and Cosmetic Applications

The application of nanoemulsions is due to have good stability, uniform spreading and enhance active penetration upon skin. Nanometer emulsions can be obtained by low-energy emulsification method. The required hydrophilic and lipophilic balance indicates the better balance of emulsifier for optimum system emulsification. Emulsion stability is evidently controlled for the properties of the adsorbed layer formed in the surface of its globules, know as potential zeta. The aim of this work was to evaluate the oil/water nanoemulsion of formulation obtained after 15 years of preparation. The results suggested that the nanoemulsion have performed stability for many years.

An unexpected role for visual feedback in vehicle steering control

Some motor tasks can be completed, quite literally, with our eyes shut. Most people can touch their nose without looking or reach for an object after only a brief glance at its location. This distinction leads to one of the defining questions of movement control: is information gleaned prior to starting the movement sufficient to complete the task (open loop), or is feedback about the progress of the movement required (closed loop)? One task that has commanded considerable interest in the literature over the years is that of steering a vehicle, in particular lane-correction and lane-changing tasks. Recent work has suggested that this type of task can proceed in a fundamentally open loop manner [1 and 2], with feedback mainly serving to correct minor, accumulating errors. This paper reevaluates the conclusions of these studies by conducting a new set of experiments in a driving simulator. We demonstrate that, in fact, drivers rely on regular visual feedback, even during the well-practiced steering task of lane changing. Without feedback, drivers fail to initiate the return phase of the maneuver, resulting in systematic errors in final heading. The results provide new insight into the control of vehicle heading, suggesting that drivers employ a simple policy of “turn and see,” with only limited understanding of the relationship between steering angle and vehicle heading.