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.

Fast Transforms for Acoustic Imaging-Part II: Applications

In Part I [""Fast Transforms for Acoustic Imaging-Part I: Theory,"" IEEE TRANSACTIONS ON IMAGE PROCESSING], we introduced the Kronecker array transform (KAT), a fast transform for imaging with separable arrays. Given a source distribution, the KAT produces the spectral matrix which would be measured by a separable sensor array. In Part II, we establish connections between the KAT, beamforming and 2-D convolutions, and show how these results can be used to accelerate classical and state of the art array imaging algorithms. We also propose using the KAT to accelerate general purpose regularized least-squares solvers. Using this approach, we avoid ill-conditioned deconvolution steps and obtain more accurate reconstructions than previously possible, while maintaining low computational costs. We also show how the KAT performs when imaging near-field source distributions, and illustrate the trade-off between accuracy and computational complexity. Finally, we show that separable designs can deliver accuracy competitive with multi-arm logarithmic spiral geometries, while having the computational advantages of the KAT.

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.

Self-organized criticality and the predictability of human behavior

The behavior of normal individuals and psychiatric patients vary in a similar way following power laws. The presence of identical patterns of behavioral variation occurring in individuals with different levels of activity is suggestive of self-similarity phenomena. Based on these findings, we propose that the human behavior in social context can constitute a system exhibiting self-organized criticality (SOC). The introduction of SOC concept in psychological theories can help to approach the question of behavior predictability by taking into consideration their intrinsic stochastic character. Also, the ceteris paribus generalizations characteristic of psychological laws can be seen as a consequence of individual level description of a more complex collective phenomena. Although limited, this study suggests that, if an adequate level of description is adopted, the complexity of human behavior can be more easily approached and their individual and social components can be more realistically modeled. (C) 2009 Elsevier Ltd. All rights reserved.

Simple Excitation Model for Coaxial Driven Monopole Antennas

A new excitation model for the numerical solution of field integral equation (EFIE) applied to arbitrarily shaped monopole antennas fed by coaxial lines is presented. This model yields a stable solution for the input impedance of such antennas with very low numerical complexity and without the convergence and high parasitic capacitance problems associated with the usual delta gap excitation.

Local search multiuser detection

In this work, a wide analysis of local search multiuser detection (LS-MUD) for direct sequence/code division multiple access (DS/CDMA) systems under multipath channels is carried out considering the performance-complexity trade-off. It is verified the robustness of the LS-MUD to variations in loading, E(b)/N(0), near-far effect, number of fingers of the Rake receiver and errors in the channel coefficients estimates. A compared analysis of the bit error rate (BER) and complexity trade-off is accomplished among LS, genetic algorithm (GA) and particle swarm optimization (PSO). Based on the deterministic behavior of the LS algorithm, it is also proposed simplifications over the cost function calculation, obtaining more efficient algorithms (simplified and combined LS-MUD versions) and creating new perspectives for the MUD implementation. The computational complexity is expressed in terms of the number of operations in order to converge. Our conclusion pointed out that the simplified LS (s-LS) method is always more efficient, independent of the system conditions, achieving a better performance with a lower complexity than the others heuristics detectors. Associated to this, the deterministic strategy and absence of input parameters made the s-LS algorithm the most appropriate for the MUD problem. (C) 2008 Elsevier GmbH. All rights reserved.

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.

S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

This paper analyzes the complexity-performance trade-off of several heuristic near-optimum multiuser detection (MuD) approaches applied to the uplink of synchronous single/multiple-input multiple-output multicarrier code division multiple access (S/MIMO MC-CDMA) systems. Genetic algorithm (GA), short term tabu search (STTS) and reactive tabu search (RTS), simulated annealing (SA), particle swarm optimization (PSO), and 1-opt local search (1-LS) heuristic multiuser detection algorithms (Heur-MuDs) are analyzed in details, using a single-objective antenna-diversity-aided optimization approach. Monte- Carlo simulations show that, after convergence, the performances reached by all near-optimum Heur-MuDs are similar. However, the computational complexities may differ substantially, depending on the system operation conditions. Their complexities are carefully analyzed in order to obtain a general complexity-performance framework comparison and to show that unitary Hamming distance search MuD (uH-ds) approaches (1-LS, SA, RTS and STTS) reach the best convergence rates, and among them, the 1-LS-MuD provides the best trade-off between implementation complexity and bit error rate (BER) performance.

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.

Mapping the Contemporary Studies on Alliances and Strategic Networks

