A regional multirnodulus algorithm for blind equalization of QAM signals: Introduction and steady-state analysis

It is well known that constant-modulus-based algorithms present a large mean-square error for high-order quadrature amplitude modulation (QAM) signals, which may damage the switching to decision-directed-based algorithms. In this paper, we introduce a regional multimodulus algorithm for blind equalization of QAM signals that performs similar to the supervised normalized least-mean-squares (NLMS) algorithm, independently of the QAM order. We find a theoretical relation between the coefficient vector of the proposed algorithm and the Wiener solution and also provide theoretical models for the steady-state excess mean-square error in a nonstationary environment. The proposed algorithm in conjunction with strategies to speed up its convergence and to avoid divergence can bypass the switching mechanism between the blind mode and the decision-directed mode. (c) 2012 Elsevier B.V. All rights reserved.

Signal Transceiver Transit Times and Propagation Delay Corrections for Ranging and Georeferencing Applications

The accuracy of ranging measurements depends critically on the knowledge of time delays undergone by signals when retransmitted by a remote transponder and due to propagation effects. A new method determines these delays for every single pulsed signal transmission. It utilizes four ground-based reference stations, synchronized in time and installed at well-known geodesic coordinates and a repeater in space, carried by a satellite, balloon, aircraft, and so forth. Signal transmitted by one of the reference bases is retransmitted by the transponder, received back by the four bases, producing four ranging measurements which are processed to determine uniquely the time delays undergone in every retransmission process. A minimization function is derived comparing repeater's positions referred to at least two groups of three reference bases, providing the signal transit time at the repeater and propagation delays, providing the correct repeater position. The method is applicable to the transponder platform positioning and navigation, time synchronization of remote clocks, and location of targets. The algorithm has been demonstrated by simulations adopting a practical example with the transponder carried by an aircraft moving over bases on the ground.

Determination of the critical coupling of explosive synchronization transitions in scale-free networks by mean-field approximations

An explosive synchronization can be observed in scale-free networks when Kuramoto oscillators have natural frequencies equal to their number of connections. The present paper reports on mean-field approximations to determine the critical coupling of such explosive synchronization. It has been verified that the equation obtained for the critical coupling has an inverse dependence on the network average degree. This expression differs from those whose frequency distributions are unimodal and even. In this case, the critical coupling depends on the ratio between the first and second statistical moments of the degree distribution. Numerical simulations were also conducted to verify our analytical results.

Reliable identification of mycobacterial species by PCR-restriction enzyme analysis (PRA)-hsp65 in a reference laboratory and elaboration of a sequence-based extended algorithm of PRA-hsp65 patterns

