Is Drosera meristocaulis a pygmy sundew? Evidence of a long-distance dispersal between Western Australia and northern South America

South America and Oceania possess numerous floristic similarities, often confirmed by morphological and molecular data. The carnivorous Drosera meristocaulis (Droseraceae), endemic to the Neblina highlands of northern South America, was known to share morphological characters with the pygmy sundews of Drosera sect. Bryastrum, which are endemic to Australia and New Zealand. The inclusion of D. meristocaulis in a molecular phylogenetic analysis may clarify its systematic position and offer an opportunity to investigate character evolution in Droseraceae and phylogeographic patterns between South America and Oceania. was included in a molecular phylogenetic analysis of Droseraceae, using nuclear internal transcribed spacer (ITS) and plastid rbcL and rps16 sequence data. Pollen of D. meristocaulis was studied using light microscopy and scanning electron microscopy techniques, and the karyotype was inferred from root tip meristem. The phylogenetic inferences (maximum parsimony, maximum likelihood and Bayesian approaches) substantiate with high statistical support the inclusion of sect. Meristocaulis and its single species, D. meristocaulis, within the Australian Drosera clade, sister to a group comprising species of sect. Bryastrum. A chromosome number of 2n approx. 3236 supports the phylogenetic position within the Australian clade. The undivided styles, conspicuous large setuous stipules, a cryptocotylar (hypogaeous) germination pattern and pollen tetrads with aperture of intermediate type 78 are key morphological traits shared between D. meristocaulis and pygmy sundews of sect. Bryastrum from Australia and New Zealand. The multidisciplinary approach adopted in this study (using morphological, palynological, cytotaxonomic and molecular phylogenetic data) enabled us to elucidate the relationships of the thus far unplaced taxon D. meristocaulis. Long-distance dispersal between southwestern Oceania and northern South America is the most likely scenario to explain the phylogeographic pattern revealed.

Exercise-induced bronchoconstriction in elite long-distance runners in Brazil

Objective: To determine the prevalence of exercise-induced bronchoconstriction among elite long-distance runners in Brazil and whether there is a difference in the training loads among athletes with and without exercise-induced bronchoconstriction. Methods: This was a cross-sectional study involving elite long-distance runners with neither current asthma symptoms nor a diagnosis of exercise-induced bronchoconstriction. All of the participants underwent eucapnic voluntary hyperpnea challenge and maximal cardiopulmonary exercise tests, as well as completing questionnaires regarding asthma symptoms and physical activity, in order to monitor their weekly training load. Results: Among the 86 male athletes recruited, participation in the study was agreed to by 20, of whom 5 (25%) were subsequently diagnosed with exercise-induced bronchoconstriction. There were no differences between the athletes with and without exercise-induced bronchoconstriction regarding anthropometric characteristics, peak oxygen consumption, baseline pulmonary function values, or reported asthma symptoms. The weekly training load was significantly lower among those with exercise-induced bronchoconstriction than among those without. Conclusions: In this sample of long-distance runners in Brazil, the prevalence of exercise-induced bronchoconstriction was high.

UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.

Speech Graphs Provide a Quantitative Measure of Thought Disorder in Psychosis

Background: Psychosis has various causes, including mania and schizophrenia. Since the differential diagnosis of psychosis is exclusively based on subjective assessments of oral interviews with patients, an objective quantification of the speech disturbances that characterize mania and schizophrenia is in order. In principle, such quantification could be achieved by the analysis of speech graphs. A graph represents a network with nodes connected by edges; in speech graphs, nodes correspond to words and edges correspond to semantic and grammatical relationships. Methodology/Principal Findings: To quantify speech differences related to psychosis, interviews with schizophrenics, manics and normal subjects were recorded and represented as graphs. Manics scored significantly higher than schizophrenics in ten graph measures. Psychopathological symptoms such as logorrhea, poor speech, and flight of thoughts were grasped by the analysis even when verbosity differences were discounted. Binary classifiers based on speech graph measures sorted schizophrenics from manics with up to 93.8% of sensitivity and 93.7% of specificity. In contrast, sorting based on the scores of two standard psychiatric scales (BPRS and PANSS) reached only 62.5% of sensitivity and specificity. Conclusions/Significance: The results demonstrate that alterations of the thought process manifested in the speech of psychotic patients can be objectively measured using graph-theoretical tools, developed to capture specific features of the normal and dysfunctional flow of thought, such as divergence and recurrence. The quantitative analysis of speech graphs is not redundant with standard psychometric scales but rather complementary, as it yields a very accurate sorting of schizophrenics and manics. Overall, the results point to automated psychiatric diagnosis based not on what is said, but on how it is said.

