cis-bis(N-benzoyl-N ',N '-dibenzylthio-ureato-kappa O-2,S)nickel(II)

In the title compound, [Ni(C22H19N2OS)(2)], the Ni-II atom is coordinated by the S and O atoms of two N-benzoyl-N',N'-dibenzylthioureate ligands in a slightly distorted square-planar geometry. The two O atoms are cis, as are the two S atoms.

Feature selection environment for genomic applications

Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e., for dimensionality reduction). There are many genomic and proteomic applications that rely on feature selection to answer questions such as selecting signature genes which are informative about some biological state, e. g., normal tissues and several types of cancer; or inferring a prediction network among elements such as genes, proteins and external stimuli. In these applications, a recurrent problem is the lack of samples to perform an adequate estimate of the joint probabilities between element states. A myriad of feature selection algorithms and criterion functions have been proposed, although it is difficult to point the best solution for each application. Results: The intent of this work is to provide an open-source multiplataform graphical environment for bioinformatics problems, which supports many feature selection algorithms, criterion functions and graphic visualization tools such as scatterplots, parallel coordinates and graphs. A feature selection approach for growing genetic networks from seed genes ( targets or predictors) is also implemented in the system. Conclusion: The proposed feature selection environment allows data analysis using several algorithms, criterion functions and graphic visualization tools. Our experiments have shown the software effectiveness in two distinct types of biological problems. Besides, the environment can be used in different pattern recognition applications, although the main concern regards bioinformatics tasks.

Context tree selection: A unifying view

Context tree models have been introduced by Rissanen in [25] as a parsimonious generalization of Markov models. Since then, they have been widely used in applied probability and statistics. The present paper investigates non-asymptotic properties of two popular procedures of context tree estimation: Rissanen's algorithm Context and penalized maximum likelihood. First showing how they are related, we prove finite horizon bounds for the probability of over- and under-estimation. Concerning overestimation, no boundedness or loss-of-memory conditions are required: the proof relies on new deviation inequalities for empirical probabilities of independent interest. The under-estimation properties rely on classical hypotheses for processes of infinite memory. These results improve on and generalize the bounds obtained in Duarte et al. (2006) [12], Galves et al. (2008) [18], Galves and Leonardi (2008) [17], Leonardi (2010) [22], refining asymptotic results of Buhlmann and Wyner (1999) [4] and Csiszar and Talata (2006) [9]. (C) 2011 Elsevier B.V. All rights reserved.

Survival time of random walk in random environment among soft obstacles

We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d. random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the survival time in the general d-dimensional case. We then consider a simplified one-dimensional model (where transition probabilities and obstacles are independent and the RWRE only moves to neighbour sites), and obtain finer results for the tail of the survival time. In addition, we study also the ""mixed"" probability measures (quenched with respect to the obstacles and annealed with respect to the transition probabilities and vice-versa) and give results for tails of the survival time with respect to these probability measures. Further, we apply the same methods to obtain bounds for the tails of hitting times of Branching Random Walks in Random Environment (BRWRE).

Random perturbations of stochastic processes with unbounded variable length memory

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the transition probabilities of the perturbed chain are uniformly close to the corresponding transition probabilities of the original chain. As a consequence, in the case of stochastic chains with unbounded but otherwise finite variable length memory, we show that it is possible to recover the context tree of the original chain, using a suitable version of the algorithm Context, provided that the noise is small enough.

An oracle approach for interaction neighborhood estimation in random fields

We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field. We introduce a model selection rule to choose estimators of conditional probabilities among natural candidates. Our main result is an oracle inequality satisfied by the resulting estimator. We use then this selection rule in a two-step procedure to evaluate the interacting neighborhoods. The selection rule selects a small prior set of possible interacting points and a cutting step remove from this prior set the irrelevant points. We also prove that the Ising models satisfy the assumptions of the main theorems, without restrictions on the temperature, on the structure of the interacting graph or on the range of the interactions. It provides therefore a large class of applications for our results. We give a computationally efficient procedure in these models. We finally show the practical efficiency of our approach in a simulation study.

