Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning

Simulated annealing (SA) is an optimization technique that can process cost functions with degrees of nonlinearities, discontinuities and stochasticity. It can process arbitrary boundary conditions and constraints imposed on these cost functions. The SA technique is applied to the problem of robot path planning. Three situations are considered here: the path is represented as a polyline; as a Bezier curve; and as a spline interpolated curve. In the proposed SA algorithm, the sensitivity of each continuous parameter is evaluated at each iteration increasing the number of accepted solutions. The sensitivity of each parameter is associated to its probability distribution in the definition of the next candidate. (C) 2010 Elsevier Ltd. All rights reserved.

Adaptive Carrier Tracking for Mars to Earth Communications During Entry, Descent, and Landing

We propose a robust and low complexity scheme to estimate and track carrier frequency from signals traveling under low signal-to-noise ratio (SNR) conditions in highly nonstationary channels. These scenarios arise in planetary exploration missions subject to high dynamics, such as the Mars exploration rover missions. The method comprises a bank of adaptive linear predictors (ALP) supervised by a convex combiner that dynamically aggregates the individual predictors. The adaptive combination is able to outperform the best individual estimator in the set, which leads to a universal scheme for frequency estimation and tracking. A simple technique for bias compensation considerably improves the ALP performance. It is also shown that retrieval of frequency content by a fast Fourier transform (FFT)-search method, instead of only inspecting the angle of a particular root of the error predictor filter, enhances performance, particularly at very low SNR levels. Simple techniques that enforce frequency continuity improve further the overall performance. In summary we illustrate by extensive simulations that adaptive linear prediction methods render a robust and competitive frequency tracking technique.

Transient and Steady-State Analysis of the Affine Combination of Two Adaptive Filters

In this paper, we propose an approach to the transient and steady-state analysis of the affine combination of one fast and one slow adaptive filters. The theoretical models are based on expressions for the excess mean-square error (EMSE) and cross-EMSE of the component filters, which allows their application to different combinations of algorithms, such as least mean-squares (LMS), normalized LMS (NLMS), and constant modulus algorithm (CMA), considering white or colored inputs and stationary or nonstationary environments. Since the desired universal behavior of the combination depends on the correct estimation of the mixing parameter at every instant, its adaptation is also taken into account in the transient analysis. Furthermore, we propose normalized algorithms for the adaptation of the mixing parameter that exhibit good performance. Good agreement between analysis and simulation results is always observed.

Distributed Estimation Over an Adaptive Incremental Network Based on the Affine Projection Algorithm

