Stochastic stability analysis for the constant-modulus algorithm

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.

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.

Direct drinking water treatment by spiral-wound ultrafiltration membranes

This paper presents the results of a research on direct drinking water treatment through an ultrafiltration pilot plant unit using spiral-wound membranes (3500 MWCO). The source of water is the Guarapiranga Reservoir, an eutrophicated water body located in the metropolitan region of Sao Paulo, Brazil. The data were collected during a period of almost 3400 h, from August 2005 to January 2006. The main objective of the study was to evaluate the membrane production capacity and contaminant removal efficiency. It was verified that the system was able to produce a high quality permeate with a flow close to the specified by the membrane manufacturer. The average permeate flow was 19.7 L.h(-1).m(-2), at 467 kPa and 25 degrees C, with a global water recovery of almost 85%. The removal efficiencies for TOC, UV light absorption, and turbidity were 85%, 56%, and 95%, respectively. The results provide substantial evidence of the technical feasibility of spiral-wound UF membranes for direct drinking water treatment from euthrophicated sources, as an alternative for conventional drinking water treatment systems.

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.

Influence of the heat treatment on the nucleation of silver nanoparticles in Tm(3+) doped PbO-GeO(2) glasses

Nucleation of silver nanoparticles (NPs) in Tm(3+) doped PbO-GeO(2) (PGO) glass is reported. The influence of the heat treatment on the nucleation of silver NPs is studied by means of transmission electron microscopy and optical spectroscopy. Two heat treatment procedures were applied in order to compare their performance. Observation of infrared-to-visible frequency upconversion (UC) luminescence of Tm(3+) ions is reported and correlated with the heat-treatment procedure. Enhancement of the UC emission for samples heat treated during various time intervals is attributed to the increased local field in the vicinity of the NPs. Quenching of the UC signal was also observed and correlated with the growth of NPs amount and size.

Water Treatment Plant Sludge Discharge to Wastewater Treatment Works: Effects on the Operation of Upflow Anaerobic Sludge Blanket Reactor and Activated Sludge Systems

This experiment examined the effects of the discharge of water treatment plant (WTP) sludge into the following three types of wastewater treatment systems: a pilot-scale upflow anaerobic sludge blanket (UASB) reactor, a pilot-scale activated sludge system, and a full-scale activated sludge sequencing batch reactor (SBR). The UASB reactor received 50 mg of suspended solids ( SS) of WTP sludge per liter of wastewater in the first phase, and, in the second phase, it received 75 mg SS/L. The pilot-scale activated sludge system received 25 and 50 mg SS/L in the first and second phases, respectively. The full-scale WWTP ( SBR) received approximately 74 mg SS/L. The results of the experiments showed that, despite some negative effects on nitrification, there were positive effects on phosphorus removal, and, furthermore, there was the addition of solids in all systems. Water Environ. Res., 82, 392 ( 2010).

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.

OPTIMIZATION OF THE TREATMENT PROCESS FOR RESIDUAL WATER FROM A BEER INDUSTRY

The optimization of the treatment process for residual waters from a brewery operating under the modality of an anaerobic reactor and activated sludge combination was studied in two phases. In the first stage, lasting for six months, the characteristics and parameters of the plant operation were analyzed, wherein a diversion rate of more than 50% to aerobic treatment, the use of two aeration tanks and a high sludge production prevailed. The second stage comprised four months during which the system worked under the proposed operational model, with the aim of improving the treatment: reduction of the diversion rate to 30% and use of only one aeration tank At each stage, TSS, VSS and COD were measured at the entrance and exit of the anaerobic reactor mid the aeration tanks. The results were compared with the corresponding design specifications and the needed conditions were applied to reduce the diversion rate towards the aerobic process through monitoring the volume and concentration of the affluent, while applying the strategic changes in reactor parameters needed to increase its efficiency. A diversion reduction from 53 to 34% was achieved, reducing the sludge discharge generated in the aerobic system from 3670mg TSS/l. with two aeration tanks down to 2947mf TSS/l using one tank keeping the same relation VSS:TSS (0.55) and an efficiency of total removal of 98% in terms of COD.

Heat-moisture treatment and enzymatic digestibility of Peruvian carrot, sweet potato and ginger starches

The aim of this work was to study the effects of heat-moisture treatment (27% moisture, 100 degrees C, 16 h) and of enzymatic digestion (alpha-amylase and glucoamylase) on the properties of sweet potato (SP), Peruvian carrot (PC) and ginger (G) starches. The structural modification with heat-moisture treatment (HMT) affected crystallinity, enzyme susceptibility and viscosity profile. The changes in PC starch were the most pronounced, with a strong decrease of relative crystallinity (from 0.31 to 0.21) and a shift of X-ray pattern from B- to A-type. HMTof SP and G starch did not change the Xray pattern (A-type). The relative crystallinity of these starches changed only slightly, from 0.32 to 0.29 (SP) and from 0.33 to 0.32 (G). The extent of these structural changes (PC > SP > G) altered the susceptibility of the starches to enzymatic attack, but not in same order (PC > G > SP). HMT increased the starches digestion, probably due to rearrangement of disrupted crystallites, increasing accessible areas to attack of enzymes. The viscosity profiles and values changed significantly with HMT, resulting in higher pasting temperatures, decrease of viscosity values and no breakdown, i.e., stability at high temperatures and shear rates. Changes in pasting properties appeared to be more significant for PC and SP starch, whereas the changes for G starch were small. Setback was minimized following HMT in SP and G starches.