Search results for "checking"
showing 10 items of 53 documents
Selftype is a special case
1991
It is pointed out that selftype is actually only a special case of a construct that has been well described in the literature.
¿Qué papel juegan la evitación del daño y la sensación de inacabado en los síntomas obsesivos de orden y comprobación?
2020
Numerosas investigaciones han intentado determinar las variables implicadas en la génesis y mantenimiento del Trastorno Obsesivo-Compulsivo (TOC). Recientemente, se han propuesto la evitación del daño y la sensación de inacabado como dos dimensiones nucleares motivadoras de la sintomatología obsesivo-compulsiva. El objetivo de este estudio fue analizar el papel de la evitación del daño y la sensación de inacabado en su relación con los síntomas obsesivo-compulsivos. Para ello, se realizó un Path analysis en una muestra de 267 personas de la población general (74,5% mujeres; edad media 27,29 años). Los resultados mostraron que la asociación entre evitación del daño y los síntomas de orden y …
Citizen journalism and social innovation. Digital platforms for qualitative implementation of participatory journalism
2022
The power of the media, internet, social networks and sharing platforms system, together with the pervasiveness of digital tools in everyone’s life, have made communication an ever more articulated, and increasingly complex field. In addition to accelerating the dissemination of content and information, these tools have opened the door to extensive participatory information processes. The article takes some emblematic case studies of participatory journalism platforms that can make a valuable contribution to setting in motion co-design processes in the news world. Within this framework, an attempt will be made to frame a scenario in which design can find its own place in a planning space ye…
Coherence Checking and Propagation of Lower Probability Bounds
2003
In this paper we use imprecise probabilities, based on a concept of generalized coherence (g-coherence), for the management of uncertain knowledge and vague information. We face the problem of reducing the computational difficulties in g-coherence checking and propagation of lower conditional probability bounds. We examine a procedure, based on linear systems with a reduced number of unknowns, for the checking of g-coherence. We propose an iterative algorithm to determine the reduced linear systems. Based on the same ideas, we give an algorithm for the propagation of lower probability bounds. We also give some theoretical results that allow, by suitably modifying our algorithms, the g-coher…
Generalized coherence and connection property of imprecise conditional previsions.
2008
In this paper we consider imprecise conditional prevision assessments on random quantities with finite set of possible values. We use a notion of generalized coherence which is based on the coherence principle of de Finetti. We consider the checking of g-coherence, by extending some previous results obtained for imprecise conditional probability assessments. Then, we study a connection property of interval-valued gcoherent prevision assessments, by extending a result given in a previous paper for precise assessments.
Rejoinder: Bayesian Checking of the Second Levels of Hierarchical Models
2008
Rejoinder: Bayesian Checking of the Second Levels of Hierarchical Models [arXiv:0802.0743]
PValues for Composite Null Models
2000
Abstract The problem of investigating compatibility of an assumed model with the data is investigated in the situation when the assumed model has unknown parameters. The most frequently used measures of compatibility are p values, based on statistics T for which large values are deemed to indicate incompatibility of the data and the model. When the null model has unknown parameters, p values are not uniquely defined. The proposals for computing a p value in such a situation include the plug-in and similar p values on the frequentist side, and the predictive and posterior predictive p values on the Bayesian side. We propose two alternatives, the conditional predictive p value and the partial…
SCALESEM : Evaluation of Semantic Graph based on Model Checking
2011
International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modelling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns …
RDF2SPIN: Mapping Semantic Graphs to SPIN Model Checker
2011
International audience; The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2SPIN, which converts RDF graphs into SPIN language. This conversion aims checking the semantic graphs with the model checker SPIN in order to verify the consistency of the data. To illustrate our propos…
Extending SPARQL with Temporal Logic
2009
The data integration and sharing activities carried on in the framework of the Semantic Web lead to large knowledge bases that must be queried, analyzed, and exploited efficiently. Many of the knowledge representation languages of the Semantic Web, starting with RDF, are based on directed, labeled graphs, which can be also manipulated using graph algorithms and tools coming from other domains. In this paper, we propose an analysis approach of RDF graphs by reusing the verification technology developed for concurrent systems. To this purpose, we define a translation from the SPARQL query language into XTL, a general-purpose graph manipulation language implemented in the CADP verification too…