We study the problem of distributed estimation based on the affine projection algorithm (APA), which is developed from Newton`s method for minimizing a cost function. The proposed solution is formulated to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The analysis of transient and steady-state performances at each individual node within the network is developed by using a weighted spatial-temporal energy conservation relation and confirmed by computer simulations. The simulation results also verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance with lower computational and memory cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, as compared to a distributed recursive-least-squares (RLS) based method.

Improving the tracking capability of adaptive filters via convex combination

As is well known, Hessian-based adaptive filters (such as the recursive-least squares algorithm (RLS) for supervised adaptive filtering, or the Shalvi-Weinstein algorithm (SWA) for blind equalization) converge much faster than gradient-based algorithms [such as the least-mean-squares algorithm (LMS) or the constant-modulus algorithm (CMA)]. However, when the problem is tracking a time-variant filter, the issue is not so clear-cut: there are environments for which each family presents better performance. Given this, we propose the use of a convex combination of algorithms of different families to obtain an algorithm with superior tracking capability. We show the potential of this combination and provide a unified theoretical model for the steady-state excess mean-square error for convex combinations of gradient- and Hessian-based algorithms, assuming a random-walk model for the parameter variations. The proposed model is valid for algorithms of the same or different families, and for supervised (LMS and RLS) or blind (CMA and SWA) algorithms.

A vaccination game based on public health actions and personal decisions

Susceptible-infective-removed (SIR) models are commonly used for representing the spread of contagious diseases. A SIR model can be described in terms of a probabilistic cellular automaton (PCA), where each individual (corresponding to a cell of the PCA lattice) is connected to others by a random network favoring local contacts. Here, this framework is employed for investigating the consequences of applying vaccine against the propagation of a contagious infection, by considering vaccination as a game, in the sense of game theory. In this game, the players are the government and the susceptible newborns. In order to maximize their own payoffs, the government attempts to reduce the costs for combating the epidemic, and the newborns may be vaccinated only when infective individuals are found in their neighborhoods and/or the government promotes an immunization program. As a consequence of these strategies supported by cost-benefit analysis and perceived risk, numerical simulations show that the disease is not fully eliminated and the government implements quasi-periodic vaccination campaigns. (C) 2011 Elsevier B.V. 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 AdapLib Library for Execution of Adaptive Devices: Architecture and Use

In this paper it is presented the theoretical background, the architecture (using the ""4+1"" model), and the use of the library for execution of adaptive devices, AdapLib. This library was created seeking to be accurate to the adaptive devices theory, and to allow its easy extension considering the specific details of solutions that employ this kind of device. As an example, it is presented a case study in which the library was used to create a proof of concept to monitor and diagnose problems in an online news portal.

Plasmodium vivax recombinant vaccine candidate AMA-1 plays an important role in adaptive immune response eliciting differentiation of dendritic cells

The Apical Membrane Antigen-1 (AMA-1) is a well-characterized and functionally important merozoite protein and is currently considered a major candidate antigen for a malaria vaccine. Previously, we showed that AMA-1 has an influence on cellular immune responses of malaria-naive subjects, resulting in an alternative activation of monocyte-derived dendritic cells and induction of a pro-inflammatory response by stimulated PBMCs. Although there is evidence, from human and animal malaria model systems that cell-mediated immunity may contribute to both protection and pathogenesis, the knowledge on cellular immune responses in vivax malaria and the factors that may regulate this immunity are poorly understood. In the current work, we describe the maturation of monocyte-derived dendritic cells of P. vivax naturally infected individuals and the effect of P. vivax vaccine candidate Pv-AMA-1 on the immune responses of the same donors. We show that malaria-infected subjects present modulation of DC maturation, demonstrated by a significant decrease in expression of antigen-presenting molecules (CD1a, HLA-ABC and HLA-DR), accessory molecules (CD40, CD80 and CD86) and Fc gamma RI (CD64) receptor (P <= 0.05). Furthermore, Pv-AMA-1 elicits an upregulation of CD1a and HLA-DR molecules on the surface of monocyte-derived dendritic cells (P=0.0356 and P=0.0196, respectively), and it is presented by AMA-1-stimulated DCs. A significant pro-inflammatory response elicited by Pv-AMA-1-pulsed PBMCs is also demonstrated, as determined by significant production of TNF-alpha, IL-12p40 and IFN-gamma (P <= 0.05). Our results suggest that Pv-AMA-1 may partially revert DC down-modulation observed in infected subjects, and exert an important role in the initiation of pro-inflammatory immunity that might contribute substantially to protection. (c) 2009 Elsevier Ltd. All rights reserved.

The game to play: expanding the co-opetition proposal through the strategic games matrix

Purpose - Using Brandenburger and Nalebuff`s 1995 co-opetition model as a reference, the purpose of this paper is to seek to develop a tool that, based on the tenets of classical game theory, would enable scholars and managers to identify which games may be played in response to the different conflict of interest situations faced by companies in their business environments. Design/methodology/approach - The literature on game theory and business strategy are reviewed and a conceptual model, the strategic games matrix (SGM), is developed. Two novel games are described and modeled. Findings - The co-opetition model is not sufficient to realistically represent most of the conflict of interest situations faced by companies. It seeks to address this problem through development of the SGM, which expands upon Brandenburger and Nalebuff`s model by providing a broader perspective, through incorporation of an additional dimension (power ratio between players) and three novel, respectively, (rival, individualistic, and associative). Practical implications - This proposed model, based on the concepts of game theory, should be used to train decision- and policy-makers to better understand, interpret and formulate conflict management strategies. Originality/value - A practical and original tool to use game models in conflict of interest situations is generated. Basic classical games, such as Nash, Stackelberg, Pareto, and Minimax, are mapped on the SGM to suggest in which situations they Could be useful. Two innovative games are described to fit four different types of conflict situations that so far have no corresponding game in the literature. A test application of the SGM to a classic Intel Corporation strategic management case, in the complex personal computer industry, shows that the proposed method is able to describe, to interpret, to analyze, and to prescribe optimal competitive and/or cooperative strategies for each conflict of interest situation.

A note on the multiple partners assignment game

In the assignment game of Shapley and Shubik [Shapley, L.S., Shubik, M., 1972. The assignment game. I. The core, International journal of Game Theory 1, 11-130] agents are allowed to form one partnership at most. That paper proves that, in the context of firms and workers, given two stable payoffs for the firms there is a stable payoff which gives each firm the larger of the two amounts and also one which gives each of them the smaller amount. Analogous result applies to the workers. Sotomayor [Sotomayor, M., 1992. The multiple partners game. In: Majumdar, M. (Ed.), Dynamics and Equilibrium: Essays in Honor to D. Gale. Mcmillian, pp. 322-336] extends this analysis to the case where both types of agents may form more than one partnership and an agent`s payoff is multi-dimensional. Instead, this note concentrates in the total payoff of the agents. It is then proved the rather unexpected result that again the maximum of any pair of stable payoffs for the firms is stable but the minimum need not be, even if we restrict the multiplicity of partnerships to one of the sides. (C) 2009 Elsevier B.V. All rights reserved.