Abstract Background Identification of nontuberculous mycobacteria (NTM) based on phenotypic tests is time-consuming, labor-intensive, expensive and often provides erroneous or inconclusive results. In the molecular method referred to as PRA-hsp65, a fragment of the hsp65 gene is amplified by PCR and then analyzed by restriction digest; this rapid approach offers the promise of accurate, cost-effective species identification. The aim of this study was to determine whether species identification of NTM using PRA-hsp65 is sufficiently reliable to serve as the routine methodology in a reference laboratory. Results A total of 434 NTM isolates were obtained from 5019 cultures submitted to the Institute Adolpho Lutz, Sao Paulo Brazil, between January 2000 and January 2001. Species identification was performed for all isolates using conventional phenotypic methods and PRA-hsp65. For isolates for which these methods gave discordant results, definitive species identification was obtained by sequencing a 441 bp fragment of hsp65. Phenotypic evaluation and PRA-hsp65 were concordant for 321 (74%) isolates. These assignments were presumed to be correct. For the remaining 113 discordant isolates, definitive identification was based on sequencing a 441 bp fragment of hsp65. PRA-hsp65 identified 30 isolates with hsp65 alleles representing 13 previously unreported PRA-hsp65 patterns. Overall, species identification by PRA-hsp65 was significantly more accurate than by phenotype methods (392 (90.3%) vs. 338 (77.9%), respectively; p < .0001, Fisher's test). Among the 333 isolates representing the most common pathogenic species, PRA-hsp65 provided an incorrect result for only 1.2%. Conclusion PRA-hsp65 is a rapid and highly reliable method and deserves consideration by any clinical microbiology laboratory charged with performing species identification of NTM.

Algorithm for the treatment of type 2 diabetes: a position statement of Brazilian Diabetes Society

The Brazilian Diabetes Society is starting an innovative project of quantitative assessment of medical arguments of and implementing a new way of elaborating SBD Position Statements. The final aim of this particular project is to propose a new Brazilian algorithm for the treatment of type 2 diabetes, based on the opinions of endocrinologists surveyed from a poll conducted on the Brazilian Diabetes Society website regarding the latest algorithm proposed by American Diabetes Association /European Association for the Study of Diabetes, published in January 2009.

MR-Radix: a multi-relational data mining algorithm

Abstract Background Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.

Ovarian response of Suffolk ewes to estrous synchronization using short-term protocol

The efficacy of estrus synchronization using short-term protocol was evaluated by ultrasound exams in Suffolk ewes during the pre-breeding season. The control Group (n = 12) was synchronized by treatment for 12 days with vaginal sponges impregnated with medroxyprogesterone acetate, and 400 IU eCG at sponge withdrawal. Experimental groups I, II and III kept the sponge in place for 4 days, and 100 µg of PGF2a was administered at sponge withdrawal. Additionally, Group I (n = 12) had 0.1 mg of estradiol benzoate (EB) administered during sponge placement and 50 µg of GnRH 48 hours after sponge removal. Group II (n = 6) had 35 mg of progesterone (P4) injected, and 0.1 mg of EB administered during sponge placement, 400 IU eCG at withdrawal and 48 hours after, 50 µg GnRH were administrated. Group III (n = 12) had 35 mg of P4 and 0.2 mg of EB administered at sponge placement, 400 IU eCG at withdrawal, and 50 µg of GnRH was administrated after 56 hours. Ovaries were monitored through ultrasound scanning. Concerning the first wave, no difference was detected between the control group and the experimental groups. However, the characteristics of ovulatory wave were significantly different between the groups. The duration of the follicular wave was shorter for Group III than for Group II. The follicle in Group I reached its maximum diameter before the Group II. The diameter of the follicle at the sponge withdrawal in the control group was larger than in Group I. After sponge withdrawal, the follicular growth rate was smaller in the control group than in Group III. The maximum diameter of the follicle in Group II was larger than in the other groups. The short-term protocol in which estrogen was used did not synchronize the emergence of the wave of follicular development.

Prostaglandin treatment at the onset of norgestomet and estradiol-based synchronization protocols did not alter the ovarian follicular dynamics or pregnancy per timed artificial insemination in cyclic Bos indicus heifers

The aim of the present study was to evaluate the effects of the PGF2˛treatment givenat the onset of a synchronization of ovulation protocol using a norgestomet (NORG) earimplant on ovarian follicular dynamics (Experiment 1) and pregnancy per AI (P/AI; Exper-iment 2) in cyclic (CL present) Bos indicus heifers. In Experiment 1, a total of 46 heiferswere presynchronized using two consecutive doses of PGF2˛12 days apart. At first dayof the synchronization protocol the heifers received implants containing 3 mg of NORGand 2 mg of estradiol benzoate (EB). At the same time, heifers were randomly assignedto receive 150 mg of d-cloprostenol (n = 23; PGF2˛) or no additional treatment (n = 23;Control). When the ear implants were removed 8 days later, all heifers received a PGF2˛treatment and 1 mg of EB was given 24 h later. The follicular diameter and interval toovulation were determined by transrectal ultrasonography. No effects of PGF2˛treat-ment on the diameter of the largest follicle present were observed at implant removal(PGF2˛= 9.8 ± 0.4 vs. Control = 10.0 ± 0.3 mm; P = 0.73) or after 24 h (PGF2˛= 11.1 ± 0.4 vs.Control = 11.0 ± 0.4 mm; P = 0.83). No differences in the time of ovulation after ear implantremoval (PGF2˛= 70.8 ± 1.2 vs. Control = 73.3 ± 0.9 h; P = 0.10) or in the ovulation rate(PGF2˛= 87.0 vs. Control = 82.6%; P = 0.64) between treatments were observed. In Experi-ment 2, 280 cyclic heifers were synchronized using the same experimental design describedabove (PGF2˛; n = 143 and Control; n = 137), at random day of the estrous cycle. All heifersreceived 300 IU of equine chorionic gonadotropin (eCG) and 0.5 mg of estradiol cypionate(as ovulatory stimulus) when the NORG ear implants were removed. Timed artificial insem-ination (TAI) was performed 48 h after implant removal and the pregnancy diagnosis wasconducted 30 days later. No effects on the P/AI due to PGF2˛treatment were observed(PGF2˛= 51.7 vs. Control = 57.7%; P = 0.29). In conclusion, PGF2˛treatment at the onset ofNORG-based protocols for the synchronization of ovulation did not alter the ovarian follic-ular responses or the P/AI in cyclic Bos indicus beef heifers synchronized for TAI.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm

Multi-objective evolutionary algorithm for single and multiple fault service restoration in large-scale distribution systems

Network reconfiguration for service restoration (SR) in distribution systems is a complex optimization problem. For large-scale distribution systems, it is computationally hard to find adequate SR plans in real time since the problem is combinatorial and non-linear, involving several constraints and objectives. Two Multi-Objective Evolutionary Algorithms that use Node-Depth Encoding (NDE) have proved able to efficiently generate adequate SR plans for large distribution systems: (i) one of them is the hybridization of the Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) with NDE, named NSGA-N; (ii) the other is a Multi-Objective Evolutionary Algorithm based on subpopulation tables that uses NDE, named MEAN. Further challenges are faced now, i.e. the design of SR plans for larger systems as good as those for relatively smaller ones and for multiple faults as good as those for one fault (single fault). In order to tackle both challenges, this paper proposes a method that results from the combination of NSGA-N, MEAN and a new heuristic. Such a heuristic focuses on the application of NDE operators to alarming network zones according to technical constraints. The method generates similar quality SR plans in distribution systems of significantly different sizes (from 3860 to 30,880 buses). Moreover, the number of switching operations required to implement the SR plans generated by the proposed method increases in a moderate way with the number of faults.

