Information Filtering and Array Algorithms for Discrete-Time Markovian Jump Linear Systems

This technical note develops information filter and array algorithms for a linear minimum mean square error estimator of discrete-time Markovian jump linear systems. A numerical example for a two-mode Markovian jump linear system, to show the advantage of using array algorithms to filter this class of systems, is provided.

A Taxonomy for Locality Algorithms on Peer-to-Peer Networks

The continuous growth of peer-to-peer networks has made them responsible for a considerable portion of the current Internet traffic. For this reason, improvements in P2P network resources usage are of central importance. One effective approach for addressing this issue is the deployment of locality algorithms, which allow the system to optimize the peers` selection policy for different network situations and, thus, maximize performance. To date, several locality algorithms have been proposed for use in P2P networks. However, they usually adopt heterogeneous criteria for measuring the proximity between peers, which hinders a coherent comparison between the different solutions. In this paper, we develop a thoroughly review of popular locality algorithms, based on three main characteristics: the adopted network architecture, distance metric, and resulting peer selection algorithm. As result of this study, we propose a novel and generic taxonomy for locality algorithms in peer-to-peer networks, aiming to enable a better and more coherent evaluation of any individual locality algorithm.

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

Simultaneous determination of rosiglitazone and its metabolites in rat liver microsomal fraction using hollow-fiber liquid-phase microextraction for sample preparation

A three-phase hollow-fiber liquid-phase microextraction method for the analysis of rosiglitazone and its metabolites N-desmethyl rosiglitazone and p-hydroxy rosiglitazone in microsomal preparations is described for the first time. The drug and metabolites HPLC determination was carried out using an X-Terra RP-18 column, at 22 degrees C. The mobile phase was composed of water, acetonitrile and acetic acid (85:15:0.5, v/v/v) and the detection was performed at 245 nm. The hollow-fiber liquid-phase microextraction procedure was optimized using multifactorial experiments and the following optimal condition was established: sample agitation at 1750 rpm, extraction for 30 min, hydrochloric acid 0.01 mol/L as acceptor phase, 1-octanol as organic phase, and donor phase pH adjustment to 8.0. The recovery rates, obtained by using 1 mL of microsomal preparation, were 47-70%. The method presented LOQs of 50 ng/mL and it was linear over the concentration range of 50-6000 ng/mL, with correlation coefficients (r) higher than 0.9960, for all analytes. The validated method was employed to study the in vitro biotransformation of rosiglitazone using rat liver microsomal fraction.

Methylmercury and inorganic mercury determination in blood by using liquid chromatography with inductively coupled plasma mass spectrometry and a fast sample preparation procedure

Despite the necessity to differentiate chemical species of mercury in clinical specimens, there area limited number of methods for this purpose. Then, this paper describes a simple method for the determination of methylmercury and inorganic mercury in blood by using liquid chromatography with inductively coupled mass spectrometry (LC-ICP-MS) and a fast sample preparation procedure. Prior to analysis, blood (250 mu L) is accurately weighed into 15-mL conical tubes. Then, an extractant solution containing mercaptoethanol, L-cysteine and HCI was added to the samples following sonication for 15 min. Quantitative mercury extraction was achieved with the proposed procedure. Separation of mercury species was accomplished in less than 5 min on a C18 reverse-phase column with a mobile phase containing 0.05% (v/v) mercaptoethanol, 0.4% (m/v) L-cysteine, 0.06 mol L(-1) ammonium acetate and 5% (v/v) methanol. The method detection limits were found to be 0.25 mu g L(-1) and 0.1 mu Lg L(-1) for inorganic mercury and methylmercury, respectively. Method accuracy is traceable to Standard Reference Material (SRM) 966 Toxic Metals in Bovine Blood from the National Institute of Standards and Technology (NIST). The proposed method was also applied to the speciation of mercury in blood samples collected from fish-eating communities and from rats exposed to thimerosal. With the proposed method there is a considerable reduction of the time of sample preparation prior to speciation of Hg by LC-ICP-MS. Finally, after the application of the proposed method, we demonstrated an interesting in vivo ethylmercury conversion to inorganic mercury. (C) 2009 Elsevier B.V. All rights reserved.

A fast sample preparation procedure for mercury speciation in hair samples by high-performance liquid chromatography coupled to ICP-MS

A simple method for mercury speciation in hair samples with a fast sample preparation procedure using high-performance liquid chromatography coupled to inductively coupled plasma mass spectrometry is proposed. Prior to analysis, 50 mg of hair samples were accurately weighed into 15 mL conical tubes. Then, an extractant solution containing mercaptoethanol, L-cysteine and HCl was added to the samples following sonication for 10 min. Quantitative mercury extraction was achieved with the proposed procedure. Separation of inorganic mercury (Ino-Hg), methylmercury (Met-Hg) and ethylmercury (Et-Hg) was accomplished in less than 8 min on a C18 reverse phase column with a mobile phase containing 0.05% v/v mercaptoethanol, 0.4% m/v L-cysteine, 0.06 mol L(-1) ammonium acetate and 5% v/v methanol. The method detection limits were found to be 15 ng g(-1), 10 ng g(-1) and 38 ng g(-1), for inorganic mercury, methylmercury and ethylmercury, respectively. Sample throughput is 4 samples h(-1) (duplicate). A considerable improvement in the time of analysis was achieved when compared to other published methods. Method accuracy is traceable to Certified Reference Materials (CRMs) 85 and 86 human hair from the International Atomic Energy Agency (IAEA). Finally, the proposed method was successfully applied to the speciation of mercury in hair samples collected from fish-eating communities of the Brazilian Amazon.

Determination of total and inorganic mercury in whole blood by cold vapor inductively coupled plasma mass spectrometry (CV ICP-MS) with alkaline sample preparation

A simple method with a fast sample preparation procedure for total and inorganic mercury determinations in blood samples is proposed based on flow injection cold vapor inductively coupled plasma mass spectrometry (FI-CVICP-MS). Aliquots of whole blood (500 mL) are diluted 1 + 1 v/v with 10.0% v/v tetramethylammonium hydroxide (TMAH) solution, incubated for 3 h at room temperature and then further diluted 1 + 4 v/v with 2.0% v/v HCl. The inorganic Hg was released by online addition of L-cysteine and then reduced to elemental Hg by SnCl(2). On the other hand, total mercury was determined by on-line addition of KMnO(4) and then reduced to elemental Hg by NaBH(4). Samples were calibrated against matrix-matching. The method detection limit was found to be 0.80 mu g L(-1) and 0.08 mu g L(-1) for inorganic and total mercury, respectively. Sample throughput is 20 samples h(-1). The method accuracy is traceable to Standard Reference Material (SRM) 966 Toxic Metals in Bovine Blood from the National Institute of Standards and Technology (NIST). For additional validation purposes, human whole blood samples were analyzed by the proposed method and by an established CV AAS method, with no statistical difference between the two techniques at 95% confidence level on applying the t-test.

Mercury speciation in whole blood by gas chromatography coupled to ICP-MS with a fast microwave-assisted sample preparation procedure

A simple and fast method is described for simultaneous determination of methylmercury (MeHg), ethylmercury (Et-Hg) and inorganic mercury (Ino-Hg) in blood samples by using capillary gas chromatography-inductively coupled plasma mass spectrometry (GC-ICP-MS) after derivatization and alkaline digestion. Closed-vessel microwave assisted digestion conditions with tetramethylammonium hydroxide (TMAH) have been optimized. Derivatization by using ethylation and propylation procedures have also been evaluated and compared. The absolute detection limits (using a 1 mu L injection) obtained by GC-ICP-MS with ethylation were 40 fg for MeHg and Ino-Hg, respectively, and with propylation were 50, 20 and 50 fg for MeHg, Et-Hg and Ino-Hg, respectively. Method accuracy is traceable to Standard Reference Material (SRM) 966 Toxic Metals in Bovine Blood from the National Institute of Standards and Technology (NIST). Additional validation is provided based on the comparison of results obtained for mercury speciation in blood samples with the proposed procedure and with a previously reported LC-ICP-MS method. With the new proposed procedure no tedious clean-up steps are required and a considerable improvement of the time of analysis was achieved compared to other methods using GC separation.

Estimate of Dementia Prevalence in a Community Sample from Sao Paulo, Brazil

Aims: To estimate dementia prevalence and describe the etiology of dementia in a community sample from the city of Sao Paulo, Brazil. Methods: A sample of subjects older than 60 years was screened for dementia in the first phase. During the second phase, the diagnostic workup included a structured interview, physical and neurological examination, laboratory exams, a brain scan, and DSM-IV criteria diagnosis. Results: Mean age was 71.5 years (n = 1,563) and 58.3% had up to 4 years of schooling (68.7% female). Dementia was diagnosed in 107 subjects with an observed prevalence of 6.8%. The estimate of dementia prevalence was 12.9%, considering design effect, nonresponse during the community phase, and positive and negative predictive values. Alzheimer`s disease was the most frequent cause of dementia (59.8%), followed by vascular dementia (15.9%). Older age and illiteracy were significantly associated with dementia. Conclusions: The estimate of dementia prevalence was higher than previously reported in Brazil, with Alzheimer`s disease and vascular dementia being the most frequent causes of dementia. Dementia prevalence in Brazil and in other Latin American countries should be addressed by additional studies to confirm these higher dementia rates which might have a sizable impact on countries` health services. Copyright (C) 2008 S. Karger AG, Basel

