Non-Markovian dynamics of quantum discord

We evaluate the quantum discord dynamics of two qubits in independent and common non-Markovian environments. We compare the dynamics of entanglement with that of quantum discord. For independent reservoirs the quantum discord vanishes only at discrete instants whereas the entanglement can disappear during a finite time interval. For a common reservoir, quantum discord and entanglement can behave very differently with sudden birth of the former but not of the latter. Furthermore, in this case the quantum discord dynamics presents sudden changes in the derivative of its time evolution which is evidenced by the presence of kinks in its behavior at discrete instants of time.

gamma Cassiopeiae: an X-ray Be star with personality

An exciting unsolved problem in the study of high energy processes of early type stars concerns the physical mechanism for producing X-rays near the Be star gamma Cassiopeiae. By now we know that this source and several ""gamma Cas analogs"" exhibit an unusual hard thermal X-ray spectrum, compared both to normal massive stars and the non-thermal emission of known Be/X-ray binaries. Also, its light curve is variable on almost all conceivable timescales. In this study we reanalyze a high dispersion spectrum obtained by Chandra in 2001 and combine it with the analysis of a new (2004) spectrum and light curve obtained by XMM-Newton. We find that both spectra can be fit well with 3-4 optically thin, thermal components consisting of a hot component having a temperature kT(Q) similar to 12-14 keV, perhaps one with a value of similar to 2.4 keV, and two with well defined values near 0.6 keV and 0.11 keV. We argue that these components arise in discrete (almost monothermal) plasmas. Moreover, they cannot be produced within an integral gas structure or by the cooling of a dominant hot process. Consistent with earlier findings, we also find that the Fe abundance arising from K-shell ions is significantly subsolar and less than the Fe abundance from L-shell ions. We also find novel properties not present in the earlier Chandra spectrum, including a dramatic decrease in the local photoelectric absorption of soft X-rays, a decrease in the strength of the Fe and possibly of the Si K fluorescence features, underpredicted lines in two ions each of Ne and N (suggesting abundances that are similar to 1.5-3x and similar to 4x solar, respectively), and broadening of the strong NeXLy alpha and OVIII Ly alpha lines. In addition, we note certain traits in the gamma Cas spectrum that are different from those of the fairly well studied analog HD110432 - in this sense the stars have different ""personalities."" In particular, for gamma Cas the hot X-ray component remains nearly constant in temperature, and the photoelectric absorption of the X-ray plasmas can change dramatically. As found by previous investigators of gamma Cas, changes in flux, whether occurring slowly or in rapidly evolving flares, are only seldomly accompanied by variations in hardness. Moreover, the light curve can show a ""periodicity"" that is due to the presence of flux minima that recur semiregularly over a few hours, and which can appear again at different epochs.

Lossless filter for multiple repeats with bounded edit distance

Background: Identifying local similarity between two or more sequences, or identifying repeats occurring at least twice in a sequence, is an essential part in the analysis of biological sequences and of their phylogenetic relationship. Finding such fragments while allowing for a certain number of insertions, deletions, and substitutions, is however known to be a computationally expensive task, and consequently exact methods can usually not be applied in practice. Results: The filter TUIUIU that we introduce in this paper provides a possible solution to this problem. It can be used as a preprocessing step to any multiple alignment or repeats inference method, eliminating a possibly large fraction of the input that is guaranteed not to contain any approximate repeat. It consists in the verification of several strong necessary conditions that can be checked in a fast way. We implemented three versions of the filter. The first is simply a straightforward extension to the case of multiple sequences of an application of conditions already existing in the literature. The second uses a stronger condition which, as our results show, enable to filter sensibly more with negligible (if any) additional time. The third version uses an additional condition and pushes the sensibility of the filter even further with a non negligible additional time in many circumstances; our experiments show that it is particularly useful with large error rates. The latter version was applied as a preprocessing of a multiple alignment tool, obtaining an overall time (filter plus alignment) on average 63 and at best 530 times smaller than before (direct alignment), with in most cases a better quality alignment. Conclusion: To the best of our knowledge, TUIUIU is the first filter designed for multiple repeats and for dealing with error rates greater than 10% of the repeats length.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.

