Search results for "Arithmetic"
showing 10 items of 271 documents
Six Sigma Methodology
2012
Simulation and control of dissolved air flotation and column froth flotation with simultaneous sedimentation.
2020
Abstract Flotation is a separation process where particles or droplets are removed from a suspension with the aid of floating gas bubbles. Applications include dissolved air flotation (DAF) in industrial wastewater treatment and column froth flotation (CFF) in wastewater treatment and mineral processing. One-dimensional models of flotation have been limited to steady-state situations for half a century by means of the drift-flux theory. A newly developed dynamic one-dimensional model formulated in terms of partial differential equations can be used to predict the process of simultaneous flotation of bubbles and sedimentation of particles that are not attached to bubbles. The governing model…
An application of the arithmetic euler function to the construction of nonclassical states of a quantum harmonic oscillator
2001
Abstract All quantum superpositions of two equal intensity coherent states exhibiting infinitely many zeros in their Fock distributions are explicitly constructed and studied. Our approach is based on results from number theory and, in particular, on the properties of arithmetic Euler function. The nonclassical nature of these states is briefly pointed out. Some interesting properties are brought to light.
On the Number of Closed Factors in a Word
2015
A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of closed factors of words. We show that a word of length $n$ contains at least $n+1$ distinct closed factors, and characterize those words having exactly $n+1$ closed factors. Furthermore, we show that a word of length $n$ can contain $\Theta(n^{2})$ many distinct closed factors.
Functions definable by numerical set-expressions
2011
A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of "additive circuits". If they are confined to the usual Boolean operations together with the result of lifting addition and multiplication to the level of sets, we speak of "arithmetic circuits". In this paper, we investigate the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations.
Algorithms for Computing Abelian Periods of Words
2012
Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\sigma$ can have $\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \times \sigma)$ using $O(n \times \sigma)$ space. We present an off-line algorithm based on a $\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the Abelian periods of all the prefixes of $w$.
Quantum algorithms for formula evaluation
2010
We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.
Ambiguity and complementation in recognizable two-dimensional languages
2008
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for two-dimensional languages can be attributed to Blum and Hewitt ([7]) who started in 1967 the study of finite state devices that can define two-dimensional languages, with the aim to finding a counterpart of what regular languages are in one dimension. Since then, many approaches have been presented in the literature…
Hardware-efficient matrix inversion algorithm for complex adaptive systems
2012
This work shows an FPGA implementation for the matrix inversion algebra operation. Usually, large matrix dimension is required for real-time signal processing applications, especially in case of complex adaptive systems. A hardware efficient matrix inversion procedure is described using QR decomposition of the original matrix and modified Gram-Schmidt method. This works attempts a direct VHDL description using few predefined packages and fixed point arithmetic for better optimization. New proposals for intermediate calculations are described, leading to efficient logic occupation together with better performance and accuracy in the vector space algebra. Results show that, for a relatively s…