Search results for "Abstract"
showing 10 items of 1959 documents
A Formal Model for Developing of the self-Diagosing and Self-Repairing 8-Bits Microprocessor, and Its Investigation Using Simulation
1986
Abstract The complete model of functional diagnostics is theoretically described. It specifies the conditions, which must be satisfied if the system to be self-diagnosable. The general principles of constructing self-diagnosable systems are enumerated. The model enables the realization of self-renewal, too. The model has been developed on the basis of the works by Preparata, Metze, Chien (1967) and Hakimi, Amin (1974) . The model contains a method of diagnostics completely separeted from the physical structure of the system. Recent results (Gruber, 1978; Swiatek, 1982) indicate that it is only necessary to know the set of transformations realized by the circuit. The model has been applied t…
Process specification and verification
1996
Graph grammars provide a very convenient specification tool for distributed systems of processes. This paper addresses the problem how properties of such specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.
Discrete-time static output-feedback semi-decentralized H<inf>&#x221E;</inf> controller design: An application to structural vibratio…
2012
In this work, we present a new and effective method to design discrete-time static output-feedback H ∞ controllers. This new method, based on a Linear Matrix Inequality (LMI) formulation, introduces a suitable transformation of the LMI variables that allows to obtain an explicit expression for the output-feedback gain matrix. Moreover, for problems involving a set of subsystems with information exchange constraints, a convenient structure on the LMI variables can be imposed in order to design semi-decentralized controllers, where the corresponding output-feedback gain matrix has a prescribed zero-nonzero structure. To illustrate the proposed methodology, discrete-time static velocity-feedba…
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
2008
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch bounds with equality is given and applied for the case of MUBs. This yields a necessary and sufficient condition on a set of orthonormal bases to form a complete system of MUBs. This condition takes an especially elegant form in the case of homogeneous systems of MUBs. We express some known constructions of MUBs in this form. Also it is shown how recently obtained results binding MUBs and some combinatorial structures (such as perfect nonlinear functions an…
Graph recursive least squares filter for topology inference in causal data processes
2017
In this paper, we introduce the concept of recursive least squares graph filters for online topology inference in data networks that are modelled as Causal Graph Processes (CGP). A Causal Graph Process (CGP) is an auto regressive process in the time series associated to different variables, and whose coefficients are the so-called graph filters, which are matrix polynomials with different orders of the graph adjacency matrix. Given the time series of data at different variables, the goal is to estimate these graph filters, hence the associated underlying adjacency matrix. Previously proposed algorithms have focused on a batch approach, assuming implicitly stationarity of the CGP. We propose…
Simple guidelines to predict self-phase modulation patterns
2018
International audience; We present a simple approach to predict the main features of optical spectra affected by self-phase modulation (SPM), which is based on regarding the spectrum modification as an interference effect. A two-wave interference model is found sufficient to describe the SPM-broadened spectra of initially transform-limited or up-chirped pulses, whereas a third wave should be included in the model for initially down-chirped pulses. Simple analytical formulae are derived, which accurately predict the positions of the outermost peaks of the spectra.
Scientific abstracts and plain language summaries in psychology: A comparison based on readability indices.
2020
Findings from psychological research are usually difficult to interpret for non-experts. Yet, non-experts resort to psychological findings to inform their decisions (e.g., whether to seek a psychotherapeutic treatment or not). Thus, the communication of psychological research to non-expert audiences has received increasing attention over the last years. Plain language summaries (PLS) are abstracts of peer-reviewed journal articles that aim to explain the rationale, methods, findings, and interpretation of a scientific study to non-expert audiences using non-technical language. Unlike media articles or other forms of accessible research summaries, PLS are usually written by the authors of th…
Analysis of neuronal networks in the visual system of the cat using statistical signals--simple and complex cells. Part II.
1978
Superimposing additively a two-dimensional noise process to deterministic input signals (bars) the neurons of area 17 show a class-specific reaction for the task of signal extraction. Moving both parts of the signals simultaneously and varying the signal to noise ratio (S/N) the simple cells achieve the same performance as resulted from the psychophysical experiment. Type I complex cells extract moving deterministic signals (i.e. bars) from the stationary noise, whereas in the answers of Type II complex cells the statistical parts of the signals predominate. Considering the different cell types each as a series of a linear and a nonlinear system one obtains the cell specific space-time freq…
A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems
2021
The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…
Mappings of Finite Distortion : Compactness of the Branch Set
2017
We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire, continuous, open and discrete mapping of finite distortion which is piecewise smooth, has a branch set homeomorphic to an (n - 2)-dimensional torus and distortion arbitrarily close to the asymptotic bound. Peer reviewed