Search results for "LIST"

showing 10 items of 4869 documents

Minimal nontrivial space complexity of probabilistic one- way turing machines

2005

Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an open problem in [4].

Discrete mathematicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESSuper-recursive algorithmProbabilistic Turing machineLinear speedup theoremNSPACEDescription numberCombinatoricsTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESNon-deterministic Turing machinesymbolsTime hierarchy theoremComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Transitive Reasoning with Imprecise Probabilities

2015

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent \(\text{ p-consistent }\) sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.

Discrete mathematicsTransitive relationSettore MAT/06 - Probabilita' E Statistica MatematicaSettore INF/01 - Informaticabusiness.industryProbabilistic logicSyllogismInferenceCoherence (philosophical gambling strategy)Settore M-FIL/02 - Logica E Filosofia Della ScienzaComputer Science::Artificial IntelligenceImprecise probabilityCoherence default imprecise probability knowledge base p-consistency p-entailment reasoning syllogism weak transitivityProbability propagationKnowledge basebusinessMathematics
researchProduct

Common fixed point theorems for mappings satisfying common property (E.A.) in symmetric spaces

2011

In this paper, common fixed point theorems for mappings satisfying a generalized contractive condition are obtained in symmetric spaces by using the notion of common property (E.A.). In the process, a host of previously known results are improved and generalized. We also derive results on common fixed point in probabilistic symmetric spaces.

Discrete mathematicsTriple systemSettore MAT/05 - Analisi MatematicaGeneral MathematicsSymmetric spaceProbabilistic logicCommon fixed pointSymmetric space common property (E.A.) common fixed point.Common propertyPoint (geometry)Mathematics
researchProduct

Probabilistic Interpretations of Predicates

2016

In classical logic, any m-ary predicate is interpreted as an m-argument two-valued relation defined on a non-empty universe. In probability theory, m-ary predicates are interpreted as probability measures on the mth power of a probability space. m-ary probabilistic predicates are equivalently semantically characterized as m-dimensional cumulative distribution functions defined on \(\mathbb {R}^m\). The paper is mainly concerned with probabilistic interpretations of unary predicates in the algebra of cumulative distribution functions defined on \(\mathbb {R}\). This algebra, enriched with two constants, forms a bounded De Morgan algebra. Two logical systems based on the algebra of cumulative…

Discrete mathematicsUnary operationComputer Science::Logic in Computer ScienceCumulative distribution functionClassical logicProbabilistic logicRandom variableŁukasiewicz logicDe Morgan algebraMathematicsProbability measure
researchProduct

Uncountable Realtime Probabilistic Classes

2018

We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.

Discrete mathematicsUnary operationComputer scienceProbabilistic logic020206 networking & telecommunicationsComputerApplications_COMPUTERSINOTHERSYSTEMS0102 computer and information sciences02 engineering and technology01 natural sciencesLogarithmic spaceBounded error010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)020201 artificial intelligence & image processingUncountable setBinary caseInternational Journal of Foundations of Computer Science
researchProduct

Common fixed point theorems for families of occasionally weakly compatible mappings

2011

We prove some common fixed point theorems in probabilistic semi-metric spaces for families of occasionally weakly compatible mappings. We also give a common fixed point theorem for mappings satisfying an integral-type implicit relation.

Discrete mathematicsWeakly compatibleRelation (database)010102 general mathematicsProbabilistic logicOccasionally weakly compatible mappingProbabilistic metric spaceCommon fixed point01 natural sciencesProbabilistic metric spaceComputer Science Applications010101 applied mathematicsLeast fixed pointSettore MAT/05 - Analisi MatematicaModelling and SimulationModeling and SimulationCommon fixed point0101 mathematicsCoincidence pointCommon fixed point theoremMathematicsMathematical and Computer Modelling
researchProduct

El discurso totalitario del partido político España 2000

2016

Este artículo analiza los elementos principales del discurso del partido político español, España 2000, concebida como una formación adscrita a la corriente de «derecha radical populista». Para ello, se emplea la metodología de análisis de contenido y se aplica el modelo de «Totalismo Ideológico» propuesto por Robert Jay Lifton, que describe los elementos que caracterizan a las ideologías radicales. Como fuentes de información se utilizan las declaraciones de los líderes de la formación durante un conflicto sucedido en la ciudad de Valencia (España). La investigación muestra las particularidades totalitarias del discurso de la formación española y sus principales ejes ideológicos, que al ig…

DiscursoRadical populist rightmedia_common.quotation_subjectImmigrationMedia studiesPartido políticoInmigraciónDerecha radical populistaImmigrationGeneral MedicineArtIdeological totalismPoliticsTotalismo ideológicoContent analysisNational identityPolitical partySpeechPerformance artIdeologyIdeologíaCartographyIdeologymedia_common
researchProduct

Biochemical markers in Celiac disease.

2009

Celiac Disease is a worldwide spread condition affecting 1:100-1:200 individuals. It is a permanent food intolerance to ingested gluten in genetically predisposed subjects. In this review we analyze the biochemical markers of the disease going from laboratory findings to histology passing through genetics. Gluten intolerance is a unique model of autoimmune disease in which we can recognize the main environmental factor (gluten) and the more complex genetic background. In additional way, serological markers for monitoring the disease and a safe and effective therapy (gluten free diet) are also available. In deed the environmental factor such as gluten intake is necessary to trigger the disea…

DiseaseHuman leukocyte antigenGeneral Biochemistry Genetics and Molecular BiologyPathogenesisSettore MED/38 - Pediatria Generale E SpecialisticaGluten free dietmedicineHumanschemistry.chemical_classificationAutoimmune diseaseGeneral Immunology and Microbiologybusiness.industrynutritional and metabolic diseasesGluten intoleranceEpithelial Cellsmedicine.diseaseGlutendigestive system diseasesLymphocyte SubsetsFood intoleranceCeliac DiseaseSerologychemistryImmunologyGluten freebusinessBiomarkersFrontiers in bioscience (Scholar edition)
researchProduct

Stalinismi musiikissa : narodnost-käsite Neuvostoliiton musiikkipolitiikan diskursseissa 1930-luvulla

2016

Tässä maisterintutkielmassa tarkasteltiin yhden sosialistisen realismin alakäsitteen, narodnostin, merkitystä ja asemaa Neuvostoliiton musiikkipolitiikassa 1930-luvulla. Narodnost-käsitteen merkitystä selvitettiin suhteessa 1930-luvun Neuvostoliiton laajempiin poliittisiin diskursseihin, mikä toi esille Neuvostoliiton virallisen taidesuuntauksen muotoutumisen yhteyden tuon ajan historialliseen ja poliittiseen kontekstiin. Käsitteen määrittelyssä hyödynnettiin kahta historian ja kielen suhdetta tarkastelevaa teoreettista viitekehystä, diskurssintutkimusta ja käsitehistoriaa. Näiden teorioiden pohjalta luotiin lähestymistapa, jossa käsitteiden nähdään muodostuvan diskursseista. Näin ollen käs…

Diskurssintutkimus1930-lukusosialistinen realismikäsitehistoriamusiikkistalinismimusiikkipolitiikkanarodnost
researchProduct

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms

2013

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

Distance-vector routing protocolLink-state routing protocolComputer scienceAnt colony optimization algorithmsComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSMultipath routingComputer Science::Networking and Internet ArchitectureProbabilistic logicPath vector protocolProbabilistic analysis of algorithmsRouting (electronic design automation)Algorithm
researchProduct