Hybrid Method for Digits Recognition using Fixed-Frame Scores and Derived Pitch

This paper presents a procedure of frame normalization based on the traditional dynamic time warping (DTW) using the LPC coefficients. The redefined method is called as the DTW frame-fixing method (DTW-FF), it works by normalizing the word frames of the input against the reference frames. The enthusiasm to this study is due to neural network limitation that entails a fix number of input nodes for when processing multiple inputs in parallel. Due to this problem, this research is initiated to reduce the amount of computation and complexity in a neural network by reducing the number of inputs into the network. In this study, dynamic warping process is used, in which local distance scores of the warping path are fixed and collected so that their scores are of equal number of frames. Also studied in this paper is the consideration of pitch as a contributing feature to the speech recognition. Results showed a good performance and improvement when using pitch along with DTW-FF feature. The convergence rate between using the steepest gradient descent is also compared to another method namely conjugate gradient method. Convergence rate is also improved when conjugate gradient method is introduced in the back-propagation algorithm

Regular symmetry patterns

Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework for capturing symmetry patterns in parameterised systems (i.e. an infinite family of finite-state systems): two regular word transducers to represent, respectively, parameterised systems and symmetry patterns. The framework subsumes various types of "symmetry relations" ranging from weaker notions (e.g. simulation preorders) to the strongest notion (i.e. isomorphisms). Our framework enjoys two algorithmic properties: (1) symmetry verification: given a transducer, we can automatically check whether it is a symmetry pattern of a given system, and (2) symmetry synthesis: we can automatically generate a symmetry pattern for a given system in the form of a transducer. Furthermore, our symbolic language allows additional constraints that the symmetry patterns need to satisfy to be easily incorporated in the verification/synthesis. We show how these properties can help identify symmetry patterns in examples like dining philosopher protocols, self-stabilising protocols, and prioritised resource-allocator protocol. In some cases (e.g. Gries's coffee can problem), our technique automatically synthesises a safety-preserving finite approximant, which can then be verified for safety solely using a finite-state model checker.UPMAR

Toll-like Receptor-4 Regulation of Hepatic Cyp3a11 Metabolism in a Mouse Model of LPS-induced CNS Inflammation

Central nervous system (CNS) infection and inflammation severely reduce the capacity of cytochrome P-450 metabolism in the liver. We developed a mouse model to examine the effects of CNS inflammation on hepatic cytochrome P-450 metabolism. FVB, C57BL/6, and C3H/HeouJ mice were given Escherichia coli LPS (2.5 μg) by intracerebroventricular (ICV) injection. The CNS inflammatory response was confirmed by the elevation of TNF-α and/or IL-1β proteins in the brain. In all mouse strains, LPS produced a 60–70% loss in hepatic Cyp3a11 expression and activity compared with saline-injected controls. Adrenalectomy did not prevent the loss in Cyp3a11 expression or activity, thereby precluding the involvement of the hypothalamic-adrenal-pituitary axis. Endotoxin was detectable (1–10 ng/ml) in serum between 15 and 120 min after ICV dosing of 2.5 μg LPS. Peripheral administration of 2.5 μg LPS by intraperitoneal injection produced similar serum endotoxin levels and a similar loss (60%) in Cyp3a11 expression and activity in the liver. The loss of Cyp3a11 in response to centrally or peripherally administered LPS could not be evoked in Toll-like receptor-4 (TLR4)-mutant (C3H/ HeJ) mice, indicating that TLR4 signaling pathways are directly involved in the enzyme loss. In summary, we conclude that LPS is transferred from the brain to the circulation in significant quantities in a model of CNS infection or inflammation. Subsequently, LPS that has reached the circulation stimulates a TLR4-dependent mechanism in the periphery, evoking a reduction in Cyp3a11 expression and metabolism in the liver

On Automated Lemma Generation for Separation Logic with Inductive Definitions

Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and deterministic strategies for applying them. Our approach focuses on iterative programs, although it can be applied to recursive programs as well, and specifications that describe not only the shape of the data structures, but also their content or their size. Empirically, we find that our approach is powerful enough to deal with sophisticated benchmarks, e.g., iterative procedures for searching, inserting, or deleting elements in sorted lists, binary search tress, red-black trees, and AVL trees, in a very efficient way

Graph-Based Shape Analysis Beyond Context-Freeness

We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to guide concretization and abstraction. This novel extension of context-free graph grammars is powerful enough to model complex data structures such as balanced binary trees with parent pointers, while preserving most desirable properties of context-free graph grammars. One strength of our analysis is that no artifacts apart from grammars are required from the user; it thus offers a high degree of automation. We implemented our analysis and successfully applied it to various programs manipulating AVL trees, (doubly-linked) lists, and combinations of both

Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis

The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem. Although backward reachability is property-directed, it can unnecessarily explore (large) portions of the state space of a system which are not required to verify the safety property under consideration. To avoid this, invariants can be used to dramatically prune the search space. Indeed, the problem is to guess such appropriate invariants. In this paper, we present a fully declarative and symbolic approach to the mechanization of backward reachability of infinite state systems manipulating arrays by Satisfiability Modulo Theories solving. Theories are used to specify the topology and the data manipulated by the system. We identify sufficient conditions on the theories to ensure the termination of backward reachability and we show the completeness of a method for invariant synthesis (obtained as the dual of backward reachability), again, under suitable hypotheses on the theories. We also present a pragmatic approach to interleave invariant synthesis and backward reachability so that a fix-point for the set of backward reachable states is more easily obtained. Finally, we discuss heuristics that allow us to derive an implementation of the techniques in the model checker MCMT, showing remarkable speed-ups on a significant set of safety problems extracted from a variety of sources.Comment: Accepted for publication in Logical Methods in Computer Scienc

Dealing with the Tail: Remedial Tutorials for Second-year Electrical-engineering Students

An intervention aimed at improving the success rate of at-risk students in three key secondyear electrical-engineering courses covering, respectively, the topics of circuit theory, electronics and electromagnetics is reported. At-risk students are identified by a combination of diagnostic testing and early coursework results. These students are then invited to join a special, weekly, âFoundation Tutorialâ in which both technical and learning obstacles are addressed. Two years of data are presented which suggest that such an intervention does produce a significant improvement in the success rate of participating students

Photoluminescence and Electron Spin Resonance of ilicon Dioxide Crystal with Rutile Structure (Stishovite)

This work was supported by ERANET MYND. Also, financial support provided by Scientific Research Project for Students and Young Researchers Nr. SJZ/2017/2 realized at the Institute of Solid State Physics, University of Latvia is greatly acknowledged. The authors express our gratitude to R.I. Mashkovtsev for help in ESR signal interpretation. The authors are appreciative to T.I. Dyuzheva, L.M. Lityagina, N.A. Bendeliani for stishovite single crystals and to K. Hubner and H.-J. Fitting for stishovite powder of Barringer Meteor Crater.An electron spin resonance (ESR) and photoluminescence signal is observed in the as grown single crystal of stishovite indicating the presence of defects in the non‐irradiated sample. The photoluminescence of the as received stishovite single crystals exhibits two main bands – a blue at 3 eV and an UV at 4.75 eV. Luminescence is excited in the range of optical transparency of stishovite (below 8.75 eV) and, therefore, is ascribed to defects. A wide range of decay kinetics under a pulsed excitation is observed. For the blue band besides the exponential decay with a time constant of about 18 μs an additional ms component is revealed. For the UV band besides the fast component with a time constant of 1–3 ns a component with a decay in tens μs is obtained. The main components (18 μs and 1–3 ns) possess a typical intra‐center transition intensity thermal quenching. The effect of the additional slow component is related to the presence of OH groups and/or carbon molecular defects modifying the luminescence center. The additional slow components exhibit wave‐like thermal dependences. Photo‐thermally stimulated creation–destruction of the complex comprising host defect and interstitial modifiers explains the slow luminescence wave‐like thermal dependences.ERANET MYND; ISSP UL Nr. SJZ/2017/2 ; Institute of Solid State Physics, University of Latvia as the Center of Excellence has received funding from the European Union’s Horizon 2020 Framework Programme H2020-WIDESPREAD-01-2016-2017-TeamingPhase2 under grant agreement No. 739508, project CAMART