Search results for " computing"
showing 10 items of 2075 documents
Marked systems and circular splicing
2007
Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. In this paper we introduce a special class of finite circular splicing systems named marked systems. We prove that a marked system S generates a regular circular language if and only if S satisfies a special (decidable) property. As a consequence, we show that we can decide whether a regular circular language is generated by a marked system and we characterize the structure of these regular circular languages.
A simple algorithm for generating neuronal dendritic trees
1990
Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Online Scheduling of Task Graphs on Heterogeneous Platforms
2020
Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous $4\sqrt{m/k}$ 4 m / k -competitive online algorithm by Amaris et al. [1] , where $m$ m is the number of CPUs and $k$ k the number of GPUs ( $m\geq k$ m ≥ k ). We prove that no online…
Theory of tailor automata
2019
Abstract In the paper, a fragment of the new theory of tailor automata is presented, within which a deterministic finite automaton was defined. The proposed automaton provides a theoretical model of an informally characterized biomolecular automaton. The idea of working of which is founded on the concept of alternating cut of some double-stranded fragments of DNA, with the use of a restriction enzyme and ligations of some double-stranded fragments of DNA, with the use of the ligase enzyme.
Ultrasonic Guided Waves-Based Monitoring of Rail Head: Laboratory and Field Tests
2010
Recent train accidents have reaffirmed the need for developing a rail defect detection system more effective than that currently used. One of the most promising techniques in rail inspection is the use of ultrasonic guided waves and noncontact probes. A rail inspection prototype based on these concepts and devoted to the automatic damage detection of defects in rail head is the focus of this paper. The prototype includes an algorithm based on wavelet transform and outlier analysis. The discrete wavelet transform is utilized to denoise ultrasonic signals and to generate a set of relevant damage sensitive data. These data are combined into a damage index vector fed to an unsupervised learning…
Real-Time Implementation of Signal Processing Techniques for Disturbances Detection
2019
The real-time analysis of power quality (PQ) disturbances and islanding detection for distributed generation (DG) system using signal processing algorithms are still at a premature stage. Quick and reliable detection of islanding and PQ disturbances needs renewed focus. This paper is concentrated on the implementation of advanced signal processing techniques in field-programmable gate array (FPGA) to identify PQ and islanding events in real time. The proposed scheme is based on orthogonal empirical mode decomposition (OEMD) implemented in FPGA. This technique does not suffer from the loss of signal characteristics with successive decomposition levels. The performance of said technique is de…
Performance analysis of optical imaging systems based on the fractional fourier transform
1998
Some image quality parameters, such as the Strehl ratio and the optical transfer function, are analysed in the generalized phase-space, or x-p domain, of the fractional Fourier transform associated with a modified one-dimensional pupil function. Some experimental results together with computer simulations are performed which illustrate the tolerance to defocus of different apertures.
Filtering of Spontaneous and Low Intensity Emotions in Educational Contexts
2015
Affect detection is a challenging problem, even more in educational contexts, where emotions are spontaneous and usually subtle. In this paper, we propose a two-stage detection approach based on an initial binary discretization followed by a specific emotion prediction stage. The binary classification method uses several distinct sources of information to detect and filter relevant time slots from an affective point of view. An accuracy close to 75% at detecting whether the learner has felt an educationally relevant emotion on 20 second time slots has been obtained. These slots can then be further analyzed by a second classifier, to determine the specific user emotion.
Semantics for Managing Systems in Heterogeneous and Distributed Environment
2002
The problem of legacy systems collaboration is being solved. Particularly we look at the collaboration as workflow in a distributed and heterogeneous environment. Attention is paid to the description of semantics for workflow process definition languages. There are many solutions how semantics can be decomposed into logical fragments, but the problem of obtaining reusable components that are easy to compile into desired specific semantics still remains. We evolve the division of semantics by semantic aspects whose description is based on abstract data types (pre-built components) and connectors (meta-programs to produce the glue code) between them. This paper offers a way in which semantic …