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.

Recognition of noisy images by PLL networks

We use networks composed of three phase-locked loops (PLLs), where one of them is the master, for recognizing noisy images. The values of the coupling weights among the PLLs control the noise level which does not affect the successful identification of the input image. Analytical results and numerical tests are presented concerning the scheme performance. (c) 2008 Elsevier B.V. All rights reserved.

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.

SKAN: Skin Scanner - System for Skin Cancer Detection Using Adaptive Techniques

SKAN: Skin Scanner - System for Skin Cancer Detection Using Adaptive Techniques - combines computer engineering concepts with areas like dermatology and oncology. Its objective is to discern images of skin cancer, specifically melanoma, from others that show only common spots or other types of skin diseases, using image recognition. This work makes use of the ABCDE visual rule, which is often used by dermatologists for melanoma identification, to define which characteristics are analyzed by the software. It then applies various algorithms and techniques, including an ellipse-fitting algorithm, to extract and measure these characteristics and decide whether the spot is a melanoma or not. The achieved results are presented with special focus on the adaptive decision-making and its effect on the diagnosis. Finally, other applications of the software and its algorithms are presented.

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.

Democracy on the Edge: Limits and Possibilities in the Implementation of an Urban Reform Agenda in Brazil

The 1990s in Brazil were a time of institutional advances in the areas of housing and urban rights following the signing of the new constitution in 1988 that incorporated the principles of the social function of cities and property, recognition of the right to ownership of informal urban squatters and the direct participation of citizens in urban policy decision processes. These propositions are the pillars of the urban reform agenda which, since the creation of the Ministry of Cities by the Lula government, has come under the federal executive branch. This article evaluates the limitations and opportunities involved in implementing this agenda on the basis of two policies proposed by the ministry - the National Cities Council and the campaign for Participatory Master Plans - focusing the analysis on government organization in the area of urban development in its relationship with the political system and the characteristics of Brazilian democracy. Resume Au Bresil, les annees 1990 ont ete marquees par des progres institutionnels en matiere de logement et de droits urbains, dans le sillage de la Constitution de 1988 qui integre les principes d`une fonction sociale de la ville et de la propriete urbaine, ainsi que la reconnaissance du droit a la propriete pour les squatters urbains et la participation directe des citoyens aux processus d`elaboration des politiques urbaines. Ce sont egalement les piliers du programme de reforme urbaine qui releve de l`executif federal depuis la creation d`un ministere des Villes par le gouvernement Lula. Pour evaluer les limites et potentiels lies a la mise en place de ce programme, cet article s`appuie sur deux politiques publiques proposees par le ministere, le Conseil national des villes et la campagne en faveur des Plans directeurs participatifs, en analysant plus particulierement l`organisation gouvernementale en matiere d`urbanisme par rapport au systeme politique et aux caracteristiques de la democratie bresilienne.

Restoration of Pattern Recognition Receptor Costimulation to Treat Chromoblastomycosis, a Chronic Fungal Infection of the Skin

Chromoblastomycosis is a chronic skin infection caused by the fungus Fonsecaea pedrosoi. Exploring the reasons underlying the chronic nature of F. pedrosoi infection in a murine model of chromoblastomycosis, we find that chronicity develops due to a lack of pattern recognition receptor (PRR) costimulation. F. pedrosoi was recognized primarily by C-type lectin receptors (CLRs), but not by Toll-like receptors (TLRs), which resulted in the defective induction of proinflammatory cytokines. Inflammatory responses to F. pedrosoi could be reinstated by TLR costimulation, but also required the CLR Mincle and signaling via the Syk/CARD9 pathway. Importantly, exogenously administering TLR ligands helped clear F. pedrosoi infection in vivo. These results demonstrate how a failure in innate recognition can result in chronic infection, highlight the importance of coordinated PRR signaling, and provide proof of the principle that exogenously applied PRR agonists can be used therapeutically.

Plasmodium vivax apical membrane antigen-1: comparative recognition of different domains by antibodies induced during natural human infection

The Apical Membrane Antigen-1 (AMA-1) of Plasmodium sp. has been suggested as a vaccine candidate against malaria. This protein seems to be involved in merozoite invasion and its extra-cellular portion contains three distinct domains: DI, DII, and DIII. Previously, we described that Plasmodium vivax AMA-1 (PvAMA-1) ectodomain is highly immunogenic in natural human infections. Here, we expressed each domain, separately or in combination (DI-II or DII-III), as bacterial recombinant proteins to map immunodominant epitopes within the PvAMA-1 ectodomain. IgG recognition was assessed by ELISA using sera of P. vivax-infected individuals collected from endemic regions of Brazil or antibodies raised in immunized mice. The frequencies of responders to recombinant proteins containing the DII were higher than the others and similar to the ones observed against the PvAMA-1 ectodomain. Moreover, ELISA inhibition assays using the PvAMA-1 ectodomain as substrate revealed the presence of many common epitopes within DI-II that are recognized by human immune antibodies. Finally, immunization of mice with the PvAMA-1 ectodomain induced high levels of antibodies predominantly to DI-II. Together, our results indicate that DII is particularly immunogenic during natural human infections, thus indicating that this region could be used as part of an experimental sub-unit vaccine to prevent vivax malaria. (C) 2008 Elsevier Masson SAS. All rights reserved.

Nestmate recognition in a stingless bee: does the similarity of chemical cues determine guard acceptance?

The ability to discriminate nestmates from non-nestmates is critical to the maintenance of the integrity of social insect colonies. Guard workers compare the chemical cues of an incoming individual with their internal template to determine whether the entrant belongs to their colony. In contrast to honeybees, Apis mellifera, stingless bees have singly mated queens and, therefore, are expected to have a higher chemical homogeneity in their colonies. We tested whether aggressive behaviour of Frieseomelitta varia guards towards nestmate and non-nestmate foragers reflects chemical similarities and dissimilarities, respectively, of cuticular hydrocarbon profiles. We also introduced individuals of Lestrimelitta limao, an obligatory robber species, to test the ability of guards to react effectively to intruders from other taxa. We verified that foraging nestmates were almost invariably accepted, while heterospecific and conspecific non-nestmates were rejected at relatively high rates. However, non-nestmate individuals with higher chemical profile similarity were likely to be accepted by guards. We conclude that guards compare the chemical cuticular blend of incoming individuals and make acceptance decisions according to the similarity of the compounds between the colonies. (c) 2007 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Effects of temporal association on recognition memory

The influence of temporal association on the representation and recognition of objects was investigated. Observers were shown sequences of novel faces in which the identity of the face changed as the head rotated. As a result, observers showed a tendency to treat the views as if they were of the same person. Additional experiments revealed that this was only true if the training sequences depicted head rotations rather than jumbled views; in other words, the sequence had to be spatially as well as temporally smooth. Results suggest that we are continuously associating views of objects to support later recognition, and that we do so not only on the basis of the physical similarity, but also the correlated appearance in time of the objects.

Spectral peak resolution and speech recognition in quiet: Normal hearing, hearing impaired and cochlear implant listeners

Spectral peak resolution was investigated in normal hearing (NH), hearing impaired (HI), and cochlear implant (CI) listeners. The task involved discriminating between two rippled noise stimuli in which the frequency positions of the log-spaced peaks and valleys were interchanged. The ripple spacing was varied adaptively from 0.13 to 11.31 ripples/octave, and the minimum ripple spacing at which a reversal in peak and trough positions could be detected was determined as the spectral peak resolution threshold for each listener. Spectral peak resolution was best, on average, in NH listeners, poorest in CI listeners, and intermediate for HI listeners. There was a significant relationship between spectral peak resolution and both vowel and consonant recognition in quiet across the three listener groups. The results indicate that the degree of spectral peak resolution required for accurate vowel and consonant recognition in quiet backgrounds is around 4 ripples/octave, and that spectral peak resolution poorer than around 1–2 ripples/octave may result in highly degraded speech recognition. These results suggest that efforts to improve spectral peak resolution for HI and CI users may lead to improved speech recognition