ON THE THREE-DIMENSIONAL BLASCHKE-LEBESGUE PROBLEM

The width of a closed convex subset of n-dimensional Euclidean space is the distance between two parallel supporting hyperplanes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still open in dimension n >= 3. In this paper we describe a necessary condition that the minimizer of the Blaschke-Lebesgue must satisfy in dimension n = 3: we prove that the smooth components of the boundary of the minimizer have their smaller principal curvature constant and therefore are either spherical caps or pieces of tubes (canal surfaces).

Non-Cardiac Surgery in Developing Countries: Epidemiological Aspects and Economical Opportunities - The Case of Brazil

Background: Worldwide distribution of surgical interventions is unequal. Developed countries account for the majority of surgeries and information about non-cardiac operations in developing countries is scarce. The purpose of our study was to describe the epidemiological data of non-cardiac surgeries performed in Brazil in the last years. Methods and Findings: This is a retrospective cohort study that investigated the time window from 1995 to 2007. We collected information from DATASUS, a national public health system database. The following variables were studied: number of surgeries, in-hospital expenses, blood transfusion related costs, length of stay and case fatality rates. The results were presented as sum, average and percentage. The trend analysis was performed by linear regression model. There were 32,659,513 non-cardiac surgeries performed in Brazil in thirteen years. An increment of 20.42% was observed in the number of surgeries in this period and nowadays nearly 3 million operations are performed annually. The cost of these procedures has increased tremendously in the last years. The increment of surgical cost was almost 200%. The total expenses related to surgical hospitalizations were more than $10 billion in all these years. The yearly cost of surgical procedures to public health system was more than $1.27 billion for all surgical hospitalizations, and in average, U$445.24 per surgical procedure. The total cost of blood transfusion was near $98 million in all years and annually approximately $10 million were spent in perioperative transfusion. The surgical mortality had an increment of 31.11% in the period. Actually, in 2007, the surgical mortality in Brazil was 1.77%. All the variables had a significant increment along the studied period: r square (r(2)) = 0.447 for the number of surgeries (P = 0.012), r(2) = 0.439 for in-hospital expenses (P = 0.014) and r(2) = 0.907 for surgical mortality (P = 0.0055). Conclusion: The volume of surgical procedures has increased substantially in Brazil through the past years. The expenditure related to these procedures and its mortality has also increased as the number of operations. Better planning of public health resource and strategies of investment are needed to supply the crescent demand of surgery in Brazil.

Placebo Response of Non-Pharmacological and Pharmacological Trials in Major Depression: A Systematic Review and Meta-Analysis

Background: Although meta-analyses have shown that placebo responses are large in Major Depressive Disorder (MDD) trials; the placebo response of devices such as repetitive transcranial magnetic stimulation (rTMS) has not been systematically assessed. We proposed to assess placebo responses in two categories of MDD trials: pharmacological (antidepressant drugs) and non-pharmacological (device-rTMS) trials. Methodology/Principal Findings: We performed a systematic review and meta-analysis of the literature from April 2002 to April 2008, searching MEDLINE, Cochrane, Scielo and CRISP electronic databases and reference lists from retrieved studies and conference abstracts. We used the keywords placebo and depression and escitalopram for pharmacological studies; and transcranial magnetic stimulation and depression and sham for non-pharmacological studies. All randomized, double-blinded, placebo-controlled, parallel articles on major depressive disorder were included. Forty-one studies met our inclusion criteria-29 in the rTMS arm and 12 in the escitalopram arm. We extracted the mean and standard values of depression scores in the placebo group of each study. Then, we calculated the pooled effect size for escitalopram and rTMS arm separately, using Cohen's d as the measure of effect size. We found that placebo response are large for both escitalopram (Cohen's d-random-effects model-1.48; 95% C.I. 1.26 to 1.6) and rTMS studies (0.82; 95% C.I. 0.63 to 1). Exploratory analyses show that sham response is associated with refractoriness and with the use of rTMS as an add-on therapy, but not with age, gender and sham method utilized. Conclusions/Significance: We confirmed that placebo response in MDD is large regardless of the intervention and is associated with depression refractoriness and treatment combination (add-on rTMS studies). The magnitude of the placebo response seems to be related with study population and study design rather than the intervention itself.

