Performance analysis of a single-user MISO ultra-wideband time reversal system with DFE

This paper presents an analysis of the performance of a baseband multiple-input single-output (MISO) time reversal ultra-wideband system (TR-UWB) incorporating a symbol spaced decision feedback equalizer (DFE). A semi-analytical performance analysis based on a Gaussian approach is considered, which matched well with simulation results, even for the DFE case. The channel model adopted is based on the IEEE 802.15.3a model, considering correlated shadowing across antenna elements. In order to provide a more realistic analysis, channel estimation errors are considered for the design of the TR filter. A guideline for the choice of equalizer length is provided. The results show that the system`s performance improves with an increase in the number of transmit antennas and when a symbol spaced equalizer is used with a relatively small number of taps compared to the number of resolvable paths in the channel impulse response. Moreover, it is possible to conclude that due to the time reversal scheme, the error propagation in the DFE does not play a role in the system`s performance.

Modeling and Filtering Double-Frequency Jitter in One-Way Master-Slave Chain Networks

One-way master-slave (OWMS) chain networks are widely used in clock distribution systems due to their reliability and low cost. As the network nodes are phase-locked loops (PLLs), double-frequency jitter (DFJ) caused by their phase detectors appears as an impairment to the performance of the clock recovering process found in communication systems and instrumentation applications. A nonlinear model for OWMS chain networks with P + 1 order PLLs as slave nodes is presented, considering the DFJ. Since higher order filters are more effective in filtering DFJ, the synchronous state stability conditions for an OWMS chain network with third-order nodes are derived, relating the loop gain and the filter coefficients. By using these conditions, design examples are discussed.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.

Flatness-based control of a single qubit gate

This work considers the open-loop control problem of steering a two-level quantum system from any initial to any final condition. The model of this system evolves on the state space X = SU(2), having two inputs that correspond to the complex amplitude of a resonant laser field. A symmetry preserving flat output is constructed using a fully geometric construction and quaternion computations. Simulation results of this flatness-based open-loop control are provided.

Singular Perturbation for the Discounted Continuous Control of Piecewise Deterministic Markov Processes

