Search results for "Approx"
showing 10 items of 922 documents
Infinite Dimensional Banach spaces of functions with nonlinear properties
2010
The aim of this paper is to show that there exist infinite dimensional Banach spaces of functions that, except for 0, satisfy properties that apparently should be destroyed by the linear combination of two of them. Three of these spaces are: a Banach space of differentiable functions on R(n) failing the Denjoy-Clarkson property; a Banach space of non Riemann integrable bounded functions, but with antiderivative at each point of an interval; a Banach space of infinitely differentiable functions that vanish at infinity and are not the Fourier transform of any Lebesgue integrable function.
Variance estimation and asymptotic confidence bands for the mean estimator of sampled functional data with high entropy unequal probability sampling …
2013
For fixed size sampling designs with high entropy it is well known that the variance of the Horvitz-Thompson estimator can be approximated by the H\'ajek formula. The interest of this asymptotic variance approximation is that it only involves the first order inclusion probabilities of the statistical units. We extend this variance formula when the variable under study is functional and we prove, under general conditions on the regularity of the individual trajectories and the sampling design, that we can get a uniformly convergent estimator of the variance function of the Horvitz-Thompson estimator of the mean function. Rates of convergence to the true variance function are given for the re…
Gaussian models for the distribution of Brownian particles in tilted periodic potentials
2011
We present two Gaussian approximations for the time-dependent probability density function (PDF) of an overdamped Brownian particle moving in a tilted periodic potential. We assume high potential barriers in comparison with the noise intensity. The accuracy of the proposed approximated expressions for the time-dependent PDF is checked with numerical simulations of the Langevin dynamics. We found a quite good agreement between theoretical and numerical results at all times.
Enabling XCSF to cope with dynamic environments via an adaptive error threshold
2020
The learning classifier system XCSF is a variant of XCS employed for function approximation. Although XCSF is a promising candidate for deployment in autonomous systems, its parameter dependability imposes a significant hurdle, as a-priori parameter optimization is not feasible for complex and changing environmental conditions. One of the most important parameters is the error threshold, which can be interpreted as a target bound on the approximation error and has to be set according to the approximated function. To enable XCSF to reliably approximate functions that change during runtime, we propose the use of an error threshold, which is adapted at run-time based on the currently achieved …
Classical and ab-initio molecular dynamic simulation of an amorphous silica surface
2001
We present the results of a classical molecular dynamic simulation as well as of an ab initio molecular dynamic simulation of an amorphous silica surface. In the case of the classical simulation we use the potential proposed by van Beest et al. (BKS) whereas the ab initio simulation is done with a Car-Parrinello method (CPMD). We find that the surfaces generated by BKS have a higher concentration of defects (e.g. concentration of two-membered rings) than those generated with CPMD. In addition also the distribution functions of the angles and of the distances are different for the short rings. Hence we conclude that whereas the BKS potential is able to reproduce correctly the surface on the …
Trunk Packing Revisited
2007
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.
The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem
2014
Abstract In many branch-and-price algorithms, the column generation subproblem consists of computing feasible constrained paths. In the capacitated arc-routing problem (CARP), elementarity constraints concerning the edges to be serviced and additional constraints resulting from the branch-and-bound process together impose two types of loop-elimination constraints. To fulfill the former constraints, it is common practice to rely on a relaxation where loops are allowed. In a k-loop elimination approach all loops of length k and smaller are forbidden. Following Bode and Irnich (2012) for solving the CARP, branching on followers and non-followers is the only known approach to guarantee integer …
Kinetics of doublet formation in bicomponent magnetic suspensions: The role of the magnetic permeability anisotropy
2017
Micron-sized particles (microbeads) dispersed in a suspension of magnetic nanoparticles, i.e., ferrofluids, can be assembled into different types of structures upon application of an externalmagnetic field. This paper is devoted to theoretical modeling of a relative motion of a pair of microbeads (either soft ferromagnetic or diamagnetic) in the ferrofluid under the action of applied uniform magnetic field which induces magnetic moments in the microbeads making them attracting to each other. The model is based on a point-dipole approximation for the magnetic interactions between microbeads mediated by the ferrofluid; however, the ferrofluid is considered to possess an anisotropic magnetic p…
Level-crossing spectroscopy of the 7, 9, and10D5∕2states ofCs133and validation of relativistic many-body calculations of the polarizabilities and hyp…
2007
We present an experimental and theoretical investigation of the polarizabilities and hyperfine constants of D{sub J} states in {sup 133}Cs for J=3/2 and 5/2. Experimental values for the hyperfine constant A are obtained from level-crossing signals of the (7,9,10)D{sub 5} at {sub {approx}}{sub sol{approx}} at {sub 2} states of {sup 133}Cs and precise calculations of the tensor polarizabilities {alpha}{sub 2}. The results of relativistic many-body calculations for scalar and tensor polarizabilities of the (5-10)D{sub 3} at {sub {approx}}{sub sol{approx}} at {sub 2} and (5-10)D{sub 5} at {sub {approx}}{sub sol{approx}} at {sub 2} states are presented and compared with measured values from the …
Some approximation properties of ( p , q ) $(p,q)$ -Bernstein operators
2016
This paper is concerned with the $(p,q)$ -analog of Bernstein operators. It is proved that, when the function is convex, the $(p,q)$ -Bernstein operators are monotonic decreasing, as in the classical case. Also, some numerical examples based on Maple algorithms that verify these properties are considered. A global approximation theorem by means of the Ditzian-Totik modulus of smoothness and a Voronovskaja type theorem are proved.