Positioning of Deadeners for Vibration Reduction in Vehicle Roof Using Embedded Sensitivity

The noise, vibration and harshness (NVH) performance of passenger vehicles strongly depends on the fluid-structure interaction between the air in the vehicle cavity and the sheet metal structure of the vehicle. Most of the noise and vibration problems related to this interaction come from resonance peaks of the sheet metal, which are excited by external forces (road, engine, and wind). A reduction in these resonance peaks can be achieved by applying bitumen damping layers, also called deadeners, in the sheet metal. The problem is where these deadeners shall be fixed, which is usually done in a trial-and-error basis. In this work, one proposes the use of embedded sensitivity to locate the deadeners in the sheet metal of the vehicle, more specifically in the vehicle roof. Experimental frequency response functions (FRFs) of the roof are obtained and the data are processed by adopting the embedded sensitivity method, thus obtaining the sensitivity of the resonance peaks on the local increase in damping due to the deadeners. As a result, by examining the sensitivity functions, one can find the optimum location of the deadeners that maximize their effect in reducing the resonance peaks of interest. After locating the deadeners in the optimum positions, it was possible to verify a strong reduction in resonance peaks of the vehicle roof, thus showing the efficiency of the procedure. The main advantage of this procedure is that it only requires FRF measurements of the vehicle in its original state not needing any previous modification of the vehicle structure to find the sensitivity functions. [DOI: 10.1115/1.4000769]

