Fast mining of non-derivable episode rules in complex sequences

Researchers have been endeavoring to discover concise sets of episode rules instead of complete sets in sequences. Existing approaches, however, are not able to process complex sequences and can not guarantee the accuracy of resulting sets due to the violation of anti-monotonicity of the frequency metric. In some real applications, episode rules need to be extracted from complex sequences in which multiple items may appear in a time slot. This paper investigates the discovery of concise episode rules in complex sequences. We define a concise representation called non-derivable episode rules and formularize the mining problem. Adopting a novel anti-monotonic frequency metric, we then develop a fast approach to discover non-derivable episode rules in complex sequences. Experimental results demonstrate that the utility of the proposed approach substantially reduces the number of rules and achieves fast processing.

Highly efficient serial episode discovery in streams and complex sequences

This research proposed a series of methodologies and algorithms for highly efficient serial episode discovery in streams and complex sequences, and applied the developed techniques to quantitative analysis of the effects of price promotions. This research has outputted nine ERA ranking AlB papers published in international journals and conferences.

Mining condensed sets of frequent episodes with more accurate frequencies from complex sequences

Many previous approaches to frequent episode discovery only accept simple sequences. Although a recent approach has been able to nd frequent episodes from complex sequences, the discovered sets are neither condensed nor accurate. This paper investigates the discovery of condensed sets of frequent episodes from complex sequences. We adopt a novel anti-monotonic frequency measure based on non-redundant occurrences, and dene a condensed set, nDaCF (the set of non-derivable approximately closed frequent episodes) within a given maximal error bound of support. We then introduce a series of effective pruning strategies, and develop a method, nDaCF-Miner, for discovering nDaCF sets. Experimental results show that, when the error bound is somewhat high, the discovered nDaCF sets are two orders of magnitude smaller than complete sets, and nDaCF-miner is more efficient than previous mining approaches. In addition, the nDaCF sets are more accurate than the sets found by previous approaches.

Application of a dynamic event tree methodolgy to steam generator tube rupture sequences

The Integrated Safety Assessment (ISA) methodology, developed by the Spanish Nuclear Safety Council (CSN), has been applied to a thermo-hydraulical analysis of a Westinghouse 3-loop PWR plant by means of the dynamic event trees (DET) for Steam Generator Tube Rupture (SGTR) sequences. The ISA methodology allows obtaining the SGTR Dynamic Event Tree taking into account the operator actuation times. Simulations are performed with SCAIS (Simulation Code system for Integrated Safety Assessment), which includes a dynamic coupling with MAAP thermal hydraulic code. The results show the capability of the ISA methodology and SCAIS platform to obtain the DET of complex sequences.

BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations

BAliBASE is specifically designed to serve as an evaluation resource to address all the problems encountered when aligning complete sequences. The database contains high quality, manually constructed multiple sequence alignments together with detailed annotations. The alignments are all based on three-dimensional structural superpositions, with the exception of the transmembrane sequences. The first release provided sets of reference alignments dealing with the problems of high variability, unequal repartition and large N/C-terminal extensions and internal insertions. Here we describe version 2.0 of the database, which incorporates three new reference sets of alignments containing structural repeats, trans­membrane sequences and circular permutations to evaluate the accuracy of detection/prediction and alignment of these complex sequences. BAliBASE can be viewed at the web site http://www-igbmc.u-strasbg.fr/BioInfo/BAliBASE2/index.html or can be downloaded from ftp://ftp-igbmc.u-strasbg.fr/pub/BAliBASE2/.

Language Experience Affects Grouping of Musical Instrument Sounds

Language experience clearly affects the perception of speech, but little is known about whether these differences in perception extend to non-speech sounds. In this study, we investigated rhythmic perception of non-linguistic sounds in speakers of French and German using a grouping task, in which complexity (variability in sounds, presence of pauses) was manipulated. In this task, participants grouped sequences of auditory chimeras formed from musical instruments. These chimeras mimic the complexity of speech without being speech. We found that, while showing the same overall grouping preferences, the German speakers showed stronger biases than the French speakers in grouping complex sequences. Sound variability reduced all participants' biases, resulting in the French group showing no grouping preference for the most variable sequences, though this reduction was attenuated by musical experience. In sum, this study demonstrates that linguistic experience, musical experience, and complexity affect rhythmic grouping of non-linguistic sounds and suggests that experience with acoustic cues in a meaningful context (language or music) is necessary for developing a robust grouping preference that survives acoustic variability.

Quality of pre-school children's pretend play and subsequent development of semantic organization and narrative re-telling skills

