Coarse-grid higher order finite-difference time-domain algorithm with low dispersion errors

Higher order (2,4) FDTD schemes used for numerical solutions of Maxwell`s equations are focused on diminishing the truncation errors caused by the Taylor series expansion of the spatial derivatives. These schemes use a larger computational stencil, which generally makes use of the two constant coefficients, C-1 and C-2, for the four-point central-difference operators. In this paper we propose a novel way to diminish these truncation errors, in order to obtain more accurate numerical solutions of Maxwell`s equations. For such purpose, we present a method to individually optimize the pair of coefficients, C-1 and C-2, based on any desired grid size resolution and size of time step. Particularly, we are interested in using coarser grid discretizations to be able to simulate electrically large domains. The results of our optimization algorithm show a significant reduction in dispersion error and numerical anisotropy for all modeled grid size resolutions. Numerical simulations of free-space propagation verifies the very promising theoretical results. The model is also shown to perform well in more complex, realistic scenarios.

A Levinson algorithm based on an isometric transformation of Durbin`s

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.

Distributed power control algorithm for multiple access systems based on Verhulst model

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.

The Policy Iteration Algorithm for Average Continuous Control of Piecewise Deterministic Markov Processes

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.

Optimization of the Topology of Electric Energy Distribution Networks by Using Algorithm Inspired on Ant Behaviors

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.

Avoiding Divergence in the Shalvi-Weinstein Algorithm

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.

Jointly multi-user detection and channel estimation with genetic algorithm

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.

Hardware/firmware implementation of a soft sensor using an improved version of a fuzzy identification algorithm

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.

Metal separation from mixed types of batteries using selective precipitation and liquid-liquid extraction techniques

The purpose of this paper is to study metal separation from a sample composed of a mixture of the main types of spent household batteries, using a hydrometallurgical route, comparing selective precipitation and liquid-liquid extraction separation techniques. The preparation of the solution consisted of: grinding the waste of mixed batteries, reduction and volatile metals elimination using electric furnace and acid leaching. From this solution two different routes were studied: selective precipitation with sodium hydroxide and liquid-liquid extraction using Cyanex 272 [bis(2,4,4-trimethylpentyl) phosphoric acid] as extracting agent. The best results were obtained from liquid-liquid extraction in which Zn had a 99% extraction rate at pH 2.5. More than 95% Fe was extracted at pH 7.0, the same pH at which more than 90% Ce was extracted. About 88% Mn, Cr and Co was extracted at this pH. At pH 3.0, more than 85% Ni was extracted, and at pH 3.5 more than 80% of Cd and La was extracted. (C) 2010 Elsevier Ltd. All rights reserved.

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.

MULTIVARIATE STATISTICAL METHOD IN OPTIMIZATION OF PROTEIN EXTRACTION FROM SOYBEAN FLOUR WITH DAIRY WHEY

The aim objective of this project was to evaluate the protein extraction of soybean flour in dairy whey, by the multivariate statistical method with 2(3) experiments. Influence of three variables were considered: temperature, pH and percentage of sodium chloride against the process specific variable ( percentage of protein extraction). It was observed that, during the protein extraction against time and temperature, the treatments at 80 degrees C for 2h presented great values of total protein (5.99%). The increasing for the percentage of protein extraction was major according to the heating time. Therefore, the maximum point from the function that represents the protein extraction was analysed by factorial experiment 2(3). By the results, it was noted that all the variables were important to extraction. After the statistical analyses, was observed that the parameters as pH, temperature, and percentage of sodium chloride, did not sufficient for the extraction process, since did not possible to obtain the inflection point from mathematical function, however, by the other hand, the mathematical model was significant, as well as, predictive.

Probing the hormonal activity of fractionated molecular humic components in tomato auxin mutants

We progressively reduced the complexity of humic matter by a mild sequential removal of unbound or free components, weakly, and strongly bound molecules. The auxin-like response of residues from each step was tested using tomato (cv. Micro-Tom) seedlings expressing DR5 auxin synthetic promoter fused to the beta-glucuronidase (GUS) reporter gene and the low auxin-sensitivity diageotropica (dgt) mutant. Both exogenous auxin and humic matter promoted lateral root emergence in the control, but failed to induce lateral roots in the dgt mutant. When strongly bound components were removed from humic matter by breaking the ester and ether bonds, the humic residues lost their ability to induce the DR5

Permanent Genetic Resources added to Molecular Ecology Resources Database 1 August 2010-30 September 2010

This article documents the addition of 229 microsatellite marker loci to the Molecular Ecology Resources Database. Loci were developed for the following species: Acacia auriculiformis x Acacia mangium hybrid, Alabama argillacea, Anoplopoma fimbria, Aplochiton zebra, Brevicoryne brassicae, Bruguiera gymnorhiza, Bucorvus leadbeateri, Delphacodes detecta, Tumidagena minuta, Dictyostelium giganteum, Echinogammarus berilloni, Epimedium sagittatum, Fraxinus excelsior, Labeo chrysophekadion, Oncorhynchus clarki lewisi, Paratrechina longicornis, Phaeocystis antarctica, Pinus roxburghii and Potamilus capax. These loci were cross-tested on the following species: Acacia peregrinalis, Acacia crassicarpa, Bruguiera cylindrica, Delphacodes detecta, Tumidagena minuta, Dictyostelium macrocephalum, Dictyostelium discoideum, Dictyostelium purpureum, Dictyostelium mucoroides, Dictyostelium rosarium, Polysphondylium pallidum, Epimedium brevicornum, Epimedium koreanum, Epimedium pubescens, Epimedium wushanese and Fraxinus angustifolia.

Molecular detection and differentiation of Brazilian and African isolates of the entomopathogen Neozygites tanajoae (Entomophthorales: Neozygitaceae) with PCR using specific primers

Neozygites tanajoae is an entomopathogenic fungus which has been used for biocontrol of the cassava green mite (Mononychellus tanajoa, CGM) in Africa. Establishment and dispersal of Brazilian isolates which have been introduced into some African countries in recent years to improve CGM control was followed with specific PCR assays. Two primer pairs, NEOSSU_F/NEOSSU_R and 8DDC_F/8DDC_R, were used to differentiate isolates collected from several locations in Brazil and from three countries in Africa, Benin, Ghana and Tanzania. The first primer pair enabled the species-specific detection of Neozygites tanajoae, while the second differentiated the Brazilian isolates from those of other geographical origin. PCR assays were designed for detection of fungal DNA in the matrix of dead infested mites since N. tanajoae is difficult to isolate and culture on selective artificial media. Our results show that all isolates (Brazilian and African) that sporulated on mummified mites were amplified with the first primer pair confirming their Neozygites tanajoae identity. The second pair amplified DNA from all the Brazilian isolates, but did not amplify any DNA samples from the African isolates. None of the two primers showed amplification neither from any of the non-sporulating mite extracts nor from the dead uninfected mites used as negative controls. We confirmed that the two primer pairs tested are suitable for the detection and differential identification of N. tanajoae isolates from Brazil and Africa and that they are useful to monitor the establishment and spread of the Brazilian isolates of N. tanajoae introduced into Benin or into other African countries for improvement of CGM biocontrol.

Root Water Extraction under Combined Water and Osmotic Stress

Using a numerical implicit model for root water extraction by a single root in a symmetric radial flow problem, based on the Richards equation and the combined convection-dispersion equation, we investigated some aspects of the response of root water uptake to combined water and osmotic stress. The model implicitly incorporates the effect of simultaneous pressure head and osmotic head on root water uptake, and does not require additional assumptions (additive or multiplicative) to derive the combined effect of water and salt stress. Simulation results showed that relative transpiration equals relative matric flux potential, which is defined as the matric flux potential calculated with an osmotic pressure head-dependent lower bound of integration, divided by the matric flux potential at the onset of limiting hydraulic conditions. In the falling rate phase, the osmotic head near the root surface was shown to increase in time due to decreasing root water extraction rates, causing a more gradual decline of relative transpiration than with water stress alone. Results furthermore show that osmotic stress effects on uptake depend on pressure head or water content, allowing a refinement of the approach in which fixed reduction factors based on the electrical conductivity of the saturated soil solution extract are used. One of the consequences is that osmotic stress is predicted to occur in situations not predicted by the saturation extract analysis approach. It is also shown that this way of combining salinity and water as stressors yields results that are different from a purely multiplicative approach. An analytical steady state solution is presented to calculate the solute content at the root surface, and compared with the outputs of the numerical model. Using the analytical solution, a method has been developed to estimate relative transpiration as a function of system parameters, which are often already used in vadose zone models: potential transpiration rate, root length density, minimum root surface pressure head, and soil theta-h and K-h functions.