arXiv subjects

Thomas Schneider

Publications and source records attributed to Thomas Schneider.

54 records · Page 3Linked to original sources

arXiv2017

Is the Rayleigh-Sommerfeld diffraction always an exact reference for high speed diffraction algorithms?

In several areas of optics and photonics like wave propagation, digital holography, holographic microscopy, diffraction imaging, biomedical imaging and diffractive optics, the behavior of the electromagnetic waves has to be calculated with the scalar theory of diffraction by computational methods. Many of these high speed diffraction algorithms based on a fast Fourier transformation are in principle approximations of the Rayleigh-Sommerfeld Diffraction (RSD) theory. However, to investigate their numerical accuracy, they should be compared with and verified by RSD. All numerical simulations are in principle based on a sampling of the analogue continuous field. In this article we demonstrate a novel validity condition for the well-sampling in RSD, which makes a systematic treatment of sampling in RSD possible. We show the fundamental restrictions due to this condition and the anomalies caused by its violation. We also demonstrate that the restrictions are completely removed by a sampling below the Abbe resolution limit. Furthermore, we present a very general unified approach for applying the RSD outside its validity domain by the combination of a forward and reverse calculation.

physics.optics↗

arXiv2017

Visual-inertial self-calibration on informative motion segments

Environmental conditions and external effects, such as shocks, have a significant impact on the calibration parameters of visual-inertial sensor systems. Thus long-term operation of these systems cannot fully rely on factory calibration. Since the observability of certain parameters is highly dependent on the motion of the device, using short data segments at device initialization may yield poor results. When such systems are additionally subject to energy constraints, it is also infeasible to use full-batch approaches on a big dataset and careful selection of the data is of high importance. In this paper, we present a novel approach for resource efficient self-calibration of visual-inertial sensor systems. This is achieved by casting the calibration as a segment-based optimization problem that can be run on a small subset of informative segments. Consequently, the computational burden is limited as only a predefined number of segments is used. We also propose an efficient information-theoretic selection to identify such informative motion segments. In evaluations on a challenging dataset, we show our approach to significantly outperform state-of-the-art in terms of computational burden while maintaining a comparable accuracy.

cs.RO↗

arXiv2017

Transparent Microwave Photonic Filter Based on Brillouin Losses in Optical Fiber

In this paper, we propose a low-noise, bandwidth tunable microwave photonics filter (MPF) based on stimulated Brillouin scattering (SBS) losses. By suppressing the out-of-band signal with two broadened symmetric SBS losses, pass bandwidth can be tuned from 500 MHz to 10 GHz. Considering the limited interaction in the center frequency range, a flat-top response with 0.3 dB ripple is easily achieved. Unlike a SBS gain based filter, due to the transparency of the pass band in our proposed filter, hardly no noise is detected in a noise measurement against an obvious maximum 5 dB noise pedestal for a SBS gain based one. Considering the wide independent bandwidth and center frequency tunability, flat-top response, and low-noise characteristic, our proposed filter can be perfectly used as a supplement of most commericalized tunable single bandpass filters, whose minimum bandwidth is limited by 10 GHz.

physics.app-ph↗

arXiv2017

Conservative Extensions in Guarded and Two-Variable Fragments

We investigate the decidability and computational complexity of (deductive) conservative extensions in fragments of first-order logic (FO), with a focus on the two-variable fragment FO$^2$ and the guarded fragment GF. We prove that conservative extensions are undecidable in any FO fragment that contains FO$^2$ or GF (even the three-variable fragment thereof), and that they are decidable and 2\ExpTime-complete in the intersection GF$^2$ of FO$^2$ and GF.

cs.LO↗

arXiv2016

A Survey of Qualitative Spatial and Temporal Calculi -- Algebraic and Computational Properties

Qualitative Spatial and Temporal Reasoning (QSTR) is concerned with symbolic knowledge representation, typically over infinite domains. The motivations for employing QSTR techniques range from exploiting computational properties that allow efficient reasoning to capture human cognitive concepts in a computational framework. The notion of a qualitative calculus is one of the most prominent QSTR formalisms. This article presents the first overview of all qualitative calculi developed to date and their computational properties, together with generalized definitions of the fundamental concepts and methods, which now encompass all existing calculi. Moreover, we provide a classification of calculi according to their algebraic properties.

cs.AI↗

arXiv2016

Frequency-time coherence for all-optical sampling without optical pulse source

Sampling is the first step to convert an analogue optical signal into a digital electrical signal. The latter can be further processed and analysed by well-known electrical signal processing methods. Optical pulse sources like mode-locked lasers are commonly incorporated for all-optical sampling, but have several drawbacks. A novel approach for a simple all-optical sampling is to utilise the frequency-time coherence of each signal. The method is based on only using two coupled modulators driven with an electrical sine wave, allowing simple integration in appropriate platforms, such as Silicon Photonics. The presented method grants all-optical sampling with electrically tunable bandwidth, repetition rate and time shift.

physics.optics↗

arXiv2014

A method to retrieve optical and geometrical characteristics of three layer waveguides from m-lines measurements

We consider three layer optical waveguides and present a method to measure simultaneously the refractive index and the thickness of each layer with m-lines spectroscopy. We establish the three layer waveguide modal dispersion equations and describe a numerical method to solve these equations. The accuracy of the method is evaluated by numerical simulations with noisy data and experimentally demonstrated using a PZT thin film placed between two ZnO layers.