A Constructive Genetic Algorithm for permutation flowshop scheduling

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard`s well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling; problems. (C) 2007 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.

A novel continuous time representation for the scheduling of pipeline systems with pumping yield rate constraints

Pipeline systems play a key role in the petroleum business. These operational systems provide connection between ports and/or oil fields and refineries (upstream), as well as between these and consumer markets (downstream). The purpose of this work is to propose a novel MINLP formulation based on a continuous time representation for the scheduling of multiproduct pipeline systems that must supply multiple consumer markets. Moreover, it also considers that the pipeline operates intermittently and that the pumping costs depend on the booster stations yield rates, which in turn may generate different flow rates. The proposed continuous time representation is compared with a previously developed discrete time representation [Rejowski, R., Jr., & Pinto, J. M. (2004). Efficient MILP formulations and valid cuts for multiproduct pipeline scheduling. Computers and Chemical Engineering, 28, 1511] in terms of solution quality and computational performance. The influence of the number of time intervals that represents the transfer operation is studied and several configurations for the booster stations are tested. Finally, the proposed formulation is applied to a larger case, in which several booster configurations with different numbers of stages are tested. (C) 2007 Elsevier Ltd. All rights reserved.

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule fora given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs. (C) 2007 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.

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.

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.

Optimized harvest scheduling in eucalyptus plantations under operational, spatial and climatic constraints

The representation of sustainability concerns in industrial forests management plans, in relation to environmental, social and economic aspects, involve a great amount of details when analyzing and understanding the interaction among these aspects to reduce possible future impacts. At the tactical and operational planning levels, methods based on generic assumptions usually provide non-realistic solutions, impairing the decision making process. This study is aimed at improving current operational harvesting planning techniques, through the development of a mixed integer goal programming model. This allows the evaluation of different scenarios, subject to environmental and supply constraints, increase of operational capacity, and the spatial consequences of dispatching harvest crews to certain distances over the evaluation period. As a result, a set of performance indicators was selected to evaluate all optimal solutions provided to different possible scenarios and combinations of these scenarios, and to compare these outcomes with the real results observed by the mill in the study case area. Results showed that it is possible to elaborate a linear programming model that adequately represents harvesting limitations, production aspects and environmental and supply constraints. The comparison involving the evaluated scenarios and the real observed results showed the advantage of using more holistic approaches and that it is possible to improve the quality of the planning recommendations using linear programming techniques.

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.

Comparative effects of pimecrolimus cream vehicle and three commercially available moisturizers on skin hydration and transepidermal water loss

Background: Hydration and integrity of the horny layer is essential to normal skin function. Objective: Comparison of the hydrating properties of three moisturizers with pimecrolimus cream vehicle. Methods: Four test preparations (high-quality skin cream, cold cream emulsion, emollient oil, pimecrolimus cream vehicle) were applied to four different regions of the forearms and legs. Transepidermal water loss (TEWL) was assessed by evaporimetry at baseline, and 3 and 6 hours after arm application, and electrical capacitance was assessed by corneometry at baseline, and 1, 2, 3 and 6 hours after leg application. Results: Corneometry assessment - in terms of efficacy in moisturizing the skin, test preparations were ranked (best to worst): high-quality skin cream (45.9 arbitrary units versus 75.3; p < 0.001) > pimecrolimus vehicle cream (46.6 versus 61.5; p < 0.001) > emollient oil (43.5 versus 54.8; p = 0.006) > cold cream emulsion (44.8 versus 49.9; p = 0.738). Untreated skin (control) had a mean capacitance of 44.8 units at baseline and 48.5 units at endpoint. Evaporimetry (assessment of TEWL) revealed no significant differences between control and any test preparation at any timepoint. Conclusions: Pimecrolimus cream vehicle has skin hydration properties comparable with highly effective commercially available products. No test preparation had a significant effect on TEWL.

Use of cholesterol-rich nanoparticles that bind to lipoprotein receptors as a vehicle to paclitaxel in the treatment of breast cancer: pharmacokinetics, tumor uptake and a pilot clinical study

Purpose In animal experiments paclitaxel oleate associated with a cholesterol-rich nanoemulsion concentrated in the neoplastic tissues and showed reduced toxicity and increased antitumor activity compared with paclitaxel-Cremophor EL. Here, a clinical study was performed in breast cancer patients to evaluate the tumoral uptake, pharmacokinetics and toxicity of paclitaxel associated to nanoemulsions. Methods Twenty-four hours before mastectomy [(3)H]paclitaxel oleate associated with [(14)C]-cholesteryl oleatenanoemulsion or [(3)H]- paclitaxel in Cremophor EL were injected into five patients for collection of blood samples and fragments of tumor and normal breast tissue. A pilot clinical study of paclitaxel-nanoemulsion administered at 3-week intervals was performed in four breast cancer patients with refractory advanced disease at 175 and 220 mg/m(2) dose levels. Results T(1/2) of paclitaxel oleate associated to the nanoemulsion was greater than that of paclitaxel (t(1/2) = 15.4 +/- 4.7 and 3.5 +/- 0.80 h). Uptake of the [(14)C]-cholesteryl ester nanoemulsion and [(3)H]- paclitaxel oleate by breast malignant tissue was threefold greater than the normal breast tissue and toxicity was minimal at the two dose levels. Conclusions Our results suggest that the paclitaxel-nanoemulsion preparation can be advantageous for use in the treatment of breast cancer because the pharmacokinetic parameters are improved, the drug is concentrated in the neoplastic tissue and the toxicity of paclitaxel is reduced.

A novel approach for distributed application scheduling based on prediction of communication events

The evolution of commodity computing lead to the possibility of efficient usage of interconnected machines to solve computationally-intensive tasks, which were previously solvable only by using expensive supercomputers. This, however, required new methods for process scheduling and distribution, considering the network latency, communication cost, heterogeneous environments and distributed computing constraints. An efficient distribution of processes over such environments requires an adequate scheduling strategy, as the cost of inefficient process allocation is unacceptably high. Therefore, a knowledge and prediction of application behavior is essential to perform effective scheduling. In this paper, we overview the evolution of scheduling approaches, focusing on distributed environments. We also evaluate the current approaches for process behavior extraction and prediction, aiming at selecting an adequate technique for online prediction of application execution. Based on this evaluation, we propose a novel model for application behavior prediction, considering chaotic properties of such behavior and the automatic detection of critical execution points. The proposed model is applied and evaluated for process scheduling in cluster and grid computing environments. The obtained results demonstrate that prediction of the process behavior is essential for efficient scheduling in large-scale and heterogeneous distributed environments, outperforming conventional scheduling policies by a factor of 10, and even more in some cases. Furthermore, the proposed approach proves to be efficient for online predictions due to its low computational cost and good precision. (C) 2009 Elsevier B.V. All rights reserved.