Use of the q-Gaussian mutation in evolutionary algorithms

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.

Most of the patients presenting myocardial infarction would not be eligible for intensive lipid-lowering based on clinical algorithms or plasma C-reactive protein

Objective: The study we assessed how often patients who are manifesting a myocardial infarction (MI) would not be considered candidates for intensive lipid-lowering therapy based on the current guidelines. Methods: In 355 consecutive patients manifesting ST elevation MI (STEMI), admission plasma C-reactive protein (CRP) was measured and Framingham risk score (FRS), PROCAM risk score, Reynolds risk score, ASSIGN risk score, QRISK, and SCORE algorithms were applied. Cardiac computed tomography and carotid ultrasound were performed to assess the coronary artery calcium score (CAC), carotid intima-media thickness (cIMT) and the presence of carotid plaques. Results: Less than 50% of STEMI patients would be identified as having high risk before the event by any of these algorithms. With the exception of FRS (9%), all other algorithms would assign low risk to about half of the enrolled patients. Plasma CRP was <1.0 mg/L in 70% and >2 mg/L in 14% of the patients. The average cIMT was 0.8 +/- 0.2 mm and only in 24% of patients was >= 1.0 mm. Carotid plaques were found in 74% of patients. CAC > 100 was found in 66% of patients. Adding CAC >100 plus the presence of carotid plaque, a high-risk condition would be identified in 100% of the patients using any of the above mentioned algorithms. Conclusion: More than half of patients manifesting STEMI would not be considered as candidates for intensive preventive therapy by the current clinical algorithms. The addition of anatomical parameters such as CAC and the presence of carotid plaques can substantially reduce the CVD risk underestimation. (C) 2010 Elsevier Ireland Ltd. All rights reserved.