Programmable logic design of a compact Genetic Algorithm for phasor estimation in real-time

The main objective of this work is to present an efficient method for phasor estimation based on a compact Genetic Algorithm (cGA) implemented in Field Programmable Gate Array (FPGA). To validate the proposed method, an Electrical Power System (EPS) simulated by the Alternative Transients Program (ATP) provides data to be used by the cGA. This data is as close as possible to the actual data provided by the EPS. Real life situations such as islanding, sudden load increase and permanent faults were considered. The implementation aims to take advantage of the inherent parallelism in Genetic Algorithms in a compact and optimized way, making them an attractive option for practical applications in real-time estimations concerning Phasor Measurement Units (PMUs).

Test and Evaluation of the FastSLAM Algorithm in a Mobile Robot

Máster Universitario en Sistemas Inteligentes y Aplicaciones Numéricas en Ingeniería (SIANI)

A new snowfall detection algorithm for high latitude regions based on a combination of active and passive sensors

Precipitation retrieval over high latitudes, particularly snowfall retrieval over ice and snow, using satellite-based passive microwave spectrometers, is currently an unsolved problem. The challenge results from the large variability of microwave emissivity spectra for snow and ice surfaces, which can mimic, to some degree, the spectral characteristics of snowfall. This work focuses on the investigation of a new snowfall detection algorithm specific for high latitude regions, based on a combination of active and passive sensors able to discriminate between snowing and non snowing areas. The space-borne Cloud Profiling Radar (on CloudSat), the Advanced Microwave Sensor units A and B (on NOAA-16) and the infrared spectrometer MODIS (on AQUA) have been co-located for 365 days, from October 1st 2006 to September 30th, 2007. CloudSat products have been used as truth to calibrate and validate all the proposed algorithms. The methodological approach followed can be summarised into two different steps. In a first step, an empirical search for a threshold, aimed at discriminating the case of no snow, was performed, following Kongoli et al. [2003]. This single-channel approach has not produced appropriate results, a more statistically sound approach was attempted. Two different techniques, which allow to compute the probability above and below a Brightness Temperature (BT) threshold, have been used on the available data. The first technique is based upon a Logistic Distribution to represent the probability of Snow given the predictors. The second technique, defined Bayesian Multivariate Binary Predictor (BMBP), is a fully Bayesian technique not requiring any hypothesis on the shape of the probabilistic model (such as for instance the Logistic), which only requires the estimation of the BT thresholds. The results obtained show that both methods proposed are able to discriminate snowing and non snowing condition over the Polar regions with a probability of correct detection larger than 0.5, highlighting the importance of a multispectral approach.

Performance evaluation of a parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes

[EN]A new parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes is proposed in this paper. We provide a detailed analysis of its performance on shared-memory many-core computer architectures. This performance analysis includes the evaluation of execution time, parallel scalability, load balancing, and parallelism bottlenecks. Additionally, we compare the impact of three previously published graph coloring procedures on the performance of our parallel algorithm. We use six benchmark meshes with a wide range of sizes. Using these experimental data sets, we describe the behavior of the parallel algorithm for different data sizes. We demonstrate that this algorithm is highly scalable when it runs on two different high-performance many-core computers with up to 128 processors...