The competition among the companies depends on the velocity and efficience they can create and commercialize knowledge in a timely and cost-efficient manner. In this context, collaboration emerges as a reaction to the environmental changes. Although strategic alliances and networks have been exploited in the strategic literature for decades, the complexity and continuous usage of these cooperation structures, in a world of growing competition, justify the continuous interest in both themes. This article presents a scanning of the contemporary academic production in strategic alliances and networks, covering the period from January 1997 to august 2007, based on the top five journals accordingly to the journal of Citation Report 2006 in the business and management categories simultaneously. The results point to a retraction in publications about strategic alliances and a significant growth in the area of strategic. networks. The joint view of strategic alliances and networks, cited by some authors a the evolutionary path of study, still did not appear salient. The most cited topics found in the alliance literature are the governance structure, cooperation, knowledge transfer, culture, control, trust, alliance formation,,previous experience, resources, competition and partner selection. The theme network focuses mainly on structure, knowledge transfer and social network, while the joint vision is highly concentrated in: the subjects of alliance formation and the governance choice.

Brassinosteroids interact negatively with jasmonates in the formation of anti-herbivory traits in tomato

Given the susceptibility of tomato plants to pests, the aim of the present study was to understand how hormones are involved in the formation of tomato natural defences against insect herbivory. Tomato hormone mutants, previously introgressed into the same genetic background of reference, were screened for alterations in trichome densities and allelochemical content. Ethylene, gibberellin, and auxin mutants indirectly showed alteration in trichome density, through effects on epidermal cell area. However, brassinosteroids (BRs) and jasmonates (JAs) directly affected trichome density and allelochemical content, and in an opposite fashion. The BR-deficient mutant dpy showed enhanced pubescence, zingiberene biosynthesis, and proteinase inhibitor expression; the opposite was observed for the JA-insensitive jai1-1 mutant. The dpyxjai1-1 double mutant showed that jai1-1 is epistatic to dpy, indicating that BR acts upstream of the JA signalling pathway. Herbivory tests with the poliphagous insect Spodoptera frugiperda and the tomato pest Tuta absoluta clearly confirmed the importance of the JA-BR interaction in defence against herbivory. The study underscores the importance of hormonal interactions on relevant agricultural traits and raises a novel biological mechanism in tomato that may differ from the BR and JA interaction already suggested for Arabidopsis.

Occurrence of secretory structures in underground systems of seven Asteraceae species

In contrast with the abundance of anatomical studies of secretory structures on aerial vegetative organs of Asteraceae species, the information about secretory structures on thickened subterranean organs is sparse. The aim of this study was to investigate the occurrence of secretory structures on thickened and nonthickened subterranean organs of seven Asteraceae species from three tribes: Eupatorieae (Chromolaena squalida and Gyptis lanigera), Vernonieae (Chresta sphaerocephala, Lessingianthus bardanoides, L. glabratus and Orthopappus angustifolius), and Plucheeae (Pterocaulon angustifolium). The specimens were collected in areas of cerrado, from the State of Sao Paulo, Brazil. All species of the tribe Vernonieae studied exhibited endodermic cells, other than the epithelial cells of the canal, with secretory activity in the roots. In C. sphaerocephala roots, two types of endodermic cell were found, but only one had secretory activity. Secretory canals were found in the tuberous and nontuberous roots of all studied species. These data agree with the results from the literature for Asteraceae species. Here, we describe for the first time in Asteraceae the presence of secretory idioblasts in C. sphaerocephala. Secretory trichomes are present in the Orthopappus angustifolius rhizophore. Histochemical tests have shown that all types of secretory structure possess substances containing lipids. (C) 2008 The Linnean Society of London.

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

Large Woody Debris Input and Its Influence on Channel Structure in Agricultural Lands of Southeast Brazil

Riparian forests are important for the structure and functioning of stream ecosystems, providing structural components such as large woody debris (LWD). Changes in these forests will cause modifications in the LWD input to streams, affecting their structure. In order to assess the influence of riparian forests changes in LWD supply, 15 catchments (third and fourth order) with riparian forests at different conservation levels were selected for sampling. In each catchment we quantified the abundance, volume and diameter of LWD in stream channels; the number, area and volume of pools formed by LWD and basal area and tree diameter of riparian forest. We found that riparian forests were at a secondary successional stage with predominantly young trees (diameter at breast height < 10 cm) in all studied streams. Results showed that basal area and diameter of riparian forest differed between the stream groups (forested and non-forested), but tree density did not differ between groups. Differences were also observed in LWD abundance, volume, frequency of LWD pools with subunits and area and volume of LWD pools. LWD diameter, LWD that form pools diameter and frequency of LWD pools without subunits did not differ between stream groups. Regression analyses showed that LWD abundance and volume, and frequency of LWD pools (with and without subunits) were positively related with the proportion of riparian forest. LWD diameter was not correlated to riparian tree diameter. The frequency of LWD pools was correlated to the abundance and volume of LWD, but characteristics of these pools (area and volume) were not correlated to the diameter of LWD that formed the pools. These results show that alterations in riparian forest cause modifications in the LWD abundance and volume in the stream channel, affecting mainly the structural complexity of these ecosystems (reduction in the number and structural characteristics of LWD pools). Our results also demonstrate that riparian forest conservation actions must consider not only its extension, but also successional stage to guarantee the quantity and quality of LWD necessary to enable the structuring of stream channels.