cond-mat.mtrl-sci↗

arXiv2014

Optical characterization of PZT thin films for waveguide applications

In order to develop an electro-optic waveguide, Pb(Zr, Ti)O3 ceramic ferroelectric thin films were elaborated by a modified sol-gel process on glass substrate. In the aim to study the optical properties of the PZT films, an accurate refractive index and thickness measurement apparatus was set up, which is called M-lines device. An evaluation of experimental uncertainty and calculation of the precision of the refractive index and thickness were developed on PZT layers. Two different processes of PZT elaboration were made and studied with this apparatus. The reproducibility of one fabrication process was tested and results are presented in this paper.

cond-mat.mtrl-sci↗

arXiv2013

Algebraic Properties of Qualitative Spatio-Temporal Calculi

Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent do the qualitative calculi proposed meet these demands? The literature provides various answers to the first question but only few facts about the second. In this paper we identify the minimal requirements to binary spatio-temporal calculi and we discuss the relevance of the according axioms for representation and reasoning. We also analyze existing qualitative calculi and provide a classification involving different notions of a relation algebra.

cs.AI↗

arXiv2012

Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation?

Extracting a subset of a given OWL ontology that captures all the ontology's knowledge about a specified set of terms is a well-understood task. This task can be based, for instance, on locality-based modules (LBMs). These come in two flavours, syntactic and semantic, and a syntactic LBM is known to contain the corresponding semantic LBM. For syntactic LBMs, polynomial extraction algorithms are known, implemented in the OWL API, and being used. In contrast, extracting semantic LBMs involves reasoning, which is intractable for OWL 2 DL, and these algorithms had not been implemented yet for expressive ontology languages. We present the first implementation of semantic LBMs and report on experiments that compare them with syntactic LBMs extracted from real-life ontologies. Our study reveals whether semantic LBMs are worth the additional extraction effort, compared with syntactic LBMs.

cs.AI↗

arXiv2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of non-elementary complexity. In this paper, we consider monotone hybrid logics (i.e., the Boolean connectives are conjunction and disjunction only) over N and general linear orders. We show that the satisfiability problem remains non-elementary over linear orders, but its complexity drops to PSPACE-completeness over N. We categorize the strict fragments arising from different combinations of modal and hybrid operators into NP-complete and tractable (i.e. complete for NC1or LOGSPACE). Interestingly, NP-completeness depends only on the fragment and not on the frame. For the cases above NP, satisfiability over linear orders is harder than over N, while below NP it is at most as hard. In addition we examine model-theoretic properties of the fragments in question.

cs.CC↗

arXiv2011

Model Checking CTL is Almost Always Inherently Sequential

The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is already P-complete. Hence our results indicate that, in cases where the combined complexity is of relevance, approaching CTL model checking by parallelism cannot be expected to result in any significant speedup. We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+.

cs.LO↗

arXiv2011

Generalized Satisfiability for the Description Logic ALC

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families, have an easier satisfiability problem; sometimes it is even tractable. We classify the complexity of the standard satisfiability problems for all possible Boolean and quantifier fragments of ALC in the presence of general axioms.

cs.LO↗

arXiv2010

The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite family, have an easier satisfiability problem; sometimes it is even tractable. All these fragments restrict the use of Boolean operators in one way or another. We look at systematic and more general restrictions of the Boolean operators and establish the complexity of the concept satisfiability problem in the presence of axioms. We separate tractable from intractable cases.

cs.LO↗

arXiv2009

The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I

The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments including negation. For the monotone fragments, we are able to distinguish the easy from the hard cases, depending on the allowed set of operators.

cs.LO↗

arXiv2009

The Complexity of Generalized Satisfiability for Linear Temporal Logic

In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of propositional and temporal operators. Since every propositional operator corresponds to a Boolean function, there exist infinitely many propositional operators. In order to systematically cover all possible sets of them, we use Post's lattice. With its help, we determine the computational complexity of LTL satisfiability for all combinations of temporal operators and all but two classes of propositional functions. Each of these infinitely many problems is shown to be either PSPACE-complete, NP-complete, or in P.

cs.LO↗

arXiv2008

Complexity of Hybrid Logics over Transitive Frames

This paper examines the complexity of hybrid logics over transitive frames, transitive trees, and linear frames. We show that satisfiability over transitive frames for the hybrid language extended with the downarrow operator is NEXPTIME-complete. This is in contrast to undecidability of satisfiability over arbitrary frames for this language (Areces, Blackburn, Marx 1999). It is also shown that adding the @ operator or the past modality leads to undecidability over transitive frames. This is again in contrast to the case of transitive trees and linear frames, where we show these languages to be nonelementarily decidable. Moreover, we establish 2EXPTIME and EXPTIME upper bounds for satisfiability over transitive frames and transitive trees, respectively, for the hybrid Until/Since language. An EXPTIME lower bound is shown to hold for the modal Until language over both frame classes.

cs.LO↗

arXiv2008

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments

In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper systematically studies the model-checking problem for LTL formulae over restricted sets of propositional and temporal operators. For almost all combinations of temporal and propositional operators, we determine whether the model-checking problem is tractable (in P) or intractable (NP-hard). We then focus on the tractable cases, showing that they all are NL-complete or even logspace solvable. This leads to a surprising gap in complexity between tractable and intractable cases. It is worth noting that our analysis covers an infinite set of problems, since there are infinitely many sets of propositional operators.

cs.LO↗