A simple feedback control for a chaotic oscillator with limited power supply

We proposed a simple feedback control method to suppress chaotic behavior in oscillators with limited power supply. The small-amplitude controlling signal is applied directly to the power supply system, so as to alter the characteristic curve of the driving motor. Numerical results are presented showing the method efficiency for a wide range of control parameters. Moreover, we have found that, for some parameters, this kind of control may introduce coexisting periodic attractors with complex basins of attraction and, therefore, serious problems with predictability of the final state the system will asymptote to. (c) 2006 Elsevier Ltd. All rights reserved.

On non-linear dynamics and control designs applied to the ideal and non-ideal variants of the Fitzhugh-Nagumo (FN) mathematical model

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Analytical Methods Employed at Quality Control of Fuel Ethanol

The existence of organic and inorganic contaminants present in both fossil and biomass fuels and the fact that they can provide undesirable effects (environmental problems, corrosion processes, lead to storage instability, and others) implies a rigorous quality control of these fuels, although these contaminants make up a small part of the final fuel composition. Considering the rising importance of fuel ethanol in the worldwide panorama, this review aims at reporting the use of successful alternative analytical methods in the monitoring of organic and inorganic contaminants at trace levels, used to determine and to quantify these substances in fuel ethanol and also presenting all official norms for quality control of fuel ethanol employed by ABNT (Brazilian Association of Technical Norms), ASTM (American Society for Testing and Materials), and ECS (European Committee for Standardization).

Development, optimization and validation of gas chromatographic fingerprinting of Brazilian commercial gasoline for quality control

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Localization of the optimal solution and a posteriori bounds for aggregation

After an aggregated problem has been solved, it is often desirable to estimate the accuracy loss due to the fact that a simpler problem than the original one has been solved. One way of measuring this loss in accuracy is the difference in objective function values. To get the bounds for this difference, Zipkin (Operations Research 1980;28:406) has assumed, that a simple (knapsack-type) localization of an original optimal solution is known. Since then various extensions of Zipkin's bound have been proposed, but under the same assumption. A method to compute the bounds for variable aggregation for convex problems, based on general localization of the original solution is proposed. For some classes of the original problem it is shown how to construct the localization. Examples are given to illustrate the main constructions and a small numerical study is presented.

The immune system of insects and the control of some parasitary human diseases

Parasitic diseases in humans, transmitted by insects, affect about 500 million people living mainly in countries of low economic power, the control of these diseases is difficult to carry out, mainly die to social and political problems, enhanced bg the capacity of these organisms to develop resistance to insecticides used to for their destruction.Some recent advances in the area of insect immunology have open the possibility for abetter epidemiological control of these diseases.The immune system of these insects, as well as that of other organisms, have the ability to recognize the infecting parasites and liberate a series of reactions which stop the infection. These reactions involve the circulating cells (hemocytes) against the parasite. These cells have the ability of phagocytize and liberate the production of various humoral factors, neutralizing the infection.Some promising results, obtained by the study of the immune system of malaria-transmitting insects, the sleeping disease, and dengue, are an example of this new sanitary strategy.

Discrete approximations for strict convex continuous time problems and duality

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

A column generation approach to capacitated p-median problems

The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated considering knapsack subproblems. The Lagrangean/surrogate relaxation has been used recently to accelerate subgradient like methods. In this work the Lagrangean/surrogate relaxation is directly identified from the master problem dual and provides new bounds and new productive columns through a modified knapsack subproblem. The overall column generation process is accelerated, even when multiple pricing is observed. Computational tests are presented using instances taken from real data from Sao Jose dos Campos' city.

Incorporating voltage/reactive representation to short-term generation scheduling models

This paper proposes a methodology to incorporate voltage/reactive representation to Short Term Generation Scheduling (STGS) models, which is based on active/reactive decoupling characteristics of power systems. In such approach STGS is decoupled in both Active (AGS) and Reactive (RGS) Generation Scheduling models. AGS model establishes an initial active generation scheduling through a traditional dispatch model. The scheduling proposed by AGS model is evaluated from the voltage/reactive points of view, through the proposed RGS model. RGS is formulated as a sequence of T nonlinear OPF problems, solved separately but taking into account load tracking between consecutive time intervals. This approach considerably reduces computational effort to perform the reactive analysis of the RGS problem as a whole. When necessary, RGS model is capable to propose active generation redispatches, such that critical reactive problems (in which all reactive variables have been insufficient to control the reactive problems) can be overcome. The formulation and solution methodology proposed are evaluated in the IEEE30 system in two case studies. These studies show that the methodology is robust enough to incorporate reactive aspects to STGS problem.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

TIME-OPTIMAL GEOMAGNETIC ATTITUDE MANEUVERS OF AN AXISYMMETRICAL SPINNING SATELLITE

A formulation used to determine the time-optimal geomagnetic attitude maneuvers subject to dynamic and geometric constraints is proposed in this paper. This was obtained by a direct search procedure based on a control function parametrization method, using linear programming to obtain numerical suboptimal solutions by linear perturbation. Due to its characteristics it can be used in small computers and to generate computer programs of general application. The dynamic modeling, the magnetic torque model and the suboptimal control procedure are presented. Simulation runs have verified the feasibility of the formulation thus derived and have shown a notable improvement in performance.

Bayesian L-optimal exact design of experiments for biological kinetic models

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)