Search results for "76"

showing 10 items of 2584 documents

Visibly pushdown modular games,

2014

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automat…

FOS: Computer and information sciencesComputer Science::Computer Science and Game TheoryComputer Science - Logic in Computer ScienceTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFormal Languages and Automata Theory (cs.FL)Computer scienceComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)Pushdown01 natural scienceslcsh:QA75.5-76.95Theoretical Computer ScienceComputer Science - Computer Science and Game TheoryComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineeringTemporal logicRecursionbusiness.industrylcsh:MathematicsGames; Modular; Pushdown; Theoretical Computer Science; Information Systems; Computer Science Applications; Computational Theory and MathematicsPushdown automatonModular designDecision problemlcsh:QA1-939Logic in Computer Science (cs.LO)Computer Science ApplicationsUndecidable problemDecidabilityNondeterministic algorithmComputer Science - Computational ComplexityModularTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceGamesbusinessComputer Science::Formal Languages and Automata TheoryComputer Science and Game Theory (cs.GT)Information SystemsInformation and Computation
researchProduct

Monoids and Maximal Codes

2011

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maxi…

FOS: Computer and information sciencesDiscrete mathematicsMonoidCode (set theory)Formal Languages and Automata Theory (cs.FL)lcsh:MathematicsComputer Science - Formal Languages and Automata TheoryAstrophysics::Cosmology and Extragalactic Astrophysicslcsh:QA1-939lcsh:QA75.5-76.95Set (abstract data type)chemistry.chemical_compoundchemistryFOS: MathematicsMathematics - CombinatoricsOrder (group theory)High Energy Physics::ExperimentCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceCharacteristic propertyPartially ordered setMaximal elementMathematicsElectronic Proceedings in Theoretical Computer Science
researchProduct

A Classification of Trapezoidal Words

2011

Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences in the word, the second one being a suffix of the word. Otherwise it is open. We show that open trapezoidal words are all primitive and that closed trapezoidal words are all Sturmian. We then show that trapezoidal palindromes are closed (and therefore Sturmian). This allows us to characterize the special factors of Sturmian palindromes. We end with several open problems.

FOS: Computer and information sciencesFormal Languages and Automata Theory (cs.FL)lcsh:Mathematicstrapezoidal words Sturmian words special factors palindromesPalindromeComputer Science - Formal Languages and Automata TheoryDisjoint setslcsh:QA1-939lcsh:QA75.5-76.95PrefixCombinatoricsF.4.3FOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceSuffixWord (group theory)Mathematics
researchProduct

Causal Effect Identification from Multiple Incomplete Data Sources: A General Search-Based Approach

2021

Causal effect identification considers whether an interventional probability distribution can be uniquely determined without parametric assumptions from measured source distributions and structural knowledge on the generating system. While complete graphical criteria and procedures exist for many identification problems, there are still challenging but important extensions that have not been considered in the literature. To tackle these new settings, we present a search algorithm directly over the rules of do-calculus. Due to generality of do-calculus, the search is capable of taking more advanced data-generating mechanisms into account along with an arbitrary type of both observational and…

FOS: Computer and information sciencesStatistics and ProbabilityComputer Science - Machine LearningcausalityComputer Science - Artificial IntelligenceHeuristic (computer science)Computer scienceeducationMachine Learning (stat.ML)transportabilitycomputer.software_genre01 natural sciencesMachine Learning (cs.LG)R-kielimissing dataQA76.75-76.765; QA273-280010104 statistics & probabilitydo-calculuscausality; do-calculus; selection bias; transportability; missing data; case-control design; meta-analysisStatistics - Machine LearningSearch algorithmselection bias0101 mathematicsParametric statisticspäättelymeta-analyysicase-control designhakualgoritmit113 Computer and information sciencesMissing datameta-analysisIdentification (information)Artificial Intelligence (cs.AI)Causal inferencekausaliteettiIdentifiabilityProbability distributionData miningStatistics Probability and UncertaintycomputerSoftwareJournal of Statistical Software
researchProduct

Exact affine counter automata

2017

We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata. Lastly, we show that how a counter helps for affine finite automata by showing that the language MANYTWINS, which is conjectured not to be recognized by affin…

FOS: Computer and information sciencesTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESautomataFormal Languages and Automata Theory (cs.FL)GeneralizationComputer scienceFOS: Physical sciencesComputer Science - Formal Languages and Automata Theorycounter automataМатематика0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)01 natural sciencesquantum computinglcsh:QA75.5-76.95Deterministic pushdown automatonComputer Science (miscellaneous)0202 electrical engineering electronic engineering information engineeringQuantum finite automataPromise problemTime complexityDiscrete mathematicsQuantum Physicscomputational complexityFinite-state machinelcsh:MathematicsИнформатикаpushdown automatalcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesКибернетикаAutomatonComputer Science - Computational ComplexityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceAffine transformationaffine computingQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata Theory
researchProduct

