Search results for "ExAC"
showing 10 items of 1440 documents
Electromagnetically Induced Transparency and optical pumping processes formed in Cs sub-micron thin cell
2012
Abstract The Electromagnetically Induced Transparency (EIT) effect in a Λ -system formed by Cs atoms (6 S 1/2 − 6 P 3/2 − 6 S 1/2 ) confined in an extremely thin cell (ETC) (atomic column thickness L varies in the range of 800 nm –3 µm is studied both experimentally and theoretically. It is demonstrated that when the coupling laser frequency is in exact resonance with the corresponding atomic transition, the EIT resonance parameters weakly depend on L , which allows us to detect the effect at L = λ = 852 nm. EIT process reveals a striking peculiarity in case of the coupling laser detuned by Δ from the atomic transition, namely the width of the EIT resonance rapidly increases upon an in…
Long-cavity all-fiber ring laser actively mode locked with an in-fiber bandpass acousto-optic modulator.
2013
We demonstrate low-frequency active mode locking of an erbium-doped all-fiber ring laser. As the mode locker, we used a new in-fiber bandpass acousto-optic modulator showing 74% modulation depth, 3.7 dB power insertion losses, 4.5 nm of optical bandwidth, and 20 dB of nonresonant light suppression. The laser generates 330 ps mode-locked pulses over a 10 ns pedestal, at a 1.538 MHz frequency, with 130 mW of pump power. Fil: Cuadrado Laborde, Christian Ariel. Universidad de Valencia; España. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico La Plata. Centro de Investigaciones Opticas (i); Argentina. Provincia de Buenos Aires. Gobernación. Comisión de In…
Two multilayered plate models with transverse shear warping functions issued from three dimensional elasticity equations
2014
Abstract A multilayered plate theory which uses transverse shear warping functions is presented. Two methods to obtain the transverse shear warping functions from three-dimensional elasticity equations are proposed. The warping functions are issued from the variations of transverse shear stresses computed at specific points of a simply supported plate. The first method considers an exact 3D solution of the problem. The second method uses the solution provided by the model itself: the transverse shear stresses are computed integrating equilibrium equations. Hence, an iterative process is applied, the model is updated with the new warping functions, and so on. Once the sets of warping functio…
A numerical approach to Blow-up issues for dispersive perturbations of Burgers' equation
2014
We provide a detailed numerical study of various issues pertaining to the dynamics of the Burgers equation perturbed by a weak dispersive term: blow-up in finite time versus global existence, nature of the blow-up, existence for "long" times, and the decomposition of the initial data into solitary waves plus radiation. We numerically construct solitons for fractionary Korteweg-de Vries equations.
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…
The Multiple Multidimensional Knapsack with Family-Split Penalties
2021
Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties (MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and Multidimensional Knapsack Problems. It reckons with items categorized into families and where if an individual item is selected to maximize the profit, all the items of the same family must be selected as well. Items belonging to the same family can be assigned to different knapsacks; however, in this case, split penalties are incurred. This problem arises in resource management of distributed computing contexts and Service Oriented Architecture environments. An exact algorithm based on the exploitation of a specific combi…
An exact algorithm for the min-cost network containment problem
2004
A network design problem which arises in the distribution of a public utility provided by several competitive suppliers is studied. The problem addressed is that of determining minimum-cost (generalized) arc capacities in order to accommodate any demand between given source–sink pairs of nodes, where demands are assumed to fall within predetermined ranges. Feasible flows are initially considered as simply bounded by the usual arc capacity constraints. Then, more general linear constraints are introduced which may limit the weighted sum of the flows on some subsets of arcs. An exact cutting plane algorithm is presented for solving both of the above cases and some computational results are re…
Error Estimates for a Class of Elliptic Optimal Control Problems
2016
In this article, functional type a posteriori error estimates are presented for a certain class of optimal control problems with elliptic partial differential equation constraints. It is assumed that in the cost functional the state is measured in terms of the energy norm generated by the state equation. The functional a posteriori error estimates developed by Repin in the late 1990s are applied to estimate the cost function value from both sides without requiring the exact solution of the state equation. Moreover, a lower bound for the minimal cost functional value is derived. A meaningful error quantity coinciding with the gap between the cost functional values of an arbitrary admissible …
A new branch-and-price algorithm for the traveling tournament problem
2010
Abstract The traveling tournament problem ( ttp ) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. For solving the problem exactly, we propose a new branch-and-price approach. The starting point is a new compact formulation for the ttp . The corresponding extensive formulation resulting from a Dantzig-Wolfe decomposition is identical to one given by Easton, K., Nemhauser, G., Trick, M., 2003. Solving the traveling tournament problem: a combined interger programming and constraint programming approach. In: Burke, E., De Causmaecker, P. (Eds.), Practice and Theory of Automated Timetabling IV, Volume 2740 of Lecture Notes i…
Bayesian model averaging and weighted-average least squares: Equivariance, stability, and numerical issues
2011
In this article, we describe the estimation of linear regression models with uncertainty about the choice of the explanatory variables. We introduce the Stata commands bma and wals, which implement, respectively, the exact Bayesian model-averaging estimator and the weighted-average least-squares estimator developed by Magnus, Powell, and Prüfer (2010, Journal of Econometrics 154: 139–153). Unlike standard pretest estimators that are based on some preliminary diagnostic test, these model-averaging estimators provide a coherent way of making inference on the regression parameters of interest by taking into account the uncertainty due to both the estimation and the model selection steps. Spec…