Adjusting prices in the multiple-partners assignment game

Starting with an initial price vector, prices are adjusted in order to eliminate the excess demand and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which set of sellers should those transfers be made is the key issue in the description of the algorithm. We assume additively separable utilities and introduce a novel distinction by considering multiple sellers owing multiple identical objects and multiple buyers with an exogenously defined quota, consuming more than one object but at most one unit of a seller`s good and having multi-dimensional payoffs. This distinction induces a necessarily more complicated construction of the over-demanded sets than the constructions of these sets for the other assignment games. For this approach, our mechanism yields the buyer-optimal competitive equilibrium payoff, which equals the buyer-optimal stable payoff. The symmetry of the model allows to getting the seller-optimal stable payoff and the seller-optimal competitive equilibrium payoff can then be also derived.

In situ apoptosis of adaptive immune cells and the cellular escape of rabies virus in CNS from patients with human rabies transmitted by Desmodus rotundus

The aim of the current study was to investigate the apoptosis of neurons, astrocytes and immune cells from human patients that were infected with rabies virus by vampire bats bite. Apoptotic neurons were identified by their morphology and immune cells were identified using double immunostaining. There were very few apoptotic neurons present in infected tissue samples, but there was an increase of apoptotic infiltrating CD4+ and TCD8+ adaptive immune cells in the rabies infected tissue. No apoptosis was present in NK, macrophage and astrocytes. The dissemination of the human rabies virus within an infected host may be mediated by viral escape of the virus from an infected cell and may involve an anti-apoptotic mechanism, which does not kill the neuron or pro-apoptosis of TCD4+ and TCD8+ lymphocytes and which allows for increased proliferation of the virus within the CNS by attenuation of the adaptive immune response. (C) 2011 Elsevier B.V. All rights reserved.

A description of adaptive and maladaptive behaviour in children and adolescents with Cri-du-chat syndrome

Background Psychological tests can be useful to record adaptive and maladaptive behaviours of children with intellectual disability. The objective of this study was to describe the adaptive and maladaptive behaviour of children and adolescents with Cri-du-chat syndrome. Methods The sample consisted of 10 children and adolescents with Cri-du-chat syndrome (mean chronological age = 11.3 years, mean mental age = 18 months). The developmental quotient was calculated through the Psychoeducational Profile - Revised. An observational protocol was used to record adaptive and maladaptive behaviours. Results The number of maladaptive behaviours observed was different among participants. However, all of them had high rates of adaptive behaviours, such as rule-following. Conclusions These results, though preliminary, justify that we continue to think about the need for psychoeducational interventions aimed at stimulating the repertoire of adaptive behaviours, in people with Cri-du-chat syndrome.

Increased number and function of natural killer cells in human immunodeficiency virus 1-positive subjects co-infected with herpes simplex virus 2

P>Natural killer (NK) cells bridge the interface between innate and adaptive immunity and are implicated in the control of herpes simplex virus 2 (HSV-2) infection. In subjects infected with human immunodeficiency virus 1 (HIV-1), the critical impact of the innate immune response on disease progression has recently come into focus. Higher numbers of NK cells are associated with lower HIV-1 plasma viraemia. Individuals with the compound genotype of killer cell immunoglobulin-like receptor (KIR) 3DS1 and human leucocyte antigen (HLA)-Bw4-80I, or who have alleles of KIR3DL1 that encode proteins highly expressed on the NK cell surface, have a significant delay in disease progression. We studied the effect of HSV-2 co-infection in HIV-1-infected subjects, and show that HSV-2 co-infection results in a pan-lymphocytosis, with elevated absolute numbers of CD4+ and CD8+ T cells, and NK cells. The NK cells in HSV-2 co-infected subjects functioned more efficiently, with an increase in degranulation after in vitro stimulation. The number of NK cells expressing the activating receptors NKp30 and NKp46, and expressing KIR3DL1 or KIR3DS1, was inversely correlated with HIV-1 plasma viral load in subjects mono-infected with HIV-1, but not in subjects co-infected with HSV-2. This suggests that HSV-2 infection mediates changes within the NK cell population that may affect immunity in HIV-1 infection.