Search results for "TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES"
showing 10 items of 174 documents
Single-cell trajectories reconstruction, exploration and mapping of omics data with STREAM
2019
Single-cell transcriptomic assays have enabled the de novo reconstruction of lineage differentiation trajectories, along with the characterization of cellular heterogeneity and state transitions. Several methods have been developed for reconstructing developmental trajectories from single-cell transcriptomic data, but efforts on analyzing single-cell epigenomic data and on trajectory visualization remain limited. Here we present STREAM, an interactive pipeline capable of disentangling and visualizing complex branching trajectories from both single-cell transcriptomic and epigenomic data. We have tested STREAM on several synthetic and real datasets generated with different single-cell techno…
An Industrial Automation Course: Common Infrastructure for Physical, Virtual and Remote Laboratories for PLC Programming
2018
<span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-fareast-font-family: 'Times New Roman'; mso-ansi-language: EN-US; mso-fareast-language: DE; mso-bidi-language: AR-SA;">This work describes the development of a teaching strategy to leverage current simulation tools and promote learning of industrial automation systems. Specifically, Programmable Logic Controller (PLC) programming in an industrial automation course. We propose an infrastructure where it is possible to work with physical, virtual and mixed laboratories</span>
Unification in superintuitionistic predicate logics and its applications
2018
AbstractWe introduce unification in first-order logic. In propositional logic, unification was introduced by S. Ghilardi, see Ghilardi (1997, 1999, 2000). He successfully applied it in solving systematically the problem of admissibility of inference rules in intuitionistic and transitive modal propositional logics. Here we focus on superintuitionistic predicate logics and apply unification to some old and new problems: definability of disjunction and existential quantifier, disjunction and existential quantifier under implication, admissible rules, a basis for the passive rules, (almost) structural completeness, etc. For this aim we apply modified specific notions, introduced in proposition…
Some Problems on Homomorphisms and Real Function Algebras
2001
In this paper we solve a problem about the representation of all homomorphisms on a real function algebra as point evaluations and another two about function algebras in which homomorphisms are point evaluations on sequences in the algebra.
On a new proof of Moser's twist mapping theorem
1976
Based on a new idea of the author, a new proof of J. Moser's twist mapping theorem is presented.
Natural Language Parsing
2009
Automatic natural language processing captures a lion’s share of the attention in open information management. In one way or another, many applications have to deal with natural language input. In this chapter the authors investigate the problem of natural language parsing from the perspective of biolinguistics. They argue that the human mind succeeds in the parsing task without the help of languagespecific rules of parsing and language-specific rules of grammar. Instead, there is a universal parser incorporating a universal grammar. The main argument comes from language acquisition: Children cannot learn language specific parsing rules by rule induction due to the complexity of unconstrain…
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
2004
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
Insights into Genetic Diversity, Runs of Homozygosity and Heterozygosity-Rich Regions in Maremmana Semi-Feral Cattle Using Pedigree and Genomic Data
2020
Semi-feral local livestock populations, like Maremmana cattle, are the object of renewed interest for the conservation of biological diversity and the preservation and exploitation of unique and potentially relevant genetic material. The aim of this study was to estimate genetic diversity parameters in semi-feral Maremmana cattle using both pedigree- and genomic-based approaches (FIS and FROH), and to detect regions of homozygosity (ROH) and heterozygosity (ROHet) in the genome. The average heterozygosity estimates were in the range reported for other cattle breeds (HE=0.261, HO=0.274). Pedigree-based average inbreeding (F) was estimated at 4.9%. The correlation was low between F and genomi…
Form factors of the isovector scalar current and the ηπ scattering phase shifts
2015
33 pages.- 14 figures.- v2: Some clarifications and corrections of typos
Raons essencials i creença
2003
In this paper I defend that what I call modes of denotation are part of one¿s belief content, even if they are not part of the proposition expressed by the sentence one believes to be true. Two people, who believe of the same sentence (not ambiguous) that it is true can have different belief contents that they express by means of this same sentence.