Haplotype distribution of five nuclear genes based on network genealogies and Bayesian inference indicates that Trypanosoma cruzi hybrid strains are polyphyletic

Chagas disease is still a major public health problem in Latin America. Its causative agent, Trypanosoma cruzi, can be typed into three major groups, T. cruzi I, T. cruzi II and hybrids. These groups each have specific genetic characteristics and epidemiological distributions. Several highly virulent strains are found in the hybrid group; their origin is still a matter of debate. The null hypothesis is that the hybrids are of polyphyletic origin, evolving independently from various hybridization events. The alternative hypothesis is that all extant hybrid strains originated from a single hybridization event. We sequenced both alleles of genes encoding EF-1 alpha, actin and SSU rDNA of 26 T. cruzi strains and DHFR-TS and TR of 12 strains. This information was used for network genealogy analysis and Bayesian phylogenies. We found T. cruzi I and T. cruzi II to be monophyletic and that all hybrids had different combinations of T. cruzi I and T. cruzi II haplotypes plus hybrid-specific haplotypes. Bootstrap values (networks) and posterior probabilities (Bayesian phylogenies) of clades supporting the monophyly of hybrids were far below the 95% confidence interval, indicating that the hybrid group is polyphyletic. We hypothesize that T. cruzi I and T. cruzi II are two different species and that the hybrids are extant representatives of independent events of genome hybridization, which sporadically have sufficient fitness to impact on the epidemiology of Chagas disease.

3,3-Bis[(4-chlorophenyl)sulfanyl]-1-methylpiperidin-2-one

The piperidone ring in the title compound, C(18)H(17)Cl(2)NOS(2), has a distorted half-chair conformation. The S-bound benzene rings are approximately perpendicular to and splayed out of the mean plane through the piperidone ring [dihedral angles = 71.86 (13) and 46.94 (11)degrees]. In the crystal, C-H center dot center dot center dot O interactions link the molecules into [010] supramolecular chains with a helical topology. C-H center dot center dot center dot Cl and C-H center dot center dot center dot pi interactions are also present.

(5R)-3-(2-Chloroacetyl)-4-methyl-5phenyl-1,3,4-oxadiazinan-2-one

The 1,3,4-oxadiazinan-2-one ring in the title compound, C(12)H(13)ClN(2)O(3), is in a distorted half-chair conformation. The phenyl and chloroacetyl groups occupy axial and equatorial positions, respectively, and lie to the opposite side of the molecule to the N-bound methyl substituent. Molecules are consolidated in the crystal structure by C-H center dot center dot center dot O interactions.

2-(4-Methoxyphenylsulfinyl)cyclohexan-1-one

The cyclohexanone ring in the title compound, C(13)H(16)O(3)S, is in a distorted chair conformation. The intramolecular S center dot center dot center dot O(carbonyl) distance is 2.814 (2) angstrom. Molecules are connected into a two-dimensional array via C-H center dot center dot center dot O contacts involving the carbonyl and sulfinyl O atoms.

1-Methyl-3-phenylsulfonyl-2-piperidone

The piperidone ring in the title compound, C12H15NO3S, has a slightly distorted half-chair conformation with the methyl, carbonyl and phenylsulfonyl ring substituents occupying equatorial, equatorial and axial positions, respectively. Molecules are connected into centrosymmetric dimers via C-H center dot center dot center dot O interactions and these associate into layers via C-H center dot center dot center dot O-S contacts. Further C-H center dot center dot center dot O interactions involving both the carbonyl and sulfonyl O atoms consolidate the crystal packing by providing connections between the layers.

Predictive Validity of Waterlow Scale for Pressure Ulcer Development Risk in Hospitalized Patients

