Search results for "Computation"
showing 10 items of 7362 documents
Strengthened splitting methods for computing resolvents
2021
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually. The key tool in the development of this framework is the notion of the “strengthening” of a set-valued operator, which can be viewed as a type of regularisation that preserves computational tractability. After deriving a number of iterative schemes through this framework, we demonstrate their application to best approximation problems, image denoising and elliptic PDEs. FJAA and RC were partially supported by the Ministry of Science, Innovation and Universities of Spain and the European Regional Development Fund …
Efficient polarization of high-angular-momentum systems
2016
We propose methods of optical pumping that are applicable to open, high-angular-momentum transitions in atoms and molecules, for which conventional optical pumping would lead to significant population loss. Instead of applying circularly polarized cw light, as in conventional optical pumping, we propose to use techniques for coherent population transfer (e.g., adiabatic fast passage) to arrange the atoms so as to increase the entropy removed from the system with each spontaneous decay from the upper state. This minimizes the number of spontaneous-emission events required to produce a stretched state, thus reducing the population loss due to decay to other states. To produce a stretched stat…
Digital background calibration algorithm and its FPGA implementation for timing mismatch correction of time-interleaved ADC
2019
Sample time error can degrade the performance of time-interleaved analog to digital converters (TIADCs). A fully digital background algorithm is presented in this paper to estimate and correct the timing mismatch errors between four interleaved channels, together with its hardware implementation. The proposed algorithm provides low computation burden and high performance. It is based on the simplified representation of the coefficients of the Lagrange interpolator. Simulation results show that it can suppress error tones in all of the Nyquist band. Results show that, for a four-channel TIADC with 10-bit resolution, the proposed algorithm improves the signal to noise and distortion ratio (SN…
Radio k-Labelings for Cartesian Products of Graphs
2005
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem (CVRP) in which customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. We introduce a novel symmetric formulation of the problem in which the clustering part is modeled with an asymmetric sub-model. We solve the new model with a branch-and-cut algorithm exploiting some known valid inequalities for the CVRP that can be adapted. In addition, we derive problem-specific cutting planes and new heuristic and exact separation procedures. For square grid instances in the Euclidean plane, we provide lower-bounding techniques …
Effects of ocean acidification on embryonic respiration and development of a temperate wrasse living along a natural CO2 gradient
2016
Volcanic CO2 seeps provide opportunities to investigate the effects of ocean acidification on organisms in the wild. To understand the influence of increasing CO2 concentrations on the metabolic rate (oxygen consumption) and the development of ocellated wrasse early life stages, we ran two field experiments, collecting embryos from nesting sites with different partial pressures of CO2 [pCO2; ambient (400 µatm) and high (800-1000 µatm)] and reciprocally transplanting embryos from ambient- to high-CO2 sites for 30 h. Ocellated wrasse offspring brooded in different CO2 conditions had similar responses, but after transplanting portions of nests to the high-CO2 site, embryos from parents that sp…
The Shuffle Product: New Research Directions
2015
In this paper we survey some recent researches concerning the shuffle operation that arise both in Formal Languages and in Combinatorics on Words.
Separatrix reconstruction to identify tipping points in an eco-epidemiological model
2018
Many ecological systems exhibit tipping points such that they suddenly shift from one state to another. These shifts can be devastating from an ecological point of view, and additionally have severe implications for the socio-economic system. They can be caused by overcritical perturbations of the state variables such as external shocks, disease emergence, or species removal. It is therefore important to be able to quantify the tipping points. Here we present a study of the tipping points by considering the basins of attraction of the stable equilibrium points. We address the question of finding the tipping points that lie on the separatrix surface, which partitions the space of system traj…
Handbook of Memristor Networks
2019
Unary Probabilistic and Quantum Automata on Promise Problems
2015
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.