Purpose: This study investigated if the quality of pre-school children's pretend play predicted their semantic organization and narrative re-telling ability when they were in early primary school. It was hypothesized that the elaborateness of a child's play and the child's use of symbols in play were predictors of their semantic organization and narrative re-tell scores of the School Age Oral Language Assessment. Method: Forty-eight children were assessed using the Child-Initiated Pretend Play Assessment when they were aged 4-5 years. Three-to-five years after this assessment their semantic organization and narrative re-telling skills were assessed. Results: Results indicate that the elaborateness of a child's play and their ability to use symbols was predictive of semantic organization skills. Use of symbols in play was the strongest play predictor of narrative re-telling skills. The quality of a pre-school child's ability to elaborate complex sequences in pretend play and use symbols predicted up to 20% of a child's semantic organization and narrative re-telling skills up to 5 years later. Conclusions: The study provides evidence that the quality of pretend play in 4-5 year olds is important for semantic organization and narrative re-telling abilities in the school-aged child.

Enumeração de espectro de distâncias de esquemas de modulação codificada em treliça empregando codificação turbo

In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is the use of union bound of error probability, because of its easy implementation and computational produce bounds that converge quickly. Since it is the union bound, it should use to expurge some elements of distance spectrum to obtain a tight bound. The main contribution of this work is that the listing proposal is carried out from the puncturing at the level of symbol rather than bit-level as in most works of literature. The main reason for using the symbol level puncturing lies in the fact that the enummerating function of the turbo scheme is obtained directly from complex sequences of signals through the trellis and not indirectly from the binary sequences that require further binary to complex mapping, as proposed by previous works. Thus, algorithms can be applied through matrix from the adjacency matrix, which is obtained by calculating the distances of the complex sequences of the trellis. This work also presents two matrix algorithms for state reduction and the evaluation of the transfer function of this. The results presented in comparisons of the bounds obtained using the proposed technique with some turbo codes of the literature corroborate the proposition of this paper that the expurgated bounds obtained are quite tight and matrix algorithms are easily implemented in any programming software language

Avaliação da gordura hepática utilizando ressonância magnética

A esteatose hepática, que se caracteriza pelo acúmulo excessivo de gordura nas células do fígado, é um problema que vem preocupando a comunidade médico-científica, pois sua incidência vem aumentando a nível global, com expectativa de se tornar a doença crônica hepática de maior predominância em várias partes do mundo. Apesar de ser considerada uma doença benigna, a esteatose pode evoluir para doenças mais graves como cirrose, fibrose avançada, esteato hepatite (com ou sem fibrose) ou carcinoma. Entretanto, é potencialmente reversível, mesmo em quadros mais graves, o que reforça a urgência de se desenvolver métodos confiáveis para detecção e avaliação, inclusive ao longo de tratamento. Os métodos atuais para diagnóstico e quantificação da gordura hepática ainda são falhos: com a ultrassonografia não se é capaz de realizar quantificação; a tomografia computadorizada faz uso de radiação ionizante; a punção (biópsia), considerada o padrão ouro, é precisa, mas invasiva e pontual. A Ressonância Magnética (RM), tanto com espectroscopia (MRS) como com imagem (MRI), são alternativas completamente não invasivas, capazes de fornecer o diagnóstico e quantificação da gordura infiltrada no fígado. Entretanto, os trabalhos encontrados na literatura utilizam sequências de pulsos desenvolvidas especialmente para esse fim, com métodos de pós-processamento extremamente rebuscados, o que não é compatível com o estado atual dos equipamentos encontrados em ambientes clínicos nem mesmo ao nível de experiência e conhecimento das equipes técnicas que atuam em clínicas de radiodiagnóstico. Assim, o objetivo central do presente trabalho foi avaliar o potencial da RM como candidato a método de diagnóstico e de quantificação de gordura em ambientes clínicos, utilizando, para isso, sequências de pulsos convencionais, disponíveis em qualquer sistema comercial de RM, com protocolos de aquisição e processamento compatíveis com àqueles realizados em exames clínicos, tanto no que se refere à simplicidade como ao tempo total de aquisição. Foram avaliadas diferentes abordagens de MRS e MRI utilizando a biópsia hepática como padrão de referência. Foram avaliados pacientes portadores de diabetes tipo II, que apresentam alta prevalência de esteatose hepática não alcoólica, além de grande variabilidade nos percentuais de gordura. Foram realizadas medidas de correlação, acurácia, sensibilidade e especificidade de cada uma das abordagens utilizadas. Todos os métodos avaliados apresentaram alto grau de correlação positiva (> 87%) com os dados obtidos de maneira invasiva, o que revela que os valores obtidos utilizando RM estão de acordo com aquilo observado pela biópsia hepática. Muito embora os métodos de processamento utilizados não sejam tão complexos quanto seriam necessários caso uma quantificação absoluta fosse desejada, nossas análises mostraram alta acurácia, especificidade e sensibilidade da RM na avaliação da esteatose. Em conclusão, a RM se apresenta, de fato, como uma excelente candidata para avaliar, de forma não invasiva, a fração de gordura hepática, mesmo quando se considera as limitações impostas por um ambiente clínico convencional. Isso sugere que essas novas metodologias podem começar a migrar para ambientes clínicos sem depender das sequências complexas e dos processamentos exóticos que estão descritos na literatura mais atual.

