Arterial oxyhemoglobin saturation (SpO/sub 2/) values are currently computed using weighted moving average techniques. Digital signal processing algorithms were explored to identify improved algorithms for SpO/sub 2/ ...
详细信息
Arterial oxyhemoglobin saturation (SpO/sub 2/) values are currently computed using weighted moving average techniques. Digital signal processing algorithms were explored to identify improved algorithms for SpO/sub 2/ computation. the fast Fourier transform and discrete cosine transform were identified as potentially superior algorithms. Improvements to the original algorithm using combinations of overlapped processing and averaging techniques were also explored.< >
We introduce the notion of Morton-style factorial coding and illustrate how it may help understand information integration and perceptual coding in the brain. We show that by focusing on average responses one may miss...
详细信息
ISBN:
(纸本)0262025507
We introduce the notion of Morton-style factorial coding and illustrate how it may help understand information integration and perceptual coding in the brain. We show that by focusing on average responses one may miss the existence of factorial coding mechanisms that become only apparent when analyzing spike count histograms. We show evidence suggesting that the classical/non-classical receptive field organization in the cortex effectively enforces the development of Morton-style factorial codes. this may provide some cues to help understand perceptual coding in the brain and to develop new unsupervised learning algorithms. While methods like ICA (Bell & Sejnowski, 1997) develop independent codes, in Morton-style coding the goal is to make two or more external aspects of the world become independent when conditioning on internal representations.
the systolic array is an array of processing units which share the inner data flow. Since the 2D systolic array fits the operation of multiplication and accumulation (MAC) naturally, there are many groups which use th...
详细信息
three evolutionary algorithms, the immune genetic algorithm (IGA), the immune evolutionary programming (IEP) and the immune evolutionary strategy (IES), are presented based on the immune theory in biology, which are n...
详细信息
three evolutionary algorithms, the immune genetic algorithm (IGA), the immune evolutionary programming (IEP) and the immune evolutionary strategy (IES), are presented based on the immune theory in biology, which are not only convergent but used for solving complex discrete optimization problems as well. they all construct an immune operator accomplished by two components, vaccination and immune selection. the methods for selecting vaccines and constructing an immune operator are also proposed. Simulations show that these algorithms can restrain the degenerate phenomenon and improve the searching capability of the existing algorithms, therefore increase the convergent speed greatly.
Ranklets are orientation selective rank features with applications to tracking, face detection, texture and medical imaging. We introduce efficient algorithmsthat reduce their computational complexity from O(N log N)...
详细信息
Ranklets are orientation selective rank features with applications to tracking, face detection, texture and medical imaging. We introduce efficient algorithmsthat reduce their computational complexity from O(N log N) to O(¿N + k), where N is the area of the filter. Timing tests show a speedup of one order of magnitude for typical usage, which should make Ranklets attractive for real-time applications.
Structured rank-deficient matrices arise in many applications in signal processing. the inverse iteration algorithm was proposed to solve the so-called structured total least squares (STLS) problems. this algorithm, h...
详细信息
Structured rank-deficient matrices arise in many applications in signal processing. the inverse iteration algorithm was proposed to solve the so-called structured total least squares (STLS) problems. this algorithm, however, converges to local-minimum under certain conditions. It is well known that genetic algorithms are stochastic optimization techniques that can often outperform classical methods of optimization. Genetic algorithms was utilized here to get the better solution of the STLS problems. Computer simulations show that our method ensures convergence to global minimum.
To increase welding quality, in this work a cyber-physical system is presented using two cooperating AIs. the first AI uses supervised learning to initialize welding paths and parameters based on 3D scans of all parts...
详细信息
this book constitutes the refereed proceedings of the 16thinternationalconference on Developments in Language theory, DLT 2012, held in Taipei, Taiwan, in August 2012.;the 34 regular papers presented were carefully ...
详细信息
ISBN:
(数字)9783642316531
ISBN:
(纸本)9783642316524
this book constitutes the refereed proceedings of the 16thinternationalconference on Developments in Language theory, DLT 2012, held in Taipei, Taiwan, in August 2012.;the 34 regular papers presented were carefully reviewed and selected from numerous submissions. the volume also contains the papers or extended abstracts of 4 invited lectures, as well as a special memorial presentation in honor of Sheng Yu. the topics covered include grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.
For Finite State Machines (FSMs) a rich testing theory has been developed to discover aspects of their behavior and ensure their correct functioning. Although this theory is widely used, e.g., to check conformance of ...
详细信息
ISBN:
(纸本)9783030409142;9783030409135
For Finite State Machines (FSMs) a rich testing theory has been developed to discover aspects of their behavior and ensure their correct functioning. Although this theory is widely used, e.g., to check conformance of protocol implementations, its applicability is limited by restrictions of the FSM framework: the fact that inputs and outputs alternate in an FSM, and outputs are fully determined by the previous input and state. Labeled Transition Systems with inputs and outputs (LTSs), as studied in ioco testing theory, provide a richer framework for testing component oriented systems, but lack the algorithms for test generation from FSM theory. In this article, we propose an algorithm for the fundamental problem of state identification during testing of LTSs. Our algorithm is a direct generalization of the well-known algorithm for computing adaptive distinguishing sequences for FSMs proposed by Lee & Yannakakis. Our algorithm has to deal with so-called compatible states, states that cannot be distinguished in case of an adversarial system-under-test. Analogous to the result of Lee & Yannakakis, we prove that if an (adaptive) test exists that distinguishes all pairs of incompatible states of an LTS, our algorithm will find one. In practice, such adaptive tests typically do not exist. However, in experiments with an implementation of our algorithm on an industrial benchmark, we find that tests produced by our algorithm still distinguish more than 99% of the incompatible state pairs.
Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new ...
详细信息
Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new drawing algorithm that combines space-filling and fast force-directed methods; it runs in O(nlogn+m) time, where n and m are the number of vertices and edges of the network, respectively. this running time does not depend on the number of clusters, thus the algorithm guarantees good time performances independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. (ii) We present an experimental analysis aimed at understanding which clustering algorithms can be used, in combination with our visualization technique, to generate better quality drawings for medium and large networks with small-world and scale-free structure. As far as we know, no previous similar experiments have been done in this respect.
暂无评论