This paper deals with the expected discounted continuous control of piecewise deterministic Markov processes (PDMP`s) using a singular perturbation approach for dealing with rapidly oscillating parameters. The state space of the PDMP is written as the product of a finite set and a subset of the Euclidean space a""e (n) . The discrete part of the state, called the regime, characterizes the mode of operation of the physical system under consideration, and is supposed to have a fast (associated to a small parameter epsilon > 0) and a slow behavior. By using a similar approach as developed in Yin and Zhang (Continuous-Time Markov Chains and Applications: A Singular Perturbation Approach, Applications of Mathematics, vol. 37, Springer, New York, 1998, Chaps. 1 and 3) the idea in this paper is to reduce the number of regimes by considering an averaged model in which the regimes within the same class are aggregated through the quasi-stationary distribution so that the different states in this class are replaced by a single one. The main goal is to show that the value function of the control problem for the system driven by the perturbed Markov chain converges to the value function of this limit control problem as epsilon goes to zero. This convergence is obtained by, roughly speaking, showing that the infimum and supremum limits of the value functions satisfy two optimality inequalities as epsilon goes to zero. This enables us to show the result by invoking a uniqueness argument, without needing any kind of Lipschitz continuity condition.

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.

Model for facilities or vendors location in a global scale considering several echelons in the Chain

The facilities location problem for companies with global operations is very complex and not well explored in the literature. This work proposes a MILP model that solves the problem through minimization of the total logistic cost. Main contributions of the model are the pioneer carrying cost calculation, the treatment given to the take-or-pay costs and to the international tax benefits such as drawback and added value taxes in Brazil. The model was successfully applied to a real case of a chemical industry with industrial plants and sales all over the world. The model application recommended a totally new sourcing model for the company.

Single Axis Controlled Hybrid Magnetic Bearing for Left Ventricular Assist Device: Hybrid Core and Closed Magnetic Circuit

In previous studies, we presented main strategies for suspending the rotor of a mixed-flow type (centrifugal and axial) ventricular assist device (VAD), originally presented by the Institute Dante Pazzanese of Cardiology (IDPC), Brazil. Magnetic suspension is achieved by the use of a magnetic bearing architecture in which the active control is executed in only one degree of freedom, in the axial direction of the rotor. Remaining degrees of freedom, excepting the rotation, are restricted only by the attraction force between pairs of permanent magnets. This study is part of a joint project in development by IDPC and Escola Politecnica of Sao Paulo University, Brazil. This article shows advances in that project, presenting two promising solutions for magnetic bearings. One solution uses hybrid cores as electromagnetic actuators, that is, cores that combine iron and permanent magnets. The other solution uses actuators, also of hybrid type, but with the magnetic circuit closed by an iron core. After preliminary analysis, a pump prototype has been developed for each solution and has been tested. For each prototype, a brushless DC motor has been developed as the rotor driver. Each solution was evaluated by in vitro experiments and guidelines are extracted for future improvements. Tests have shown good results and demonstrated that one solution is not isolated from the other. One complements the other for the development of a single-axis-controlled, hybrid-type magnetic bearing for a mixed-flow type VAD.

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.

Anisotropic Etching and Nanoribbon Formation in Single-Layer Graphene

We demonstrate anisotropic etching of single-layer graphene by thermally activated nickel nanoparticles. Using this technique, we obtain sub-10-nm nanoribbons and other graphene nanostructures with edges aligned along a single crystallographic direction. We observe a new catalytic channeling behavior, whereby etched cuts do not intersect, resulting in continuously connected geometries. Raman spectroscopy and electronic measurements show that the quality of the graphene is resilient under the etching conditions, indicating that this method may serve as a powerful technique to produce graphene nanocircuits with well-defined crystallographic edges.

Adsorbent new materials and composites produced in a single step

The aim of this work is the production and preliminary characterization of adsorbent new materials useful for sensor development. A new plasma chamber was simulated and designed in order to obtain multiple layers and/or composites in a single step. Plasma deposited organic fluorocompound and hexamethyldisilazane (HMDS) thin films were produced and tested as adsorbent layers. Chemical characterization used ellipsometry, Raman. infrared and X-ray photoelectron spectroscopy. Hydrophobic and oleophobic character were determined by contact angle measurements. Adsorption characteristics were evaluated using quartz crystal microbalance. Not only HMDS but also the fluorocompound can polymerize but intermixing and a double layer are only obtained in very narrow conditions. The films are adsorbent and mildly hydrophobic. Films deposited on a microchromatographic column can be used on sample pretreatment to remove and/or preconcentrate volatile organic Compounds. Therefore, with this approach it is possible to obtain films with different monomers on double layer or composites, with organic/inorganic materials or particles and use them on sample pretreatment for chemical analysis. (C) 2008 Elsevier B.V. All rights reserved.

Can Eucalyptus invade native forest fragments close to commercial stands?

Some Eucalyptus species are widely used as a plantation crop in tropical and subtropical regions. One reason for this is the diversity of end uses, but the main reason is the high level of wood production obtained from commercial plantings. With the advancement of biotechnology it will be possible to expand the geographical area in which eucalypts can be used as commercial plantation crops, especially in regions with current climatic restrictions. Despite the popularity of eucalypts and their increasing range, questions still exist, in both traditional planting areas and in the new regions: Can eucalypts invade areas of native vegetation, causing damage to natural ecosystems biodiversity? The objective of this study it was to assess whether eucalypts can invade native vegetation fragments in proximity to commercial stands, and what factors promote this invasive growth. Thus, three experiments were established in forest fragments located in three different regions of Brazil. Each experiment was composed of 40 plots (1 m(2) each one), 20 plots located at the border between the forest fragment and eucalypts plantation, and 20 plots in the interior of the forest fragments. In each experimental site, the plots were paired by two soil exposure conditions, 10 plots in natural conditions and 10 plots with soil exposure (no plant and no litter). During the rainy season, 2 g of eucalypts seeds were sown in each plot, including Eucalyptus grandis or a hybrid of E. urophylla x E. grandis, the most common commercial eucalypt species planted in the three region. At 15, 30, 45, 90, 180, 270 and 360 days after sowing, we assessed the number of seedlings of eucalypts and the number of seedlings of native species resulting from natural regeneration. Fifteen days after sowing, the greatest number of eucalypts seedlings (37 m(-2)) was observed in the plots with lower luminosity and exposed soil. Also, for native species, it was observed that exposed soil improved natural germination reaching the highest number of 163 seedlings per square meter. Site and soil exposure were the factors that have the greatest influence on seed germination of both eucalypt and native species. However, 270 days after sowing, eucalypt seedlings were not observed at any of the three experimental sites. The result shows the inability of eucalypts to adapt to condition outside of their natural range. However, native species demonstrated their strong capacity for natural regeneration in forest fragments under the same conditions where eucalypts were seeded. (C) 2011 Elsevier B.V. All rights reserved.

Genetic Diversity and a PCR-Based Method for Xanthomonas axonopodis Detection in Passion Fruit

Xanthomonas axonopodis pv. passiflorae causes bacterial spot in passion fruit. It attacks the purple and yellow passion fruit as well as the sweet passion fruit. The diversity of 87 isolates of pv. passiflorae collected from across 22 fruit orchards in Brazil was evaluated using molecular profiles and statistical procedures, including an unweighted pair-group method with arithmetical averages-based dendrogram, analysis of molecular variance (AMOVA), and an assigning test that provides information on genetic structure at the population level. Isolates from another eight pathovars were included in the molecular analyses and all were shown to have a distinct repetitive sequence-based polymerase chain reaction profile. Amplified fragment length polymorphism technique revealed considerable diversity among isolates of pv. passiflorae, and AMOVA showed that most of the variance (49.4%) was due to differences between localities. Cluster analysis revealed that most genotypic clusters were homogeneous and that variance was associated primarily with geographic origin. The disease adversely affects fruit production and may kill infected plants. A method for rapid diagnosis of the pathogen, even before the disease symptoms become evident, has value for producers. Here, a set of primers (Xapas) was designed by exploiting a single-nucleotide polymorphism between the sequences of the intergenic 16S-23S rRNA spacer region of the pathovars. Xapas was shown to effectively detect all pv. passiflorae isolates and is recommended for disease diagnosis in passion fruit orchards.

Does using stepwise variable selection to build sequential path analysis models make sense?

Causal inference methods - mainly path analysis and structural equation modeling - offer plant physiologists information about cause-and-effect relationships among plant traits. Recently, an unusual approach to causal inference through stepwise variable selection has been proposed and used in various works on plant physiology. The approach should not be considered correct from a biological point of view. Here, it is explained why stepwise variable selection should not be used for causal inference, and shown what strange conclusions can be drawn based upon the former analysis when one aims to interpret cause-and-effect relationships among plant traits.