Approximating differentiable relationships between delay embedded dynamical systems with radical basis functions

This thesis is about the study of relationships between experimental dynamical systems. The basic approach is to fit radial basis function maps between time delay embeddings of manifolds. We have shown that under certain conditions these maps are generically diffeomorphisms, and can be analysed to determine whether or not the manifolds in question are diffeomorphically related to each other. If not, a study of the distribution of errors may provide information about the lack of equivalence between the two. The method has applications wherever two or more sensors are used to measure a single system, or where a single sensor can respond on more than one time scale: their respective time series can be tested to determine whether or not they are coupled, and to what degree. One application which we have explored is the determination of a minimum embedding dimension for dynamical system reconstruction. In this special case the diffeomorphism in question is closely related to the predictor for the time series itself. Linear transformations of delay embedded manifolds can also be shown to have nonlinear inverses under the right conditions, and we have used radial basis functions to approximate these inverse maps in a variety of contexts. This method is particularly useful when the linear transformation corresponds to the delay embedding of a finite impulse response filtered time series. One application of fitting an inverse to this linear map is the detection of periodic orbits in chaotic attractors, using suitably tuned filters. This method has also been used to separate signals with known bandwidths from deterministic noise, by tuning a filter to stop the signal and then recovering the chaos with the nonlinear inverse. The method may have applications to the cancellation of noise generated by mechanical or electrical systems. In the course of this research a sophisticated piece of software has been developed. The program allows the construction of a hierarchy of delay embeddings from scalar and multi-valued time series. The embedded objects can be analysed graphically, and radial basis function maps can be fitted between them asynchronously, in parallel, on a multi-processor machine. In addition to a graphical user interface, the program can be driven by a batch mode command language, incorporating the concept of parallel and sequential instruction groups and enabling complex sequences of experiments to be performed in parallel in a resource-efficient manner.

Drosophila 3′ UTRs are more complex than protein-coding sequences

The 3′ UTRs of eukaryotic genes participate in a variety of post-transcriptional (and some transcriptional) regulatory interactions. Some of these interactions are well characterised, but an undetermined number remain to be discovered. While some regulatory sequences in 3′ UTRs may be conserved over long evolutionary time scales, others may have only ephemeral functional significance as regulatory profiles respond to changing selective pressures. Here we propose a sensitive segmentation methodology for investigating patterns of composition and conservation in 3′ UTRs based on comparison of closely related species. We describe encodings of pairwise and three-way alignments integrating information about conservation, GC content and transition/transversion ratios and apply the method to three closely related Drosophila species: D. melanogaster, D. simulans and D. yakuba. Incorporating multiple data types greatly increased the number of segment classes identified compared to similar methods based on conservation or GC content alone. We propose that the number of segments and number of types of segment identified by the method can be used as proxies for functional complexity. Our main finding is that the number of segments and segment classes identified in 3′ UTRs is greater than in the same length of protein-coding sequence, suggesting greater functional complexity in 3′ UTRs. There is thus a need for sustained and extensive efforts by bioinformaticians to delineate functional elements in this important genomic fraction. C code, data and results are available upon request.

Complex networks constructed from irrational number sequences

In this paper, we construct (d, r) networks from sequences of different irrational numbers. In detail, segment an irrational number sequence of length M into groups of d digits which represent the nodes while two consecutive groups overlap by r digits (r = 0,1,...,d-1), and the undirected edges indicate the adjacency between two consecutive groups. (3, r) and (4, r) networks are respectively constructed from 14 different irrational numbers and their topological properties are examined. By observation, we find that network topologies change with different values of d, r and even sequence length M instead of the types of irrational numbers, although they share some similar features with traditional random graphs. We make a further investigation to explain these interesting phenomena and propose the identical-degree random graph model. The results presented in this paper provide some insight into distributions of irrational number digits that may help better understanding of the nature of irrational numbers.