Analog circuit synthesis performing fast Pareto frontier exploration and analysis through 3D graphs

This paper presents a technique for performing analog design synthesis at circuit level providing feedback to the designer through the exploration of the Pareto frontier. A modified simulated annealing which is able to perform crossover with past anchor points when a local minimum is found which is used as the optimization algorithm on the initial synthesis procedure. After all specifications are met, the algorithm searches for the extreme points of the Pareto frontier in order to obtain a non-exhaustive exploration of the Pareto front. Finally, multi-objective particle swarm optimization is used to spread the results and to find a more accurate frontier. Piecewise linear functions are used as single-objective cost functions to produce a smooth and equal convergence of all measurements to the desired specifications during the composition of the aggregate objective function. To verify the presented technique two circuits were designed, which are: a Miller amplifier with 96 dB Voltage gain, 15.48 MHz unity gain frequency, slew rate of 19.2 V/mu s with a current supply of 385.15 mu A, and a complementary folded cascode with 104.25 dB Voltage gain, 18.15 MHz of unity gain frequency and a slew rate of 13.370 MV/mu s. These circuits were synthesized using a 0.35 mu m technology. The results show that the method provides a fast approach for good solutions using the modified SA and further good Pareto front exploration through its connection to the particle swarm optimization algorithm.

Probing the cosmic distance-duality relation with the Sunyaev-Zel'dovich effect, X-ray observations and supernovae Ia

Context. The angular diameter distances toward galaxy clusters can be determined with measurements of Sunyaev-Zel'dovich effect and X-ray surface brightness combined with the validity of the distance-duality relation, D-L(z)(1 + z)(2)/D-A(z) = 1, where D-L(z) and D-A(z) are, respectively, the luminosity and angular diameter distances. This combination enables us to probe galaxy cluster physics or even to test the validity of the distance-duality relation itself. Aims. We explore these possibilities based on two different, but complementary approaches. Firstly, in order to constrain the possible galaxy cluster morphologies, the validity of the distance-duality relation (DD relation) is assumed in the Lambda CDM framework (WMAP7). Secondly, by adopting a cosmological-model-independent test, we directly confront the angular diameters from galaxy clusters with two supernovae Ia (SNe Ia) subsamples (carefully chosen to coincide with the cluster positions). The influence of the different SNe Ia light-curve fitters in the previous analysis are also discussed. Methods. We assumed that eta is a function of the redshift parametrized by two different relations: eta(z) = 1 +eta(0)z, and eta(z) = 1 + eta(0)z/(1 + z), where eta(0) is a constant parameter quantifying the possible departure from the strict validity of the DD relation. In order to determine the probability density function (PDF) of eta(0), we considered the angular diameter distances from galaxy clusters recently studied by two different groups by assuming elliptical and spherical isothermal beta models and spherical non-isothermal beta model. The strict validity of the DD relation will occur only if the maximum value of eta(0) PDF is centered on eta(0) = 0. Results. For both approaches we find that the elliptical beta model agrees with the distance-duality relation, whereas the non-isothermal spherical description is, in the best scenario, only marginally compatible. We find that the two-light curve fitters (SALT2 and MLCS2K2) present a statistically significant conflict, and a joint analysis involving the different approaches suggests that clusters are endowed with an elliptical geometry as previously assumed. Conclusions. The statistical analysis presented here provides new evidence that the true geometry of clusters is elliptical. In principle, it is remarkable that a local property such as the geometry of galaxy clusters might be constrained by a global argument like the one provided by the cosmological distance-duality relation.

Suitability of distance metrics as indexes of home-range size in tropical rodent species