Myocardial Infarction Quantification from Late Gadolinium Enhancement MRI Using Top-Hat Transforms and Neural Networks

2019

Significance: Late gadolinium enhanced magnetic resonance imaging (LGE-MRI) is the gold standard technique for myocardial viability assessment. Although the technique accurately reflects the damaged tissue, there is no clinical standard for quantifying myocardial infarction (MI), demanding most algorithms to be expert dependent. Objectives and Methods: In this work a new automatic method for MI quantification from LGE-MRI is proposed. Our novel segmentation approach is devised for accurately detecting not only hyper-enhanced lesions, but also microvascular-obstructed areas. Moreover, it includes a myocardial disease detection step which extends the algorithm for working under healthy scans.…

FOS: Computer and information sciencesscar segmentationlate gadolinium enhancementIndustrial engineering. Management engineeringComputer Vision and Pattern Recognition (cs.CV)Electronic computers. Computer science[INFO.INFO-IM] Computer Science [cs]/Medical ImagingComputer Science - Computer Vision and Pattern Recognition[INFO.INFO-IM]Computer Science [cs]/Medical Imagingdeep learningQA75.5-76.95T55.4-60.8cardiac magnetic resonanceAlgorithms
researchProduct

Caracterización de la familia génica LGI

2010

158 pages.

Facultat de Biològiques576Biologia cel·lular i subcel·lular. Citologia
researchProduct

Efectos de la cocaína y del tolueno sobre la neurogénesis en el hipocampo de rata

2009

En el presente proyecto se estudió el efecto de dos drogas adictivas, el tolueno y la cocaína, sobre la neurogénesis hipocámpica. Los experimentos diseñados para ambas drogas, abordaron el estudio de la neurogénesis, a través de la medida de proliferación, supervivencia, diferenciación y migración. Además se analizó el efecto ultraestructural que ambas drogas causan sobre el giro dentado. De forma más exhaustiva, se estudió el efecto producido por una administración crónica del tolueno, durante el desarrollo del animal. Por último, se estudiaron los efectos de este tratamiento sobre la memoria y el aprendizaje. En los experimentos con cocaína, se estudió el efecto sobre la proliferación, su…

Facultat de BiològiquesBiologia cel·lular i subcel·lular. Citologia576
researchProduct

Fasciolosis crónica avanzada: análisis del desarrollo del parásito adulto y de la oviposición en el modelo experimental Wistar

2009

La patogénesis de la fasciolosis depende de la carga parasitaria y del tamaño de los trematodos adultos. En zonas de hiperendemia, las intensidades individuales de parasitación humana pueden alcanzar niveles muy altos, estando la mayoría de los individuos parasitados en la fase de cronicidad avanzada. En este estudio se ha utilizado el modelo experimental de fasciolosis en rata Wistar por ser un modelo animal útil que mimetiza la fasciolosis crónica avanzada en humanos. Se ha infectado un total de 169 ratas con 20 metacercarias/rata vía oral, llevándose a cabo los siguientes análisis: A) Estudio la influencia de la intensidad individual de infección por rata (entendiendo la intensidad de in…

Facultat de FarmaciaBiologia cel·lular i subcel·lular. Citologia576
researchProduct

Good Old-Fashioned Artificial Consciousness and the Intermediate Level Fallacy

2018

Recently, there has been considerable interest and effort to the possibility to design and implement conscious robots, i.e., the chance that a robot may have subjective experiences. However, typical approaches as the global workspace, information integration, enaction, cognitive mechanisms, embodiment, i.e., the Good Old-Fashioned Artificial Consciousness, henceforth, GOFAC, share the same conceptual framework. In this paper, we discuss GOFAC's basic tenets and their implication for AI and Robotics. In particular, we point out the intermediate level fallacy as the central issue affecting GOFAC. Finally, we outline a possible alternative conceptual framework towards robot consciousness.

Fallacyartificial consciousnessComputer sciencemedia_common.quotation_subjectlcsh:Mechanical engineering and machinerymachine consciousnessArtificial consciousness050105 experimental psychologylcsh:QA75.5-76.95Enactivism03 medical and health sciences0302 clinical medicineArtificial IntelligenceHypothesis and Theory0501 psychology and cognitive scienceslcsh:TJ1-1570media_commonrobot consciousness; machine consciousness; artificial consciousness; synthetic phenomenology; robot self-awarenessrobot consciousneartificial consciousneCognitive scienceSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniRobotics and AIIntegrated information theory05 social sciencesHard problem of consciousnessComputer Science Applicationsrobot self-awarenessConceptual frameworkRobotlcsh:Electronic computers. Computer scienceConsciousnessrobot consciousnesssynthetic phenomenologymachine consciousne030217 neurology & neurosurgeryFrontiers in Robotics and AI
researchProduct