810 resultados para Linde-Buzo-Gray Algorithm
Resumo:
The multilayer perceptron network has become one of the most used in the solution of a wide variety of problems. The training process is based on the supervised method where the inputs are presented to the neural network and the output is compared with a desired value. However, the algorithm presents convergence problems when the desired output of the network has small slope in the discrete time samples or the output is a quasi-constant value. The proposal of this paper is presenting an alternative approach to solve this convergence problem with a pre-conditioning method of the desired output data set before the training process and a post-conditioning when the generalization results are obtained. Simulations results are presented in order to validate the proposed approach.
Resumo:
A low-cost computer procedure to determine the orbit of an artificial satellite by using short arc data from an onboard GPS receiver is proposed. Pseudoranges are used as measurements to estimate the orbit via recursive least squares method. The algorithm applies orthogonal Givens rotations for solving recursive and sequential orbit determination problems. To assess the procedure, it was applied to the TOPEX/POSEIDON satellite for data batches of one orbital period (approximately two hours), and force modelling, due to the full JGM-2 gravity field model, was considered. When compared with the reference Precision Orbit Ephemeris (POE) of JPL/NASA, the results have indicated that precision better than 9 m is easily obtained, even when short batches of data are used. Copyright (c) 2007.
Resumo:
Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.
Resumo:
An earlier model underlying the foraging strategy of a pachycodyla apicalis ant is modified. The proposed algorithm incorporates key features of the tabu-search method in the development of a relatively simple but robust global ant colony optimization algorithm. Numerical results are reported to validate and demonstrate the feasibility and effectiveness of the proposed algorithm in solving electromagnetic (EM) design problems.
Resumo:
Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point.
Resumo:
Using a new reverse Monte Carlo algorithm, we present simulations that reproduce very well several structural and thermodynamic properties of liquid water. Both Monte Carlo, molecular dynamics simulations and experimental radial distribution functions used as input are accurately reproduced using a small number of molecules and no external constraints. Ad hoc energy and hydrogen bond analysis show the physical consistency and limitations of the generated RMC configurations. (C) 2001 American Institute of Physics.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Glutamate-NMDA (N-methyl-D-aspartate) receptor activation within the periaqueductal gray (PAG) leads to antinociceptive, autonomic and behavioral responses characterized as the fear reaction. We have recently demonstrated that the vigorous defensive-like behaviors (e.g. jumping and running) and antinociception induced by intra-PAG injection of N-methyl-D-aspartate (NMDA) were completely blocked by prior infusion of N(omega)-propyl-L-arginine (NPLA), a specific neuronal nitric oxide synthesis (nNOS) enzyme inhibitor, into the same midbrain structure. It remains unclear however, whether the inhibition of nNOS within the mouse PAG changes the anxiety-like behavior per se or the effects of the inhibition of nNOS depend on the suppression of downstream of glutamate-NMDA receptor activation. This study investigated whether intra-PAG infusion of NPLA (i) attenuates anxiety in the elevated plus-maze (EPM) and (ii) antagonizes the anxiogenic-like effects induced by intra-PAG injection of NMDA. Test sessions were videotaped and subsequently scored for conventional indices of anxiety (percentage of open arm entries and percentage of open arm time) and locomotor activity (closed arm entries). Results showed that intra-PAG infusions of NPLA (0.2, 0.4 or 0.8 nmol/0.1 mu l) did not alter significantly any behavioral response in the EPM when compared to control group (Experiment 1). Intra-PAG infusion of NMDA (0 and 0.02 nmol/0.1 mu l; a dose that does not provoke vigorous defensive behaviors per se in mice) significantly reduced open arm exploration, confirming an anxiogenic-like effect (Experiment 2). When injected into the PAG 10 min prior local NMDA injection (0.02 nmol/0.1 mu l), NPLA (0.4 nmol/0.1 mu l) was able to revert the anxiogenic-like effect of glutamate-NMDA receptor activation. Neither intra-PAG infusion of NMDA nor NPLA altered closed arm entries, a widely used measure of locomotor activity in the EPM. These results suggest that intra-PAG nitric oxide synthesis does not play a role on anxiety-like behavior elicited during EPM exposure; however its synthesis is important for the proaversive effects produced by activation of glutamate-NMDA receptors located within this limbic midbrain structure. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)