Search results for "Completeness"
showing 10 items of 66 documents
Protoalgebraicity and the Deduction Theorem
2001
This chapter is intended as an introduction to the Deduction Theorem and to applications of this theorem in metalogic.
Scattering resonances and Pseudospectrum : stability and completeness aspects in optical and gravitational systems
2022
The general context of this thesis is an effort to establish a bridge between gravitational andoptical physics, specifically in the context of scattering problems using as a guideline concepts andtools taken from the theory of non-self-adjoint operators. Our focus is on Quasi-Normal Modes(QNMs), namely the natural resonant modes of open leaky structures under linear perturbationssubject to outgoing boundary conditions. They also are referred to as scattering resonances.In the conservative self-adjoint case the spectral theorem guarantees the completeness andspectral stability of the associated normal modes. In this sense, a natural question in the non-self-adjoint setting refers to the char…
Quantum counter-propagation in open optical cavities via the quasi-normal-mode approach
2006
By using the quasi-normal-mode (QNM) formalism in a second quantization scheme, the problem of the counter-propagation of electromagnetic fields inside optical cavities is studied. The links between QNM operators and canonical destruction and creation operators describing the external free field, as well as the field correlation functions, are found and discussed. An application of the theory is performed for open cavities whose refractive index satisfies symmetric properties.
On the intrinsic complexity of learning
1995
A new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion captured by our new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks.
Deontology of Compound Actions
2018
This paper, being a companion to the book [2] elaborates the deontology of sequential and compound actions based on relational models and formal constructs borrowed from formal linguistics. The semantic constructions presented in this paper emulate to some extent the content of [3] but are more involved. Although the present work should be regarded as a sequel of [3] it is self-contained and may be read independently. The issue of permission and obligation of actions is presented in the form of a logical system . This system is semantically defined by providing its intended models in which the role of actions of various types (atomic, sequential and compound ones) is accentuated. Since the…
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…
Phenomenological-Semantic Investigations into Incompleteness
2000
When today the phenomenologist surveys the history of the philosophical comprehension of Godel’s theorems, he is confronted with the realization that the decisive publications come almost exclusively from the sphere of analytic philosophy.1 But does phenomenology in the spirit of Husserl not mean to keep in step with the epochal results of the special sciences by working on the phenomenological understanding of them? Phenomenological research of this kind means the same as development of phenomenological theory of science (Wissenschaftstheorie). In connection with the incompleteness theorems, the latter would be confronted with fundamental questions such as, “To what extent can mathematical…
Estimating completeness in cancer registries--comparing capture-recapture methods in a simulation study.
2008
Completeness of registration is one of the quality indicators usually reported by cancer registries. This allows researchers to assess how useful and representative the data is. Several methods have been suggested to estimate completeness. In this paper a multi-state model for the process of cancer diagnosis and treatment is presented. In principle, every contact with a doctor during diagnosis, treatment, and aftercare can give rise to a cancer registry notification with a certain probability. Therefore the states included in the model are "incident tumour" and "death" but also contacts with doctors such as consultation of a general practitioner or specialised doctor, diagnostic procedures,…
The Power of Word-Frequency Based Alignment-Free Functions: a Comprehensive Large-Scale Experimental Analysis
2021
Abstract Motivation Alignment-free (AF) distance/similarity functions are a key tool for sequence analysis. Experimental studies on real datasets abound and, to some extent, there are also studies regarding their control of false positive rate (Type I error). However, assessment of their power, i.e. their ability to identify true similarity, has been limited to some members of the D2 family. The corresponding experimental studies have concentrated on short sequences, a scenario no longer adequate for current applications, where sequence lengths may vary considerably. Such a State of the Art is methodologically problematic, since information regarding a key feature such as power is either mi…
Ultrametric Finite Automata and Turing Machines
2013
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.