This paper presents a novel on-the-fly, black-box, property-checking through learning approach as means for verifying requirements of recurrent neural networks (RNN) in the context sequence classification. Our technique steps on tool probably approximately correct (PAC) deterministic finite automata (DFA). The classifier inside black-box consists Boolean combination several components, includin...

Trichomycterus areolatus Valenciennes, 1846 is a small endemic catfish inhabiting the Andean river basins of Chile. In this study, the morphological variability of three T. areolatus populations, collected in two river basins from southern Chile, was assessed with multivariate analyses, including principal component analysis (PCA) and discriminant function analysis (DFA). It is hypothesized tha...

Frameworks for interprocedural data ow analysis (DFA) often have a foundational character: designing concrete applications requires usually a deep understanding of the framework. Here, we reconsider interprocedural DFA from an application-oriented point of view, where all details irrelevant for application are hidden. In this view the underlying framework, which captures programs with mutually ...

Traditional seminal fluid-based clinical descriptors used to predict infertility and sub-fertility have shortcomings, including lack of insight into the underlying pathology. These methods are also time-consuming and labor-intensive. To address these limitations, (1)H nuclear magnetic resonance (NMR) spectroscopy was used to identify and classify signature biomarkers. Semen samples collected fr...

Requirements to control the large decrease in serum calcium (Ca) due to parturition and to increase the feed intake soon after parturition have been well accepted in dairy cows. This study was aimed to investigate the feed intake affected by serum Ca concentration with difructose anhydride (DFA) III supplement in dairy cows soon after parturition. Fourteen transition Holstein cows were divided ...

The problem of k-minimisation for a DFA M is the computation of a smallest DFAN (where the size |M | of a DFAM is the size of the domain of the transition function) such that L(M)4L(N) ⊆ Σ, which means that their recognized languages differ only on words of length less than k. The previously best algorithm, which runs in time O(|M | log n) where n is the number of states, is extended to DFAs wi...

We study the properties of memory of a financial time series adopting two different methods of analysis, the detrended fluctuation analysis (DFA) and the analysis of the power spectrum (PSA). The methods are applied on three time series: one of high-frequency returns, one of shuffled returns and one of absolute values of returns. We prove that both DFA and PSA give results in line with those ob...