Identification of protein-coding and non-coding RNA expression profiles in CD34(+) and in stromal cells in refractory anemia with ringed sideroblasts

Background: Myelodysplastic syndromes (MDS) are a group of clonal hematological disorders characterized by ineffective hematopoiesis with morphological evidence of marrow cell dysplasia resulting in peripheral blood cytopenia. Microarray technology has permitted a refined high-throughput mapping of the transcriptional activity in the human genome. Non-coding RNAs (ncRNAs) transcribed from intronic regions of genes are involved in a number of processes related to post-transcriptional control of gene expression, and in the regulation of exon-skipping and intron retention. Characterization of ncRNAs in progenitor cells and stromal cells of MDS patients could be strategic for understanding gene expression regulation in this disease. Methods: In this study, gene expression profiles of CD34(+) cells of 4 patients with MDS of refractory anemia with ringed sideroblasts (RARS) subgroup and stromal cells of 3 patients with MDS-RARS were compared with healthy individuals using 44 k combined intron-exon oligoarrays, which included probes for exons of protein-coding genes, and for non-coding RNAs transcribed from intronic regions in either the sense or antisense strands. Real-time RT-PCR was performed to confirm the expression levels of selected transcripts. Results: In CD34(+) cells of MDS-RARS patients, 216 genes were significantly differentially expressed (q-value <= 0.01) in comparison to healthy individuals, of which 65 (30%) were non-coding transcripts. In stromal cells of MDS-RARS, 12 genes were significantly differentially expressed (q-value <= 0.05) in comparison to healthy individuals, of which 3 (25%) were non-coding transcripts. Conclusions: These results demonstrated, for the first time, the differential ncRNA expression profile between MDS-RARS and healthy individuals, in CD34(+) cells and stromal cells, suggesting that ncRNAs may play an important role during the development of myelodysplastic syndromes.

Relevance of leaf surface contamination for assessing chemical composition of bromeliads in a restinga forest

Resuspended soil and other airborne particles adhered to the leaf surface affect the chemical composition of the plant. A well-defined cleaning procedure is necessary to avoid this problem, providing a correct assessment of the inherent chemical composition of bromeliads. To evaluate the influence of a washing procedure, INAA was applied for determining chemical elements in the leaves of bromeliads from Vriesea carinata species, both non-washed and washed with Alconox, EDTA and bi-distilled water. Br, Ce, Hg, La, Sc, Se, Sm and Th showed higher mass fractions in non-washed leaves. The washing procedure removed the exogenous material without leaching chemical elements from inside the tissues.

Use of Medical Subject Headings (MeSH) in Portuguese for categorizing web-based healthcare content

Introduction: Internet users are increasingly using the worldwide web to search for information relating to their health. This situation makes it necessary to create specialized tools capable of supporting users in their searches. Objective: To apply and compare strategies that were developed to investigate the use of the Portuguese version of Medical Subject Headings (MeSH) for constructing an automated classifier for Brazilian Portuguese-language web-based content within or outside of the field of healthcare, focusing on the lay public. Methods: 3658 Brazilian web pages were used to train the classifier and 606 Brazilian web pages were used to validate it. The strategies proposed were constructed using content-based vector methods for text classification, such that Naive Bayes was used for the task of classifying vector patterns with characteristics obtained through the proposed strategies. Results: A strategy named InDeCS was developed specifically to adapt MeSH for the problem that was put forward. This approach achieved better accuracy for this pattern classification task (0.94 sensitivity, specificity and area under the ROC curve). Conclusions: Because of the significant results achieved by InDeCS, this tool has been successfully applied to the Brazilian healthcare search portal known as Busca Saude. Furthermore, it could be shown that MeSH presents important results when used for the task of classifying web-based content focusing on the lay public. It was also possible to show from this study that MeSH was able to map out mutable non-deterministic characteristics of the web. (c) 2010 Elsevier Inc. All rights reserved.