Estimators of home-range size require a large number of observations for estimation and sparse data typical of tropical studies often prohibit the use of such estimators. An alternative may be use of distance metrics as indexes of home range. However, tests of correlation between distance metrics and home-range estimators only exist for North American rodents. We evaluated the suitability of 3 distance metrics (mean distance between successive captures [SD], observed range length [ORL], and mean distance between all capture points [AD]) as indexes for home range for 2 Brazilian Atlantic forest rodents, Akodon montensis (montane grass mouse) and Delomys sublineatus (pallid Atlantic forest rat). Further, we investigated the robustness of distance metrics to low numbers of individuals and captures per individual. We observed a strong correlation between distance metrics and the home-range estimator. None of the metrics was influenced by the number of individuals. ORL presented a strong dependence on the number of captures per individual. Accuracy of SD and AD was not dependent on number of captures per individual, but precision of both metrics was low with numbers of captures below 10. We recommend the use of SD and AD instead of ORL and use of caution in interpretation of results based on trapping data with low captures per individual.

Texture descriptor based on partially self-avoiding deterministic walker on networks

Texture image analysis is an important field of investigation that has attracted the attention from computer vision community in the last decades. In this paper, a novel approach for texture image analysis is proposed by using a combination of graph theory and partially self-avoiding deterministic walks. From the image, we build a regular graph where each vertex represents a pixel and it is connected to neighboring pixels (pixels whose spatial distance is less than a given radius). Transformations on the regular graph are applied to emphasize different image features. To characterize the transformed graphs, partially self-avoiding deterministic walks are performed to compose the feature vector. Experimental results on three databases indicate that the proposed method significantly improves correct classification rate compared to the state-of-the-art, e.g. from 89.37% (original tourist walk) to 94.32% on the Brodatz database, from 84.86% (Gabor filter) to 85.07% on the Vistex database and from 92.60% (original tourist walk) to 98.00% on the plant leaves database. In view of these results, it is expected that this method could provide good results in other applications such as texture synthesis and texture segmentation. (C) 2012 Elsevier Ltd. All rights reserved.

Prevalence of the BRCA1 founder mutation c.5266dupin Brazilian individuals at-risk for the hereditary breast and ovarian cancer syndrome

About 5-10% of breast and ovarian carcinomas are hereditary and most of these result from germline mutations in the BRCA1 and BRCA2 genes. In women of Ashkenazi Jewish ascendance, up to 30% of breast and ovarian carcinomas may be attributable to mutations in these genes, where 3 founder mutations, c.68_69del (185delAG) and c.5266dup (5382insC) in BRCA1 and c.5946del (6174delT) in BRCA2, are commonly encountered. It has been suggested by some authors that screening for founder mutations should be undertaken in all Brazilian women with breast cancer. Thus, the goal of this study was to determine the prevalence of three founder mutations, commonly identified in Ashkenazi individuals in a sample of non-Ashkenazi cancer-affected Brazilian women with clearly defined risk factors for hereditary breast and ovarian cancer (HBOC) syndrome. Among 137 unrelated Brazilian women from HBOC families, the BRCA1c.5266dup mutation was identified in seven individuals (5%). This prevalence is similar to that encountered in non-Ashkenazi HBOC families in other populations. However, among patients with bilateral breast cancer, the frequency of c.5266dup was significantly higher when compared to patients with unilateral breast tumors (12.1% vs 1.2%, p = 0.023). The BRCA1 c.68_69del and BRCA2 c.5946del mutations did not occur in this sample. We conclude that screening non-Ashkenazi breast cancer-affected women from the ethnically heterogeneous Brazilian populations for the BRCA1 c.68_69del and BRCA2 c.5946del is not justified, and that screening for BRCA1c.5266dup should be considered in high risk patients, given its prevalence as a single mutation. In high-risk patients, a negative screening result should always be followed by comprehensive BRCA gene testing. The finding of a significantly higher frequency of BRCA1 c.5266dup in women with bilateral breast cancer, as well as existence of other as yet unidentified founder mutations in this population, should be further assessed in a larger well characterized high-risk cohort.

Heuristics for minimizing the maximum within-clusters distance

