987 resultados para central algorithm
Resumo:
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of the CM cost function. Our model highlights the influence, of the signal constellation used in the transmission system: for smaller variation in the modulus of the transmitted symbols, the algorithm will be more robust, and the steady-state misadjustment will be smaller. The theoretical results are validated through several simulations, for long and short filters and channels.
Resumo:
Starting from the Durbin algorithm in polynomial space with an inner product defined by the signal autocorrelation matrix, an isometric transformation is defined that maps this vector space into another one where the Levinson algorithm is performed. Alternatively, for iterative algorithms such as discrete all-pole (DAP), an efficient implementation of a Gohberg-Semencul (GS) relation is developed for the inversion of the autocorrelation matrix which considers its centrosymmetry. In the solution of the autocorrelation equations, the Levinson algorithm is found to be less complex operationally than the procedures based on GS inversion for up to a minimum of five iterations at various linear prediction (LP) orders.
Resumo:
In this paper the continuous Verhulst dynamic model is used to synthesize a new distributed power control algorithm (DPCA) for use in direct sequence code division multiple access (DS-CDMA) systems. The Verhulst model was initially designed to describe the population growth of biological species under food and physical space restrictions. The discretization of the corresponding differential equation is accomplished via the Euler numeric integration (ENI) method. Analytical convergence conditions for the proposed DPCA are also established. Several properties of the proposed recursive algorithm, such as Euclidean distance from optimum vector after convergence, convergence speed, normalized mean squared error (NSE), average power consumption per user, performance under dynamics channels, and implementation complexity aspects, are analyzed through simulations. The simulation results are compared with two other DPCAs: the classic algorithm derived by Foschini and Miljanic and the sigmoidal of Uykan and Koivo. Under estimated errors conditions, the proposed DPCA exhibits smaller discrepancy from the optimum power vector solution and better convergence (under fixed and adaptive convergence factor) than the classic and sigmoidal DPCAs. (C) 2010 Elsevier GmbH. All rights reserved.
Resumo:
The main goal of this paper is to apply the so-called policy iteration algorithm (PIA) for the long run average continuous control problem of piecewise deterministic Markov processes (PDMP`s) taking values in a general Borel space and with compact action space depending on the state variable. In order to do that we first derive some important properties for a pseudo-Poisson equation associated to the problem. In the sequence it is shown that the convergence of the PIA to a solution satisfying the optimality equation holds under some classical hypotheses and that this optimal solution yields to an optimal control strategy for the average control problem for the continuous-time PDMP in a feedback form.
Resumo:
An algorithm inspired on ant behavior is developed in order to find out the topology of an electric energy distribution network with minimum power loss. The algorithm performance is investigated in hypothetical and actual circuits. When applied in an actual distribution system of a region of the State of Sao Paulo (Brazil), the solution found by the algorithm presents loss lower than the topology built by the concessionary company.
Resumo:
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA. at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise ratio is low, SWA can converge to undesirable local minima or even diverge. In this paper, we show that divergence can be caused by an inconsistency in the nonlinear estimate of the transmitted signal. or (when the algorithm is implemented in finite precision) by the loss of positiveness of the estimate of the autocorrelation matrix, or by a combination of both. In order to avoid the first cause of divergence, we propose a dual-mode SWA. In the first mode of operation. the new algorithm works as SWA; in the second mode, it rejects inconsistent estimates of the transmitted signal. Assuming the persistence of excitation condition, we present a deterministic stability analysis of the new algorithm. To avoid the second cause of divergence, we propose a dual-mode lattice SWA, which is stable even in finite-precision arithmetic, and has a computational complexity that increases linearly with the number of adjustable equalizer coefficients. The good performance of the proposed algorithms is confirmed through numerical simulations.
Resumo:
This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multiuser channel estimation (MuChE) and detection problems at its maximum-likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi-user detection (MuD) show that the proposed genetic algorithm multi-user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi-user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near-optimum multi-user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi-user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE-GAMuD scheme can be regarded as a promising alternative for implementing third-generation (3G) and fourth-generation (4G) wireless systems in the near future. Copyright (C) 2010 John Wiley & Sons, Ltd.
Resumo:
This paper presents the design and implementation of an embedded soft sensor, i. e., a generic and autonomous hardware module, which can be applied to many complex plants, wherein a certain variable cannot be directly measured. It is implemented based on a fuzzy identification algorithm called ""Limited Rules"", employed to model continuous nonlinear processes. The fuzzy model has a Takagi-Sugeno-Kang structure and the premise parameters are defined based on the Fuzzy C-Means (FCM) clustering algorithm. The firmware contains the soft sensor and it runs online, estimating the target variable from other available variables. Tests have been performed using a simulated pH neutralization plant. The results of the embedded soft sensor have been considered satisfactory. A complete embedded inferential control system is also presented, including a soft sensor and a PID controller. (c) 2007, ISA. Published by Elsevier Ltd. All rights reserved.
Resumo:
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.
Resumo:
In Rondonia State, Brazil, settlement processes have cleared 68,000 km 2 of tropical forests since the 1970s. The intensity of deforestation has differed by region depending on driving factors like roads and economic activities. Different histories of land-use activities and rates of change have resulted in mosaics of forest patches embedded in an agricultural matrix. Yet, most assessments of deforestation and its effects on vegetation, soil and water typically focus on landscape patterns of current conditions, yet historical deforestation dynamics can influence current conditions strongly. Here, we develop and describe the use of four land-use dynamic indicators to capture historical land-use changes of catchments and to measure the rate of deforestation (annual deforestation rate), forest regeneration level (secondary forest mean proportion), time since disturbance (mean time since deforestation) and deforestation profile (deforestation profile curvature). We used the proposed indices to analyze a watershed located in central Rondonia. Landsat TM and ETM+ images were used to produce historical land-use maps of the last 18 years, each even year from 1984 to 2002 for 20 catchments. We found that the land-use dynamics indicators are able to distinguish catchments with different land-use change profiles. Four categories of historical land-use were identified: old and dominant pasture cover on small properties, recent deforestation and dominance of secondary growth, old extensive pastures and large forest remnants and, recent deforestation, pasture and large forest remnants. Knowing historical deforestation processes is important to develop appropriate conservation strategies and define priorities and actions for conserving forests currently under deforestation. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
In this study, data on cattle depredation by puma (Puma concolor) and jaguar (Panthera onca) were recorded for six years (1998 - 2003) in a cattle ranch in central-western Brazil. Depredation represented 18.9% of the overall cattle mortality, being predominant on calves. in biomass, kills represented 0.4% (63.8 kg/km(2)) of the ranch`s annual stock. in economic loss, kills represented 0.3% of the cattle stock value. Depredation was mainly associated with cattle`s age class and location along with the time of birth of calves. The proportion of pastures next to forest with depredation (n=33, 48.5%) was not distinguished to the proportion of pastures not bordering forest with depredation (n=35, 51.5%). However, the proportion of pastures next to forest with depredation represented 54% (n=33) of the 61 total pastures that were at least partially surrounded by forest patches or riparian forests that comprised eight continuum blocks of forest fragments of different sizes in the ranch and adjacent areas. No kills occurred in the central portion (main house) of the farm, close to the headquarters where the pastures not bordering forest. The distances of the kills in relation to areas of native forest was 1317.48 +/- 941.03 m. In order to reduce depredation, calves should be kept as far as possible from forest areas and concentrated cattle breeding and calving seasons should be encouraged. (c) 2007 Elsevier Ltd. All rights reserved.
Resumo:
Recent studies revealed that vasopressinergic neurons have a high content of cys-leukotriene C(4) (LTC(4)) synthase, a critical enzyme in cys-leukotriene synthesis that may play a role in regulating vasopressin secretion. This study investigates the role of this enzyme in arginine vasopressin (AVP) release during experimentally induced sepsis. Male Wistar rats received an i.c.v. injection of 3-[1-(p-chlorobenzyl)-5-(isopropyl)-3-tert-butylthioindol-2-yl]-2, 2-dimethylpropanoic acid (MK-886) (1.0 mu g/kg), a leukotrienes (LTs) synthesis inhibitor, or vehicle, 1 h before cecal ligation and puncture (CLP) or sham operation. In one group of animals the survival rate was monitored for 3 days. In another group, the animals were decapitated at 0, 4, 6, 18 and 24 h after CLP or sham operation, and blood was collected for hematocrit, serum sodium and nitrate, plasma osmolality, protein and AVP determination. A third group was used for blood pressure measurements. The neurohypophysis was removed for quantification of AVP content, and the hypothalamus was dissected for LTC4 synthase analysis by Western blot. Mortality after CLP was reduced by the central administration of MK-886. The increase in plasma AVP levels and hypothalamus LTC4 synthase content in the initial phase of sepsis was blocked, whereas the decrease in neurohypophyseal AVP content was partially reversed. Also the blood pressure drop was abolished in this phase. The increase of serum nitric oxide and hematocrit was reduced, and the decrease in plasma protein and osmolality was not affected by the LTs blocker. In the final phase of sepsis, the plasma AVID level and the hypothalamic LTC4 synthase content were at basal levels. The central administration of MK-886 increased the hypothalamic LTC4 synthase content but did not alter the plasma and neurohypophysis AVID levels observed, or the blood pressure during this phase. These results suggest that the central LTs are involved in the vasopressin release observed during sepsis. (C) 2009 IBRO. Published by Elsevier Ltd. All rights reserved.
Resumo:
Movements of two female one-humped camels in central Australia were tracked using satellite telemetry between March 1986 and July 1987. During that time both animals travelled a minimum distance of over 1000 km within a radius of 125 km for one animal, and 200 km for the other. However, their movements were uite punctuated and both animals spent periods of up to several months in rleatively small areas before moving over longer distances to new areas. Both camels moved at greater rates overnight. An activity index, probably measuring feeding rate, declined during the study period for both animals. Patchy and sporadic rainfall may explain some of these results.
Resumo:
Abstract: Among the vertebrates, crocodilians have the most complex anatomy of the heart and outflow channels. Their cardiovascular anatomy may also be the most functionally sophisticated, combining as it does the best features of both reptilian and mammalian (and avian) systems. The puzzlingly complex "plumbing" of crocodilians has fascinated anatomists and physiologists for a very long time, the first paper being that by Panizza (1833). Gradually, with the application of successive techniques of investigation as they became available, its functional significance has become reasonably clear, and the complexity is now revealed as a cardiovascular system of considerable elegance. In this paper I will review the main anatomical features of the heart and outflow channels, discuss what is known about the way they work, and speculate about the probable functional significance.
Resumo:
Fatigue was induced in the triceps brachii of the experimental arm by a regimen of either eccentric or concentric muscle actions. Estimates of force were assessed using a contralateral limb-matching procedure, in which target force levels (25 %, 50 % or 75 % of maximum) were defined by the unfatigued control arm. Maximum isometric force-generating capacity was reduced by 31 % immediately following eccentric contractions, and remained depressed at 24 (25 %) and 48 h (13 %) post-exercise. A less marked reduction (8.3 %) was observed immediately following concentric contractions. Those participants who performed prior eccentric contractions, consistently (at all force levels), and persistently (throughout the recovery period), overestimated the level of force applied by the experimental arm. In other words, they believed that they were generating more force than they actually achieved. When the forces applied by the experimental and the control arm, were each expressed as a proportion of the maximum force that could be attained at that time, the estimates matched extremely closely. This outcome is that which would be expected if the estimates of force were based on a sense of effort. Following eccentric exercise, the amplitude of the EMG activity recorded from the experimental arm was substantially greater than that recorded from the control arm. Cortically evoked potentials recorded from the triceps brachii (and extensor carpi radialis) of the experimental arm were also substantially larger than those elicited prior to exercise. The sense of effort was evidently not based upon a corollary of the central motor command. Rather, the relationship between the sense of effort and the motor command appears to have been altered as a result of the fatiguing eccentric contractions. It is proposed that the sense of effort is associated with activity in neural centres upstream of the motor cortex.