Synchronization of the unified chaotic system and application in secure communication

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

Comparative analysis of synchronization algorithms based on PLL, RDFT and Kalman Filter

This paper discusses the main characteristics and presents a comparative analysis of three synchronization algorithms based respectively, on a Phase-Locked Loop, a Kalman Filter and a Discrete Fourier Transform. It will be described the single and three-phase models of the first two methods and the single-phase model of the third one. Details on how to modify the filtering properties or dynamic response of each algorithm will be discussed in terms of their design parameters. In order to compare the different algorithms, these parameters will be set for maximum filter capability. Then, the dynamic response, during input amplitude and frequency deviations will be observed, as well as during the initialization procedure. So, advantages and disadvantages of all considered algorithms will be discussed. ©2007 IEEE.

A 2-D delaunay refinement algorithm using an initial prerefinement from the boundary mesh

An improvement to the quality bidimensional Delaunay mesh generation algorithm, which combines the mesh refinement algorithms strategy of Ruppert and Shewchuk is proposed in this research. The developed technique uses diametral lenses criterion, introduced by L. P. Chew, with the purpose of eliminating the extremely obtuse triangles in the boundary mesh. This method splits the boundary segment and obtains an initial prerefinement, and thus reducing the number of necessary iterations to generate a high quality sequential triangulation. Moreover, it decreases the intensity of the communication and synchronization between subdomains in parallel mesh refinement. © 2008 IEEE.

Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms

Sao Paulo State Research Foundation-FAPESP

Effect of timing of estradiol benzoate administration upon synchronization of ovulation in suckling Nelore cows (Bos indicus) treated with a progesterone-releasing intravaginal device

The present study investigated how the timing of the administration of estradiol benzoate (EB) impacted the synchronization of ovulation in fixed-time artificial insemination protocols of cattle. To accomplish this, two experiments were conducted, with EB injection occurring at different times: at withdrawal of the progesterone-releasing (N) intravaginal device or 24 h later. The effectiveness of these times was compared by examining ovarian follicular dynamics (Experiment 1, n = 30) and conception rates (Experiment 2, n = 504). In Experiment 1, follicular dynamics was performed in 30 Nelore cows (Bos indicus) allocated into two groups. on a random day of the estrous cycle (Day 0), both groups received 2 mg of EB i.m. and a P4-releasing intravaginal device, which was removed on Day 8, when 400 IU of eCG and 150 mu g of PGF were administered. The control group (G-EB9; n = 15) received 1 mg of EB on Day 9, while Group EB8 (G-EB8; n = 15) received the same dose a day earlier. Ovarian ultrasonographic evaluations were performed every 8 h after device removal until ovulation. The timing of EB administration (Day 8 compared with Day 9) did affect the interval between P4 device removal to ovulation (59.4 +/- 2.0 h compared with 69.3 +/- 1.7 h) and maximum diameter of dominant (1.54 +/- 0.06 a cm compared with 1.71 +/- 0.05 b cm, P = 0.03) and ovulatory (1.46 +/- 0.05 a cm compared with 1.58 +/- 0.04 b cm, P < 0.01) follicles. In Experiment 2,504 suckling cows received the same treatment described in Experiment 1, but insemination was performed as follows: Group EB8-AI48h (G-EB8-AI48h; n = 119) and Group EB8-AI54h (G-EB8-AI54h; n = 134) received 1 mg of EB on Day 8 and FrAI was performed, respectively, 48 or 54 h after P4 device removal. Group EB9-AI48h (G-EB9-AI48h; n = 126) and Group EB9-AI54h (G-EB9-AI54h n = 125) received the same treatments and underwent the same FTAI protocols as G-EB8-AI48h and G-EB8-AI54h, respectively; however, EB was administered on Day 9. Conception rates were greater (P < 0.05) in G-EB9-AI54h 163.2% (79/125) a], G-EB9-AI48h [58.7% (74/126) a] and G-EB8-AI48h [58.8% (70/119) a] than in G-EB8-AI54h [34.3% (46/134) b]. We concluded that when EB administration occurred at device withdrawal (D8), the interval to ovulation shortened and dominant and ovulatory follicle diameters decreased. Furthermore, when EB treatment was performed 24 h after device removal, FTAI conducted at either 48 or 54 h resulted in similar conception rates. However, EB treatment on the same day as device withdrawal resulted in a lesser conception rate when FTAI was conducted 54 h after device removal. (C) 2007 Elsevier B.V. All rights reserved.

Image processing algorithm for the identification of Martian dust devil tracks in MOC and HiRISE images

This paper presents a method for automatic identification of dust devils tracks in MOC NA and HiRISE images of Mars. The method is based on Mathematical Morphology and is able to successfully process those images despite their difference in spatial resolution or size of the scene. A dataset of 200 images from the surface of Mars representative of the diversity of those track features was considered for developing, testing and evaluating our method, confronting the outputs with reference images made manually. Analysis showed a mean accuracy of about 92%. We also give some examples on how to use the results to get information about dust devils, namelly mean width, main direction of movement and coverage per scene. (c) 2012 Elsevier Ltd. All rights reserved.

Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

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

A novel algorithm for feature selection using Harmony Search and its application for non-technical losses detection

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

A new algorithm for Reverse Monte Carlo simulations

We present a new algorithm for Reverse Monte Carlo (RMC) simulations of liquids. During the simulations, we calculate energy, excess chemical potentials, bond-angle distributions and three-body correlations. This allows us to test the quality and physical meaning of RMC-generated results and its limitations. It also indicates the possibility to explore orientational correlations from simple scattering experiments. The new technique has been applied to bulk hard-sphere and Lennard-Jones systems and compared to standard Metropolis Monte Carlo results. (C) 1998 American Institute of Physics.

About the Use of the HdHr Algorithm Group in Integrating the Movement Equation with Nonlinear Terms

This work summarizes the HdHr group of Hermitian integration algorithms for dynamic structural analysis applications. It proposes a procedure for their use when nonlinear terms are present in the equilibrium equation. The simple pendulum problem is solved as a first example and the numerical results are discussed. Directions to be pursued in future research are also mentioned. Copyright (C) 2009 H.M. Bottura and A. C. Rigitano.

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand capacity. The problem is well known to be NP-hard and has many practical applications. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the CCCP. This method identifies promising regions of the search space by generating solutions with a metaheuristic, such as Genetic Algorithm, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of CS. (C) 2010 Elsevier Ltd. All rights reserved.

Economic-statistical design of the (X)over-bar chart used to control a wandering process mean using genetic algorithm

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

Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Transmission system expansion planning by an extended genetic algorithm

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

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