Search results for "COMPLETENESS"
showing 10 items of 66 documents
Common Fixed Points in a Partially Ordered Partial Metric Space
2013
In the first part of this paper, we prove some generalized versions of the result of Matthews in (Matthews, 1994) using different types of conditions in partially ordered partial metric spaces for dominated self-mappings or in partial metric spaces for self-mappings. In the second part, using our results, we deduce a characterization of partial metric 0-completeness in terms of fixed point theory. This result extends the Subrahmanyam characterization of metric completeness.
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
2012
AbstractThe advent of high throughput technologies, in particular microarrays, for biological research has revived interest in clustering, resulting in a plethora of new clustering algorithms. However, model selection, i.e., the identification of the correct number of clusters in a dataset, has received relatively little attention. Indeed, although central for statistics, its difficulty is also well known. Fortunately, a few novel techniques for model selection, representing a sharp departure from previous ones in statistics, have been proposed and gained prominence for microarray data analysis. Among those, the stability-based methods are the most robust and best performing in terms of pre…
What is Mathematics: Gödel's Theorem and Around (Edition 2015)
2015
Hyper-textbook for students in mathematical logic and foundations of mathematics. Edition 2015.
Exploring the generative power of performance measurement systems design
2019
Abstract Prior studies recognise the enabling power of incompleteness in the design of Performance Measurement Systems (PMS). We add to these studies by exploring the ‘time dimension’ of incompleteness as a way to delve into the generative power of design. To this aim, we rely upon the experience of a knowledge-intensive organization during the design of a new PMS. While knowledge complexity engaged the participants within an open-ended design process, incomplete measures were associated with unfolding memories of the past and confident beliefs in future solutions, which generated effects through the knowledge gaps that they entailed, as well as through the projections in the past and in th…
Accelerated observers and the notion of singular spacetime
2017
Geodesic completeness is typically regarded as a basic criterion to determine whether a given spacetime is regular or singular. However, the principle of general covariance does not privilege any family of observers over the others and, therefore, observers with arbitrary motions should be able to provide a complete physical description of the world. This suggests that in a regular spacetime, all physically acceptable observers should have complete paths. In this work we explore this idea by studying the motion of accelerated observers in spherically symmetric spacetimes and illustrate it by considering two geodesically complete black hole spacetimes recently described in the literature. We…
Learning with belief levels
2008
AbstractWe study learning of predicate logics formulas from “elementary facts,” i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is “practically” complete. Theorems presented in the paper in some sense confirm our hypothesis.
Heuristic Method to Improve Systematic Collection of Terminology
2016
In this paper, we propose an experimental tool for analysis and graphical representation of glossaries. The original heuristic algorithms and analysis methods incorporated into the tool appeared to be useful to improve the quality of the glossaries. The tool was used for analysis of ISTQB Standard Glossary of Terms Used in Software Testing. There are instances of problems found in ISTQB glossary related to its consistency, completeness, and correctness described in the paper.
Consistency Analysis of Genome-Scale Models of Bacterial Metabolism: A Metamodel Approach.
2015
Genome-scale metabolic models usually contain inconsistencies that manifest as blocked reactions and gap metabolites. With the purpose to detect recurrent inconsistencies in metabolic models, a large-scale analysis was performed using a previously published dataset of 130 genome-scale models. The results showed that a large number of reactions (~22%) are blocked in all the models where they are present. To unravel the nature of such inconsistencies a metamodel was construed by joining the 130 models in a single network. This metamodel was manually curated using the unconnected modules approach, and then, it was used as a reference network to perform a gap-filling on each individual genome-s…
Basis-set completeness profiles in two dimensions
2002
A two-electron basis-set completeness profile is proposed by analogy with the one-electron profile introduced by D. P. Chong (Can J Chem 1995, 73, 79). It is defined as Y(alpha, beta) = sigmam sigman (Galpha(1)Gbeta(2)/(1/r12)/ psim(1)psin(2)) (psim(1)psin(2)/r12/Galpha(1)Gp(2)) and motivated by the expression for the basis-set truncation correction that occurs in the framework of explicitly correlated methods (Galpha is a scanning Gaussian-type orbital of exponent alpha and [psim] is the orthonormalized one-electron basis under study). The two-electron basis-set profiles provide a visual assessment of the suitability of basis sets to describe electron-correlation effects. Furthermore, they…
Quantum Real - Time Turing Machine
2001
The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.