Flat tori, lattices and bounds for commutative group codes

We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for their cardinality in terms of minimum distance and the maximum center density of lattices and general spherical packings in the half dimension of the code. This bound is tight in the sense it can be arbitrarily approached in any dimension. Examples of this approach and a comparison of this bound with Union and Rankin bounds for general spherical codes is also presented.

An alternative to the Pythagorean rule? Reevaluating Problem 1 of cuneiform tablet BM 34 568

The first problem of the Seleucid mathematical cuneiform tablet BM 34 568 calculates the diagonal of a rectangle from its sides without resorting to the Pythagorean rule. For this reason, it has been a source of discussion among specialists ever since its first publication. but so far no consensus in relation to its mathematical meaning has been attained. This paper presents two new interpretations of the scribe`s procedure. based on the assumption that he was able to reduce the problem to a standard Mesopotamian question about reciprocal numbers. These new interpretations are then linked to interpretations of the Old Babylonian tablet Plimpton 322 and to the presence of Pythagorean triples in the contexts of Old Babylonian and Hellenistic mathematics. (C) 2007 Elsevier Inc. All rights reserved.

Endurance in judogi grip strength tests: comparison between elite and non-elite judo players

Background and Study Aim: The ability to develop a strong grip and maintain it during a judo match has become an important element for judo athletes. Therefore, the purpose of this investigation was to examine differences between measurements of maximal isometric time on judogi pull-up, and number of repetitions during dynamic judogi pull-up. Material/Methods: The sample was composed by two groups: 16 high-level judo athletes from the male Brazilian National Team and 12 male state-level judo athletes, with at least one athlete per weight category. The tests were compared through analysis of co-variance (body mass as co-variable), followed by a post-hoc test (Scheffe). Significance level was set at 5%. Results: No difference was found in the isometric test: Brazilian Team: 35 +/- 18s; Regional: 39 +/- 14s. However, the Brazilian Team performed a high number of repetitions (12 +/- 5 rep) compared to regional group (9 +/- 4 rep) during the dynamic grip strength endurance test. Conclusions: Thus, dynamic grip strength endurance seems to be a discriminating variable between judo athletes, probably because judo combat involves many elbow extensions and flexions in order to avoid the opponent`s grip and to subdue them.

Non-exhaustive tests for critical power estimation

Objective. - The aim of this study was to propose a new method that allows for the estimation of critical power (CP) from non-exhaustive tests using ratings of perceived exertion (RPE). Methods. - Twenty-two subjects underwent two practice trials for ergometer and Borg 15-point scale familiarization, and adaptation to severe exhaustive exercise. After then, four exercise bouts were performed on different days for the estimation of CP and anaerobic work capacity (AWC) by linear work-time equation, and CP(15), CP(17), AWC(15) and AWC(17) were estimated using the work and time to attainment of RPE15 and RPE17 based on the Borg 15-point scale. Results. - The CP, CP(15) and CP(17) (170-177W) were not significantly different (P>0.05). However, AWC, AWC(15) and AWC(17) were all different from each other. The correlations between CP(15) and CP(17), with CP were strong (R=0.871 and 0.911, respectively), but the AWC(15) and AWC(17) were not significantly correlated with AWC. Conclusion. - Sub-maximal. RPE responses can be used for the estimation of CP from non-exhaustive exercise protocols. (C) 2009 Elsevier Masson SAS. All rights reserved.