The clustering problem consists in finding patterns in a data set in order to divide it into clusters with high within-cluster similarity. This paper presents the study of a problem, here called MMD problem, which aims at finding a clustering with a predefined number of clusters that minimizes the largest within-cluster distance (diameter) among all clusters. There are two main objectives in this paper: to propose heuristics for the MMD and to evaluate the suitability of the best proposed heuristic results according to the real classification of some data sets. Regarding the first objective, the results obtained in the experiments indicate a good performance of the best proposed heuristic that outperformed the Complete Linkage algorithm (the most used method from the literature for this problem). Nevertheless, regarding the suitability of the results according to the real classification of the data sets, the proposed heuristic achieved better quality results than C-Means algorithm, but worse than Complete Linkage.

Kinetic of water diffusion and color stability of a resin composite as a function of the curing tip distance

The influence of curing tip distance and storage time in the kinetics of water diffusion (water sorption-W SP, solubility-W SB, and net water uptake) and color stability of a composite were evaluated. Composite samples were polymerized at different distances (5, 10, and 15 mm) and compared to a control group (0 mm). After desiccation, the specimens were stored in distilled water to evaluate the water diffusion over a 120-day period. Net water uptake was calculated (sum of WSP and WSB). The color stability after immersion in a grape juice was compared to distilled water. Data were submitted to three-way ANOVA/Tukey's test (α = 5%). The higher distances caused higher net water uptake (p < 0.05). The immersion in the juice caused significantly higher color change as a function of curing tip distance and the time (p < 0.05). The distance of photoactivation and storage time provide the color alteration and increased net water uptake of the resin composite tested.

Intelligent tutoring system for distance education

This study aims to develop and implement a tool called intelligent tutoring system in an online course to help a formative evaluation in order to improve student learning. According to Bloom et al. (1971,117) formative evaluation is a systematic evaluation to improve the process of teaching and learning. The intelligent tutoring system may provide a timely and high quality feedback that not only informs the correctness of the solution to the problem, but also informs students about the accuracy of the response relative to their current knowledge about the solution. Constructive and supportive feedback should be given to students to reveal the right and wrong answers immediately after taking the test. Feedback about the right answers is a form to reinforce positive behaviors. Identifying possible errors and relating them to the instructional material may help student to strengthen the content under consideration. The remedial suggestion should be given in each answer with detaileddescription with regards the materials and instructional procedures before taking next step. The main idea is to inform students about what they have learned and what they still have to learn. The open-source LMS called Moodle was extended to accomplish the formative evaluation, high-quality feedback, and the communal knowledge presented here with a short online financial math course that is being offered at a large University in Brazil. The preliminary results shows that the intelligent tutoring system using high quality feedback helped students to improve their knowledge about the solution to the problems based on the errors of their past cohorts. The results and suggestion for future work are presented and discussed.

CID: an efficient complexity-invariant distance for time series

The ubiquity of time series data across almost all human endeavors has produced a great interest in time series data mining in the last decade. While dozens of classification algorithms have been applied to time series, recent empirical evidence strongly suggests that simple nearest neighbor classification is exceptionally difficult to beat. The choice of distance measure used by the nearest neighbor algorithm is important, and depends on the invariances required by the domain. For example, motion capture data typically requires invariance to warping, and cardiology data requires invariance to the baseline (the mean value). Similarly, recent work suggests that for time series clustering, the choice of clustering algorithm is much less important than the choice of distance measure used.In this work we make a somewhat surprising claim. There is an invariance that the community seems to have missed, complexity invariance. Intuitively, the problem is that in many domains the different classes may have different complexities, and pairs of complex objects, even those which subjectively may seem very similar to the human eye, tend to be further apart under current distance measures than pairs of simple objects. This fact introduces errors in nearest neighbor classification, where some complex objects may be incorrectly assigned to a simpler class. Similarly, for clustering this effect can introduce errors by “suggesting” to the clustering algorithm that subjectively similar, but complex objects belong in a sparser and larger diameter cluster than is truly warranted.We introduce the first complexity-invariant distance measure for time series, and show that it generally produces significant improvements in classification and clustering accuracy. We further show that this improvement does not compromise efficiency, since we can lower bound the measure and use a modification of triangular inequality, thus making use of most existing indexing and data mining algorithms. We evaluate our ideas with the largest and most comprehensive set of time series mining experiments ever attempted in a single work, and show that complexity-invariant distance measures can produce improvements in classification and clustering in the vast majority of cases.