AIM: We sought to evaluate the predictive validity of the Waterlow Scale in hospitalized patients. SUBJECTS AND SETTING: The study was conducted at a general private hospital with 220 beds and a mean time of hospitalization of 7.4 days and a mean occupation rate of approximately 80%. Adult patients with a Braden Scale score of 18 or less and a Waterlow Scale score of 16 or more were studied. The sample consisted of 98 patients with a mean age of 71.1 +/- 15.5 years. METHODS: Skin assessment and scoring by using the Waterlow and Braden scales were completed on alternate days. Patients were examined at least 3 times to be considered for analysis. The data were submitted to sensitivity and specificity analysis by using receiver operating characteristic (ROC) curves and positive (+LR) and negative (-LR) likelihood ratios. RESULTS: The cutoff scores were 17, 20, and 20 in the first, second, and third assessment, respectively. Sensitivity was 71.4%, 85.7%, and 85.7% and specificity was 67.0%, 40.7%, and 32.9%, respectively. Analysis of the area under the ROC curve revealed good accuracy (0.64, 95% confidence interval [CI]: 0.35-0.93) only for the cutoff score 17 in the first assessment. The results also showed probabilities of 14%, 10%, and 9% for the development of pressure ulcer when the test results were positive (+LR) and of 3% (-LR) when the test results were negative for the cutoff scores in the first, second, and third assessment, respectively. CONCLUSION: The Waterlow Scale achieved good predictive validity in predicting pressure ulcer in hospitalized patients when a cutoff score of 17 was used in the first assessment.

Control of interceptive actions is based on expectancy of time to target arrival

In this study the hypothesis that interceptive movements are controlled on the basis of expectancy of time to target arrival was tested. The study was conducted through assessment of temporal errors and kinematics of interceptive movements to a moving virtual target. Initial target velocity was kept unchanged in part of the trials, and in the others it was decreased 300 ms before the due time of target arrival at the interception position, increasing in 100 ms time to target arrival. Different probabilities of velocity decrease ranging from 25 to 100% were compared. The results revealed that while there were increasing errors between probabilities of 25 and 75% for unchanged target velocity, the opposite relationship was observed for target velocity decrease. Kinematic analysis indicated that movement timing adjustments to target velocity decrease were made online. These results support the conception that visuomotor integration in the interception of moving targets is mediated by an internal forward model whose weights can be flexibly adjusted according to expectancy of time to target arrival.

Performance analysis of an optical network employing waveband and traffic grooming

This paper analyses an optical network architecture composed by an arrangement of nodes equipped with multi-granular optical cross-connects (MG-OXCs) in addition to the usual optical cross-connects (OXCs). Then, selected network nodes can perform both waveband as well as traffic grooming operations and our goal is to assess the improvement on network performance brought by these additional capabilities. Specifically, the influence of the MG-OXC multi-granularity on the blocking probability is evaluated for 16 classes of service over a network based on the NSFNet topology. A mechanism of fairness in bandwidth capacity is also added to the connection admission control to manage the blocking probabilities of all kind of bandwidth requirements. Comprehensive computational simulation are carried out to compare eight distinct node architectures, showing that an adequate combination of waveband and single-wavelength ports of the MG-OXCs and OXCs allow a more efficient operation of a WDM optical network carrying multi-rate traffic.

GOOAL: A routine based on Genetic Algorithms to track harmonics in electric power systems

Voltage and current waveforms of a distribution or transmission power system are not pure sinusoids. There are distortions in these waveforms that can be represented as a combination of the fundamental frequency, harmonics and high frequency transients. This paper presents a novel approach to identifying harmonics in power system distorted waveforms. The proposed method is based on Genetic Algorithms, which is an optimization technique inspired by genetics and natural evolution. GOOAL, a specially designed intelligent algorithm for optimization problems, was successfully implemented and tested. Two kinds of representations concerning chromosomes are utilized: binary and real. The results show that the proposed method is more precise than the traditional Fourier Transform, especially considering the real representation of the chromosomes.