The total quasi-steady-state approximation for fully competitive enzyme reactions
DEFF Research Database (Denmark)
Pedersen, Morten Gram; Bersani, A.M.; Bersani, E.
2007-01-01
The validity of the Michaelis-Menten-Briggs-Haldane approximation for single enzyme reactions has recently been improved by the formalism of the total quasi-steady-state approximation. This approach is here extended to fully competitive systems, and a criterion for its validity is provided. We show...
Modeling networks of coupled enzymatic reactions using the total quasi-steady state approximation.
Directory of Open Access Journals (Sweden)
Andrea Ciliberto
2007-03-01
Full Text Available In metabolic networks, metabolites are usually present in great excess over the enzymes that catalyze their interconversion, and describing the rates of these reactions by using the Michaelis-Menten rate law is perfectly valid. This rate law assumes that the concentration of enzyme-substrate complex (C is much less than the free substrate concentration (S0. However, in protein interaction networks, the enzymes and substrates are all proteins in comparable concentrations, and neglecting C with respect to S0 is not valid. Borghans, DeBoer, and Segel developed an alternative description of enzyme kinetics that is valid when C is comparable to S0. We extend this description, which Borghans et al. call the total quasi-steady state approximation, to networks of coupled enzymatic reactions. First, we analyze an isolated Goldbeter-Koshland switch when enzymes and substrates are present in comparable concentrations. Then, on the basis of a real example of the molecular network governing cell cycle progression, we couple two and three Goldbeter-Koshland switches together to study the effects of feedback in networks of protein kinases and phosphatases. Our analysis shows that the total quasi-steady state approximation provides an excellent kinetic formalism for protein interaction networks, because (1 it unveils the modular structure of the enzymatic reactions, (2 it suggests a simple algorithm to formulate correct kinetic equations, and (3 contrary to classical Michaelis-Menten kinetics, it succeeds in faithfully reproducing the dynamics of the network both qualitatively and quantitatively.
The total quasi-steady-state approximation for complex enzyme reactions
DEFF Research Database (Denmark)
Pedersen, Morten Gram; Bersani, A. M.; Bersani, E.
2008-01-01
excellent fitting to the solutions of the full system, better than the sQSSA and the single reaction tQSSA. Finally, we discuss the need for a correct model formulation when doing "reverse engineering". which aims at finding unknown parameters by fitting the model to experimentally obtained data. We show......Biochemistry in general and enzyme kinetics in particular have been heavily influenced by the model of biochemical reactions known as Michaelis-Menten kinetics. Assuming that the complex concentration is approximately constant after a short transient phase leads to the usual Michaelis-Menten (MM...... both high and low enzyme concentrations, has been introduced in the last two decades. We extend the tQSSA to more complex reaction schemes, like fully competitive reactions, double phosphorylation, Goldbeter-Koshland switch and we show that for a very large range of parameters our tQSSA provides...
Practical error analysis of the quasi-steady-state approximation ...
African Journals Online (AJOL)
The Quasi-Steady-State Approximation (QSSA) is a method of getting approximate solutions to differential equations, developed heuristically in biochemistry early this century. It can produce acceptable and important results even when formal analytic and numerical procedures fail. It has become associated with singular ...
Directory of Open Access Journals (Sweden)
Richard A. Cangelosi
2018-01-01
Full Text Available Analysis of previously published target-cell limited viral dynamic models for pathogens such as HIV, hepatitis, and influenza generally rely on standard techniques from dynamical systems theory or numerical simulation. We use a quasi-steady-state approximation to derive an analytic solution for the model with a non-cytopathic effect, that is, when the death rates of uninfected and infected cells are equal. The analytic solution provides time evolution values of all three compartments of uninfected cells, infected cells, and virus. Results are compared with numerical simulation using clinical data for equine infectious anemia virus, a retrovirus closely related to HIV, and the utility of the analytic solution is discussed.
Quasi-steady-state regime in transient stimulated Raman scattering
International Nuclear Information System (INIS)
Ackerhalt, J.R.; Kurnit, N.A.
1987-01-01
A method is developed for studying transient stimulated Raman scattering in the quasi-steady-state regime when the input pump field consists of a repetitive periodic sequence of pulses. The method is most attractive for cases where the single-pulse duration is substantially shorter than the repetition time scale, making a straightforward numerical simulation very costly, time consuming, and potentially intractable. The method is applicable to any periodic electric field envelope including that generated by a finite number of longitudinal modes with arbitrary phase. A second numerically efficient method is developed for treating the buildup of the entire pulse train. In addition, an analytic solution is found in the undepleted-pump regime which illuminates the underlying physics of the process
Quasi-steady state aerodynamics of the cheetah tail
Directory of Open Access Journals (Sweden)
Amir Patel
2016-08-01
Full Text Available During high-speed pursuit of prey, the cheetah (Acinonyx jubatus has been observed to swing its tail while manoeuvring (e.g. turning or braking but the effect of these complex motions is not well understood. This study demonstrates the potential of the cheetah's long, furry tail to impart torques and forces on the body as a result of aerodynamic effects, in addition to the well-known inertial effects. The first-order aerodynamic forces on the tail are quantified through wind tunnel testing and it is observed that the fur nearly doubles the effective frontal area of the tail without much mass penalty. Simple dynamic models provide insight into manoeuvrability via simulation of pitch, roll and yaw tail motion primitives. The inertial and quasi-steady state aerodynamic effects of tail actuation are quantified and compared by calculating the angular impulse imparted onto the cheetah's body and its shown aerodynamic effects contribute to the tail's angular impulse, especially at the highest forward velocities.
Quasi-steady state aerodynamics of the cheetah tail.
Patel, Amir; Boje, Edward; Fisher, Callen; Louis, Leeann; Lane, Emily
2016-08-15
During high-speed pursuit of prey, the cheetah (Acinonyx jubatus) has been observed to swing its tail while manoeuvring (e.g. turning or braking) but the effect of these complex motions is not well understood. This study demonstrates the potential of the cheetah's long, furry tail to impart torques and forces on the body as a result of aerodynamic effects, in addition to the well-known inertial effects. The first-order aerodynamic forces on the tail are quantified through wind tunnel testing and it is observed that the fur nearly doubles the effective frontal area of the tail without much mass penalty. Simple dynamic models provide insight into manoeuvrability via simulation of pitch, roll and yaw tail motion primitives. The inertial and quasi-steady state aerodynamic effects of tail actuation are quantified and compared by calculating the angular impulse imparted onto the cheetah's body and its shown aerodynamic effects contribute to the tail's angular impulse, especially at the highest forward velocities. © 2016. Published by The Company of Biologists Ltd.
Energy Technology Data Exchange (ETDEWEB)
Cruz, Roberto; Alarcón, Tomás de la [Centre de Recerca Matemàtica. Edifici C, Campus de Bellaterra, 08193 Bellaterra (Barcelona) (Spain); Departament de Matemàtiques, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona) (Spain); Guerrero, Pilar [Department of Mathematics, University College London, Gower Street, London WC1E 6BT (United Kingdom); Spill, Fabian [Department of Biomedical Engineering, Boston University, 44 Cummington Street, Boston, Massachusetts 02215 (United States); Department of Mechanical Engineering, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States)
2015-08-21
We analyse the effect of intrinsic fluctuations on the properties of bistable stochastic systems with time scale separation operating under quasi-steady state conditions. We first formulate a stochastic generalisation of the quasi-steady state approximation based on the semi-classical approximation of the partial differential equation for the generating function associated with the chemical master equation. Such approximation proceeds by optimising an action functional whose associated set of Euler-Lagrange (Hamilton) equations provides the most likely fluctuation path. We show that, under appropriate conditions granting time scale separation, the Hamiltonian can be re-scaled so that the set of Hamilton equations splits up into slow and fast variables, whereby the quasi-steady state approximation can be applied. We analyse two particular examples of systems whose mean-field limit has been shown to exhibit bi-stability: an enzyme-catalysed system of two mutually inhibitory proteins and a gene regulatory circuit with self-activation. Our theory establishes that the number of molecules of the conserved species is order parameters whose variation regulates bistable behaviour in the associated systems beyond the predictions of the mean-field theory. This prediction is fully confirmed by direct numerical simulations using the stochastic simulation algorithm. This result allows us to propose strategies whereby, by varying the number of molecules of the three conserved chemical species, cell properties associated to bistable behaviour (phenotype, cell-cycle status, etc.) can be controlled.
de la Cruz, Roberto; Guerrero, Pilar; Spill, Fabian; Alarcón, Tomás
2015-08-21
We analyse the effect of intrinsic fluctuations on the properties of bistable stochastic systems with time scale separation operating under quasi-steady state conditions. We first formulate a stochastic generalisation of the quasi-steady state approximation based on the semi-classical approximation of the partial differential equation for the generating function associated with the chemical master equation. Such approximation proceeds by optimising an action functional whose associated set of Euler-Lagrange (Hamilton) equations provides the most likely fluctuation path. We show that, under appropriate conditions granting time scale separation, the Hamiltonian can be re-scaled so that the set of Hamilton equations splits up into slow and fast variables, whereby the quasi-steady state approximation can be applied. We analyse two particular examples of systems whose mean-field limit has been shown to exhibit bi-stability: an enzyme-catalysed system of two mutually inhibitory proteins and a gene regulatory circuit with self-activation. Our theory establishes that the number of molecules of the conserved species is order parameters whose variation regulates bistable behaviour in the associated systems beyond the predictions of the mean-field theory. This prediction is fully confirmed by direct numerical simulations using the stochastic simulation algorithm. This result allows us to propose strategies whereby, by varying the number of molecules of the three conserved chemical species, cell properties associated to bistable behaviour (phenotype, cell-cycle status, etc.) can be controlled.
Chang, Qiang; Lu, Yang; Quan, Donghui
2017-12-01
Although the Gillespie algorithm is accurate in simulating gas–grain reaction networks, so far its computational cost is so expensive that it cannot be used to simulate chemical reaction networks that include molecular hydrogen accretion or the chemical evolution of protoplanetary disks. We present an accelerated Gillespie algorithm that is based on a quasi-steady-state assumption with the further approximation that the population distribution of transient species depends only on the accretion and desorption processes. The new algorithm is tested against a few reaction networks that are simulated by the regular Gillespie algorithm. We found that the less likely it is that transient species are formed and destroyed on grain surfaces, the more accurate the new method is. We also apply the new method to simulate reaction networks that include molecular hydrogen accretion. The results show that surface chemical reactions involving molecular hydrogen are not important for the production of surface species under standard physical conditions of dense molecular clouds.
Quasi-steady-state analysis of two-dimensional random intermittent search processes
Bressloff, Paul C.
2011-06-01
We use perturbation methods to analyze a two-dimensional random intermittent search process, in which a searcher alternates between a diffusive search phase and a ballistic movement phase whose velocity direction is random. A hidden target is introduced within a rectangular domain with reflecting boundaries. If the searcher moves within range of the target and is in the search phase, it has a chance of detecting the target. A quasi-steady-state analysis is applied to the corresponding Chapman-Kolmogorov equation. This generates a reduced Fokker-Planck description of the search process involving a nonzero drift term and an anisotropic diffusion tensor. In the case of a uniform direction distribution, for which there is zero drift, and isotropic diffusion, we use the method of matched asymptotics to compute the mean first passage time (MFPT) to the target, under the assumption that the detection range of the target is much smaller than the size of the domain. We show that an optimal search strategy exists, consistent with previous studies of intermittent search in a radially symmetric domain that were based on a decoupling or moment closure approximation. We also show how the decoupling approximation can break down in the case of biased search processes. Finally, we analyze the MFPT in the case of anisotropic diffusion and find that anisotropy can be useful when the searcher starts from a fixed location. © 2011 American Physical Society.
quasi-steady state thermal performances of a solar air heater with ...
African Journals Online (AJOL)
2017-01-17
Jan 17, 2017 ... For low temperature solar heating applications two kind of solar air ... very low heat transfer rate because of small exchange surfaces ... In the study, mean temperatures and thermal performances of the solar air heater are modelled in quasi-steady state and compared to experimental data. Nomenclature.
A quasi-steady state shrinking core model of "whole tree" combustion
African Journals Online (AJOL)
Remember me, or Register. DOWNLOAD FULL TEXT Open Access DOWNLOAD FULL TEXT Subscription or Fee Access. A quasi-steady state shrinking core model of "whole tree" combustion. A. Ouédraogo, JC Mulligan, JG Cleland. Abstract. (J. de la Recherche Scientifique de l'Université de Lomé, 2000, 4(2): 199-208) ...
Assessing Quasi-Steady State in Evaporation of Sessile Drops by Diffusion Models
Martin, Cameron; Nguyen, Hoa; Kelly-Zion, Peter; Pursell, Chris
2017-11-01
The vapor distributions surrounding sessile drops of methanol are modeled as the solutions of the steady-state and transient diffusion equations using Matlab's PDE Toolbox. The goal is to determine how quickly the transient diffusive transport reaches its quasi-steady state as the droplet geometry is varied between a Weber's disc, a real droplet shape, and a spherical cap with matching thickness or contact angle. We assume that the only transport mechanism at work is diffusion. Quasi-steady state is defined using several metrics, such as differences between the transient and steady-state solutions, and change in the transient solution over time. Knowing the vapor distribution, the gradient is computed to evaluate the diffusive flux. The flux is integrated along the surface of a control volume surrounding the drop to obtain the net rate of diffusion out of the volume. Based on the differences between the transient and steady-state diffusive fluxes at the discrete points along the control-volume surface, the time to reach quasi-steady state evaporation is determined and is consistent with other proposed measurements. By varying the dimensions of the control volume, we can also assess what regimes have equivalent or different quasi-steady states for different droplet geometries. Petroleum Research Fund.
Quasi-steady state thermal performances of a solar air heater with ...
African Journals Online (AJOL)
Quasi-steady state thermal performance of a solar air heater with a combined absorber is studied. The whole energy balance equations related to the system were articulated as a linear system of temperature equations. Solutions to this linear system were assessed from program based on an iterative process. The mean ...
A fully implicit method for 3D quasi-steady state magnetic advection-diffusion.
Energy Technology Data Exchange (ETDEWEB)
Siefert, Christopher; Robinson, Allen Conrad
2009-09-01
We describe the implementation of a prototype fully implicit method for solving three-dimensional quasi-steady state magnetic advection-diffusion problems. This method allows us to solve the magnetic advection diffusion equations in an Eulerian frame with a fixed, user-prescribed velocity field. We have verified the correctness of method and implementation on two standard verification problems, the Solberg-White magnetic shear problem and the Perry-Jones-White rotating cylinder problem.
Quasi-steady State Reduction of Molecular Motor-Based Models of Directed Intermittent Search
Newby, Jay M.
2010-02-19
We present a quasi-steady state reduction of a linear reaction-hyperbolic master equation describing the directed intermittent search for a hidden target by a motor-driven particle moving on a one-dimensional filament track. The particle is injected at one end of the track and randomly switches between stationary search phases and mobile nonsearch phases that are biased in the anterograde direction. There is a finite possibility that the particle fails to find the target due to an absorbing boundary at the other end of the track. Such a scenario is exemplified by the motor-driven transport of vesicular cargo to synaptic targets located on the axon or dendrites of a neuron. The reduced model is described by a scalar Fokker-Planck (FP) equation, which has an additional inhomogeneous decay term that takes into account absorption by the target. The FP equation is used to compute the probability of finding the hidden target (hitting probability) and the corresponding conditional mean first passage time (MFPT) in terms of the effective drift velocity V, diffusivity D, and target absorption rate λ of the random search. The quasi-steady state reduction determines V, D, and λ in terms of the various biophysical parameters of the underlying motor transport model. We first apply our analysis to a simple 3-state model and show that our quasi-steady state reduction yields results that are in excellent agreement with Monte Carlo simulations of the full system under physiologically reasonable conditions. We then consider a more complex multiple motor model of bidirectional transport, in which opposing motors compete in a "tug-of-war", and use this to explore how ATP concentration might regulate the delivery of cargo to synaptic targets. © 2010 Society for Mathematical Biology.
Venkiteshwaran, K; Milferstedt, K; Hamelin, J; Zitomer, D H
2016-11-01
Nine anaerobic digesters, each seeded with biomass from a different source, were operated identically and their quasi steady state function was compared. Subsequently, digesters were bioaugmented with a methanogenic culture previously shown to increase specific methanogenic activity. Before bioaugmentation, different seed biomass resulted in different quasi steady state function, with digesters clustering into three groups distinguished by methane (CH 4 ) production. Digesters with similar functional performance contained similar archaeal communities based on clustering of Illumina sequence data of the V4V5 region of the 16S rRNA gene. High CH 4 production correlated with neutral pH and high Methanosarcina abundance, whereas low CH 4 production correlated to low pH as well as high Methanobacterium and DHVEG 6 family abundance. After bioaugmentation, CH 4 production from the high CH 4 producing digesters transiently increased by 11 ± 3% relative to non-bioaugmented controls (p digesters that all had pH higher than 6.7. The CH 4 production increase after bioaugmentation was correlated to increased relative abundance of Methanosaeta and Methaospirillum originating from the bioaugment culture. In conclusion, different anaerobic digester seed biomass can result in different quasi steady state CH 4 production, SCOD removal, pH and effluent VFA concentration in the timeframe studied. The bioaugmentation employed can result in a period of increased methane production. Future research should address extending the period of increased CH 4 production by employing pH and VFA control concomitant with bioaugmentation, developing improved bioaugments, or employing a membrane bioreactor to retain the bioaugment. Copyright © 2016 Elsevier Ltd. All rights reserved.
Nioradze, Nikoloz; Kim, Jiyeon; Amemiya, Shigeru
2011-02-01
We report on a novel theory and experiment for scanning electrochemical microscopy (SECM) to enable quasi-steady-state voltammetry of rapid electron transfer (ET) reactions at macroscopic substrates. With this powerful approach, the substrate potential is cycled widely across the formal potential of a redox couple while the reactant or product of a substrate reaction is amperometrically detected at the tip in the feedback or substrate generation/tip collection mode, respectively. The plot of tip current versus substrate potential features the retraceable sigmoidal shape of a quasi-steady-state voltammogram although a transient voltammogram is obtained at the macroscopic substrate. Finite element simulations reveal that a short tip-substrate distance and a reversible substrate reaction (except under the tip) are required for quasi-steady-state voltammetry. Advantageously, a pair of quasi-steady-state voltammograms is obtained by employing both operation modes to reliably determine all transport, thermodynamic, and kinetic parameters as confirmed experimentally for rapid ET reactions of ferrocenemethanol and 7,7,8,8-tetracyanoquinodimethane at a Pt substrate with ∼0.5 μm-radius Pt tips positioned at 90 nm-1 μm distances. Standard ET rate constants of ∼7 cm/s were obtained for the latter mediator as the largest determined for a substrate reaction by SECM. Various potential applications of quasi-steady-state voltammetry are also proposed.
Application of piezodetectors for diagnostics of pulsed and quasi-steady-state plasma streams
International Nuclear Information System (INIS)
Bandura, A.N.; Chebotarev, V.V.; Garkusha, I.E.; Tereshin, V.I.; Ladygina, M.S.
2006-01-01
The paper reports on studies of the plasma streams generated by two experimental devices: the quasi-steady-state plasma accelerator (QSPA) Kh-50 and the pulsed plasma gun PROSVET. The radial distributions of the plasma pressure for different times and varied distances from the accelerator output have been used for investigation of the plasma stream dynamics and study the plasma compression in the focus region for different operational regimes of plasma accelerators. In experiments for the application of pulsed plasma streams for surface modification of different industrial steels, optimal regimes of surface processing have been chosen on the basis of the plasma pressure measurements. Examples of application of the piezodetectors in simulation experiments on plasma surface interaction under high heat loads are presented
Quasi steady state multi-dimensional space-dependent kinetic code EUREKA-SPACE
International Nuclear Information System (INIS)
Inabe, Teruo; Ohnishi, Nobuaki
1977-08-01
A quasi steady state, multi-dimensional, space-dependent, kinetic code EUREKA-SPACE which is coupled with multi-region thermal-hydraulic model has been developed to analyze a water cooled, power reactor during a reactivity accident. The code includes the following features: (1) Multi-dimensional power and flux distributions are calculated for several fuel enthalpy increments, and the transient reactor power behavior is determined by use of point kinetics equation. The power and flux distributions of the core are calculated with multi-group multi-dimensional diffusion equations, using temperature dependent cross section data. (2) Thermal-hydraulic calculation for up to maximum of five regions is performed to provide the details for feedback reactivity. (3) Feedback reactivity from doppler effect, moderator effect, void formation and cladding thermal expansion effects is taken into account. The code is written in FORTRAN IV language for FACOM-230/75 and CDC-6600. This report presents detailed descriptions of the code, including basic equations, lists of input and output and test calculation results. (auth.)
Yung, C. S.; Lansing, F. L.
1983-01-01
A 37.85 cu m (10,000 gallons) per year (nominal) passive solar powered water distillation system was installed and is operational in the Venus Deep Space Station. The system replaced an old, electrically powered water distiller. The distilled water produced with its high electrical resistivity is used to cool the sensitive microwave equipment. A detailed thermal model was developed to simulate the performance of the distiller and study its sensitivity under varying environment and load conditions. The quasi-steady state portion of the model is presented together with the formulas for heat and mass transfer coefficients used. Initial results indicated that a daily water evaporation efficiency of 30% can be achieved. A comparison made between a full day performance simulation and the actual field measurements gave good agreement between theory and experiment, which verified the model.
Quasi-steady-state model of a counter flow air-to-air heat exchanger with phase change
DEFF Research Database (Denmark)
Rose, Jørgen; Nielsen, Toke Rammer; Kragh, Jesper
2008-01-01
Using mechanical ventilation with highly efficient heat-recovery in northern European or arctic climates is a very efficient way of reducing the energy use for heating in buildings. However, it also presents a series of problems concerning condensation and frost formation in the heat......-exchanger. Developing highly efficient heat-exchangers and strategies to avoid/remove frost formation implies the use of detailed models to predict and evaluate different heat-exchanger designs and strategies. This paper presents a quasi-steady-state model of a counter-flow air-to-air heat-exchanger that takes...... into account the effects of condensation and frost formation. The model is developed as an Excel spreadsheet, and specific results are compared with laboratory measurements. As an example, the model is used to determine the most energy-efficient control strategy for a specific heat-exchanger under northern...
Directory of Open Access Journals (Sweden)
Jennifer Scheidel
2015-12-01
Full Text Available The insulin-dependent activation and recycling of the insulin receptor play an essential role in the regulation of the energy metabolism, leading to a special interest for pharmaceutical applications. Thus, the recycling of the insulin receptor has been intensively investigated, experimentally as well as theoretically. We developed a time-resolved, discrete model to describe stochastic dynamics and study the approximation of non-linear dynamics in the context of timed Petri nets. Additionally, using a graph-theoretical approach, we analyzed the structure of the regulatory system and demonstrated the close interrelation of structural network properties with the kinetic behavior. The transition invariants decomposed the model into overlapping subnetworks of various sizes, which represent basic functional modules. Moreover, we computed the quasi-steady states of these subnetworks and demonstrated that they are fundamental to understand the dynamic behavior of the system. The Petri net approach confirms the experimental results of insulin-stimulated degradation of the insulin receptor, which represents a common feature of insulin-resistant, hyperinsulinaemic states.
Energy Technology Data Exchange (ETDEWEB)
Fleishman, Gregory D. [Center For Solar-Terrestrial Research, New Jersey Institute of Technology, Newark, NJ 07102 (United States); Kuznetsov, Alexey A. [Institute of Solar-Terrestrial Physics, Irkutsk 664033 (Russian Federation)
2014-02-01
Currently there is a concern about the ability of the classical thermal (Maxwellian) distribution to describe quasi-steady-state plasma in the solar atmosphere, including active regions. In particular, other distributions have been proposed to better fit observations, for example, kappa- and n-distributions. If present, these distributions will generate radio emissions with different observable properties compared with the classical gyroresonance (GR) or free-free emission, which implies a way of remotely detecting these non-Maxwellian distributions in the radio observations. Here we present analytically derived GR and free-free emissivities and absorption coefficients for the kappa- and n-distributions, and discuss their properties, which are in fact remarkably different from each other and from the classical Maxwellian plasma. In particular, the radio brightness temperature from a gyrolayer increases with the optical depth τ for kappa-distribution, but decreases with τ for n-distribution. This property has a remarkable consequence allowing a straightforward observational test: the GR radio emission from the non-Maxwellian distributions is supposed to be noticeably polarized even in the optically thick case, where the emission would have strictly zero polarization in the case of Maxwellian plasma. This offers a way of remote probing the plasma distribution in astrophysical sources, including solar active regions as a vivid example.
Hepatic, renal, and total body galactose elimination in the pig
DEFF Research Database (Denmark)
Winkler, K; Henriksen, Jens Henrik Sahl; Tygstrup, N
1993-01-01
Galactose elimination capacity is used as a quantitative measure of liver function on the assumption that galactose elimination outside the liver is negligible or easily corrected for. The relationship between hepatic and extrahepatic removal of galactose was studied in anesthetized pigs during...... quasi-steady-state conditions by continuous infusion of galactose. The hepatic removal approximated a constant [maximal velocity = 585 +/- 41 mumol/min, Michaelis constant (Km) = 0.24 +/- 0.07 mmol/l, mean +/- SE, n = 20]. The renal removal was less than the amount filtered, showing maximal tubular...... reabsorption (Tm 178 +/- 3.0 mumol/min, Km 3.8 +/- 0.9 mmol/l, n = 20). Metabolic conversion of galactose in the kidney was not demonstrable. At all concentrations studied (0.4-5.8 mmol/l), total galactose elimination from the body exceeded the sum of hepatic and renal elimination by approximately 100 mumol...
Neutron total cross section calculation within the framework of quasi-harmonic approximation
Cai, Xiao-Xiao; Klinkby, Esben
2017-10-01
The accuracy of neutron scattering cross sections is the gauge for the realistic outcome of a neutron transport simulation. To improve the traditional harmonic physics model used in such simulations, we revisit the slow neutron transport theory in crystalline materials and aim to develop a unified model that has good performance for neutron transport problems in crystals in a wide range of temperatures and pressures. The quasi-harmonic approximation (QHA) correlates phonon evolution explicitly with unit cell volume. Therefore, it is capable of evaluating a variety of material properties at finite temperatures. In this work, we show numerically that it is a very effective tool for our application as well. Within the framework of QHA, we calculate the temperature dependent characteristics of phonons in three elemental crystals, namely Be, Mg and Al. Based on the obtained results, our calculated neutron total cross sections agree closely with experimental transmission cross sections in a large temperature range below the melting point. We show that as the harmonic cross section model ignores the effects of phonon softening in these crystals, it underestimates the total inelastic cross sections at high temperatures. In the case of Al, we observe that such underestimation is up to 7% at room temperature. In addition, we study the phonon-phonon scatterings in Al. We observe that the cross section is insensitive to the finite phonon lifetimes even at 800 K.
Neutron total cross section calculation within the framework of quasi-harmonic approximation
International Nuclear Information System (INIS)
Cai, Xiao-Xiao; Klinkby, Esben
2017-01-01
The accuracy of neutron scattering cross sections is the gauge for the realistic outcome of a neutron transport simulation. To improve the traditional harmonic physics model used in such simulations, we revisit the slow neutron transport theory in crystalline materials and aim to develop a unified model that has good performance for neutron transport problems in crystals in a wide range of temperatures and pressures. The quasi-harmonic approximation (QHA) correlates phonon evolution explicitly with unit cell volume. Therefore, it is capable of evaluating a variety of material properties at finite temperatures. In this work, we show numerically that it is a very effective tool for our application as well. Within the framework of QHA, we calculate the temperature dependent characteristics of phonons in three elemental crystals, namely Be, Mg and Al. Based on the obtained results, our calculated neutron total cross sections agree closely with experimental transmission cross sections in a large temperature range below the melting point. We show that as the harmonic cross section model ignores the effects of phonon softening in these crystals, it underestimates the total inelastic cross sections at high temperatures. In the case of Al, we observe that such underestimation is up to 7% at room temperature. In addition, we study the phonon–phonon scatterings in Al. We observe that the cross section is insensitive to the finite phonon lifetimes even at 800 K. (paper)
Conceptual design study of quasi-steady state fusion experimental reactor (FEQ-Q), part 1
International Nuclear Information System (INIS)
1985-12-01
Since 1980 the design study has been conducted at JAERI for the Fusion Experimental Reactor (FER) which has been proposed to be the next machine to JT-60 in the Japanese long term program of fusion reactor development. Starting from 1984 JER design is being reviewed and redesigned. This report is a part of the interim report which describes the results obtained in the review and redesign activities in FY 1984. The results of the following design items are included; core plasma, reactor structure, reactor core components, magnets. (author)
Action-at-a-distance electrodynamics in quasi-steady-state cosmology
Indian Academy of Sciences (India)
Action-at-a-distance electrodynamics – alternative approach to field theory – can be extended to cosmological models using conformal symmetry. ... Indian Institute of Science Education and Research (IISER), Pashan, Pune 411 021, India; Harish Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad 211 019, India ...
Quasi-Steady State Multi-Plasma Cloud Configuration in the Ionosphere.
1984-04-20
morphology of two-plasma cloud and three-plasma cloud configurations, embedded in an F region ionosphere, in detail using the techniques developed in Paper...D.C. 20305 03CY ATTN RAAE OICY ATTN R. CRAWFORD COMMANDER COMMANDER/DIRECTOR FIELD COMAND ATMOSPHERIC SCIENCES LABORATORY DEFENSE NUCLEAR AGENCY U.S...NM 87545 01CY ATTN DOC CON FOR J. WOLCOTT STRATEGIC AIR COMAND /XPFS OLCY ATTN DOC CON FOR R.F. TASCHEK OFFUTT AFB, NB 68113 O1CY ATTN DOC CON FOR E
Conceptual design study of quasi-steady state fusion experimental reactor (FER-Q), part 2
International Nuclear Information System (INIS)
1985-12-01
Since 1980 the design study has been conducted at JAERI for the Fusion Experimental Reactor (FER) which has been proposed to be the next machine to JT-60 in the Japanese long term program of fusion reactor development. Starting from 1984 FER design is being reviewed and redesigned. This report is a part of the interim report which describes the results obtained in the review and redesign activities in FY 1984. The results of the following design items are included: heating/current drive system, plasma position control, power supply, diagnostics, neutronics, blanket test module, repair and maintenance and safety. (author)
Action-at-a-distance electrodynamics in quasi-steady-state cosmology
Indian Academy of Sciences (India)
gin of arrow of time in electromagnetism can be attributed to the cosmological structure. Different cosmological models can be ... respectively, were assumed to travel at infinite speed. The experiments in electrodynam- ... action to curved space-times using Green's functions for wave equation. 450. Pramana – J. Phys., Vol.
Action-at-a-distance electrodynamics in quasi-steady-state cosmology
Indian Academy of Sciences (India)
tion for supernovae in QSSC. Intergalactic dust in QSSC makes supernovae dimmer and thermalizes starlight to produce cosmic microwave background radiation (CMBR). [15–17]. 3. Evaluation of WF absorption integrals: Retarded and advanced waves. In this section, we evaluate the WF absorption integrals (IR and IA) in ...
Accurate reduction of a model of circadian rhythms by delayed quasi steady state assumptions
Czech Academy of Sciences Publication Activity Database
Vejchodský, Tomáš
2014-01-01
Roč. 139, č. 4 (2014), s. 577-585 ISSN 0862-7959 Grant - others:European Commission(XE) StochDetBioModel(328008) Program:FP7 Institutional support: RVO:67985840 Keywords : biochemical networks * gene regulatory networks * oscillating systems * periodic solution Subject RIV: BA - General Mathematics http://hdl.handle.net/10338.dmlcz/144135
Neutron total cross section calculation within the framework of quasi-harmonic approximation
DEFF Research Database (Denmark)
Cai, Xiao Xiao; Klinkby, Esben Bryndt
2017-01-01
The accuracy of neutron scattering cross sections is the gauge for the realistic outcome of a neutron transport simulation. To improve the traditional harmonic physics model used in such simulations, we revisit the slow neutron transport theory in crystalline materials and aim to develop a unified...... model that has good performance for neutron transport problems in crystals in a wide range of temperatures and pressures. The quasi-harmonic approximation (QHA) correlates phonon evolution explicitly with unit cell volume. Therefore, it is capable of evaluating a variety of material properties at finite...... temperatures. In this work, we show numerically that it is a very effective tool for our application as well. Within the framework of QHA, we calculate the temperature dependent characteristics of phonons in three elemental crystals, namely Be, Mg and Al. Based on the obtained results, our calculated neutron...
DEFF Research Database (Denmark)
Patrick, Christopher; Thygesen, Kristian Sommer
2016-01-01
In non-self-consistent calculations of the total energy within the random-phase approximation (RPA) for electronic correlation, it is necessary to choose a single-particle Hamiltonian whose solutions are used to construct the electronic density and noninteracting response function. Here we...... in the underlying electronic structure. We further demonstrate that the non-selfconsistent RPA total energies of these materials have minima at nonzero U. Our RPA calculations find the rutile phase of TiO2 to be more stable than anatase independent of U, a result which is consistent with experiments...
Czech Academy of Sciences Publication Activity Database
Hnětynková, I.; Plešinger, Martin; Sima, D.M.; Strakoš, Z.; Huffel van, S.
2011-01-01
Roč. 32, č. 3 (2011), s. 748-770 ISSN 0895-4798 R&D Projects: GA AV ČR IAA100300802 Grant - others:GA ČR(CZ) GA201/09/0917 Program:GA Institutional research plan: CEZ:AV0Z10300504 Keywords : total least squares * multiple right-hand sides * linear approximation problems * orthogonally invariant problems * orthogonal regression * errors-in-variables modeling Subject RIV: BA - General Mathematics Impact factor: 1.368, year: 2011
DEFF Research Database (Denmark)
Le Dreau, Jerome; Heiselberg, Per; Jensen, Rasmus Lund
2013-01-01
, level of insulation, orientation, internal heat loads, duration and air change rate of night-time ventilation. For both methods, the derived correction factors are highly dependent on the thermal mass of the building. An influence of the period of activation of night-time ventilation has also been...
Tang, J. Y.
2015-09-01
The Michaelis-Menten kinetics and the reverse Michaelis-Menten kinetics are two popular mathematical formulations used in many land biogeochemical models to describe how microbes and plants would respond to changes in substrate abundance. However, the criteria of when to use which of the two are often ambiguous. Here I show that these two kinetics are special approximations to the Equilibrium Chemistry Approximation kinetics, which is the first order approximation to the quadratic kinetics that solves the equation of enzyme-substrate complex exactly for a single enzyme single substrate biogeochemical reaction with the law of mass action and the assumption of quasi-steady-state for the enzyme-substrate complex and that the product genesis from enzyme-substrate complex is much slower than the equilibration between enzyme-substrate complexes, substrates and enzymes. In particular, I showed that the derivation of the Michaelis-Menten kinetics does not consider the mass balance constraint of the substrate, and the reverse Michaelis-Menten kinetics does not consider the mass balance constraint of the enzyme, whereas both of these constraints are taken into account in the Equilibrium Chemistry Approximation kinetics. By benchmarking against predictions from the quadratic kinetics for a wide range of substrate and enzyme concentrations, the Michaelis-Menten kinetics was found to persistently under-predict the normalized sensitivity ∂ ln v / ∂ ln k2+ of the reaction velocity v with respect to the maximum product genesis rate k2+, persistently over-predict the normalized sensitivity ∂ ln v / ∂ ln k1+ of v with respect to the intrinsic substrate affinity k1+, persistently over-predict the normalized sensitivity ∂ ln v / ∂ ln [ E ]T of v with respect the total enzyme concentration [ E ]T and persistently under-predict the normalized sensitivity ∂ ln v / ∂ ln [ S ]T of v with respect to the total substrate concentration [ S ]T. Meanwhile, the reverse Michaelis
Target-mediated drug disposition model and its approximations for antibody-drug conjugates.
Gibiansky, Leonid; Gibiansky, Ekaterina
2014-02-01
Antibody-drug conjugate (ADC) is a complex structure composed of an antibody linked to several molecules of a biologically active cytotoxic drug. The number of ADC compounds in clinical development now exceeds 30, with two of them already on the market. However, there is no rigorous mechanistic model that describes pharmacokinetic (PK) properties of these compounds. PK modeling of ADCs is even more complicated than that of other biologics as the model should describe distribution, binding, and elimination of antibodies with different toxin load, and also the deconjugation process and PK of the released toxin. This work extends the target-mediated drug disposition (TMDD) model to describe ADCs, derives the rapid binding (quasi-equilibrium), quasi-steady-state, and Michaelis-Menten approximations of the TMDD model as applied to ADCs, derives the TMDD model and its approximations for ADCs with load-independent properties, and discusses further simplifications of the system under various assumptions. The developed models are shown to describe data simulated from the available clinical population PK models of trastuzumab emtansine (T-DM1), one of the two currently approved ADCs. Identifiability of model parameters is also discussed and illustrated on the simulated T-DM1 examples.
Fernández-Ruiz, R
2008-11-15
Nowadays, the subject of the quality assurance of the analytical results is acquiring more and more importance. This work presents a basic theoretical and empirical approximation to the expanded uncertainty associated to the TXRF measurements. Two theoretical models has been proposed and compared systematically with the empirical expanded uncertainty obtained. The main consequences derived of this work are the following; theoretical model B explains with a high degree of agreement the empirical expanded uncertainties associated to the TXRF measurements, while theoretical model A explains partially the instrumental repeatability of the TXRF system. On the other hand, an unexpected U-behavior has been found for the empirical uncertainty in TXRF measurements whose explanation can be due to the sum of several sources of uncertainty not considered like variations of the Compton background or the nonlinearity of the Si(Li) detector quantum efficiency. Additionally, it has been shown that the roughness and small geometrical variations of the sample depositions are the more important uncertainty sources in the experimental TXRF measurements.
Tang, J. Y.
2015-12-01
The Michaelis-Menten kinetics and the reverse Michaelis-Menten kinetics are two popular mathematical formulations used in many land biogeochemical models to describe how microbes and plants would respond to changes in substrate abundance. However, the criteria of when to use either of the two are often ambiguous. Here I show that these two kinetics are special approximations to the equilibrium chemistry approximation (ECA) kinetics, which is the first-order approximation to the quadratic kinetics that solves the equation of an enzyme-substrate complex exactly for a single-enzyme and single-substrate biogeochemical reaction with the law of mass action and the assumption of a quasi-steady state for the enzyme-substrate complex and that the product genesis from enzyme-substrate complex is much slower than the equilibration between enzyme-substrate complexes, substrates, and enzymes. In particular, I show that the derivation of the Michaelis-Menten kinetics does not consider the mass balance constraint of the substrate, and the reverse Michaelis-Menten kinetics does not consider the mass balance constraint of the enzyme, whereas both of these constraints are taken into account in deriving the equilibrium chemistry approximation kinetics. By benchmarking against predictions from the quadratic kinetics for a wide range of substrate and enzyme concentrations, the Michaelis-Menten kinetics was found to persistently underpredict the normalized sensitivity ∂ ln v / ∂ ln k2+ of the reaction velocity v with respect to the maximum product genesis rate k2+, persistently overpredict the normalized sensitivity ∂ ln v / ∂ ln k1+ of v with respect to the intrinsic substrate affinity k1+, persistently overpredict the normalized sensitivity ∂ ln v / ∂ ln [E]T of v with respect the total enzyme concentration [E]T, and persistently underpredict the normalized sensitivity ∂ ln v / ∂ ln [S]T of v with respect to the total substrate concentration [S]T. Meanwhile, the
Indian Academy of Sciences (India)
IAS Admin
V S Borkar is the Institute. Chair Professor of. Electrical Engineering at. IIT Bombay. His research interests are stochastic optimization, theory, algorithms and applica- tions. 1 'Markov Chain Monte Carlo' is another one (see [1]), not to mention schemes that combine both. Stochastic approximation is one of the unsung.
CERN. Geneva
2015-01-01
Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...
Diophantine approximation and badly approximable sets
DEFF Research Database (Denmark)
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X....... The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...
International Nuclear Information System (INIS)
Ginsburg, C.A.
1980-01-01
In many problems, a desired property A of a function f(x) is determined by the behaviour of f(x) approximately equal to g(x,A) as x→xsup(*). In this letter, a method for resuming the power series in x of f(x) and approximating A (modulated Pade approximant) is presented. This new approximant is an extension of a resumation method for f(x) in terms of rational functions. (author)
Approximate iterative algorithms
Almudevar, Anthony Louis
2014-01-01
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a
Quasi-steady state power law model for flow of (La0·85Sr0·15)0·9MnO3 ceramic slurry in tape casting
DEFF Research Database (Denmark)
Jabbari, M; Bulatova, R; Hattel, J H
2013-01-01
One of the most common ways used to produce multilayer ceramics is tape casting. In this process, the wet tape thickness is one of the single most determining parameters affecting the final properties of the product, and it is therefore of great interest to be able to control it. In the present...... work, the flow in the doctor blade region of a slurry containing (La0?85Sr0?15)0?9MnO3 (LSM) material is described with a simple quasi-steady momentum equation in combination with an Ostwald–de Waele power law constitutive equation. Based on rheometer experiments, the constants in the Ostwald–de Waele...... power law are identified for the considered LSM material and applied in the analytical solution for the tape thickness. This solution is then used for different values of substrate velocity and doctor blade height and compared with experimental findings of the wet tape thickness, and good agreement...
Sparse approximation with bases
2015-01-01
This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications. The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...
Topological approximations of multisets
Directory of Open Access Journals (Sweden)
El-Sayed A. Abo-Tabl
2013-07-01
Full Text Available Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we define and investigate three types of lower and upper multiset approximations of any multiset. These types based on the multiset base of multiset topology induced by a multiset relation. Moreover, the relationships between generalized rough msets and mset topologies are given. In addition, an illustrative example is given to illustrate the relationships between different types of generalized definitions of rough multiset approximations.
Expectation Consistent Approximate Inference
DEFF Research Database (Denmark)
Opper, Manfred; Winther, Ole
2005-01-01
We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability...
Approximations of Fuzzy Systems
Directory of Open Access Journals (Sweden)
Vinai K. Singh
2013-03-01
Full Text Available A fuzzy system can uniformly approximate any real continuous function on a compact domain to any degree of accuracy. Such results can be viewed as an existence of optimal fuzzy systems. Li-Xin Wang discussed a similar problem using Gaussian membership function and Stone-Weierstrass Theorem. He established that fuzzy systems, with product inference, centroid defuzzification and Gaussian functions are capable of approximating any real continuous function on a compact set to arbitrary accuracy. In this paper we study a similar approximation problem by using exponential membership functions
Order reduction for a model of marine bacteriophage evolution
Pagliarini, Silvia; Korobeinikov, Andrei
2017-02-01
A typical mechanistic model of viral evolution necessary includes several time scales which can differ by orders of magnitude. Such a diversity of time scales makes analysis of these models difficult. Reducing the order of a model is highly desirable when handling such a model. A typical approach applied to such slow-fast (or singularly perturbed) systems is the time scales separation technique. Constructing the so-called quasi-steady-state approximation is the usual first step in applying the technique. While this technique is commonly applied, in some cases its straightforward application can lead to unsatisfactory results. In this paper we construct the quasi-steady-state approximation for a model of evolution of marine bacteriophages based on the Beretta-Kuang model. We show that for this particular model the quasi-steady-state approximation is able to produce only qualitative but not quantitative fit.
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. Loose-cluster approximation. Continuous curve Our Theory. Dashed curve Our Simulation. Loose cluster approx. not only. captures -the anomalous. qualitative features but is also,. quantitatively, quite accurate. Notes:
Bosma, Wieb
1990-01-01
The distribution is determined of some sequences that measure how well a number is approximated by its mediants (or intermediate continued fraction convergents). The connection with a theorem of Fatou, as well as a new proof of this, is given.
International Nuclear Information System (INIS)
Knobloch, A.F.
1980-01-01
A simplified cost approximation for INTOR parameter sets in a narrow parameter range is shown. Plausible constraints permit the evaluation of the consequences of parameter variations on overall cost. (orig.) [de
Gautschi, Walter; Rassias, Themistocles M
2011-01-01
Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg
Approximation Behooves Calibration
DEFF Research Database (Denmark)
da Silva Ribeiro, André Manuel; Poulsen, Rolf
2013-01-01
Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009.......Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Improved Approximation Algorithm for
Byrka, Jaroslaw; Li, S.; Rybicki, Bartosz
2014-01-01
We study the k-level uncapacitated facility location problem (k-level UFL) in which clients need to be connected with paths crossing open facilities of k types (levels). In this paper we first propose an approximation algorithm that for any constant k, in polynomial time, delivers solutions of
Prestack wavefield approximations
Alkhalifah, Tariq
2013-09-01
The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.
Generalized Approximate Message Passing
DEFF Research Database (Denmark)
Oxvig, Christian Schou; Arildsen, Thomas; Larsen, Torben
2017-01-01
This tech report details a collection of results related to the Generalised Approximate Message Passing (GAMP) algorithm. It is a summary of the results that the authors have found critical in understanding the GAMP algorithm. In particular, emphasis is on the details that are crucial in implemen...
Wolff, Hans
This paper deals with a stochastic process for the approximation of the root of a regression equation. This process was first suggested by Robbins and Monro. The main result here is a necessary and sufficient condition on the iteration coefficients for convergence of the process (convergence with probability one and convergence in the quadratic…
DEFF Research Database (Denmark)
Madsen, Rasmus Elsborg
2005-01-01
The Dirichlet compound multinomial (DCM), which has recently been shown to be well suited for modeling for word burstiness in documents, is here investigated. A number of conceptual explanations that account for these recent results, are provided. An exponential family approximation of the DCM...
Simsic, P. L.
1974-01-01
Excitation of neutral atoms by inelastic scattering of incident electrons in gaseous nebulae were investigated using Slater Wave functions to describe the initial and final states of the atom. Total cross sections using the Born Approximation are calculated for: Li(2s yields 2p), Na(3s yields 4p), k(4s yields 4p). The intensity of emitted radiation from gaseous nebulae is also calculated, and Maxwell distribution is employed to average the kinetic energy of electrons.
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2011-01-01
Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.
Topology, calculus and approximation
Komornik, Vilmos
2017-01-01
Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejér, Stieltjes, and Turán. The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Carathéodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure an...
Fragments of approximate counting
Czech Academy of Sciences Publication Activity Database
Buss, S.R.; Kolodziejczyk, L. A.; Thapen, Neil
2014-01-01
Roč. 79, č. 2 (2014), s. 496-525 ISSN 0022-4812 R&D Projects: GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : approximate counting * bounded arithmetic * ordering principle Subject RIV: BA - General Mathematics Impact factor: 0.541, year: 2014 http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9287274&fileId=S0022481213000376
Optimization and approximation
Pedregal, Pablo
2017-01-01
This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.
Approximate Bayesian recursive estimation
Czech Academy of Sciences Publication Activity Database
Kárný, Miroslav
2014-01-01
Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf
Topics in Metric Approximation
Leeb, William Edward
This thesis develops effective approximations of certain metrics that occur frequently in pure and applied mathematics. We show that distances that often arise in applications, such as the Earth Mover's Distance between two probability measures, can be approximated by easily computed formulas for a wide variety of ground distances. We develop simple and easily computed characterizations both of norms measuring a function's regularity -- such as the Lipschitz norm -- and of their duals. We are particularly concerned with the tensor product of metric spaces, where the natural notion of regularity is not the Lipschitz condition but the mixed Lipschitz condition. A theme that runs throughout this thesis is that snowflake metrics (metrics raised to a power less than 1) are often better-behaved than ordinary metrics. For example, we show that snowflake metrics on finite spaces can be approximated by the average of tree metrics with a distortion bounded by intrinsic geometric characteristics of the space and not the number of points. Many of the metrics for which we characterize the Lipschitz space and its dual are snowflake metrics. We also present applications of the characterization of certain regularity norms to the problem of recovering a matrix that has been corrupted by noise. We are able to achieve an optimal rate of recovery for certain families of matrices by exploiting the relationship between mixed-variable regularity conditions and the decay of a function's coefficients in a certain orthonormal basis.
The behaviour of population in a plasma interacting with an atomic gas
International Nuclear Information System (INIS)
Furukane, Utaro; Oda, Toshiatsu.
1983-01-01
The processes leading to the population inversion are investigated in a recombining hydrogen plasma which is interacting with a cool and dense neutral hydrogen gas by using the rate equations on the basis of the CR model and the energy equation for electrons ions and neutral parlicles. The quasi-steady state approximation are used only for the levels higher than a certain level which is not the first excited level. The calculations have shown that the quasi-steady state cannot be realized while intense energy-flows due to the collisional processes exist between different kinds of the particles such as the electrons and the ions in the plasma and the population inversion is realized only in the quasi-steady state following the transient phase. The effects of the initial conditions of the hydrogen plasma and the introduced neutral hydrogen gas on the overpopulation density are also discussed. (author)
Finite elements and approximation
Zienkiewicz, O C
2006-01-01
A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o
International Nuclear Information System (INIS)
El Sawi, M.
1983-07-01
A simple approach employing properties of solutions of differential equations is adopted to derive an appropriate extension of the WKBJ method. Some of the earlier techniques that are commonly in use are unified, whereby the general approximate solution to a second-order homogeneous linear differential equation is presented in a standard form that is valid for all orders. In comparison to other methods, the present one is shown to be leading in the order of iteration, and thus possibly has the ability of accelerating the convergence of the solution. The method is also extended for the solution of inhomogeneous equations. (author)
Cyclic approximation to stasis
Directory of Open Access Journals (Sweden)
Stewart D. Johnson
2009-06-01
Full Text Available Neighborhoods of points in $mathbb{R}^n$ where a positive linear combination of $C^1$ vector fields sum to zero contain, generically, cyclic trajectories that switch between the vector fields. Such points are called stasis points, and the approximating switching cycle can be chosen so that the timing of the switches exactly matches the positive linear weighting. In the case of two vector fields, the stasis points form one-dimensional $C^1$ manifolds containing nearby families of two-cycles. The generic case of two flows in $mathbb{R}^3$ can be diffeomorphed to a standard form with cubic curves as trajectories.
Approximate Euclidean Ramsey theorems
Directory of Open Access Journals (Sweden)
Adrian Dumitrescu
2011-04-01
Full Text Available According to a classical result of Szemerédi, every dense subset of 1,2,…,N contains an arbitrary long arithmetic progression, if N is large enough. Its analogue in higher dimensions due to Fürstenberg and Katznelson says that every dense subset of {1,2,…,N}d contains an arbitrary large grid, if N is large enough. Here we generalize these results for separated point sets on the line and respectively in the Euclidean space: (i every dense separated set of points in some interval [0,L] on the line contains an arbitrary long approximate arithmetic progression, if L is large enough. (ii every dense separated set of points in the d-dimensional cube [0,L]d in Rd contains an arbitrary large approximate grid, if L is large enough. A further generalization for any finite pattern in Rd is also established. The separation condition is shown to be necessary for such results to hold. In the end we show that every sufficiently large point set in Rd contains an arbitrarily large subset of almost collinear points. No separation condition is needed in this case.
Approximate Bayesian computation.
Directory of Open Access Journals (Sweden)
Mikael Sunnåker
Full Text Available Approximate Bayesian computation (ABC constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology.
The quasilocalized charge approximation
International Nuclear Information System (INIS)
Kalman, G J; Golden, K I; Donko, Z; Hartmann, P
2005-01-01
The quasilocalized charge approximation (QLCA) has been used for some time as a formalism for the calculation of the dielectric response and for determining the collective mode dispersion in strongly coupled Coulomb and Yukawa liquids. The approach is based on a microscopic model in which the charges are quasilocalized on a short-time scale in local potential fluctuations. We review the conceptual basis and theoretical structure of the QLC approach and together with recent results from molecular dynamics simulations that corroborate and quantify the theoretical concepts. We also summarize the major applications of the QLCA to various physical systems, combined with the corresponding results of the molecular dynamics simulations and point out the general agreement and instances of disagreement between the two
Approximate quantum Markov chains
Sutter, David
2018-01-01
This book is an introduction to quantum Markov chains and explains how this concept is connected to the question of how well a lost quantum mechanical system can be recovered from a correlated subsystem. To achieve this goal, we strengthen the data-processing inequality such that it reveals a statement about the reconstruction of lost information. The main difficulty in order to understand the behavior of quantum Markov chains arises from the fact that quantum mechanical operators do not commute in general. As a result we start by explaining two techniques of how to deal with non-commuting matrices: the spectral pinching method and complex interpolation theory. Once the reader is familiar with these techniques a novel inequality is presented that extends the celebrated Golden-Thompson inequality to arbitrarily many matrices. This inequality is the key ingredient in understanding approximate quantum Markov chains and it answers a question from matrix analysis that was open since 1973, i.e., if Lieb's triple ma...
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2012-05-01
Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.
International Conference Approximation Theory XV
Schumaker, Larry
2017-01-01
These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-07
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
Comparative Study of Approximate Multipliers
Masadeh, Mahmoud; Hasan, Osman; Tahar, Sofiene
2018-01-01
Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area and power, makes the identification of the most suitable approximate multiplier quite challenging. In this paper, we identify three major decision making factors for the selection of an approximate multipliers circuit: (1) the type of approximate full adder...
Forms of Approximate Radiation Transport
Brunner, G
2002-01-01
Photon radiation transport is described by the Boltzmann equation. Because this equation is difficult to solve, many different approximate forms have been implemented in computer codes. Several of the most common approximations are reviewed, and test problems illustrate the characteristics of each of the approximations. This document is designed as a tutorial so that code users can make an educated choice about which form of approximate radiation transport to use for their particular simulation.
International Conference Approximation Theory XIV
Schumaker, Larry
2014-01-01
This volume developed from papers presented at the international conference Approximation Theory XIV, held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.
Exact constants in approximation theory
Korneichuk, N
1991-01-01
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base
The tendon approximator device in traumatic injuries.
Forootan, Kamal S; Karimi, Hamid; Forootan, Nazilla-Sadat S
2015-01-01
Precise and tension-free approximation of two tendon endings is the key predictor of outcomes following tendon lacerations and repairs. We evaluate the efficacy of a new tendon approximator device in tendon laceration repairs. In a comparative study, we used our new tendon approximator device in 99 consecutive patients with laceration of 266 tendons who attend a university hospital and evaluated the operative time to repair the tendons, surgeons' satisfaction as well as patient's outcomes in a long-term follow-up. Data were compared with the data of control patients undergoing tendon repair by conventional method. Totally 266 tendons were repaired by approximator device and 199 tendons by conventional technique. 78.7% of patients in first group were male and 21.2% were female. In approximator group 38% of patients had secondary repair of cut tendons and 62% had primary repair. Patients were followed for a mean period of 3years (14-60 months). Time required for repair of each tendon was significantly reduced with the approximator device (2 min vs. 5.5 min, ptendon repair were identical in the two groups and were not significantly different. 1% of tendons in group A and 1.2% in group B had rupture that was not significantly different. The new nerve approximator device is cheap, feasible to use and reduces the time of tendon repair with sustained outcomes comparable to the conventional methods.
Time-dependent distributions in self-quenching nucleation
Shneidman, Vitaly A.
2011-09-01
Diffusion- and interface-limited Becker-Döring (BD) -type nucleation is considered in a closed system, where supersaturation is depleted by growing nuclei. Special focus is on nonadiabatic effects, which become increasingly pronounced for barriers lower than 20-25kBT, and which lead to nucleation rates deviating from their quasi-steady-state (QSS) values. Several essential modifications of the QSS distribution are observed. For example, the front is continuous rather than sharp and has a double-exponential shape, which is in agreement with the earlier matched asymptotic solution obtained in neglect of depletion. The total number of nuclei is larger than predicted by the QSS approximation. The obtained distributions are compared with numerical solutions of the BD equations and can serve as initial conditions for further transition to the Ostwald Ripening stage.
... page: //medlineplus.gov/ency/article/003483.htm Total protein To use the sharing features on this page, please enable JavaScript. The total protein test measures the total amount of two classes ...
Computational topology for approximations of knots
Directory of Open Access Journals (Sweden)
Ji Li
2014-10-01
• a sum of total curvature and derivative. High degree Bézier curves are often used as smooth representations, where computational efficiency is a practical concern. Subdivision can produce PL approximations for a given B\\'ezier curve, fulfilling the above two conditions. The primary contributions are: (i a priori bounds on the number of subdivision iterations sufficient to achieve a PL approximation that is ambient isotopic to the original B\\'ezier curve, and (ii improved iteration bounds over those previously established.
Faster and Simpler Approximation of Stable Matchings
Directory of Open Access Journals (Sweden)
Katarzyna Paluch
2014-04-01
Full Text Available We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.
Approximation by planar elastic curves
DEFF Research Database (Denmark)
Brander, David; Gravesen, Jens; Nørbjerg, Toke Bjerge
2016-01-01
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good initial guess for the approximating curve. A gradient-driven...
Anytime classification by ontology approximation
Schlobach, S.; Blaauw, E.; El Kebir, M.; Ten Teije, A.; Van Harmelen, F.; Bortoli, S.; Hobbelman, M.C.; Millian, K.; Ren, Y.; Stam, S.; Thomassen, P.; Van Het Schip, R.; Van Willigem, W.
2007-01-01
Reasoning with large or complex ontologies is one of the bottle-necks of the Semantic Web. In this paper we present an anytime algorithm for classification based on approximate subsumption. We give the formal definitions for approximate subsumption, and show its monotonicity and soundness; we show
Some results in Diophantine approximation
DEFF Research Database (Denmark)
Pedersen, Steffen Højris
This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...... the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered...... in the formal Laurent series over F3. The first paper is on intrinsic Diophantine approximation in the Cantor set in the formal Laurent series over F3. The summary contains a short motivation, the results of the paper and sketches of the proofs, mainly focusing on the ideas involved. The details of the proofs...
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-08-18
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Approximate Implicitization Using Linear Algebra
Directory of Open Access Journals (Sweden)
Oliver J. D. Barrowclough
2012-01-01
Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.
Rollout sampling approximate policy iteration
Dimitrakakis, C.; Lagoudakis, M.G.
2008-01-01
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a
Shearlets and Optimally Sparse Approximations
DEFF Research Database (Denmark)
Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q
2012-01-01
of such functions. Recently, cartoon-like images were introduced in 2D and 3D as a suitable model class, and approximation properties were measured by considering the decay rate of the $L^2$ error of the best $N$-term approximation. Shearlet systems are to date the only representation system, which provide...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....
Mathematical algorithms for approximate reasoning
Murphy, John H.; Chay, Seung C.; Downs, Mary M.
1988-01-01
Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away
Tel, G.
We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of
'LTE-diffusion approximation' for arc calculations
International Nuclear Information System (INIS)
Lowke, J J; Tanaka, M
2006-01-01
This paper proposes the use of the 'LTE-diffusion approximation' for predicting the properties of electric arcs. Under this approximation, local thermodynamic equilibrium (LTE) is assumed, with a particular mesh size near the electrodes chosen to be equal to the 'diffusion length', based on D e /W, where D e is the electron diffusion coefficient and W is the electron drift velocity. This approximation overcomes the problem that the equilibrium electrical conductivity in the arc near the electrodes is almost zero, which makes accurate calculations using LTE impossible in the limit of small mesh size, as then voltages would tend towards infinity. Use of the LTE-diffusion approximation for a 200 A arc with a thermionic cathode gives predictions of total arc voltage, electrode temperatures, arc temperatures and radial profiles of heat flux density and current density at the anode that are in approximate agreement with more accurate calculations which include an account of the diffusion of electric charges to the electrodes, and also with experimental results. Calculations, which include diffusion of charges, agree with experimental results of current and heat flux density as a function of radius if the Milne boundary condition is used at the anode surface rather than imposing zero charge density at the anode
Approximate number sense theory or approximate theory of magnitude?
Content, Alain; Velde, Michael Vande; Adriano, Andrea
2017-01-01
Leibovich et al. argue that the evidence in favor of a perceptual mechanism devoted to the extraction of numerosity from visual collections is unsatisfactory and propose to replace it with an unspecific mechanism capturing approximate magnitudes from continuous dimensions. We argue that their representation of the evidence is incomplete and that their theoretical proposal is too vague to be useful.
Approximate Matching of Hierarchial Data
DEFF Research Database (Denmark)
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...
Approximations to camera sensor noise
Jin, Xiaodan; Hirakawa, Keigo
2013-02-01
Noise is present in all image sensor data. Poisson distribution is said to model the stochastic nature of the photon arrival process, while it is common to approximate readout/thermal noise by additive white Gaussian noise (AWGN). Other sources of signal-dependent noise such as Fano and quantization also contribute to the overall noise profile. Question remains, however, about how best to model the combined sensor noise. Though additive Gaussian noise with signal-dependent noise variance (SD-AWGN) and Poisson corruption are two widely used models to approximate the actual sensor noise distribution, the justification given to these types of models are based on limited evidence. The goal of this paper is to provide a more comprehensive characterization of random noise. We concluded by presenting concrete evidence that Poisson model is a better approximation to real camera model than SD-AWGN. We suggest further modification to Poisson that may improve the noise model.
Face Recognition using Approximate Arithmetic
DEFF Research Database (Denmark)
Marso, Karol
Face recognition is image processing technique which aims to identify human faces and found its use in various diﬀerent ﬁelds for example in security. Throughout the years this ﬁeld evolved and there are many approaches and many diﬀerent algorithms which aim to make the face recognition as eﬀective...... as possible. The use of diﬀerent approaches such as neural networks and machine learning can lead to fast and eﬃcient solutions however, these solutions are expensive in terms of hardware resources and power consumption. A possible solution to this problem can be use of approximate arithmetic. In many image...... processing applications the results do not need to be completely precise and use of the approximate arithmetic can lead to reduction in terms of delay, space and power consumption. In this paper we examine possible use of approximate arithmetic in face recognition using Eigenfaces algorithm....
Diophantine approximation and Dirichlet series
Queffélec, Hervé
2013-01-01
This self-contained book will benefit beginners as well as researchers. It is devoted to Diophantine approximation, the analytic theory of Dirichlet series, and some connections between these two domains, which often occur through the Kronecker approximation theorem. Accordingly, the book is divided into seven chapters, the first three of which present tools from commutative harmonic analysis, including a sharp form of the uncertainty principle, ergodic theory and Diophantine approximation to be used in the sequel. A presentation of continued fraction expansions, including the mixing property of the Gauss map, is given. Chapters four and five present the general theory of Dirichlet series, with classes of examples connected to continued fractions, the famous Bohr point of view, and then the use of random Dirichlet series to produce non-trivial extremal examples, including sharp forms of the Bohnenblust-Hille theorem. Chapter six deals with Hardy-Dirichlet spaces, which are new and useful Banach spaces of anal...
Approximate reasoning in physical systems
International Nuclear Information System (INIS)
Mutihac, R.
1991-01-01
The theory of fuzzy sets provides excellent ground to deal with fuzzy observations (uncertain or imprecise signals, wavelengths, temperatures,etc.) fuzzy functions (spectra and depth profiles) and fuzzy logic and approximate reasoning. First, the basic ideas of fuzzy set theory are briefly presented. Secondly, stress is put on application of simple fuzzy set operations for matching candidate reference spectra of a spectral library to an unknown sample spectrum (e.g. IR spectroscopy). Thirdly, approximate reasoning is applied to infer an unknown property from information available in a database (e.g. crystal systems). Finally, multi-dimensional fuzzy reasoning techniques are suggested. (Author)
Owens, Tom
2006-01-01
This article presents an interview with James Howe, author of "The Misfits" and "Totally Joe". In this interview, Howe discusses tolerance, diversity and the parallels between his own life and his literature. Howe's four books in addition to "The Misfits" and "Totally Joe" and his list of recommended books with lesbian, gay, bisexual, transgender,…
Approximations to the Newton potential
International Nuclear Information System (INIS)
Warburton, A.E.A.; Hatfield, R.W.
1977-01-01
Explicit expressions are obtained for Newton's (Newton, R.G., J. Math. Phys., 3:75-82 (1962)) solution to the inverse scattering problem in the approximations where up to two phase shifts are treated exactly and the rest to first order. (author)
Approximation properties of haplotype tagging
Directory of Open Access Journals (Sweden)
Dreiseitl Stephan
2006-01-01
Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.
Approximate Reanalysis in Topology Optimization
DEFF Research Database (Denmark)
Amir, Oded; Bendsøe, Martin P.; Sigmund, Ole
2009-01-01
In the nested approach to structural optimization, most of the computational effort is invested in the solution of the finite element analysis equations. In this study, the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures...
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and
APPROXIMATE MODELS FOR FLOOD ROUTING
African Journals Online (AJOL)
kinematic model and a nonlinear convection-diffusion model are extracted from a normalized form of the St. Venant equations, and applied to ... normal ﬂow condition is moderate. Keywords: approximate models, nonlinear kinematic ... The concern here is with the movement of an abnormal amount of water along a river or ...
On badly approximable complex numbers
DEFF Research Database (Denmark)
Esdahl-Schou, Rune; Kristensen, S.
We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...
Rational approximation of vertical segments
Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte
2007-08-01
In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.
All-Norm Approximation Algorithms
Azar, Yossi; Epstein, Leah; Richter, Yossi; Woeginger, Gerhard J.; Penttonen, Martti; Meineche Schmidt, Erik
2002-01-01
A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different ℓ p norms. We address this problem by introducing the concept of an All-norm ρ-approximation
Approximate Reasoning with Fuzzy Booleans
van den Broek, P.M.; Noppen, J.A.R.
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp
Hydrogen: Beyond the Classic Approximation
International Nuclear Information System (INIS)
Scivetti, Ivan
2003-01-01
The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position
Hydrogen Beyond the Classic Approximation
Scivetti, I
2003-01-01
The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position
Good points for diophantine approximation
Indian Academy of Sciences (India)
n=1 of real numbers in the interval [0, 1) and a sequence. (δn)∞ n=1 of positive numbers tending to zero, we consider the size of the set of numbers in [0, 1] which can be 'well approximated' by terms of the first sequence, namely, those y ∈ [0, 1] for which the inequality |y − xn| < δn holds for infinitely many positive integers n ...
Dimensionality Reduction with Adaptive Approximation
Kokiopoulou, Effrosyni; Frossard, Pascal
2007-01-01
In this paper, we propose the use of (adaptive) nonlinear approximation for dimensionality reduction. In particular, we propose a dimensionality reduction method for learning a parts based representation of signals using redundant dictionaries. A redundant dictionary is an overcomplete set of basis vectors that spans the signal space. The signals are jointly represented in a common subspace extracted from the redundant dictionary, using greedy pursuit algorithms for simultaneous sparse approx...
Ultrafast approximation for phylogenetic bootstrap.
Minh, Bui Quang; Nguyen, Minh Anh Thi; von Haeseler, Arndt
2013-05-01
Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and the Shimodaira-Hasegawa-like approximate likelihood ratio test have been introduced to speed up the bootstrap. Here, we suggest an ultrafast bootstrap approximation approach (UFBoot) to compute the support of phylogenetic groups in maximum likelihood (ML) based trees. To achieve this, we combine the resampling estimated log-likelihood method with a simple but effective collection scheme of candidate trees. We also propose a stopping rule that assesses the convergence of branch support values to automatically determine when to stop collecting candidate trees. UFBoot achieves a median speed up of 3.1 (range: 0.66-33.3) to 10.2 (range: 1.32-41.4) compared with RAxML RBS for real DNA and amino acid alignments, respectively. Moreover, our extensive simulations show that UFBoot is robust against moderate model violations and the support values obtained appear to be relatively unbiased compared with the conservative standard bootstrap. This provides a more direct interpretation of the bootstrap support. We offer an efficient and easy-to-use software (available at http://www.cibiv.at/software/iqtree) to perform the UFBoot analysis with ML tree inference.
Initially Approximated Quasi Equilibrium Manifold
International Nuclear Information System (INIS)
Shahzad, M.; Arif, H.; Gulistan, M.; Sajid, M.
2015-01-01
Most commonly, kinetics model reduction techniques are based on exploiting time scale separation into fast and slow reaction processes. Then, a researcher approximates the system dynamically with dimension reduction for slow ones eliminating the fast modes. The main idea behind the construction of the lower dimension manifold is based on finding its initial approximation using Quasi Equilibrium Manifold (QEM). Here, we provide an efficient numerical method, which allow us to calculate low dimensional manifolds of chemical reaction systems. This computation technique is not restricted to our specific complex problem, but it can also be applied to other reacting flows or dynamic systems provided with the condition that a large number of extra (decaying) components can be eliminated from the system. Through computational approach, we approximate low dimensional manifold for a mechanism of six chemical species to simplify complex chemical kinetics. A reduced descriptive form of slow invariant manifold is obtained from dissipative system. This method is applicable for higher dimensions and is applied over an oxidation of CO/Pt. (author)
Approximate Inference for Wireless Communications
DEFF Research Database (Denmark)
Hansen, Morten
to the optimal one, which usually requires an unacceptable high complexity. Some of the treated approximate methods are based on QL-factorization of the channel matrix. In the work presented in this thesis it is proven how the QL-factorization of frequency-selective channels asymptotically provides the minimum......-phase and all-pass filters. This enables us to view Sphere Detection (SD) as an adaptive variant of minimum-phase prefiltered reduced-state sequence estimation. Thus, a novel way of computing the minimum-phase filter and its associated all-pass filter using the numerically stable QL-factorization is suggested...
Generalized Gradient Approximation Made Simple
International Nuclear Information System (INIS)
Perdew, J.P.; Burke, K.; Ernzerhof, M.
1996-01-01
Generalized gradient approximations (GGA close-quote s) for the exchange-correlation energy improve upon the local spin density (LSD) description of atoms, molecules, and solids. We present a simple derivation of a simple GGA, in which all parameters (other than those in LSD) are fundamental constants. Only general features of the detailed construction underlying the Perdew-Wang 1991 (PW91) GGA are invoked. Improvements over PW91 include an accurate description of the linear response of the uniform electron gas, correct behavior under uniform scaling, and a smoother potential. copyright 1996 The American Physical Society
Wavelet Approximation in Data Assimilation
Tangborn, Andrew; Atlas, Robert (Technical Monitor)
2002-01-01
Estimation of the state of the atmosphere with the Kalman filter remains a distant goal because of high computational cost of evolving the error covariance for both linear and nonlinear systems. Wavelet approximation is presented here as a possible solution that efficiently compresses both global and local covariance information. We demonstrate the compression characteristics on the the error correlation field from a global two-dimensional chemical constituent assimilation, and implement an adaptive wavelet approximation scheme on the assimilation of the one-dimensional Burger's equation. In the former problem, we show that 99%, of the error correlation can be represented by just 3% of the wavelet coefficients, with good representation of localized features. In the Burger's equation assimilation, the discrete linearized equations (tangent linear model) and analysis covariance are projected onto a wavelet basis and truncated to just 6%, of the coefficients. A nearly optimal forecast is achieved and we show that errors due to truncation of the dynamics are no greater than the errors due to covariance truncation.
Plasma Physics Approximations in Ares
International Nuclear Information System (INIS)
Managan, R. A.
2015-01-01
Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, Fn( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.
Approximation by double Walsh polynomials
Directory of Open Access Journals (Sweden)
Ferenc Móricz
1992-01-01
Full Text Available We study the rate of approximation by rectangular partial sums, Cesàro means, and de la Vallée Poussin means of double Walsh-Fourier series of a function in a homogeneous Banach space X. In particular, X may be Lp(I2, where 1≦p<∞ and I2=[0,1×[0,1, or CW(I2, the latter being the collection of uniformly W-continuous functions on I2. We extend the results by Watari, Fine, Yano, Jastrebova, Bljumin, Esfahanizadeh and Siddiqi from univariate to multivariate cases. As by-products, we deduce sufficient conditions for convergence in Lp(I2-norm and uniform convergence on I2 as well as characterizations of Lipschitz classes of functions. At the end, we raise three problems.
Approximating the minimum cycle mean
Directory of Open Access Journals (Sweden)
Krishnendu Chatterjee
2013-07-01
Full Text Available We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1 First we show that the algorithmic question is reducible in O(n^2 time to the problem of a logarithmic number of min-plus matrix multiplications of n-by-n matrices, where n is the number of vertices of the graph. (2 Second, when the weights are nonnegative, we present the first (1 + ε-approximation algorithm for the problem and the running time of our algorithm is ilde(O(n^ω log^3(nW/ε / ε, where O(n^ω is the time required for the classic n-by-n matrix multiplication and W is the maximum value of the weights.
Nonlinear approximation with dictionaries I. Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2004-01-01
We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation w...
Directory of Open Access Journals (Sweden)
Lopez Moris E
2016-06-01
Full Text Available Total thyroidectomy is a surgery that removes all the thyroid tissue from the patient. The suspect of cancer in a thyroid nodule is the most frequent indication and it is presume when previous fine needle puncture is positive or a goiter has significant volume increase or symptomes. Less frequent indications are hyperthyroidism when it is refractory to treatment with Iodine 131 or it is contraindicated, and in cases of symptomatic thyroiditis. The thyroid gland has an important anatomic relation whith the inferior laryngeal nerve and the parathyroid glands, for this reason it is imperative to perform extremely meticulous dissection to recognize each one of these elements and ensure their preservation. It is also essential to maintain strict hemostasis, in order to avoid any postoperative bleeding that could lead to a suffocating neck hematoma, feared complication that represents a surgical emergency and endangers the patient’s life.It is essential to run a formal technique, without skipping steps, and maintain prudence and patience that should rule any surgical act.
Compound Poisson Approximations for Sums of Random Variables
Serfozo, Richard F.
1986-01-01
We show that a sum of dependent random variables is approximately compound Poisson when the variables are rarely nonzero and, given they are nonzero, their conditional distributions are nearly identical. We give several upper bounds on the total-variation distance between the distribution of such a sum and a compound Poisson distribution. Included is an example for Markovian occurrences of a rare event. Our bounds are consistent with those that are known for Poisson approximations for sums of...
Approximation properties of fine hyperbolic graphs
Indian Academy of Sciences (India)
is called the metric invariant translation approximation property for a countable dis- crete metric space. Moreover ... Uniform Roe algebras; fine hyperbolic graph; metric invariant translation approximation property. ..... ate Studies in Mathematics, Volume 88 (2008) (Rhode Island: American Mathematical. Society Providence).
Approximate Uniqueness Estimates for Singular Correlation Matrices.
Finkbeiner, C. T.; Tucker, L. R.
1982-01-01
The residual variance is often used as an approximation to the uniqueness in factor analysis. An upper bound approximation to the residual variance is presented for the case when the correlation matrix is singular. (Author/JKS)
Reduction of Linear Programming to Linear Approximation
Vaserstein, Leonid N.
2006-01-01
It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.
HE11 radiation patterns and gaussian approximations
International Nuclear Information System (INIS)
Rebuffi, L.; Crenn, J.P.
1986-12-01
The possibility of approximating the HE11 radiation pattern with a Gaussian distribution is presented. A numerical comparison between HE11 far-field theoretical patterns and Abrams and Crenn approximations permits an evaluation of the validity of these two approximations. A new numerically optimized HE11 Gaussian approximation for the far-field, extended to great part of the near field, has been found. In particular, the value given for the beam radius at the waist, has been demonstrated to give the best HE11 Gaussian approximation in the far-field. The Crenn approximation is found to be very close to this optimal approximation, while the Abrams approximation is shown to be less precise. Universal curves for intensity, amplitude and power distribution are given for the HE11 radiated mode. These results are of interest for laser waveguide applications and for plasma ECRH transmission systems
Analytical approximations of Chandrasekhar's H-Function
International Nuclear Information System (INIS)
Simovic, R.; Vukanic, J.
1995-01-01
Analytical approximations of Chandrasekhar's H-function are derived in this paper by using ordinary and modified DPN methods. The accuracy of the approximations is discussed and the energy dependent albedo problem is treated. (author)
Axiomatic Characterizations of IVF Rough Approximation Operators
Directory of Open Access Journals (Sweden)
Guangji Yu
2014-01-01
Full Text Available This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.
Truth Approximation, Social Epistemology, and Opinion Dynamics
Douven, Igor; Kelp, Christoph
This paper highlights some connections between work on truth approximation and work in social epistemology, in particular work on peer disagreement. In some of the literature on truth approximation, questions have been addressed concerning the efficiency of research strategies for approximating the
Operator approximant problems arising from quantum theory
Maher, Philip J
2017-01-01
This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.
Approximate Nearest Neighbor Queries among Parallel Segments
DEFF Research Database (Denmark)
Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias
2010-01-01
We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...
International Nuclear Information System (INIS)
Jiang, R.
2009-01-01
It is difficult to find the optimal solution of the sequential age replacement policy for a finite-time horizon. This paper presents an accurate approximation to find an approximate optimal solution of the sequential replacement policy. The proposed approximation is computationally simple and suitable for any failure distribution. Their accuracy is illustrated by two examples. Based on the approximate solution, an approximate estimate for the total cost is derived.
Nonlinear approximation with dictionaries I. Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2004-01-01
We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation...... with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...... that assuming a certain structure of the dictionary is sufficient and (almost) necessary to obtain stronger results. We give examples of classical dictionaries in L^p spaces and modulation spaces where our results recover some known Jackson type estimates, and discuss som new estimates they provide....
Nonlinear approximation with dictionaries, I: Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
We study various approximation classes associated with $m$-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best $m$-term approximation is compared to new classes defined by considering $m......$-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space......, and we prove that assuming a certain structure of the dictionary is sufficient and (almost) necessary to obtain stronger results. We give examples of classical dictionaries in $L^p$ spaces and modulation spaces where our results recover some known Jackson type estimates, and discuss som new estimates...
Bounded-Degree Approximations of Stochastic Networks
Energy Technology Data Exchange (ETDEWEB)
Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar
2017-06-01
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.
Mapping moveout approximations in TI media
Stovas, Alexey
2013-11-21
Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.
Approximate models for broken clouds in stochastic radiative transfer theory
International Nuclear Information System (INIS)
Doicu, Adrian; Efremenko, Dmitry S.; Loyola, Diego; Trautmann, Thomas
2014-01-01
This paper presents approximate models in stochastic radiative transfer theory. The independent column approximation and its modified version with a solar source computed in a full three-dimensional atmosphere are formulated in a stochastic framework and for arbitrary cloud statistics. The nth-order stochastic models describing the independent column approximations are equivalent to the nth-order stochastic models for the original radiance fields in which the gradient vectors are neglected. Fast approximate models are further derived on the basis of zeroth-order stochastic models and the independent column approximation. The so-called “internal mixing” models assume a combination of the optical properties of the cloud and the clear sky, while the “external mixing” models assume a combination of the radiances corresponding to completely overcast and clear skies. A consistent treatment of internal and external mixing models is provided, and a new parameterization of the closure coefficient in the effective thickness approximation is given. An efficient computation of the closure coefficient for internal mixing models, using a previously derived vector stochastic model as a reference, is also presented. Equipped with appropriate look-up tables for the closure coefficient, these models can easily be integrated into operational trace gas retrieval systems that exploit absorption features in the near-IR solar spectrum. - Highlights: • Independent column approximation in a stochastic setting. • Fast internal and external mixing models for total and diffuse radiances. • Efficient optimization of internal mixing models to match reference models
Multilevel Monte Carlo in Approximate Bayesian Computation
Jasra, Ajay
2017-02-13
In the following article we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.
Approximate unitary equivalence of normaloid type operators
Zhu, Sen
2015-01-01
In this paper, we explore approximate unitary equivalence of normaloid operators and classify several normaloid type operators including transaloid operators, polynomial-normaloid operators and von Neumann operators up to approximate unitary equivalence. As an application, we explore approximation of transaloid operators with closed numerical ranges. Among other things, it is proved that those transaloid operators with closed numerical ranges are norm dense in the class of transaloid operators.
Uniform analytic approximation of Wigner rotation matrices
Hoffmann, Scott E.
2018-02-01
We derive the leading asymptotic approximation, for low angle θ, of the Wigner rotation matrix elements, dm1m2 j(θ ) , uniform in j, m1, and m2. The result is in terms of a Bessel function of integer order. We numerically investigate the error for a variety of cases and find that the approximation can be useful over a significant range of angles. This approximation has application in the partial wave analysis of wavepacket scattering.
A Note on Generalized Approximation Property
Directory of Open Access Journals (Sweden)
Antara Bhar
2013-01-01
Full Text Available We introduce a notion of generalized approximation property, which we refer to as --AP possessed by a Banach space , corresponding to an arbitrary Banach sequence space and a convex subset of , the class of bounded linear operators on . This property includes approximation property studied by Grothendieck, -approximation property considered by Sinha and Karn and Delgado et al., and also approximation property studied by Lissitsin et al. We characterize a Banach space having --AP with the help of -compact operators, -nuclear operators, and quasi--nuclear operators. A particular case for ( has also been characterized.
Local density approximations for relativistic exchange energies
International Nuclear Information System (INIS)
MacDonald, A.H.
1986-01-01
The use of local density approximations to approximate exchange interactions in relativistic electron systems is reviewed. Particular attention is paid to the physical content of these exchange energies by discussing results for the uniform relativistic electron gas from a new point of view. Work on applying these local density approximations in atoms and solids is reviewed and it is concluded that good accuracy is usually possible provided self-interaction corrections are applied. The local density approximations necessary for spin-polarized relativistic systems are discussed and some new results are presented
Approximate maximum parsimony and ancestral maximum likelihood.
Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat
2010-01-01
We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.
Severe accident recriticality analyses (SARA)
DEFF Research Database (Denmark)
Frid, W.; Højerup, C.F.; Lindholm, I.
2001-01-01
Recriticality in a BWR during reflooding of an overheated partly degraded core, i.e. with relocated control rods, has been studied for a total loss of electric power accident scenario. In order to assess the impact of recriticality on reactor safety, including accident management strategies......, the following issues have been investigated in the SARA project: (1) the energy deposition in the fuel during super-prompt power burst; (2) the quasi steady-state reactor power following the initial power burst; and (3) containment response to elevated quasi steady-state reactor power. The approach was to use......, which results in large energy deposition in the fuel during power burst in some accident scenarios. The highest value, 418 cal g(-1), was obtained with SIMULATE-3K for an Oskarshamn 3 case with reflooding rate of 2000 kg s(-1). In most cases, however, the predicted energy deposition was smaller, below...
Non-Linear Approximation of Bayesian Update
Litvinenko, Alexander
2016-06-23
We develop a non-linear approximation of expensive Bayesian formula. This non-linear approximation is applied directly to Polynomial Chaos Coefficients. In this way, we avoid Monte Carlo sampling and sampling error. We can show that the famous Kalman Update formula is a particular case of this update.
Diagonal Pade approximations for initial value problems
International Nuclear Information System (INIS)
Reusch, M.F.; Ratzan, L.; Pomphrey, N.; Park, W.
1987-06-01
Diagonal Pade approximations to the time evolution operator for initial value problems are applied in a novel way to the numerical solution of these problems by explicitly factoring the polynomials of the approximation. A remarkable gain over conventional methods in efficiency and accuracy of solution is obtained. 20 refs., 3 figs., 1 tab
Simultaneous approximation in scales of Banach spaces
International Nuclear Information System (INIS)
Bramble, J.H.; Scott, R.
1978-01-01
The problem of verifying optimal approximation simultaneously in different norms in a Banach scale is reduced to verification of optimal approximation in the highest order norm. The basic tool used is the Banach space interpolation method developed by Lions and Peetre. Applications are given to several problems arising in the theory of finite element methods
Approximation properties of fine hyperbolic graphs
Indian Academy of Sciences (India)
2016-08-26
Aug 26, 2016 ... In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable discrete metric space. Moreover, we use ... Department of Applied Mathematics, Shanghai Finance University, Shanghai 201209, People's Republic of China ...
Nonlinear approximation with general wave packets
DEFF Research Database (Denmark)
Borup, Lasse; Nielsen, Morten
2005-01-01
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete...
Quirks of Stirling's Approximation
Macrae, Roderick M.; Allgeier, Benjamin M.
2013-01-01
Stirling's approximation to ln "n"! is typically introduced to physical chemistry students as a step in the derivation of the statistical expression for the entropy. However, naive application of this approximation leads to incorrect conclusions. In this article, the problem is first illustrated using a familiar "toy…
On approximating multi-criteria TSP
Manthey, Bodo; Albers, S.; Marion, J.-Y.
2009-01-01
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized
On approximating multi-criteria TSP
Manthey, Bodo
We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multicriteria maximum traveling salesman problems (Max-TSP). For multicriteria Max-STSP where the edge weights have to be
Boundary Value Problems and Approximate Solutions ...
African Journals Online (AJOL)
In this paper, we discuss about some basic things of boundary value problems. Secondly, we study boundary conditions involving derivatives and obtain finite difference approximations of partial derivatives of boundary value problems. The last section is devoted to determine an approximate solution for boundary value ...
Polynomial approximation approach to transient heat conduction ...
African Journals Online (AJOL)
This work reports polynomial approximation approach to transient heat conduction in a long slab, long cylinder and sphere with linear internal heat generation. It has been shown that the polynomial approximation method is able to calculate average temperature as a function of time for higher value of Biot numbers.
Approximation algorithms for guarding holey polygons ...
African Journals Online (AJOL)
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum number of guards to cover the edges of a polygon. This problem is NP-hard, and to our knowledge there are approximation algorithms just for simple polygons. In this paper we present two approximation algorithms for guarding ...
Similarity based approximate reasoning: fuzzy control
Raha, S.; Hossain, A.; Ghosh, S.
2008-01-01
This paper presents an approach to similarity based approximate reasoning that elucidates the connection between similarity and existing approaches to inference in approximate reasoning methodology. A set of axioms is proposed to get a reasonable measure of similarity between two fuzzy sets. The
Approximal caries and sugar consumption in Icelandic teenagers.
Arnadóttir, I B; Rozier, R G; Saemundsson, S R; Sigurjóns, H; Holbrook, W P
1998-04-01
The aim of this study, conducted in 1994, was to examine the association between approximal caries and sugar consumption in teenagers residing in three fluoride-deficient areas in Iceland while controlling for a number of behavioral, residential and microbiological factors. One hundred and fifty subjects (mean age 14 years) selected from the Icelandic Nutritional Survey (INS) were examined radiographically and they completed questionnaires about sugar consumption frequency. Total grams of sugar intake were obtained from the INS for each subject. Caries experience on approximal surfaces, diagnosed from radiographs, was used as the dependent variable in the analyses. Altogether 45.2% of subjects were caries free on approximal surfaces. The overall sample was found to have a mean DFS on approximal surfaces of 2.73 (s=4.36) per subject. Average daily total sugar intake was 170 g per subject and the mean number of sugar-eating occasions between meals was 5.32 (s=6.29) per subject. The regression model indicated that the frequency of between-meal sugar consumption was associated with approximal caries, with frequency of candy consumption being the most important of the sugar variables. In multivariate analysis, no relationship was found between dental caries and total daily intake of sugar, although a significant relationship between total sugar consumption and presence of caries was seen in bivariate analysis. Between-meal consumption of sugar remains a risk factor for the occurrence of dental caries, especially in populations with moderate-to-high levels of dental caries experience.
Improved Dutch Roll Approximation for Hypersonic Vehicle
Directory of Open Access Journals (Sweden)
Liang-Liang Yin
2014-06-01
Full Text Available An improved dutch roll approximation for hypersonic vehicle is presented. From the new approximations, the dutch roll frequency is shown to be a function of the stability axis yaw stability and the dutch roll damping is mainly effected by the roll damping ratio. In additional, an important parameter called roll-to-yaw ratio is obtained to describe the dutch roll mode. Solution shows that large-roll-to-yaw ratio is the generate character of hypersonic vehicle, which results the large error for the practical approximation. Predictions from the literal approximations derived in this paper are compared with actual numerical values for s example hypersonic vehicle, results show the approximations work well and the error is below 10 %.
Approximate error conjugation gradient minimization methods
Kallman, Jeffrey S
2013-05-21
In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.
Hardness and Approximation for Network Flow Interdiction
Chestnut, Stephen R.; Zenklusen, Rico
2015-01-01
In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network Flow Interdiction would imply an $n^{o(1)}...
Regression with Sparse Approximations of Data
DEFF Research Database (Denmark)
Noorzad, Pardis; Sturm, Bob L.
2012-01-01
We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected...... by a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...
Approximately Liner Phase IIR Digital Filter Banks
Directory of Open Access Journals (Sweden)
J. D. Ćertić
2013-11-01
Full Text Available In this paper, uniform and nonuniform digital filter banks based on approximately linear phase IIR filters and frequency response masking technique (FRM are presented. Both filter banks are realized as a connection of an interpolated half-band approximately linear phase IIR filter as a first stage of the FRM design and an appropriate number of masking filters. The masking filters are half-band IIR filters with an approximately linear phase. The resulting IIR filter banks are compared with linear-phase FIR filter banks exhibiting similar magnitude responses. The effects of coefficient quantization are analyzed.
Mathematical analysis, approximation theory and their applications
Gupta, Vijay
2016-01-01
Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.
Approximation of the semi-infinite interval
Directory of Open Access Journals (Sweden)
A. McD. Mercer
1980-01-01
Full Text Available The approximation of a function f∈C[a,b] by Bernstein polynomials is well-known. It is based on the binomial distribution. O. Szasz has shown that there are analogous approximations on the interval [0,∞ based on the Poisson distribution. Recently R. Mohapatra has generalized Szasz' result to the case in which the approximating function is αe−ux∑k=N∞(uxkα+β−1Γ(kα+βf(kαuThe present note shows that these results are special cases of a Tauberian theorem for certain infinite series having positive coefficients.
Pion-nucleus cross sections approximation
International Nuclear Information System (INIS)
Barashenkov, V.S.; Polanski, A.; Sosnin, A.N.
1990-01-01
Analytical approximation of pion-nucleus elastic and inelastic interaction cross-section is suggested, with could be applied in the energy range exceeding several dozens of MeV for nuclei heavier than beryllium. 3 refs.; 4 tabs
Square well approximation to the optical potential
International Nuclear Information System (INIS)
Jain, A.K.; Gupta, M.C.; Marwadi, P.R.
1976-01-01
Approximations for obtaining T-matrix elements for a sum of several potentials in terms of T-matrices for individual potentials are studied. Based on model calculations for S-wave for a sum of two separable non-local potentials of Yukawa type form factors and a sum of two delta function potentials, it is shown that the T-matrix for a sum of several potentials can be approximated satisfactorily over all the energy regions by the sum of T-matrices for individual potentials. Based on this, an approximate method for finding T-matrix for any local potential by approximating it by a sum of suitable number of square wells is presented. This provides an interesting way to calculate the T-matrix for any arbitary potential in terms of Bessel functions to a good degree of accuracy. The method is applied to the Saxon-Wood potentials and good agreement with exact results is found. (author)
Seismic wave extrapolation using lowrank symbol approximation
Fomel, Sergey
2012-04-30
We consider the problem of constructing a wave extrapolation operator in a variable and possibly anisotropic medium. Our construction involves Fourier transforms in space combined with the help of a lowrank approximation of the space-wavenumber wave-propagator matrix. A lowrank approximation implies selecting a small set of representative spatial locations and a small set of representative wavenumbers. We present a mathematical derivation of this method, a description of the lowrank approximation algorithm and numerical examples that confirm the validity of the proposed approach. Wave extrapolation using lowrank approximation can be applied to seismic imaging by reverse-time migration in 3D heterogeneous isotropic or anisotropic media. © 2012 European Association of Geoscientists & Engineers.
Steepest descent approximations for accretive operator equations
International Nuclear Information System (INIS)
Chidume, C.E.
1993-03-01
A necessary and sufficient condition is established for the strong convergence of the steepest descent approximation to a solution of equations involving quasi-accretive operators defined on a uniformly smooth Banach space. (author). 49 refs
Degree of Approximation and Green Potential
Directory of Open Access Journals (Sweden)
M. Simkani
2009-03-01
Full Text Available We will relate the degree of rational approximation of a meromorphic function f to the minimum value, on the natural boundary of f, of Green potential of the weak∗ limit of the normalized pole-counting measures
Low Rank Approximation Algorithms, Implementation, Applications
Markovsky, Ivan
2012-01-01
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...
Methods of Fourier analysis and approximation theory
Tikhonov, Sergey
2016-01-01
Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.
APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION
Directory of Open Access Journals (Sweden)
Mădălina Roxana Buneci
2016-12-01
Full Text Available The purpose of this paper is provide a set of Maple procedures to construct approximate developments of a general surface of revolution generalizing the well-known gore method for sphere
An overview on Approximate Bayesian computation*
Directory of Open Access Journals (Sweden)
Baragatti Meïli
2014-01-01
Full Text Available Approximate Bayesian computation techniques, also called likelihood-free methods, are one of the most satisfactory approach to intractable likelihood problems. This overview presents recent results since its introduction about ten years ago in population genetics.
Approximation for the adjoint neutron spectrum
International Nuclear Information System (INIS)
Suster, Luis Carlos; Martinez, Aquilino Senra; Silva, Fernando Carvalho da
2002-01-01
The proposal of this work is the determination of an analytical approximation which is capable to reproduce the adjoint neutron flux for the energy range of the narrow resonances (NR). In a previous work we developed a method for the calculation of the adjoint spectrum which was calculated from the adjoint neutron balance equations, that were obtained by the collision probabilities method, this method involved a considerable quantity of numerical calculation. In the analytical method some approximations were done, like the multiplication of the escape probability in the fuel by the adjoint flux in the moderator, and after these approximations, taking into account the case of the narrow resonances, were substituted in the adjoint neutron balance equation for the fuel, resulting in an analytical approximation for the adjoint flux. The results obtained in this work were compared to the results generated with the reference method, which demonstrated a good and precise results for the adjoint neutron flux for the narrow resonances. (author)
TMB: Automatic differentiation and laplace approximation
DEFF Research Database (Denmark)
Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte
2016-01-01
are automatically integrated out. This approximation, and its derivatives, are obtained using automatic differentiation (up to order three) of the joint likelihood. The computations are designed to be fast for problems with many random effects (approximate to 10(6)) and parameters (approximate to 10...... computations. The user defines the joint likelihood for the data and the random effects as a C++ template function, while all the other operations are done in R; e.g., reading in the data. The package evaluates and maximizes the Laplace approximation of the marginal likelihood where the random effects......(3)). Computation times using ADMB and TMB are compared on a suite of examples ranging from simple models to large spatial models where the random effects are a Gaussian random field. Speedups ranging from 1.5 to about 100 are obtained with increasing gains for large problems...
Approximations of Stochastic Partial Differential Equations
Di Nunno, Giulia; Zhang, Tusheng
2014-01-01
In this paper we show that solutions of stochastic partial differ- ential equations driven by Brownian motion can be approximated by stochastic partial differential equations forced by pure jump noise/random kicks. Applications to stochastic Burgers equations are discussed.
Saddlepoint approximation methods in financial engineering
Kwok, Yue Kuen
2018-01-01
This book summarizes recent advances in applying saddlepoint approximation methods to financial engineering. It addresses pricing exotic financial derivatives and calculating risk contributions to Value-at-Risk and Expected Shortfall in credit portfolios under various default correlation models. These standard problems involve the computation of tail probabilities and tail expectations of the corresponding underlying state variables. The text offers in a single source most of the saddlepoint approximation results in financial engineering, with different sets of ready-to-use approximation formulas. Much of this material may otherwise only be found in original research publications. The exposition and style are made rigorous by providing formal proofs of most of the results. Starting with a presentation of the derivation of a variety of saddlepoint approximation formulas in different contexts, this book will help new researchers to learn the fine technicalities of the topic. It will also be valuable to quanti...
Energy Technology Data Exchange (ETDEWEB)
Lorenzini, R.; Passoni, L. [ENEA, Centro Ricerche Ezio Clementel, Bologna (Italy). Dipt. Ambiente
1999-07-01
The integration of ordinary differential equations systems (ODEs) is of significant concern to tropospheric and stratospheric chemistry modelers. The solution of the ODEs requires a large computational effort because of their stiff nature; in a three-dimensional photochemical model the solution of the ODEs required at least 70% of the total CPU time. Several numerical integration techniques exist which attempt to provide accurate and computationally efficient solutions. In this work it is presented a comparison of some of the techniques in terms of solution accuracy and required computational time. It has been compared the Hybrid Solver (Young and Boris, 1977), the Quasi Steady-State Approximation method (Hesstvedt et al., 1978) and the Chemical Solver for Ordinary Differential Equations (Aro, 1996), by using the CALGRID photochemical model. The accuracy is evaluated by comparing the results of every method with the solutions obtained by the Livermore Solver for Ordinary Differential Equations (Hindmarsh, 1980). The comparison has been made varing the parameters of the error tolerances, and taking into account the trade-off between solution accuracy and computational efficiency. [Italian] L'integrazione di sistemi di equazioni differenziali ordinarie (ODEs), e' un problema significativo per i modellisti della chimica troposferica e stratosferica. A causa della loro natura stiff la soluzione degli ODEs richiese un notevole sforzo computazionale; in un modello fotochimico tridimensionale la soluzione degli ODEs richiede almeno il 70% del tempo totale di CPU. Esistono diverse tecniche di integrazione numerica che possono fornire soluzioni accurate e computazionalmente efficienti: in questo lavoro presentiamo un confronto fra alcune tecniche in termini di accuratezza della soluzione e tempo computazionale richiesto. Si sono confrontati il Solver Ibrido (Young and Boris, 1977), il metodo Quasi Steady-State Approximation (Hesstvedt et al., 1978) ed il Chemical
Approximative solutions of stochastic optimization problem
Czech Academy of Sciences Publication Activity Database
Lachout, Petr
2010-01-01
Roč. 46, č. 3 (2010), s. 513-523 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539 Institutional research plan: CEZ:AV0Z10750506 Keywords : Stochastic optimization problem * sensitivity * approximative solution Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf
Nonlinear approximation with nonstationary Gabor frames
DEFF Research Database (Denmark)
Ottosen, Emil Solsbæk; Nielsen, Morten
2018-01-01
We consider sparseness properties of adaptive time-frequency representations obtained using nonstationary Gabor frames (NSGFs). NSGFs generalize classical Gabor frames by allowing for adaptivity in either time or frequency. It is known that the concept of painless nonorthogonal expansions...... resolution. Based on this characterization we prove an upper bound on the approximation error occurring when thresholding the coefficients of the corresponding frame expansions. We complement the theoretical results with numerical experiments, estimating the rate of approximation obtained from thresholding...
Lattice quantum chromodynamics with approximately chiral fermions
Energy Technology Data Exchange (ETDEWEB)
Hierl, Dieter
2008-05-15
In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the {theta}{sup +} pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)
On surface approximation using developable surfaces
DEFF Research Database (Denmark)
Chen, H. Y.; Lee, I. K.; Leopoldseder, s.
1999-01-01
We introduce a method for approximating a given surface by a developable surface. It will be either a G(1) surface consisting of pieces of cones or cylinders of revolution or a G(r) NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produ...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding. (C) 1999 Academic Press....
On surface approximation using developable surfaces
DEFF Research Database (Denmark)
Chen, H. Y.; Lee, I. K.; Leopoldseder, S.
1998-01-01
We introduce a method for approximating a given surface by a developable surface. It will be either a G_1 surface consisting of pieces of cones or cylinders of revolution or a G_r NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding....
Lattice quantum chromodynamics with approximately chiral fermions
International Nuclear Information System (INIS)
Hierl, Dieter
2008-05-01
In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the Θ + pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)
Nonlinear Stochastic PDEs: Analysis and Approximations
2016-05-23
Approximation to Nonlinear SPDEs with Discrete Random Variables , SIAM J Scientific Computing, (08 2015): 1872. doi: R. Mikulevicius, B. Rozovskii. On...multiplicative discrete random variables , ( ) S. Lototsky, B. Rozovsky. Stochastic Partial Differential Equations, (09 2015) B. Rozovsky, R...B. Rozovsky and G.E. Karniadakis, "Adaptive Wick-Malliavin approximation to nonlinear SPDEs with discrete random variables ," SIAM J. Sci. Comput., 37
Polynomial approximation of functions in Sobolev spaces
International Nuclear Information System (INIS)
Dupont, T.; Scott, R.
1980-01-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomical plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces
Approximation properties ofλ-Bernstein operators.
Cai, Qing-Bo; Lian, Bo-Yong; Zhou, Guorong
2018-01-01
In this paper, we introduce a new type λ -Bernstein operators with parameter [Formula: see text], we investigate a Korovkin type approximation theorem, establish a local approximation theorem, give a convergence theorem for the Lipschitz continuous functions, we also obtain a Voronovskaja-type asymptotic formula. Finally, we give some graphs and numerical examples to show the convergence of [Formula: see text] to [Formula: see text], and we see that in some cases the errors are smaller than [Formula: see text] to f .
Rough Sets Approximations for Learning Outcomes
Encheva, Sylvia; Tumin, Sharil
Discovering dependencies between students' responses and their level of mastering of a particular skill is very important in the process of developing intelligent tutoring systems. This work is an approach to attain a higher level of certainty while following students' learning progress. Rough sets approximations are applied for assessing students understanding of a concept. Consecutive responses from each individual learner to automated tests are placed in corresponding rough sets approximations. The resulting path provides strong indication about the current level of learning outcomes.
Approximations for the Erlang Loss Function
DEFF Research Database (Denmark)
Mejlbro, Leif
1998-01-01
Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error <1E-2, and methods are indicated for improving this bound.......Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error
Approximating centrality in evolving graphs: toward sublinearity
Priest, Benjamin W.; Cybenko, George
2017-05-01
The identification of important nodes is a ubiquitous problem in the analysis of social networks. Centrality indices (such as degree centrality, closeness centrality, betweenness centrality, PageRank, and others) are used across many domains to accomplish this task. However, the computation of such indices is expensive on large graphs. Moreover, evolving graphs are becoming increasingly important in many applications. It is therefore desirable to develop on-line algorithms that can approximate centrality measures using memory sublinear in the size of the graph. We discuss the challenges facing the semi-streaming computation of many centrality indices. In particular, we apply recent advances in the streaming and sketching literature to provide a preliminary streaming approximation algorithm for degree centrality utilizing CountSketch and a multi-pass semi-streaming approximation algorithm for closeness centrality leveraging a spanner obtained through iteratively sketching the vertex-edge adjacency matrix. We also discuss possible ways forward for approximating betweenness centrality, as well as spectral measures of centrality. We provide a preliminary result using sketched low-rank approximations to approximate the output of the HITS algorithm.
Stability Analysis of Discontinuous Galerkin Approximations to the Elastodynamics Problem
Antonietti, Paola F.
2015-11-21
We consider semi-discrete discontinuous Galerkin approximations of both displacement and displacement-stress formulations of the elastodynamics problem. We prove the stability analysis in the natural energy norm and derive optimal a-priori error estimates. For the displacement-stress formulation, schemes preserving the total energy of the system are introduced and discussed. We verify our theoretical estimates on two and three dimensions test problems.
The Grammar of Approximating Number Pairs
Eriksson, Kimmo; Bailey, Drew H.; Geary, David C.
2009-01-01
We studied approximating pairs of numbers (a, b) used to estimate quantity in a single phrase (“two, three years ago”). Pollmann and Jansen (1996) found that only a few of the many possible pairs are actually used, suggesting an interaction between the ways in which people estimate quantity and their use of quantitative phrases in colloquial speech. They proposed a set of rules that describe which approximating pairs are used in Dutch phrases. We revisit this issue in an analysis of Swedish and American language corpora and in a series of three experiments in which Swedish and American adults rated the acceptability of various approximating pairs, and created approximating pairs of their own in response to various estimation tasks. We find evidence for Pollmann’s and Jansen’s rules in both Swedish and English phrases, but also identify additional rules and substantial individual and cross-language variation. We discuss implications for the origin of this loose “grammar” of approximating pairs. PMID:20234023
Approximate Bayesian evaluations of measurement uncertainty
Possolo, Antonio; Bodnar, Olha
2018-04-01
The Guide to the Expression of Uncertainty in Measurement (GUM) includes formulas that produce an estimate of a scalar output quantity that is a function of several input quantities, and an approximate evaluation of the associated standard uncertainty. This contribution presents approximate, Bayesian counterparts of those formulas for the case where the output quantity is a parameter of the joint probability distribution of the input quantities, also taking into account any information about the value of the output quantity available prior to measurement expressed in the form of a probability distribution on the set of possible values for the measurand. The approximate Bayesian estimates and uncertainty evaluations that we present have a long history and illustrious pedigree, and provide sufficiently accurate approximations in many applications, yet are very easy to implement in practice. Differently from exact Bayesian estimates, which involve either (analytical or numerical) integrations, or Markov Chain Monte Carlo sampling, the approximations that we describe involve only numerical optimization and simple algebra. Therefore, they make Bayesian methods widely accessible to metrologists. We illustrate the application of the proposed techniques in several instances of measurement: isotopic ratio of silver in a commercial silver nitrate; odds of cryptosporidiosis in AIDS patients; height of a manometer column; mass fraction of chromium in a reference material; and potential-difference in a Zener voltage standard.
Semiclassical initial value approximation for Green's function.
Kay, Kenneth G
2010-06-28
A semiclassical initial value approximation is obtained for the energy-dependent Green's function. For a system with f degrees of freedom the Green's function expression has the form of a (2f-1)-dimensional integral over points on the energy surface and an integral over time along classical trajectories initiated from these points. This approximation is derived by requiring an integral ansatz for Green's function to reduce to Gutzwiller's semiclassical formula when the integrations are performed by the stationary phase method. A simpler approximation is also derived involving only an (f-1)-dimensional integral over momentum variables on a Poincare surface and an integral over time. The relationship between the present expressions and an earlier initial value approximation for energy eigenfunctions is explored. Numerical tests for two-dimensional systems indicate that good accuracy can be obtained from the initial value Green's function for calculations of autocorrelation spectra and time-independent wave functions. The relative advantages of initial value approximations for the energy-dependent Green's function and the time-dependent propagator are discussed.
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-10-01
The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.
The grammar of approximating number pairs.
Eriksson, Kimmo; Bailey, Drew H; Geary, David C
2010-04-01
In the present article, we studied approximating pairs of numbers (a, b) that were used to estimate quantity in a single phrase ("two, three years ago"). Pollmann and Jansen (1996) found that only a few of the many possible pairs are actually used, suggesting an interaction between the ways in which people estimate quantity and their use of quantitative phrases in colloquial speech. They proposed a set of rules that describe which approximating pairs are used in Dutch phrases. We revisited this issue in an analysis of Swedish and American language corpora and in a series of three experiments in which Swedish and American adults rated the acceptability of various approximating pairs and created approximating pairs of their own in response to various estimation tasks. We found evidence for Pollmann and Jansen's rules in both Swedish and English phrases, but we also identified additional rules and substantial individual and cross-language variation. We will discuss implications for the origin of this loose "grammar" of approximating pairs.
Multilevel weighted least squares polynomial approximation
Haji-Ali, Abdul-Lateef
2017-06-30
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.
Numerical approximation of partial differential equations
Bartels, Sören
2016-01-01
Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular ...
Fast wavelet based sparse approximate inverse preconditioner
Energy Technology Data Exchange (ETDEWEB)
Wan, W.L. [Univ. of California, Los Angeles, CA (United States)
1996-12-31
Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.
Piecewise-Cubic Approximation in Autotracking Mode
Dikoussar, N D
2004-01-01
A method for piecewise-cubic approximation within the frame of four-point transforms is proposed. The knots of the segments are detected in autotracking mode using a digitized curve. A three-point cubic parametric spline (TPS) is used as a model of a local approximant. A free parameter $\\theta$ (a coefficient at $x^{3}$) is found in a line following mode, using step-by-step averaging. A formula for expression of the free parameter via a length of the segment and values of a function and derivatives in joining points is received. The $C^{1}$-smoothness depends on the accuracy of the $\\theta$-estimate. The stability of the method w.r.t. input errors is shown as well. The key parameters of the approximation are: the parameters of the basic functions, the variance of the input errors, and a sampling step. The efficiency of the method is shown by numerical calculations on test examples.
On transparent potentials: a Born approximation study
International Nuclear Information System (INIS)
Coudray, C.
1980-01-01
In the frame of the scattering inverse problem at fixed energy, a class of potentials transparent in Born approximation is obtained. All these potentials are spherically symmetric and are oscillating functions of the reduced radial variable. Amongst them, the Born approximation of the transparent potential of the Newton-Sabatier method is found. In the same class, quasi-transparent potentials are exhibited. Very general features of potentials transparent in Born approximation are then stated. And bounds are given for the exact scattering amplitudes corresponding to most of the potentials previously exhibited. These bounds, obtained at fixed energy, and for large values of the angular momentum, are found to be independent on the energy
The adiabatic approximation in multichannel scattering
International Nuclear Information System (INIS)
Schulte, A.M.
1978-01-01
Using two-dimensional models, an attempt has been made to get an impression of the conditions of validity of the adiabatic approximation. For a nucleon bound to a rotating nucleus the Coriolis coupling is neglected and the relation between this nuclear Coriolis coupling and the classical Coriolis force has been examined. The approximation for particle scattering from an axially symmetric rotating nucleus based on a short duration of the collision, has been combined with an approximation based on the limitation of angular momentum transfer between particle and nucleus. Numerical calculations demonstrate the validity of the new combined method. The concept of time duration for quantum mechanical collisions has also been studied, as has the collective description of permanently deformed nuclei. (C.F.)
The binary collision approximation: Background and introduction
International Nuclear Information System (INIS)
Robinson, M.T.
1992-08-01
The binary collision approximation (BCA) has long been used in computer simulations of the interactions of energetic atoms with solid targets, as well as being the basis of most analytical theory in this area. While mainly a high-energy approximation, the BCA retains qualitative significance at low energies and, with proper formulation, gives useful quantitative information as well. Moreover, computer simulations based on the BCA can achieve good statistics in many situations where those based on full classical dynamical models require the most advanced computer hardware or are even impracticable. The foundations of the BCA in classical scattering are reviewed, including methods of evaluating the scattering integrals, interaction potentials, and electron excitation effects. The explicit evaluation of time at significant points on particle trajectories is discussed, as are scheduling algorithms for ordering the collisions in a developing cascade. An approximate treatment of nearly simultaneous collisions is outlined and the searching algorithms used in MARLOWE are presented
Minimal entropy approximation for cellular automata
International Nuclear Information System (INIS)
Fukś, Henryk
2014-01-01
We present a method for the construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for the construction of approximate orbits, at the heart of which is the iteration of finite-dimensional maps, called minimal entropy maps. We present numerical evidence that the minimal entropy approximation sometimes outperforms the local structure theory in characterizing the properties of cellular automata. The density response curve for elementary CA rule 26 is used to illustrate this claim. (paper)
APPROXIMATE INTEGRATION OF HIGHLY OSCILLATING FUNCTIONS
Directory of Open Access Journals (Sweden)
I. N. Melashko
2017-01-01
Full Text Available Elementary approximate formulae for numerical integration of functions containing oscillating factors of a special form with a parameter have been proposed in the paper. In this case general quadrature formulae can be used only at sufficiently small values of the parameter. Therefore, it is necessary to consider in advance presence of strongly oscillating factors in order to obtain formulae for numerical integration which are suitable in the case when the parameter is changing within wide limits. This can be done by taking into account such factors as weighting functions. Moreover, since the parameter can take values which cannot always be predicted in advance, approximate formulae for calculation of such integrals should be constructed in such a way that they contain this parameter in a letter format and they are suitable for calculation at any and particularly large values of the parameter. Computational rules with such properties are generally obtained by dividing an interval of integration into elementary while making successive approximation of the integral density at each elementary interval with polynomials of the first, second and third degrees and taking the oscillating factors as weighting functions. The paper considers the variant when density of the integrals at each elementary interval is approximated by a polynomial of zero degree that is a constant which is equal to the value of density in the middle of the interval. At the same time one approximate formula for calculation of an improper integral with infinite interval of the function with oscillating factor of a special type has been constructed in the paper. In this case it has been assumed that density of the improper integral rather quickly goes to zero when an argument module is increasing indefinitely. In other words it is considered as small to negligible outside some finite interval. Uniforms in parameter used for evaluation of errors in approximate formulae have been
Stopping Rules for Linear Stochastic Approximation
Wada, Takayuki; Itani, Takamitsu; Fujisaki, Yasumasa
Stopping rules are developed for stochastic approximation which is an iterative method for solving an unknown equation based on its consecutive residuals corrupted by additive random noise. It is assumed that the equation is linear and the noise is independent and identically distributed random vectors with zero mean and a bounded covariance. Then, the number of iterations for achieving a given probabilistic accuracy of the resultant solution is derived, which gives a rigorous stopping rule for the stochastic approximation. This number is polynomial of the problem size.
On the dipole approximation with error estimates
Boßmann, Lea; Grummt, Robert; Kolb, Martin
2018-01-01
The dipole approximation is employed to describe interactions between atoms and radiation. It essentially consists of neglecting the spatial variation of the external field over the atom. Heuristically, this is justified by arguing that the wavelength is considerably larger than the atomic length scale, which holds under usual experimental conditions. We prove the dipole approximation in the limit of infinite wavelengths compared to the atomic length scale and estimate the rate of convergence. Our results include N-body Coulomb potentials and experimentally relevant electromagnetic fields such as plane waves and laser pulses.
Static correlation beyond the random phase approximation
DEFF Research Database (Denmark)
Olsen, Thomas; Thygesen, Kristian Sommer
2014-01-01
derived from Hedin's equations (Random Phase Approximation (RPA), Time-dependent Hartree-Fock (TDHF), Bethe-Salpeter equation (BSE), and Time-Dependent GW) all reproduce the correct dissociation limit. We also show that the BSE improves the correlation energies obtained within RPA and TDHF significantly...... for intermediate binding distances. A Hubbard model for the dimer allows us to obtain exact analytical results for the various approximations, which is readily compared with the exact diagonalization of the model. Moreover, the model is shown to reproduce all the qualitative results from the ab initio calculations...
An approximate analytical approach to resampling averages
DEFF Research Database (Denmark)
Malzahn, Dorthe; Opper, M.
2004-01-01
Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach for appr......Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach...
APPROXIMATION OF PROBABILITY DISTRIBUTIONS IN QUEUEING MODELS
Directory of Open Access Journals (Sweden)
T. I. Aliev
2013-03-01
Full Text Available For probability distributions with variation coefficient, not equal to unity, mathematical dependences for approximating distributions on the basis of first two moments are derived by making use of multi exponential distributions. It is proposed to approximate distributions with coefficient of variation less than unity by using hypoexponential distribution, which makes it possible to generate random variables with coefficient of variation, taking any value in a range (0; 1, as opposed to Erlang distribution, having only discrete values of coefficient of variation.
Approximate Controllability of Fractional Integrodifferential Evolution Equations
Directory of Open Access Journals (Sweden)
R. Ganesh
2013-01-01
Full Text Available This paper addresses the issue of approximate controllability for a class of control system which is represented by nonlinear fractional integrodifferential equations with nonlocal conditions. By using semigroup theory, p-mean continuity and fractional calculations, a set of sufficient conditions, are formulated and proved for the nonlinear fractional control systems. More precisely, the results are established under the assumption that the corresponding linear system is approximately controllable and functions satisfy non-Lipschitz conditions. The results generalize and improve some known results.
Approximated Fractional Order Chebyshev Lowpass Filters
Directory of Open Access Journals (Sweden)
Todd Freeborn
2015-01-01
Full Text Available We propose the use of nonlinear least squares optimization to approximate the passband ripple characteristics of traditional Chebyshev lowpass filters with fractional order steps in the stopband. MATLAB simulations of (1+α, (2+α, and (3+α order lowpass filters with fractional steps from α = 0.1 to α = 0.9 are given as examples. SPICE simulations of 1.2, 1.5, and 1.8 order lowpass filters using approximated fractional order capacitors in a Tow-Thomas biquad circuit validate the implementation of these filter circuits.
Approximate Inference and Deep Generative Models
CERN. Geneva
2018-01-01
Advances in deep generative models are at the forefront of deep learning research because of the promise they offer for allowing data-efficient learning, and for model-based reinforcement learning. In this talk I'll review a few standard methods for approximate inference and introduce modern approximations which allow for efficient large-scale training of a wide variety of generative models. Finally, I'll demonstrate several important application of these models to density estimation, missing data imputation, data compression and planning.
Approximation result toward nearest neighbor heuristic
Directory of Open Access Journals (Sweden)
Monnot Jér"me
2002-01-01
Full Text Available In this paper, we revisit the famous heuristic called nearest neighbor (N N for the traveling salesman problem under maximization and minimization goal. We deal with variants where the edge costs belong to interval Ša;taĆ for a>0 and t>1, which certainly corresponds to practical cases of these problems. We prove that NN is a (t+1/2t-approximation for maxTSPŠa;taĆ and a 2/(t+1-approximation for minTSPŠa;taĆ under the standard performance ratio. Moreover, we show that these ratios are tight for some instances.
Radiation forces in the discrete dipole approximation
Hoekstra, A.G.; Frijlink, M.O.; Waters, L.B.F.M.; Sloot, P.M.A.
2001-01-01
The theory of the discrete-dipole approximation (DDA) for light scattering is extended to allow for the calculation of radiation forces on each dipole in the DDA model. Starting with the theory of Draine and Weingartner [Astrophys. J. 470, 551 (1996)] we derive an expression for the radiation force
Perturbation of operators and approximation of spectrum
Indian Academy of Sciences (India)
The pure linear algebraic approach is the main advantage of the results here. Keywords. Operator .... The paper is organized as follows. In §2, the approximation results are extended to the case of a one-parameter norm continuous family of operators. In §3, the spectral gap prediction results are proved with some examples.
Isotopic Approximation of Implicit Curves and Surfaces
Plantinga, Simon; Vegter, Gert
2004-01-01
Implicit surfaces are defined as the zero set of a function F: R3 → R. Although several algorithms exist for generating piecewise linear approximations, most of them are based on a user-defined stepsize or bounds to indicate the precision, and therefore cannot guarantee topological correctness.
A rational approximation of the effectiveness factor
DEFF Research Database (Denmark)
Wedel, Stig; Luss, Dan
1980-01-01
A fast, approximate method of calculating the effectiveness factor for arbitrary rate expressions is presented. The method does not require any iterative or interpolative calculations. It utilizes the well known asymptotic behavior for small and large Thiele moduli to derive a rational function w...
An approximate analytical approach to resampling averages
DEFF Research Database (Denmark)
Malzahn, Dorthe; Opper, M.
2004-01-01
Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach for appr...
Approximate solutions to variational inequalities and applications
Directory of Open Access Journals (Sweden)
M. Beatrice Lignola
1994-11-01
Full Text Available The aim of this paper is to investigate two concepts of approximate solutions to parametric variational inequalities in topological vector spaces for which the corresponding solution map is closed graph and/or lower semicontinuous and to apply the results to the stability of optimization problems with variational inequality constrains.
Nanostructures: Scattering beyond the Born approximation
Grigoriev, S.V.; Syromyatnikov, A. V.; Chumakov, A. P.; Grigoryeva, N.A.; Napolskii, K.S.; Roslyakov, I. V.; Eliseev, A.A.; Petukhov, A.V.; Eckerlebe, H.
2010-01-01
The neutron scattering on a two-dimensional ordered nanostructure with the third nonperiodic dimension can go beyond the Born approximation. In our model supported by the exact theoretical solution a well-correlated hexagonal porous structure of anodic aluminum oxide films acts as a peculiar
Large hierarchies from approximate R symmetries
International Nuclear Information System (INIS)
Kappl, Rolf; Ratz, Michael; Vaudrevange, Patrick K.S.
2008-12-01
We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales. (orig.)
Approximability and Parameterized Complexity of Minmax Values
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt; Hansen, Thomas Dueholm; Miltersen, Peter Bro
2008-01-01
We consider approximating the minmax value of a multi player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ε log n digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand......, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quasi-polynomial time. We consider the parameterized complexity of the problem, with the parameter being the number of pure strategies k of the player for which the minmax value is computed. We show...... that if there are three players, k = 2 and there are only two possible rational payoffs, the minmax value is a rational number and can be computed exactly in linear time. In the general case, we show that the value can be approximated wigh any polynomial number of digits of accuracy in time n^O(k) . On the other hand, we...
An Approximate Bayesian Fundamental Frequency Estimator
DEFF Research Database (Denmark)
Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt
2012-01-01
Joint fundamental frequency and model order estimation is an important problem in several applications such as speech and music processing. In this paper, we develop an approximate estimation algorithm of these quantities using Bayesian inference. The inference about the fundamental frequency...
Pade approximant calculations for neutron escape probability
International Nuclear Information System (INIS)
El Wakil, S.A.; Saad, E.A.; Hendi, A.A.
1984-07-01
The neutron escape probability from a non-multiplying slab containing internal source is defined in terms of a functional relation for the scattering function for the diffuse reflection problem. The Pade approximant technique is used to get numerical results which compare with exact results. (author)
Uniform semiclassical approximation for absorptive scattering systems
International Nuclear Information System (INIS)
Hussein, M.S.; Pato, M.P.
1987-07-01
The uniform semiclassical approximation of the elastic scattering amplitude is generalized to absorptive systems. An integral equation is derived which connects the absorption modified amplitude to the absorption free one. Division of the amplitude into a diffractive and refractive components is then made possible. (Author) [pt
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-11-30
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Nonlinear approximation with dictionaries. II. Inverse Estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2006-01-01
In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block...
Nonlinear approximation with dictionaries,.. II: Inverse estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for separated decomposable dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually...
Generalized Lower and Upper Approximations in Quantales
Directory of Open Access Journals (Sweden)
Qimei Xiao
2012-01-01
Full Text Available We introduce the concepts of set-valued homomorphism and strong set-valued homomorphism of a quantale which are the extended notions of congruence and complete congruence, respectively. The properties of generalized lower and upper approximations, constructed by a set-valued mapping, are discussed.
Uncertainty relations for approximation and estimation
Energy Technology Data Exchange (ETDEWEB)
Lee, Jaeha, E-mail: jlee@post.kek.jp [Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Tsutsui, Izumi, E-mail: izumi.tsutsui@kek.jp [Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Theory Center, Institute of Particle and Nuclear Studies, High Energy Accelerator Research Organization (KEK), 1-1 Oho, Tsukuba, Ibaraki 305-0801 (Japan)
2016-05-27
We present a versatile inequality of uncertainty relations which are useful when one approximates an observable and/or estimates a physical parameter based on the measurement of another observable. It is shown that the optimal choice for proxy functions used for the approximation is given by Aharonov's weak value, which also determines the classical Fisher information in parameter estimation, turning our inequality into the genuine Cramér–Rao inequality. Since the standard form of the uncertainty relation arises as a special case of our inequality, and since the parameter estimation is available as well, our inequality can treat both the position–momentum and the time–energy relations in one framework albeit handled differently. - Highlights: • Several inequalities interpreted as uncertainty relations for approximation/estimation are derived from a single ‘versatile inequality’. • The ‘versatile inequality’ sets a limit on the approximation of an observable and/or the estimation of a parameter by another observable. • The ‘versatile inequality’ turns into an elaboration of the Robertson–Kennard (Schrödinger) inequality and the Cramér–Rao inequality. • Both the position–momentum and the time–energy relation are treated in one framework. • In every case, Aharonov's weak value arises as a key geometrical ingredient, deciding the optimal choice for the proxy functions.
An approximate classical unimolecular reaction rate theory
Zhao, Meishan; Rice, Stuart A.
1992-05-01
We describe a classical theory of unimolecular reaction rate which is derived from the analysis of Davis and Gray by use of simplifying approximations. These approximations concern the calculation of the locations of, and the fluxes of phase points across, the bottlenecks to fragmentation and to intramolecular energy transfer. The bottleneck to fragment separation is represented as a vibration-rotation state dependent separatrix, which approximation is similar to but extends and improves the approximations for the separatrix introduced by Gray, Rice, and Davis and by Zhao and Rice. The novel feature in our analysis is the representation of the bottlenecks to intramolecular energy transfer as dividing surfaces in phase space; the locations of these dividing surfaces are determined by the same conditions as locate the remnants of robust tori with frequency ratios related to the golden mean (in a two degree of freedom system these are the cantori). The flux of phase points across each dividing surface is calculated with an analytic representation instead of a stroboscopic mapping. The rate of unimolecular reaction is identified with the net rate at which phase points escape from the region of quasiperiodic bounded motion to the region of free fragment motion by consecutively crossing the dividing surfaces for intramolecular energy exchange and the separatrix. This new theory generates predictions of the rates of predissociation of the van der Waals molecules HeI2, NeI2 and ArI2 which are in very good agreement with available experimental data.
Markov operators, positive semigroups and approximation processes
Altomare, Francesco; Leonessa, Vita; Rasa, Ioan
2015-01-01
In recent years several investigations have been devoted to the study of large classes of (mainly degenerate) initial-boundary value evolution problems in connection with the possibility to obtain a constructive approximation of the associated positive C_0-semigroups. In this research monograph we present the main lines of a theory which finds its root in the above-mentioned research field.
Orthorhombic rational approximants for decagonal quasicrystals
Indian Academy of Sciences (India)
Unknown
An important exercise in the study of rational approximants is to derive their metric, especially in relation to the corresponding quasicrystal or the underlying clusters. Kuo's model has ..... the smaller diagonal of the fat rhombus in the Penrose tiling. This length scale is obtained by a section along a1 in the Penrose tiling and ...
Uncertainty relations for approximation and estimation
International Nuclear Information System (INIS)
Lee, Jaeha; Tsutsui, Izumi
2016-01-01
We present a versatile inequality of uncertainty relations which are useful when one approximates an observable and/or estimates a physical parameter based on the measurement of another observable. It is shown that the optimal choice for proxy functions used for the approximation is given by Aharonov's weak value, which also determines the classical Fisher information in parameter estimation, turning our inequality into the genuine Cramér–Rao inequality. Since the standard form of the uncertainty relation arises as a special case of our inequality, and since the parameter estimation is available as well, our inequality can treat both the position–momentum and the time–energy relations in one framework albeit handled differently. - Highlights: • Several inequalities interpreted as uncertainty relations for approximation/estimation are derived from a single ‘versatile inequality’. • The ‘versatile inequality’ sets a limit on the approximation of an observable and/or the estimation of a parameter by another observable. • The ‘versatile inequality’ turns into an elaboration of the Robertson–Kennard (Schrödinger) inequality and the Cramér–Rao inequality. • Both the position–momentum and the time–energy relation are treated in one framework. • In every case, Aharonov's weak value arises as a key geometrical ingredient, deciding the optimal choice for the proxy functions.
Approximation properties of fine hyperbolic graphs
Indian Academy of Sciences (India)
groups have invariant translation approximation property (ITAP, see Definition 2.2). He also pointed out that there was no serious difficulty in extending the main theorem to fine hyperbolic graphs, but he did not outline the proof. So in this paper, we first give a proof for this extension, see Theorem 1.1 below. Then we define ...
Approximate Dynamic Programming by Practical Examples
Mes, Martijn R.K.; Perez Rivera, Arturo Eduardo; Boucherie, Richard; van Dijk, Nico M.
2017-01-01
Computing the exact solution of an MDP model is generally difficult and possibly intractable for realistically sized problem instances. A powerful technique to solve the large scale discrete time multistage stochastic control processes is Approximate Dynamic Programming (ADP). Although ADP is used
Approximation Algorithms for Model-Based Diagnosis
Feldman, A.B.
2010-01-01
Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components (diagnoses) that explain the observed behavior, according to some minimality criterion. This thesis presents greedy approximation
Quasilinear theory without the random phase approximation
International Nuclear Information System (INIS)
Weibel, E.S.; Vaclavik, J.
1980-08-01
The system of quasilinear equations is derived without making use of the random phase approximation. The fluctuating quantities are described by the autocorrelation function of the electric field using the techniques of Fourier analysis. The resulting equations posses the necessary conservation properties, but comprise new terms which hitherto have been lost in the conventional derivations
Statistical model semiquantitatively approximates arabinoxylooligosaccharides' structural diversity
DEFF Research Database (Denmark)
Dotsenko, Gleb; Nielsen, Michael Krogsgaard; Lange, Lene
2016-01-01
(wheat flour arabinoxylan (arabinose/xylose, A/X = 0.47); grass arabinoxylan (A/X = 0.24); wheat straw arabinoxylan (A/X = 0.15); and hydrothermally pretreated wheat straw arabinoxylan (A/X = 0.05)), is semiquantitatively approximated using the proposed model. The suggested approach can be applied...
Upper Bounds on Numerical Approximation Errors
DEFF Research Database (Denmark)
Raahauge, Peter
2004-01-01
This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function...
Multi-Interpretation Operators and Approximate Classification
Engelfriet, J.; Treur, J.
2003-01-01
In this paper non-classical logical techniques are introduced to formalize the analysis of multi-interpretable observation information, in particular in approximate classification processes where information on attributes of an object is to be inferred on the basis of observable properties of the
Approximate Furthest Neighbor in High Dimensions
DEFF Research Database (Denmark)
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen
2015-01-01
-dimensional Euclidean space. We build on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk’s approximation factor and reducing the running time by a logarithmic factor. We also present a variation...
Padé approximations and diophantine geometry.
Chudnovsky, D V; Chudnovsky, G V
1985-04-01
Using methods of Padé approximations we prove a converse to Eisenstein's theorem on the boundedness of denominators of coefficients in the expansion of an algebraic function, for classes of functions, parametrized by meromorphic functions. This result is applied to the Tate conjecture on the effective description of isogenies for elliptic curves.
tt in the soft-gluon approximation
Indian Academy of Sciences (India)
April 2002 physics pp. 575–590. QCD corrections to decay-lepton polar and azimuthal angular distributions in ee+ee- t t in the soft-gluon approximation. SAURABH D RINDANI ... accurate determination of its couplings will have to await the construction of a linear e ·e collider. ..... is the azimuthal angle of the l· momentum.
Stability of approximate factorization with $ heta $-methods
W. Hundsdorfer (Willem)
1997-01-01
textabstractApproximate factorization seems for certain problems a viable alternative to time splitting. Since a splitting error is avoided, accuracy will in general be favourable compared to time splitting methods. However, it is not clear to what extent stability is affected by factorization.
Decision-theoretic troubleshooting: Hardness of approximation
Czech Academy of Sciences Publication Activity Database
Lín, Václav
2014-01-01
Roč. 55, č. 4 (2014), s. 977-988 ISSN 0888-613X R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : Decision-theoretic troubleshooting * Hardness of approximation * NP-completeness Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.451, year: 2014
Comparison of Two Approaches to Approximated Reasoning
van den Broek, P.M.; Wagenknecht, Michael; Hampel, Rainer
A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compositional rule of inference. It is shown that the approaches are not equivalent. A correspondence between the approaches is
Lognormal Approximations of Fault Tree Uncertainty Distributions.
El-Shanawany, Ashraf Ben; Ardron, Keith H; Walker, Simon P
2018-01-26
Fault trees are used in reliability modeling to create logical models of fault combinations that can lead to undesirable events. The output of a fault tree analysis (the top event probability) is expressed in terms of the failure probabilities of basic events that are input to the model. Typically, the basic event probabilities are not known exactly, but are modeled as probability distributions: therefore, the top event probability is also represented as an uncertainty distribution. Monte Carlo methods are generally used for evaluating the uncertainty distribution, but such calculations are computationally intensive and do not readily reveal the dominant contributors to the uncertainty. In this article, a closed-form approximation for the fault tree top event uncertainty distribution is developed, which is applicable when the uncertainties in the basic events of the model are lognormally distributed. The results of the approximate method are compared with results from two sampling-based methods: namely, the Monte Carlo method and the Wilks method based on order statistics. It is shown that the closed-form expression can provide a reasonable approximation to results obtained by Monte Carlo sampling, without incurring the computational expense. The Wilks method is found to be a useful means of providing an upper bound for the percentiles of the uncertainty distribution while being computationally inexpensive compared with full Monte Carlo sampling. The lognormal approximation method and Wilks's method appear attractive, practical alternatives for the evaluation of uncertainty in the output of fault trees and similar multilinear models. © 2018 Society for Risk Analysis.
Dentate Gyrus circuitry features improve performance of sparse approximation algorithms.
Directory of Open Access Journals (Sweden)
Panagiotis C Petrantonakis
Full Text Available Memory-related activity in the Dentate Gyrus (DG is characterized by sparsity. Memory representations are seen as activated neuronal populations of granule cells, the main encoding cells in DG, which are estimated to engage 2-4% of the total population. This sparsity is assumed to enhance the ability of DG to perform pattern separation, one of the most valuable contributions of DG during memory formation. In this work, we investigate how features of the DG such as its excitatory and inhibitory connectivity diagram can be used to develop theoretical algorithms performing Sparse Approximation, a widely used strategy in the Signal Processing field. Sparse approximation stands for the algorithmic identification of few components from a dictionary that approximate a certain signal. The ability of DG to achieve pattern separation by sparsifing its representations is exploited here to improve the performance of the state of the art sparse approximation algorithm "Iterative Soft Thresholding" (IST by adding new algorithmic features inspired by the DG circuitry. Lateral inhibition of granule cells, either direct or indirect, via mossy cells, is shown to enhance the performance of the IST. Apart from revealing the potential of DG-inspired theoretical algorithms, this work presents new insights regarding the function of particular cell types in the pattern separation task of the DG.
Counting independent sets using the Bethe approximation
Energy Technology Data Exchange (ETDEWEB)
Chertkov, Michael [Los Alamos National Laboratory; Chandrasekaran, V [MIT; Gamarmik, D [MIT; Shah, D [MIT; Sin, J [MIT
2009-01-01
The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.
Operating regimes of signaling cycles: statics, dynamics, and noise filtering.
Directory of Open Access Journals (Sweden)
Carlos Gomez-Uribe
2007-12-01
Full Text Available A ubiquitous building block of signaling pathways is a cycle of covalent modification (e.g., phosphorylation and dephosphorylation in MAPK cascades. Our paper explores the kind of information processing and filtering that can be accomplished by this simple biochemical circuit. Signaling cycles are particularly known for exhibiting a highly sigmoidal (ultrasensitive input-output characteristic in a certain steady-state regime. Here, we systematically study the cycle's steady-state behavior and its response to time-varying stimuli. We demonstrate that the cycle can actually operate in four different regimes, each with its specific input-output characteristics. These results are obtained using the total quasi-steady-state approximation, which is more generally valid than the typically used Michaelis-Menten approximation for enzymatic reactions. We invoke experimental data that suggest the possibility of signaling cycles operating in one of the new regimes. We then consider the cycle's dynamic behavior, which has so far been relatively neglected. We demonstrate that the intrinsic architecture of the cycles makes them act--in all four regimes--as tunable low-pass filters, filtering out high-frequency fluctuations or noise in signals and environmental cues. Moreover, the cutoff frequency can be adjusted by the cell. Numerical simulations show that our analytical results hold well even for noise of large amplitude. We suggest that noise filtering and tunability make signaling cycles versatile components of more elaborate cell-signaling pathways.
Operating regimes of signaling cycles: statics, dynamics, and noise filtering.
Gomez-Uribe, Carlos; Verghese, George C; Mirny, Leonid A
2007-12-01
A ubiquitous building block of signaling pathways is a cycle of covalent modification (e.g., phosphorylation and dephosphorylation in MAPK cascades). Our paper explores the kind of information processing and filtering that can be accomplished by this simple biochemical circuit. Signaling cycles are particularly known for exhibiting a highly sigmoidal (ultrasensitive) input-output characteristic in a certain steady-state regime. Here, we systematically study the cycle's steady-state behavior and its response to time-varying stimuli. We demonstrate that the cycle can actually operate in four different regimes, each with its specific input-output characteristics. These results are obtained using the total quasi-steady-state approximation, which is more generally valid than the typically used Michaelis-Menten approximation for enzymatic reactions. We invoke experimental data that suggest the possibility of signaling cycles operating in one of the new regimes. We then consider the cycle's dynamic behavior, which has so far been relatively neglected. We demonstrate that the intrinsic architecture of the cycles makes them act--in all four regimes--as tunable low-pass filters, filtering out high-frequency fluctuations or noise in signals and environmental cues. Moreover, the cutoff frequency can be adjusted by the cell. Numerical simulations show that our analytical results hold well even for noise of large amplitude. We suggest that noise filtering and tunability make signaling cycles versatile components of more elaborate cell-signaling pathways.
Approximate Series Solutions for Nonlinear Free Vibration of Suspended Cables
Directory of Open Access Journals (Sweden)
Yaobing Zhao
2014-01-01
Full Text Available This paper presents approximate series solutions for nonlinear free vibration of suspended cables via the Lindstedt-Poincare method and homotopy analysis method, respectively. Firstly, taking into account the geometric nonlinearity of the suspended cable as well as the quasi-static assumption, a mathematical model is presented. Secondly, two analytical methods are introduced to obtain the approximate series solutions in the case of nonlinear free vibration. Moreover, small and large sag-to-span ratios and initial conditions are chosen to study the nonlinear dynamic responses by these two analytical methods. The numerical results indicate that frequency amplitude relationships obtained with different analytical approaches exhibit some quantitative and qualitative differences in the cases of motions, mode shapes, and particular sag-to-span ratios. Finally, a detailed comparison of the differences in the displacement fields and cable axial total tensions is made.
Analytical Ballistic Trajectories with Approximately Linear Drag
Directory of Open Access Journals (Sweden)
Giliam J. P. de Carpentier
2014-01-01
Full Text Available This paper introduces a practical analytical approximation of projectile trajectories in 2D and 3D roughly based on a linear drag model and explores a variety of different planning algorithms for these trajectories. Although the trajectories are only approximate, they still capture many of the characteristics of a real projectile in free fall under the influence of an invariant wind, gravitational pull, and terminal velocity, while the required math for these trajectories and planners is still simple enough to efficiently run on almost all modern hardware devices. Together, these properties make the proposed approach particularly useful for real-time applications where accuracy and performance need to be carefully balanced, such as in computer games.
Analysing organic transistors based on interface approximation
International Nuclear Information System (INIS)
Akiyama, Yuto; Mori, Takehiko
2014-01-01
Temperature-dependent characteristics of organic transistors are analysed thoroughly using interface approximation. In contrast to amorphous silicon transistors, it is characteristic of organic transistors that the accumulation layer is concentrated on the first monolayer, and it is appropriate to consider interface charge rather than band bending. On the basis of this model, observed characteristics of hexamethylenetetrathiafulvalene (HMTTF) and dibenzotetrathiafulvalene (DBTTF) transistors with various surface treatments are analysed, and the trap distribution is extracted. In turn, starting from a simple exponential distribution, we can reproduce the temperature-dependent transistor characteristics as well as the gate voltage dependence of the activation energy, so we can investigate various aspects of organic transistors self-consistently under the interface approximation. Small deviation from such an ideal transistor operation is discussed assuming the presence of an energetically discrete trap level, which leads to a hump in the transfer characteristics. The contact resistance is estimated by measuring the transfer characteristics up to the linear region
Nonlinear analysis approximation theory, optimization and applications
2014-01-01
Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.
Simple Lie groups without the approximation property
DEFF Research Database (Denmark)
Haagerup, Uffe; de Laat, Tim
2013-01-01
For a locally compact group G, let A(G) denote its Fourier algebra, and let M0A(G) denote the space of completely bounded Fourier multipliers on G. The group G is said to have the Approximation Property (AP) if the constant function 1 can be approximated by a net in A(G) in the weak-∗ topology...... on the space M0A(G). Recently, Lafforgue and de la Salle proved that SL(3,R) does not have the AP, implying the first example of an exact discrete group without it, namely, SL(3,Z). In this paper we prove that Sp(2,R) does not have the AP. It follows that all connected simple Lie groups with finite center...... and real rank greater than or equal to two do not have the AP. This naturally gives rise to many examples of exact discrete groups without the AP....
The optimal XFEM approximation for fracture analysis
International Nuclear Information System (INIS)
Jiang Shouyan; Du Chengbin; Ying Zongquan
2010-01-01
The extended finite element method (XFEM) provides an effective tool for analyzing fracture mechanics problems. A XFEM approximation consists of standard finite elements which are used in the major part of the domain and enriched elements in the enriched sub-domain for capturing special solution properties such as discontinuities and singularities. However, two issues in the standard XFEM should specially be concerned: efficient numerical integration methods and an appropriate construction of the blending elements. In the paper, an optimal XFEM approximation is proposed to overcome the disadvantage mentioned above in the standard XFEM. The modified enrichment functions are presented that can reproduced exactly everywhere in the domain. The corresponding FORTRAN program is developed for fracture analysis. A classic problem of fracture mechanics is used to benchmark the program. The results indicate that the optimal XFEM can alleviate the errors and improve numerical precision.
Approximated solutions to Born-Infeld dynamics
Energy Technology Data Exchange (ETDEWEB)
Ferraro, Rafael [Instituto de Astronomía y Física del Espacio (IAFE, CONICET-UBA),Casilla de Correo 67, Sucursal 28, 1428 Buenos Aires (Argentina); Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina); Nigro, Mauro [Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina)
2016-02-01
The Born-Infeld equation in the plane is usefully captured in complex language. The general exact solution can be written as a combination of holomorphic and anti-holomorphic functions. However, this solution only expresses the potential in an implicit way. We rework the formulation to obtain the complex potential in an explicit way, by means of a perturbative procedure. We take care of the secular behavior common to this kind of approach, by resorting to a symmetry the equation has at the considered order of approximation. We apply the method to build approximated solutions to Born-Infeld electrodynamics. We solve for BI electromagnetic waves traveling in opposite directions. We study the propagation at interfaces, with the aim of searching for effects susceptible to experimental detection. In particular, we show that a reflected wave is produced when a wave is incident on a semi-space containing a magnetostatic field.
Incomplete Sparse Approximate Inverses for Parallel Preconditioning
International Nuclear Information System (INIS)
Anzt, Hartwig; University of Tennessee, Knoxville, TN; Huckle, Thomas K.; Bräckle, Jürgen; Dongarra, Jack
2017-01-01
In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.
Approximate Solutions in Planted 3-SAT
Hsu, Benjamin; Laumann, Christopher; Moessner, Roderich; Sondhi, Shivaji
2013-03-01
In many computational settings, there exists many instances where finding a solution requires a computing time that grows exponentially in the number of variables. Concrete examples occur in combinatorial optimization problems and cryptography in computer science or glassy systems in physics. However, while exact solutions are often known to require exponential time, a related and important question is the running time required to find approximate solutions. Treating this problem as a problem in statistical physics at finite temperature, we examine the computational running time in finding approximate solutions in 3-satisfiability for randomly generated 3-SAT instances which are guaranteed to have a solution. Analytic predictions are corroborated by numerical evidence using stochastic local search algorithms. A first order transition is found in the running time of these algorithms.
Time Stamps for Fixed-Point Approximation
DEFF Research Database (Denmark)
Damian, Daniela
2001-01-01
Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed-point approximat......Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed...
Traveltime approximations for inhomogeneous HTI media
Alkhalifah, Tariq Ali
2011-01-01
Traveltimes information is convenient for parameter estimation especially if the medium is described by an anisotropic set of parameters. This is especially true if we could relate traveltimes analytically to these medium parameters, which is generally hard to do in inhomogeneous media. As a result, I develop traveltimes approximations for horizontaly transversely isotropic (HTI) media as simplified and even linear functions of the anisotropic parameters. This is accomplished by perturbing the solution of the HTI eikonal equation with respect to η and the azimuthal symmetry direction (usually used to describe the fracture direction) from a generally inhomogeneous elliptically anisotropic background medium. The resulting approximations can provide accurate analytical description of the traveltime in a homogenous background compared to other published moveout equations out there. These equations will allow us to readily extend the inhomogenous background elliptical anisotropic model to an HTI with a variable, but smoothly varying, η and horizontal symmetry direction values. © 2011 Society of Exploration Geophysicists.
The approximability of the String Barcoding problem
Directory of Open Access Journals (Sweden)
Rizzi Romeo
2006-08-01
Full Text Available Abstract The String Barcoding (SBC problem, introduced by Rash and Gusfield (RECOMB, 2002, consists in finding a minimum set of substrings that can be used to distinguish between all members of a set of given strings. In a computational biology context, the given strings represent a set of known viruses, while the substrings can be used as probes for an hybridization experiment via microarray. Eventually, one aims at the classification of new strings (unknown viruses through the result of the hybridization experiment. In this paper we show that SBC is as hard to approximate as Set Cover. Furthermore, we show that the constrained version of SBC (with probes of bounded length is also hard to approximate. These negative results are tight.
Approximations in the PE-method
DEFF Research Database (Denmark)
Arranz, Marta Galindo
1996-01-01
Two differenct sources of errors may occur in the implementation of the PE methods; a phase error introduced in the approximation of a pseudo-differential operator and an amplitude error generated from the starting field. First, the inherent phase errors introduced in the solution are analyzed...... for a case where the normal mode solution to the wave equation is valid, when the sound is propagated in a downward refracting atmosphere. The angular limitations for the different parabolic approximations are deduced, and calculations showing shifts in the starter as the second source of error...... is investigated. Numerical and analytical starters are compared for source locations close to the ground. The spectral properties of several starters are presented....
A Varifold Approach to Surface Approximation
Buet, Blanche; Leonardi, Gian Paolo; Masnou, Simon
2017-11-01
We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the notion of approximate mean curvature and show various convergence results that hold, in particular, for sequences of discrete varifolds associated with point clouds or pixel/voxel-type discretizations of d-surfaces in the Euclidean n-space, without restrictions on dimension and codimension. The variational nature of the approach also allows us to consider surfaces with singularities, and in that case the approximate mean curvature is consistent with the generalized mean curvature of the limit surface. A series of numerical tests are provided in order to illustrate the effectiveness and generality of the method.
Approximations and Solution Estimates in Optimization
2016-04-06
for applications in machine learning and stochastic optimization . In this paper, we quantify the error in optimal values, optimal solutions, near...problem from that of another rather different problem is especially important in stochastic optimization , optimal control, and semi-infinite...approximate solutions to convex stochastic programs. SIAM J. Optimization , 18(3):961–979, 2007. [26] J. O. Royset and R. J-B Wets. From data to
Finite element approximation of the Isaacs equation
Salgado, Abner J.; Zhang, Wujun
2015-01-01
We propose and analyze a two-scale finite element method for the Isaacs equation. The fine scale is given by the mesh size $h$ whereas the coarse scale $\\varepsilon$ is dictated by an integro-differential approximation of the partial differential equation. We show that the method satisfies the discrete maximum principle provided that the mesh is weakly acute. This, in conjunction with weak operator consistency of the finite element method, allows us to establish convergence of the numerical s...
Mean-field approximation minimizes relative entropy
International Nuclear Information System (INIS)
Bilbro, G.L.; Snyder, W.E.; Mann, R.C.
1991-01-01
The authors derive the mean-field approximation from the information-theoretic principle of minimum relative entropy instead of by minimizing Peierls's inequality for the Weiss free energy of statistical physics theory. They show that information theory leads to the statistical mechanics procedure. As an example, they consider a problem in binary image restoration. They find that mean-field annealing compares favorably with the stochastic approach
Fast Approximate Joint Diagonalization Incorporating Weight Matrices
Czech Academy of Sciences Publication Activity Database
Tichavský, Petr; Yeredor, A.
2009-01-01
Roč. 57, č. 3 (2009), s. 878-891 ISSN 1053-587X R&D Projects: GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : autoregressive processes * blind source separation * nonstationary random processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.212, year: 2009 http://library.utia.cas.cz/separaty/2009/SI/tichavsky-fast approximate joint diagonalization incorporating weight matrices.pdf
Fast approximate convex decomposition using relative concavity
Ghosh, Mukulika
2013-02-01
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.
Approximations of Two-Attribute Utility Functions
1976-09-01
06320 i Technology Cambridge, Massachusetts 02139 Dr. Jack R. Borsting, Chairman Dept. of Operations Research and Professor Oskar Morgenstern ... Morgenstern utility functions u defined on two attributes from the viewpoint of mathematical --roxi-n’tion theory.r It focuses on approximations v of u that...von Neumann and Morgenstern (1947) or an equivalent system (Herstein and Milnor, 1953; Fishburn, 1970) so that there exists u: T + Re such that P - Q
Approximate Inverse Preconditioners with Adaptive Dropping
Czech Academy of Sciences Publication Activity Database
Kopal, J.; Rozložník, Miroslav; Tůma, Miroslav
2015-01-01
Roč. 84, June (2015), s. 13-20 ISSN 0965-9978 R&D Projects: GA ČR(CZ) GAP108/11/0853; GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : approximate inverse * Gram-Schmidt orthogonalization * incomplete decomposition * preconditioned conjugate gradient method * algebraic preconditioning * pivoting Subject RIV: BA - General Mathematics Impact factor: 1.673, year: 2015
Solving Math Problems Approximately: A Developmental Perspective.
Directory of Open Access Journals (Sweden)
Dana Ganor-Stern
Full Text Available Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults' ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger than the exact answer and when it was far (vs. close from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner.
Optical pulse propagation with minimal approximations
Kinsler, Paul
2008-01-01
Propagation equations for optical pulses are needed to assist in describing applications in ever more extreme situations -- including those in metamaterials with linear and nonlinear magnetic responses. Here I show how to derive a single first order propagation equation using a minimum of approximations and a straightforward "factorization" mathematical scheme. The approach generates exact coupled bi-directional equations, after which it is clear that the description can be reduced to a singl...
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-07
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-05
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Solving Math Problems Approximately: A Developmental Perspective.
Ganor-Stern, Dana
2016-01-01
Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults' ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger) than the exact answer and when it was far (vs. close) from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner.
Markdown Optimization via Approximate Dynamic Programming
Directory of Open Access Journals (Sweden)
Cos?gun
2013-02-01
Full Text Available We consider the markdown optimization problem faced by the leading apparel retail chain. Because of substitution among products the markdown policy of one product affects the sales of other products. Therefore, markdown policies for product groups having a significant crossprice elasticity among each other should be jointly determined. Since the state space of the problem is very huge, we use Approximate Dynamic Programming. Finally, we provide insights on the behavior of how each product price affects the markdown policy.
Factorized Approximate Inverses With Adaptive Dropping
Czech Academy of Sciences Publication Activity Database
Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav
2016-01-01
Roč. 38, č. 3 (2016), A1807-A1820 ISSN 1064-8275 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverses * incomplete factorization * Gram–Schmidt orthogonalization * preconditioned iterative methods Subject RIV: BA - General Mathematics Impact factor: 2.195, year: 2016
An analytical approximation for resonance integral
International Nuclear Information System (INIS)
Magalhaes, C.G. de; Martinez, A.S.
1985-01-01
It is developed a method which allows to obtain an analytical solution for the resonance integral. The problem formulation is completely theoretical and based in concepts of physics of general character. The analytical expression for integral does not involve any empiric correlation or parameter. Results of approximation are compared with pattern values for each individual resonance and for sum of all resonances. (M.C.K.) [pt
Fast algorithms for approximate circular string matching.
Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P
2014-03-22
Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate circular string matching is a rather undeveloped area. In this article, we present a suboptimal average-case algorithm for exact circular string matching requiring time O(n). Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for moderate values of k, that is k=O(m/logm). We show how the same results can be easily obtained under the edit distance model. The presented algorithms are also implemented as library functions. Experimental results demonstrate that the functions provided in this library accelerate the computations by more than three orders of magnitude compared to a naïve approach. We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice. The importance of our contribution is underlined by the fact that the provided functions may be seamlessly integrated into any biological pipeline. The source code of the library is freely available at http://www.inf.kcl.ac.uk/research/projects/asmf/.
Approximate particle number projection in hot nuclei
International Nuclear Information System (INIS)
Kosov, D.S.; Vdovin, A.I.
1995-01-01
Heated finite systems like, e.g., hot atomic nuclei have to be described by the canonical partition function. But this is a quite difficult technical problem and, as a rule, the grand canonical partition function is used in the studies. As a result, some shortcomings of the theoretical description appear because of the thermal fluctuations of the number of particles. Moreover, in nuclei with pairing correlations the quantum number fluctuations are introduced by some approximate methods (e.g., by the standard BCS method). The exact particle number projection is very cumbersome and an approximate number projection method for T ≠ 0 basing on the formalism of thermo field dynamics is proposed. The idea of the Lipkin-Nogami method to perform any operator as a series in the number operator powers is used. The system of equations for the coefficients of this expansion is written and the solution of the system in the next approximation after the BCS one is obtained. The method which is of the 'projection after variation' type is applied to a degenerate single j-shell model. 14 refs., 1 tab
Feedforward Approximations to Dynamic Recurrent Network Architectures.
Muir, Dylan R
2018-02-01
Recurrent neural network architectures can have useful computational properties, with complex temporal dynamics and input-sensitive attractor states. However, evaluation of recurrent dynamic architectures requires solving systems of differential equations, and the number of evaluations required to determine their response to a given input can vary with the input or can be indeterminate altogether in the case of oscillations or instability. In feedforward networks, by contrast, only a single pass through the network is needed to determine the response to a given input. Modern machine learning systems are designed to operate efficiently on feedforward architectures. We hypothesized that two-layer feedforward architectures with simple, deterministic dynamics could approximate the responses of single-layer recurrent network architectures. By identifying the fixed-point responses of a given recurrent network, we trained two-layer networks to directly approximate the fixed-point response to a given input. These feedforward networks then embodied useful computations, including competitive interactions, information transformations, and noise rejection. Our approach was able to find useful approximations to recurrent networks, which can then be evaluated in linear and deterministic time complexity.
Impulse approximation versus elementary particle method
International Nuclear Information System (INIS)
Klieb, L.
1982-01-01
Calculations are made for radiative muon capture in 3 He, both in impulse approximation and with the elementary particle method, and results are compared. It is argued that a diagrammatic method which takes a selected set of Feynman diagrams into account only provides insufficient warrant that effects not included are small. Therefore low-energy theorems are employed, as first given by Adler and Dothan, to determine the amplitude up to and including all terms linear in photon momentum and momentum transfer at the weak vertex. This amplitude is applied to radiative muon capture with the elementary particle method (EPM). The various form factors needed are discussed. It is shown that the results are particularly sensitive to the π- 3 He- 3 H coupling constant of which many contradictory determinations have been described in the literature. The classification of the nuclear wave function employed in the impulse approximation (IA) is summarized. The ν-decay of 3 H and (radiative muon capture in 3 He is treated and numerical results are given. Next, pion photoproduction and radiative pion capture are considered. IA and EPM for radiative muon capture are compared more closely. It is concluded that two-step processes are inherently difficult; the elementary particle method has convergence problems, and unknown parameters are present. In the impulse approximation, which is perhaps conceptually more difficult, the two-step interaction for the nucleon is considered as effectively point-like with small non-local corrections. (Auth.)
Ranking Support Vector Machine with Kernel Approximation
Directory of Open Access Journals (Sweden)
Kai Chen
2017-01-01
Full Text Available Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels can give higher accuracy than linear RankSVM (RankSVM with a linear kernel for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.
CMB-lensing beyond the Born approximation
International Nuclear Information System (INIS)
Marozzi, Giovanni; Fanizza, Giuseppe; Durrer, Ruth; Dio, Enea Di
2016-01-01
We investigate the weak lensing corrections to the cosmic microwave background temperature anisotropies considering effects beyond the Born approximation. To this aim, we use the small deflection angle approximation, to connect the lensed and unlensed power spectra, via expressions for the deflection angles up to third order in the gravitational potential. While the small deflection angle approximation has the drawback to be reliable only for multipoles ℓ ∼< 2500, it allows us to consistently take into account the non-Gaussian nature of cosmological perturbation theory beyond the linear level. The contribution to the lensed temperature power spectrum coming from the non-Gaussian nature of the deflection angle at higher order is a new effect which has not been taken into account in the literature so far. It turns out to be the leading contribution among the post-Born lensing corrections. On the other hand, the effect is smaller than corrections coming from non-linearities in the matter power spectrum, and its imprint on CMB lensing is too small to be seen in present experiments.
Function approximation of tasks by neural networks
International Nuclear Information System (INIS)
Gougam, L.A.; Chikhi, A.; Mekideche-Chafa, F.
2008-01-01
For several years now, neural network models have enjoyed wide popularity, being applied to problems of regression, classification and time series analysis. Neural networks have been recently seen as attractive tools for developing efficient solutions for many real world problems in function approximation. The latter is a very important task in environments where computation has to be based on extracting information from data samples in real world processes. In a previous contribution, we have used a well known simplified architecture to show that it provides a reasonably efficient, practical and robust, multi-frequency analysis. We have investigated the universal approximation theory of neural networks whose transfer functions are: sigmoid (because of biological relevance), Gaussian and two specified families of wavelets. The latter have been found to be more appropriate to use. The aim of the present contribution is therefore to use a m exican hat wavelet a s transfer function to approximate different tasks relevant and inherent to various applications in physics. The results complement and provide new insights into previously published results on this problem
Simultaneous perturbation stochastic approximation for tidal models
Altaf, M.U.
2011-05-12
The Dutch continental shelf model (DCSM) is a shallow sea model of entire continental shelf which is used operationally in the Netherlands to forecast the storm surges in the North Sea. The forecasts are necessary to support the decision of the timely closure of the moveable storm surge barriers to protect the land. In this study, an automated model calibration method, simultaneous perturbation stochastic approximation (SPSA) is implemented for tidal calibration of the DCSM. The method uses objective function evaluations to obtain the gradient approximations. The gradient approximation for the central difference method uses only two objective function evaluation independent of the number of parameters being optimized. The calibration parameter in this study is the model bathymetry. A number of calibration experiments is performed. The effectiveness of the algorithm is evaluated in terms of the accuracy of the final results as well as the computational costs required to produce these results. In doing so, comparison is made with a traditional steepest descent method and also with a newly developed proper orthogonal decompositionbased calibration method. The main findings are: (1) The SPSA method gives comparable results to steepest descent method with little computational cost. (2) The SPSA method with little computational cost can be used to estimate large number of parameters.
Odic, Darko; Lisboa, Juan Valle; Eisinger, Robert; Olivera, Magdalena Gonzalez; Maiche, Alejandro; Halberda, Justin
2016-01-01
What is the relationship between our intuitive sense of number (e.g., when estimating how many marbles are in a jar), and our intuitive sense of other quantities, including time (e.g., when estimating how long it has been since we last ate breakfast)? Recent work in cognitive, developmental, comparative psychology, and computational neuroscience has suggested that our representations of approximate number, time, and spatial extent are fundamentally linked and constitute a "generalized magnitude system". But, the shared behavioral and neural signatures between number, time, and space may alternatively be due to similar encoding and decision-making processes, rather than due to shared domain-general representations. In this study, we investigate the relationship between approximate number and time in a large sample of 6-8 year-old children in Uruguay by examining how individual differences in the precision of number and time estimation correlate with school mathematics performance. Over four testing days, each child completed an approximate number discrimination task, an approximate time discrimination task, a digit span task, and a large battery of symbolic math tests. We replicate previous reports showing that symbolic math abilities correlate with approximate number precision and extend those findings by showing that math abilities also correlate with approximate time precision. But, contrary to approximate number and time sharing common representations, we find that each of these dimensions uniquely correlates with formal math: approximate number correlates more strongly with formal math compared to time and continues to correlate with math even when precision in time and individual differences in working memory are controlled for. These results suggest that there are important differences in the mental representations of approximate number and approximate time and further clarify the relationship between quantity representations and mathematics. Copyright
Instantons and magnetization tunneling: Beyond the giant-spin approximation
International Nuclear Information System (INIS)
Florez, J.M.; Vargas, P.; Nunez, Alvaro S.
2009-01-01
In this work we show that commonly neglected fluctuations of the net total spin of a molecular nanomagnet strongly modified its tunneling properties and provide a scenario to explain some discrepancies between theory and experiment. Starting off from an effective spin Hamiltonian, we study the quantum tunneling of the magnetization of molecular nanomagnets in the regime where the giant-spin approximation is breaking down. This study is done using an instanton description of the tunneling path. The instanton is calculated considering its coupling to quantum fluctuations.
Approximation algorithms for the min-power symmetric connectivity problem
Plotnikov, Roman; Erzin, Adil; Mladenovic, Nenad
2016-10-01
We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing the total transmission power consumptions. We propose several new heuristics based on the variable neighborhood search metaheuristic for the approximation solution of the problem. We have performed a numerical experiment where all proposed algorithms have been executed on the randomly generated test samples. For these instances, on average, our algorithms outperform the previously known heuristics.
Perioperative blood saving measures in total hip and knee arthroplasty
Horstmann, W.G.
2011-01-01
This dissertation explores and discusses different aspects of blood loss and blood-saving measures in total hip and knee arthroplasty. Background: Worldwide, approximately 1 million total hip and 1 million total knee prostheses are implanted each year. Total hip arthroplasty and total
Photoelectron spectroscopy and the dipole approximation
Energy Technology Data Exchange (ETDEWEB)
Hemmers, O.; Hansen, D.L.; Wang, H. [Univ. of Nevada, Las Vegas, NV (United States)] [and others
1997-04-01
Photoelectron spectroscopy is a powerful technique because it directly probes, via the measurement of photoelectron kinetic energies, orbital and band structure in valence and core levels in a wide variety of samples. The technique becomes even more powerful when it is performed in an angle-resolved mode, where photoelectrons are distinguished not only by their kinetic energy, but by their direction of emission as well. Determining the probability of electron ejection as a function of angle probes the different quantum-mechanical channels available to a photoemission process, because it is sensitive to phase differences among the channels. As a result, angle-resolved photoemission has been used successfully for many years to provide stringent tests of the understanding of basic physical processes underlying gas-phase and solid-state interactions with radiation. One mainstay in the application of angle-resolved photoelectron spectroscopy is the well-known electric-dipole approximation for photon interactions. In this simplification, all higher-order terms, such as those due to electric-quadrupole and magnetic-dipole interactions, are neglected. As the photon energy increases, however, effects beyond the dipole approximation become important. To best determine the range of validity of the dipole approximation, photoemission measurements on a simple atomic system, neon, where extra-atomic effects cannot play a role, were performed at BL 8.0. The measurements show that deviations from {open_quotes}dipole{close_quotes} expectations in angle-resolved valence photoemission are observable for photon energies down to at least 0.25 keV, and are quite significant at energies around 1 keV. From these results, it is clear that non-dipole angular-distribution effects may need to be considered in any application of angle-resolved photoelectron spectroscopy that uses x-ray photons of energies as low as a few hundred eV.
Product-State Approximations to Quantum States
Brandão, Fernando G. S. L.; Harrow, Aram W.
2016-02-01
We show that for any many-body quantum state there exists an unentangled quantum state such that most of the two-body reduced density matrices are close to those of the original state. This is a statement about the monogamy of entanglement, which cannot be shared without limit in the same way as classical correlation. Our main application is to Hamiltonians that are sums of two-body terms. For such Hamiltonians we show that there exist product states with energy that is close to the ground-state energy whenever the interaction graph of the Hamiltonian has high degree. This proves the validity of mean-field theory and gives an explicitly bounded approximation error. If we allow states that are entangled within small clusters of systems but product across clusters then good approximations exist when the Hamiltonian satisfies one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state where the blocks in the partition have sublinear entanglement. Previously this was known only in the case of small expansion or in the regime where the entanglement was close to zero. Our approximations allow an extensive error in energy, which is the scale considered by the quantum PCP (probabilistically checkable proof) and NLTS (no low-energy trivial-state) conjectures. Thus our results put restrictions on the possible Hamiltonians that could be used for a possible proof of the qPCP or NLTS conjectures. By contrast the classical PCP constructions are often based on constraint graphs with high degree. Likewise we show that the parallel repetition that is possible with classical constraint satisfaction problems cannot also be possible for quantum Hamiltonians, unless qPCP is false. The main technical tool behind our results is a collection of new classical and quantum de Finetti theorems which do not make any symmetry assumptions on the underlying states.
Dynamic system evolution and markov chain approximation
Directory of Open Access Journals (Sweden)
Roderick V. Nicholas Melnik
1998-01-01
Full Text Available In this paper computational aspects of the mathematical modelling of dynamic system evolution have been considered as a problem in information theory. The construction of mathematical models is treated as a decision making process with limited available information.The solution of the problem is associated with a computational model based on heuristics of a Markov Chain in a discrete space–time of events. A stable approximation of the chain has been derived and the limiting cases are discussed. An intrinsic interconnection of constructive, sequential, and evolutionary approaches in related optimization problems provides new challenges for future work.
The EH Interpolation Spline and Its Approximation
Directory of Open Access Journals (Sweden)
Jin Xie
2014-01-01
Full Text Available A new interpolation spline with two parameters, called EH interpolation spline, is presented in this paper, which is the extension of the standard cubic Hermite interpolation spline, and inherits the same properties of the standard cubic Hermite interpolation spline. Given the fixed interpolation conditions, the shape of the proposed splines can be adjusted by changing the values of the parameters. Also, the introduced spline could approximate to the interpolated function better than the standard cubic Hermite interpolation spline and the quartic Hermite interpolation splines with single parameter by a new algorithm.
On one approximation in quantum chromodynamics
International Nuclear Information System (INIS)
Alekseev, A.I.; Bajkov, V.A.; Boos, Eh.Eh.
1982-01-01
Form of a complete fermion propagator near the mass shell is investigated. Considered is a nodel of quantum chromodynamics (MQC) where in the fermion section the Block-Nordsic approximation has been made, i. e. u-numbers are substituted for ν matrices. The model was investigated by means of the Schwinger-Dyson equation for a quark propagator in the infrared region. The Schwinger-Dyson equation was managed to reduce to a differential equation which is easily solved. At that, the Green function is suitable to represent as integral transformation
Topics in multivariate approximation and interpolation
Jetter, Kurt
2005-01-01
This book is a collection of eleven articles, written by leading experts and dealing with special topics in Multivariate Approximation and Interpolation. The material discussed here has far-reaching applications in many areas of Applied Mathematics, such as in Computer Aided Geometric Design, in Mathematical Modelling, in Signal and Image Processing and in Machine Learning, to mention a few. The book aims at giving a comprehensive information leading the reader from the fundamental notions and results of each field to the forefront of research. It is an ideal and up-to-date introduction for gr
Shape theory categorical methods of approximation
Cordier, J M
2008-01-01
This in-depth treatment uses shape theory as a ""case study"" to illustrate situations common to many areas of mathematics, including the use of archetypal models as a basis for systems of approximations. It offers students a unified and consolidated presentation of extensive research from category theory, shape theory, and the study of topological algebras.A short introduction to geometric shape explains specifics of the construction of the shape category and relates it to an abstract definition of shape theory. Upon returning to the geometric base, the text considers simplical complexes and
Mean field approximation to QCD, 1
International Nuclear Information System (INIS)
Tezuka, Hirokazu.
1987-09-01
We apply mean field approximation to the gluon field in the equations of motion derived from the QCD lagrangian. The gluon mean field is restricted to the time-independent 0th component, and color exchange components are ignored. The equation of motion for the gluon mean field turns into a Poisson equation, and that for the quark field into a Dirac equation with a potential term. For example, assuming spherical symmetric box-like distribution and Gauss-like distribution to quarks, we try to solve these two equations simultaneously. (author)
Nonlinear higher quasiparticle random phase approximation
Smetana, Adam; Šimkovic, Fedor; Štefánik, Dušan; Krivoruchenko, Mikhail
2017-10-01
We develop a new approach to describe nuclear states of multiphonon origin, motivated by the necessity for a more accurate description of matrix elements of neutrinoless double-beta decay. Our approach is an extension of the Quasiparticle Random Phase Approximation (QRPA), in which nonlinear phonon operators play an essential role. Before applying the nonlinear higher QRPA (nhQRPA) to realistic problems, we test its efficiency with exactly solvable models. The first considered model is equivalent to a harmonic oscillator. The nhQRPA solutions follow from the standard QRPA equation, but for nonlinear phonon operators defined for each individual excited state separately. The second exactly solvable model is the proton-neutron Lipkin model that describes successfully not only energy spectrum of nuclei, but also beta-decay transitions. Again, we reproduce exactly the numerical solutions in the nhQRPA framework. We show in particular that truncation of the nonlinear phonon operators leads to an approximation similar to the self-consistent second QRPA, given the phonon operators are defined with a constant term. The test results demonstrate that the proposed nhQRPA is a promising tool for a realistic calculation of energy spectra and nuclear transitions.
Fast approximate hierarchical clustering using similarity heuristics
Directory of Open Access Journals (Sweden)
Kull Meelis
2008-09-01
Full Text Available Abstract Background Agglomerative hierarchical clustering (AHC is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that all pairwise distances between data objects must be known. With ever-increasing data sizes this quadratic complexity poses problems that cannot be overcome by simply waiting for faster computers. Results We propose an approximate AHC algorithm HappieClust which can output a biologically meaningful clustering of a large dataset more than an order of magnitude faster than full AHC algorithms. The key to the algorithm is to limit the number of calculated pairwise distances to a carefully chosen subset of all possible distances. We choose distances using a similarity heuristic based on a small set of pivot objects. The heuristic efficiently finds pairs of similar objects and these help to mimic the greedy choices of full AHC. Quality of approximate AHC as compared to full AHC is studied with three measures. The first measure evaluates the global quality of the achieved clustering, while the second compares biological relevance using enrichment of biological functions in every subtree of the clusterings. The third measure studies how well the contents of subtrees are conserved between the clusterings. Conclusion The HappieClust algorithm is well suited for large-scale gene expression visualization and analysis both on personal computers as well as public online web applications. The software is available from the URL http://www.quretec.com/HappieClust
Traveling cluster approximation for uncorrelated amorphous systems
International Nuclear Information System (INIS)
Kaplan, T.; Sen, A.K.; Gray, L.J.; Mills, R.
1985-01-01
In this paper, the authors apply the TCA concepts to spatially disordered, uncorrelated systems (e.g., fluids or amorphous metals without short-range order). This is the first approximation scheme for amorphous systems that takes cluster effects into account while preserving the Herglotz property for any amount of disorder. They have performed some computer calculations for the pair TCA, for the model case of delta-function potentials on a one-dimensional random chain. These results are compared with exact calculations (which, in principle, taken into account all cluster effects) and with the CPA, which is the single-site TCA. The density of states for the pair TCA clearly shows some improvement over the CPA, and yet, apparently, the pair approximation distorts some of the features of the exact results. They conclude that the effects of large clusters are much more important in an uncorrelated liquid metal than in a substitutional alloy. As a result, the pair TCA, which does quite a nice job for alloys, is not adequate for the liquid. Larger clusters must be treated exactly, and therefore an n-TCA with n > 2 must be used
APPROXIMATING INNOVATION POTENTIAL WITH NEUROFUZZY ROBUST MODEL
Directory of Open Access Journals (Sweden)
Kasa, Richard
2015-01-01
Full Text Available In a remarkably short time, economic globalisation has changed the world’s economic order, bringing new challenges and opportunities to SMEs. These processes pushed the need to measure innovation capability, which has become a crucial issue for today’s economic and political decision makers. Companies cannot compete in this new environment unless they become more innovative and respond more effectively to consumers’ needs and preferences – as mentioned in the EU’s innovation strategy. Decision makers cannot make accurate and efficient decisions without knowing the capability for innovation of companies in a sector or a region. This need is forcing economists to develop an integrated, unified and complete method of measuring, approximating and even forecasting the innovation performance not only on a macro but also a micro level. In this recent article a critical analysis of the literature on innovation potential approximation and prediction is given, showing their weaknesses and a possible alternative that eliminates the limitations and disadvantages of classical measuring and predictive methods.
Analytic approximate radiation effects due to Bremsstrahlung
Energy Technology Data Exchange (ETDEWEB)
Ben-Zvi I.
2012-02-01
The purpose of this note is to provide analytic approximate expressions that can provide quick estimates of the various effects of the Bremsstrahlung radiation produced relatively low energy electrons, such as the dumping of the beam into the beam stop at the ERL or field emission in superconducting cavities. The purpose of this work is not to replace a dependable calculation or, better yet, a measurement under real conditions, but to provide a quick but approximate estimate for guidance purposes only. These effects include dose to personnel, ozone generation in the air volume exposed to the radiation, hydrogen generation in the beam dump water cooling system and radiation damage to near-by magnets. These expressions can be used for other purposes, but one should note that the electron beam energy range is limited. In these calculations the good range is from about 0.5 MeV to 10 MeV. To help in the application of this note, calculations are presented as a worked out example for the beam dump of the R&D Energy Recovery Linac.
Approximate reversal of quantum Gaussian dynamics
Lami, Ludovico; Das, Siddhartha; Wilde, Mark M.
2018-03-01
Recently, there has been focus on determining the conditions under which the data processing inequality for quantum relative entropy is satisfied with approximate equality. The solution of the exact equality case is due to Petz, who showed that the quantum relative entropy between two quantum states stays the same after the action of a quantum channel if and only if there is a reversal channel that recovers the original states after the channel acts. Furthermore, this reversal channel can be constructed explicitly and is now called the Petz recovery map. Recent developments have shown that a variation of the Petz recovery map works well for recovery in the case of approximate equality of the data processing inequality. Our main contribution here is a proof that bosonic Gaussian states and channels possess a particular closure property, namely, that the Petz recovery map associated to a bosonic Gaussian state σ and a bosonic Gaussian channel N is itself a bosonic Gaussian channel. We furthermore give an explicit construction of the Petz recovery map in this case, in terms of the mean vector and covariance matrix of the state σ and the Gaussian specification of the channel N .
Approximating Markov Chains: What and why
International Nuclear Information System (INIS)
Pincus, S.
1996-01-01
Much of the current study of dynamical systems is focused on geometry (e.g., chaos and bifurcations) and ergodic theory. Yet dynamical systems were originally motivated by an attempt to open-quote open-quote solve,close-quote close-quote or at least understand, a discrete-time analogue of differential equations. As such, numerical, analytical solution techniques for dynamical systems would seem desirable. We discuss an approach that provides such techniques, the approximation of dynamical systems by suitable finite state Markov Chains. Steady state distributions for these Markov Chains, a straightforward calculation, will converge to the true dynamical system steady state distribution, with appropriate limit theorems indicated. Thus (i) approximation by a computable, linear map holds the promise of vastly faster steady state solutions for nonlinear, multidimensional differential equations; (ii) the solution procedure is unaffected by the presence or absence of a probability density function for the attractor, entirely skirting singularity, fractal/multifractal, and renormalization considerations. The theoretical machinery underpinning this development also implies that under very general conditions, steady state measures are weakly continuous with control parameter evolution. This means that even though a system may change periodicity, or become chaotic in its limiting behavior, such statistical parameters as the mean, standard deviation, and tail probabilities change continuously, not abruptly with system evolution. copyright 1996 American Institute of Physics
Analytic approximate radiation effects due to Bremsstrahlung
International Nuclear Information System (INIS)
Ben-Zvi, I.
2012-01-01
The purpose of this note is to provide analytic approximate expressions that can provide quick estimates of the various effects of the Bremsstrahlung radiation produced relatively low energy electrons, such as the dumping of the beam into the beam stop at the ERL or field emission in superconducting cavities. The purpose of this work is not to replace a dependable calculation or, better yet, a measurement under real conditions, but to provide a quick but approximate estimate for guidance purposes only. These effects include dose to personnel, ozone generation in the air volume exposed to the radiation, hydrogen generation in the beam dump water cooling system and radiation damage to near-by magnets. These expressions can be used for other purposes, but one should note that the electron beam energy range is limited. In these calculations the good range is from about 0.5 MeV to 10 MeV. To help in the application of this note, calculations are presented as a worked out example for the beam dump of the R and D Energy Recovery Linac.
On some applications of diophantine approximations.
Chudnovsky, G V
1984-03-01
Siegel's results [Siegel, C. L. (1929) Abh. Preuss. Akad. Wiss. Phys.-Math. Kl. 1] on the transcendence and algebraic independence of values of E-functions are refined to obtain the best possible bound for the measures of irrationality and linear independence of values of arbitrary E-functions at rational points. Our results show that values of E-functions at rational points have measures of diophantine approximations typical to "almost all" numbers. In particular, any such number has the "2 + epsilon" exponent of irrationality: Theta - p/q > q(-2-epsilon) for relatively prime rational integers p,q, with q >/= q(0) (Theta, epsilon). These results answer some problems posed by Lang. The methods used here are based on the introduction of graded Padé approximations to systems of functions satisfying linear differential equations with rational function coefficients. The constructions and proofs of this paper were used in the functional (nonarithmetic case) in a previous paper [Chudnovsky, D. V. & Chudnovsky, G. V. (1983) Proc. Natl. Acad. Sci. USA 80, 5158-5162].
Regularity and approximability of electronic wave functions
Yserentant, Harry
2010-01-01
The electronic Schrödinger equation describes the motion of N-electrons under Coulomb interaction forces in a field of clamped nuclei. The solutions of this equation, the electronic wave functions, depend on 3N variables, with three spatial dimensions for each electron. Approximating these solutions is thus inordinately challenging, and it is generally believed that a reduction to simplified models, such as those of the Hartree-Fock method or density functional theory, is the only tenable approach. This book seeks to show readers that this conventional wisdom need not be ironclad: the regularity of the solutions, which increases with the number of electrons, the decay behavior of their mixed derivatives, and the antisymmetry enforced by the Pauli principle contribute properties that allow these functions to be approximated with an order of complexity which comes arbitrarily close to that for a system of one or two electrons. The text is accessible to a mathematical audience at the beginning graduate level as...
Adaptive and Approximate Orthogonal Range Counting
DEFF Research Database (Denmark)
Chan, Timothy M.; Wilkinson, Bryan Thomas
2013-01-01
-case optimal query time O(log_w n). We give an O(n loglog n)-space adaptive data structure that improves the query time to O(loglog n + log_w k), where k is the output count. When k=O(1), our bounds match the state of the art for the 2-D orthogonal range emptiness problem [Chan, Larsen, and Pătraşcu, SoCG 2011......]. •We give an O(n loglog n)-space data structure for approximate 2-D orthogonal range counting that can compute a (1+δ)-factor approximation to the count in O(loglog n) time for any fixed constant δ>0. Again, our bounds match the state of the art for the 2-D orthogonal range emptiness problem. •Lastly......Close Abstract We present three new results on one of the most basic problems in geometric data structures, 2-D orthogonal range counting. All the results are in the w-bit word RAM model. •It is well known that there are linear-space data structures for 2-D orthogonal range counting with worst...
DEFF Research Database (Denmark)
Sadegh, Payman
1997-01-01
This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...... of the optimization parameters. It is shown that, under application of the projection algorithm, the parameter iterate converges almost surely to a Kuhn-Tucker point, The procedure is illustrated by a numerical example, (C) 1997 Elsevier Science Ltd....
Background approximation in automatic qualitative X-ray-fluorescent analysis
International Nuclear Information System (INIS)
Jordanov, J.; Tsanov, T.; Stefanov, R.; Jordanov, N.; Paunov, M.
1982-01-01
An empirical method of finding the dependence of the background intensity (Isub(bg) on the wavelength is proposed, based on the approximation of the experimentally found values for the background in the course of an automatic qualitative X-ray fluorescent analysis with pre-set curve. It is assumed that the dependence I(lambda) will be well approximated by a curve of the type Isub(bg)=(lambda-lambda sub(o)sup(fsub(1)(lambda))exp[fsub(2)(lambda)] where fsub(1) (lambda) and f 2 (lambda) are linear functions with respect to the sought parameters. This assumption was checked out on a ''pure'' starch background, in which it is not known beforehand which points belong to the background. It was assumed that the dependence I(lambda) can be found from all minima in the spectrum. Three types of minima has been distinguished: 1. the lowest point between two well-solved X-ray lines; 2. a minimum obtained as a result of statistical fluctuations of the measured signal; 3. the lowest point between two overlapped lines. The minima strongly deviating from the background are removed from the obtained set. The sum-total of the remaining minima serves as a base for the approximation of the dependence I(lambda). The unknown parameters are determined by means of the LSM. The approximated curve obtained by this method is closer to the real background than the background determined by the method described by Kigaki Denki, as the effect of all recorded minima is taken into account. As an example the PbTe spectrum recorded with crystal LiF 220 is shown graphically. The curve well describes the background of the spectrum even in the regions in which there are no minima belonging to the background. (authors)
Hardness of approximation for strip packing
DEFF Research Database (Denmark)
Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin
2017-01-01
Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, for example, in scheduling and stock-cutting, and has been studied extensive...
Hydromagnetic turbulence in the direct interaction approximation
International Nuclear Information System (INIS)
Nagarajan, S.
1975-01-01
The dissertation is concerned with the nature of turbulence in a medium with large electrical conductivity. Three distinct though inter-related questions are asked. Firstly, the evolution of a weak, random initial magnetic field in a highly conducting, isotropically turbulent fluid is discussed. This was first discussed in the paper 'Growth of Turbulent Magnetic Fields' by Kraichnan and Nagargian. The Physics of Fluids, volume 10, number 4, 1967. Secondly, the direct interaction approximation for hydromagnetic turbulence maintained by stationary, isotropic, random stirring forces is formulated in the wave-number-frequency domain. Thirdly, the dynamical evolution of a weak, random, magnetic excitation in a turbulent electrically conducting fluid is examined under varying kinematic conditions. (G.T.H.)
Discrete Spectrum Reconstruction Using Integral Approximation Algorithm.
Sizikov, Valery; Sidorov, Denis
2017-07-01
An inverse problem in spectroscopy is considered. The objective is to restore the discrete spectrum from observed spectrum data, taking into account the spectrometer's line spread function. The problem is reduced to solution of a system of linear-nonlinear equations (SLNE) with respect to intensities and frequencies of the discrete spectral lines. The SLNE is linear with respect to lines' intensities and nonlinear with respect to the lines' frequencies. The integral approximation algorithm is proposed for the solution of this SLNE. The algorithm combines solution of linear integral equations with solution of a system of linear algebraic equations and avoids nonlinear equations. Numerical examples of the application of the technique, both to synthetic and experimental spectra, demonstrate the efficacy of the proposed approach in enabling an effective enhancement of the spectrometer's resolution.
Nanostructures: Scattering beyond the Born approximation
Grigoriev, S. V.; Syromyatnikov, A. V.; Chumakov, A. P.; Grigoryeva, N. A.; Napolskii, K. S.; Roslyakov, I. V.; Eliseev, A. A.; Petukhov, A. V.; Eckerlebe, H.
2010-03-01
The neutron scattering on a two-dimensional ordered nanostructure with the third nonperiodic dimension can go beyond the Born approximation. In our model supported by the exact theoretical solution a well-correlated hexagonal porous structure of anodic aluminum oxide films acts as a peculiar two-dimensional grating for the coherent neutron wave. The thickness of the film L (length of pores) plays important role in the transition from the weak to the strong scattering regimes. It is shown that the coherency of the standard small-angle neutron scattering setups suits to the geometry of the studied objects and often affects the intensity of scattering. The proposed theoretical solution can be applied in the small-angle neutron diffraction experiments with flux lines in superconductors, periodic arrays of magnetic or superconducting nanowires, as well as in small-angle diffraction experiments on synchrotron radiation.
UFBoot2: Improving the Ultrafast Bootstrap Approximation.
Hoang, Diep Thi; Chernomor, Olga; von Haeseler, Arndt; Minh, Bui Quang; Vinh, Le Sy
2018-02-01
The standard bootstrap (SBS), despite being computationally intensive, is widely used in maximum likelihood phylogenetic analyses. We recently proposed the ultrafast bootstrap approximation (UFBoot) to reduce computing time while achieving more unbiased branch supports than SBS under mild model violations. UFBoot has been steadily adopted as an efficient alternative to SBS and other bootstrap approaches. Here, we present UFBoot2, which substantially accelerates UFBoot and reduces the risk of overestimating branch supports due to polytomies or severe model violations. Additionally, UFBoot2 provides suitable bootstrap resampling strategies for phylogenomic data. UFBoot2 is 778 times (median) faster than SBS and 8.4 times (median) faster than RAxML rapid bootstrap on tested data sets. UFBoot2 is implemented in the IQ-TREE software package version 1.6 and freely available at http://www.iqtree.org. © The Author 2017. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.
Approximation by max-product type operators
Bede, Barnabás; Gal, Sorin G
2016-01-01
This monograph presents a broad treatment of developments in an area of constructive approximation involving the so-called "max-product" type operators. The exposition highlights the max-product operators as those which allow one to obtain, in many cases, more valuable estimates than those obtained by classical approaches. The text considers a wide variety of operators which are studied for a number of interesting problems such as quantitative estimates, convergence, saturation results, localization, to name several. Additionally, the book discusses the perfect analogies between the probabilistic approaches of the classical Bernstein type operators and of the classical convolution operators (non-periodic and periodic cases), and the possibilistic approaches of the max-product variants of these operators. These approaches allow for two natural interpretations of the max-product Bernstein type operators and convolution type operators: firstly, as possibilistic expectations of some fuzzy variables, and secondly,...
PROX: Approximated Summarization of Data Provenance.
Ainy, Eleanor; Bourhis, Pierre; Davidson, Susan B; Deutch, Daniel; Milo, Tova
2016-03-01
Many modern applications involve collecting large amounts of data from multiple sources, and then aggregating and manipulating it in intricate ways. The complexity of such applications, combined with the size of the collected data, makes it difficult to understand the application logic and how information was derived. Data provenance has been proven helpful in this respect in different contexts; however, maintaining and presenting the full and exact provenance may be infeasible, due to its size and complex structure. For that reason, we introduce the notion of approximated summarized provenance, where we seek a compact representation of the provenance at the possible cost of information loss. Based on this notion, we have developed PROX, a system for the management, presentation and use of data provenance for complex applications. We propose to demonstrate PROX in the context of a movies rating crowd-sourcing system, letting participants view provenance summarization and use it to gain insights on the application and its underlying data.
Exact and Approximate Probabilistic Symbolic Execution
Luckow, Kasper; Pasareanu, Corina S.; Dwyer, Matthew B.; Filieri, Antonio; Visser, Willem
2014-01-01
Probabilistic software analysis seeks to quantify the likelihood of reaching a target event under uncertain environments. Recent approaches compute probabilities of execution paths using symbolic execution, but do not support nondeterminism. Nondeterminism arises naturally when no suitable probabilistic model can capture a program behavior, e.g., for multithreading or distributed systems. In this work, we propose a technique, based on symbolic execution, to synthesize schedulers that resolve nondeterminism to maximize the probability of reaching a target event. To scale to large systems, we also introduce approximate algorithms to search for good schedulers, speeding up established random sampling and reinforcement learning results through the quantification of path probabilities based on symbolic execution. We implemented the techniques in Symbolic PathFinder and evaluated them on nondeterministic Java programs. We show that our algorithms significantly improve upon a state-of- the-art statistical model checking algorithm, originally developed for Markov Decision Processes.
Approximate analytical modeling of leptospirosis infection
Ismail, Nur Atikah; Azmi, Amirah; Yusof, Fauzi Mohamed; Ismail, Ahmad Izani
2017-11-01
Leptospirosis is an infectious disease carried by rodents which can cause death in humans. The disease spreads directly through contact with feces, urine or through bites of infected rodents and indirectly via water contaminated with urine and droppings from them. Significant increase in the number of leptospirosis cases in Malaysia caused by the recent severe floods were recorded during heavy rainfall season. Therefore, to understand the dynamics of leptospirosis infection, a mathematical model based on fractional differential equations have been developed and analyzed. In this paper an approximate analytical method, the multi-step Laplace Adomian decomposition method, has been used to conduct numerical simulations so as to gain insight on the spread of leptospirosis infection.
Analytical approximations for wide and narrow resonances
International Nuclear Information System (INIS)
Suster, Luis Carlos; Martinez, Aquilino Senra; Silva, Fernando Carvalho da
2005-01-01
This paper aims at developing analytical expressions for the adjoint neutron spectrum in the resonance energy region, taking into account both narrow and wide resonance approximations, in order to reduce the numerical computations involved. These analytical expressions, besides reducing computing time, are very simple from a mathematical point of view. The results obtained with this analytical formulation were compared to a reference solution obtained with a numerical method previously developed to solve the neutron balance adjoint equations. Narrow and wide resonances of U 238 were treated and the analytical procedure gave satisfactory results as compared with the reference solution, for the resonance energy range. The adjoint neutron spectrum is useful to determine the neutron resonance absorption, so that multigroup adjoint cross sections used by the adjoint diffusion equation can be obtained. (author)
Analytical approximations for wide and narrow resonances
Energy Technology Data Exchange (ETDEWEB)
Suster, Luis Carlos; Martinez, Aquilino Senra; Silva, Fernando Carvalho da [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: aquilino@lmp.ufrj.br
2005-07-01
This paper aims at developing analytical expressions for the adjoint neutron spectrum in the resonance energy region, taking into account both narrow and wide resonance approximations, in order to reduce the numerical computations involved. These analytical expressions, besides reducing computing time, are very simple from a mathematical point of view. The results obtained with this analytical formulation were compared to a reference solution obtained with a numerical method previously developed to solve the neutron balance adjoint equations. Narrow and wide resonances of U{sup 238} were treated and the analytical procedure gave satisfactory results as compared with the reference solution, for the resonance energy range. The adjoint neutron spectrum is useful to determine the neutron resonance absorption, so that multigroup adjoint cross sections used by the adjoint diffusion equation can be obtained. (author)
Evaluating methods for approximating stochastic differential equations.
Brown, Scott D; Ratcliff, Roger; Smith, Philip L
2006-08-01
Models of decision making and response time (RT) are often formulated using stochastic differential equations (SDEs). Researchers often investigate these models using a simple Monte Carlo method based on Euler's method for solving ordinary differential equations. The accuracy of Euler's method is investigated and compared to the performance of more complex simulation methods. The more complex methods for solving SDEs yielded no improvement in accuracy over the Euler method. However, the matrix method proposed by Diederich and Busemeyer (2003) yielded significant improvements. The accuracy of all methods depended critically on the size of the approximating time step. The large (∼10 ms) step sizes often used by psychological researchers resulted in large and systematic errors in evaluating RT distributions.
Efficient Approximate OLAP Querying Over Time Series
DEFF Research Database (Denmark)
Perera, Kasun Baruhupolage Don Kasun Sanjeewa; Hahmann, Martin; Lehner, Wolfgang
2016-01-01
The ongoing trend for data gathering not only produces larger volumes of data, but also increases the variety of recorded data types. Out of these, especially time series, e.g. various sensor readings, have attracted attention in the domains of business intelligence and decision making. As OLAP...... queries play a major role in these domains, it is desirable to also execute them on time series data. While this is not a problem on the conceptual level, it can become a bottleneck with regards to query run-time. In general, processing OLAP queries gets more computationally intensive as the volume...... are either costly or require continuous maintenance. In this paper we propose an approach for approximate OLAP querying of time series that offers constant latency and is maintenance-free. To achieve this, we identify similarities between aggregation cuboids and propose algorithms that eliminate...
Approximate truncation robust computed tomography—ATRACT
International Nuclear Information System (INIS)
Dennerlein, Frank; Maier, Andreas
2013-01-01
We present an approximate truncation robust algorithm to compute tomographic images (ATRACT). This algorithm targets at reconstructing volumetric images from cone-beam projections in scenarios where these projections are highly truncated in each dimension. It thus facilitates reconstructions of small subvolumes of interest, without involving prior knowledge about the object. Our method is readily applicable to medical C-arm imaging, where it may contribute to new clinical workflows together with a considerable reduction of x-ray dose. We give a detailed derivation of ATRACT that starts from the conventional Feldkamp filtered-backprojection algorithm and that involves, as one component, a novel original formula for the inversion of the two-dimensional Radon transform. Discretization and numerical implementation are discussed and reconstruction results from both, simulated projections and first clinical data sets are presented. (paper)
Approximate Sensory Data Collection: A Survey
Directory of Open Access Journals (Sweden)
Siyao Cheng
2017-03-01
Full Text Available With the rapid development of the Internet of Things (IoTs, wireless sensor networks (WSNs and related techniques, the amount of sensory data manifests an explosive growth. In some applications of IoTs and WSNs, the size of sensory data has already exceeded several petabytes annually, which brings too many troubles and challenges for the data collection, which is a primary operation in IoTs and WSNs. Since the exact data collection is not affordable for many WSN and IoT systems due to the limitations on bandwidth and energy, many approximate data collection algorithms have been proposed in the last decade. This survey reviews the state of the art of approximatedatacollectionalgorithms. Weclassifythemintothreecategories: themodel-basedones, the compressive sensing based ones, and the query-driven ones. For each category of algorithms, the advantages and disadvantages are elaborated, some challenges and unsolved problems are pointed out, and the research prospects are forecasted.
Approximate Sensory Data Collection: A Survey.
Cheng, Siyao; Cai, Zhipeng; Li, Jianzhong
2017-03-10
With the rapid development of the Internet of Things (IoTs), wireless sensor networks (WSNs) and related techniques, the amount of sensory data manifests an explosive growth. In some applications of IoTs and WSNs, the size of sensory data has already exceeded several petabytes annually, which brings too many troubles and challenges for the data collection, which is a primary operation in IoTs and WSNs. Since the exact data collection is not affordable for many WSN and IoT systems due to the limitations on bandwidth and energy, many approximate data collection algorithms have been proposed in the last decade. This survey reviews the state of the art of approximatedatacollectionalgorithms. Weclassifythemintothreecategories: themodel-basedones, the compressive sensing based ones, and the query-driven ones. For each category of algorithms, the advantages and disadvantages are elaborated, some challenges and unsolved problems are pointed out, and the research prospects are forecasted.
The Bloch Approximation in Periodically Perforated Media
International Nuclear Information System (INIS)
Conca, C.; Gomez, D.; Lobo, M.; Perez, E.
2005-01-01
We consider a periodically heterogeneous and perforated medium filling an open domain Ω of R N . Assuming that the size of the periodicity of the structure and of the holes is O(ε),we study the asymptotic behavior, as ε → 0, of the solution of an elliptic boundary value problem with strongly oscillating coefficients posed in Ω ε (Ω ε being Ω minus the holes) with a Neumann condition on the boundary of the holes. We use Bloch wave decomposition to introduce an approximation of the solution in the energy norm which can be computed from the homogenized solution and the first Bloch eigenfunction. We first consider the case where Ωis R N and then localize the problem for abounded domain Ω, considering a homogeneous Dirichlet condition on the boundary of Ω
Coated sphere scattering by geometric optics approximation.
Mengran, Zhai; Qieni, Lü; Hongxia, Zhang; Yinxin, Zhang
2014-10-01
A new geometric optics model has been developed for the calculation of light scattering by a coated sphere, and the analytic expression for scattering is presented according to whether rays hit the core or not. The ray of various geometric optics approximation (GOA) terms is parameterized by the number of reflections in the coating/core interface, the coating/medium interface, and the number of chords in the core, with the degeneracy path and repeated path terms considered for the rays striking the core, which simplifies the calculation. For the ray missing the core, the various GOA terms are dealt with by a homogeneous sphere. The scattering intensity of coated particles are calculated and then compared with those of Debye series and Aden-Kerker theory. The consistency of the results proves the validity of the method proposed in this work.
Magnetic Fusion Advisory Committee report on recommended fusion program priorities and strategy
International Nuclear Information System (INIS)
1983-09-01
The Magnetic Fusion Advisory Committee recommends a new program strategy with the following principal features: (1) Initiation in FY86 of the Tokamak Fusion Core Experiment (TFCX), a moderate-cost tokamak reactor device (less than $1 B PACE) designed to achieve ignition and long-pulse equilibrium burn. Careful trade-off studies are needed before making key design choices in interrelated technology areas. Cost reductions relative to earlier plans can be realized by exploiting new plasma technology, by locating the TFCX at the TFTR site, and by assigning responsibility for complementary reactor engineering tasks to other sectors of the fusion program. (2) Potential utilization of the MFTF Upgrade to provide a cost-effective means for quasi-steady-state testing of blanket and power-system components, complementary to TFCX. This will depend on future assessments of the data base for tandem mirrors. (3) Vigorous pursuit of the broad US base program in magnetic confinement, including new machine starts, where appropriate, at approximately the present total level of support. (4) Utilization of Development and Technology programs in plasma and magnet technology in support of specific hardware requirements of the TFCX and of other major fusion facilities, so as to minimize overall program cost
Xia, A. G.; Michelangeli, D. V.; Makar, P. A.
2008-07-01
A detailed α-pinene oxidation mechanism was reduced systematically through the successive application of five mechanism reduction techniques. The resulting reduced mechanism preserves the ozone- and organic aerosol-forming properties of the original mechanism, while using less species. The methodologies employed included a directed relation graph method with error propagation (DRGEP, which removed a large number of redundant species and reactions), principal component analysis of the rate sensitivity matrix (PCA, used to remove unnecessary reactions), the quasi-steady-state approximation (QSSA, used to remove some QSS species), an iterative screening method (ISSA, which removes redundant species and reactions simultaneously), and a new lumping approach dependant on the hydrocarbon to NOx ratio (which reduced the number of species in mechanism subsets for specific hydrocarbon to NOx ranges). This multistage methodology results in a reduction ratio of 2.5 for the number of both species and reactions compared with the full mechanism. The simplified mechanism reproduces the important gas and aerosol phase species (the latter are examined in detail by individual condensing species as well as in classes according to four functional groups: PANs, nitrates, organic peroxides, and organic acids). The total SOA mass is also well represented in the condensed mechanism, to within 16% of the detailed mechanism under a wide range of conditions. The methodology described here is general, and may be used in general mechanism reduction problems.
Xia, A. G.; Michelangeli, D. V.; Makar, P. A.
2009-07-01
A detailed α-pinene oxidation mechanism was reduced systematically through the successive application of five mechanism reduction techniques. The resulting reduced mechanism preserves the ozone- and organic aerosol-forming properties of the original mechanism, while using less species. The methodologies employed included a directed relation graph method with error propagation (DRGEP, which removed a large number of redundant species and reactions), principal component analysis of the rate sensitivity matrix (PCA, used to remove unnecessary reactions), the quasi-steady-state approximation (QSSA, used to remove some QSS species), an iterative screening method (ISSA, which removes redundant species and reactions simultaneously), and a new lumping approach dependent on the hydrocarbon to NOx ratio (which reduced the number of species in mechanism subsets for specific hydrocarbon to NOx ranges). This multistage methodology results in a reduction ratio of 2.5 for the number of both species and reactions compared with the full mechanism. The simplified mechanism reproduces the important gas and aerosol phase species (the latter are examined in detail by individual condensing species as well as in classes according to four functional groups: PANs, nitrates, organic peroxides, and organic acids). The total SOA mass is also well represented in the condensed mechanism, to within 16% of the detailed mechanism under a wide range of conditions. The methodology described here is general, and may be used in general mechanism reduction problems.
... page: //medlineplus.gov/ency/article/003489.htm Total iron binding capacity To use the sharing features on this page, please enable JavaScript. Total iron binding capacity (TIBC) is a blood test to ...
Technique of total thyroidectomy
International Nuclear Information System (INIS)
Rao, R.S.
1999-01-01
It is essential to define the various surgical procedures that are carried out for carcinoma of the thyroid gland. They are thyroid gland, subtotal lobectomy, total thyroidectomy and near total thyroidectomy
... medlineplus.gov/ency/patientinstructions/000177.htm Total parenteral nutrition To use the sharing features on this page, please enable JavaScript. Total parenteral nutrition (TPN) is a method of feeding that bypasses ...
Total parenteral nutrition - infants
... medlineplus.gov/ency/article/007239.htm Total parenteral nutrition - infants To use the sharing features on this page, please enable JavaScript. Total parenteral nutrition (TPN) is a method of feeding that bypasses ...
DEFF Research Database (Denmark)
Finbow, Arthur; Frendrup, Allan; Vestergaard, Preben D.
cardinality then G is a total well dominated graph. In this paper we study composition and decomposition of total well dominated trees. By a reversible process we prove that any total well dominated tree can both be reduced to and constructed from a family of three small trees....
Sánchez Vergel, Alfredo; Fundación Valle de Lili
2002-01-01
Definición/Tipos de prótesis/ ¿Qué pacientes se podrían beneficiar de un reemplazo total de cadera?/Artrosis de cadera/Tipos de artrosis de cadera/Alternativas al reemplazo total de cadera/Preguntas frecuentes sobre el reemplazo total de cadera.
DEFF Research Database (Denmark)
Sadegh, Payman; Spall, J. C.
1998-01-01
The simultaneous perturbation stochastic approximation (SPSA) algorithm has attracted considerable attention for challenging optimization problems where it is difficult or impossible to obtain a direct gradient of the objective (say, loss) function. The approach is based on a highly efficient...... simultaneous perturbation approximation to the gradient based on loss function measurements. SPSA is based on picking a simultaneous perturbation (random) vector in a Monte Carlo fashion as part of generating the approximation to the gradient. This paper derives the optimal distribution for the Monte Carlo...... process. The objective is to minimize the mean square error of the estimate. The authors also consider maximization of the likelihood that the estimate be confined within a bounded symmetric region of the true parameter. The optimal distribution for the components of the simultaneous perturbation vector...
DEFF Research Database (Denmark)
Sadegh, Payman; Spall, J. C.
1997-01-01
The simultaneous perturbation stochastic approximation (SPSA) algorithm has recently attracted considerable attention for optimization problems where it is difficult or impossible to obtain a direct gradient of the objective (say, loss) function. The approach is based on a highly efficient...... simultaneous perturbation approximation to the gradient based on loss function measurements. SPSA is based on picking a simultaneous perturbation (random) vector in a Monte Carlo fashion as part of generating the approximation to the gradient. This paper derives the optimal distribution for the Monte Carlo...... process. The objective is to minimize the mean square error of the estimate. We also consider maximization of the likelihood that the estimate be confined within a bounded symmetric region of the true parameter. The optimal distribution for the components of the simultaneous perturbation vector is found...
Some properties of dual and approximate dual of fusion frames
Arefijamaal, Ali Akbar; Neyshaburi, Fahimeh Arabyani
2016-01-01
In this paper we extend the notion of approximate dual to fusion frames and present some approaches to obtain dual and approximate alternate dual fusion frames. Also, we study the stability of dual and approximate alternate dual fusion frames.
Approximate Model for Turbulent Stagnation Point Flow.
Energy Technology Data Exchange (ETDEWEB)
Dechant, Lawrence [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
Here we derive an approximate turbulent self-similar model for a class of favorable pressure gradient wedge-like flows, focusing on the stagnation point limit. While the self-similar model provides a useful gross flow field estimate this approach must be combined with a near wall model is to determine skin friction and by Reynolds analogy the heat transfer coefficient. The combined approach is developed in detail for the stagnation point flow problem where turbulent skin friction and Nusselt number results are obtained. Comparison to the classical Van Driest (1958) result suggests overall reasonable agreement. Though the model is only valid near the stagnation region of cylinders and spheres it nonetheless provides a reasonable model for overall cylinder and sphere heat transfer. The enhancement effect of free stream turbulence upon the laminar flow is used to derive a similar expression which is valid for turbulent flow. Examination of free stream enhanced laminar flow suggests that the rather than enhancement of a laminar flow behavior free stream disturbance results in early transition to turbulent stagnation point behavior. Excellent agreement is shown between enhanced laminar flow and turbulent flow behavior for high levels, e.g. 5% of free stream turbulence. Finally the blunt body turbulent stagnation results are shown to provide realistic heat transfer results for turbulent jet impingement problems.
Configuring Airspace Sectors with Approximate Dynamic Programming
Bloem, Michael; Gupta, Pramod
2010-01-01
In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.
Adaptive approximation of higher order posterior statistics
Lee, Wonjung
2014-02-01
Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively. © 2013 Elsevier Inc.
Rainbows: Mie computations and the Airy approximation.
Wang, R T; van de Hulst, H C
1991-01-01
Efficient and accurate computation of the scattered intensity pattern by the Mie formulas is now feasible for size parameters up to x = 50,000 at least, which in visual light means spherical drops with diameters up to 6 mm. We present a method for evaluating the Mie coefficients from the ratios between Riccati-Bessel and Neumann functions of successive order. We probe the applicability of the Airy approximation, which we generalize to rainbows of arbitrary p (number of internal reflections = p - 1), by comparing the Mie and Airy intensity patterns. Millimeter size water drops show a match in all details, including the position and intensity of the supernumerary maxima and the polarization. A fairly good match is still seen for drops of 0.1 mm. A small spread in sizes helps to smooth out irrelevant detail. The dark band between the rainbows is used to test more subtle features. We conclude that this band contains not only externally reflected light (p = 0) but also a sizable contribution f rom the p = 6 and p = 7 rainbows, which shift rapidly with wavelength. The higher the refractive index, the closer both theories agree on the first primary rainbow (p = 2) peak for drop diameters as small as 0.02 mm. This may be useful in supporting experimental work.
Approximate von Neumann entropy for directed graphs.
Ye, Cheng; Wilson, Richard C; Comin, César H; Costa, Luciano da F; Hancock, Edwin R
2014-05-01
In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.
Bond selective chemistry beyond the adiabatic approximation
Energy Technology Data Exchange (ETDEWEB)
Butler, L.J. [Univ. of Chicago, IL (United States)
1993-12-01
One of the most important challenges in chemistry is to develop predictive ability for the branching between energetically allowed chemical reaction pathways. Such predictive capability, coupled with a fundamental understanding of the important molecular interactions, is essential to the development and utilization of new fuels and the design of efficient combustion processes. Existing transition state and exact quantum theories successfully predict the branching between available product channels for systems in which each reaction coordinate can be adequately described by different paths along a single adiabatic potential energy surface. In particular, unimolecular dissociation following thermal, infrared multiphoton, or overtone excitation in the ground state yields a branching between energetically allowed product channels which can be successfully predicted by the application of statistical theories, i.e. the weakest bond breaks. (The predictions are particularly good for competing reactions in which when there is no saddle point along the reaction coordinates, as in simple bond fission reactions.) The predicted lack of bond selectivity results from the assumption of rapid internal vibrational energy redistribution and the implicit use of a single adiabatic Born-Oppenheimer potential energy surface for the reaction. However, the adiabatic approximation is not valid for the reaction of a wide variety of energetic materials and organic fuels; coupling between the electronic states of the reacting species play a a key role in determining the selectivity of the chemical reactions induced. The work described below investigated the central role played by coupling between electronic states in polyatomic molecules in determining the selective branching between energetically allowed fragmentation pathways in two key systems.
Hydration thermodynamics beyond the linear response approximation.
Raineri, Fernando O
2016-10-19
The solvation energetics associated with the transformation of a solute molecule at infinite dilution in water from an initial state A to a final state B is reconsidered. The two solute states have different potentials energies of interaction, [Formula: see text] and [Formula: see text], with the solvent environment. Throughout the A [Formula: see text] B transformation of the solute, the solvation system is described by a Hamiltonian [Formula: see text] that changes linearly with the coupling parameter ξ. By focusing on the characterization of the probability density [Formula: see text] that the dimensionless perturbational solute-solvent interaction energy [Formula: see text] has numerical value y when the coupling parameter is ξ, we derive a hierarchy of differential equation relations between the ξ-dependent cumulant functions of various orders in the expansion of the appropriate cumulant generating function. On the basis of this theoretical framework we then introduce an inherently nonlinear solvation model for which we are able to find analytical results for both [Formula: see text] and for the solvation thermodynamic functions. The solvation model is based on the premise that there is an upper or a lower bound (depending on the nature of the interactions considered) to the amplitude of the fluctuations of Y in the solution system at equilibrium. The results reveal essential differences in behavior for the model when compared with the linear response approximation to solvation, particularly with regards to the probability density [Formula: see text]. The analytical expressions for the solvation properties show, however, that the linear response behavior is recovered from the new model when the room for the thermal fluctuations in Y is not restricted by the existence of a nearby bound. We compare the predictions of the model with the results from molecular dynamics computer simulations for aqueous solvation, in which either (1) the solute
Coronal Loops: Evolving Beyond the Isothermal Approximation
Schmelz, J. T.; Cirtain, J. W.; Allen, J. D.
2002-05-01
Are coronal loops isothermal? A controversy over this question has arisen recently because different investigators using different techniques have obtained very different answers. Analysis of SOHO-EIT and TRACE data using narrowband filter ratios to obtain temperature maps has produced several key publications that suggest that coronal loops may be isothermal. We have constructed a multi-thermal distribution for several pixels along a relatively isolated coronal loop on the southwest limb of the solar disk using spectral line data from SOHO-CDS taken on 1998 Apr 20. These distributions are clearly inconsistent with isothermal plasma along either the line of sight or the length of the loop, and suggested rather that the temperature increases from the footpoints to the loop top. We speculated originally that these differences could be attributed to pixel size -- CDS pixels are larger, and more `contaminating' material would be expected along the line of sight. To test this idea, we used CDS iron line ratios from our data set to mimic the isothermal results from the narrowband filter instruments. These ratios indicated that the temperature gradient along the loop was flat, despite the fact that a more complete analysis of the same data showed this result to be false! The CDS pixel size was not the cause of the discrepancy; rather, the problem lies with the isothermal approximation used in EIT and TRACE analysis. These results should serve as a strong warning to anyone using this simplistic method to obtain temperature. This warning is echoed on the EIT web page: ``Danger! Enter at your own risk!'' In other words, values for temperature may be found, but they may have nothing to do with physical reality. Solar physics research at the University of Memphis is supported by NASA grant NAG5-9783. This research was funded in part by the NASA/TRACE MODA grant for Montana State University.
Kim, SungKun; Lee, Hunpyo
2017-06-01
Via a dynamical cluster approximation with N c = 4 in combination with a semiclassical approximation (DCA+SCA), we study the doped two-dimensional Hubbard model. We obtain a plaquette antiferromagnetic (AF) Mott insulator, a plaquette AF ordered metal, a pseudogap (or d-wave superconductor) and a paramagnetic metal by tuning the doping concentration. These features are similar to the behaviors observed in copper-oxide superconductors and are in qualitative agreement with the results calculated by the cluster dynamical mean field theory with the continuous-time quantum Monte Carlo (CDMFT+CTQMC) approach. The results of our DCA+SCA differ from those of the CDMFT+CTQMC approach in that the d-wave superconducting order parameters are shown even in the high doped region, unlike the results of the CDMFT+CTQMC approach. We think that the strong plaquette AF orderings in the dynamical cluster approximation (DCA) with N c = 4 suppress superconducting states with increasing doping up to strongly doped region, because frozen dynamical fluctuations in a semiclassical approximation (SCA) approach are unable to destroy those orderings. Our calculation with short-range spatial fluctuations is initial research, because the SCA can manage long-range spatial fluctuations in feasible computational times beyond the CDMFT+CTQMC tool. We believe that our future DCA+SCA calculations should supply information on the fully momentum-resolved physical properties, which could be compared with the results measured by angle-resolved photoemission spectroscopy experiments.
1999-01-01
This document concerns the award of a contract for the supply of 2522 austenitic steel shells for the cold masses of the LHC superconducting dipole magnets. Following a market survey carried out among 158 firms in nineteen Member States and seven firms in Japan, a call for tenders (IT-2468/LHC/LHC) was sent on 16 August 1999 to eight firms and one consortium consisting of two firms, in six Member States. By the closing date, CERN had received five tenders. The Finance Committee is invited to agree to the negotiation of a contract with the consortium ICARUS (BE) / BUTTING (DE), the lowest bidder, for the supply of 2522 austenitic steel shells for the cold masses of the LHC superconducting dipole magnets for a total amount of 18 723 773 euros (29 962 831 Swiss francs), subject to revision for contractual deliveries after 31 December 2001, with an option for the supply of up to 126 additional austenitic steel shells, for a total amount of 935 446 euros (1 496 953 Swiss francs), subject to revision for contractua...
Davies, Patrick Laurie
2014-01-01
Introduction IntroductionApproximate Models Notation Two Modes of Statistical AnalysisTowards One Mode of Analysis Approximation, Randomness, Chaos, Determinism ApproximationA Concept of Approximation Approximation Approximating a Data Set by a Model Approximation Regions Functionals and EquivarianceRegularization and Optimality Metrics and DiscrepanciesStrong and Weak Topologies On Being (almost) Honest Simulations and Tables Degree of Approximation and p-values ScalesStability of Analysis The Choice of En(α, P) Independence Procedures, Approximation and VaguenessDiscrete Models The Empirical Density Metrics and Discrepancies The Total Variation Metric The Kullback-Leibler and Chi-Squared Discrepancies The Po(λ) ModelThe b(k, p) and nb(k, p) Models The Flying Bomb Data The Student Study Times Data OutliersOutliers, Data Analysis and Models Breakdown Points and Equivariance Identifying Outliers and Breakdown Outliers in Multivariate Data Outliers in Linear Regression Outliers in Structured Data The Location...
Totalization Data Exchange (TDEX)
Social Security Administration — The Totalization Data Exchange (TDEX) process is an exchange between SSA and its foreign country partners to identify deaths of beneficiaries residing abroad. The...
Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation
Directory of Open Access Journals (Sweden)
Sheng-Cheng Huang
2017-01-01
Full Text Available Inspiratory flow limitation (IFL is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these, 16 cases were labeled as non-IFL and 78 as IFL which were further categorized into minor level (20 cases and severe level (58 cases of obstruction. In this study, algorithms using polynomial functions were proposed for extracting the features of IFL. Methods using first- to third-order polynomial approximations were applied to calculate the fitting curve to obtain the mean absolute error. The proposed algorithm is described by the weighted third-order (w.3rd-order polynomial function. For validation, a total of 1,093 inspiratory breaths were acquired as a test set. The accuracy levels of the classifications produced by the presented feature detection methods were analyzed, and the performance levels were compared using a misclassification cobweb. According to the results, the algorithm using the w.3rd-order polynomial approximation achieved an accuracy of 94.14% for IFL classification. We concluded that this algorithm achieved effective automatic IFL detection during sleep.
Approximate relativistic solutions for one-dimensional cylindrical coaxial diode
International Nuclear Information System (INIS)
Zeng Zhengzhong; Liu Guozhi; Shao Hao
2002-01-01
Two approximate analytical relativistic solutions for one-dimensional, space-charge-limited cylindrical coaxial diode are derived and utilized to compose best-fitting approximate solutions. Comparison of the best-fitting solutions with the numerical one demonstrates an error of about 11% for cathode-inside arrangement and 12% in the cathode-outside case for ratios of larger to smaller electrode radius from 1.2 to 10 and a voltage above 0.5 MV up to 5 MV. With these solutions the diode lengths for critical self-magnetic bending and for the condition under which the para-potential model validates are calculated to be longer than 1 cm up to more than 100 cm depending on voltage, radial dimensions and electrode arrangement. The influence of ion flow from the anode on the relativistic electron-only solution is numerically computed, indicating an enhancement factor of total diode current of 1.85 to 4.19 related to voltage, radial dimension and electrode arrangement
Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation.
Nguyen, Minh Luan; Hui, Siu Cheung; Fong, Alvis C M
2017-06-01
Parallel test paper generation is a biobjective distributed resource optimization problem, which aims to generate multiple similarly optimal test papers automatically according to multiple user-specified assessment criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in both of the collective objective functions. In this paper, we propose a submodular memetic approximation algorithm for solving this problem. The proposed algorithm is an adaptive memetic algorithm (MA), which exploits the submodular property of the collective objective functions to design greedy-based approximation algorithms for enhancing steps of the multiobjective MA. Synergizing the intensification of submodular local search mechanism with the diversification of the population-based submodular crossover operator, our algorithm can jointly optimize the total quality maximization objective and the fairness quality maximization objective. Our MA can achieve provable near-optimal solutions in a huge search space of large datasets in efficient polynomial runtime. Performance results on various datasets have shown that our algorithm has drastically outperformed the current techniques in terms of paper quality and runtime efficiency.
Strong interactions and quantum chromodynamics at the leading logarithm approximation
International Nuclear Information System (INIS)
Mantrach, A.
1982-11-01
This thesis is a contribution to the study of Quantum Chromodynamics (QCD) at the leading logarithm approximation (LLA). We have used the interpretation of the LLA in terms of the generalized parton model to propose tests of elementary processes of QCD in large transverse momentum photoproduction reactions. We have used the LLA to sum gluon radiation effects induced in high energy hadronic reactions. We have obtained this way a rise of the nucleon-nucleon total cross section of 15 mb from 60 GeV to 540 GeV. We have exploited the existence of a preconfinement transition in the LLA to study scaling violations in the framework of the dual parton model [fr
Local density approximation for a perturbative equation of state
International Nuclear Information System (INIS)
Astrakharchik, G. E.
2005-01-01
Knowledge of a series expansion of the equation of state provides a deep insight into the physical nature of a quantum system. Starting from a generic 'perturbative' equation of state of a homogeneous ultracold gas we make predictions for the properties of the gas in the presence of harmonic confinement. The local density approximation is used to obtain the chemical potential, total and release energies, Thomas-Fermi size, and density profile of a trapped system in three-, two-, and one-dimensional geometries. The frequencies of the lowest breathing modes are calculated using scaling and sum-rule approaches and could be used in an experiment as a high-precision tool for obtaining the expansion terms of the equation of state. The derived formalism is applied to dilute Bose and Fermi gases in different dimensions and to integrable one-dimensional models. The physical meaning of the expansion terms in a number of systems is discussed
Tikhonov Regularization and Total Least Squares
DEFF Research Database (Denmark)
Golub, G. H.; Hansen, Per Christian; O'Leary, D. P.
2000-01-01
formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that...
Approximate solutions of the Wei Hua oscillator using the Pekeris ...
Indian Academy of Sciences (India)
The analytical exact solutions of the wave equation with some exponential-type potentials are impossible for l = 0 states. So, the next best thing to do is to find approximate analytical solutions of a given potential by appropriate approximation techniques. Therefore, approximate schemes like the Pekeris approximation [6–8] ...
Approximate Implicitization of Parametric Curves Using Cubic Algebraic Splines
Directory of Open Access Journals (Sweden)
Xiaolei Zhang
2009-01-01
Full Text Available This paper presents an algorithm to solve the approximate implicitization of planar parametric curves using cubic algebraic splines. It applies piecewise cubic algebraic curves to give a global G2 continuity approximation to planar parametric curves. Approximation error on approximate implicitization of rational curves is given. Several examples are provided to prove that the proposed method is flexible and efficient.
Total Synthesis of Avrainvilleol.
Wegener, Aaron; Miller, Kenneth A
2017-11-03
The first total synthesis of the marine natural product avrainvilleol is reported. The total synthesis features the first application of the transition-metal-free coupling of a tosyl hydrazone and a boronic acid to the preparation of a complex natural product, and the first example of this coupling with a hindered diortho substituted hydrazone substrate.
Laparoscopic total pancreatectomy
Wang, Xin; Li, Yongbin; Cai, Yunqiang; Liu, Xubao; Peng, Bing
2017-01-01
Abstract Rationale: Laparoscopic total pancreatectomy is a complicated surgical procedure and rarely been reported. This study was conducted to investigate the safety and feasibility of laparoscopic total pancreatectomy. Patients and Methods: Three patients underwent laparoscopic total pancreatectomy between May 2014 and August 2015. We reviewed their general demographic data, perioperative details, and short-term outcomes. General morbidity was assessed using Clavien–Dindo classification and delayed gastric emptying (DGE) was evaluated by International Study Group of Pancreatic Surgery (ISGPS) definition. Diagnosis and Outcomes: The indications for laparoscopic total pancreatectomy were intraductal papillary mucinous neoplasm (IPMN) (n = 2) and pancreatic neuroendocrine tumor (PNET) (n = 1). All patients underwent laparoscopic pylorus and spleen-preserving total pancreatectomy, the mean operative time was 490 minutes (range 450–540 minutes), the mean estimated blood loss was 266 mL (range 100–400 minutes); 2 patients suffered from postoperative complication. All the patients recovered uneventfully with conservative treatment and discharged with a mean hospital stay 18 days (range 8–24 days). The short-term (from 108 to 600 days) follow up demonstrated 3 patients had normal and consistent glycated hemoglobin (HbA1c) level with acceptable quality of life. Lessons: Laparoscopic total pancreatectomy is feasible and safe in selected patients and pylorus and spleen preserving technique should be considered. Further prospective randomized studies are needed to obtain a comprehensive understanding the role of laparoscopic technique in total pancreatectomy. PMID:28099344
Total synthesis of ciguatoxin.
Hamajima, Akinari; Isobe, Minoru
2009-01-01
Something fishy: Ciguatoxin (see structure) is one of the principal toxins involved in ciguatera poisoning and the target of a total synthesis involving the coupling of three segments. The key transformations in this synthesis feature acetylene-dicobalthexacarbonyl complexation.
Energy Technology Data Exchange (ETDEWEB)
NONE
2005-02-01
This document presents the 2004 results of Total Group: consolidated account, special items, number of shares, market environment, adjustment for amortization of Sanofi-Aventis merger-related intangibles, 4. quarter 2004 results (operating and net incomes, cash flow), upstream (results, production, reserves, recent highlights), downstream (results, refinery throughput, recent highlights), chemicals (results, recent highlights), Total's full year 2004 results (operating and net income, cash flow), 2005 sensitivities, Total SA parent company accounts and proposed dividend, adoption of IFRS accounting, summary and outlook, main operating information by segment for the 4. quarter and full year 2004: upstream (combined liquids and gas production by region, liquids production by region, gas production by region), downstream (refined product sales by region, chemicals), Total financial statements: consolidated statement of income, consolidated balance sheet (assets, liabilities and shareholder's equity), consolidated statements of cash flows, business segments information. (J.S.)
International Nuclear Information System (INIS)
2005-02-01
This document presents the 2004 results of Total Group: consolidated account, special items, number of shares, market environment, adjustment for amortization of Sanofi-Aventis merger-related intangibles, 4. quarter 2004 results (operating and net incomes, cash flow), upstream (results, production, reserves, recent highlights), downstream (results, refinery throughput, recent highlights), chemicals (results, recent highlights), Total's full year 2004 results (operating and net income, cash flow), 2005 sensitivities, Total SA parent company accounts and proposed dividend, adoption of IFRS accounting, summary and outlook, main operating information by segment for the 4. quarter and full year 2004: upstream (combined liquids and gas production by region, liquids production by region, gas production by region), downstream (refined product sales by region, chemicals), Total financial statements: consolidated statement of income, consolidated balance sheet (assets, liabilities and shareholder's equity), consolidated statements of cash flows, business segments information. (J.S.)
Genoptraening efter total knaealloplastik
DEFF Research Database (Denmark)
Holm, Bente; Kehlet, Henrik
2009-01-01
The short- and long-term benefits of post-discharge physiotherapy regimens after total knee arthroplasty are debatable. A national survey including hospitals in Denmark that perform total knee arthroplasty showed a large variability in indication and regimen for post-knee arthroplasty rehabilitat......The short- and long-term benefits of post-discharge physiotherapy regimens after total knee arthroplasty are debatable. A national survey including hospitals in Denmark that perform total knee arthroplasty showed a large variability in indication and regimen for post-knee arthroplasty...... rehabilitation. Since hospital stay duration has decreased considerably, the need for post-discharge physiotherapy may also have changed. Thus, the indication for and types of rehabilitation programmes need to be studied within the context of fast-track knee arthroplasty....
Genoptraening efter total knaealloplastik
DEFF Research Database (Denmark)
Holm, Bente; Kehlet, Henrik
2009-01-01
The short- and long-term benefits of post-discharge physiotherapy regimens after total knee arthroplasty are debatable. A national survey including hospitals in Denmark that perform total knee arthroplasty showed a large variability in indication and regimen for post-knee arthroplasty rehabilitat......The short- and long-term benefits of post-discharge physiotherapy regimens after total knee arthroplasty are debatable. A national survey including hospitals in Denmark that perform total knee arthroplasty showed a large variability in indication and regimen for post-knee arthroplasty...... rehabilitation. Since hospital stay duration has decreased considerably, the need for post-discharge physiotherapy may also have changed. Thus, the indication for and types of rehabilitation programmes need to be studied within the context of fast-track knee arthroplasty. Udgivelsesdato: 2009-Feb-23...
International Nuclear Information System (INIS)
Sutherland, D.E.; Ferguson, R.M.; Simmons, R.L.; Kim, T.H.; Slavin, S.; Najarian, J.S.
1983-01-01
Total lymphoid irradiation by itself can produce sufficient immunosuppression to prolong the survival of a variety of organ allografts in experimental animals. The degree of prolongation is dose-dependent and is limited by the toxicity that occurs with higher doses. Total lymphoid irradiation is more effective before transplantation than after, but when used after transplantation can be combined with pharmacologic immunosuppression to achieve a positive effect. In some animal models, total lymphoid irradiation induces an environment in which fully allogeneic bone marrow will engraft and induce permanent chimerism in the recipients who are then tolerant to organ allografts from the donor strain. If total lymphoid irradiation is ever to have clinical applicability on a large scale, it would seem that it would have to be under circumstances in which tolerance can be induced. However, in some animal models graft-versus-host disease occurs following bone marrow transplantation, and methods to obviate its occurrence probably will be needed if this approach is to be applied clinically. In recent years, patient and graft survival rates in renal allograft recipients treated with conventional immunosuppression have improved considerably, and thus the impetus to utilize total lymphoid irradiation for its immunosuppressive effect alone is less compelling. The future of total lymphoid irradiation probably lies in devising protocols in which maintenance immunosuppression can be eliminated, or nearly eliminated, altogether. Such protocols are effective in rodents. Whether they can be applied to clinical transplantation remains to be seen
Totally optimal decision rules
Amin, Talha
2017-11-22
Optimality of decision rules (patterns) can be measured in many ways. One of these is referred to as length. Length signifies the number of terms in a decision rule and is optimally minimized. Another, coverage represents the width of a rule’s applicability and generality. As such, it is desirable to maximize coverage. A totally optimal decision rule is a decision rule that has the minimum possible length and the maximum possible coverage. This paper presents a method for determining the presence of totally optimal decision rules for “complete” decision tables (representations of total functions in which different variables can have domains of differing values). Depending on the cardinalities of the domains, we can either guarantee for each tuple of values of the function that totally optimal rules exist for each row of the table (as in the case of total Boolean functions where the cardinalities are equal to 2) or, for each row, we can find a tuple of values of the function for which totally optimal rules do not exist for this row.
Lyall, H; Elliot, D
1996-10-01
Eight patients underwent middle ray amputation with excision of the whole of the middle metacarpal and careful soft tissue repair. Excision of the base of the middle metacarpal allowed easier approximation of the index and ring rays without the tendency of these fingers to either scissor on finger flexion or to remain slightly apart. Complete removal of the middle metacarpal appears to allow the bases of the index and ring metacarpals to migrate together. The removal of the metacarpal base caused no functional problems and the technique created a good three-finger hand from both a functional and cosmetic point of view.
Approximating the Influence of a monotone Boolean function in O(\\sqrt{n}) query complexity
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Weinstein, Omri
2011-01-01
The {\\em Total Influence} ({\\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \\ifnum\\plusminus=1 $f: \\{\\pm1\\}^n \\longrightarrow \\{\\pm1\\}$, \\else $f: \\bitset^n \\to \\bitset$, \\fi which we denote by $I[f]$. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of $(1\\pm \\eps)$ by performing $O(\\frac{\\sqrt{n}\\log...
Cheon, Sooyoung
2013-02-16
Importance sampling and Markov chain Monte Carlo methods have been used in exact inference for contingency tables for a long time, however, their performances are not always very satisfactory. In this paper, we propose a stochastic approximation Monte Carlo importance sampling (SAMCIS) method for tackling this problem. SAMCIS is a combination of adaptive Markov chain Monte Carlo and importance sampling, which employs the stochastic approximation Monte Carlo algorithm (Liang et al., J. Am. Stat. Assoc., 102(477):305-320, 2007) to draw samples from an enlarged reference set with a known Markov basis. Compared to the existing importance sampling and Markov chain Monte Carlo methods, SAMCIS has a few advantages, such as fast convergence, ergodicity, and the ability to achieve a desired proportion of valid tables. The numerical results indicate that SAMCIS can outperform the existing importance sampling and Markov chain Monte Carlo methods: It can produce much more accurate estimates in much shorter CPU time than the existing methods, especially for the tables with high degrees of freedom. © 2013 Springer Science+Business Media New York.
Peng, Degao; Yang, Yang; Zhang, Peng; Yang, Weitao
2014-12-07
In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N(4)). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as ⟨Ŝ(2)⟩ are also developed and tested.
The Electrical Breakdown of Thin Dielectric Elastomers
DEFF Research Database (Denmark)
Zakaria, Shamsul Bin; Morshuis, Peter H. F.; Yahia, Benslimane Mohamed
2014-01-01
. In this study, we model the electrothermal breakdown in thin PDMS based dielectric elastomers in order to evaluate the thermal mechanisms behind the electrical failures. The objective is to predict the operation range of PDMS based dielectric elastomers with respect to the temperature at given electric field....... We performed numerical analysis with a quasi-steady state approximation to predict thermal runaway of dielectric elastomer films. We also studied experimentally the effect of temperature on dielectric properties of different PDMS dielectric elastomers. Different films with different percentages...
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Fallat, Shaun M
2011-01-01
Totally nonnegative matrices arise in a remarkable variety of mathematical applications. This book is a comprehensive and self-contained study of the essential theory of totally nonnegative matrices, defined by the nonnegativity of all subdeterminants. It explores methodological background, historical highlights of key ideas, and specialized topics.The book uses classical and ad hoc tools, but a unifying theme is the elementary bidiagonal factorization, which has emerged as the single most important tool for this particular class of matrices. Recent work has shown that bidiagonal factorization
Qualità totale e mobilità totale Total Quality and Total Mobility
Directory of Open Access Journals (Sweden)
Giuseppe Trieste
2010-05-01
Full Text Available FIABA ONLUS (Italian Fund for Elimination of Architectural Barriers was founded in 2000 with the aim of promoting a culture of equal opportunities and, above all, it has as its main goal to involve public and private institutions to create a really accessible and usable environment for everyone. Total accessibility, Total usability and Total mobility are key indicators to define quality of life within cities. A supportive environment that is free of architectural, cultural and psychological barriers allows everyone to live with ease and universality. In fact, people who access to goods and services in the urban context can use to their advantage time and space, so they can do their activities and can maintain relationships that are deemed significant for their social life. The main aim of urban accessibility is to raise the comfort of space for citizens, eliminating all barriers that discriminate people, and prevent from an equality of opportunity. “FIABA FUND - City of ... for the removal of architectural barriers” is an idea of FIABA that has already affected many regions of Italy as Lazio, Lombardy, Campania, Abruzzi and Calabria. It is a National project which provides for opening a bank account in the cities of referring, in which for the first time, all together, individuals and private and public institutions can make a donation to fund initiatives for the removal of architectural barriers within its own territory for a real and effective total accessibility. Last February the fund was launched in Rome with the aim of achieving a Capital without barriers and a Town European model of accessibility and usability. Urban mobility is a prerequisite to access to goods and services, and to organize activities related to daily life. FIABA promotes the concept of sustainable mobility for all, supported by the European Commission’s White Paper. We need a cultural change in management and organization of public means, which might focus on
Coefficients Calculation in Pascal Approximation for Passive Filter Design
Directory of Open Access Journals (Sweden)
George B. Kasapoglu
2018-02-01
Full Text Available The recently modified Pascal function is further exploited in this paper in the design of passive analog filters. The Pascal approximation has non-equiripple magnitude, in contrast of the most well-known approximations, such as the Chebyshev approximation. A novelty of this work is the introduction of a precise method that calculates the coefficients of the Pascal function. Two examples are presented for the passive design to illustrate the advantages and the disadvantages of the Pascal approximation. Moreover, the values of the passive elements can be taken from tables, which are created to define the normalized values of these elements for the Pascal approximation, as Zverev had done for the Chebyshev, Elliptic, and other approximations. Although Pascal approximation can be implemented to both passive and active filter designs, a passive filter design is addressed in this paper, and the benefits and shortcomings of Pascal approximation are presented and discussed.
Total Water Management - Report
There is a growing need for urban water managers to take a more holistic view of their water resource systems as population growth, urbanization, and current operations put different stresses on the environment and urban infrastructure. Total Water Management (TWM) is an approac...
DEFF Research Database (Denmark)
Schrøder, Henrik M.; Petersen, Michael M.
2016-01-01
Total knee arthroplasty (TKA) is a successful treatment of the osteoarthritic knee, which has increased dramatically over the last 30 years. The indication is a painful osteoarthritic knee with relevant radiographic findings and failure of conservative measures like painkillers and exercise...
Total versus subtotal hysterectomy
DEFF Research Database (Denmark)
Gimbel, Helga; Zobbe, Vibeke; Andersen, Anna Birthe
2005-01-01
The aim of this study was to compare total and subtotal abdominal hysterectomy for benign indications, with regard to urinary incontinence, postoperative complications, quality of life (SF-36), constipation, prolapse, satisfaction with sexual life, and pelvic pain at 1-year postoperative. Eighty...
Total Quality Management Seminar.
Massachusetts Career Development Inst., Springfield.
This booklet is one of six texts from a workplace literacy curriculum designed to assist learners in facing the increased demands of the workplace. The booklet contains seven sections that cover the following topics: (1) meaning of total quality management (TQM); (2) the customer; (3) the organization's culture; (4) comparison of management…
Total Quality Management Simplified.
Arias, Pam
1995-01-01
Maintains that Total Quality Management (TQM) is one method that helps to monitor and improve the quality of child care. Lists four steps for a child-care center to design and implement its own TQM program. Suggests that quality assurance in child-care settings is an ongoing process, and that TQM programs help in providing consistent, high-quality…
Saya, J.M.; Vos, K.; Klein Nijenhuis, R.A.; van Maarseveen, J.H.; Ingemann, S.; Hiemstra, H.
2015-01-01
A total synthesis of the sesquiterpene lactone aquatolide has been accomplished. The central step is an intramolecular [2 + 2]-photocycloaddition of an allene onto an alpha,beta-unsaturated delta-lactone. Other key steps are an intramolecular Horner-Wadsworth-Emmons reaction to close the lactone and
CSF total protein is a test to determine the amount of protein in your spinal fluid, also called cerebrospinal fluid (CSF). ... The normal protein range varies from lab to lab, but is typically about 15 to 60 milligrams per deciliter (mg/dL) ...
International Nuclear Information System (INIS)
2004-01-01
This annual report of the Group Total brings information and economic data on the following topics, for the year 2004: the corporate governance, the corporate social responsibility, the shareholder notebook, the management report, the activities, the upstream (exploration and production) and downstream (refining and marketing) operating, chemicals and other matters. (A.L.B.)
DEFF Research Database (Denmark)
Zachariassen, Frederik
2007-01-01
Total Cost of Ownership (TCO), som giver et bud på, hvordan virksomheder kan opnå en bedre indsigt i, hvilke leverandører der forårsager hvilke omkostninger og dermed danne et forbedret beslutningsgrundlag for besparelser i leverandørleddet. I artiklen argumenteres først og fremmest for, hvorfor TCO er...
Comparison of four support-vector based function approximators
de Kruif, B.J.; de Vries, Theodorus J.A.
2004-01-01
One of the uses of the support vector machine (SVM), as introduced in V.N. Vapnik (2000), is as a function approximator. The SVM and approximators based on it, approximate a relation in data by applying interpolation between so-called support vectors, being a limited number of samples that have been
Meta-Regression Approximations to Reduce Publication Selection Bias
Stanley, T. D.; Doucouliagos, Hristos
2014-01-01
Publication selection bias is a serious challenge to the integrity of all empirical sciences. We derive meta-regression approximations to reduce this bias. Our approach employs Taylor polynomial approximations to the conditional mean of a truncated distribution. A quadratic approximation without a linear term, precision-effect estimate with…
Three-loop Phi-derivable approximation in QED
Andersen, J.O.; Strickland, M.
2005-01-01
In this paper we examine 9Φ-derivable approximations in QED, General theorems tell us that the gauge dependence of the n-loop Φ-derivable approximation shows up at order g2n where g is the coupling constant. We consider the gauge dependence of the two-loop Φ-derivable approximation to the Debye mass
On Love's approximation for fluid-filled elastic tubes
International Nuclear Information System (INIS)
Caroli, E.; Mainardi, F.
1980-01-01
A simple procedure is set up to introduce Love's approximation for wave propagation in thin-walled fluid-filled elastic tubes. The dispersion relation for linear waves and the radial profile for fluid pressure are determined in this approximation. It is shown that the Love approximation is valid in the low-frequency regime. (author)
Approximation Properties of Certain Summation Integral Type Operators
Directory of Open Access Journals (Sweden)
Patel P.
2015-03-01
Full Text Available In the present paper, we study approximation properties of a family of linear positive operators and establish direct results, asymptotic formula, rate of convergence, weighted approximation theorem, inverse theorem and better approximation for this family of linear positive operators.
Iterative Approximate Solutions of Kinetic Equations for Reversible Enzyme Reactions
Khoshnaw, S.
2012-01-01
We study kinetic models of reversible enzyme reactions and compare two techniques for analytic approximate solutions of the model. Analytic approximate solutions of non-linear reaction equations for reversible enzyme reactions are calculated using the Homotopy Perturbation Method (HPM) and the Simple Iteration Method (SIM). The results of the approximations are similar. The Matlab programs are included in appendices.
Approximate Noether symmetries and collineations for regular perturbative Lagrangians
Paliathanasis, Andronikos; Jamal, Sameerah
2018-01-01
Regular perturbative Lagrangians that admit approximate Noether symmetries and approximate conservation laws are studied. Specifically, we investigate the connection between approximate Noether symmetries and collineations of the underlying manifold. In particular we determine the generic Noether symmetry conditions for the approximate point symmetries and we find that for a class of perturbed Lagrangians, Noether symmetries are related to the elements of the Homothetic algebra of the metric which is defined by the unperturbed Lagrangian. Moreover, we discuss how exact symmetries become approximate symmetries. Finally, some applications are presented.
Perturbative corrections for approximate inference in gaussian latent variable models
DEFF Research Database (Denmark)
Opper, Manfred; Paquet, Ulrich; Winther, Ole
2013-01-01
Expectation Propagation (EP) provides a framework for approximate inference. When the model under consideration is over a latent Gaussian field, with the approximation being Gaussian, we show how these approximations can systematically be corrected. A perturbative expansion is made of the exact b...... illustrate on tree-structured Ising model approximations. Furthermore, they provide a polynomial-time assessment of the approximation error. We also provide both theoretical and practical insights on the exactness of the EP solution. © 2013 Manfred Opper, Ulrich Paquet and Ole Winther....
DEFF Research Database (Denmark)
Munch, Anders V.
2016-01-01
The idea of design as an art made not only for the people, but also by the people is an old dream going back at least to William Morris. It is, however, reappearing vigoriously in many kinds of design activism and grows out of the visions of a Total Design of society. The ideas of participation b...... for? To which degree should everyone be educated in ’design literacy’ to participate? Total design of participation is an artistic intervention in society and must be discussed in this utopian tradition....... by Tim Brown can be compared to considerations by László Moholy-Nagy and Walter Gropuis on the training and education of active and capable citizens. This opens, though, some dilemmas to discuss: To what extend is the capability of creativity then a (pre)condition to be a citizen of the society wished...
Directory of Open Access Journals (Sweden)
Anca ȘERBAN
2013-06-01
Full Text Available The purpose of this paper is to present the evolution of the Balanced Scorecard from a measurement instrument to a strategic performance management tool and to highlight the advantages of implementing the Total Performance Scorecard, especially for Human Resource Management. The study has been accomplished using the methodology of bibliographic study and various secondary sources. Implementing the classical Balanced Scorecard indicated over the years, repeatedly failure. It can be indicated that the crucial level is determined by the learning and growth perspective. It has been developed from a human perspective, which focused on staff satisfaction, innovation perspective with focus on future developments. Integrating the Total Performance Scorecard in an overall framework assures the company’s success, by keeping track of the individual goals, the company’s objectives and strategic directions. Like this, individual identity can be linked to corporate brand, individual aspirations to business goals and individual learning objectives to needed organizational capabilities.
International Nuclear Information System (INIS)
2003-01-01
This document presents the 2003 results of Total Group: consolidated account, special items, number of shares, market environment, 4. quarter 2003 results, full year 2003 results, upstream (key figures, proved reserves), downstream key figures, chemicals key figures, parent company accounts and proposed dividends, 2004 sensitivities, summary and outlook, operating information by segment for the 4. quarter and full year 2003: upstream (combined liquids and gas production by region, liquids production by region, gas production by region), downstream (refinery throughput by region, refined product sales by region, chemicals), impact of allocating contribution of Cepsa to net operating income by business segment: equity in income (loss) and affiliates and other items, Total financial statements: consolidated statement of income, consolidated balance sheet (assets, liabilities and shareholder's equity), consolidated statements of cash flows, business segments information. (J.S.)
Outpatient Total Joint Arthroplasty.
Bert, Jack M; Hooper, Jessica; Moen, Sam
2017-12-01
Outpatient total joint arthroplasty (OTJA) allows for a safe, cost effective pathway for appropriately selected patients. With current pressures on arthroplasty surgeons and their associated institutions to reduce costs per episode of care, it is important to define the steps and challenges associated with establishing an outpatient arthroplasty program. Several studies have outlined techniques of selecting patients suitable for this type of postoperative pathway. With emerging concerns about patients who undergo outpatient arthroplasty being at increased risk of medical complications, which may lessen projected cost savings, it is important to identify value-based strategies to optimize patient recovery after OTJA. This article reviews digital techniques for patient selection and data collection, operating room efficiency systems, and provides a summary of methods to build and maintain value in outpatient total joint replacement within the framework of bundled payment reimbursement.
Totally parallel multilevel algorithms
Frederickson, Paul O.
1988-01-01
Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.
Andrijašević Maja
2008-01-01
The focus of competitive "battle" shifted from the price towards non-price instruments, above all, towards quality that became the key variable for profitability increase and achievement of better comparative position of a company. Under such conditions, management of a company, which, according to the established and certified system of total quality, strives towards achieving of a better market position, faces the problem of quality cost measurement and determination. Management, above all,...
International Nuclear Information System (INIS)
2006-01-01
This annual report presents the activities and results of TOTAL S.A., french society on oil and gas. It deals with statistics, the managers, key information on financial data and risk factors, information on the Company, unresolved Staff Comments, employees, major Shareholders, consolidated statements, markets, security, financial risks, defaults dividend arrearages and delinquencies, controls and procedures, code of ethics and financial statements. (A.L.B.)
Lohmann, Ulrike; Rotstayn, Leon; Storelvmo, Trude; Jones, Andrew; Menon, Surabi; Quaas, Johannes; Ekman, Annica M. L.; Koch, Dorothy; Ruedy, Reto A.
2015-01-01
Uncertainties in aerosol radiative forcings, especially those associated with clouds, contribute to a large extent to uncertainties in the total anthropogenic forcing. The interaction of aerosols with clouds and radiation introduces feedbacks which can affect the rate of precipitation formation. In former assessments of aerosol radiative forcings, these effects have not been quantified. Also, with global aerosol-climate models simulating interactively aerosols and cloud microphysical prope...
Cervical Total Disc Arthroplasty
Basho, Rahul; Hood, Kenneth A.
2012-01-01
Symptomatic adjacent segment degeneration of the cervical spine remains problematic for patients and surgeons alike. Despite advances in surgical techniques and instrumentation, the solution remains elusive. Spurred by the success of total joint arthroplasty in hips and knees, surgeons and industry have turned to motion preservation devices in the cervical spine. By preserving motion at the diseased level, the hope is that adjacent segment degeneration can be prevented. Multiple cervical disc...
Czech Academy of Sciences Publication Activity Database
Bonacina, I.; Galesi, N.; Thapen, Neil
2016-01-01
Roč. 45, č. 5 (2016), s. 1894-1909 ISSN 0097-5397 R&D Projects: GA ČR GBP202/12/G061 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : total space * resolution random CNFs * proof complexity Subject RIV: BA - General Mathematics Impact factor: 1.433, year: 2016 http://epubs.siam.org/doi/10.1137/15M1023269
International Nuclear Information System (INIS)
Rubio, B.; Gelletly, W.
2007-01-01
The problem of determining the distribution of beta decay strength (B(GT)) as a function of excitation energy in the daughter nucleus is discussed. Total Absorption Spectroscopy is shown to provide a way of determining the B(GT) precisely. A brief history of such measurements and a discussion of the advantages and disadvantages of this technique, is followed by examples of two recent studies using the technique. (authors)
Methods of Approximation Theory in Complex Analysis and Mathematical Physics
Saff, Edward
1993-01-01
The book incorporates research papers and surveys written by participants ofan International Scientific Programme on Approximation Theory jointly supervised by Institute for Constructive Mathematics of University of South Florida at Tampa, USA and the Euler International Mathematical Instituteat St. Petersburg, Russia. The aim of the Programme was to present new developments in Constructive Approximation Theory. The topics of the papers are: asymptotic behaviour of orthogonal polynomials, rational approximation of classical functions, quadrature formulas, theory of n-widths, nonlinear approximation in Hardy algebras,numerical results on best polynomial approximations, wavelet analysis. FROM THE CONTENTS: E.A. Rakhmanov: Strong asymptotics for orthogonal polynomials associated with exponential weights on R.- A.L. Levin, E.B. Saff: Exact Convergence Rates for Best Lp Rational Approximation to the Signum Function and for Optimal Quadrature in Hp.- H. Stahl: Uniform Rational Approximation of x .- M. Rahman, S.K. ...
Discrete extrinsic curvatures and approximation of surfaces by polar polyhedra
Garanzha, V. A.
2010-01-01
Duality principle for approximation of geometrical objects (also known as Eu-doxus exhaustion method) was extended and perfected by Archimedes in his famous tractate “Measurement of circle”. The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygons (polyhedra) which approximate curvilinear convex body. This sequence allows to approximate length of curve, as well as area and volume of the bodies and to obtain error estimates for approximation. In this work it is shown that a sequence of pairs of locally polar polyhedra allows to construct piecewise-affine approximation to spherical Gauss map, to construct convergent point-wise approximations to mean and Gauss curvature, as well as to obtain natural discretizations of bending energies. The Suggested approach can be applied to nonconvex surfaces and in the case of multiple dimensions.
Sobredentadura total superior implantosoportada
Directory of Open Access Journals (Sweden)
Luis Orlando Rodríguez García
2010-06-01
Full Text Available Se presenta un caso de un paciente desdentado total superior, rehabilitado en la consulta de implantología de la Clínica "Pedro Ortiz" del municipio Habana del Este en Ciudad de La Habana, Cuba, en el año 2009, mediante prótesis sobre implantes osteointegrados, técnica que se ha incorporado a la práctica estomatológica en Cuba como alternativa al tratamiento convencional en los pacientes desdentados totales. Se siguió un protocolo que comprendió una fase quirúrgica, procedimiento con o sin realización de colgajo y carga precoz o inmediata. Se presenta un paciente masculino de 56 años de edad, que acudió a la consulta multidisciplinaria, preocupado, porque se le habían elaborado tres prótesis en los últimos dos años y ninguna reunía los requisitos de retención que él necesitaba para sentirse seguro y cómodo con las mismas. El resultado final fue la satisfacción total del paciente, con el mejoramiento de la calidad estética y funcional.
New Trends in Approximation Theory : in Memory of André Boivin
Manolaki, Myrto; Gauthier, Paul
2018-01-01
The international conference entitled "New Trends in Approximation Theory" was held at the Fields Institute, in Toronto, from July 25 until July 29, 2016. The conference was fondly dedicated to the memory of our unique friend and colleague, André Boivin, who gave tireless service in Canada until his very last moment of his life in October 2014. The impact of his warm personality and his fine work on Complex Approximation Theory was reflected by the mathematical excellence and the wide research range of the 37 participants. In total there were 27 talks, delivered by well-established mathematicians and young researchers. In particular, 19 invited lectures were delivered by leading experts of the field, from 8 different countries. The wide variety of presentations composed a mosaic of aspects of approximation theory, highlighting interesting connections with important contemporary areas of Analysis. Primary topics discussed include application of approximation theory (isoperimetric inequalities, construction of...
Uncertainty and approximate reasoning in waste pretreatment planning
International Nuclear Information System (INIS)
Agnew, S.F.; Eisenhawer, S.W.; Bott, T.F.
1998-01-01
Waste pretreatment process planning within the DOE complex must consider many different outcomes in order to perform the tradeoffs necessary to accomplish this important national mission. One of the difficulties encountered by many who assess these tradeoffs is that the complexity of this problem taxes the abilities of any single person or small group of individuals. For example, uncertainties in waste composition as well as process efficiency are well known yet incompletely considered in the search for optimum solutions. This paper describes a tool, the pre-treatment Process Analysis Tool (PAT), for evaluating tank waste pretreatment options at Hanford, Oak Ridge, Idaho National Environmental and Engineering Laboratory, and Savannah River Sites. The PAT propagates uncertainty in both tank waste composition and process partitioning into a set of ten outcomes. These outcomes are, for example, total cost, Cs-137 in iLAW, iHLW MT, and so on. Tradeoffs among outcomes are evaluated or scored by means of an approximate reasoning module that uses linguistic bases to evaluate tradeoffs for each process based on user valuations of outcomes
SAR image regularization with fast approximate discrete minimization.
Denis, Loïc; Tupin, Florence; Darbon, Jérôme; Sigelle, Marc
2009-07-01
Synthetic aperture radar (SAR) images, like other coherent imaging modalities, suffer from speckle noise. The presence of this noise makes the automatic interpretation of images a challenging task and noise reduction is often a prerequisite for successful use of classical image processing algorithms. Numerous approaches have been proposed to filter speckle noise. Markov random field (MRF) modelization provides a convenient way to express both data fidelity constraints and desirable properties of the filtered image. In this context, total variation minimization has been extensively used to constrain the oscillations in the regularized image while preserving its edges. Speckle noise follows heavy-tailed distributions, and the MRF formulation leads to a minimization problem involving nonconvex log-likelihood terms. Such a minimization can be performed efficiently by computing minimum cuts on weighted graphs. Due to memory constraints, exact minimization, although theoretically possible, is not achievable on large images required by remote sensing applications. The computational burden of the state-of-the-art algorithm for approximate minimization (namely the alpha -expansion) is too heavy specially when considering joint regularization of several images. We show that a satisfying solution can be reached, in few iterations, by performing a graph-cut-based combinatorial exploration of large trial moves. This algorithm is applied to joint regularization of the amplitude and interferometric phase in urban area SAR images.
Toyoizumi, Taro; Rad, Kamiar Rahnama; Paninski, Liam
2009-05-01
There has recently been a great deal of interest in inferring network connectivity from the spike trains in populations of neurons. One class of useful models that can be fit easily to spiking data is based on generalized linear point process models from statistics. Once the parameters for these models are fit, the analyst is left with a nonlinear spiking network model with delays, which in general may be very difficult to understand analytically. Here we develop mean-field methods for approximating the stimulus-driven firing rates (in both the time-varying and steady-state cases), auto- and cross-correlations, and stimulus-dependent filtering properties of these networks. These approximations are valid when the contributions of individual network coupling terms are small and, hence, the total input to a neuron is approximately gaussian. These approximations lead to deterministic ordinary differential equations that are much easier to solve and analyze than direct Monte Carlo simulation of the network activity. These approximations also provide an analytical way to evaluate the linear input-output filter of neurons and how the filters are modulated by network interactions and some stimulus feature. Finally, in the case of strong refractory effects, the mean-field approximations in the generalized linear model become inaccurate; therefore, we introduce a model that captures strong refractoriness, retains all of the easy fitting properties of the standard generalized linear model, and leads to much more accurate approximations of mean firing rates and cross-correlations that retain fine temporal behaviors.
On the variability of total solar irradiance
Pelt, Jaan; Kärner, Olavi
2012-01-01
Knowing the variability of total solar irradiance (TSI) at the top of the atmosphere is crucial for specifying solar influence to climate variability. Satellite measured TSI data are available only for the last 32 years. But there is an opportunity to estimate approximate daily TSI values on the basis of the observed variability of solar activity. A common approach is based using data for Wolf sunspot numbers. Series of daily data from the DAVOS based TSI starting from 1978 have been compared...
The reactive content of the proton-nucleus impulse - approximation Dirac optical potential
International Nuclear Information System (INIS)
Carlson, B.V.; Isidro Filho, M.P.; Hussein, M.S.
1984-01-01
The total reaction cross sections for intermediate energy proton scattering on 40 Ca and 208 Pb are calculated within the Dirac-Eikonal formalism. Comparison with data indicate that the recently proposed impulse-approximation Dirac optical potential for nucleon-nucleus scattering, is not absorptive enough. (Author) [pt
International Nuclear Information System (INIS)
2004-01-01
This 2003 annual report of the Group Total provides economical results and information of the society on the following topics: keys data, the corporate governance (Directors charter, board of directors, audit committee, nomination and remuneration committee, internal control procedures, compensation of directors and executive officers), the corporate social responsibility (environmental stewardship, the future of energy management, the safety enhancement, the human resources, ethics and local development), the investor relations, the management report, the upstream exploration and production, the downstream refining, marketing, trading and shipping, the chemicals and financial and legal information. (A.L.B.)
Total Synthesis of Strychnine.
Lee, Geun Seok; Namkoong, Gil; Park, Jisook; Chen, David Y-K
2017-11-16
The total synthesis of the flagship Strychnos indole alkaloid, strychnine, has been accomplished. The developed synthetic sequence features a novel vinylogous 1,4-addition, a challenging iodinium salt mediated silyl enol ether arylation, a palladium-catalyzed Heck reaction, and a streamlined late-stage conversion to strychnine. Furthermore, an application of asymmetric counterion-directed catalysis (ACDC) in the context of target-oriented organic synthesis has been rendered access to an optically active material. The synthetic sequence described herein represents the most concise entry to optically active strychnine to date. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Total Synthesis of Hyperforin.
Ting, Chi P; Maimone, Thomas J
2015-08-26
A 10-step total synthesis of the polycyclic polyprenylated acylphloroglucinol (PPAP) natural product hyperforin from 2-methylcyclopent-2-en-1-one is reported. This route was enabled by a diketene annulation reaction and an oxidative ring expansion strategy designed to complement the presumed biosynthesis of this complex meroterpene. The described work enables the preparation of a highly substituted bicyclo[3.3.1]nonane-1,3,5-trione motif in only six steps and thus serves as a platform for the construction of easily synthesized, highly diverse PPAPs modifiable at every position.
Directory of Open Access Journals (Sweden)
Andrijašević Maja
2008-01-01
Full Text Available The focus of competitive "battle" shifted from the price towards non-price instruments, above all, towards quality that became the key variable for profitability increase and achievement of better comparative position of a company. Under such conditions, management of a company, which, according to the established and certified system of total quality, strives towards achieving of a better market position, faces the problem of quality cost measurement and determination. Management, above all, cost accounting can help in solving of this problem, but the question is how much of its potential is being used for that purpose.
DEFF Research Database (Denmark)
Schrøder, Henrik M.; Petersen, Michael M.
2016-01-01
Total knee arthroplasty (TKA) is a successful treatment of the osteoarthritic knee, which has increased dramatically over the last 30 years. The indication is a painful osteoarthritic knee with relevant radiographic findings and failure of conservative measures like painkillers and exercise...... surgeon seems to positively influence the rate of surgical complications and implant survival. The painful TKA knee should be thoroughly evaluated, but not revised except if a relevant indication can be established. The most frequent indications for revision are: aseptic loosening, instability, infection...
Supravaginal eller total hysterektomi?
DEFF Research Database (Denmark)
Edvardsen, L; Madsen, E M
1994-01-01
is examined. It is concluded that the risk of developing carcinoma of the cervical stump is low, and no longer a weighty indication for the total in preference to the supravaginal hysterectomy as long as subsequent screening of the cervix is performed. At the same time it is important to inform the women...... carefully after the supravaginal operation in order to secure that subsequent screening actually is taking place. One must have a normal smear and offer a colposcopic examination before the operation. In general the rate of complications after both kind of hysterectomies is low. However, a few new studies...
International Nuclear Information System (INIS)
2004-01-01
This report presents the activities and results of the Group Total-Fina-Elf for the year 2004. It brings information and economic data on the following topics: the corporate and business; the upstream activities with the reserves, the costs, standardized measure and changes of discounted future net cash flow,oil and gas acreage, drilling, liquefied natural gas, pipelines; downstream activities with refining and marketing maps, refinery, petroleum products, sales, retail gasoline outlets; chemicals with sales and operating income by sector, major applications, base chemicals and polymers, intermediates and performance polymers. (A.L.B.)
International Nuclear Information System (INIS)
2003-01-01
This report presents the activities and results of the Group Total-Fina-Elf for the year 2003. It brings information and economic data on the following topics: the corporate and business; the upstream activities with the reserves, the costs, standardized measure and changes of discounted future net cash flow,oil and gas acreage, drilling, liquefied natural gas, pipelines; downstream activities with refining and marketing maps, refinery, petroleum products, sales, retail gasoline outlets; chemicals with sales and operating income by sector, major applications, base chemicals and polymers, intermediates and performance polymers. (A.L.B.)
International Nuclear Information System (INIS)
Vogel, C.E.
1991-01-01
Confronted by changing market conditions and increased global competition, in 1983 the Commercial Nuclear Fuel Division (CNFD) of Westinghouse Electric embarked on an ambitious plan to make total quality the centerpiece of its long-term business strategy. Five years later, the division's efforts in making continuous quality improvement a way of life among its more than 2,000 employees gained national recognition when it was named a charter recipient of the Malcolm Baldridge National Quality Award. What CNFD achieved during the 1980s was a cultural transformation, characterized by an empowered work force committed to a common vision. The company's quality program development strategy is described
Total Logistic Plant Solutions
Directory of Open Access Journals (Sweden)
Dusan Dorcak
2016-02-01
Full Text Available The Total Logistics Plant Solutions, plant logistics system - TLPS, based on the philosophy of advanced control processes enables complex coordination of business processes and flows and the management and scheduling of production in the appropriate production plans and planning periods. Main attributes of TLPS is to create a comprehensive, multi-level, enterprise logistics information system, with a certain degree of intelligence, which accepts the latest science and research results in the field of production technology and logistics. Logistic model of company understands as a system of mutually transforming flows of materials, energy, information, finance, which is realized by chain activities and operations
Approximate solutions for certain bidomain problems in electrocardiography
Johnston, Peter R.
2008-10-01
The simulation of problems in electrocardiography using the bidomain model for cardiac tissue often creates issues with satisfaction of the boundary conditions required to obtain a solution. Recent studies have proposed approximate methods for solving such problems by satisfying the boundary conditions only approximately. This paper presents an analysis of their approximations using a similar method, but one which ensures that the boundary conditions are satisfied during the whole solution process. Also considered are additional functional forms, used in the approximate solutions, which are more appropriate to specific boundary conditions. The analysis shows that the approximations introduced by Patel and Roth [Phys. Rev. E 72, 051931 (2005)] generally give accurate results. However, there are certain situations where functional forms based on the geometry of the problem under consideration can give improved approximations. It is also demonstrated that the recent methods are equivalent to different approaches to solving the same problems introduced 20years earlier.
On approximation of flat Banach modules by free modules
International Nuclear Information System (INIS)
Aristov, O Yu
2005-01-01
The local structure of flat Banach modules is considered; in particular, it is shown that if a flat module has the approximation property, then it is freely approximable, that is, the identity operator on it is approximated by operators each of which admits factorization through a free Banach module satisfying a natural finiteness condition. Among the maps involved in the factorization, the first is approximately multiplicative up to ε on compact sets, and the second is exactly a morphism of modules. The properties of freely approximable and approximately projective modules are studied. It is proved that the standard complex for calculating the derived functor Ext is locally asymptotically exact in the first term for an arbitrary second argument if and only if its first argument is a flat Banach module.
Precise analytic approximations for the Bessel function J1 (x)
Maass, Fernando; Martin, Pablo
2018-03-01
Precise and straightforward analytic approximations for the Bessel function J1 (x) have been found. Power series and asymptotic expansions have been used to determine the parameters of the approximation, which is as a bridge between both expansions, and it is a combination of rational and trigonometric functions multiplied with fractional powers of x. Here, several improvements with respect to the so called Multipoint Quasirational Approximation technique have been performed. Two procedures have been used to determine the parameters of the approximations. The maximum absolute errors are in both cases smaller than 0.01. The zeros of the approximation are also very precise with less than 0.04 per cent for the first one. A second approximation has been also determined using two more parameters, and in this way the accuracy has been increased to less than 0.001.
Space-efficient path-reporting approximate distance oracles
DEFF Research Database (Denmark)
Elkin, Michael; Neiman, Ofer; Wulff-Nilsen, Christian
2016-01-01
We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlogn space bound of Thorup and Zwick if approximate paths rather than distances need...... to be reported. For approximate distance labeling and labeled routing, we break the previously best known space bound of O(logn) words per vertex. The cost for such space efficiency is an increased stretch....
Approximation for a large-angle simple pendulum period
International Nuclear Information System (INIS)
Belendez, A; Rodes, J J; Belendez, T; Hernandez, A
2009-01-01
An approximation scheme to obtain the period for large amplitude oscillations of a simple pendulum is analysed and discussed. The analytical approximate formula for the period is the same as that suggested by Hite (2005 Phys. Teach. 43 290), but it is now obtained analytically by means of a term-by-term comparison of the power-series expansion for the approximate period with the corresponding series for the exact period. (letters and comments)
Multijet final states: exact results and the leading pole approximation
International Nuclear Information System (INIS)
Ellis, R.K.; Owens, J.F.
1984-09-01
Exact results for the process gg → ggg are compared with those obtained using the leading pole approximation. Regions of phase space where the approximation breaks down are discussed. A specific example relevant for background estimates to W boson production is presented. It is concluded that in this instance the leading pole approximation may underestimate the standard QCD background by more than a factor of two in certain kinematic regions of physical interest
Fractal image coding by an approximation of the collage error
Salih, Ismail; Smith, Stanley H.
1998-12-01
In fractal image compression an image is coded as a set of contractive transformations, and is guaranteed to generate an approximation to the original image when iteratively applied to any initial image. In this paper we present a method for mapping similar regions within an image by an approximation of the collage error; that is, range blocks can be approximated by a linear combination of domain blocks.
Upper bounds on minimum cardinality of exact and approximate reducts
Chikalov, Igor
2010-01-01
In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.
LCAO approximation for scaling properties of the Menger sponge fractal.
Sakoda, Kazuaki
2006-11-13
The electromagnetic eigenmodes of a three-dimensional fractal called the Menger sponge were analyzed by the LCAO (linear combination of atomic orbitals) approximation and a first-principle calculation based on the FDTD (finite-difference time-domain) method. Due to the localized nature of the eigenmodes, the LCAO approximation gives a good guiding principle to find scaled eigenfunctions and to observe the approximate self-similarity in the spectrum of the localized eigenmodes.
Analysis of the dynamical cluster approximation for the Hubbard model
Aryanpour, K.; Hettler, M. H.; Jarrell, M.
2002-01-01
We examine a central approximation of the recently introduced Dynamical Cluster Approximation (DCA) by example of the Hubbard model. By both analytical and numerical means we study non-compact and compact contributions to the thermodynamic potential. We show that approximating non-compact diagrams by their cluster analogs results in a larger systematic error as compared to the compact diagrams. Consequently, only the compact contributions should be taken from the cluster, whereas non-compact ...
Approximation theorems by Meyer-Koenig and Zeller type operators
International Nuclear Information System (INIS)
Ali Ozarslan, M.; Duman, Oktay
2009-01-01
This paper is mainly connected with the approximation properties of Meyer-Koenig and Zeller (MKZ) type operators. We first introduce a general sequence of MKZ operators based on q-integers and then obtain a Korovkin-type approximation theorem for these operators. We also compute their rates of convergence by means of modulus of continuity and the elements of Lipschitz class functionals. Furthermore, we give an rth order generalization of our operators in order to get some explicit approximation results.
Co-Occuring Directions Sketching for Approximate Matrix Multiply
Mroueh, Youssef; Marcheret, Etienne; Goel, Vaibhava
2016-01-01
We introduce co-occurring directions sketching, a deterministic algorithm for approximate matrix product (AMM), in the streaming model. We show that co-occuring directions achieves a better error bound for AMM than other randomized and deterministic approaches for AMM. Co-occurring directions gives a $1 + \\epsilon$ -approximation of the optimal low rank approximation of a matrix product. Empirically our algorithm outperforms competing methods for AMM, for a small sketch size. We validate empi...
Exchange energy in the local Airy gas approximation
DEFF Research Database (Denmark)
Vitos, Levente; Johansson, B.; Kollár, J.
2000-01-01
The Airy gas model of the edge electron gas is used to construct an exchange-energy functional that is an alternative to those obtained in the local-density and generalized-gradient approximations. Test calculations for rare-gas atoms, molecules, solids, and surfaces show that the Airy gas...... functional performs better than the local-density approximation in all cases and better than the generalized-gradient approximation for solids and surfaces....
A simple approximation for eigenvalues in quantum theory
International Nuclear Information System (INIS)
Mitter, H.; Yamazaki, K.
1983-01-01
An approximation method for the determination of energy levels in quantum theory is discussed, which starts from a scaled set of eigenstates of a solvable model. It is shown, that the lowest approximation fulfills certain relations, which hold also exactly. The approximation is tested by comparison with numerically computed eigenvalues in several cases. The errors turn out to be moderate in most of these and depend very little on typical coupling constants. (Author)
Perturbative corrections for approximate inference in gaussian latent variable models
DEFF Research Database (Denmark)
Opper, Manfred; Paquet, Ulrich; Winther, Ole
2013-01-01
orders, corrections of increasing polynomial complexity can be applied to the approximation. The second order provides a correction in quadratic time, which we apply to an array of Gaussian process and Ising models. The corrections generalize to arbitrarily complex approximating families, which we...... illustrate on tree-structured Ising model approximations. Furthermore, they provide a polynomial-time assessment of the approximation error. We also provide both theoretical and practical insights on the exactness of the EP solution. © 2013 Manfred Opper, Ulrich Paquet and Ole Winther....
Algorithms For Approximation IV. Proceedings of the 2001 International Symposium
National Research Council Canada - National Science Library
Levesley, Jeremy
2002-01-01
...: Algorithms- Approximation of Functions, Data Fitting, Geometric and Surface Modelling, Splines, Wavelets, Radial Basis Functions, Support Vector Machines, Norms and Metrics, Errors in Data, Uncertainty Estimation...
Recursive B-spline approximation using the Kalman filter
Directory of Open Access Journals (Sweden)
Jens Jauch
2017-02-01
Full Text Available This paper proposes a novel recursive B-spline approximation (RBA algorithm which approximates an unbounded number of data points with a B-spline function and achieves lower computational effort compared with previous algorithms. Conventional recursive algorithms based on the Kalman filter (KF restrict the approximation to a bounded and predefined interval. Conversely RBA includes a novel shift operation that enables to shift estimated B-spline coefficients in the state vector of a KF. This allows to adapt the interval in which the B-spline function can approximate data points during run-time.
Scattering theory and effective medium approximations to heterogeneous materials
International Nuclear Information System (INIS)
Gubernatis, J.E.
1977-01-01
The formal analogy existing between problems studied in the microscopic theory of disordered alloys and problems concerned with the effective (macroscopic) behavior of heterogeneous materials is discussed. Attention is focused on (1) analogous approximations (effective medium approximations) developed for the microscopic problems by scattering theory concepts and techniques, but for the macroscopic problems principally by intuitive means, (2) the link, provided by scattering theory, of the intuitively developed approximations to a well-defined perturbative analysis, (3) the possible presence of conditionally convergent integrals in effective medium approximations
Approximation of quadrilaterals by rational quadrilaterals in the plane
Indian Academy of Sciences (India)
Keywords. Rational triangles and quadrilaterals; rational approximability of polygons; rational points on quartic curves; elliptic curves; torsion points; rational points on varieties and their density.
Total ankle joint replacement.
2016-02-01
Ankle arthritis results in a stiff and painful ankle and can be a major cause of disability. For people with end-stage ankle arthritis, arthrodesis (ankle fusion) is effective at reducing pain in the shorter term, but results in a fixed joint, and over time the loss of mobility places stress on other joints in the foot that may lead to arthritis, pain and dysfunction. Another option is to perform a total ankle joint replacement, with the aim of giving the patient a mobile and pain-free ankle. In this article we review the efficacy of this procedure, including how it compares to ankle arthrodesis, and consider the indications and complications. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/
Total process surveillance: (TOPS)
International Nuclear Information System (INIS)
Millar, J.H.P.
1992-01-01
A Total Process Surveillance system is under development which can provide, in real-time, additional process information from a limited number of raw measurement signals. This is achieved by using a robust model based observer to generate estimates of the process' internal states. The observer utilises the analytical reduncancy among a diverse range of transducers and can thus accommodate off-normal conditions which lead to transducer loss or damage. The modular hierarchical structure of the system enables the maximum amount of information to be assimilated from the available instrument signals no matter how diverse. This structure also constitutes a data reduction path thus reducing operator cognitive overload from a large number of varying, and possibly contradictory, raw plant signals. (orig.)
Berg, Svante
2011-02-01
Low back pain consumes a large part of the community's resources dedicated to health care and sick leave. Back disorders also negatively affect the individual leading to pain suffering, decreased quality-of-life and disability. Chronic low back pain (CLBP) due to degenerative disc disease (DDD) is today often treated with fusion when conservative treatment has failed and symptoms are severe. This treatment is as successful as arthroplasty is for hip arthritis in restoring the patient's quality of life and reducing disability. Even so, there are some problems with this treatment, one of these being recurrent CLBP from an adjacent segment (ASD) after primarily successful surgery. This has led to the development of alternative surgical treatments and devices that maintain or restore mobility, in order to reduce the risk for ASD. Of these new devices, the most frequently used are the disc prostheses used in Total Disc Replacement (TDR). This thesis is based on four studies comparing total disc replacement with posterior fusion. The studies are all based on a material of 152 patients with DDD in one or two segments, aged 20-55 years that were randomly treated with either posterior fusion or TDR. The first study concerned clinical outcome and complications. Follow-up was 100% at both one and two years. It revealed that both treatment groups had a clear benefit from treatment and that patients with TDR were better in almost all outcome scores at one-year follow-up. Fusion patients continued to improve during the second year. At two-year follow-up there was a remaining difference in favour of TDR for back pain. 73% in the TDR group and 63% in the fusion group were much better or totally pain-free (n.s.), while twice as many patients in the TDR group were totally pain free (30%) compared to the fusion group (15%). Time of surgery and total time in hospital were shorter in the TDR group. There was no difference in complications and reoperations, except that seventeen of the
Self-Gravitating Bose-Einstein Condensates and the Thomas-Fermi Approximation
Directory of Open Access Journals (Sweden)
Viktor T. Toth
2016-08-01
Full Text Available Self-gravitating Bose-Einstein condensates (BEC have been proposed in various astrophysical contexts, including Bose-stars and BEC dark matter halos. These systems are described by a combination of the Gross-Pitaevskii and Poisson equations (the GPP system. In the analysis of these hypothetical objects, the Thomas-Fermi (TF approximation is widely used. This approximation is based on the assumption that in the presence of a large number of particles, the kinetic term in the Gross-Pitaevskii energy functional can be neglected, yet it is well known that this assumption is violated near the condensate surface. We also show that the total energy of the self-gravitating condensate in the TF-approximation is positive. The stability of a self-gravitating system is dependent on the total energy being negative. Therefore, the TF-approximation is ill suited to formulate initial conditions in numerical simulations. As an alternative, we offer an approximate solution of the full GPP system.
Embedding impedance approximations in the analysis of SIS mixers
Kerr, A. R.; Pan, S.-K.; Withington, S.
1992-01-01
Future millimeter-wave radio astronomy instruments will use arrays of many SIS receivers, either as focal plane arrays on individual radio telescopes, or as individual receivers on the many antennas of radio interferometers. Such applications will require broadband integrated mixers without mechanical tuners. To produce such mixers, it will be necessary to improve present mixer design techniques, most of which use the three-frequency approximation to Tucker's quantum mixer theory. This paper examines the adequacy of three approximations to Tucker's theory: (1) the usual three-frequency approximation which assumes a sinusoidal LO voltage at the junction, and a short-circuit at all frequencies above the upper sideband; (2) a five-frequency approximation which allows two LO voltage harmonics and five small-signal sidebands; and (3) a quasi five-frequency approximation in which five small-signal sidebands are allowed, but the LO voltage is assumed sinusoidal. These are compared with a full harmonic-Newton solution of Tucker's equations, including eight LO harmonics and their corresponding sidebands, for realistic SIS mixer circuits. It is shown that the accuracy of the three approximations depends strongly on the value of omega R(sub N)C for the SIS junctions used. For large omega R(sub N)C, all three approximations approach the eight-harmonic solution. For omega R(sub N)C values in the range 0.5 to 10, the range of most practical interest, the quasi five-frequency approximation is a considerable improvement over the three-frequency approximation, and should be suitable for much design work. For the realistic SIS mixers considered here, the five-frequency approximation gives results very close to those of the eight-harmonic solution. Use of these approximations, where appropriate, considerably reduces the computational effort needed to analyze an SIS mixer, and allows the design and optimization of mixers using a personal computer.
Primary total elbow arthroplasty
Directory of Open Access Journals (Sweden)
Suresh Kumar
2013-01-01
Full Text Available Background: Primary total elbow arthroplasty (TEA is a challenging procedure for orthopedic surgeons. It is not performed as frequently as compared to hip or knee arthroplasty. The elbow is a nonweight-bearing joint; however, static loading can create forces up to three times the body weight and dynamic loading up to six times. For elderly patients with deformity and ankylosis of the elbow due to posttraumatic arthritis or rheumatoid arthritis or comminuted fracture distal humerus, arthroplasty is one of the option. The aim of this study is to analyze the role of primary total elbow arthroplasty in cases of crippling deformity of elbow. Materials and Methods: We analyzed 11 cases of TEA, between December 2002 and September 2012. There were 8 females and 3 males. The average age was 40 years (range 30-69 years. The indications for TEA were rheumatoid arthritis, comminuted fracture distal humerus with intraarticular extension, and posttraumatic bony ankylosis of elbow joint. The Baksi sloppy (semi constrained hinge elbow prosthesis was used. Clinico-radiological followup was done at 1 month, 3 months, 6 months, 1 year, and then yearly basis. Results: In the present study, average supination was 70° (range 60-80° and average pronation was 70° (range 60-80°. Average flexion was 135° (range 130-135°. However, in 5 cases, there was loss of 15 to 35° (average 25° of extension (45° out of 11 cases. The mean Mayo elbow performance score was 95.4 points (range 70-100. Arm length discrepancy was only in four patients which was 36% out of 11 cases. Clinico-radiologically all the elbows were stable except in one case and no immediate postoperative complication was noted. Radiolucency or loosening of ulnar stem was seen in 2 cases (18% out of 11 cases, in 1 case it was noted after 5 years and in another after 10 years. In second case, revision arthroplasty was done, in which only ulnar hinge section, hinge screw and lock screw with hexagonal head
Survey of Croatian Dentists’ Restorative Treatment Decisions on Approximal Caries Lesions
Baraba, Anja; Anić, Ivica; Doméjean-Orliaguet, Sophie; Espelid, Ivar; Tveit, Anne B.; Miletić, Ivana
2010-01-01
Aim To assess Croatian dentists’ restorative treatment decisions on approximal caries lesions, including treatment threshold and restorative methods and materials. Methods Croatian translation of the questionnaire assessing restorative treatment decisions on approximal caries, previously validated and used in Norway and Sweden, was distributed to a random sample (n = 800) of Croatian dentists. A total of 307 (38%) dentists answered the questionnaire. The assessed variables were treatment threshold for hypothetical approximal caries lesion and the most favored types of restorative techniques and materials. Results A third of the respondents (39%, 95% confidence interval [CI], 34-44%) would intervene for an approximal caries lesion at the dentin-enamel junction, but a larger proportion (42%; 95% CI, 36-48%) would treat a caries lesion confined to the enamel. For restoration of approximal caries, the majority (66%; 95% CI, 61-71%) would use composite resin. Conclusion Croatian dentists tend to restore approximal caries lesions when the lesions are confined to the enamel and their development can still be arrested. PMID:21162163
Vital, J-M; Boissière, L
2014-02-01
Total disc replacement (TDR) (partial disc replacement will not be described) has been used in the lumbar spine since the 1980s, and more recently in the cervical spine. Although the biomechanical concepts are the same and both are inserted through an anterior approach, lumbar TDR is conventionally indicated for chronic low back pain, whereas cervical TDR is used for soft discal hernia resulting in cervicobrachial neuralgia. The insertion technique must be rigorous, with precise centering in the disc space, taking account of vascular anatomy, which is more complex in the lumbar region, particularly proximally to L5-S1. All of the numerous studies, including prospective randomized comparative trials, have demonstrated non-inferiority to fusion, or even short-term superiority regarding speed of improvement. The main implant-related complication is bridging heterotopic ossification with resulting loss of range of motion and increased rates of adjacent segment degeneration, although with an incidence lower than after arthrodesis. A sufficiently long follow-up, which has not yet been reached, will be necessary to establish definitively an advantage for TDR, particularly in the cervical spine. Copyright © 2014 Elsevier Masson SAS. All rights reserved.
Total equipment parts configuration
International Nuclear Information System (INIS)
Ferrare, J.
1989-01-01
Florida Power ampersand Lights's (FP ampersand L's) Turkey Point units were built prior to the establishment of American Society of Mechanical Engineers' Sec. III requirements. Since that time, FP ampersand L has voluntarily committed to procuring some spare and replacement parts in compliance with the ordering requirements of ASME Sec. III. New subsystems were designed according to ASME Sec. III requirements. In 1978, 10CFR21 of the Code of Federal Regulations was federally mandated. Environmental qualification concerns and the Three Mile Island incident further complicated the stocking and ordering of spare and replacement parts. Turkey Point assembled a team of quality assurance, quality control, and engineering people and obtained permission to directly access the store department computer so that catalog descriptions could be quickly made available for use by the plant. The total equipment parts configuration (TEPC) system was designed and developed under the direction of the procurement document review team at the Turkey Point nuclear plant. The system is a network of related computer data bases that identifies the equipment at the plant. The equipment (or components that make up a piece of equipment) is identified by a tag/component code system. Each component is further broken down by the manufacturer's parts list or bill of material. A description of the data available to the user, the ways these data can be accessed and displayed, and a description of the data bases and their relation to each other are summarized in this paper
A Computational Study of Approximation Algorithms for a Minmax Resource Allocation Problem
Directory of Open Access Journals (Sweden)
Bogusz Przybysławski
2012-01-01
Full Text Available A basic resource allocation problem with uncertain costs has been discussed. The problem is to minimize the total cost of choosing exactly p items out of n available. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a solution. This problem is known to be NP-hard, but several approximation algorithms exist. The aim of this paper is to investigate the quality of the solutions returned by these approximation algorithms. According to the results obtained, the randomized algorithms described are fast and output solutions of good quality, even if the problem size is large. (original abstract
Hall, Eric
2016-01-09
The Monte Carlo (and Multi-level Monte Carlo) finite element method can be used to approximate observables of solutions to diffusion equations with lognormal distributed diffusion coefficients, e.g. modeling ground water flow. Typical models use lognormal diffusion coefficients with H´ older regularity of order up to 1/2 a.s. This low regularity implies that the high frequency finite element approximation error (i.e. the error from frequencies larger than the mesh frequency) is not negligible and can be larger than the computable low frequency error. We address how the total error can be estimated by the computable error.
Sandberg, Mattias
2015-01-07
The Monte Carlo (and Multi-level Monte Carlo) finite element method can be used to approximate observables of solutions to diffusion equations with log normal distributed diffusion coefficients, e.g. modelling ground water flow. Typical models use log normal diffusion coefficients with H¨older regularity of order up to 1/2 a.s. This low regularity implies that the high frequency finite element approximation error (i.e. the error from frequencies larger than the mesh frequency) is not negligible and can be larger than the computable low frequency error. This talk will address how the total error can be estimated by the computable error.
Efficient approximation of black-box functions and Pareto sets
Rennen, G.
2009-01-01
In the case of time-consuming simulation models or other so-called black-box functions, we determine a metamodel which approximates the relation between the input- and output-variables of the simulation model. To solve multi-objective optimization problems, we approximate the Pareto set, i.e. the
Approximation of the inverse G-frame operator
Indian Academy of Sciences (India)
In this paper, we introduce the concept of (strong) projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we ...
On Approximations of Compact Sets of Functions by Algebraic Surfaces
Kudryavtsev, S. N.
1986-06-01
This article deals with approximations of certain compact sets of smooth and analytic functions by families of functions depending in a polynomial fashion on parameters. The connection between the accuracy of the approximations of the compact sets by such families and the number of parameters and their degree is studied. Bibliography: 3 titles.
The modified signed likelihood statistic and saddlepoint approximations
DEFF Research Database (Denmark)
Jensen, Jens Ledet
1992-01-01
SUMMARY: For a number of tests in exponential families we show that the use of a normal approximation to the modified signed likelihood ratio statistic r * is equivalent to the use of a saddlepoint approximation. This is also true in a large deviation region where the signed likelihood ratio...... statistic r is of order √ n. © 1992 Biometrika Trust....
Approximation of the inverse G-frame operator
Indian Academy of Sciences (India)
... projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we like using finite-dimensional linear algebra.
Performance approximation of pick-to-belt orderpicking systems
M.B.M. de Koster (René)
1994-01-01
textabstractIn this paper, an approximation method is discussed for the analysis of pick-to-belt orderpicking systems. The aim of the approximation method is to provide an instrument for obtaining rapid insight in the performance of designs of pick-to-belt orderpicking systems. It can be used to
An approximate confidence interval for recombination fraction in ...
African Journals Online (AJOL)
user
2011-02-14
Feb 14, 2011 ... proposed a two stage Markov Chain Monte Carlo (MCMC) method to calculate an approximate confidence interval (ACI) ... Key words: Markov Chain Monte Carlo (MCMC), Gibbs sampler, approximate confidence interval, simulation size. ... from local conditional distributions at parameter valuesθ , given the ...
Approximation properties of the neuro-fuzzy minimum function
Gottschling, Andreas; Kreuter, Christof
1999-01-01
The integration of fuzzy logic systems and neural networks in data driven nonlinear modeling applications has generally been limited to functions based upon the multiplicative fuzzy implication rule for theoretical and computational reasons. We derive a universal approximation result for the minimum fuzzy implication rule as well as a differentiable substitute function that allows fast optimization and function approximation with neuro-fuzzy networks.
Finite approximate controllability for semilinear heat equations in noncylindrical domains
Directory of Open Access Journals (Sweden)
Menezes Silvano B. de
2004-01-01
Full Text Available We investigate finite approximate controllability for semilinear heat equation in noncylindrical domains. First we study the linearized problem and then by an application of the fixed point result of Leray-Schauder we obtain the finite approximate controllability for the semilinear state equation.
A simple approximation method for dilute Ising systems
International Nuclear Information System (INIS)
Saber, M.
1996-10-01
We describe a simple approximate method to analyze dilute Ising systems. The method takes into consideration the fluctuations of the effective field, and is based on a probability distribution of random variables which correctly accounts for all the single site kinematic relations. It is shown that the simplest approximation gives satisfactory results when compared with other methods. (author). 12 refs, 2 tabs
Topology optimization of dynamics problems with Padé approximants
DEFF Research Database (Denmark)
Jensen, Jakob Søndergaard
2007-01-01
An efficient procedure for topology optimization of dynamics problems is proposed. The method is based on frequency responses represented by Padé approximants and analytical sensitivity analysis derived using the adjoint method. This gives an accurate approximation of the frequency response over ...
The generalized Mayer theorem in the approximating hamiltonian method
International Nuclear Information System (INIS)
Bakulev, A.P.; Bogoliubov, N.N. Jr.; Kurbatov, A.M.
1982-07-01
With the help of the generalized Mayer theorem we obtain the improved inequality for free energies of model and approximating systems, where only ''connected parts'' over the approximating hamiltonian are taken into account. For the concrete system we discuss the problem of convergency of appropriate series of ''connected parts''. (author)
On a saddlepoint approximation to the Markov binomial distribution
DEFF Research Database (Denmark)
Jensen, Jens Ledet
A nonstandard saddlepoint approximation to the distribution of a sum of Markov dependent trials is introduced. The relative error of the approximation is studied, not only for the number of summands tending to infinity, but also for the parameter approaching the boundary of its definition range. ...
Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation
Gordon, Sheldon P.; Yang, Yajun
2017-01-01
This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…
On approximation of Lie groups by discrete subgroups
Indian Academy of Sciences (India)
2016-08-26
Aug 26, 2016 ... The notion of approximation of Lie groups by discrete subgroups was introduced by Tôyama in Kodai Math. Sem. Rep. 1 (1949) 36–37 and investigated in detail by Kuranishi in Nagoya Math. J. 2 (1951) 63–71. It is known as a theorem of Tôyama that any connected Lie group approximated by discrete ...
Approximate solutions of the Wei Hua oscillator using the Pekeris ...
Indian Academy of Sciences (India)
The approximate analytical bound-state solutions of the Schrödinger equation for the. Wei Hua oscillator are carried out in N-dimensional space by taking Pekeris approximation scheme to the orbital centrifugal term. Solutions of the corresponding hyper-radial equation are obtained using the conventional Nikiforov–Uvarov ...
Reply to Steele & Ferrer: Modeling Oscillation, Approximately or Exactly?
Oud, Johan H. L.; Folmer, Henk
2011-01-01
This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent version of the local linear approximation procedure…
Merging Belief Propagation and the Mean Field Approximation
DEFF Research Database (Denmark)
Riegler, Erwin; Kirkelund, Gunvor Elisabeth; Manchón, Carles Navarro
2010-01-01
We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al., which allows to use the same objective function (Kullback-Leibler divergence...
OPTICAL QUANTITATION AND RADIOGRAPHIC DIAGNOSIS OF INCIPIENT APPROXIMAL CARIES LESIONS
VERDONSCHOT, EH; VANDERIJKE, JW; BROUWER, W; TENBOSCH, JJ; TRUIN, GJ
1991-01-01
The objectives of this study were to test the applicability of photocell measurements in approximal caries diagnosis and to evaluate the use of radiographs as validating criterion. Forty extracted premolars were selected, and the progression of the approximal lesions was graded clinically and
Function approximation using combined unsupervised and supervised learning.
Andras, Peter
2014-03-01
Function approximation is one of the core tasks that are solved using neural networks in the context of many engineering problems. However, good approximation results need good sampling of the data space, which usually requires exponentially increasing volume of data as the dimensionality of the data increases. At the same time, often the high-dimensional data is arranged around a much lower dimensional manifold. Here we propose the breaking of the function approximation task for high-dimensional data into two steps: (1) the mapping of the high-dimensional data onto a lower dimensional space corresponding to the manifold on which the data resides and (2) the approximation of the function using the mapped lower dimensional data. We use over-complete self-organizing maps (SOMs) for the mapping through unsupervised learning, and single hidden layer neural networks for the function approximation through supervised learning. We also extend the two-step procedure by considering support vector machines and Bayesian SOMs for the determination of the best parameters for the nonlinear neurons in the hidden layer of the neural networks used for the function approximation. We compare the approximation performance of the proposed neural networks using a set of functions and show that indeed the neural networks using combined unsupervised and supervised learning outperform in most cases the neural networks that learn the function approximation using the original high-dimensional data.
The high intensity approximation applied to multiphoton ionization
International Nuclear Information System (INIS)
Brandi, H.S.; Davidovich, L.; Zagury, N.
1980-08-01
It is shown that the most commonly used high intensity approximations as applied to ionization by strong electromagnetic fields are related. The applicability of the steepest descent method in these approximations, and the relation between them and first-order perturbation theory, are also discussed. (Author) [pt
A Multi-wavelet type limiter for discontinuous Galerkin approximations
Cheruvu, V.; Ryan, J.K.
2010-01-01
In this report, we present a multi-wavelet type limiter for the discontinuous Galerkin method for limiting the solution when spurious oscillations develop near a shock. This limiting leads to a loss of information in the approximation that can be detrimental to a higher order approximation (k > 2).
The second Born approximation of electron–argon elastic scattering ...
Indian Academy of Sciences (India)
We study the elastic scattering of atomic argon by electron in the presence of a bichromatic laser ﬁeld in the second Born approximation. The target atom is approximated by a simple screening potential and the continuum states of the impinging and emitting electrons are described as Volkov states. We evaluate the S-matrix ...
The second Born approximation of electron–argon elastic scattering ...
Indian Academy of Sciences (India)
Abstract. We study the elastic scattering of atomic argon by electron in the presence of a bichro- matic laser field in the second Born approximation. The target atom is approximated by a simple screening potential and the continuum states of the impinging and emitting electrons are described as Volkov states. We evaluate ...
A-Statistical extension of the Korovkin type approximation theorem
Indian Academy of Sciences (India)
imation, in various areas of functional analysis [1,3,5,12,15]. The study of the Korovkin type approximation theory is a well-established area of research, which deals with the problem of approximating a function f by means of a sequence {Lnf } of positive lin- ear operators. Statistical convergence, which was introduced nearly ...
A periodic basis system of the smooth approximation space
Czech Academy of Sciences Publication Activity Database
Segeth, Karel
2015-01-01
Roč. 267, 15 September (2015), s. 436-444 ISSN 0096-3003 R&D Projects: GA ČR GA14-02067S Institutional support: RVO:67985840 Keywords : smooth approximation * data approximation * data interpolation * Fourier transform Subject RIV: BA - General Mathematics Impact factor: 1.345, year: 2015 http://www.sciencedirect.com/science/article/pii/S0096300315001526
Fifth International Conference on "Approximation and Optimization in the Caribbean"
Approximation, Optimization and Mathematical Economic
2001-01-01
The articles in this proceedings volume reflect the current trends in the theory of approximation, optimization and mathematical economics, and include numerous applications. The book will be of interest to researchers and graduate students involved in functional analysis, approximation theory, mathematical programming and optimization, game theory, mathematical finance and economics.