Phase diagrams of the ternary alloy with a single-ion anisotropy in the mean-field approximation
International Nuclear Information System (INIS)
Dely, J.; Bobak, A.
2006-01-01
The phase diagram of the AB p C 1-p ternary alloy consisting of Ising spins S A =32, S B =2, and S C =52 is investigated by the use of a mean-field theory based on the Bogoliubov inequality for the Gibbs free energy. The effect of the single-ion anisotropy on the phase diagrams is discussed by changing values of the parameters in the model Hamiltonian and comparison is made with the recently reported finite-temperature phase diagrams for the ternary alloy having spin S B =1
Spatiotemporal feature integration shapes approximate numerical processing.
Fornaciai, Michele; Park, Joonkoo
2017-11-01
Numerosity perception involves a complex cascade of processing stages comprising an early sensory representation stage followed by a later stage providing a conceptual representation of numerical magnitude. While much recent work has focused on understanding how nonnumerical spatial features (e.g., density, area) influence numerosity perception in this processing cascade, little is known about how the spatiotemporal properties of the stimuli affect numerosity processing. Whether numerosity information is integrated over space and time in the processing cascade is an important question as it can provide insights into how the system dedicated for numerosity interacts with other perceptual systems. To address these issues, in four independent experiments, we asked participants to judge the numerosities of various different kinds of dynamically presented dot arrays, such as dots randomly changing in their locations, moving in smooth trajectories, or flickering on and off. The results revealed a systematic overestimation of dynamically presented dot arrays, which implicates the existence of spatiotemporal integration mechanisms, both at the early sensory representation stage and the later conceptual representation stage. The results also revealed the influence of motion and color processing areas on numerosity processing. The findings thus provide empirical evidence that numerosity perception arises from a complex interaction between multiple perceptual mechanisms in the visual stream, and that it is shaped by the integration of spatiotemporal properties of visual stimuli.
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.
Directory of Open Access Journals (Sweden)
Hui Huang
2017-01-01
Full Text Available According to the pros and cons of contourlet transform and multimodality medical imaging, here we propose a novel image fusion algorithm that combines nonlinear approximation of contourlet transform with image regional features. The most important coefficient bands of the contourlet sparse matrix are retained by nonlinear approximation. Low-frequency and high-frequency regional features are also elaborated to fuse medical images. The results strongly suggested that the proposed algorithm could improve the visual effects of medical image fusion and image quality, image denoising, and enhancement.
Nonlinear registration using B-spline feature approximation and image similarity
Kim, June-Sic; Kim, Jae Seok; Kim, In Young; Kim, Sun Il
2001-07-01
The warping methods are broadly classified into the image-matching method based on similar pixel intensity distribution and the feature-matching method using distinct anatomical feature. Feature based methods may fail to match local variation of two images. However, the method globally matches features well. False matches corresponding to local minima of the underlying energy functions can be obtained through the similarity based methods. To avoid local minima problem, we proposes non-linear deformable registration method utilizing global information of feature matching and the local information of image matching. To define the feature, gray matter and white matter of brain tissue are segmented by Fuzzy C-Mean (FCM) algorithm. B-spline approximation technique is used for feature matching. We use a multi-resolution B-spline approximation method which modifies multilevel B-spline interpolation method. It locally changes the resolution of the control lattice in proportion to the distance between features of two images. Mutual information is used for similarity measure. The deformation fields are locally refined until maximize the similarity. In two 3D T1 weighted MRI test, this method maintained the accuracy by conventional image matching methods without the local minimum problem.
Liu, Yongbin; He, Bing; Liu, Fang; Lu, Siliang; Zhao, Yilei
2016-12-01
Fault pattern identification is a crucial step for the intelligent fault diagnosis of real-time health conditions in monitoring a mechanical system. However, many challenges exist in extracting the effective feature from vibration signals for fault recognition. A new feature fusion method is proposed in this study to extract new features using kernel joint approximate diagonalization of eigen-matrices (KJADE). In the method, the input space that is composed of original features is mapped into a high-dimensional feature space by nonlinear mapping. Then, the new features can be estimated through the eigen-decomposition of the fourth-order cumulative kernel matrix obtained from the feature space. Therefore, the proposed method could be used to reduce data redundancy because it extracts the inherent pattern structure of different fault classes as it is nonlinear by nature. The integration evaluation factor of between-class and within-class scatters (SS) is employed to depict the clustering performance quantitatively, and the new feature subset extracted by the proposed method is fed into a multi-class support vector machine for fault pattern identification. Finally, the effectiveness of the proposed method is verified by experimental vibration signals with different bearing fault types and severities. Results of several cases show that the KJADE algorithm is efficient in feature fusion for bearing fault identification.
The discrete dipole approximation code DDscat.C++: features, limitations and plans
Choliy, V. Ya.
2013-08-01
We present a new freely available open-source C++ software for numerical solution of the electromagnetic waves absorption and scattering problems within the Discrete Dipole Approximation paradigm. The code is based upon the famous and free Fortan-90 code DDSCAT by B. Draine and P. Flatau. Started as a teaching project, the presented code DDscat.C++ differs from the parent code DDSCAT with a number of features, essential for C++ but quite seldom in Fortran. This article introduces the new code, explains its features, presents timing information and some plans for further development.
Directory of Open Access Journals (Sweden)
Andrzej Sluzek
2009-01-01
Full Text Available The paper overviews the concept of using circular patches as local features for image description, matching, and retrieval. The contents of scanning circular windows are approximated by predefined patterns. Characteristics of the approximations are used as feature descriptors. The main advantage of the approach is that the features are categorized at the detection level, and the subsequent matching or retrieval operations are, thus, tailored to the image contents and more efficient. Even though the method is not claimed to be scale invariant, it can handle (as explained in the paper image rescaling within relatively wide ranges of scales. The paper summarizes and compares various aspects of results presented in previous publications. In particular, three issues are discussed in detail: visual accuracy, feature localization, and robustness against Ã¢Â€Âœvisual intrusions.Ã¢Â€Â The compared methods are based on relatively simple tools, that is, area moments and modified Hough transform, so that the computational complexity is rather low.
Tian, Fuyang; Cao, Dong; Dong, Xiaoning; Zhao, Xinqiang; Li, Fade; Wang, Zhonghua
2017-06-01
Behavioral features recognition was an important effect to detect oestrus and sickness in dairy herds and there is a need for heat detection aid. The detection method was based on the measure of the individual behavioural activity, standing time, and temperature of dairy using vibrational sensor and temperature sensor in this paper. The data of behavioural activity index, standing time, lying time and walking time were sent to computer by lower power consumption wireless communication system. The fast approximate K-means algorithm (FAKM) was proposed to deal the data of the sensor for behavioral features recognition. As a result of technical progress in monitoring cows using computers, automatic oestrus detection has become possible.
Single ion dynamics in molten sodium bromide
Energy Technology Data Exchange (ETDEWEB)
Alcaraz, O.; Trullas, J. [Departament de Física i Enginyeria Nuclear, Universitat Politècnica de Catalunya, 08034 Barcelona (Spain); Demmel, F. [ISIS Facility, Rutherford Appleton Laboratory, Didcot OX11 0QX (United Kingdom)
2014-12-28
We present a study on the single ion dynamics in the molten alkali halide NaBr. Quasielastic neutron scattering was employed to extract the self-diffusion coefficient of the sodium ions at three temperatures. Molecular dynamics simulations using rigid and polarizable ion models have been performed in parallel to extract the sodium and bromide single dynamics and ionic conductivities. Two methods have been employed to derive the ion diffusion, calculating the mean squared displacements and the velocity autocorrelation functions, as well as analysing the increase of the line widths of the self-dynamic structure factors. The sodium diffusion coefficients show a remarkable good agreement between experiment and simulation utilising the polarisable potential.
Directory of Open Access Journals (Sweden)
Anna Muryani
2016-07-01
Full Text Available Introduction: Overhanging approximal restoration may causes gingival inflammation, periodontal tissue destruction, decreases alveolar bone height, and caries reccurence. Overhanging restoration can be detected clinically and by radiography image. Overhang restorations can occur due to the poor filling procedures, one of which is the limitation of supporting tools. Restoration of teeth done in Puskesmas often found unavailability constraints supporting tools so that in cases of approximal caries often experience overhang. The aim of this study was to evaluate the incidence of overhanging proximal restoration at Tarogong Public Health Centre in Garut Regency West Java Indonesia. Methods: This study was a descriptive cross sectional for the incidence on patient with overhanging approximal restoration who visited at Dental Unit Tarogong Public Health Center in Garut Regency. Intraoral clinical examination was conducted to examine visually and by tactile for the overhang restoration. Periapical radiography examination was taken and became supporting examination. Results: Collected data were 43 cases of overhanging approximal restoration from total 57 patients. The incidence of overhanging approximal restoration were 75,4. Conclusion: The conclusion of this study by radiography was the incidence of overhanging restoration was 75.4 which showed that overhanging restoration approksimal more than good restoration aproksimal at Tarogong Public Health Centre in Garut Regency West Java Indonesia.
Liu, Zhenqiu; Sun, Fengzhu; McGovern, Dermot P
2017-01-01
Feature selection and prediction are the most important tasks for big data mining. The common strategies for feature selection in big data mining are L 1 , SCAD and MC+. However, none of the existing algorithms optimizes L 0 , which penalizes the number of nonzero features directly. In this paper, we develop a novel sparse generalized linear model (GLM) with L 0 approximation for feature selection and prediction with big omics data. The proposed approach approximate the L 0 optimization directly. Even though the original L 0 problem is non-convex, the problem is approximated by sequential convex optimizations with the proposed algorithm. The proposed method is easy to implement with only several lines of code. Novel adaptive ridge algorithms ( L 0 ADRIDGE) for L 0 penalized GLM with ultra high dimensional big data are developed. The proposed approach outperforms the other cutting edge regularization methods including SCAD and MC+ in simulations. When it is applied to integrated analysis of mRNA, microRNA, and methylation data from TCGA ovarian cancer, multilevel gene signatures associated with suboptimal debulking are identified simultaneously. The biological significance and potential clinical importance of those genes are further explored. The developed Software L 0 ADRIDGE in MATLAB is available at https://github.com/liuzqx/L0adridge.
Development of a keV single-ion-implanter for nanofabrication
International Nuclear Information System (INIS)
Yang, C.; Jamieson, D.N.; Hopf, T.; Tamanyan, G.; Spizziri, P.; Pakes, C.; Andresen, S.E.; Hudson, F.; Gauja, E.; Dzurak, A.; Clark, R.G.
2005-01-01
Traditional methods of doping semiconductors have a difficulty meeting the demand for high precision doping due to large statistical fluctuations in the numbers of dopant atoms introduced in the ever shrinking volume in micro- and nano-electronics devices, especially when the fabrication process approaches the nanometre scale. The statistical fluctuations in doping semiconductors for the fabrication of devices with a very small feature size may lead to inconsistent and unreliable performance. This paper describes the adaptation of a commercial ion implanter into a single-ion-implantation system for the accurate delivery of dopants into a nanometre or micrometre area in a silicon substrate. All the implanted ions can be accurately counted with near 100% certainty through online detection using the silicon substrate itself as an ion detector. A variety of ion species including B + , N + , P + at the energy range of 10-15 keV can be delivered in the single ion implantation system. (author). 6 refs., 6 figs
Single Ion Trapping for the Enriched Xenon Observatory
Energy Technology Data Exchange (ETDEWEB)
Waldman, Samuel J.; /Stanford U., Phys. Dept. /SLAC
2006-03-28
In the last decade, a variety of neutrino oscillation experiments have established that there is a mass difference between neutrino flavors, without determining the absolute neutrino mass scale. The Enriched Xenon Observatory for neutrinoless double beta decay (EXO) will search for the rare decays of xenon to determine the absolute value of the neutrino mass. The experiment uses a novel technique to minimize backgrounds, identifying the decay daughter product in real time using single ion spectroscopy. Here, we describe single ion trapping and spectroscopy compatible with the EXO detector. We extend the technique of single ion trapping in ultrahigh vacuum to trapping in xenon gas. With this technique, EXO will achieve a neutrino mass sensitivity of
Shou, Chen; Guo, Yongjun; Su, Lei; Li, Yongqian
2014-12-01
The impeller profile, which is one of the most important factors, determines the creation of shear stress which leads to blood hemolysis in the internal flow of centrifugal blood pump. The investigation of the internal flow field in centrifugal blood pump and the estimation of the hemolysis within different impeller profiles will provide information to improve the performance of centrifugal blood pump. The SST kappa-omega with low Reynolds correction was used in our laboratory to study the internal flow fields for four kinds of impellers of centrifugal blood pump. The flow fields included distributions of pressure field, velocity field and shear stress field. In addition, a fast numerical hemolysis approximation was adopted to calculate the normalized index of hemolysis (NIH). The results indicated that the pressure field distribution in all kinds of blood pump were reasonable, but for the log spiral impeller pump, the vortex and backflow were much lower than those of the other pumps, and the high shear stress zone was just about 0.004%, and the NIH was 0.0089.
Moody, Daniela I.; Wilson, Cathy J.; Rowland, Joel C.; Altmann, Garrett L.
2015-06-01
Advanced pattern recognition and computer vision algorithms are of great interest for landscape characterization, change detection, and change monitoring in satellite imagery, in support of global climate change science and modeling. We present results from an ongoing effort to extend neuroscience-inspired models for feature extraction to the environmental sciences, and we demonstrate our work using Worldview-2 multispectral satellite imagery. We use a Hebbian learning rule to derive multispectral, multiresolution dictionaries directly from regional satellite normalized band difference index data. These feature dictionaries are used to build sparse scene representations, from which we automatically generate land cover labels via our CoSA algorithm: Clustering of Sparse Approximations. These data adaptive feature dictionaries use joint spectral and spatial textural characteristics to help separate geologic, vegetative, and hydrologic features. Land cover labels are estimated in example Worldview-2 satellite images of Barrow, Alaska, taken at two different times, and are used to detect and discuss seasonal surface changes. Our results suggest that an approach that learns from both spectral and spatial features is promising for practical pattern recognition problems in high resolution satellite imagery.
International Nuclear Information System (INIS)
Oshtrakh, M. I.; Semionkin, V. A.
2004-01-01
Moessbauer spectra of hemoglobins have some features in the range of liquid nitrogen temperature: a non-Lorentzian asymmetric line shape for oxyhemoglobins and symmetric Lorentzian line shape for deoxyhemoglobins. A comparison of the approximation of the hemoglobin Moessbauer spectra by a superposition of two quadrupole doublets and by a distribution of the quadrupole splitting demonstrates that a superposition of two quadrupole doublets is more reliable and may reflect the non-equivalent iron electronic structure and the stereochemistry in the α- and β-subunits of hemoglobin tetramers.
Single ion counting with a MCP (microchannel plate) detector
Energy Technology Data Exchange (ETDEWEB)
Tawara, Hiroko; Sasaki, Shinichi; Miyajima, Mitsuhiro [National Lab. for High Energy Physics, Tsukuba, Ibaraki (Japan); Shibamura, Eido
1996-07-01
In this study, a single-ion-counting method using alpha-particle-impact ionization of Ar atoms is demonstrated and the preliminary {epsilon}{sub mcp} for Ar ions with incident energies of 3 to 4.7 keV is determined. The single-ion counting by the MCP is aimed to be performed under experimental conditions as follows: (1) A signal from the MCP is reasonably identified as incidence of single Ar-ion. (2) The counting rate of Ar ions is less than 1 s{sup -1}. (3) The incident Ar ions are not focused on a small part of an active area of the MCP, namely, {epsilon}{sub mcp} is determined with respect to the whole active area of the MCP. So far, any absolute detection efficiency has not been reported under these conditions. (J.P.N.)
DEFF Research Database (Denmark)
Sloth, Peter
1993-01-01
The grand canonical ensemble has been used to study the evaluation of single ion activity coefficients in homogeneous ionic fluids. In this work, the Coulombic interactions are truncated according to the minimum image approximation, and the ions are assumed to be placed in a structureless...... of the individual ionic activity coefficients with respect to the total ionic concentration. This formula has previously been proposed on the basis of somewhat different considerations....
Toward Molecular 4f Single-Ion Magnet Qubits.
Pedersen, Kasper S; Ariciu, Ana-Maria; McAdams, Simon; Weihe, Høgni; Bendix, Jesper; Tuna, Floriana; Piligkos, Stergios
2016-05-11
Quantum coherence is detected in the 4f single-ion magnet (SIM) Yb(trensal), by isotope selective pulsed EPR spectroscopy on an oriented single crystal. At X-band, the spin-lattice relaxation (T1) and phase memory (Tm) times are found to be independent of the nuclei bearing, or not, a nuclear spin. The observation of Rabi oscillations of the spin echo demonstrates the possibility to coherently manipulate the system for more than 70 rotations. This renders Yb(trensal), a sublimable and chemically modifiable SIM, an excellent candidate for quantum information processing.
Enriching lanthanide single-ion magnetism through symmetry and axiality.
Gupta, Sandeep K; Murugavel, Ramaswamy
2018-04-10
Rapidly growing modern information technology demands energy and cost efficient tools that can efficiently store and process a large amount of data. However, the miniaturization technology that was being used to boost the performance of the electronic devices, keeping up with the pace as estimated by Moore's law, is reaching its limit. To overcome these challenges, several alternative routes that can eventually mimic the modern electronics fabrication using silicon have been proposed. Single molecule magnets (SMMs), being considered as one of the potential alternatives, have gone through significant progress and the focus has shifted from the use of polynuclear clusters to mononuclear complexes in the last few years. The recent frenzy in the field of SMMs is driven by a better understanding of the effects of crystal field (CF) and molecular symmetry on the magnetic properties, especially in the case of mononuclear paramagnetic complexes, apart from other controlling factors. This has led to the advent of highly anisotropic single-ion magnets (SIMs) with magnetic blocking temperatures as high as 60 K and anisotropic energy barriers over 1800 K. This article overviews our recent research in the light of the emergence of the importance of CF and symmetry in 4f ion based single-ion magnets (SIMs), especially in the context of SIMs with D5h symmetry, apart from commenting on the synthetic efforts adopted to place these metal ions in unusual coordination geometries.
Surface noise analysis using a single-ion sensor
Daniilidis, N.; Gerber, S.; Bolloten, G.; Ramm, M.; Ransford, A.; Ulin-Avila, E.; Talukdar, I.; Häffner, H.
2014-06-01
We use a single-ion electric-field noise sensor in combination with in situ surface treatment and analysis tools, to investigate the relationship between electric-field noise from metal surfaces in vacuum and the composition of the surface. These experiments are performed in a setup that integrates ion trapping capabilities with surface analysis tools. We find that treatment of an aluminum-copper surface with energetic argon ions significantly reduces the level of room-temperature electric-field noise, but the surface does not need to be atomically clean to show noise levels comparable to those of the best cryogenic traps. The noise levels after treatment are low enough to allow fault-tolerant trapped-ion quantum information processing on a microfabricated surface trap at room temperature.
Photodynamic membrane damage at the level of single ion channels.
Kunz, L; Stark, G
1997-07-05
Illumination of cellular membranes by visible light in the presence of appropriate photosensitizers is known to inactivate specific ionic pathways and to increase the unspecific leak conductance of the membranes. While previous studies have concentrated on the macroscopic ionic currents, the present study separates the two phenomena at the microscopic level. Using opossum kidney (OK) cells as epithelial model system and photofrin II as sensitizer, the patch-clamp technique in inside-out configuration has been applied to show the inactivation of single ion channels immediately after start of illumination and the subsequent strong increase of the leak conductance. Inactivation is shown for two kinds of channels: the large-conductance Ca2+-dependent K+ channel (maxi-K(Ca)) and the stretch-activated nonselective cation channel (SA-cat).
Automated parallel recordings of topologically identified single ion channels.
Kawano, Ryuji; Tsuji, Yutaro; Sato, Koji; Osaki, Toshihisa; Kamiya, Koki; Hirano, Minako; Ide, Toru; Miki, Norihisa; Takeuchi, Shoji
2013-01-01
Although ion channels are attractive targets for drug discovery, the systematic screening of ion channel-targeted drugs remains challenging. To facilitate automated single ion-channel recordings for the analysis of drug interactions with the intra- and extracellular domain, we have developed a parallel recording methodology using artificial cell membranes. The use of stable lipid bilayer formation in droplet chamber arrays facilitated automated, parallel, single-channel recording from reconstituted native and mutated ion channels. Using this system, several types of ion channels, including mutated forms, were characterised by determining the protein orientation. In addition, we provide evidence that both intra- and extracellular amyloid-beta fragments directly inhibit the channel open probability of the hBK channel. This automated methodology provides a high-throughput drug screening system for the targeting of ion channels and a data-intensive analysis technique for studying ion channel gating mechanisms.
Single-ion and single-chain magnetism in triangular spin-chain oxides
Seikh, Md. Motin; Caignaert, Vincent; Perez, Olivier; Raveau, Bernard; Hardy, Vincent
2017-05-01
S r4 -xC axM n2Co O9 oxides (x =0 and x =2 ) are found to exhibit magnetic responses typical of single-chain magnets (SCMs) and single-ion magnets (SIMs), two features generally investigated in coordination polymers or complexes. The compound x =0 appears to be a genuine SCM, in that blocking effects associated with slow spin dynamics yield remanence and coercivity in the absence of long-range ordering (LRO). In addition, SIM signatures of nearly identical nature are detected in both compounds, coexisting with SCM in x =0 and with LRO in x =2 . It is also observed that a SCM response can be recovered in x =2 after application of magnetic field. These results suggest that purely inorganic systems could play a valuable role in the topical issue of the interplay among SIM, SCM, and LRO phenomena in low-dimensional magnetism.
Design of a single ion facility and its applications
Energy Technology Data Exchange (ETDEWEB)
Cholewa, M.; Saint, A.; Legge, G.J.F. [Melbourne Univ., Parkville, VIC (Australia). School of Physics
1996-12-31
The use of micro-irradiation techniques in radiobiology is not new; however, the current techniques take advantage of recent developments in particle delivery, focussing detection, image processing, cell recognition and computer control. These developments have generally come from other fields, for example microbeam elemental analysis techniques and single-event upset testing of semiconductor devices. Also in radiation biology there have been important advances in developments of individual cell assays, which allow a wide range of endpoints to be studied with good accuracy at low doses. Many of the studies that are planned involve following the responses of individual cells after a programmed exposure to charged-particle traversals. To probe the radiation sensitivity of a single cell and/or its constituents with a submicron resolution several developments are needed. The essential parameters of the proposed system can be summarised as follows: a focussed beam of ions of 300nm or less at the cell; a reliable (close to 100%) single ion detection; a fast beam switch to prevent second hits; a target holder adapted for the irradiation of wet cells and a fully automated system for cell recognition and single hits. 1 fig.
Conduction Mechanisms and Structure of Ionomeric Single-Ion Conductors
Energy Technology Data Exchange (ETDEWEB)
Colby, Ralph H. [Pennsylvania State Univ., University Park, PA (United States); Maranas, Janna K. [Pennsylvania State Univ., University Park, PA (United States); Mueller, Karl T. [Pennsylvania State Univ., University Park, PA (United States); Runt, James [Pennsylvania State Univ., University Park, PA (United States); Winey, Karen I. [Univ. of Pennsylvania, Philadelphia, PA (United States)
2015-03-01
Our team has designed using DFT (Gaussian) and synthesized low glass transition temperature single-ion conductors that are either polyanions that conduct small cations Li^{+}, Na^{+}, Cs^{+} or polycations that conduct small anions F^{-}, OH^{-}, Br^{-}. We utilize a wide range of complimentary experimental materials characterization tools to understand ion transport; differential scanning calorimetry, dielectric relaxation spectroscopy, infrared spectroscopy, nuclear magnetic resonance spectroscopy, linear viscoelasticity, X-ray scattering and molecular dynamics simulations. The glass transition temperature T_{g} needs to be as low as possible to facilitate ion transport, so the nonionic parts of the polymer need to be polar, flexible and have strong solvation interactions with the ions. The lowest T_{g} we have managed for polyanions conducting Li^{+} is -60 °C. In contrast, polysiloxanes with PEO side chains and tetrabutylphosphonium cationic side groups have T_{g} ≈ -75 °C that barely increases with ion content, as anticipated by DFT. A survey of all polyanions in the literature suggests that T_{g} < -80 °C is needed to achieve the 10^{-4} S/cm conductivity needed for battery separators.
Single ion impact detection and scanning probe aligned ion implantation for quantum bit formation
International Nuclear Information System (INIS)
Weis, Christoph D.
2011-01-01
Quantum computing and quantum information processing is a promising path to replace classical information processing via conventional computers which are approaching fundamental physical limits. Instead of classical bits, quantum bits (qubits) are utilized for computing operations. Due to quantum mechanical phenomena such as superposition and entanglement, a completely different way of information processing is achieved, enabling enhanced performance for certain problem sets. Various proposals exist on how to realize a quantum bit. Among them are electron or nuclear spins of defect centers in solid state systems. Two such candidates with spin degree of freedom are single donor atoms in silicon and nitrogen vacancy (NV) defect centers in diamond. Both qubit candidates possess extraordinary qualities which makes them promising building blocks. Besides certain advantages, the qubits share the necessity to be placed precisely in their host materials and device structures. A commonly used method is to introduce the donor atoms into the substrate materials via ion implantation. For this, focused ion beam systems can be used, or collimation techniques as in this work. A broad ion beam hits the back of a scanning probe microscope (SPM) cantilever with incorporated apertures. The high resolution imaging capabilities of the SPM allows the non destructive location of device areas and the alignment of the cantilever and thus collimated ion beam spot to the desired implant locations. In this work, this technique is explored, applied and pushed forward to meet necessary precision requirements. The alignment of the ion beam to surface features, which are sensitive to ion impacts and thus act as detectors, is demonstrated. The technique is also used to create NV center arrays in diamond substrates. Further, single ion impacts into silicon device structures are detected which enables deliberate single ion doping.
Single ion impact detection and scanning probe aligned ion implantation for quantum bit formation
Energy Technology Data Exchange (ETDEWEB)
Weis, Christoph D.
2011-10-04
Quantum computing and quantum information processing is a promising path to replace classical information processing via conventional computers which are approaching fundamental physical limits. Instead of classical bits, quantum bits (qubits) are utilized for computing operations. Due to quantum mechanical phenomena such as superposition and entanglement, a completely different way of information processing is achieved, enabling enhanced performance for certain problem sets. Various proposals exist on how to realize a quantum bit. Among them are electron or nuclear spins of defect centers in solid state systems. Two such candidates with spin degree of freedom are single donor atoms in silicon and nitrogen vacancy (NV) defect centers in diamond. Both qubit candidates possess extraordinary qualities which makes them promising building blocks. Besides certain advantages, the qubits share the necessity to be placed precisely in their host materials and device structures. A commonly used method is to introduce the donor atoms into the substrate materials via ion implantation. For this, focused ion beam systems can be used, or collimation techniques as in this work. A broad ion beam hits the back of a scanning probe microscope (SPM) cantilever with incorporated apertures. The high resolution imaging capabilities of the SPM allows the non destructive location of device areas and the alignment of the cantilever and thus collimated ion beam spot to the desired implant locations. In this work, this technique is explored, applied and pushed forward to meet necessary precision requirements. The alignment of the ion beam to surface features, which are sensitive to ion impacts and thus act as detectors, is demonstrated. The technique is also used to create NV center arrays in diamond substrates. Further, single ion impacts into silicon device structures are detected which enables deliberate single ion doping.
Pajevic, Sinisa; Aldroubi, Akram; Basser, Peter J
2002-01-01
The effective diffusion tensor of water, D, measured by diffusion tensor MRI (DT-MRI), is inherently a discrete, noisy, voxel-averaged sample of an underlying macroscopic effective diffusion tensor field, D(x). Within fibrous tissues this field is presumed to be continuous and smooth at a gross anatomical length scale. Here a new, general mathematical framework is proposed that uses measured DT-MRI data to produce a continuous approximation to D(x). One essential finding is that the continuous tensor field representation can be constructed by repeatedly performing one-dimensional B-spline transforms of the DT-MRI data. The fidelity and noise-immunity of this approximation are tested using a set of synthetically generated tensor fields to which background noise is added via Monte Carlo methods. Generally, these tensor field templates are reproduced faithfully except at boundaries where diffusion properties change discontinuously or where the tensor field is not microscopically homogeneous. Away from such regions, the tensor field approximation does not introduce bias in useful DT-MRI parameters, such as Trace(D(x)). It also facilitates the calculation of several new parameters, particularly differential quantities obtained from the tensor of spatial gradients of D(x). As an example, we show that they can identify tissue boundaries across which diffusion properties change rapidly using in vivo human brain data. One important application of this methodology is to improve the reliability and robustness of DT-MRI fiber tractography.
Development of the IFJ single ion hit facility for cells irradiation
International Nuclear Information System (INIS)
Veselov, O.; Polak, W.; Ugenskiene, R.; Hajduk, R.; Lebed, K.; Lekki, J.; Horwacik, T.; Dutkiewicz, E.M.; Maranda, S.; Pieprzyca, T.; Sarnecki, C.; Stachura, Z.; Szklarz, Z.; Styczen, J.
2005-12-01
In recent years a single ion hit facility (SIHF) has been constructed at the IFJ ion microprobe. The setup is used for the precise irradiations of living cells by a controlled number of ions. The facility allows investigations in various aspects of biomedical research, such as adaptive response, bystander effect, inverse dose-rate effect, low-dose hypersensitivity, etc. Those investigations have two very important requirements: (i) cells must be examined in their natural state and environment, i.e. without previously being killed, and preferentially, neither fixed nor stained, and (ii) a possibility of automatic irradiation of large number of cells with a computer recognition of their positions must be provided. This work presents some of the crucial features of the off-line and on-line optical systems, including self-developed software responsible for the automatic cell recognition. We also show several tests carried out to determine the efficiency of the whole setup and some segments. In conclusion, the results of our first irradiation measurements performed with living cells are demonstrated. (author)
Peng, Yan; Mereacre, Valeriu; Anson, Christopher E; Zhang, Yiquan; Bodenstein, Tilmann; Fink, Karin; Powell, Annie K
2017-06-05
Three air-stable Co(II) mononuclear complexes with different aromatic substituents have been prepared and structurally characterized by single-crystal X-ray diffraction. The mononuclear complexes [Co(H 2 L1) 2 ]·2THF (1), [Co(HL2) 2 ] (2), and [Co(H 2 L3) 2 ]·CH 2 Cl 2 (3) (where H 3 L1, H 2 L2, and H 3 L3 represent 3-hydroxy-naphthalene-2-carboxylic acid (6-hydroxymethyl-pyridin-2-ylmethylene) hydrazide, nicotinic acid (6-hydroxymethyl-pyridin-2-ylmethylene) hydrazide, and 2-hydroxy-benzoic acid (6-hydroxymethyl-pyridin-2-ylmethylene) hydrazide, respectively) feature a distorted mer octahedral coordination geometry. Detailed magnetic studies of 1-3 have been conducted using direct and alternating current magnetic susceptibility data. Field-induced slow magnetic relaxation was observed for these three complexes. There are few examples of such behavior in (distorted) octahedral coordination geometry (OC) Co(II) mononuclear complexes with uniaxial anisotropy. Analysis of the six-coordinate Co(II) mononuclear single-ion magnets (SIMs) in the literature using the SHAPE program revealed that they all show what is best described as distorted trigonal prismatic (TRP) coordination geometry, and in general, these show negative D zero-field splitting (ZFS) values. On the other hand, all the Co(II) mononuclear complexes displaying what is best approximated as distorted octahedral (OC) coordination geometry show positive D values. In the new Co(II) mononuclear complexes we describe here, there is an ambiguity, since the rigid tridentate ligands confer what is best described for an octahedral complex as a mer coordination geometry, but the actual shape of the first coordination sphere is between octahedral and trigonal prismatic. The negative D values observed experimentally and supported by high-level electronic structure calculations are thus in line with a trigonal prismatic geometry. However, a consideration of the rhombicity as indicated by the E value of the ZFS in
Porcarelli, Luca; Aboudzadeh, M. Ali; Rubatat, Laurent; Nair, Jijeesh R.; Shaplov, Alexander S.; Gerbaldi, Claudio; Mecerreyes, David
2017-10-01
Single-ion conducting polymer electrolytes represent the ideal solution to reduce concentration polarization in lithium metal batteries (LMBs). This paper reports on the synthesis and characterization of single-ion ABA triblock copolymer electrolytes comprising PEO and poly(lithium 1-[3-(methacryloyloxy)propylsulfonyl]-1-(trifluoromethylsulfonyl)imide) blocks, poly(LiMTFSI). Block copolymers are prepared by reversible addition-fragmentation chain transfer polymerization, showing low glass transition temperature (-55 to 7 °C) and degree of crystallinity (51-0%). Comparatively high values of ionic conductivity are obtained (up to ≈ 10-4 S cm-1 at 70 °C), combined with a lithium-ion transference number close to unity (tLi+ ≈ 0.91) and a 4 V electrochemical stability window. In addition to these promising features, solid polymer electrolytes are successfully tested in lithium metal cells at 70 °C providing long lifetime up to 300 cycles, and stable charge/discharge cycling at C/2 (≈100 mAh g-1).
Energy Technology Data Exchange (ETDEWEB)
Lee, Jinhong; Song, Jongchan; Lee, Hongkyung; Noh, Hyungjun; Kim, Yun-Jung; Kwon, Sung Hyun; Lee, Seung Geol; Kim, Hee-Tak
2017-04-19
Formation of soluble polysulfide (PS), which is a key feature of lithium sulfur (Li–S) batteries, provides a fast redox kinetic based on a liquid–solid mechanism; however, it imposes the critical problem of PS shuttle. Here, we address the dilemma by exploiting a solvent-swollen polymeric single-ion conductor (SPSIC) as the electrolyte medium of the Li–S battery. The SPSIC consisting of a polymeric single-ion conductor and lithium salt-free organic solvents provides Li ion hopping by forming a nanoscale conducting channel and suppresses PS shuttle according to the Donnan exclusion principle when being employed for Li–S batteries. The organic solvents at the interface of the sulfur/carbon composite and SPSIC eliminate the poor interfacial contact and function as a soluble PS reservoir for maintaining the liquid–solid mechanism. Furthermore, the quasi-solid-state SPSIC allows the fabrication of a bipolar-type stack, which promises the realization of a high-voltage and energy-dense Li–S battery.
DEFF Research Database (Denmark)
Dreiser, Jan; Wäckerlin, Christian; Ali, Md. Ehesan
2014-01-01
We present a comprehensive study of Er(trensal) single-ion magnets deposited in ultrahigh vacuum onto metallic surfaces. X-ray photoelectron spectroscopy reveals that the molecular structure is preserved after sublimation, and that the molecules are physisorbed on Au(111) while they are chemisorbed....... Furthermore XMCD indicates a weak antiferromagnetic exchange coupling between the single-ion magnets and the ferromagnetic Ni/Cu(100) substrate. For the latter case, spin-Hamiltonian fits to the XMCD M(H) suggest a significant structural distortion of the molecules. Scanning tunneling microscopy reveals...
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...
A simple and rapid method for high-resolution visualization of single-ion tracks
Directory of Open Access Journals (Sweden)
Masaaki Omichi
2014-11-01
Full Text Available Prompt determination of spatial points of single-ion tracks plays a key role in high-energy particle induced-cancer therapy and gene/plant mutations. In this study, a simple method for the high-resolution visualization of single-ion tracks without etching was developed through the use of polyacrylic acid (PAA-N, N’-methylene bisacrylamide (MBAAm blend films. One of the steps of the proposed method includes exposure of the irradiated films to water vapor for several minutes. Water vapor was found to promote the cross-linking reaction of PAA and MBAAm to form a bulky cross-linked structure; the ion-track scars were detectable at a nanometer scale by atomic force microscopy. This study demonstrated that each scar is easily distinguishable, and the amount of generated radicals of the ion tracks can be estimated by measuring the height of the scars, even in highly dense ion tracks. This method is suitable for the visualization of the penumbra region in a single-ion track with a high spatial resolution of 50 nm, which is sufficiently small to confirm that a single ion hits a cell nucleus with a size ranging between 5 and 20 μm.
Versolato, O. O.; Wansbeek, L. W.; Jungmann, K.; Timmermans, R. G. E.; Willmann, L.; Wilschut, H. W.
2011-01-01
We explore the potential of the electric quadrupole transitions 7s (2)S(1/2)-(6)d (2)D(3/2), 6d (2)D(5/2) in radium isotopes as single-ion optical frequency standards. The frequency shifts of the clock transitions due to external fields and the corresponding uncertainties are calculated. Several
Anisotropic Lithium Ion Conductivity in Single-Ion Diblock Copolymer Electrolyte Thin Films
Aissou, Karim; Mumtaz, Muhammad; Usluer, Özlem; Pécastaings, Gilles; Portale, Giuseppe; Fleury, Guillaume; Cloutet, Eric; Hadziioannou, Georges
Well-defined single-ion diblock copolymers consisting of a Li-ion conductive poly(styrenesulfonyllithium(trifluoromethylsulfonyl)imide) (PSLiTFSI) block associated with a glassy polystyrene (PS) block have been synthesized via reversible addition fragmentation chain transfer polymerization.
Mercaldo, M. T.; Rabuffo, I.; De Cesare, L.; Caramico D'Auria, A.
2017-10-01
The Devlin two-time Green function framework is used to investigate the role played by the easy-axis single-ion anisotropy on the phase diagram of (d > 2) -dimensional spin-1 planar ferromagnets which exhibit a magnetic-field-induced quantum phase transition (QPT). In this scheme, the exchange anisotropy terms in the equations of motion are treated at the Tyablikov decoupling level while the crystal field anisotropy contribution is handled exactly. The emerging key result is a reentrant structure of the phase diagram close to the quantum critical point for a well defined window of values of the single-ion anisotropy parameter. This experimentally interesting feature was recently recovered by employing the Anderson-Callen decoupling (ACD) which is considered to provide meaningful results only for small values of the single-ion anisotropy parameter. In this context, our findings suggest that the simplest ACD treatment offers the possibility to have, at least qualitatively, a correct physical scenario of quantum criticality close to a field-induced QPT avoiding the limiting mathematical difficulties involved in the Devlin scheme.
Magnetic anisotropy of a Co-II single ion magnet with distorted trigonal prismatic coordination
DEFF Research Database (Denmark)
Peng, Yan; Bodenstein, Tilmann; Fink, Karin
2016-01-01
(methanylylidene)) bis(2-methoxyphenol) coordinates to Co(II) does indeed lead to enhanced single-ion behaviour as has previously been predicted. Synthesis of the compound, structural information, and static as well as dynamic magnetic data are presented along with an analysis using quantum chemical ab initio......The single ion magnetic properties of Co(II) are affected by the details of the coordination geometry of the ion. Here we show that a geometry close to trigonal prismatic which arises when the ligand 6,6'-((1Z)-((piperazine-1,4-diylbis(propane-3,1-diyl)) bis(azanylylidene)) bis...... calculations. Though the complex shows a slight deviation from an ideal trigonal prismatic coordination, the zero-field splitting as well as the g-tensor are strongly axial with D = -41 cm(-1) and E
The single-ion anisotropy effects in the mixed-spin ternary-alloy
Albayrak, Erhan
2018-04-01
The effect of single-ion anisotropy on the thermal properties of the ternary-alloy in the form of ABpC1-p is investigated on the Bethe lattice (BL) in terms of exact recursion relations. The simulation on the BL consists of placing A atoms (spin-1/2) on the odd shells and randomly placing B (spin-3/2) or C (spin-5/2) atoms with concentrations p and 1 - p, respectively, on the even shells. The phase diagrams are calculated in possible planes spanned by the system parameters: temperature, single-ion anisotropy, concentration and ratio of the bilinear interaction parameters for z = 3 corresponding to the honeycomb lattice. It is found that the crystal field drives the system to the lowest possible state therefore reducing the temperatures of the critical lines in agreement with the literature.
Modifying the properties of 4f single-ion magnets by peripheral ligand functionalisation
DEFF Research Database (Denmark)
Pedersen, Kasper Steen; Ungur, Liviu; Sigrist, Marc
2014-01-01
We study the ligand-field splittings and magnetic properties of three ErIII single-ion magnets which differ in the peripheral ligand sphere but exhibit similar first coordination spheres by inelastic neutron scattering (INS) and SQUID magnetometry. The INS spectra of the three compounds are profo......We study the ligand-field splittings and magnetic properties of three ErIII single-ion magnets which differ in the peripheral ligand sphere but exhibit similar first coordination spheres by inelastic neutron scattering (INS) and SQUID magnetometry. The INS spectra of the three compounds...... allows for the extraction of the sign and magnitude of all symmetry-allowed Stevens parameters. The parameter values and the energy spectrum derived from INS are compared to the results of state-of-the-art ab initio CASSCF calculations. Temperature-dependent alternating current (ac) susceptibility...... measurements suggest that the magnetisation relaxation in the investigated temperature range of 1.9 K
Single-ion and pair-interaction potentials near simple metal surfaces
International Nuclear Information System (INIS)
Barnett, R.N.; Barrera, R.G.; Cleveland, C.L.; Landman, U.
1983-01-01
Presented is a model for semi-infinite simple metals which does not require crystalline order or a single species, and thus is applicable to problems of defect energetics near the surface and random-alloy surfaces as well as ideal metal surfaces. The formulation is based on the use of ionic pseudopotentials and linear-response theory. An expression for the total energy is obtained which depends explicitly on ionic species and position. This expression is decomposed into a density-dependent term and single-ion and ionic pair-interaction potential terms. The single-ion potentials oscillate about a constant bulk value, with the magnitude of the oscillation decreasing rapidly away from the surface. The interaction between pairs of ions near the surface is shown to be a noncentral force interaction which differs significantly from the central-force bulk pair potential. The effect of quantum interference in the response of the semi-infinite electron gas to the ions is seen in both the single-ion and the pair-interaction potentials. Results are presented for the simple metals sodium, potassium, and rubidium
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:
The rise of 3-d single-ion magnets in molecular magnetism: towards materials from molecules?
Frost, Jamie M; Harriman, Katie L M; Murugesu, Muralee
2016-04-21
Single-molecule magnets (SMMs) that contain one spin centre (so-called single-ion magnets) theoretically represent the smallest possible unit for spin-based electronic devices. The realisation of this and related technologies, depends on first being able to design systems with sufficiently large energy barriers to magnetisation reversal, U eff , and secondly, on being able to organise these molecules into addressable arrays. In recent years, significant progress has been made towards the former goal - principally as a result of efforts which have been directed towards studying complexes based on highly anisotropic lanthanide ions, such as Tb(iii) and Dy(iii). Since 2013 however, and the remarkable report by Long and co-workers of a linear Fe(i) system exhibiting U eff = 325 K, single-ion systems of transition metals have undergone something of a renaissance in the literature. Not only do they have important lessons to teach us about anisotropy and relaxation dynamics in the quest to enhance U eff , the ability to create strongly coupled spin systems potentially offers access to a whole of host of 1, 2 and 3-dimensional materials with interesting structural and physical properties. This perspective summarises recent progress in this rapidly expanding sub-genre of molecular magnetism from the viewpoint of the synthetic chemist, with a particular focus on the lessons that have so far been learned from single-ion magnets of the d-block, and, the future research directions which we feel are likely to emerge in the coming years.
Rational Design of Lanthanoid Single-Ion Magnets: Predictive Power of the Theoretical Models.
Baldoví, José J; Duan, Yan; Morales, Roser; Gaita-Ariño, Alejandro; Ruiz, Eliseo; Coronado, Eugenio
2016-09-12
We report two new single-ion magnets (SIMs) of a family of oxydiacetate lanthanide complexes with D3 symmetry to test the predictive capabilities of complete active space ab initio methods (CASSCF and CASPT2) and the semiempirical radial effective charge (REC) model. Comparison of the theoretical predictions of the energy levels, wave functions and magnetic properties with detailed spectroscopic and magnetic characterisation is used to critically discuss the limitations of these theoretical approaches. The need for spectroscopic information for a reliable description of the properties of lanthanide SIMs is emphasised. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Subattoampere current induced by single ions in silicon oxide layers of nonvolatile memory cells
International Nuclear Information System (INIS)
Cellere, G.; Paccagnella, A.; Larcher, L.; Visconti, A.; Bonanomi, M.
2006-01-01
A single ion impinging on a thin silicon dioxide layer generates a number of electron/hole pairs proportional to its linear energy transfer coefficient. Defects generated by recombination can act as a conductive path for electrons that cross the oxide barrier, thanks to a multitrap-assisted mechanism. We present data on the dependence of this phenomenon on the oxide thickness by using floating gate memory arrays. The tiny number of excess electrons stored in these devices allows for extremely high sensitivity, impossible with any direct measurement of oxide leakage current. Results are of particular interest for next generation devices
Feasibility of Observing and Characterizing Single Ion Strikes in Microelectronic Components.
Energy Technology Data Exchange (ETDEWEB)
Dingreville, Remi Philippe Michel [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Hattar, Khalid Mikhiel [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Bufford, Daniel Charles [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
2015-11-01
The transient degradation of semiconductor device performance under irradiation has long been an issue of concern. A single high-energy charged particle can degrade or permanently destroy the microelectronic component, potentially altering the course or function of the systems. Disruption of the the crystalline structure through the introduction of quasi-stable defect structures can change properties from semiconductor to conductor. Typically, the initial defect formation phase is followed by a recovery phase in which defect-defect or defect-dopant interactions modify the characteristics of the damaged structure. In this LDRD Express, in-situ ion irradiation transmission microscopy (TEM) in-situ TEM experiments combined with atomistic simulations have been conducted to determine the feasibility of imaging and characterizing the defect structure resulting from a single cascade in silicon. In-situ TEM experiments have been conducted to demonstrate that a single ion strike can be observed in Si thin films with nanometer resolution in real time using the in-situ ion irradiation transmission electron microscope (I^{3}TEM). Parallel to this experimental effort, ion implantation has been numerically simulated using Molecular Dynamics (MD). This numerical framework provides detailed predictions of the damage and follow the evolution of the damage during the first nanoseconds. The experimental results demonstrate that single ion strike can be observed in prototypical semiconductors.
Feasibility of Observing and Characterizing Single Ion Strikes in Microelectronic Components
International Nuclear Information System (INIS)
Dingreville, Remi Philippe Michel; Hattar, Khalid Mikhiel; Bufford, Daniel Charles
2015-01-01
The transient degradation of semiconductor device performance under irradiation has long been an issue of concern. A single high-energy charged particle can degrade or permanently destroy the microelectronic component, potentially altering the course or function of the systems. Disruption of the the crystalline structure through the introduction of quasi-stable defect structures can change properties from semiconductor to conductor. Typically, the initial defect formation phase is followed by a recovery phase in which defect-defect or defect-dopant interactions modify the characteristics of the damaged structure. In this LDRD Express, in-situ ion irradiation transmission microscopy (TEM) in-situ TEM experiments combined with atomistic simulations have been conducted to determine the feasibility of imaging and characterizing the defect structure resulting from a single cascade in silicon. In-situ TEM experiments have been conducted to demonstrate that a single ion strike can be observed in Si thin films with nanometer resolution in real time using the in-situ ion irradiation transmission electron microscope (I 3 TEM). Parallel to this experimental effort, ion implantation has been numerically simulated using Molecular Dynamics (MD). This numerical framework provides detailed predictions of the damage and follow the evolution of the damage during the first nanoseconds. The experimental results demonstrate that single ion strike can be observed in prototypical semiconductors.
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.
Single Ion transient-IBIC analyses of semiconductor devices using a cryogenic temperature stage
International Nuclear Information System (INIS)
Laird, J.S.; Bardos, R.; Legge, G.J.F.; Jagadish, C.
1998-01-01
A new Transient - IBIC data acquisition and analysis system at MARC is described. A discussion on the need for single ion control and temperature control is also given. The recorded signal is used as the trigger for beam pulsing. The new cryostatic temperature control stage is introduced. Data is presented on line profiles across the edge of a Au-Si junction collected over the temperature range of 25-300K using a developed C-V and I-V variable temperature stage incorporating a liquid helium cryostat. It demonstrates the potential improvements in spatial resolution in materials of long lifetime by mapping on timing windows around the prompt charge component in the charge transient
Development of noise-suppressed detector for single ion hit system
Energy Technology Data Exchange (ETDEWEB)
Sakai, Takuro; Hamano, Tsuyoshi; Suda, Tamotsu; Hirao, Toshio; Kamiya, Tomihiro [Japan Atomic Energy Research Inst., Takasaki, Gunma (Japan). Takasaki Radiation Chemistry Research Establishment
1997-03-01
A noise-suppressed detector for single ion detection has been developed, and combined with the heavy ion microbeam apparatus. This detector consists of a pair of micro channel plates (MCP`s) and a very thin carbon foil. The detection signal is formed by the coincidence of the signals from these MCP`s, so that this detector and the coincidence measurement unit can reduce miscounting in the circuit. The detection efficiency for 15 MeV heavy ions was evaluated to be comparable to that of a silicon surface-barrier detector (SSD) and the miscounting rate was 4 orders lower than the noise rate of a single MCP. The rise time of the detection signal was also estimated. (author)
Single Ion transient-IBIC analyses of semiconductor devices using a cryogenic temperature stage
Energy Technology Data Exchange (ETDEWEB)
Laird, J.S.; Bardos, R.; Legge, G.J.F. [Melbourne Univ., Parkville, VIC (Australia). School of Physics; Jagadish, C. [Australian National Univ., Canberra, ACT (Australia). School of Physics, Electronic Materials Engineering
1998-06-01
A new Transient - IBIC data acquisition and analysis system at MARC is described. A discussion on the need for single ion control and temperature control is also given. The recorded signal is used as the trigger for beam pulsing. The new cryostatic temperature control stage is introduced. Data is presented on line profiles across the edge of a Au-Si junction collected over the temperature range of 25-300K using a developed C-V and I-V variable temperature stage incorporating a liquid helium cryostat. It demonstrates the potential improvements in spatial resolution in materials of long lifetime by mapping on timing windows around the prompt charge component in the charge transient. 2 figs.
Dynamics of a single ion in a perturbed Penning trap: Octupolar perturbation
International Nuclear Information System (INIS)
Lara, Martin; Salas, J. Pablo
2004-01-01
Imperfections in the design or implementation of Penning traps may give rise to electrostatic perturbations that introduce nonlinearities in the dynamics. In this paper we investigate, from the point of view of classical mechanics, the dynamics of a single ion trapped in a Penning trap perturbed by an octupolar perturbation. Because of the axial symmetry of the problem, the system has two degrees of freedom. Hence, this model is ideal to be managed by numerical techniques like continuation of families of periodic orbits and Poincare surfaces of section. We find that, through the variation of the two parameters controlling the dynamics, several periodic orbits emanate from two fundamental periodic orbits. This process produces important changes (bifurcations) in the phase space structure leading to chaotic behavior
Jeong, Jaehong; Le, Manh Duc; Bourges, P.; Petit, S.; Furukawa, S.; Kim, Shin-Ae; Lee, Seongsu; Cheong, S.-W.; Park, Je-Geun
2014-09-01
Low-energy magnon excitations in multiferroic BiFeO3 were measured in detail as a function of temperature around several Brillouin zone centers by inelastic neutron scattering experiments on single crystals. Unique features around 1 meV are directly associated with the interplay of the Dzyaloshinskii-Moriya interaction and a small single-ion anisotropy. The temperature dependence of these and the exchange interactions were determined by fitting the measured magnon dispersion with spin-wave calculations. The spectra best fit an easy-axis type magnetic anisotropy and the deduced exchange and anisotropy parameters enable us to determine the anharmonicity of the magnetic cycloid. We then draw a direct connection between the changes in the parameters of spin Hamiltonian with temperature and the physical properties and structural deformations of BiFeO3.
Diode-like single-ion track membrane prepared by electro-stopping
International Nuclear Information System (INIS)
Apel, P.Yu.; Korchev, Yu.E.; Siwy, Z.; Spohr, R.; Yoshida, M.
2001-01-01
The preparation of an asymmetric membrane in poly(ethylene terephthalate) (PET) is described, using a combination of chemical and electro-stopping. For this purpose, a single-ion-irradiated PET film is inserted into an electrolytic cell and etched from one side in 9 M sodium hydroxide while bathing the other side in a mixture of 2 M KCl and 2 M HCOOH (1:1 by volume), electrically retracting the OH - ions from the tip of the etch pit during pore break-through. When a preset current has been reached, the etch process is interrupted by replacing the etching solution with acidic 1 M potassium chloride solution. After etching, the current-voltage (I-V) characteristic is determined under symmetric bathing conditions, immersing both sides of the membrane in KCl solutions of identical concentration (0.01-1 M) and pH (3-8). The I-V characteristic is strongly non-linear, comparable to that of an electrical diode. If the polarity during etching is reversed, pushing the OH - ions into the tip of the etch pit, the resulting pores are larger and the degree of asymmetry smaller. The importance of electro-stopping is compared with chemical stopping
Luminescent single-ion magnets from Lanthanoid(III) complexes with monodentate ketone ligands
Energy Technology Data Exchange (ETDEWEB)
Kanetomo, Takuya; Ishida, Takayuki, E-mail: takayuki.ishida@uec.ac.jp [Department of Engineering Science, The University of Electro-Communications, Tokyo (Japan)
2016-02-01
We synthesized [Ln{sup III}(hfac){sub 3}(H{sub 2}O)(L)] (abbreviated as Ln-L; Ln = Gd, Tb, Eu; L = DTBK (di-t-butyl ketone), BP (benzophenone)), in which the carbonyl oxygen atom was coordinated to the Ln ion center, despite of such bulky substituents. Their crystal structures were determined by means of X-ray diffraction study. Gd-DTBK is completely isomorphous to the di-t-butyl nitroxide derivative and accordingly can be regarded as a model with the ligand spin masked. The ac magnetic susceptibility measurements on Tb-DTBK and -BP showed frequency dependence, characteristic of single-ion magnets. They also displayed photoluminescence in the solid state at room temperature. The quantum yields of the luminescence of Tb-DTBK and -BP (λ{sub ex} = 360 nm) were improved to 57 and 35%, respectively, from that of the starting material [TbI{sup III}(hfac){sub 3}(H{sub 2}O){sub 2}] (28% at λ{sub ex} = 370 nm). Similarly, the quantum yields for Eu-DTBK and -BP were 8 and 15%, respectively, with λ{sub ex} = 400 nm, while that of the starting material [EuI{sup III}(hfac){sub 3}(H{sub 2}O){sub 2}] was 4% at λ{sub ex}=400 nm.
Luminescent single-ion magnets from Lanthanoid(III) complexes with monodentate ketone ligands
Kanetomo, Takuya; Ishida, Takayuki
2016-02-01
We synthesized [LnIII(hfac)3(H2O)(L)] (abbreviated as Ln-L; Ln = Gd, Tb, Eu; L = DTBK (di-t-butyl ketone), BP (benzophenone)), in which the carbonyl oxygen atom was coordinated to the Ln ion center, despite of such bulky substituents. Their crystal structures were determined by means of X-ray diffraction study. Gd-DTBK is completely isomorphous to the di-t-butyl nitroxide derivative and accordingly can be regarded as a model with the ligand spin masked. The ac magnetic susceptibility measurements on Tb-DTBK and -BP showed frequency dependence, characteristic of single-ion magnets. They also displayed photoluminescence in the solid state at room temperature. The quantum yields of the luminescence of Tb-DTBK and -BP (λex = 360 nm) were improved to 57 and 35%, respectively, from that of the starting material [TbIIII(hfac)3(H2O)2] (28% at λex = 370 nm). Similarly, the quantum yields for Eu-DTBK and -BP were 8 and 15%, respectively, with λex = 400 nm, while that of the starting material [EuIIII(hfac)3(H2O)2] was 4% at λex=400 nm.
Comb-shaped single ion conductors based on polyacrylate ethers and lithium alkyl sulfonate
International Nuclear Information System (INIS)
Sun Xiaoguang; Hou Jun; Kerr, John B.
2005-01-01
Comb-shaped single ion conductors have been synthesized by (1) sulfonation of small molecule chloroethyleneglycols, which, after ion exchange to the Li + salt were then converted to the acrylate by reaction with acryloyl chloride and copolymerized with polyethylene glycol monomethyl ether acrylate (Mn = 454, n = 8) (PAE 8 -co-E 3 SO 3 Li); (2) sulfonation of chloride end groups grafted on to prepolymers of polyacrylate ethers (PAE 8 -g-E n SO 3 Li, n = 2, 3). The highest conductivity at 25 deg. C of 2.0 x 10 -7 S cm -1 was obtained for the PAE 8 -co-E 3 SO 3 Li with a salt concentration of EO/Li = 40. The conductivity of PAE 8 -g-E 3 SO 3 Li is lower than that of PAE 8 -co-E 3 SO 3 Li at similar salt concentrations, which is related to the incomplete sulfonation of the grafted polymer that leads to a lower concentration of Li + . The addition of 50 wt.% of plasticizer, PC/EMC (1/1, v/v), to PAE 8 -g-E 2 SO 3 Li increases the ambient conductivity by three orders of magnitude, which is due to the increased ion mobility in a micro-liquid environment and an increase concentration of free ions as a result of the higher dielectric constant of the solvent. A symmetrical Li/Li cell with an electrolyte membrane consisting of 75 wt.% PC/EMC (1/1, v/v) was cycled at a current density of 100 μA cm -2 at 85 deg. C. The cycling profile showed no concentration polarization after a break-in period during the first few cycles, which was apparently due to reaction of the solvent at the lithium metal surface that reacted with lithium metal to form a stable SEI layer
Tu, Zhengyuan
2017-09-21
Substrates able to rectify transport of ions based on charge and/or size are ubiquitous in biological systems. Electrolytes and interphases that selectively transport electrochemically active ions are likewise of broad interest in all electrical energy storage technologies. In lithium-ion batteries, electrolytes with single- or near-single-ion conductivity reduce losses caused by ion polarization. In emergent lithium or sodium metal batteries, they maintain high conductivity at the anode and stabilize metal deposition by fundamental mechanisms. We report that 20- to 300-nm-thick, single-ion-conducting membranes deposited at the anode enable electrolytes with the highest combination of cation transference number, ionic conductivity, and electrochemical stability reported. By means of direct visualization we find that single-ion membranes also reduce dendritic deposition of Li in liquids. Galvanostatic measurements further show that the electrolytes facilitate long (3 mAh) recharge of full Li/LiNi0.8Co0.15Al0.05O2 (NCA) cells with high cathode loadings (3 mAh cm−2/19.9 mg cm−2) and at high current densities (3 mA cm−2).
Yan, Ying
2013-01-01
The work presented in this thesis was concerned with investigating the relevant spectroscopic properties of Ce ions randomly doped in an Y2SiO5 crystal at low temperatures (around 4 K), in order to develop a technique and an experimental set-up to detect the fluorescence photons emitted by a single Ce ion. The aim of the work was to determine whether a single Ce ion (referred to as the readout ion) can be used as a local probe to sense the quantum state of a neighbouring single-ion qubit via ...
International Nuclear Information System (INIS)
Freedman, Yu.A.; Klevets, F.N.; Matunin, D.A.
2006-01-01
The influence of planar and bulk elastic interactions on the phase states of an ultrathin ferromagnetic film with anisotropic exchange interaction is investigated for different relationships among the material constants. It is shown that when the elastic interactions, with competing exchange and single-ion anisotropies, and the magnetic dipole interaction are taken into account, a cascade of phase transitions appears. Furthermore, taking the 'planar' elastic interaction into account leads to realization of an additional phase, with an easy axis in the film plane. This state is absent in the case of a bulk elastic subsystem
Network type sp3 boron-based single-ion conducting polymer electrolytes for lithium ion batteries
Deng, Kuirong; Wang, Shuanjin; Ren, Shan; Han, Dongmei; Xiao, Min; Meng, Yuezhong
2017-08-01
Electrolytes play a vital role in modulating lithium ion battery performance. An outstanding electrolyte should possess both high ionic conductivity and unity lithium ion transference number. Here, we present a facile method to fabricate a network type sp3 boron-based single-ion conducting polymer electrolyte (SIPE) with high ionic conductivity and lithium ion transference number approaching unity. The SIPE was synthesized by coupling of lithium bis(allylmalonato)borate (LiBAMB) and pentaerythritol tetrakis(2-mercaptoacetate) (PETMP) via one-step photoinitiated in situ thiol-ene click reaction in plasticizers. Influence of kinds and content of plasticizers was investigated and the optimized electrolytes show both outstanding ionic conductivity (1.47 × 10-3 S cm-1 at 25 °C) and high lithium transference number of 0.89. This ionic conductivity is among the highest ionic conductivity exhibited by SIPEs reported to date. Its electrochemical stability window is up to 5.2 V. More importantly, Li/LiFePO4 cells with the prepared single-ion conducting electrolytes as the electrolyte as well as the separator display highly reversible capacity and excellent rate capacity under room temperature. It also demonstrates excellent long-term stability and reliability as it maintains capacity of 124 mA h g-1 at 1 C rate even after 500 cycles without obvious decay.
Chen, Yan-Cong; Liu, Jun-Liang; Wernsdorfer, Wolfgang; Liu, Dan; Chibotaru, Liviu F; Chen, Xiao-Ming; Tong, Ming-Liang
2017-04-24
An extremely rare non-Kramers holmium(III) single-ion magnet (SIM) is reported to be stabilized in the pentagonal-bipyramidal geometry by a phosphine oxide with a high energy barrier of 237(4) cm -1 . The suppression of the quantum tunneling of magnetization (QTM) at zero field and the hyperfine structures originating from field-induced QTMs can be observed even from the field-dependent alternating-current magnetic susceptibility in addition to single-crystal hysteresis loops. These dramatic dynamics were attributed to the combination of the favorable crystal-field environment and the hyperfine interactions arising from 165 Ho (I=7/2) with a natural abundance of 100 %. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Energy Technology Data Exchange (ETDEWEB)
Chen, Yan-Cong; Liu, Jun-Liang; Chen, Xiao-Ming; Tong, Ming-Liang [Key Lab. of Bioinorganic and Synthetic Chemistry of Ministry of Education, School of Chemistry, Sun Yat-Sen Univ., Guangzhou (China); Wernsdorfer, Wolfgang [Institut Neel, CNRS and Universite Joseph Fournier, Grenoble (France); Institute of Nanotechnology, Karlsruhe Institute of Technology (Germany); Physikalisches Institut, Karlsruhe Institute of Technology (Germany); Liu, Dan; Chibotaru, Liviu F. [Theory of Nanomaterials Group and INPAC-Institute of Nanoscale Physics and Chemistry, Katholieke Universiteit Leuven (Belgium)
2017-04-24
An extremely rare non-Kramers holmium(III) single-ion magnet (SIM) is reported to be stabilized in the pentagonal-bipyramidal geometry by a phosphine oxide with a high energy barrier of 237(4) cm{sup -1}. The suppression of the quantum tunneling of magnetization (QTM) at zero field and the hyperfine structures originating from field-induced QTMs can be observed even from the field-dependent alternating-current magnetic susceptibility in addition to single-crystal hysteresis loops. These dramatic dynamics were attributed to the combination of the favorable crystal-field environment and the hyperfine interactions arising from {sup 165}Ho (I=7/2) with a natural abundance of 100 %. (copyright 2017 Wiley-VCH Verlag GmbH and Co. KGaA, Weinheim)
Monte Carlo prediction of crater formation by single ion impact on solid surface
International Nuclear Information System (INIS)
Perez-Martin, A.M.C.; Dominguez-Vazquez, J.; Jimenez-Rodriguez, J.J.; Collins, R.; Gras-Marti, A.
1994-01-01
A method is presented for predicting the topography changes following the impact of one energetic ion on the plane surface of a monatomic amorphous solid. This is done in two stages. The first is a Monte Carlo calculation of the sputter yield and interior distribution relocated atoms, with no compensation for local departures from equilibrium density. In the second stage there is a systematic relaxation of the solid, in which the density returns to its previous constant value and a crater develops in the surface. Two alternative methods of carrying out stage two are compared. In the first the solid is subdivided into cells within which relaxation is carried out normal to the surface, as in previous one-dimensional studies. The second method treats the solid as a 3-dimensional incompressible medium. Both seem to reproduce quite well the main features found experimentally. (orig.)
Pliego, Josefredo R.
2017-07-01
The cluster expansion method has been used in the imperfect gas theory for several decades. This paper proposes a cluster expansion of the solvation free energy difference. This difference, which results from a change in the solute-solvent potential energy, can be written as the logarithm of a finite series. Similar to the Mayer function, the terms in the series are related to configurational integrals, which makes the integrand relevant only for configurations of the solvent molecules close to the solute. In addition, the terms involve interaction of solute with one, two, and so on solvent molecules. The approach could be used for hybrid quantum mechanical and molecular mechanics methods or mixed cluster-continuum approximation. A simple form of the theory was applied for prediction of pKa in methanol; the results indicated that three explicit methanol molecules and the dielectric continuum lead to a root of mean squared error (RMSE) of only 1.3 pKa units, whereas the pure continuum solvation model based on density method leads to a RMSE of 6.6 pKa units.
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...
Chaudhuri, Gouri; Shah, Gaurav A; Dey, Pritam; S, Ganesh; Venu-Babu, P; Thilagaraj, W Richard
2013-01-01
The study was aimed at investigating the potential use of calf intestinal alkaline phosphatase (CIAP) enzyme in the removal of heavy metals (Cd(2+), Ni(2+), Co(2+) and Cr(3+/6+)) from single ion solutions as well as tannery and electroplating effluents. CIAP mediated bioremediation (white biotechnology) is a novel technique that is eco-friendly and cost effective unlike the conventional chemical technologies. Typical reactions containing the enzyme (CIAP) and p-nitrophenyl phosphate (pNPP) as substrate in Tris-HCl buffer (pH 8 and 11) and either single ion metal solutions (250 ppm and 1000 ppm) or effluents from tannery or electroplating industry were incubated at 37°C for 30 min, 60 min and 120 min. The inorganic phosphate (P(i)) generated due to catalytic breakdown of pNPP complexes free metal ions as metal-phosphate and the amount of metal precipitated was derived by estimating the reduction in the free metal ion present in the supernatant of reactions employing atomic absorption spectrophotometer (AAS). Better precipitation of metal was obtained at pH 11 than at pH 8 and between the two concentrations of different metals tested, an initial metal concentration of 250 ppm in the reaction gave more precipitation than with 1000 ppm. Experimental data showed that at pH 11, the percentage of removal of metal ions (for an initial concentration of 250 ppm) was in the following order: Cd(2+) (80.99%) > Ni(2+) (64.78%) > Cr(3+) > (46.15%) > Co(2+) (36.47%) > Cr(6+) (32.33%). The overall removal of Cr(3+) and Cr(6+) from tannery effluent was 32.77% and 37.39% respectively in 120 min at pH 11. Likewise, the overall removal of Cd(2+), Co(2+) and Ni(2+) from electroplating effluent was 50.42%, 13.93% and 38.64% respectively in 120 min at pH 11. The study demonstrates that bioprecipitation by CIAP may be a viable and environmental friendly method for clean-up of heavy metals from tannery and electroplating effluents.
García-Valdivia, Antonio A; Seco, Jose M; Cepeda, Javier; Rodríguez-Diéguez, Antonio
2017-11-20
Detailed structural, magnetic, and photoluminescence (PL) characterization of four new compounds based on 1-methylimidazole-5-carboxylate (mimc) ligand and transition metal ions, namely [Ni(mimc) 2 (H 2 O) 4 ] (1), [Co(μ-mimc) 2 ] n (2), {[Cu 2 (μ-mimc) 4 (H 2 O)]·2H 2 O} n (3), and [Cd(μ-mimc) 2 (H 2 O)] n (4) is reported. The structural diversity found in the family of compounds derives from the coordination versatility of the ligand, which coordinates as a terminal ligand to give a supramolecular network of monomeric entities in 1 or acts as a bridging linker to build isoreticular 2D coordination polymers (CPs) in 2-4. Magnetic direct-current (dc) susceptibility data have been measured for compounds 1-3 to analyze the exchange interactions among paramagnetic centers, which have been indeed supported by calculations based on broken symmetry (BS) and density functional theory (DFT) methodology. The temperature dependence of susceptibility and magnetization data of 2 are indicative of easy-plane anisotropy (D = +12.9 cm -1 , E = +0.5 cm -1 ) that involves a bistable M s = ±1/2 ground state. Alternating-current (ac) susceptibility curves exhibit field-induced single-ion magnet (SIM) behavior that occurs below 14 K, which is characterized by two spin relaxation processes of distinct nature: fast relaxation of single ions proceeding through multiple mechanisms (U eff = 26 K) and a slow relaxation attributed to interactions along the polymeric crystal building. Exhaustive PL analysis of compound 4 in the solid state confirms low-temperature phosphorescent green emission consisting of radiative lifetimes in the range of 0.25-0.43 s, which explains the afterglow observed during about 1 s after the removal of the UV source. Time-dependent DFT and computational calculations to estimate phosphorescent vertical transitions have been also employed to provide an accurate description of the PL performance of this long-lasting phosphor.
Prakrajang, K.; Jeynes, J. C. G.; Merchant, M. J.; Kirkby, K.; Kirkby, N.; Thopan, P.; Yu, L. D.
2013-07-01
As a part of a systematic study on mechanisms involved in physical cancer therapies, this work investigated response of mammalian cells to ultra-low-dose ion beam irradiation. The ion beam irradiation was performed using the recently completed nanobeam facility at the Surrey Ion Beam Centre. A scanning focused vertical ion nano-beam was applied to irradiate Chinese hamster V79 cells. The V79 cells were irradiated in two different beam modes, namely, focused single ion beam and defocused scanning broad ion beam of 3.8-MeV protons. The single ion beam was capable of irradiating a single cell with a precisely controlled number of the ions to extremely low doses. After irradiation and cell incubation, the number of surviving colonies as a function of the number of the irradiating ions was measured for the cell survival fraction curve. A lower survival for the single ion beam irradiation than that of the broad beam case implied the hypersensitivity and bystander effect. The ion-beam-induced cell survival curves were compared with that from 300-kV X-ray irradiation. Theoretical studies indicated that the cell death in single ion irradiation mainly occurred in the cell cycle phases of cell division and intervals between the cell division and the DNA replication. The success in the experiment demonstrated the Surrey vertical nanobeam successfully completed.
Chen, Wei; 飛田, 和男; Sanctuary, Bryan C.
2008-01-01
Original Paper :Critical Properties of Spin-1 Antiferromagnetic Heisenberg Chains with Bond Alternation and Uniaxial Single-Ion-Type AnisotropyWei Chen, Kazuo Hida and Bryan Clifford Sanctuary Journal of the Physical Society of Japan 69 (2000) pp.237-241
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
Energy Technology Data Exchange (ETDEWEB)
Tang, Bing, E-mail: bingtangphy@jsu.edu.cn; Li, Guang-Ling; Fu, Mei
2017-03-15
A semiclassical theoretical study on the property of the modulational instability of corresponding linear spin-waves and the presence of nonlinear localized excitations in a discrete quantum ferromagnetic spin chain with single-ion easy-axis anisotropy is reported. We consider the Glauber coherent-state representation combined with the Dyson-Maleev transformation for local spin operators as the basic representation of the system, and derive the equation of motion by means of the Ehrenfest theorem. Using a modulational instability analysis of plane waves, we predict the existence regions of bright envelope solitons and intrinsic localized spin-wave modes. Besides, with the help of a semidiscrete multi-scale method, we obtain analytical solutions for the bright envelope soliton and intrinsic localized spin-wave mode. Moreover, we analyze their existence conditions, which agree with the results of modulational instability analysis. - Highlights: • The anisotropy plays significant role in both the property of the modulational instability and the existence conditions for localized modes in ferromagnetic chains. • The analytical solutions of localized modes are obtained. • The appearance conditions for such localized modes agree with the modulational instability analysis.
Runt, James; Iacob, Ciprian
2015-03-01
Segmental and local dynamics as well as charge transport are investigated in a series of poly(ethylene oxide)-based single-ion conductors (ionomers) with varying counterions (Li +, Na +) confined in uni-directional nanoporous silica membranes. The dynamics are explored over a wide frequency and temperature range by broadband dielectric relaxation spectroscopy. Slowing of segmental dynamics and a decrease in dc conductivity (strongly coupled with segmental relaxation) of the confined ionomers are associated with surface effects - resulting from interfacial hydrogen bonding between the host nanoporous silica membrane and the guest ionomers. These effects are significantly reduced or eliminated upon pore surface modification through silanization. The primary transport properties for the confined ionomers decrease by about one decade compared to the bulk ionomer. A model assuming reduced mobility of an adsorbed layer at the pore wall/ionomer interface is shown to provide a quantitative explanation for the decrease in effective transport quantities in non-silanized porous silica membranes. Additionally, the effect of confinement on ion aggregation in ionomers by using X-ray scattering will also be discussed. Supported by the National Science Foundation, Polymers Program.
International Nuclear Information System (INIS)
Kamiya, T.; Cholewa, M.; Saint, A.; Prawer, S.; Legge, G.J.; Butler, J.E.; Vestyck, D.J. , Jr.
1997-01-01
The secondary electron emission from a 2 μm thick boron-doped diamond film under ion (4.6 endash 7.7 MeV He + )impact is reported. The yield under ions impact is found to be remarkably high, stable over a period of many months, and independent of which side of the film (i.e., growth or substrate side) is exposed to the ion flux. By taking advantage of the high secondary-electron yield, the passage of each ion through the film could be detected with an efficiency of close to 100%, which to the best of our knowledge is the highest efficiency recorded to date for any thin-film window. This finding has an immediate application in single-ion irradiation systems where a thin vacuum window is required to allow extraction of an ion beam from the vacuum into air and at the same time offer 100% efficiency for the detection of the passage of the ion through the window. copyright 1997 American Institute of Physics
Ungur, Liviu; Le Roy, Jennifer J; Korobkov, Ilia; Murugesu, Muralee; Chibotaru, Liviu F
2014-04-22
Remanence and coercivity are the basic characteristics of permanent magnets. They are also tightly correlated with the existence of long relaxation times of magnetization in a number of molecular complexes, called accordingly single-molecule magnets (SMMs). Up to now, hysteresis loops with large coercive fields have only been observed in polynuclear metal complexes and metal-radical SMMs. On the contrary, mononuclear complexes, called single-ion magnets (SIM), have shown hysteresis loops of butterfly/phonon bottleneck type, with negligible coercivity, and therefore with much shorter relaxation times of magnetization. A mononuclear Er(III) complex is presented with hysteresis loops having large coercive fields, achieving 7000 Oe at T=1.8 K and field variation as slow as 1 h for the entire cycle. The coercivity persists up to about 5 K, while the hysteresis loops persist to 12 K. Our finding shows that SIMs can be as efficient as polynuclear SMMs, thus opening new perspectives for their applications. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Energy Technology Data Exchange (ETDEWEB)
Prakrajang, K. [Plasma and Beam Physics Research Facility, Department of Physics and Materials Science, Faculty of Science, Chiang Mai University, Chiang Mai 50200 (Thailand); Faculty of Science, Maejo University, Chiang Mai 50290 (Thailand); Jeynes, J.C.G.; Merchant, M.J.; Kirkby, K.; Kirkby, N. [Surrey Ion Beam Center, Faculty of Engineering and Physical Science, University of Surrey, Guildford Surrey, GU2 7XH (United Kingdom); Thopan, P. [Plasma and Beam Physics Research Facility, Department of Physics and Materials Science, Faculty of Science, Chiang Mai University, Chiang Mai 50200 (Thailand); Yu, L.D., E-mail: yuld@fnrf.science.cmu.ac.th [Plasma and Beam Physics Research Facility, Department of Physics and Materials Science, Faculty of Science, Chiang Mai University, Chiang Mai 50200 (Thailand); Thailand Center of Excellence in Physics, Commission on Higher Education, 328 Si Ayutthaya Road, Bangkok 10400 (Thailand)
2013-07-15
Highlights: •Recently completed nanobeam at the Surrey Ion Beam Centre was used. •3.8-MeV single and broad proton beams irradiated Chinese hamster cells. •Cell survival curves were measured and compared with 300-kV X-ray irradiation. •Single ion irradiation had a lower survival part at ultra-low dose. •It implies hypersensitivity, bystander effect and cell cycle phase of cell death. -- Abstract: As a part of a systematic study on mechanisms involved in physical cancer therapies, this work investigated response of mammalian cells to ultra-low-dose ion beam irradiation. The ion beam irradiation was performed using the recently completed nanobeam facility at the Surrey Ion Beam Centre. A scanning focused vertical ion nano-beam was applied to irradiate Chinese hamster V79 cells. The V79 cells were irradiated in two different beam modes, namely, focused single ion beam and defocused scanning broad ion beam of 3.8-MeV protons. The single ion beam was capable of irradiating a single cell with a precisely controlled number of the ions to extremely low doses. After irradiation and cell incubation, the number of surviving colonies as a function of the number of the irradiating ions was measured for the cell survival fraction curve. A lower survival for the single ion beam irradiation than that of the broad beam case implied the hypersensitivity and bystander effect. The ion-beam-induced cell survival curves were compared with that from 300-kV X-ray irradiation. Theoretical studies indicated that the cell death in single ion irradiation mainly occurred in the cell cycle phases of cell division and intervals between the cell division and the DNA replication. The success in the experiment demonstrated the Surrey vertical nanobeam successfully completed.
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.
International Nuclear Information System (INIS)
Bobak, Andrej; Dely, Jan; Pokorny, Vladislav
2010-01-01
The effects of both an exchange anisotropy and a single-ion anisotropy on the magnetic susceptibility of the mixed spin-1 and spin- 1/2 Heisenberg model are investigated by the use of an Oguchi approximation. Particular emphasis is given to the simple cubic lattice with coordination number z = 6 for which the magnetic susceptibility is determined numerically. Anomalous behaviour in the thermal variation of the magnetic susceptibility in the low-temperature region is found due to the applied negative single-ion anisotropy field strength. Also, the difference between the behaviours of the magnetic susceptibility of the Heisenberg and Ising models is discussed.
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
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....
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
Energy Technology Data Exchange (ETDEWEB)
Sun, Xiao-Guang; Kerr, John B.
2004-07-11
Network single ion conductors (NSICs) based on comb-branch polyepoxide ethers and lithium bis(allylmalonato) borate have been synthesized and thoroughly characterized by means of ionic conductivity measurements, electrochemical impedance and by dynamic mechanical analysis (DMA). The materials have been tested as battery electrolytes by cycling in symmetrical Li/Li half cells and in Li/V{sub 6}O{sub 13} full cells in which the NSIC was used as both binder and electrolyte in the cathode electrode and as the electrolyte separator membrane,. The substitution of the trimethylene oxide (TMO) unit into the side chains in place of ethylene oxide (EO) units increased the polymerion mobility (lower glass transition temperature). However, the ionic conductivity was nearly one and half orders of magnitude lower than the corresponding pure EO based single ion conductor at the same salt concentration. This effect may be ascribed to the lower dielectric constant of the TMO side chains that result in a lower concentration of free conducting lithium cations. For a highly cross-linked system (EO/Li=20), only 47 wt% plasticizing solvent (ethylene carbonate (EC)/ethyl methyl carbonate (EMC), 1/1 by wt) could be taken up and the ionic conductivity was only increased by one order of magnitude over the dry polyelectrolyte while for a less densely crosslinked system (EO/Li=80), up to 75 wt% plasticizer could be taken up and the ionic conductivity was increased by nearly two orders of magnitude. A Li/Li symmetric cell that was cycled at 85 C at a current density of 25{micro}Acm{sup -2} showed no concentration polarization or diffusional relaxation, consistent with a lithium ion transference number of one. However, both the bulk and interfacial impedances increased after 20 cycles, apparently due to continued cross-linking reactions within the membrane and on the surface of the lithium electrodes. A Li/V{sub 6}O{sub 13} full cell constructed using a single ion conductor gel (propylene
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...
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.
International Nuclear Information System (INIS)
Bobak, A.; Dely, J.
2007-01-01
The effect of a single-ion anisotropy on the phase diagram of the mixed spin-32 and spin-2 Ising system is investigated by the use of a mean-field theory based on the Bogoliubov inequality for the free energy. Topologically different kinds of phase diagrams are achieved by changing values of the parameter in the model Hamiltonian. Besides second-order transitions, lines of first-order transitions terminating either at a tricritical point or an isolated critical point, are found
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.
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.
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
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
Quasichemical analysis of the cluster-pair approximation for the thermodynamics of proton hydration
Energy Technology Data Exchange (ETDEWEB)
Pollard, Travis [Department of Chemistry, University of Cincinnati, Cincinnati, Ohio 45221 (United States); Beck, Thomas L. [Department of Chemistry, University of Cincinnati, Cincinnati, Ohio 45221 (United States); Department of Physics, University of Cincinnati, Cincinnati, Ohio 45221 (United States)
2014-06-14
A theoretical analysis of the cluster-pair approximation (CPA) is presented based on the quasichemical theory of solutions. The sought single-ion hydration free energy of the proton includes an interfacial potential contribution by definition. It is shown, however, that the CPA involves an extra-thermodynamic assumption that does not guarantee uniform convergence to a bulk free energy value with increasing cluster size. A numerical test of the CPA is performed using the classical polarizable AMOEBA force field and supporting quantum chemical calculations. The enthalpy and free energy differences are computed for the kosmotropic Na{sup +}/F{sup −} ion pair in water clusters of size n = 5, 25, 105. Additional calculations are performed for the chaotropic Rb{sup +}/I{sup −} ion pair. A small shift in the proton hydration free energy and a larger shift in the hydration enthalpy, relative to the CPA values, are predicted based on the n = 105 simulations. The shifts arise from a combination of sequential hydration and interfacial potential effects. The AMOEBA and quantum chemical results suggest an electrochemical surface potential of water in the range −0.4 to −0.5 V. The physical content of single-ion free energies and implications for ion-water force field development are also discussed.
Brambleby, Jamie; Manson, Jamie L.; Goddard, Paul A.; Stone, Matthew B.; Johnson, Roger D.; Manuel, Pascal; Villa, Jacqueline A.; Brown, Craig M.; Lu, Helen; Chikara, Shalinee; Zapf, Vivien; Lapidus, Saul H.; Scatena, Rebecca; Macchi, Piero; Chen, Yu-sheng; Wu, Lai-Chin; Singleton, John
2017-04-01
The magnetic ground state of the quasi-one-dimensional spin-1 antiferromagnetic chain is sensitive to the relative sizes of the single-ion anisotropy (D ) and the intrachain (J ) and interchain (J') exchange interactions. The ratios D /J and J'/J dictate the material's placement in one of three competing phases: a Haldane gapped phase, a quantum paramagnet, and an X Y -ordered state, with a quantum critical point at their junction. We have identified [Ni (HF2) (pyz) 2] SbF6 , where pyz = pyrazine, as a rare candidate in which this behavior can be explored in detail. Combining neutron scattering (elastic and inelastic) in applied magnetic fields of up to 10 tesla and magnetization measurements in fields of up to 60 tesla with numerical modeling of experimental observables, we are able to obtain accurate values of all of the parameters of the Hamiltonian [D =13.3 (1 ) K, J =10.4 (3 ) K, and J'=1.4 (2 ) K], despite the polycrystalline nature of the sample. Density-functional theory calculations result in similar couplings (J =9.2 K, J'=1.8 K) and predict that the majority of the total spin population resides on the Ni(II) ion, while the remaining spin density is delocalized over both ligand types. The general procedures outlined in this paper permit phase boundaries and quantum-critical points to be explored in anisotropic systems for which single crystals are as yet unavailable.
Hamid, Arian Zad
2016-12-01
We analytically investigate Multiple Quantum (MQ) NMR dynamics in a mixed-three-spin (1/2,1,1/2) system with XXX Heisenberg model at the front of an external homogeneous magnetic field B. A single-ion anisotropy property ζ is considered for the spin-1. The intensities dependence of MQ NMR coherences on their orders (zeroth and second orders) for two pairs of spins (1,1/2) and (1/2,1/2) of the favorite tripartite system are obtained. It is also investigated dynamics of the pairwise quantum entanglement for the bipartite (sub)systems (1,1/2) and (1/2,1/2) permanently coupled by, respectively, coupling constants J}1 and J}2, by means of concurrence and fidelity. Then, some straightforward comparisons are done between these quantities and the intensities of MQ NMR coherences and ultimately some interesting results are reported. We also show that the time evolution of MQ coherences based on the reduced density matrix of the pair spins (1,1/2) is closely connected with the dynamics of the pairwise entanglement. Finally, we prove that one can introduce MQ coherence of the zeroth order corresponds to the pair spins (1,1/2) as an entanglement witness at some special time intervals.
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.
Carvalho, Nathalia F; Pliego, Josefredo R
2015-10-28
Absolute single-ion solvation free energy is a very useful property for understanding solution phase chemistry. The real solvation free energy of an ion depends on its interaction with the solvent molecules and on the net potential inside the solute cavity. The tetraphenyl arsonium-tetraphenyl borate (TATB) assumption as well as the cluster-continuum quasichemical theory (CC-QCT) approach for Li(+) solvation allows access to a solvation scale excluding the net potential. We have determined this free energy scale investigating the solvation of the lithium ion in water (H2O), acetonitrile (CH3CN) and dimethyl sulfoxide (DMSO) solvents via the CC-QCT approach. Our calculations at the MP2 and MP4 levels with basis sets up to the QZVPP+diff quality, and including solvation of the clusters and solvent molecules by the dielectric continuum SMD method, predict the solvation free energy of Li(+) as -116.1, -120.6 and -123.6 kcal mol(-1) in H2O, CH3CN and DMSO solvents, respectively (1 mol L(-1) standard state). These values are compatible with the solvation free energy of the proton of -253.4, -253.2 and -261.1 kcal mol(-1) in H2O, CH3CN and DMSO solvents, respectively. Deviations from the experimental TATB scale are only 1.3 kcal mol(-1) in H2O and 1.8 kcal mol(-1) in DMSO solvents. However, in the case of CH3CN, the deviation reaches a value of 9.2 kcal mol(-1). The present study suggests that the experimental TATB scale is inconsistent for CH3CN. A total of 125 values of the solvation free energy of ions in these three solvents were obtained. These new data should be useful for the development of theoretical solvation models.
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
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.
Wilson, A.; Lawrence, J.; Yang, E.-C.; Nakano, M.; Hendrickson, D. N.; Hill, S.
2006-10-01
Electron paramagnetic resonance (EPR) studies of a Ni4 single-molecule magnet (SMM) yield the zero-field-splitting (ZFS) parameters D , B40 , and B44 , based on the giant spin approximation (GSA) with S=4 ; B44 is responsible for the magnetization tunneling in this SMM. Experiments on an isostructural Ni-doped Zn4 crystal establish the NiII ion ZFS parameters. The fourth-order ZFS parameters in the GSA arise from the interplay between the Heisenberg interaction Jŝ1•ŝ2 and the second-order single-ion anisotropy, giving rise to mixing of higher-lying S≠4 states into the S=4 state. Consequently, J directly influences the ZFS in the ground state, enabling its determination by EPR.
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)
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
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.
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)
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.
Understanding Legacy Features with Featureous
DEFF Research Database (Denmark)
Olszak, Andrzej; Jørgensen, Bo Nørregaard
2011-01-01
Feature-centric comprehension of source code is essential during software evolution. However, such comprehension is oftentimes difficult to achieve due the discrepancies between structural and functional units of object-oriented programs. We present a tool for feature-centric analysis of legacy...
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...
U.S. Environmental Protection Agency — This dataset consists of various site features from multiple Superfund sites in U.S. EPA Region 8. These data were acquired from multiple sources at different times...
CERN. Geneva
2015-01-01
Feature selection and reduction are key to robust multivariate analyses. In this talk I will focus on pros and cons of various variable selection methods and focus on those that are most relevant in the context of HEP.
National Oceanic and Atmospheric Administration, Department of Commerce — Collection includes a variety of solar feature datasets contributed by a number of national and private solar observatories located worldwide.
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.
Approximate Method for Solving the Linear Fuzzy Delay Differential Equations
Directory of Open Access Journals (Sweden)
S. Narayanamoorthy
2015-01-01
Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.
Discussion of CoSA: Clustering of Sparse Approximations
Energy Technology Data Exchange (ETDEWEB)
Armstrong, Derek Elswick [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-03-07
The purpose of this talk is to discuss the possible applications of CoSA (Clustering of Sparse Approximations) to the exploitation of HSI (HyperSpectral Imagery) data. CoSA is presented by Moody et al. in the Journal of Applied Remote Sensing (“Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries”, Vol. 8, 2014) and is based on machine learning techniques.
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.
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
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...
Cost versus precision for approximate typing for Python
Fritz, Levin; Hage, J.
2017-01-01
In this paper we describe a variation of monotone frameworks that enables us to perform approximate typing of Python, in particular for dealing with some of its more dynamic features such as first-class functions and Python's dynamic class system. We additionally introduce a substantial number of
Cost versus Precision for Approximate Typing for Python
Fritz, Levin; Hage, J
2014-01-01
In this paper we describe a variation of monotone frameworks that enables us to perform approximate typing of Python, in particular for dealing with some of its more dynamic features such as first-class functions and Python’s dynamic class system. We additionally introduce a substantial number of
The dilute random field Ising model by finite cluster approximation
International Nuclear Information System (INIS)
Benyoussef, A.; Saber, M.
1987-09-01
Using the finite cluster approximation, phase diagrams of bond and site diluted three-dimensional simple cubic Ising models with a random field have been determined. The resulting phase diagrams have the same general features for both bond and site dilution. (author). 7 refs, 4 figs
Reif, Maria M.; Hünenberger, Philippe H.
2011-04-01
The raw single-ion solvation free energies computed from atomistic (explicit-solvent) simulations are extremely sensitive to the boundary conditions and treatment of electrostatic interactions used during these simulations. However, as shown recently [M. A. Kastenholz and P. H. Hünenberger, J. Chem. Phys. 124, 224501 (2006), 10.1529/biophysj.106.083667; M. M. Reif and P. H. Hünenberger, J. Chem. Phys. 134, 144103 (2010)], the application of appropriate correction terms permits to obtain methodology-independent results. The corrected values are then exclusively characteristic of the underlying molecular model including in particular the ion-solvent van der Waals interaction parameters, determining the effective ion size and the magnitude of its dispersion interactions. In the present study, the comparison of calculated (corrected) hydration free energies with experimental data (along with the consideration of ionic polarizabilities) is used to calibrate new sets of ion-solvent van der Waals (Lennard-Jones) interaction parameters for the alkali (Li+, Na+, K+, Rb+, Cs+) and halide (F-, Cl-, Br-, I-) ions along with either the SPC or the SPC/E water models. The experimental dataset is defined by conventional single-ion hydration free energies [Tissandier et al., J. Phys. Chem. A 102, 7787 (1998), 10.1021/jp982638r; Fawcett, J. Phys. Chem. B 103, 11181] along with three plausible choices for the (experimentally elusive) value of the absolute (intrinsic) hydration free energy of the proton, namely, Δ G_hyd^{ominus }[H+] = -1100, -1075 or -1050 kJ mol-1, resulting in three sets L, M, and H for the SPC water model and three sets LE, ME, and HE for the SPC/E water model (alternative sets can easily be interpolated to intermediate Δ G_hyd^{ominus }[H+] values). The residual sensitivity of the calculated (corrected) hydration free energies on the volume-pressure boundary conditions and on the effective ionic radius entering into the calculation of the correction terms is
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 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
Directory of Open Access Journals (Sweden)
Elizabeth Ritter
2015-01-01
Full Text Available Algonquian languages are famous for their animacy-based grammatical properties—an animacy based noun classification system and direct/inverse system which gives rise to animacy hierarchy effects in the determination of verb agreement. In this paper I provide new evidence for the proposal that the distinctive properties of these languages is due to the use of participant-based features, rather than spatio-temporal ones, for both nominal and verbal functional categories (Ritter & Wiltschko 2009, 2014. Building on Wiltschko (2012, I develop a formal treatment of the Blackfoot aspectual system that assumes a category Inner Aspect (cf. MacDonald 2008, Travis 1991, 2010. Focusing on lexical aspect in Blackfoot, I demonstrate that the classification of both nouns (Seinsarten and verbs (Aktionsarten is based on animacy, rather than boundedness, resulting in a strikingly different aspectual system for both categories.
On the approximation of crack shapes found during inservice inspection
Energy Technology Data Exchange (ETDEWEB)
Bhate, S.R.; Chawla, D.S.; Kushwaha, H.S. [Bhabha Atomic Research Centre, Bombay (India)] [and others
1997-04-01
This paper addresses the characterization of axial internal flaw found during inservice inspection of a pipe. J-integral distribution for various flaw shapes is obtained using line spring finite, element method. The peak J-value and its distribution across the crack is found to be characteristic feature of each shape. The triangular shape yields peak J-value away from the center, the point of depth. The elliptic approximation results in large overestimate of J-value for unsymmetric flaws. Triangular approximation is recommended for such flaws so that further service can be obtained from the component.
On the approximation of crack shapes found during inservice inspection
International Nuclear Information System (INIS)
Bhate, S.R.; Chawla, D.S.; Kushwaha, H.S.
1997-01-01
This paper addresses the characterization of axial internal flaw found during inservice inspection of a pipe. J-integral distribution for various flaw shapes is obtained using line spring finite, element method. The peak J-value and its distribution across the crack is found to be characteristic feature of each shape. The triangular shape yields peak J-value away from the center, the point of depth. The elliptic approximation results in large overestimate of J-value for unsymmetric flaws. Triangular approximation is recommended for such flaws so that further service can be obtained from the component
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...
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.
Improved stochastic approximation methods for discretized parabolic partial differential equations
Guiaş, Flavius
2016-12-01
We present improvements of the stochastic direct simulation method, a known numerical scheme based on Markov jump processes which is used for approximating solutions of ordinary differential equations. This scheme is suited especially for spatial discretizations of evolution partial differential equations (PDEs). By exploiting the full path simulation of the stochastic method, we use this first approximation as a predictor and construct improved approximations by Picard iterations, Runge-Kutta steps, or a combination. This has as consequence an increased order of convergence. We illustrate the features of the improved method at a standard benchmark problem, a reaction-diffusion equation modeling a combustion process in one space dimension (1D) and two space dimensions (2D).
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.
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
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.
Approximate Boundaries for West Lake Landfill, Missouri, 2014, EPA REG 07
U.S. Environmental Protection Agency — This ESRI File Geodatabase Feature Class contains polygons for GIS depicting the approximate boundaries for West Lake Landfill (MOD079900932), Missouri, 2014, EPA...
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.
A class of difference schemes with flexible local approximation
International Nuclear Information System (INIS)
Tsukerman, Igor
2006-01-01
Solutions of many physical problems have salient local features that are qualitatively known a priori (for example, singularities at point sources, edge and corners; boundary layers; derivative jumps at material interfaces; strong dipole field components near polarized spherical particles; cusps of electronic wavefunctions at the nuclei; electrostatic double layers around colloidal particles, etc.) The known methods capable of providing flexible local approximation of such features include the generalized finite element - partition of unity method, special variational-difference schemes in broken Sobolev spaces, and a few other specialized techniques. In the proposed new class of Flexible Local Approximation MEthods (FLAME), a desirable set of local approximating functions (such as cylindrical or spherical harmonics, plane waves, harmonic polynomials, etc.) defines a finite difference scheme on a chosen grid stencil. One motivation is to minimize the notorious 'staircase' effect at curved and slanted interface boundaries. However, the new approach has much broader applications. As illustrative examples, the paper presents arbitrarily high order 3-point schemes for the 1D Schroedinger equation and a 1D singular equation, schemes for electrostatic interactions of colloidal particles, electromagnetic wave propagation and scattering, plasmon resonances. Moreover, many classical finite difference schemes, including the Collatz 'Mehrstellen' schemes, are direct particular cases of FLAME
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.
Directory of Open Access Journals (Sweden)
Dong Shao
2017-12-01
Full Text Available We herein reported the syntheses, crystal structures, and magnetic properties of a two-dimensional coordination polymer {[CoII(TPT2/3(H2O4][CH3COO]2·(H2O4}n (1 and a chain compound {[CoII(TPT2(CHOO2(H2O2]}n (2 based on the 2,4,6-Tris(4-pyridyl-1,3,5-triazine (TPT ligand. Structure analyses showed that complex 1 had a cationic hexagonal framework structure, while 2 was a neutral zig-zag chain structure with different distorted octahedral coordination environments. Magnetic measurements revealed that both complexes exhibit large easy-plane magnetic anisotropy with the zero-field splitting parameter D = 47.7 and 62.1 cm−1 for 1 and 2, respectively. This magnetic anisotropy leads to the field-induced slow magnetic relaxation behaviour. However, their magnetic dynamics are quite different; while complex 1 experienced a dominating thermally activated Orbach relaxation at the whole measured temperature region, 2 exhibited multiple relaxation pathways involving direct, Raman, and quantum tunneling (QTM processes at low temperatures and Orbach relaxation at high temperatures. The present complexes enlarge the family of framework-based single-ion magnets (SIMs and highlight the significance of the structural dimensionality to the final magnetic properties.
Significant Inter-Test Reliability Across Approximate Number System Assessments
Directory of Open Access Journals (Sweden)
Nicholas Kurshan Dewind
2016-03-01
Full Text Available The approximate number system (ANS is the hypothesized cognitive mechanism that allows adults, infants, and animals to enumerate large sets of items approximately. Researchers usually assess the ANS by having subjects compare two sets and indicate which is larger. Accuracy or Weber fraction is taken as an index of the acuity of the system. However, as Clayton et al., (2015 have highlighted, the stimulus parameters used when assessing the ANS vary widely. In particular, the numerical ratio between the pairs, and the way in which non-numerical features are varied often differ radically between studies. Recently, Clayton et al. (2015 found that accuracy measures derived from two commonly used stimulus sets are not significantly correlated. They argue that a lack of inter-test reliability threatens the validity of the ANS construct. Here we apply a recently developed modeling technique to the same data set. The model, by explicitly accounting for the effect of numerical ratio and non-numerical features, produces dependent measures that are less perturbed by stimulus protocol. Contrary to their conclusion we find a significant correlation in Weber fraction across the two stimulus sets. Nevertheless, in agreement with Clayton et al., we find that different protocols do indeed induce differences in numerical acuity and the degree of influence of non-numerical stimulus features. These findings highlight the need for a systematic investigation of how protocol idiosyncrasies affect ANS assessments.
Significant Inter-Test Reliability across Approximate Number System Assessments.
DeWind, Nicholas K; Brannon, Elizabeth M
2016-01-01
The approximate number system (ANS) is the hypothesized cognitive mechanism that allows adults, infants, and animals to enumerate large sets of items approximately. Researchers usually assess the ANS by having subjects compare two sets and indicate which is larger. Accuracy or Weber fraction is taken as an index of the acuity of the system. However, as Clayton et al. (2015) have highlighted, the stimulus parameters used when assessing the ANS vary widely. In particular, the numerical ratio between the pairs, and the way in which non-numerical features are varied often differ radically between studies. Recently, Clayton et al. (2015) found that accuracy measures derived from two commonly used stimulus sets are not significantly correlated. They argue that a lack of inter-test reliability threatens the validity of the ANS construct. Here we apply a recently developed modeling technique to the same data set. The model, by explicitly accounting for the effect of numerical ratio and non-numerical features, produces dependent measures that are less perturbed by stimulus protocol. Contrary to their conclusion we find a significant correlation in Weber fraction across the two stimulus sets. Nevertheless, in agreement with Clayton et al. (2015) we find that different protocols do indeed induce differences in numerical acuity and the degree of influence of non-numerical stimulus features. These findings highlight the need for a systematic investigation of how protocol idiosyncrasies affect ANS assessments.
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...
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
Online feature selection with streaming features.
Wu, Xindong; Yu, Kui; Ding, Wei; Wang, Hao; Zhu, Xingquan
2013-05-01
We propose a new online feature selection framework for applications with streaming features where the knowledge of the full feature space is unknown in advance. We define streaming features as features that flow in one by one over time whereas the number of training examples remains fixed. This is in contrast with traditional online learning methods that only deal with sequentially added observations, with little attention being paid to streaming features. The critical challenges for Online Streaming Feature Selection (OSFS) include 1) the continuous growth of feature volumes over time, 2) a large feature space, possibly of unknown or infinite size, and 3) the unavailability of the entire feature set before learning starts. In the paper, we present a novel Online Streaming Feature Selection method to select strongly relevant and nonredundant features on the fly. An efficient Fast-OSFS algorithm is proposed to improve feature selection performance. The proposed algorithms are evaluated extensively on high-dimensional datasets and also with a real-world case study on impact crater detection. Experimental results demonstrate that the algorithms achieve better compactness and higher prediction accuracy than existing streaming feature selection algorithms.
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.
Single-ion nonlinear mechanical oscillator
International Nuclear Information System (INIS)
Akerman, N.; Kotler, S.; Glickman, Y.; Dallal, Y.; Keselman, A.; Ozeri, R.
2010-01-01
We study the steady-state motion of a single trapped ion oscillator driven to the nonlinear regime. Damping is achieved via Doppler laser cooling. The ion motion is found to be well described by the Duffing oscillator model with an additional nonlinear damping term. We demonstrate here the unique ability of tuning both the linear as well as the nonlinear damping coefficients by controlling the laser-cooling parameters. Our observations pave the way for the investigation of nonlinear dynamics on the quantum-to-classical interface as well as mechanical noise squeezing in laser-cooling dynamics.
5th International Conference on Algorithms for Approximation
Levesley, Jeremy
2007-01-01
Approximation methods are vital in many challenging applications of computational science and engineering. This is a collection of papers from world experts in a broad variety of relevant applications, including pattern recognition, machine learning, multiscale modelling of fluid flow, metrology, geometric modelling, tomography, signal and image processing. It documents recent theoretical developments which have lead to new trends in approximation, it gives important computational aspects and multidisciplinary applications, thus making it a perfect fit for graduate students and researchers in science and engineering who wish to understand and develop numerical algorithms for the solution of their specific problems. An important feature of the book is that it brings together modern methods from statistics, mathematical modelling and numerical simulation for the solution of relevant problems, with a wide range of inherent scales. Contributions of industrial mathematicians, including representatives from Microso...
Diffusive Wave Approximation to the Shallow Water Equations: Computational Approach
Collier, Nathan
2011-05-14
We discuss the use of time adaptivity applied to the one dimensional diffusive wave approximation to the shallow water equations. A simple and computationally economical error estimator is discussed which enables time-step size adaptivity. This robust adaptive time discretization corrects the initial time step size to achieve a user specified bound on the discretization error and allows time step size variations of several orders of magnitude. In particular, in the one dimensional results presented in this work feature a change of four orders of magnitudes for the time step over the entire simulation.
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
DEFF Research Database (Denmark)
Brody, Joshua Eric; Liang, Hongyu; Sun, Xiaoming
2012-01-01
The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer vision...... to computer vision [13] and can be seen as a special case of computing EMD on a discretized grid. We achieve a (1 ±ε) approximation for EMD in $\\tilde O(\\varepsilon^{-3})$ space, for every 0
Identifying significant environmental features using feature recognition.
2015-10-01
The Department of Environmental Analysis at the Kentucky Transportation Cabinet has expressed an interest in feature-recognition capability because it may help analysts identify environmentally sensitive features in the landscape, : including those r...
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
'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 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.
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)
Solvation energy of metallocenes pilot ions: Beyond the Born approximation
International Nuclear Information System (INIS)
Krishtalik, Lev I.
2008-01-01
Determination of the single-ion transfer energies demands for some extrathermodynamic assumption on the solvation energy of the pilot ion. Here, the factors affecting solvation energies of the metallocenes pilot ions are explored. The dielectric response energies for these ions in several organic solvents obey the predictions of the local continuum electrostatics. The dielectric response of water reveals to be anomalously large due to the effect of dipoles' correlation caused by hydrogen bonds. The effect of this nonlocal response has been estimated from the data on redox potentials in aqueous-organic solvents as equal to ∼0.09-0.10 eV. The second reason for deviation of solvation energy from the simple picture of continuum electrostatics lies in the preferable orientation of water molecules with H atoms towards the neutral solute creating a positive intraphase potential. The determination of this potential based on experimental data has been done. Its value for ferrocene in water is estimated as ∼+0.1 V. This figure is in accordance with the value which one could expect from the MD simulations in the framework of the polarizable force field model. The list of the single-ion transfer energies based on the improved ferrocene-ferricenium standard is given
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.
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.
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...
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.
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.
Liu, Qiang; Van Mieghem, Piet
2017-04-01
One of the most important quantities of the exact Markovian SIS epidemic process is the time-dependent prevalence, which is the average fraction of infected nodes. Unfortunately, the Markovian SIS epidemic model features an exponentially increasing computational complexity with growing network size N. In this paper, we evaluate a recently proposed analytic approximate prevalence function introduced in Van Mieghem (2016). We compare the approximate function with the N-Intertwined Mean-Field Approximation (NIMFA) and with simulation of the Markovian SIS epidemic process. The results show that the new analytic prevalence function is comparable with other approximate methods.
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.
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.
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.
Families of FPGA-Based Accelerators for Approximate String Matching.
Van Court, Tom; Herbordt, Martin C
2007-03-05
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many implementations have reported impressive speed-ups, but have typically been point solutions - highly specialized and addressing only one or a few of the many possible options. The problem to be solved is creating a hardware description that implements a broad range of behavioral options without losing efficiency due to feature bloat. We report a set of three component types that address different parts of the approximate string matching problem. This allows each application to choose the feature set required, then make maximum use of the FPGA fabric according to that application's specific resource requirements. Multiple, interchangeable implementations are available for each component type. We show that these methods allow the efficient generation of a large, if not complete, family of accelerators for this application. This flexibility was obtained while retaining high performance: We have evaluated a sample against serial reference codes and found speed-ups of from 150× to 400× over a high-end PC.
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.
Pade approximants, NN scattering, and hard core repulsions
International Nuclear Information System (INIS)
Hartt, K.
1980-01-01
Pade approximants to the scattering function F=k cot(delta 0 ) are studied in terms of the variable x=k 2 , using four examples of potential models which possess features of the np 1 S 0 state. Strategies are thereby developed for analytically continuing F when only approximate partial knowledge of F is available. Results are characterized by high accuracy of interpolation. It is suggested that a physically realistic inverse scattering problem begins with such an analytically continued F. When it exists, the solution of this problem in terms of the Marchenko equation is a local potential of the Bargmann type. Some strategies for carrying out this program lead to a stably defined potential, while others do not. With hard core repulsions present, low-order Pade approximants accurately describe F for E/sub c.m./< or =300 MeV. However, since the condition Δ(infinity)-delta(0)=0 is not satisfied in any of our examples containing hard core repulsions, the Marchenko method does not have a solution for them. A possible physical consequence of this result is discussed. Another inverse scattering method is proposed for application to hard core problems
Feature curve extraction from point clouds via developable strip intersection
Directory of Open Access Journals (Sweden)
Kai Wah Lee
2016-04-01
Full Text Available In this paper, we study the problem of computing smooth feature curves from CAD type point clouds models. The proposed method reconstructs feature curves from the intersections of developable strip pairs which approximate the regions along both sides of the features. The generation of developable surfaces is based on a linear approximation of the given point cloud through a variational shape approximation approach. A line segment sequencing algorithm is proposed for collecting feature line segments into different feature sequences as well as sequential groups of data points. A developable surface approximation procedure is employed to refine incident approximation planes of data points into developable strips. Some experimental results are included to demonstrate the performance of the proposed method.
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
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.)
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.
Understanding operational risk capital approximations: First and second orders
Directory of Open Access Journals (Sweden)
Gareth W. Peters
2013-07-01
Full Text Available We set the context for capital approximation within the framework of the Basel II / III regulatory capital accords. This is particularly topical as the Basel III accord is shortly due to take effect. In this regard, we provide a summary of the role of capital adequacy in the new accord, highlighting along the way the significant loss events that have been attributed to the Operational Risk class that was introduced in the Basel II and III accords. Then we provide a semi-tutorial discussion on the modelling aspects of capital estimation under a Loss Distributional Approach (LDA. Our emphasis is to focuss on the important loss processes with regard to those that contribute most to capital, the so called “high consequence, low frequency" loss processes. This leads us to provide a tutorial overview of heavy tailed loss process modelling in OpRisk under Basel III, with discussion on the implications of such tail assumptions for the severity model in an LDA structure. This provides practitioners with a clear understanding of the features that they may wish to consider when developing OpRisk severity models in practice. From this discussion on heavy tailed severity models, we then develop an understanding of the impact such models have on the right tail asymptotics of the compound loss process and we provide detailed presentation of what are known as first and second order tail approximations for the resulting heavy tailed loss process. From this we develop a tutorial on three key families of risk measures and their equivalent second order asymptotic approximations: Value-at-Risk (Basel III industry standard; Expected Shortfall (ES and the Spectral Risk Measure. These then form the capital approximations. We then provide a few example case studies to illustrate the accuracy of these asymptotic captial approximations, the rate of the convergence of the assymptotic result as a function of the LDA frequency and severity model parameters, the sensitivity
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
The virtual environment student. An initial approximation
Federico Borges Sáiz
2007-01-01
The quote at the start of the "Introduction" ("Education follows an agricultural timetable, has an industrial structure and operation and is set in an increasingly digitalised society") illustrates the need for an in-depth understanding of training in virtual environments. This understanding rests on knowing its central element: the student.This article invites the reader to take a look at the figure and the performance of the virtual environment student. One of the features of the twenty-fir...
Unsupervised Feature Subset Selection
DEFF Research Database (Denmark)
Søndberg-Madsen, Nicolaj; Thomsen, C.; Pena, Jose
2003-01-01
This paper studies filter and hybrid filter-wrapper feature subset selection for unsupervised learning (data clustering). We constrain the search for the best feature subset by scoring the dependence of every feature on the rest of the features, conjecturing that these scores discriminate some...... irrelevant features. We report experimental results on artificial and real data for unsupervised learning of naive Bayes models. Both the filter and hybrid approaches perform satisfactorily....
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)
Feature-level domain adaptation
DEFF Research Database (Denmark)
Kouw, Wouter M.; Van Der Maaten, Laurens J P; Krijthe, Jesse H.
2016-01-01
Domain adaptation is the supervised learning setting in which the training and test data are sampled from different distributions: training data is sampled from a source domain, whilst test data is sampled from a target domain. This paper proposes and studies an approach, called feature......-level domain adaptation (flda), that models the dependence between the two domains by means of a feature-level transfer model that is trained to describe the transfer from source to target domain. Subsequently, we train a domain-adapted classifier by minimizing the expected loss under the resulting transfer...... model. For linear classifiers and a large family of loss functions and transfer models, this expected loss can be computed or approximated analytically, and minimized efficiently. Our empirical evaluation of flda focuses on problems comprising binary and count data in which the transfer can be naturally...
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
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...
Mathematics of epidemics on networks from exact to approximate models
Kiss, István Z; Simon, Péter L
2017-01-01
This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to each other with special focus on epidemic spread on networks. The content of the book is at the interface of graph theory, stochastic processes and dynamical systems. The authors set out to make a significant contribution to closing the gap between model development and the supporting mathematics. This is done by: Summarising and presenting the state-of-the-art in modeling epidemics on networks with results and readily usable models signposted throughout the book; Presenting different mathematical approaches to formulate exact and solvable models; Identifying the concrete links between approximate models and their rigorous mathematical representation; Presenting a model hierarchy and clearly highlighting the links between model assumptions and model complexity; Providing a reference source for advanced undergraduate...
Progress in nuclear structure beyond the mean-field approximation
International Nuclear Information System (INIS)
Colò, G; Bortignon, P F; Brenna, M; Roca-Maza, X; Vigezzi, E; Moghrabi, K; Grasso, M; Mizuyama, K
2014-01-01
Although self-consistent mean-field methods, or implementations of the density functional theory for atomic nuclei, are becoming increasingly accurate, some observables are not well reproduced by those models. In particular, the fragmentation and the decay properties of both single-particle and vibrational states cannot be accounted for. Models based on the introduction of further correlations or, in other words, that go beyond the mean-field approximation, have often been discussed in the past. We have recently developed a consistent model based on the use of a Skyrme-type force without the intervention of any other ad hoc parameter. A few typical results are discussed, after we have mentioned briefly the essential features of the model. Moreover, we discuss the necessity of fitting a new force within this context, the difficulties arising because of divergences that need to be renormalized, and our roadmap for curing these divergences
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....
Robust surface registration using N-points approximate congruent sets
Directory of Open Access Journals (Sweden)
Yao Jian
2011-01-01
Full Text Available Abstract Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration approach to automatically align two scans by finding two sets of N-points, that are approximately congruent under rigid transformation and leading to a good estimate of the transformation between their corresponding point clouds. Given two scans, our algorithm randomly searches for the best sets of congruent groups of points using a RANSAC-based approach. To successfully and reliably align two scans when there is only a small overlap, we improve the basic RANSAC random selection step by employing a weight function that approximates the probability of each pair of points in one scan to match one pair in the other. The search time to find pairs of congruent sets of N-points is greatly reduced by employing a fast search codebook based on both binary and multi-dimensional lookup tables. Moreover, we introduce a novel indicator of the overlapping region quality which is used to verify the estimated rigid transformation and to improve the alignment robustness. Our framework is general enough to incorporate and efficiently combine different point descriptors derived from geometric and texture-based feature points or scene geometrical characteristics. We also present a method to improve the matching effectiveness of texture feature descriptors by extracting them from an atlas of rectified images recovered from the scan reflectance image. Our algorithm is robust with respect to different sampling densities and also resilient to noise and outliers. We demonstrate its robustness and efficiency on several challenging scan datasets with varying degree of noise, outliers, extent of overlap, acquired from indoor and outdoor scenarios.
Squeakr: an exact and approximate k-mer counting system.
Pandey, Prashant; Bender, Michael A; Johnson, Rob; Patro, Rob; Berger, Bonnie
2018-02-15
k-mer-based algorithms have become increasingly popular in the processing of high-throughput sequencing data. These algorithms span the gamut of the analysis pipeline from k-mer counting (e.g. for estimating assembly parameters), to error correction, genome and transcriptome assembly, and even transcript quantification. Yet, these tasks often use very different k-mer representations and data structures. In this article, we show how to build a k-mer-counting and multiset-representation system using the counting quotient filter, a feature-rich approximate membership query data structure. We introduce the k-mer-counting/querying system Squeakr (Simple Quotient filter-based Exact and Approximate Kmer Representation), which is based on the counting quotient filter. This off-the-shelf data structure turns out to be an efficient (approximate or exact) representation for sets or multisets of k-mers. Squeakr takes 2×-4.3× less time than the state-of-the-art to count and perform a random-point-query workload. Squeakr is memory-efficient, consuming 1.5×-4.3× less memory than the state-of-the-art. It offers competitive counting performance. In fact, it is faster for larger k-mers, and answers point queries (i.e. queries for the abundance of a particular k-mer) over an order-of-magnitude faster than other systems. The Squeakr representation of the k-mer multiset turns out to be immediately useful for downstream processing (e.g. de Bruijn graph traversal) because it supports fast queries and dynamic k-mer insertion, deletion, and modification. https://github.com/splatlab/squeakr available under BSD 3-Clause License. ppandey@cs.stonybrook.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com
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.
Matrix model approximations of fuzzy scalar field theories and their phase diagrams
Energy Technology Data Exchange (ETDEWEB)
Tekel, Juraj [Department of Theoretical Physics, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynska Dolina, Bratislava, 842 48 (Slovakia)
2015-12-29
We present an analysis of two different approximations to the scalar field theory on the fuzzy sphere, a nonperturbative and a perturbative one, which are both multitrace matrix models. We show that the former reproduces a phase diagram with correct features in a qualitative agreement with the previous numerical studies and that the latter gives a phase diagram with features not expected in the phase diagram of the field theory.
Ito, K.
1983-01-01
Approximation schemes based on Legendre-tau approximation are developed for application to parameter identification problem for delay and partial differential equations. The tau method is based on representing the approximate solution as a truncated series of orthonormal functions. The characteristic feature of the Legendre-tau approach is that when the solution to a problem is infinitely differentiable, the rate of convergence is faster than any finite power of 1/N; higher accuracy is thus achieved, making the approach suitable for small N.
Feature Selection by Reordering
Czech Academy of Sciences Publication Activity Database
Jiřina, Marcel; Jiřina jr., M.
2005-01-01
Roč. 2, č. 1 (2005), s. 155-161 ISSN 1738-6438 Institutional research plan: CEZ:AV0Z10300504 Keywords : feature selection * data reduction * ordering of features Subject RIV: BA - General Mathematics
The Featurization of Journalism
Steensen, Steen
2011-01-01
Feature journalism has developed from being an insignificant supplement to news journalism to a family of genres that today dominates newspapers. The present article explores the growing importance of feature journalism and attempts to understand its social function, how it has changed and why it has become so important. Based on an analysis of influential textbooks on feature journalism, the paper argues that feature journalism has traditionally been dominated by a literary d...
Intersection of Feature Models
van den Broek, P.M.
In this paper, we present an algorithm for the construction of the intersection of two feature models. The feature models are allowed to have "requires" and "excludes" constraints, and should be parent-compatible. The algorithm is applied to the problem of combining feature models from stakeholders
van den Broek, P.M.; Galvao, I.; Noppen, J.A.R.
2010-01-01
In this paper, we consider the problem of merging feature models which consist of trees with "requires" and "excludes" constraints. For any two such feature models which are parent-compatible, their merge is defined to be the smallest parent-compatible feature model which has all products of the
The virtual environment student. An initial approximation
Directory of Open Access Journals (Sweden)
Federico Borges Sáiz
2007-05-01
Full Text Available The quote at the start of the "Introduction" ("Education follows an agricultural timetable, has an industrial structure and operation and is set in an increasingly digitalised society" illustrates the need for an in-depth understanding of training in virtual environments. This understanding rests on knowing its central element: the student.This article invites the reader to take a look at the figure and the performance of the virtual environment student. One of the features of the twenty-first century is that of leading increasingly to a learning society, where citizens learn, formally or informally, throughout their lives. Technology sustains many of the behavioural and attitude traits of these citizens, although technology is only the first step; beyond this, the attitudes, skills and motivation required for successfully performing in a virtual environment are necessary.
On some applications of Diophantine approximations
2014-01-01
This book consists mainly of the translation, by C. Fuchs, of the 1929 landmark paper "Über einige Anwendungen diophantischer Approximationen" by C.L. Siegel. The paper contains proofs of most important results in transcendence theory and diophantine analysis, notably Siegel’s celebrated theorem on integral points on algebraic curves. Many modern versions of Siegel’s proof have appeared, but none seem to faithfully reproduce all features of the original one. This translation makes Siegel’s original ideas and proofs available for the first time in English. The volume also contains the original version of the paper (in German) and an article by the translator and U. Zannier, commenting on some aspects of the evolution of this field following Siegel’s paper. To end, it presents three modern proofs of Siegel’s theorem on integral points.
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.
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.
Analytical approximations for prices of swap rate dependent embedded options in insurance products
Plat, R.; Pelsser, A.
2009-01-01
Life insurance products have profit sharing features in combination with guarantees. These so-called embedded options are often dependent on or approximated by forward swap rates. In practice, these kinds of options are mostly valued by Monte Carlo simulations. However, for risk management
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.
Approximate Orthogonal Sparse Embedding for Dimensionality Reduction.
Lai, Zhihui; Wong, Wai Keung; Xu, Yong; Yang, Jian; Zhang, David
2016-04-01
Locally linear embedding (LLE) is one of the most well-known manifold learning methods. As the representative linear extension of LLE, orthogonal neighborhood preserving projection (ONPP) has attracted widespread attention in the field of dimensionality reduction. In this paper, a unified sparse learning framework is proposed by introducing the sparsity or L1-norm learning, which further extends the LLE-based methods to sparse cases. Theoretical connections between the ONPP and the proposed sparse linear embedding are discovered. The optimal sparse embeddings derived from the proposed framework can be computed by iterating the modified elastic net and singular value decomposition. We also show that the proposed model can be viewed as a general model for sparse linear and nonlinear (kernel) subspace learning. Based on this general model, sparse kernel embedding is also proposed for nonlinear sparse feature extraction. Extensive experiments on five databases demonstrate that the proposed sparse learning framework performs better than the existing subspace learning algorithm, particularly in the cases of small sample sizes.
Parks, Connie L; Monson, Keith L
2018-01-01
This research examined how accurately 2D images (i.e., photographs) of 3D clay facial approximations were matched to corresponding photographs of the approximated individuals using an objective automated facial recognition system. Irrespective of search filter (i.e., blind, sex, or ancestry) or rank class (R 1 , R 10 , R 25 , and R 50 ) employed, few operationally informative results were observed. In only a single instance of 48 potential match opportunities was a clay approximation matched to a corresponding life photograph within the top 50 images (R 50 ) of a candidate list, even with relatively small gallery sizes created from the application of search filters (e.g., sex or ancestry search restrictions). Increasing the candidate lists to include the top 100 images (R 100 ) resulted in only two additional instances of correct match. Although other untested variables (e.g., approximation method, 2D photographic process, and practitioner skill level) may have impacted the observed results, this study suggests that 2D images of manually generated clay approximations are not readily matched to life photos by automated facial recognition systems. Further investigation is necessary in order to identify the underlying cause(s), if any, of the poor recognition results observed in this study (e.g., potential inferior facial feature detection and extraction). Additional inquiry exploring prospective remedial measures (e.g., stronger feature differentiation) is also warranted, particularly given the prominent use of clay approximations in unidentified persons casework. Copyright © 2017. Published by Elsevier B.V.
Undersea Feature Place Names as of June 2014
National Oceanic and Atmospheric Administration, Department of Commerce — There are approximately 5100 undersea features with names approved by the United States Board on Geographic Names (BGN) currently in the Geographic Names Data Base...
No surprise in the first Born approximation for electron scattering
International Nuclear Information System (INIS)
Lentzen, M.
2014-01-01
In a recent article it is argued that the far-field expansion of electron scattering, a pillar of electron diffraction theory, is wrong (Treacy and Van Dyck, 2012 [1]). It is further argued that in the first Born approximation of electron scattering the intensity of the electron wave is not conserved to first order in the scattering potential. Thus a “mystery of the missing phase” is investigated, and the supposed flaw in scattering theory is seeked to be resolved by postulating a standing spherical electron wave (Treacy and Van Dyck, 2012 [1]). In this work we show, however, that these theses are wrong. A review of the essential parts of scattering theory with careful checks of the underlying assumptions and limitations for high-energy electron scattering yields: (1) the traditional form of the far-field expansion, comprising a propagating spherical wave, is correct; (2) there is no room for a missing phase; (3) in the first Born approximation the intensity of the scattered wave is conserved to first order in the scattering potential. The various features of high-energy electron scattering are illustrated by wave-mechanical calculations for an explicit target model, a Gaussian phase object, and for a Si atom, considering the geometric conditions in high-resolution transmission electron microscopy. - Highlights: Treacy and Van Dyck (2012) argue that the far-field expansion of electron scattering is wrong. The chief theses of that former work are wrong. There is no room for the missing phase proposed by Treacy and Van Dyck. There is no violation of the intensity conservation to first order in the scattering potential. Calculations for a phase object and an atomic target confirm traditional scattering theory
On the point-source approximation of earthquake dynamics
Directory of Open Access Journals (Sweden)
Andrea Bizzarri
2014-06-01
Full Text Available The focus on the present study is on the point-source approximation of a seismic source. First, we compare the synthetic motions on the free surface resulting from different analytical evolutions of the seismic source (the Gabor signal (G, the Bouchon ramp (B, the Cotton and Campillo ramp (CC, the Yoffe function (Y and the Liu and Archuleta function (LA. Our numerical experiments indicate that the CC and the Y functions produce synthetics with larger oscillations and correspondingly they have a higher frequency content. Moreover, the CC and the Y functions tend to produce higher peaks in the ground velocity (roughly of a factor of two. We have also found that the falloff at high frequencies is quite different: it roughly follows ω−2 in the case of G and LA functions, it decays more faster than ω−2 for the B function, while it is slow than ω−1 for both the CC and the Y solutions. Then we perform a comparison of seismic waves resulting from 3-D extended ruptures (both supershear and subshear obeying to different governing laws against those from a single point-source having the same features. It is shown that the point-source models tend to overestimate the ground motions and that they completely miss the Mach fronts emerging from the supershear transition process. When we compare the extended fault solutions against a multiple point-sources model the agreement becomes more significant, although relevant discrepancies still persist. Our results confirm that, and more importantly quantify how, the point-source approximation is unable to adequately describe the radiation emitted during a real world earthquake, even in the most idealized case of planar fault with homogeneous properties and embedded in a homogeneous, perfectly elastic medium.
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.
Belief Propagation for Probabilistic Slow Feature Analysis
Omori, Toshiaki; Sekiguchi, Tomoki; Okada, Masato
2017-08-01
Slow feature analysis (SFA) is a time-series analysis method for extracting slowly-varying latent features from multi-dimensional data. A recent study proposed a probabilistic framework of SFA using the Bayesian statistical framework. However, the conventional probabilistic framework of SFA can not accurately extract the slow feature in noisy environments since its marginal likelihood function was approximately derived under the assumption that there exists no observation noise. In this paper, we propose a probabilistic framework of SFA with rigorously derived marginal likelihood function. Here, we rigorously derive the marginal likelihood function of the probabilistic framework of SFA by using belief propagation. We show using numerical data that the proposed probabilistic framework of SFA can accurately extract the slow feature and underlying parameters for the latent dynamics simultaneously even under noisy environments.
DEFF Research Database (Denmark)
Tregenna-Piggott, Philip L W; Sheptyakov, Denis; Keller, Lukas
2009-01-01
expectations based on the unquenched orbital angular momentum of the [Fe(CN)(6)](3-) anion, giving rise to an M(s) approximately +/-9/2 ground state, isolated by approximately 11.5 cm(-1) from the higher-lying levels. The reported INS and magnetic data should now serve as a benchmark against which theoretical...... interactions that define the low-lying states of the Mn-M(III)-Mn trimeric units. Despite the presence of an antiferromagnetic intertrimer interaction, the experimental evidence supports the classification of both the Cr(III) and Fe(III) compounds as single-molecule magnets. The value of 17(2) cm(-1...
Holmes, Jon L.
1999-05-01
The Features area of JCE Online is now readily accessible through a single click from our home page. In the Features area each column is linked to its own home page. These column home pages also have links to them from the online Journal Table of Contents pages or from any article published as part of that feature column. Using these links you can easily find abstracts of additional articles that are related by topic. Of course, JCE Online+ subscribers are then just one click away from the entire article. Finding related articles is easy because each feature column "site" contains links to the online abstracts of all the articles that have appeared in the column. In addition, you can find the mission statement for the column and the email link to the column editor that I mentioned above. At the discretion of its editor, a feature column site may contain additional resources. As an example, the Chemical Information Instructor column edited by Arleen Somerville will have a periodically updated bibliography of resources for teaching and using chemical information. Due to the increase in the number of these resources available on the WWW, it only makes sense to publish this information online so that you can get to these resources with a simple click of the mouse. We expect that there will soon be additional information and resources at several other feature column sites. Following in the footsteps of the Chemical Information Instructor, up-to-date bibliographies and links to related online resources can be made available. We hope to extend the online component of our feature columns with moderated online discussion forums. If you have a suggestion for an online resource you would like to see included, let the feature editor or JCE Online (jceonline@chem.wisc.edu) know about it. JCE Internet Features JCE Internet also has several feature columns: Chemical Education Resource Shelf, Conceptual Questions and Challenge Problems, Equipment Buyers Guide, Hal's Picks, Mathcad
Exact and Approximate Solutions for Transient Squeezing Flow
Lang, Ji; Santhanam, Sridhar; Wu, Qianhong
2017-11-01
In this paper, we report two novel theoretical approaches to examine a fast-developing flow in a thin fluid gap, which is widely observed in industrial applications and biological systems. The problem is featured by a very small Reynolds number and Strouhal number, making the fluid convective acceleration is negligible, while its local acceleration is not. We have developed an exact solution for this problem which shows that the flow starts with an inviscid limit when the viscous effect has no time to appear, and is followed by a subsequent developing flow, in which the viscous effect continues to penetrate into the entire fluid gap. An approximate solution is also developed using a boundary layer integral method. This solution precisely captures the general behavior of the transient fluid flow process, and agrees very well with the exact solution. We also performed numerical simulation using Ansys-CFX. Excellent agreement between the analytical and the numerical solutions is obtained, indicating the validity of the analytical approaches. The study presented herein fills the gap in the literature, and will have a broad impact in industrial and biomedical applications. This work is supported by National Science Foundation CBET Fluid Dynamics Program under Award #1511096, and supported by the Seed Grant from The Villanova Center for the Advancement of Sustainability in Engineering (VCASE).
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.
International Nuclear Information System (INIS)
Evans, K. Jr.
1999-01-01
MEDM, which is derived from Motif Editor and Display Manager, is the primary graphical interface to the EPICS control system. This paper describes new features that have been added to MEDM in the last two years. These features include new editing capabilities, a PV Info dialog box, a means of specifying limits and precision, a new implementation of the Cartesian Plot, new features for several objects, new capability for the Related Display, help, a user-configurable Execute Menu, reconfigured start-up options, and availability for Windows 95/98/NT. Over one hundred bugs have been fixed, and the program is quite stable and in extensive use
Indian Academy of Sciences (India)
SARS – clinical features. Fever - > 38C; Respiratory symptoms, eg cough, difficulty in breathing; OR; Unexplained respiratory distress leading to death; AND; Close contact or travel to Asia within 10 days of onset of illness.
Carr, M.H.; Masursky, H.; Strom, R.G.; Terrile, R.J.
1979-01-01
Volcanic activity is apparently higher on Io than on any other body in the Solar System. Its volcanic landforms can be compared with features on Earth to indicate the type of volcanism present on Io. ?? 1979 Nature Publishing Group.
Introduction to Methods of Approximation in Physics and Astronomy
van Putten, Maurice H. P. M.
2017-04-01
Modern astronomy reveals an evolving Universe rife with transient sources, mostly discovered - few predicted - in multi-wavelength observations. Our window of observations now includes electromagnetic radiation, gravitational waves and neutrinos. For the practicing astronomer, these are highly interdisciplinary developments that pose a novel challenge to be well-versed in astroparticle physics and data analysis. In realizing the full discovery potential of these multimessenger approaches, the latter increasingly involves high-performance supercomputing. These lecture notes developed out of lectures on mathematical-physics in astronomy to advanced undergraduate and beginning graduate students. They are organised to be largely self-contained, starting from basic concepts and techniques in the formulation of problems and methods of approximation commonly used in computation and numerical analysis. This includes root finding, integration, signal detection algorithms involving the Fourier transform and examples of numerical integration of ordinary differential equations and some illustrative aspects of modern computational implementation. In the applications, considerable emphasis is put on fluid dynamical problems associated with accretion flows, as these are responsible for a wealth of high energy emission phenomena in astronomy. The topics chosen are largely aimed at phenomenological approaches, to capture main features of interest by effective methods of approximation at a desired level of accuracy and resolution. Formulated in terms of a system of algebraic, ordinary or partial differential equations, this may be pursued by perturbation theory through expansions in a small parameter or by direct numerical computation. Successful application of these methods requires a robust understanding of asymptotic behavior, errors and convergence. In some cases, the number of degrees of freedom may be reduced, e.g., for the purpose of (numerical) continuation or to identify
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.
Coloring local feature extraction
Van De Weijer, Joost; Schmid, Cordelia
2006-01-01
International audience; Although color is commonly experienced as an indispensable quality in describing the world around us, state-of-the art local feature-based representations are mostly based on shape description, and ignore color information. The description of color is hampered by the large amount of variations which causes the measured color values to vary significantly. In this paper we aim to extend the description of local features with color information. To accomplish a wide applic...
Czech Academy of Sciences Publication Activity Database
Somol, Petr; Pudil, Pavel
2002-01-01
Roč. 35, č. 12 (2002), s. 2749-2759 ISSN 0031-3203 R&D Projects: GA MŠk ME 187; GA ČR GA402/01/0981 Institutional research plan: CEZ:AV0Z1075907 Keywords : pattern recognition * feature selection * subset search Subject RIV: JC - Computer Hardware ; Software Impact factor: 1.038, year: 2002 http://library.utia.cas.cz/separaty/historie/somol- feature selection toolbox.pdf
Directory of Open Access Journals (Sweden)
P Neri
2012-07-01
Full Text Available Binding operations are primarily ascribed to cortex or similarly complex avian structures. My experiments show that the zebrafish, a lower vertebrate lacking cortex, supports visual feature binding of form and motion for the purpose of social behavior. These results challenge the notion that feature binding may require highly evolved neural structures and demonstrate that the nervous system of lower vertebrates can afford unexpectedly complex computations.
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.
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.
Skibo, J. G.; Dermer, C. D.; Ramaty, R.
1994-01-01
We show that gamma-ray line emission at approximately 0.4 and less than or approximately 0.2 MeV can be produced by Compton scattering of beamed radiation in the jets of Galactic black hole candidates. This mechanism has the novel feature of not invoking the presence of e(exp +)-e(exp -) pairs. To produce the two lines, we employ a symmetric double-sided jet with bulk flow velocity of about 0.5c and incident beam radiation with a hard energy spectrum. We show that the two lines can be seen at viewing-angle cosines relative to the jet ranging from 0.2 to 0.6. This comprises 40% of the total solid angle. In addition, the line radiation is approximately 10% polarized. Depending on the bulk flow and viewing angle, the model can produce lines at other energies as well. In particular, a broad feature near 1 MeV can be seen by viewing the jet close to its axis. Our model can also accommodate single-line spectra if the beamed gamma-ray emission or the jets themselves are asymmetric.
Implementation of optimal Galerkin and Collocation approximations of PDEs with Random Coefficients
Beck, Joakim
2011-12-22
In this work we first focus on the Stochastic Galerkin approximation of the solution u of an elliptic stochastic PDE. We rely on sharp estimates for the decay of the coefficients of the spectral expansion of u on orthogonal polynomials to build a sequence of polynomial subspaces that features better convergence properties compared to standard polynomial subspaces such as Total Degree or Tensor Product. We consider then the Stochastic Collocation method, and use the previous estimates to introduce a new effective class of Sparse Grids, based on the idea of selecting a priori the most profitable hierarchical surpluses, that, again, features better convergence properties compared to standard Smolyak or tensor product grids.
Directory of Open Access Journals (Sweden)
A. A. Vorobeva
2017-01-01
Full Text Available The paper deals with identification and authentication of web users participating in the Internet information processes (based on features of online texts.In digital forensics web user identification based on various linguistic features can be used to discover identity of individuals, criminals or terrorists using the Internet to commit cybercrimes. Internet could be used as a tool in different types of cybercrimes (fraud and identity theft, harassment and anonymous threats, terrorist or extremist statements, distribution of illegal content and information warfare. Linguistic identification of web users is a kind of biometric identification, it can be used to narrow down the suspects, identify a criminal and prosecute him. Feature set includes various linguistic and stylistic features extracted from online texts. We propose dynamic feature selection for each web user identification task. Selection is based on calculating Manhattan distance to k-nearest neighbors (Relief-f algorithm. This approach improves the identification accuracy and minimizes the number of features. Experiments were carried out on several datasets with different level of class imbalance. Experiment results showed that features relevance varies in different set of web users (probable authors of some text; features selection for each set of web users improves identification accuracy by 4% at the average that is approximately 1% higher than with the use of static set of features. The proposed approach is most effective for a small number of training samples (messages per user.
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....
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.
Feature displacement interpolation
DEFF Research Database (Denmark)
Nielsen, Mads; Andresen, Per Rønsholt
1998-01-01
Given a sparse set of feature matches, we want to compute an interpolated dense displacement map. The application may be stereo disparity computation, flow computation, or non-rigid medical registration. Also estimation of missing image data, may be phrased in this framework. Since the features...... often are very sparse, the interpolation model becomes crucial. We show that a maximum likelihood estimation based on the covariance properties (Kriging) show properties more expedient than methods such as Gaussian interpolation or Tikhonov regularizations, also including scale......-selection. The computational complexities are identical. We apply the maximum likelihood interpolation to growth analysis of the mandibular bone. Here, the features used are the crest-lines of the object surface....
An outer approximation method for the road network design problem.
Asadi Bagloee, Saeed; Sarvi, Majid
2018-01-01
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.
Surface wake in the random-phase approximation
International Nuclear Information System (INIS)
Garcia de Abajo, F.J.; Echenique, P.M.
1993-01-01
The scalar-electric-potential distribution set up by an ion traveling in the vicinity of a plane solid-vacuum interface, that is, the surface-wake potential, is investigated with the specular-reflection model to describe the response of the surface and with the random-phase approximation for the dielectric function of the bulk material. This permits us to address the study of the low-velocity surface wake: the static potential is found to have a dip at the position of the ion; that dip is shifted towards the direction opposite to the velocity vector for velocities smaller than the threshold of creation of plasmons (∼1.3v F ). Extensive numerical calculations are presented for an ion both inside and outside aluminum. Comparison to the results obtained with the plasmon-pole dielectric function indicates excellent agreement for velocities larger than ∼1.3v F . On the other side, the possibility of surface-wake riding is suggested, by analogy with bulk-wake riding postulated in the past. In it, the electron would be bound in the first trough of the surface-wake potential set up when the ion describes a grazing trajectory. The main feature introduced by the surface with respect to the bulk consists of allowing the use of ions of higher charge, reducing in this way the relative importance of the electron self-energy, and in addition, giving rise to larger binding energies. When the ion beam is directed along a special direction of an oriented crystal surface, the mechanism of resonant coherent excitation could provide a way for experimentally detecting this phenomenon through the emission of the bound electron with well-defined energy and around a preferential direction
The choice of optimal Discrete Interaction Approximation to the kinetic integral for ocean waves
Directory of Open Access Journals (Sweden)
V. G. Polnikov
2003-01-01
Full Text Available A lot of discrete configurations for the four-wave nonlinear interaction processes have been calculated and tested by the method proposed earlier in the frame of the concept of Fast Discrete Interaction Approximation to the Hasselmann's kinetic integral (Polnikov and Farina, 2002. It was found that there are several simple configurations, which are more efficient than the one proposed originally in Hasselmann et al. (1985. Finally, the optimal multiple Discrete Interaction Approximation (DIA to the kinetic integral for deep-water waves was found. Wave spectrum features have been intercompared for a number of different configurations of DIA, applied to a long-time solution of kinetic equation. On the basis of this intercomparison the better efficiency of the configurations proposed was confirmed. Certain recommendations were given for implementation of new approximations to the wave forecast practice.
Energy of ground state in B-B'-U-Hubbard model in approximation of static fluctuations
Mironov, G I
2002-01-01
To explain some features of CuO sub 2 base high-temperature superconductors (HTSC) one should take account of possibility of electron transfer to the crystalline structure mode next to the nearest one. It terms of approximation of static fluctuations one calculated the energy of ground state in two-dimensional B-B'-U Hubbard model. Lattice is assumed to consist of two sublattices formed by various type atoms. The calculation results of ground state energy are compared with the precise solution for one-dimensional Hubbard model derived previously. Comparison of the precise and the approximated solutions shows that approximation of static fluctuations describes adequately behavior of the Hubbard studied model within both weak and strong correlation ranges
Indian Academy of Sciences (India)
First page Back Continue Last page Graphics. Key Features of oxypnictides. Metal –insulator boundary. Quasi 2D structure. Doping important. Charge transfer (redox behaviour). Normal resistivity : mohms (little higher in oxypnictides). Near antiferromagnetic ground state. Superexchange through Fe-As-Fe (Cu-O-Cu) ...
Gusev Rocks Solidified from Lava (Approximate True Color)
2006-01-01
features investigated by Spirit during the Chinese New Year celebration period. In ancient Chinese myth, FuYi was the first great emperor and lived in the east. He explained the theory of 'Yin' and 'Yang' to his people, invented the net to catch fish, was the first to use fire to cook food, and invented a musical instrument known as the 'Se' to accompany his peoples' songs and dances. Other rocks and features are being informally named for Chinese gods, warriors, inventors, and scientists, as well as rivers, lakes, and mountains. Spirit took this image on the rover's Martian day, or sol, 731 (Jan. 23, 2006). This is an approximate true color rendering combining images taken with the Pancam's 750-nanometer, 530-nanometer and 430-nanometer filters.
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.
Discrete Feature Model (DFM) User Documentation
International Nuclear Information System (INIS)
Geier, Joel
2008-06-01
This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this software, the
Discrete Feature Model (DFM) User Documentation
Energy Technology Data Exchange (ETDEWEB)
Geier, Joel (Clearwater Hardrock Consulting, Corvallis, OR (United States))
2008-06-15
This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this
Imaging features of thalassemia
Energy Technology Data Exchange (ETDEWEB)
Tunaci, M.; Tunaci, A.; Engin, G.; Oezkorkmaz, B.; Acunas, G.; Acunas, B. [Dept. of Radiology, Istanbul Univ. (Turkey); Dincol, G. [Dept. of Internal Medicine, Istanbul Univ. (Turkey)
1999-07-01
Thalassemia is a kind of chronic, inherited, microcytic anemia characterized by defective hemoglobin synthesis and ineffective erythropoiesis. In all thalassemias clinical features that result from anemia, transfusional, and absorptive iron overload are similar but vary in severity. The radiographic features of {beta}-thalassemia are due in large part to marrow hyperplasia. Markedly expanded marrow space lead to various skeletal manifestations including spine, skull, facial bones, and ribs. Extramedullary hematopoiesis (ExmH), hemosiderosis, and cholelithiasis are among the non-skeletal manifestations of thalassemia. The skeletal X-ray findings show characteristics of chronic overactivity of the marrow. In this article both skeletal and non-skeletal manifestations of thalassemia are discussed with an overview of X-ray findings, including MRI and CT findings. (orig.)
Feature extraction of multispectral data
Crane, R. B.; Crimmins, T.; Reyer, J. F.
1973-01-01
A method is presented for feature extraction of multispectral scanner data. Non-training data is used to demonstrate the reduction in processing time that can be obtained by using feature extraction rather than feature selection.
CBFS: high performance feature selection algorithm based on feature clearness.
Directory of Open Access Journals (Sweden)
Minseok Seo
Full Text Available BACKGROUND: The goal of feature selection is to select useful features and simultaneously exclude garbage features from a given dataset for classification purposes. This is expected to bring reduction of processing time and improvement of classification accuracy. METHODOLOGY: In this study, we devised a new feature selection algorithm (CBFS based on clearness of features. Feature clearness expresses separability among classes in a feature. Highly clear features contribute towards obtaining high classification accuracy. CScore is a measure to score clearness of each feature and is based on clustered samples to centroid of classes in a feature. We also suggest combining CBFS and other algorithms to improve classification accuracy. CONCLUSIONS/SIGNIFICANCE: From the experiment we confirm that CBFS is more excellent than up-to-date feature selection algorithms including FeaLect. CBFS can be applied to microarray gene selection, text categorization, and image classification.
Model Checking Feature Interactions
DEFF Research Database (Denmark)
Le Guilly, Thibaut; Olsen, Petur; Pedersen, Thomas
2015-01-01
This paper presents an offline approach to analyzing feature interactions in embedded systems. The approach consists of a systematic process to gather the necessary information about system components and their models. The model is first specified in terms of predicates, before being refined to t...... to timed automata. The consistency of the model is verified at different development stages, and the correct linkage between the predicates and their semantic model is checked. The approach is illustrated on a use case from home automation....
Energy Technology Data Exchange (ETDEWEB)
Baron, H.E.; Zakrzewski, W.J. [Department of Mathematical Sciences, Durham University,Durham DH1 3LE (United Kingdom)
2016-06-30
We investigate the validity of collective coordinate approximations to the scattering of two solitons in several classes of (1+1) dimensional field theory models. We consider models which are deformations of the sine-Gordon (SG) or the nonlinear Schrödinger (NLS) model which posses soliton solutions (which are topological (SG) or non-topological (NLS)). Our deformations preserve their topology (SG), but change their integrability properties, either completely or partially (models become ‘quasi-integrable’). As the collective coordinate approximation does not allow for the radiation of energy out of a system we look, in some detail, at how the approximation fares in models which are ‘quasi-integrable’ and therefore have asymptotically conserved charges (i.e. charges Q(t) for which Q(t→−∞)=Q(t→∞)). We find that our collective coordinate approximation, based on geodesic motion etc, works amazingly well in all cases where it is expected to work. This is true for the physical properties of the solitons and even for their quasi-conserved (or not) charges. The only time the approximation is not very reliable (and even then the qualitative features are reasonable, but some details are not reproduced well) involves the processes when the solitons come very close together (within one width of each other) during their scattering.
PHISICS: New Features and Advancements
Energy Technology Data Exchange (ETDEWEB)
C. Rabiti; Y. Wang; G. Palmiotti; H. Hiruta; J. Cogliati; A. Alfonsi; A. EPiney; T. Grimmett
2011-06-01
The PHISICS (Parallel and Highly Innovative Simulation for INL Code System) software is under an intensive development at INL. In the last months new features have been added and improvements of the previously existing one performed. The modular approach has created a friendly development environment that allows a quick expansion of the capabilities. In the last months a little amount of work has been dedicated to the improvement of the spherical harmonics based nodal transport solver while the implementation of a solver based on the self adjoint formulation of the discrete ordinate is in the test phase on structured mesh. PHISICS now include a depletion solver with the option to use two different algorithms for the solution of the Bateman equation: the Taylor development of the exponential matrix and the Chebyshev Rational Approximation Method. The coupling with RELAP5 is also available at least in the steady state search mode. The coupling between RELAP5 and PHISICS can also take advantage of the new cross section interpolation module so that the coupling could be performed using an arbitrary number of energy groups.
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.
Feature Detector and Descriptor for Medical Images
Sargent, Dusty; Chen, Chao-I.; Tsai, Chang-Ming; Wang, Yuan-Fang; Koppel, Daniel
2009-02-01
The ability to detect and match features across multiple views of a scene is a crucial first step in many computer vision algorithms for dynamic scene analysis. State-of-the-art methods such as SIFT and SURF perform successfully when applied to typical images taken by a digital camera or camcorder. However, these methods often fail to generate an acceptable number of features when applied to medical images, because such images usually contain large homogeneous regions with little color and intensity variation. As a result, tasks like image registration and 3D structure recovery become difficult or impossible in the medical domain. This paper presents a scale, rotation and color/illumination invariant feature detector and descriptor for medical applications. The method incorporates elements of SIFT and SURF while optimizing their performance on medical data. Based on experiments with various types of medical images, we combined, adjusted, and built on methods and parameter settings employed in both algorithms. An approximate Hessian based detector is used to locate scale invariant keypoints and a dominant orientation is assigned to each keypoint using a gradient orientation histogram, providing rotation invariance. Finally, keypoints are described with an orientation-normalized distribution of gradient responses at the assigned scale, and the feature vector is normalized for contrast invariance. Experiments show that the algorithm detects and matches far more features than SIFT and SURF on medical images, with similar error levels.
Laboratory simulation of infrared astrophysical features
International Nuclear Information System (INIS)
Rose, L.A.
1979-01-01
Laboratory infrared emission and absorption spectra have been taken of terrestrial silicates, meteorites and lunar soils in the form of micrometer and sub-micrometer grains. The emission spectra were taken in a way that imitates telescopic observations. The purpose was to see which materials best simulate the 10 μm astrophysical feature. The emission spectra of dunite, fayalite and Allende give a good fit to the 10 μm broadband emission feature of comets Bennett and Kohoutek. A study of the effect of grain size on the presence of the 10 μm emission features of dunite shows that for particles larger than 37 μm no feature is seen. The emission spectrum of the Murray meteorite, a Type 2 carbonaceous chondrite, is quite similar to the intermediate resolution spectrum of comet Kohoutek in the 10 μm region. Hydrous silicates or amorphous magnesium silicates in combination with high-temperature condensates, such as olivine or anorthite, would yield spectra that match the intermediate resolution spectrum of comet Kohoutek in the 10 μm region. Glassy olivine and glassy anorthite in approximately equal proportions would also give a spectrum that is a good fit to the cometary 10 μm feature. (Auth.)
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.