Search results for "Computation"
showing 10 items of 7362 documents
Forecast Output Coincidence and Biproportion: Two Criteria to Determine the Orientation of an Economy. Comparison for France (1980-1997)
2002
International audience; The method of forecast output coincidence used to determine if sectors are demand-sided or supply-sided in an input-output framework mixes two effects, the structural effect (choosing between demand and supply side models) and the effect of an exogenous factor (final demand or added-value). The note recalls that another method is possible, the comparison of the stability of technical and allocation coefficients, generalized by the biproportional filter: if for a sector, after biproportional filtering, column coefficients are more stable than row coefficients, then this sector is declared as not supply-sided (but one cannot decide that it is demand-sided anyway), and …
Polarization Modulation Instability in All-Normal Dispersion Microstructured Optical Fibers with Quasi-Continuous 1064 nm Pump
2019
Polarization modulation instability (PMI) is a form of modulation instability that can exist in weakly birefringent optical fibers [1]. Sidebands can be generated by this effect when a polarization mode of the birefringent fiber is excited with an intense optical pump. The polarization state of the sidebands is orthogonal to the polarization of the pump signal. PMI has been observed in microstructured optical fibers (MOFs). PMI was reported in a large-air-filling fraction MOF that was pumped in the normal dispersion regime with visible light [2]. The coherent degradation of femtosecond supercontinuum light generated in all-normal dispersion (ANDi) MOFs due to PMI was recently investigated […
Entanglement dynamics in superconducting qubits affected by local bistable impurities
2012
We study the entanglement dynamics for two independent superconducting qubits each affected by a bistable impurity generating random telegraph noise (RTN) at pure dephasing. The relevant parameter is the ratio $g$ between qubit-RTN coupling strength and RTN switching rate, that captures the physics of the crossover between Markovian and non-Markovian features of the dynamics. For identical qubit-RTN subsystems, a threshold value $g_\mathrm{th}$ of the crossover parameter separates exponential decay and onset of revivals; different qualitative behaviors also show up by changing the initial conditions of the RTN. We moreover show that, for different qubit-RTN subsystems, when both qubits are …
Bivariate nonlinear prediction to quantify the strength of complex dynamical interactions in short-term cardiovascular variability.
2005
A nonlinear prediction method for investigating the dynamic interdependence between short length time series is presented. The method is a generalization to bivariate prediction of the univariate approach based on nearest neighbor local linear approximation. Given the input and output series x and y, the relationship between a pattern of samples of x and a synchronous sample of y was approximated with a linear polynomial whose coefficients were estimated from an equation system including the nearest neighbor patterns in x and the corresponding samples in y. To avoid overfitting and waste of data, the training and testing stages of the prediction were designed through a specific out-of-sampl…
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
2012
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the application of BW to very large matrices used in the linear algebra step of the number field sieve (NFS) for integer factorization. In this paper, we derive an efficient CUDA implementation of this operation by using a newly designed hybrid sparse matrix format. This leads to speedups between 4 and 8 on a single graphics processing unit (GPU) for a number of tested NFS matrices compared with an optimized multicore implementation. We further present…
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
2004
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
On the decomposition of prefix codes
2017
Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.
Design of efficient codes for the AWGN channel based on decomposable binary lattices
1998
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.
Mathematical problem-solving in early school years with Bee-bot
2018
Los entornos relacionados con la robótica y los lenguajes visuales de programación por bloques permiten plantear tareas que pueden ser entendidas como problemas con contenido matemático aptos para edades escolares tempranas. Estos entornos permiten proponer situaciones problemáticas en edades en las que el formalismo o el escaso conocimiento matemático impide a los estudiantes abordar problemas matemáticos más complejos. En este trabajo se da cuenta de cómo el robot programable Bee-bot constituye un dispositivo privilegiado donde poder observar cómo los estudiantes toman decisiones durante el proceso de resolución. The environments related to robotics and the visual block-based programming …