158 research outputs found
Some aspects of linear space automata
Linear space automaton is introduced as a generalization of probabilistic automaton and its various properties are investigated.Linear space automaton has the abilities equivalent to probabilistic automaton but we can treat the former more easily than the latter because we can make use of properties of the linear space, successfully.First the solutions are given for the problems of connectivity, state equivalence, reduction and identification of linear space automata. Second, the matrix representation of linear space automaton is investigated and the relations between linear space automaton and probabilistic automaton are shown. Third, we discuss the closure properties of the family of all real functions on a free semigroup Σ* which are defined by linear space automata and then give a solution to the synthesis problem of linear space automata.Finally, some considerations are given to the problems of sets of tapes accepted by l.a.'s and also of operations under which the family of all the output functions of l.a.'s is not closed
Propofol Alters Long Non-Coding RNA Profiles in the Neonatal Mouse Hippocampus: Implication of Novel Mechanisms in Anesthetic-Induced Developmental Neurotoxicity
Background: Propofol induces acute neurotoxicity (e.g., neuroapoptosis) followed by impairment of long-term memory and learning in animals. However, underlying mechanisms remain largely unknown. Long non-coding RNAs (lncRNAs) are found to participate in various pathological processes. We hypothesized that lncRNA profile and the associated signaling pathways were altered, and these changes might be related to the neurotoxicity observed in the neonatal mouse hippocampus following propofol exposure. Methods: In this laboratory experiment, 7-day-old mice were exposed to a subanesthetic dose of propofol for 3 hours, with 4 animals per group. Hippocampal tissues were harvested 3 hours after propofol administration. Neuroapoptosis was analyzed based on caspase 3 activity using a colorimetric assay. A microarray was performed to investigate the profiles of 35,923 lncRNAs and 24,881 messenger RNAs (mRNAs). Representative differentially expressed lncRNAs and mRNAs were validated using reverse transcription quantitative polymerase chain reaction. All mRNAs dysregulated by propofol and the 50 top-ranked, significantly dysregulated lncRNAs were subject to bioinformatics analysis for exploring the potential mechanisms and signaling network of propofol-induced neurotoxicity. Results: Propofol induced neuroapoptosis in the hippocampus, with differential expression of 159 lncRNAs and 100 mRNAs (fold change ± 2.0, P< 0.05). Bioinformatics analysis demonstrated that these lncRNAs and their associated mRNAs might participate in neurodegenerative pathways (e.g., calcium handling, apoptosis, autophagy, and synaptogenesis). Conclusion: This novel report emphasizes that propofol alters profiles of lncRNAs, mRNAs, and their cooperative signaling network, which provides novel insights into molecular mechanisms of anesthetic-induced developmental neurodegeneration and preventive targets against the neurotoxicity
Robust Dependency Parsing of Spontaneous Japanese Speech and Its Evaluation
Spontaneously spoken Japanese includes a lot of grammatically\ud
ill-formed linguistic phenomena such as fillers,\ud
hesitations, inversions, and so on, which do not appear in\ud
written language. This paper proposes a method of robust\ud
dependency parsing using a large-scale spoken language\ud
corpus, and evaluates the availability and robustness\ud
of the method using spontaneously spoken dialogue\ud
sentences. By utilizing stochastic information about the\ud
appearance of ill-formed phenomena, the method can robustly\ud
parse spoken Japanese including fillers, inversions,\ud
or dependencies over utterance units. As a result of an experiment,\ud
the parsing accuracy provided 87.0%, and we\ud
confirmed that it is effective to utilize the location information\ud
of a bunsetsu, and the distance information between\ud
bunsetsus as stochastic information
Symbolic Alternative Characterizations of Testing Preorder for Regular Timed Processes(Concurrency Theory and Applications '96)
An application of Pseudo-Boolean programming to the state assignment of sequential circuits with high reliability
- …