How Do Search Engines Handle Chinese Queries?
Hong Cui
2005-10-01
Full Text Available The use of languages other than English has been growing exponentially on the Web. However, the major search engines have been lagging behind in providing indexes and search features to handle these languages. This article explores the characteristics of the Chinese language and how queries in this language are handled by different search engines. Queries were entered in two major search engines (Google and AlltheWeb and two search engines developed for Chinese (Sohu and Baidu. Criteria such as handling word segmentation, number of retrieved documents, and correct display and identification of Chinese characters were used to examine how the search engines handled the queries. The results showed that the performance of the two major search engines was not on a par with that of the search engines developed for Chinese.
Adaptive Control with Approximated Policy Search Approach
Agus Naba
2010-05-01
Full Text Available Most of existing adaptive control schemes are designed to minimize error between plant state and goal state despite the fact that executing actions that are predicted to result in smaller errors only can mislead to non-goal states. We develop an adaptive control scheme that involves manipulating a controller of a general type to improve its performance as measured by an evaluation function. The developed method is closely related to a theory of Reinforcement Learning (RL but imposes a practical assumption made for faster learning. We assume that a value function of RL can be approximated by a function of Euclidean distance from a goal state and an action executed at the state. And, we propose to use it for the gradient search as an evaluation function. Simulation results provided through application of the proposed scheme to a pole-balancing problem using a linear state feedback controller and fuzzy controller verify the scheme’s efficacy.
Cascading A*: a Parallel Approach to Approximate Heuristic Search
Gu, Yan
2014-01-01
In this paper, we proposed a new approximate heuristic search algorithm: Cascading A*, which is a two-phrase algorithm combining A* and IDA* by a new concept "envelope ball". The new algorithm CA* is efficient, able to generate approximate solution and any-time solution, and parallel friendly.
Computing gap free Pareto front approximations with stochastic search algorithms.
Schütze, Oliver; Laumanns, Marco; Tantar, Emilia; Coello, Carlos A Coello; Talbi, El-Ghazali
2010-01-01
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was on obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of epsilon-dominance. Though bounds on the quality of the limit approximation-which are entirely determined by the archiving strategy and the value of epsilon-have been obtained, the strategies do not guarantee to obtain a gap free approximation of the Pareto front. That is, such approximations A can reveal gaps in the sense that points f in the Pareto front can exist such that the distance of f to any image point F(a), a epsilon A, is "large." Since such gap free approximations are desirable in certain applications, and the related archiving strategies can be advantageous when memetic strategies are included in the search process, we are aiming in this work for such methods. We present two novel strategies that accomplish this task in the probabilistic sense and under mild assumptions on the stochastic search algorithm. In addition to the convergence proofs, we give some numerical results to visualize the behavior of the different archiving strategies. Finally, we demonstrate the potential for a possible hybridization of a given stochastic search algorithm with a particular local search strategy-multi-objective continuation methods-by showing that the concept of epsilon-dominance can be integrated into this approach in a suitable way.
Approximate aggregate nearest neighbor search on moving objects trajectories
Mohammad; Reza; Abbasifard; Hassan; Naderi; Zohreh; Fallahnejad; Omid; Isfahani; Alamdari
2015-01-01
Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.
Robust hashing with local models for approximate similarity search.
Song, Jingkuan; Yang, Yi; Li, Xuelong; Huang, Zi; Yang, Yang
2014-07-01
Similarity search plays an important role in many applications involving high-dimensional data. Due to the known dimensionality curse, the performance of most existing indexing structures degrades quickly as the feature dimensionality increases. Hashing methods, such as locality sensitive hashing (LSH) and its variants, have been widely used to achieve fast approximate similarity search by trading search quality for efficiency. However, most existing hashing methods make use of randomized algorithms to generate hash codes without considering the specific structural information in the data. In this paper, we propose a novel hashing method, namely, robust hashing with local models (RHLM), which learns a set of robust hash functions to map the high-dimensional data points into binary hash codes by effectively utilizing local structural information. In RHLM, for each individual data point in the training dataset, a local hashing model is learned and used to predict the hash codes of its neighboring data points. The local models from all the data points are globally aligned so that an optimal hash code can be assigned to each data point. After obtaining the hash codes of all the training data points, we design a robust method by employing l2,1 -norm minimization on the loss function to learn effective hash functions, which are then used to map each database point into its hash code. Given a query data point, the search process first maps it into the query hash code by the hash functions and then explores the buckets, which have similar hash codes to the query hash code. Extensive experimental results conducted on real-life datasets show that the proposed RHLM outperforms the state-of-the-art methods in terms of search quality and efficiency.
Retrospective search on biomass harvesting techniques including materials handling and storage
1985-10-01
This literature search covers the period 1977 to date. The harvesting, materials handling and storage of the following materials: wood; crops and crop residues; peat; sugar cane; reeds, grasses and fers; algae and jojoba shrubs are covered.
Approximate Nearest Neighbor Search for a Dataset of Normalized Vectors
Terasawa, Kengo; Tanaka, Yuzuru
This paper describes a novel algorithm for approximate nearest neighbor searching. For solving this problem especially in high dimensional spaces, one of the best-known algorithm is Locality-Sensitive Hashing (LSH). This paper presents a variant of the LSH algorithm that outperforms previously proposed methods when the dataset consists of vectors normalized to unit length, which is often the case in pattern recognition. The LSH scheme is based on a family of hash functions that preserves the locality of points. This paper points out that for our special case problem we can design efficient hash functions that map a point on the hypersphere into the closest vertex of the randomly rotated regular polytope. The computational analysis confirmed that the proposed method could improve the exponent ρ, the main indicator of the performance of the LSH algorithm. The practical experiments also supported the efficiency of our algorithm both in time and in space.
Enhanced Approximate Nearest Neighbor via Local Area Focused Search.
Gonzales, Antonio [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Blazier, Nicholas Paul [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-02-01
Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.
Approximate aggregate nearest neighbor search on moving objects trajectories
Mohammad Reza Abbasifard; Hassan Naderi; Zohreh Fallahnejad; Omid Isfahani Alamdari
2015-01-01
Aggregate nearest neighbor (ANN) search retrieves for two spatial datasetsT andQ, segment(s) of one or more trajectories from the setT having minimum aggregate distance to points inQ. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index (SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.
Approximate search for Big Data with applications in information security – A survey
Slobodan Petrović
2015-01-01
This paper is a survey of approximate search techniques in very large data sets (so-called Big Data). After a short introduction, some techniques for speeding up approximate search in such data sets based on exploitation of inherent bit-parallelism in computers are described. It then reviews the applications in search related to information security problems (digital forensics, malware detection, intrusion detection) are reviewed. Finally, the need for constraints in approximate search regard...
Full-search-equivalent pattern matching with incremental dissimilarity approximations.
Tombari, Federico; Mattoccia, Stefano; Di Stefano, Luigi
2009-01-01
This paper proposes a novel method for fast pattern matching based on dissimilarity functions derived from the Lp norm, such as the Sum of Squared Differences (SSD) and the Sum of Absolute Differences (SAD). The proposed method is full-search equivalent, i.e. it yields the same results as the Full Search (FS) algorithm. In order to pursue computational savings the method deploys a succession of increasingly tighter lower bounds of the adopted Lp norm-based dissimilarity function. Such bounding functions allow for establishing a hierarchy of pruning conditions aimed at skipping rapidly those candidates that cannot satisfy the matching criterion. The paper includes an experimental comparison between the proposed method and other full-search equivalent approaches known in literature, which proves the remarkable computational efficiency of our proposal.
Fully Retroactive Approximate Range and Nearest Neighbor Searching
Goodrich, Michael T
2011-01-01
We describe fully retroactive dynamic data structures for approximate range reporting and approximate nearest neighbor reporting. We show how to maintain, for any positive constant $d$, a set of $n$ points in $\\R^d$ indexed by time such that we can perform insertions or deletions at any point in the timeline in $O(\\log n)$ amortized time. We support, for any small constant $\\epsilon>0$, $(1+\\epsilon)$-approximate range reporting queries at any point in the timeline in $O(\\log n + k)$ time, where $k$ is the output size. We also show how to answer $(1+\\epsilon)$-approximate nearest neighbor queries for any point in the past or present in $O(\\log n)$ time.
Approximate search for Big Data with applications in information security – A survey
Slobodan Petrović
2015-04-01
Full Text Available This paper is a survey of approximate search techniques in very large data sets (so-called Big Data. After a short introduction, some techniques for speeding up approximate search in such data sets based on exploitation of inherent bit-parallelism in computers are described. It then reviews the applications in search related to information security problems (digital forensics, malware detection, intrusion detection are reviewed. Finally, the need for constraints in approximate search regarding the number of so-called elementary edit operations and the run lengths of particular elementary edit operations is explained and the status of on-going research on efficient implementation of approximate search algorithms with various constraints is given.
Optimal Polygonal Approximation of Digital Planar Curves Using Genetic Algorithm and Tabu Search
无
2000-01-01
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented.With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained.Compared to the famous Teh-chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error.Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
A Rule-Based Local Search Algorithm for General Shift Design Problems in Airport Ground Handling
Clausen, Tommy
We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework with mul...... with multiple neighborhoods and a loosely coupled rule engine based on simulated annealing is presented. Computational experiments on real-life data from various airport ground handling organization show the performance and flexibility of the proposed algorithm....
Rajneesh Kumar Gujral
2011-01-01
Full Text Available Mobile ad hoc networks (MANETS are self-created and self organized by a collection of mobile nodes, interconnected by multi-hop wireless paths in a strictly peer to peer fashion. DSR (Dynamic Source Routing is an on-demand routing protocol for wireless ad hoc networks that floods route requests when the route is needed. Route caches in intermediate mobile node on DSR are used to reduce flooding of route requests. But with the increase in network size, node mobility and local cache of every mobile node cached route quickly become stale or inefficient. In this paper, for efficient searching, we have proposed a generic searching algorithm on associative cache memory organization to faster searching single/multiple paths for destination if exist in intermediate mobile node cache with a complexity O(n (Where n is number of bits required to represent the searched field.The other major problem of DSR is that the route maintenance mechanism does not locally repair a broken link and Stale cache information could also result in inconsistencies during the route discovery /reconstruction phase. So to deal this, we have proposed an optimized cache coherence handling scheme for on -demand routing protocol (DSR.
Yu, Ker-Wei; Hwang, Rey-Chue; Hsieh, Jer-Guang
In this paper, the ship manoeuvring problems particular to maritime search and rescue are investigated. A solution to such problems is necessary for successful ship handling to save human life. A fuzzy gain scheduling Proportional Derivative (PD) controller, using a back-propagation algorithm, is developed to solve these maritime search and rescue problems. The parameters of the proposed PD controller are determined on-line by fuzzy rules and adjustable fuzzy reasons. The proposed controller is self-adaptive and can accommodate the effects caused by wave or wind disturbance. Some computer simulations are provided to illustrate the use of the main ideas.
Karpinski, M. [Univ. of Bonn (Germany); Larmore, L.L. [Univ. of Nevada, Las Vegas, NV (United States); Rytter, W. [Warsaw Univ. (Poland)
1996-12-31
A sublinear time subquadratic work parallel algorithm for construction of an optimal binary search tree, in a special case of practical interest, namely where the frequencies of items to be stored are not too small, is given. A sublinear time subquadratic work parallel algorithm for construction of an approximately optimal binary search tree in the general case is also given. Sub-quadratic work and sublinear time are achieved using a fast parallel algorithm for the column minima problem for Monge matrices developed by Atallah and Kosaraju. The algorithms given in this paper take O(n{sup 0.6}) time with n processors in the CREW PRAM model. Our 29orithms work well if every subtree of the optimal binary search tree of depth {Omega}(log n) has o(n) leaves. We prove that there is a sequential algorithm with subquadratic average-case complexity, by demonstrating that the {open_quotes}small subtree{close_quotes} condition holds with very high probability for a randomly permuted weight sequence. This solves the conjecture posed in liand breaks the quadratic time {open_quotes}barrier{close_quotes} of Knuth`s algorithm. This algorithm can also be parallelized to run in average sublinear time with n processors.
A fast approximate nearest neighbor search algorithm in the Hamming space.
Esmaeili, Mani Malek; Ward, Rabab Kreidieh; Fatourechi, Mehrdad
2012-12-01
A fast approximate nearest neighbor search algorithm for the (binary) Hamming space is proposed. The proposed Error Weighted Hashing (EWH) algorithm is up to 20 times faster than the popular locality sensitive hashing (LSH) algorithm and works well even for large nearest neighbor distances where LSH fails. EWH significantly reduces the number of candidate nearest neighbors by weighing them based on the difference between their hash vectors. EWH can be used for multimedia retrieval and copy detection systems that are based on binary fingerprinting. On a fingerprint database with more than 1,000 videos, for a specific detection accuracy, we demonstrate that EWH is more than 10 times faster than LSH. For the same retrieval time, we show that EWH has a significantly better detection accuracy with a 15 times lower error rate.
V. D. Sulimov
2014-01-01
Full Text Available Modern methods for solving practical problems relating to trouble free, efficient and pro-longed operation of complex systems are presumed the application of computational diagnos-tics. Input data for diagnosing usually contain the results of experimental measurements of the system certain investigatory characteristics; among them may be registered parameters of oscillatory motion or impact process. The diagnostic procedure is founded on the solution of the corresponding inverse spectral problem; the problem in many cases may be reduced to a minimization of an appropriate error criterion. Eigenvalues from the direct problem for the mathematical model and useful measured data for the system are used in order to construct the corresponding criterion. When solving these inverse problems, consideration must be given to following special features: the error criterion may be represented by nondifferentiable and multiextremal function.Consideration is being given to problems of identification of anomalies in the phase constitution of the coolant circulating throw the reactor primary circuit. Main dynamical char-acteristics of the object under diagnosing are considered as continuous functions of the bounded set of control variables. Possible occurrence of anomalies in the phase constitution of the coolant can be detected owing to changes in dynamical characteristics of the two-phase flow. It is suggested that criterion functions are continuous, Lipschitzian, multiextremal and not everywhere differentiable. Two novel hybrid algorithms are proposed with scanning a search space by use of the modern stochastic Multi-Particle Collision Algorithm on base of analogy with absorbtion and scattering processes for nuclear particles. The local search is im-plemented using the hyperbolic smoothing function method for the first algorithm, and the linearization method with two-parametric smoothing approximations of criteria for the second one. Some results on solving
Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages
Francois Hantry
2011-09-01
Full Text Available Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract-based or service-based systems. In this paper we investigate the problem of extracting temporal unsatisfiable cores in order to detect the inconsistent part of a specification. We extend conflict-driven SAT-solver to provide a new conflict-driven depth-first-search solver for temporal logic. We use this solver to compute LTL unsatisfiable cores without re-exploring the history of the solver.
Meziane, M; Brash, E J; Gilman, R; Jones, M K; Luo, W; Pentchev, L; Perdrisat, C F; Puckett, A J R; Punjabi, V; Wesselmann, F R; Ahmidouch, A; Albayrak, I; Aniol, K A; Arrington, J; Asaturyan, A; Ates, O; Baghdasaryan, H; Benmokhtar, F; Bertozzi, W; Bimbot, L; Bosted, P; Boeglin, W; Butuceanu, C; Carter, P; Chernenko, S; Christy, E; Commisso, M; Cornejo, J C; Covrig, S; Danagoulian, S; Daniel, A; Davidenko, A; Day, D; Dhamija, S; Dutta, D; Ent, R; Frullani, S; Fenker, H; Frlez, E; Garibaldi, F; Gaskell, D; Gilad, S; Goncharenko, Y; Hafidi, K; Hamilton, D; Higinbotham, D W; Hinton, W; Horn, T; Hu, B; Huang, J; Huber, G M; Jensen, E; Kang, H; Keppel, C; Khandaker, M; King, P; Kirillov, D; Kohl, M; Kravtsov, V; Kumbartzki, G; Li, Y; Mamyan, V; Margaziotis, D J; Markowitz, P; Marsh, A; Matulenko, Y; Maxwell, J; Mbianda, G; Meekins, D; Melnik, Y; Miller, J; Mkrtchyan, A; Mkrtchyan, H; Moffit, B; Moreno, O; Mulholland, J; Narayan, A; Nuruzzaman; Nedev, S; Piasetzky, E; Pierce, W; Piskunov, N M; Prok, Y; Ransome, R D; Razin, D S; Reimer, P E; Reinhold, J; Rondon, O; Shabestari, M; Shahinyan, A; Shestermanov, K; Širca, S; Sitnik, I; Smykov, L; Smith, G; Solovyev, L; Solvignon, P; Subedi, R; Suleiman, R; Tomasi-Gustafsson, E; Vasiliev, A; Vanderhaeghen, M; Veilleux, M; Wojtsekhowski, B B; Wood, S; Ye, Z; Zanevsky, Y; Zhang, X; Zhang, Y; Zheng, X; Zhu, L
2011-04-01
Intensive theoretical and experimental efforts over the past decade have aimed at explaining the discrepancy between data for the proton electric to magnetic form factor ratio, G(E)/G(M), obtained separately from cross section and polarization transfer measurements. One possible explanation for this difference is a two-photon-exchange contribution. In an effort to search for effects beyond the one-photon-exchange or Born approximation, we report measurements of polarization transfer observables in the elastic H(e[over →],e(')p[over →]) reaction for three different beam energies at a Q(2)=2.5 GeV(2), spanning a wide range of the kinematic parameter ε. The ratio R, which equals μ(p)G(E)/G(M) in the Born approximation, is found to be independent of ε at the 1.5% level. The ε dependence of the longitudinal polarization transfer component P(ℓ) shows an enhancement of (2.3±0.6)% relative to the Born approximation at large ε.
Meziane, M; Brash, E J; Jones, M K; Luo, W; Pentchev, L; Perdrisat, C F; Puckett, A J.R.; Punjabi, V; Wesselmann, F R; Ahmidouch, A; Albayrak, I; Aniol, K A; Arrington, J; Asaturyan, A; Ates, O; Baghdasaryan, H; Benmokhtar, F; Bertozzi, W; Bimbot, L; Bosted, P; Boeglin, W; Butuceanu, C; Carter, P; Chernenko, S; Christy, E; Commisso, M; Cornejo, J C; Covrig, S; Danagoulian, S; Daniel, A; Davidenko, A; Day, D; Dhamija, S; Dutta, D; Ent, R; Frullani, S; Fenker, H; Frlez, E; Garibaldi, F; Gaskell, D; Gilad, S; Goncharenko, Y; Hafidi, K; Hamilton, D; Higinbothan, D W; Hinton, W; Horn, T; Hu, B; Huang, J; Huber, G M; Jensen, E; Kang, H; Keppel, C; Khandaker, M; King, P; Kirillov, D; Kohl, M; Kravtsov, V; Kumbartzki, G; Li, Y; Mamyan, V; Margaziotis, D J; Markowitz, P; Marsh, A; Matulenko, Y; Maxwell, J; Mbianda, G; Meekins, D; Melnick, Y; Miller, J; Mkrtchyan, A; Mkrtchyan, H; Moffit, B; Moreno, O; Mulholland, J; Narayan, A; Nuruzzaman,; Nedev, S; Piasetzky, E; Pierce, W; Piskunov, N M; Prok, Y; Ransome, R D; Razin, D S; Reimer, P E; Reinhold, J; Rondon, O; Shabestari, M; Shahinyan, A; Shestermanov, K; Sirca, S; Sitnik, I; Smykov, L; Smith, G; Solovyev, L; Solvignon, P; Subedi, R; Suleiman, R; Tomasi-Gustafsson, E; Vasiliev, A; Vanderhaeghen, M; Veilleux, M; Wojtsekhowski, B B; Wood, S; Ye, Z; Zanevsky, Y; Zhang, X; Zhang, Y; Zheng, X; Zhu, L
2011-04-01
Intensive theoretical and experimental efforts over the past decade have aimed at explaining the discrepancy between data for the proton electric to magnetic form factor ratio, $G_{E}/G_{M}$, obtained separately from cross section and polarization transfer measurements. One possible explanation for this difference is a two-photon-exchange (TPEX) contribution. In an effort to search for effects beyond the one-photon-exchange or Born approximation, we report measurements of polarization transfer observables in the elastic $H(\\vec{e},e'\\vec{p})$ reaction for three different beam energies at a fixed squared momentum transfer $Q^2 = 2.5$ GeV$^2$, spanning a wide range of the virtual photon polarization parameter, $\\epsilon$. From these measured polarization observables, we have obtained separately the ratio $R$, which equals $\\mu_p G_{E}/G_{M}$ in the Born approximation, and the longitudinal polarization transfer component $P_\\ell$, with statistical and systematic uncertainties of $\\Delta R \\approx \\pm 0.01 \\mbox{(stat)} \\pm 0.013 \\mbox{(syst)}$ and $\\Delta P_\\ell/P^{Born}_{\\ell} \\approx \\pm 0.006 \\mbox{(stat)}\\pm 0.01 \\mbox{(syst)}$. The ratio $R$ is found to be independent of $\\epsilon$ at the 1.5% level, while the $\\epsilon$ dependence of $P_\\ell$ shows an enhancement of $(2.3 \\pm 0.6) %$ relative to the Born approximation at large $\\epsilon$.
Meziane, M; Jones, M K; Luo, W; Pentchev, L; Perdrisat, C F; Puckett, A J R; Punjabi, V; Wesselmann, F R; Ahmidouch, A; Albayrak, I; Aniol, K A; Arrington, J; Asaturyan, A; Ates, O; Baghdasaryan, H; Benmokhtar, F; Bertozzi, W; Bimbot, L; Bosted, P; Boeglin, W; Butuceanu, C; Carter, P; Chernenko, S; Christy, E; Commisso, M; Cornejo, J C; Covrig, S; Danagoulian, S; Daniel, A; Davidenko, A; Day, D; Dhamija, S; Dutta, D; Ent, R; Frullani, S; Fenker, H; Frlez, E; Garibaldi, F; Gaskell, D; Gilad, S; Gilman, R; Goncharenko, Y; Hafidi, K; Hamilton, D; Higinbotham, D W; Hinton, W; Horn, T; Hu, B; Huang, J; Huber, G M; Jensen, E; Kang, H; Keppel, C; Khandaker, M; King, P; Kirillov, D; Kohl, M; Kravtsov, V; Kumbartzki, G; Li, Y; Mamyan, V; Margaziotis, D J; Markowitz, P; Marsh, A; Matulenko, Y; Maxwell, J; Mbianda, G; Meekins, D; Melnik, Y; Miller, J; Mkrtchyan, A; Mkrtchyan, H; Moffit, B; Moreno, O; Mulholland, J; Narayan, A; Nuruzzaman,; Nedev, S; Piasetzky, E; Pierce, W; Piskunov, N M; Prok, Y; Ransome, R D; Razin, D S; Reimer, P E; Reinhold, J; Rondon, O; Shabestari, M; Shahinyan, A; Shestermanov, K; Sirca, S; Sitnik, I; Smykov, L; Smith, G; Solovyev, L; Solvignon, P; Subedi, R; Suleiman, R; Tomasi-Gustafsson, E; Vasiliev, A; Vanderhaeghen, M; Veilleux, M; Wojtsekhowski, B B; Wood, S; Ye, Z; Zanevsky, Y; Zhang, X; Zhang, Y; Zheng, X; Zhu, L
2010-01-01
Intensive theoretical and experimental efforts over the past decade have aimed at explaining the discrepancy between data for the proton form factor ratio $G_{Ep}/G_{Mp}$ obtained from cross section and polarization measurements. One possible explanation for this difference is a two-photon-exchange contribution. We report the results of the JLab Hall C $GEp2\\gamma$ experiment, which measured the kinematical dependence of polarization transfer observables in elastic electron-proton scattering at $Q^2=2.5$ GeV$^2$, in search of effects beyond the Born approximation. For a wide range of values of the kinematic factor $\\epsilon$ ($\\epsilon=$0.15, 0.63, and 0.77), the proton polarization component ratio and the longitudinal polarization transfer component were measured with statistical uncertainties of $\\pm$0.01 and $\\pm$0.006 and systematic uncertainties of 0.013 and 0.01, respectively.
Concept Approximation between Fuzzy Ontologies
无
2006-01-01
Fuzzy ontologies are efficient tools to handle fuzzy and uncertain knowledge on the semantic web; but there are heterogeneity problems when gaining interoperability among different fuzzy ontologies. This paper uses concept approximation between fuzzy ontologies based on instances to solve the heterogeneity problems. It firstly proposes an instance selection technology based on instance clustering and weighting to unify the fuzzy interpretation of different ontologies and reduce the number of instances to increase the efficiency. Then the paper resolves the problem of computing the approximations of concepts into the problem of computing the least upper approximations of atom concepts. It optimizes the search strategies by extending atom concept sets and defining the least upper bounds of concepts to reduce the searching space of the problem. An efficient algorithm for searching the least upper bounds of concept is given.
杨荣山; 袁仲荣; 黄向东; 赵克刚; 陈金华
2009-01-01
The optimized design method of vehicle's handling stability and ride comfort was introduced based on approximate model in this paper.A car multi-body dynamics model was established by using software ADAMS/Car,the evaluating objects of vehicle's handling stability and ride comfort were also determined.The suspension spring rigidity,shock absorbers damping characteristic and anti-roll stabilizer rigidity were used as design variable,and based on the approximate optimized mathematic model,the multi-object optimization calculation of handling stability and ride comfort were carried out.h was indicated that the approximate model technology was an effective method for optimizing vehicle's performance.%简述了基于近似模型的车辆操纵稳定性及平顺性的优化设计方法.利用多体动力学软件ADAMS/Car建立了某轿车整车多体动力学模型,并确定了车辆操纵稳定性及平顺性的评价目标.以悬架弹簧刚度、减振器阻尼特性和横向稳定杆刚度为设计变量,利用近似优化数学模型对该轿车进行了操纵稳定性和行驶平顺性的多目标优化计算.结果表明,近似模型技术对于汽车性能的平衡优化是一种十分有效的方法.
Brown, D; O'Shaughnessy, R
2012-01-01
Current searches for compact binary mergers by ground-based gravitational-wave detectors assume for simplicity the two bodies are not spinning. If the binary contains compact objects with significant spin, then this can reduce the sensitivity of these searches, particularly for black hole--neutron star binaries. In this paper we investigate the effect of neglecting precession on the sensitivity of searches for spinning binaries using non-spinning waveform models. We demonstrate that in the sensitive band of Advanced LIGO, the angle between the binary's orbital angular momentum and its total angular momentum is approximately constant. Under this \\emph{constant precession cone} approximation, we show that the gravitational-wave phasing is modulated in two ways: a secular increase of the gravitational-wave phase due to precession and an oscillation around this secular increase. We show that this secular evolution occurs in precisely three ways, corresponding to physically different apparent evolutions of the bin...
Toubøl, Jonas
2012-01-01
Boganmeldelse af Flemming Ibsen, Laust Høgedahl & Steen Sheuer: Kollektiv Handling. Faglig organisering og skift af fagforening. Nyt fra Samfundsvidenskaberne, Frederiksberg, 2012.......Boganmeldelse af Flemming Ibsen, Laust Høgedahl & Steen Sheuer: Kollektiv Handling. Faglig organisering og skift af fagforening. Nyt fra Samfundsvidenskaberne, Frederiksberg, 2012....
Mardirossian, Narbe [Kenneth S. Pitzer Center for Theoretical Chemistry, Department of Chemistry, University of California, Berkeley, California 94720 (United States); Head-Gordon, Martin, E-mail: mhg@cchem.berkeley.edu [Kenneth S. Pitzer Center for Theoretical Chemistry, Department of Chemistry, University of California, Berkeley, California 94720 (United States); Chemical Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States)
2015-02-21
A meta-generalized gradient approximation density functional paired with the VV10 nonlocal correlation functional is presented. The functional form is selected from more than 10{sup 10} choices carved out of a functional space of almost 10{sup 40} possibilities. Raw data come from training a vast number of candidate functional forms on a comprehensive training set of 1095 data points and testing the resulting fits on a comprehensive primary test set of 1153 data points. Functional forms are ranked based on their ability to reproduce the data in both the training and primary test sets with minimum empiricism, and filtered based on a set of physical constraints and an often-overlooked condition of satisfactory numerical precision with medium-sized integration grids. The resulting optimal functional form has 4 linear exchange parameters, 4 linear same-spin correlation parameters, and 4 linear opposite-spin correlation parameters, for a total of 12 fitted parameters. The final density functional, B97M-V, is further assessed on a secondary test set of 212 data points, applied to several large systems including the coronene dimer and water clusters, tested for the accurate prediction of intramolecular and intermolecular geometries, verified to have a readily attainable basis set limit, and checked for grid sensitivity. Compared to existing density functionals, B97M-V is remarkably accurate for non-bonded interactions and very satisfactory for thermochemical quantities such as atomization energies, but inherits the demonstrable limitations of existing local density functionals for barrier heights.
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...
Xiang, Meng; Fu, Songnian; Deng, Lei; Tang, Ming; Shum, Perry; Liu, Deming
2015-07-27
Blind phase search (BPS) algorithm for M-QAM has excellent tolerance to laser linewidth at the expense of rather high computation complexity (CC). Here, we first theoretically obtain the quadratic relationship between the test angle and corresponding distance matric during the BPS implementation. Afterwards, we propose a carrier phase estimation (CPE) based on a two-stage BPS with quadratic approximation (QA). Instead of searching the phase blindly with fixed step-size for the BPS algorithm, QA can significantly accelerate the speed of phase searching. As a result, a group factor of 2.96/3.05, 4.55/4.67 and 2.27/2.3 (in the form of multipliers/adders) reduction of CC is achieved for 16QAM, 64QAM and 256QAM, respectively, in comparison with the traditional BPS scheme. Meanwhile, a guideline for determining the summing filter block length is put forward during performance optimization. Under the condition of optimum filter block length, our proposed scheme shows similar performance as traditional BPS scheme. At 1 dB required E(S)/N(0) penalty @ BER = 10(-2), our proposed CPE scheme can tolerate a times symbol duration productΔf⋅T(S) of 1.7 × 10(-4), 6 × 10(-5) and 1.5 × 10(-5) for 16/64/256-QAM, respectively.
Sørensen, Mads Vaarby; Matos, Joana E.; Prætorius, Helle
2010-01-01
Homeostatic control of plasma K+ is a necessary physiological function. The daily dietary K+ intake of approximately 100 mmol is excreted predominantly by the distal tubules of the kidney. About 10% of the ingested K+ is excreted via the intestine. K+ handling in both organs is specifically...
Fridrich, Sven; Karmilin, Konstantin; Stöcker, Walter
2016-02-02
Substrate cleavage by metalloproteinases involves nucleophilic attack on the scissile peptide bond by a water molecule that is polarized by a catalytic metal, usually a zinc ion, and a general base, usually the carboxyl group of a glutamic acid side chain. The zinc ion is most often complexed by imidazole nitrogens of histidine side chains. This arrangement suggests that the physiological pH optimum of most metalloproteinases is in the neutral range. In addition to their catalytic metal ion, many metalloproteinases contain additional transition metal or alkaline earth ions, which are structurally important or modulate the catalytic activity. As a consequence, these enzymes are generally sensitive to metal chelators. Moreover, the catalytic metal can be displaced by adventitious metal ions from buffers or biological fluids, which may fundamentally alter the catalytic function. Therefore, handling, purification, and assaying of metalloproteinases require specific precautions to warrant their stability. Copyright © 2016 John Wiley & Sons, Inc.
Designing an effective gateway for documentation search through a WWW server
Nguyen, V.
1995-11-01
Lookup, a NERSC`s utility, searches several documentation databases to find exact as well as approximate matches for the user`s search term. However, it is only available for those who run it directly on NERSC`s machines. To provide a wider access to a large audience, I developed a gateway which handles information requests and returns the appropriated documents.
... this page: //medlineplus.gov/ency/patientinstructions/000444.htm Handling sharps and needles To use the sharing features ... Health Administration. OSHA fact sheet: protecting yourself when handling contaminated sharps. Updated January 2011. Available at: www. ...
Approximate Representations and Approximate Homomorphisms
Moore, Cristopher
2010-01-01
Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups: functions f:G -> U_d such that Pr[f(xy) = f(x) f(y)] is large, or more generally Exp_{x,y} ||f(xy) - f(x)f(y)||^2$ is small, where x and y are uniformly random elements of the group G and U_d denotes the unitary group of degree d. We bound these quantities in terms of the ratio d / d_min where d_min is the dimension of the smallest nontrivial representation of G. As an application, we bound the extent to which a function f : G -> H can be an approximate homomorphism where H is another finite group. We show that if H's representations are significantly smaller than G's, no such f can be much more homomorphic than a random function. We interpret these results as showing that if G is quasirandom, that is, if d_min is large, then G cannot be embedded in a small number of dimensi...
Approximate Nearest Neighbor Queries among Parallel Segments
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...
Robust ASPNET Exception Handling
Dumond, Lee
2009-01-01
This Wrox Blox will teach you how to unravel the mysteries of exception handling in ASP.NET. First, you'll get a thorough introduction to structured exception handling in the .NET Framework, learn about the Exception class, the related C# language constructs, and how exceptions propagate up the call stack. Then, you'll delve into a variety of practical topics such as: when, where, and how to properly throw, catch, and handle exceptions in your code; how to employ "defensive programming" techniques to avoid triggering the most common CLR exceptions; adopting exception handling "best practices
Henriksen, Kirsten; Alminde, Rikke; Stevnsgaard Andersen, Mona
Social analyse og handling er et redskab beregnet til at inspirere socialarbejdere til at arbejde analytisk, systematisk samt refleksivt med konkrete problemstillinger i socialt arbejde.......Social analyse og handling er et redskab beregnet til at inspirere socialarbejdere til at arbejde analytisk, systematisk samt refleksivt med konkrete problemstillinger i socialt arbejde....
Ræbild, Ulla
area within fashion research. This paper proposes an understanding of the work process of fashion designers as practices of handling comprising a number of embodied methodologies tied to both spatial and temporal dimensions. The term handling encompasses four meanings. As a verb it is literally...... to touch, pick up, carry, or feel with the hands. Figuratively it is to manage, deal with, direct, train, or control. Additionally, as a noun, a handle is something by which we grasp or open up something. Lastly, handle also has a Nordic root, here meaning to trade, bargain or deal. Together all four...... meanings seem to merge in the fashion design process, thus opening up for an embodied engagement with matter that entails direction giving, organizational management and negotiation. By seeing processes of handling as a key fashion methodological practice, it is possible to divert the discourse away from...
Approximate Nearest Neighbor Search through Comparisons
Tschopp, Dominique
2009-01-01
This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects. In contrast with most existing approaches, we can only access the ``hidden'' space in which the objects live through a similarity oracle. The oracle, given two reference objects and a query object, returns the reference object closest to the query object. The oracle attempts to model the behavior of human users, capable of making statements about similarity, but not of assigning meaningful numerical values to distances between objects.
CHR -- Character Handling Routines
Charles, A. C.; Rees, P. C. T.; Chipperfield, A. J.; Jenness, T.
This document describes the Character Handling Routine library, CHR, and its use. The CHR library augments the limited character handling facilities provided by the Fortran 77 standard. It offers a range of character handling facilities: from formatting Fortran data types into text strings and the reverse, to higher level functions such as wild card matching, string sorting, paragraph reformatting and justification. The library may be used simply for building text strings for interactive applications or as a basis for more complex text processing applications.
... Child What Kids Say About: Handling Stress Anxiety, Fears, and Phobias Community Service: A Family's Guide to Getting Involved ... With Stress Teens Talk About Stress (Video) Anxiety, Fears, and Phobias Childhood Stress How Can I Help My Child ...
Alnajjar, Mikhail S.; Haynie, Todd O.
2009-08-14
Pyrophoric reagents are extremely hazardous. Special handling techniques are required to prevent contact with air and the resulting fire. This document provides several methods for working with pyrophoric reagents outside of an inert atmosphere.
Groupe ST/HM
2002-01-01
A new EDH document entitled 'Transport/Handling Request' will be in operation as of Monday, 11th February 2002, when the corresponding icon will be accessible from the EDH desktop, together with the application instructions. This EDH form will replace the paper-format transport/handling request form for all activities involving the transport of equipment and materials. However, the paper form will still be used for all vehicle-hire requests. The introduction of the EDH transport/handling request form is accompanied by the establishment of the following time limits for the various services concerned: 24 hours for the removal of office items, 48 hours for the transport of heavy items (of up to 6 metric tons and of standard road width), 5 working days for a crane operation, extra-heavy transport operation or complete removal, 5 working days for all transport operations relating to LHC installation. ST/HM Group, Logistics Section Tel: 72672 - 72202
Improving coal handling effectiveness
Walker, S.
2003-10-01
Appropriate coal handling systems are essential for successful coal utilisation. The paper looks at some of the options available, including crushers and hammer mills, wear-resistant liners for chutes and wagons, and dewatering systems. These are individual components within larger systems such as stockyard stacking and reclaiming installations. 5 photos.
Clustering Based Approximation in Facial Image Retrieval
R.Pitchaiah
2016-11-01
Full Text Available The web search tool returns a great many pictures positioned by the essential words separated from the encompassing content. Existing article acknowledgment systems to prepare characterization models from human-named preparing pictures or endeavor to deduce the connection/probabilities in the middle of pictures and commented magic words. Albeit proficient in supporting in mining comparatively looking facial picture results utilizing feebly named ones, the learning phase of above bunch based close estimations is shortened with idleness elements for ongoing usage which is fundamentally highlighted in our showings. So we propose to utilize shading based division driven auto face location methodology combined with an adjusted Clustering Based Approximation (CBA plan to decrease the dormancy but then holding same proficiency amid questioning. The specialized phases of our proposed drew closer is highlighted in the accompanying stream diagram. Every phase of the above specialized procedure guarantees the question results at tremendously lessened handling time in this way making our method much achievable for ongoing usage
Txurruka Alberdi, Beñat
2015-01-01
The search of images on the internet has become a natural process for the internet surfer. Most of the search engines use complex algorithms to look up for images but their metadata is mostly ignored, in part because many image hosting sites remove metadata when the image is uploaded. The JPSearch standard has been developed to handle interoperability in metadata based searches, but it seems that the market is not interested on supporting it. The starting point of this proje...
RB树:一种支持空间近似关键字查询的外存索引%An Index Supporting Spatial Approximate Keyword Search on Disks
王金宝; 高宏; 李建中; 杨东华
2012-01-01
Spatial approximate keyword queries consist of a spatial condition and a set of keywords as the textual condition. The spatial condition requires that the returned objects are inside a spatial region or nearby a location, and the textual condition requires that the returned objects are labeled with a set of keywords similar to the queried keywords. Such queries enable users to find objects they are interested in within a spatial database, and make mismatches between users' query keywords and spatial object keywords tolerant. With the rapid growth of data, spatial databases storing objects from diverse geographical regions can be no longer held in memories. Thus, it is essential to answer spatial approximate keyword queries over disk resident datasets. Existing works present methods either that return incomplete answers or index in memory, and effective solutions in disks are in demand. This paper presents a novel disk resident index RB-tree to support spatial approximate keyword queries. We study the principle of augmenting R-tree with the capacity of approximate keyword searching based on existing solutions, and store two kinds of bitmaps in R-tree nodes to build an RB-tree. RB-tree supports a wide range of spatial conditions such as range and nearest neighbor, combined with keyword similarity metrics such as edit distance, dice etc. Experimental results against R-tree on two real world datasets demonstrate the efficiency of our solution.%空间近似关键字查询包含一个空间条件和一组关键字相似性条件,这种查询在空间数据库中返回同时满足以下条件的对象:1)对象的位置信息满足查询中的空间条件;2)对于查询中的任何一个关键字,对象中至少包含一个关键字与其相似度大于给定阈值.随着当前数据的爆炸性增长,空间数据库无法完整地存放在内存中,因此空间数据库需要支持空间近似关键字查询的外存索引.目前,还没有在外存中支持精确的空
Parazin, R.J.
1995-05-31
This study presents estimates of the solid radioactive waste quantities that will be generated in the Separations, Low-Level Waste Vitrification and High-Level Waste Vitrification facilities, collectively called the Tank Waste Remediation System Treatment Complex, over the life of these facilities. This study then considers previous estimates from other 200 Area generators and compares alternative methods of handling (segregation, packaging, assaying, shipping, etc.).
Uranium hexafluoride handling. Proceedings
1991-12-31
The United States Department of Energy, Oak Ridge Field Office, and Martin Marietta Energy Systems, Inc., are co-sponsoring this Second International Conference on Uranium Hexafluoride Handling. The conference is offered as a forum for the exchange of information and concepts regarding the technical and regulatory issues and the safety aspects which relate to the handling of uranium hexafluoride. Through the papers presented here, we attempt not only to share technological advances and lessons learned, but also to demonstrate that we are concerned about the health and safety of our workers and the public, and are good stewards of the environment in which we all work and live. These proceedings are a compilation of the work of many experts in that phase of world-wide industry which comprises the nuclear fuel cycle. Their experience spans the entire range over which uranium hexafluoride is involved in the fuel cycle, from the production of UF{sub 6} from the naturally-occurring oxide to its re-conversion to oxide for reactor fuels. The papers furnish insights into the chemical, physical, and nuclear properties of uranium hexafluoride as they influence its transport, storage, and the design and operation of plant-scale facilities for production, processing, and conversion to oxide. The papers demonstrate, in an industry often cited for its excellent safety record, continuing efforts to further improve safety in all areas of handling uranium hexafluoride. Selected papers were processed separately for inclusion in the Energy Science and Technology Database.
咸爱勇; 朱大铭
2015-01-01
the maximum not-all-equal 2,3 and 4 satisfiability problems come from the semi-definite programming relaxation methods given by Goemans and Williamson,Zwick,Karloff and Zwick,with performances 1.139 (1/0.878 ), 1.100 47 (1/0.9087 )and 8/7 respectively.When k 5,we have not seen any approximation algorithm for the maximum not-all-equal k satisfiability problems.In this paper,we propose a local search algorithm to solve the maximum not-all-equal k satisfiability problem.This algorithm can achieve the performance ratio 2k -1/(2k -1 -1)for k 2.We extend the method to propose a local search algorithm to solve the more generalized version of the maximum not-all-equal k satisfiability problem,with each clause containing at least k literals.This algorithm can still achieve the performance ratio 2k -1/(2k -1 -1).Using the method for the generalized version of the maximum not-all-equal k satisfiability problem,we propose a new 2k/(2k -1)-approximation algorithm for generalized version of the maximum k satisfiability problem.Finally,we prove that if P≠NP, then the maximum not-all-equal k satisfiability problem cannot be approximated within 2k -1/(2k -1 -1)for k 4.This implies the performance ratio of our algorithm for the maximum not-all-equal k satisfiability problem is optimal.
Basics for Handling Food Safely
... o a rm ct a s tion Basics for Handling Food Safely Safe steps in food handling, cooking, and storage are essential to prevent foodborne ... and soap for 20 seconds before and after handling food. · Don’t cross-contaminate. Keep raw meat, ...
Students' Strategies for Exception Handling
Rashkovits, Rami; Lavy, Ilana
2011-01-01
This study discusses and presents various strategies employed by novice programmers concerning exception handling. The main contributions of this paper are as follows: we provide an analysis tool to measure the level of assimilation of exception handling mechanism; we present and analyse strategies to handle exceptions; we present and analyse…
Reinforcement Learning via AIXI Approximation
Veness, Joel; Hutter, Marcus; Silver, David
2010-01-01
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian optimality notion for general reinforcement learning agents. Previously, it has been unclear whether the theory of AIXI could motivate the design of practical algorithms. We answer this hitherto open question in the affirmative, by providing the first computationally feasible approximation to the AIXI agent. To develop our approximation, we introduce a Monte Carlo Tree Search algorithm along with an agent-specific extension of the Context Tree Weighting algorithm. Empirically, we present a set of encouraging results on a number of stochastic, unknown, and partially observable domains.
Diophantine approximation and badly approximable sets
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...
Merrill, Margaret C.
2006-01-01
The Centers for Disease Control estimates that every year 76 million Americans get some kind of food poisoning, more than 300,000 are hospitalized, and approximately 5,000 people die. A 2004 analysis by the Center for Science in the Public Interest indicates that contaminated produce is responsible for the greatest number of food-borne illnesses.…
New transport and handling contract
SC Department
2008-01-01
A new transport and handling contract entered into force on 1.10.2008. As with the previous contract, the user interface is the internal transport/handling request form on EDH: https://edh.cern.ch/Document/TransportRequest/ To ensure that you receive the best possible service, we invite you to complete the various fields as accurately as possible and to include a mobile telephone number on which we can reach you. You can follow the progress of your request (schedule, completion) in the EDH request routing information. We remind you that the following deadlines apply: 48 hours for the transport of heavy goods (up to 8 tonnes) or simple handling operations 5 working days for crane operations, transport of extra-heavy goods, complex handling operations and combined transport and handling operations in the tunnel. For all enquiries, the number to contact remains unchanged: 72202. Heavy Handling Section TS-HE-HH 72672 - 160319
Trends in Modern Exception Handling
Marcin Kuta
2003-01-01
Full Text Available Exception handling is nowadays a necessary component of error proof information systems. The paper presents overview of techniques and models of exception handling, problems connected with them and potential solutions. The aspects of implementation of propagation mechanisms and exception handling, their effect on semantics and general program efficiency are also taken into account. Presented mechanisms were adopted to modern programming languages. Considering design area, formal methods and formal verification of program properties we can notice exception handling mechanisms are weakly present what makes a field for future research.
Leike, Reimar H
2016-01-01
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how "embarrassing" it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-approximated belief and (2) that the ranking judges approximations only by their predictions for actual outcomes. We find that this ranking is equivalent to the Kullback-Leibler divergence that is frequently used in the literature. However, there seems to be confusion about the correct order in which its functional arguments, the approximated and non-approximated beliefs, should be used. We hope that our elementary derivation settles the apparent confusion. We show for example that when approximating beliefs with Gaussian distributions the optimal approximation is given by moment matching. This is in contrast to many su...
Ginns, D.W.
1958-04-01
A means for handling remotely a sample pellet to be irradiated in a nuclear reactor is proposed. It is comprised essentially of an inlet tube extending through the outer shield of the reactor and being inclined so that its outer end is at a higher elevation than its inner end, an outlet tube extending through the outer shield being inclined so that its inner end is at a higher elevation than its outer end, the inner ends of these two tubes being interconnected, and a straight tube extending through the outer shield and into the reactor core between the inlet and outlet tubes and passing through the juncture of said inner ends. A rod-like member is rotatably and slidely operated within the central straight tube and has a receptacle on its inner end for receiving a sample pellet from the inlet tube. The rod member is operated to pick up a sample pellet from the inlet tube, carry the sample pellet into the irradiating position within the core, and return to the receiving position where it is rotated to dump the irradiated pellet into the outlet tube by which it is conveyed by gravity to the outside of the reactor. Stop members are provided in the inlet tube, and electrical operating devices are provided to control the sequence of the operation automatically.
Rašin, Andrija
1994-01-01
We discuss the idea of approximate flavor symmetries. Relations between approximate flavor symmetries and natural flavor conservation and democracy models is explored. Implications for neutrino physics are also discussed.
On Element SDD Approximability
Avron, Haim; Toledo, Sivan
2009-01-01
This short communication shows that in some cases scalar elliptic finite element matrices cannot be approximated well by an SDD matrix. We also give a theoretical analysis of a simple heuristic method for approximating an element by an SDD matrix.
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
Parallel Handling of Integrity Constraints
Grefen, P.W.P.J.; Flokstra, Jan; Apers, Peter M.G.
1990-01-01
Integrity constraints form an important part of a data model. Therefore, a complete integrity constraint handling subsystem is considered an important part of any modern DBMS. In implementing an integrity constraint handling subsystem, there are two major problem areas: providing enough functionalit
Assessment of Issue Handling Efficiency
Luijten, B.; Visser, J.; Zaidman, A.
2013-01-01
We mined the issue database of GNOME to assess how issues are handled. How many issues are submitted and resolved? Does the backlog grow or decrease? How fast are issues resolved? Does issue resolution speed increase or decrease over time? In which subproject are issues handled most efficiently? To
Assessment of Issue Handling Efficiency
Luijten, B.; Visser, J.; Zaidman, A.
2013-01-01
We mined the issue database of GNOME to assess how issues are handled. How many issues are submitted and resolved? Does the backlog grow or decrease? How fast are issues resolved? Does issue resolution speed increase or decrease over time? In which subproject are issues handled most efficiently? To
Approximation of distributed delays
Lu, Hao; Eberard, Damien; Simon, Jean-Pierre
2010-01-01
We address in this paper the approximation problem of distributed delays. Such elements are convolution operators with kernel having bounded support, and appear in the control of time-delay systems. From the rich literature on this topic, we propose a general methodology to achieve such an approximation. For this, we enclose the approximation problem in the graph topology, and work with the norm defined over the convolution Banach algebra. The class of rational approximates is described, and a constructive approximation is proposed. Analysis in time and frequency domains is provided. This methodology is illustrated on the stabilization control problem, for which simulations results show the effectiveness of the proposed methodology.
Diophantine approximation and badly approximable sets
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...
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...
Approximation techniques for engineers
Komzsik, Louis
2006-01-01
Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.
Achieser, N I
2004-01-01
A pioneer of many modern developments in approximation theory, N. I. Achieser designed this graduate-level text from the standpoint of functional analysis. The first two chapters address approximation problems in linear normalized spaces and the ideas of P. L. Tchebysheff. Chapter III examines the elements of harmonic analysis, and Chapter IV, integral transcendental functions of the exponential type. The final two chapters explore the best harmonic approximation of functions and Wiener's theorem on approximation. Professor Achieser concludes this exemplary text with an extensive section of pr
Lunar Materials Handling System Project
National Aeronautics and Space Administration — The Lunar Materials Handling System (LMHS) is a method for transfer of lunar soil into and out of process equipment in support of in situ resource utilization...
Tritium handling in vacuum systems
Gill, J.T. [Monsanto Research Corp., Miamisburg, OH (United States). Mound Facility; Coffin, D.O. [Los Alamos National Lab., NM (United States)
1986-10-01
This report provides a course in Tritium handling in vacuum systems. Topics presented are: Properties of Tritium; Tritium compatibility of materials; Tritium-compatible vacuum equipment; and Tritium waste treatment.
Solidex 88: solids handling conference
1988-01-01
Papers are presented under the session headings: BMHB (British Materials Handling Board) - tackling user problems; feeding pneumatic conveying systems - matching the hardware to the product; and solutions to some operational problems.
Lunar Materials Handling System Project
National Aeronautics and Space Administration — The Lunar Materials Handling System (LMHS) is a method for transfer of bulk materials and products into and out of process equipment in support of lunar and Mars in...
Order Handling in Convergent Environments
Vrtanoski, Jordan
2012-01-01
The rapid development of IT&T technology had big impact on the traditional telecommunications market, transforming it from monopolistic market to highly competitive high-tech market where new services are required to be created frequently. This paper aims to describe a design approach that puts order management process (as part of enterprise application integration) in function of rapid service creation. In the text we will present a framework for collaborative order handling supporting convergent services. The design splits the order handling processes in convergent environments in three business process groups: order capture, order management and order fulfillment. The paper establishes abstract framework for order handling and provides design guidelines for transaction handling implementation based on the checkpoint and inverse command strategy. The proposed design approach is based in a convergent telecommunication environment. Same principles are applicable in solving problems of collaboration in fun...
Towards integrated microliquid handling systems
Elwenspoek, M.; Lammerink, T.S.J.; Miyake, R.; Fluitman, J.H.J.
1994-01-01
In this paper we describe components for integrated microliquid handling systems such as fluid injection analysis, and first results of planar integration of components. The components discussed are channels, passive and active valves, actuators for micropumps, micromixers, microflow sensors, optica
The Sample Handling System for the Mars Icebreaker Life Mission: from Dirt to Data
Dave, Arwen; Thompson, Sarah J.; McKay, Christopher P.; Stoker, Carol R.; Zacny, Kris; Paulsen, Gale; Mellerowicz, Bolek; Glass, Brian J.; Wilson, David; Bonaccorsi, Rosalba;
2013-01-01
The Mars icebreaker life mission will search for subsurface life on mars. It consists of three payload elements: a drill to retrieve soil samples from approx. 1 meter below the surface, a robotic sample handling system to deliver the sample from the drill to the instruments, and the instruments themselves. This paper will discuss the robotic sample handling system.
Grain Handling and Storage Safety
Webster, Jill, Ph.D.
2005-01-01
Agricultural Health and Safety Fact Sheet AHS-02 Grain Handling and Storage Safety Jill Webster Ph.D., S. Christian Mariger, Graduate Assistant Agricultural Systems Technology and Education There are several hazards that should be considered when working with grain. Storage structures, handling equipment, and the grain itself have all caused serious injuries and deaths. Storage structures (bins, silos, and granaries), like all confined spaces, have significant hazards associated with them. Be...
Civilsamfundets ABC: H for Handling
Lund, Anker Brink; Meyer, Gitte
2015-01-01
Hvad er civilsamfundet? Anker Brink Lund og Gitte Meyer fra CBS Center for Civil Society Studies gennemgår civilsamfundet bogstav for bogstav. Vi er nået til H for Handling.......Hvad er civilsamfundet? Anker Brink Lund og Gitte Meyer fra CBS Center for Civil Society Studies gennemgår civilsamfundet bogstav for bogstav. Vi er nået til H for Handling....
Expectation Consistent Approximate Inference
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 dis...
Ordered cones and approximation
Keimel, Klaus
1992-01-01
This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.
Approximate Modified Policy Iteration
Scherrer, Bruno; Ghavamzadeh, Mohammad; Geist, Matthieu
2012-01-01
Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three approximate MPI (AMPI) algorithms that are extensions of the well-known approximate DP algorithms: fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide an error propagation analysis for AMPI that unifies those for approximate policy and value iteration. We also provide a finite-sample analysis for the classification-based implementation of AMPI (CBMPI), which is more general (and somehow contains) than the analysis of the other presented AMPI algorithms. An interesting observation is that the MPI's parameter allows us to control the balance of errors (in value function approximation and in estimating the greedy policy) in the fina...
Lattice quantum chromodynamics with approximately chiral fermions
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.)
Síndrome HaNDL / HaNDL Syndrome / Síndrome HaNDL
Camilo Ernesto Barros-Gutiérrez, MD., Esp.
2015-03-01
Full Text Available Introducción: El Síndrome HaNDL (Headache and neurologic deficits with cerebroespinal fluid lymphocytosis por sus siglas en inglés, es una patología que cursa con cefalea, focalización neurológica y linfocitosis en el líquido cefalorraquídeo. Objetivo: este artículo busca presentar un caso de Síndrome de HaNDL, puesto que esta condición nosológica implica un reto diagnóstico. Resultados y conclusiones: Se presenta el caso de un paciente con diagnóstico de síndrome de HaNDL los hallazgos al examen físico y del líquido cefalorraquídeo. [Barros-Gutiérrez CE, Silva-Monsalve E, Gualtero-Trujillo S. Síndrome HaNDL. MedUNAB 2015; 17(3: xx-xx]. Introduction: The syndrome of transient Headache and Neurological Deficits with cerebrospinal fluid Lymphocytosis, is a pathology that presents cephalalgia, neurological focalization and lymphocytes in the cerebrospinal fluid. Objective: This article presents a HaNDL Syndrome case, since this nosological condition implies a diagnostic challenge. Results and conclusions: A case of a patient with HaNDL syndrome diagnosis, physical examination findings and cerebrospinal fluid are presented. [Barros-Gutiérrez CE, Silva-Monsalve E, Gualtero-Trujillo S. HaNDL Syndrome. MedUNAB 2015; 17(3: xx-xx]. Introdução: A síndrome de HaNDL (Headache and neurologic déficits with cerebrospinal fluid lymphocytosis por sua sigla em inglês é uma doença que causa dor de cabeça, foco neurológico e linfocitose no líquido cefalorraquidiano. Objetivo: Este artigo tem como objetivo apresentar um caso de Síndrome de HaNDL, uma vez que esta condição nosológica envolve um desafio diagnóstico. Resultados e conclusões: Apresenta-se o caso de um paciente diagnosticado com a síndrome de HaNDL, o encontrado no exame físico e o líquido cefalorraquidiano. [Barros-Gutiérrez CE, Silva-Monsalve E, Gualtero-Trujillo S. Síndrome HaNDL. MedUNAB 2015; 17(3: xx-xx].
Advanced Unmanned Search System (AUSS) Data Handling and Display Study.
1982-06-01
Schreiber, WF, Wirephoto Quality Improvement by Unsharp Masking, J Pattern Recognition, vol 2, Pergamon Press, London, 1970. 29 intensity function of an...Reading MA, 1977. 44. Schreiber, WF, Wirephoto Quality Improvement by Unsharp Masking, J Pattern Recognition, vol 2, Pergamon Press, London, 1970. 45
Approximate calculation of integrals
Krylov, V I
2006-01-01
A systematic introduction to the principal ideas and results of the contemporary theory of approximate integration, this volume approaches its subject from the viewpoint of functional analysis. In addition, it offers a useful reference for practical computations. Its primary focus lies in the problem of approximate integration of functions of a single variable, rather than the more difficult problem of approximate integration of functions of more than one variable.The three-part treatment begins with concepts and theorems encountered in the theory of quadrature. The second part is devoted to t
Approximate and renormgroup symmetries
Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling
2009-07-01
''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)
Approximating Stationary Statistical Properties
Xiaoming WANG
2009-01-01
It is well-known that physical laws for large chaotic dynamical systems are revealed statistically. Many times these statistical properties of the system must be approximated numerically. The main contribution of this manuscript is to provide simple and natural criterions on numerical methods (temporal and spatial discretization) that are able to capture the stationary statistical properties of the underlying dissipative chaotic dynamical systems asymptotically. The result on temporal approximation is a recent finding of the author, and the result on spatial approximation is a new one. Applications to the infinite Prandtl number model for convection and the barotropic quasi-geostrophic model are also discussed.
Tool handling robot system; Tool handling robot system
NONE
1999-03-10
As an example of the delivery of industrial use automation equipment by Meidensha Corp., the paper introduced a tool handling robot system. The system is a tool handling robot of case processing use FMS (flexible manufacturing system). This is a system which exchanges tool automatically according to the From To order from the managing computer using the ceiling running robot between five horizontal type machining centers and more than 800 collective tool stockers. The structure of the system is as follows: tool handling robot (MHR-400), robot controller (meirocs-F), tool hand, robot running unit, tool stocker (for 844 tools), five life tool exchange trucks, tool truck lifting unit, system control panel. (NEDO)
Malvina Baica
1985-01-01
Full Text Available The author uses a new modification of Jacobi-Perron Algorithm which holds for complex fields of any degree (abbr. ACF, and defines it as Generalized Euclidean Algorithm (abbr. GEA to approximate irrationals.
Approximations in Inspection Planning
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
The Karlqvist approximation revisited
Tannous, C
2015-01-01
The Karlqvist approximation signaling the historical beginning of magnetic recording head theory is reviewed and compared to various approaches progressing from Green, Fourier, Conformal mapping that obeys the Sommerfeld edge condition at angular points and leads to exact results.
Approximations in Inspection Planning
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
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
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....
Approximate kernel competitive learning.
Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang
2015-03-01
Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches.
Maksim Duškin
2015-11-01
Full Text Available Approximation and supposition This article compares exponents of approximation (expressions like Russian около, примерно, приблизительно, более, свыше and the words expressing supposition (for example Russian скорее всего, наверное, возможно. These words are often confused in research, in particular researchers often mention exponents of supposition in case of exponents of approximation. Such approach arouses some objections. The author intends to demonstrate in this article a notional difference between approximation and supposition, therefore the difference between exponents of these two notions. This difference could be described by specifying different attitude of approximation and supposition to the notion of knowledge. Supposition implies speaker’s ignorance of the exact number, while approximation does not mean such ignorance. The article offers examples proving this point of view.
Jalving, Camilla
Hvordan kan et kunstværk være en handling? Hvad er performativ billedkunst, og hvad menes der egentlig med ordet ´performativitet´? Det er nogle af de spørgsmål, bogen Værk som handling griber fat i. Mens performativitet i løbet af de sidste ti år er blevet et bredt anvendt begreb i kulturteorien...... mellem værket som objekt og som handling. Bogens værkanalyser orienterer sig derfor både mod, hvad kunstværket er, og hvordan det er: Hvordan virker det, hvordan stiller det sig frem, hvordan producerer det betydning, hvordan skaber det en situation, og ikke mindst hvordan interagerer det med betragteren?...
Interplay of approximate planning strategies.
Huys, Quentin J M; Lally, Níall; Faulkner, Paul; Eshel, Neir; Seifritz, Erich; Gershman, Samuel J; Dayan, Peter; Roiser, Jonathan P
2015-03-10
Humans routinely formulate plans in domains so complex that even the most powerful computers are taxed. To do so, they seem to avail themselves of many strategies and heuristics that efficiently simplify, approximate, and hierarchically decompose hard tasks into simpler subtasks. Theoretical and cognitive research has revealed several such strategies; however, little is known about their establishment, interaction, and efficiency. Here, we use model-based behavioral analysis to provide a detailed examination of the performance of human subjects in a moderately deep planning task. We find that subjects exploit the structure of the domain to establish subgoals in a way that achieves a nearly maximal reduction in the cost of computing values of choices, but then combine partial searches with greedy local steps to solve subtasks, and maladaptively prune the decision trees of subtasks in a reflexive manner upon encountering salient losses. Subjects come idiosyncratically to favor particular sequences of actions to achieve subgoals, creating novel complex actions or "options."
Lark, P D; Bosworth, R C L
1968-01-01
The Handling of Chemical Data deals with how measurements, such as those arrived at from chemical experimentation, are handled. The book discusses the different kinds of measurements and their specific dimensional characteristics by starting with the origin and presentation of chemical data. The text explains the units, fixed points, and relationships found between scales, the concept of dimensions, the presentation of quantitative data (whether in a tabular or graphical form), and some uses of empirical equations. The book also explains the relationship between two variables, and how equatio
How Retailers Handle Complaint Management
Hansen, Torben; Wilke, Ricky; Zaichkowsky, Judy
2009-01-01
as to the links between CM and redress of consumers’ complaints. The results suggest that retailers who attach large negative consequences to consumer dissatisfaction are more likely than other retailers to develop a positive strategic view on customer complaining, but at the same time an increase in perceived......This article fills a gap in the literature by providing insight about the handling of complaint management (CM) across a large cross section of retailers in the grocery, furniture, electronic and auto sectors. Determinants of retailers’ CM handling are investigated and insight is gained...... negative consequences of customer dissatisfaction leads to a more negative view on interacting with complaining customers....
Randomized approximate nearest neighbors algorithm.
Jones, Peter Wilcox; Osipov, Andrei; Rokhlin, Vladimir
2011-09-20
We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in R(d), the algorithm attempts to find k nearest neighbors for each of x(j), where k is a user-specified integer parameter. The algorithm is iterative, and its running time requirements are proportional to T·N·(d·(log d) + k·(d + log k)·(log N)) + N·k(2)·(d + log k), with T the number of iterations performed. The memory requirements of the procedure are of the order N·(d + k). A by-product of the scheme is a data structure, permitting a rapid search for the k nearest neighbors among {x(j)} for an arbitrary point x ∈ R(d). The cost of each such query is proportional to T·(d·(log d) + log(N/k)·k·(d + log k)), and the memory requirements for the requisite data structure are of the order N·(d + k) + T·(d + N). The algorithm utilizes random rotations and a basic divide-and-conquer scheme, followed by a local graph search. We analyze the scheme's behavior for certain types of distributions of {x(j)} and illustrate its performance via several numerical examples.
Covariant approximation averaging
Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph
2014-01-01
We present a new class of statistical error reduction techniques for Monte-Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in $N_f=2+1$ lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte-Carlo calculations over conventional methods for the same cost.
Diophantine approximations on fractals
Einsiedler, Manfred; Shapira, Uri
2009-01-01
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0,1]^2, possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no irrational numbers x in the unit interval such that the continued fraction expansions of {nx mod1 : n is a natural number} are uniformly eventually bounded.
Monotone Boolean approximation
Hulme, B.L.
1982-12-01
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
Measuring Personalization of Web Search
Hannak, Aniko; Sapiezynski, Piotr; Kakhki, Arash Molavi
2013-01-01
Web search is an integral part of our daily lives. Recently, there has been a trend of personalization in Web search, where different users receive different results for the same search query. The increasing personalization is leading to concerns about Filter Bubble effects, where certain users...... are simply unable to access information that the search engines’ algorithm decidesis irrelevant. Despitetheseconcerns, there has been little quantification of the extent of personalization in Web search today, or the user attributes that cause it. In light of this situation, we make three contributions....... First, we develop a methodology for measuring personalization in Web search results. While conceptually simple, there are numerous details that our methodology must handle in order to accurately attribute differences in search results to personalization. Second, we apply our methodology to 200 users...
2010-04-01
... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Handling. 820.140 Section 820.140 Food and Drugs... QUALITY SYSTEM REGULATION Handling, Storage, Distribution, and Installation § 820.140 Handling. Each..., contamination, or other adverse effects to product do not occur during handling. ...
2010-01-01
... 7 Agriculture 3 2010-01-01 2010-01-01 false Whey handling. 58.443 Section 58.443 Agriculture... Procedures § 58.443 Whey handling. (a) Adequate sanitary facilities shall be provided for the handling of... objectionable odors. (b) Whey or whey products intended for human food shall at all times be handled in a...
李冬
2007-01-01
1.Take care of your body.Exercise, eat healthily,and get plenty of sleep.You’ll handle stress much better. 2.Take down your thoughts.Recording your thoughts in a diary will help you choose your feelings and relieve~* stress. 3.Talk about it.If possible,find someone
V．White; D.Adams; 等
2001-01-01
In this paper we highlight strategies and choices that make the Dφ Data Handling system markedly different from many other experiments' systems,We emphasize how far the Dφ system has come in innovating and implementing a Dφ-specific Data Grid system.We discuss experiences during the first months of detector commissioning and give some future plans for the system.
Kjærsgaard, Poul Søren
2007-01-01
Søgningen til fremmedsprogstudier er faldende, samtidig med at Region Syddanmark har lanceret en plan, der forudsætter et sprogligt beredskab. Hvis regionen skal klare sig i konkurrencen, må den og det regionale universitet handle, så at der er sproguddannelser. Ellers må regionen og universitetet...
Data Handling and Parameter Estimation
Sin, Gürkan; Gernaey, Krist
2016-01-01
literature that are mostly based on the ActivatedSludge Model (ASM) framework and their appropriate extensions (Henze et al., 2000).The chapter presents an overview of the most commonly used methods in the estimation of parameters from experimental batch data, namely: (i) data handling and validation, (ii...
At skabe handling og forandring
2015-01-01
” (Investigation-Vision-Action-Change, på dansk Undersøgelse-Vision-Handling-Forandring). Forskning i anvendelsen af IVAC i pædagogiske udviklingsprojekter i skoler viser, at lærere kan tilpasse IVAC det konkrete sundhedsemne, de beskæftiger sig med, ligesom metoden kan afpasses pensumkravene, klassetrin og...
TNO reticle handling test platform
Crowcombe, W.E.; Hollemans, C.L.; Fritz, E.C.; Donck, J.C.J. van der; Koster, N.B.
2014-01-01
Particle free handling of EUV reticles is a major concern in industry. For reaching economically feasible yield levels, it is reported that Particle-per-Reticle-Pass (PRP) levels should be better than 0.0001 for particles larger than 18 nm. Such cleanliness levels are yet to be reported for current
Bachman, T.; Fischer, M. [Liebherr-Werk Nenzing GmbH (Austria)
2004-01-01
The paper reviews recent bulk handling crane orders from Liebherr. These include mobile harbour cranes at the Port of Dunkirk, a four-rope grab crane at Phu My Port, Vietnam and CBG cranes at Balikpapan Coal Terminal, Indonesia. 4 figs.
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.
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
Norton, Andrew H.
1991-01-01
Local spline approximants offer a means for constructing finite difference formulae for numerical solution of PDEs. These formulae seem particularly well suited to situations in which the use of conventional formulae leads to non-linear computational instability of the time integration. This is explained in terms of frequency responses of the FDF.
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
Approximation by Cylinder Surfaces
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...
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...
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.
Professional Microsoft search fast search, Sharepoint search, and search server
Bennett, Mark; Kehoe, Miles; Voskresenskaya, Natalya
2010-01-01
Use Microsoft's latest search-based technology-FAST search-to plan, customize, and deploy your search solutionFAST is Microsoft's latest intelligent search-based technology that boasts robustness and an ability to integrate business intelligence with Search. This in-depth guide provides you with advanced coverage on FAST search and shows you how to use it to plan, customize, and deploy your search solution, with an emphasis on SharePoint 2010 and Internet-based search solutions.With a particular appeal for anyone responsible for implementing and managing enterprise search, this book presents t
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.
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.
Remote-Handled Low-Level Waste (RHLLW) Disposal Project Code of Record
S.L. Austad, P.E.; L.E. Guillen, P.E.; C. W. McKnight, P.E.; D. S. Ferguson, P.E.
2010-10-01
The Remote-Handled Low-Level Waste Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of fiscal year 2015). Development of a new onsite disposal facility, the highest ranked alternative, will provide necessary remote handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability.
Handling Software Faults with Redundancy
Carzaniga, Antonio; Gorla, Alessandra; Pezzè, Mauro
Software engineering methods can increase the dependability of software systems, and yet some faults escape even the most rigorous and methodical development process. Therefore, to guarantee high levels of reliability in the presence of faults, software systems must be designed to reduce the impact of the failures caused by such faults, for example by deploying techniques to detect and compensate for erroneous runtime conditions. In this chapter, we focus on software techniques to handle software faults, and we survey several such techniques developed in the area of fault tolerance and more recently in the area of autonomic computing. Since practically all techniques exploit some form of redundancy, we consider the impact of redundancy on the software architecture, and we propose a taxonomy centered on the nature and use of redundancy in software systems. The primary utility of this taxonomy is to classify and compare techniques to handle software faults.
Enteral Feeding Set Handling Techniques.
Lyman, Beth; Williams, Maria; Sollazzo, Janet; Hayden, Ashley; Hensley, Pam; Dai, Hongying; Roberts, Cristine
2017-04-01
Enteral nutrition therapy is common practice in pediatric clinical settings. Often patients will receive a pump-assisted bolus feeding over 30 minutes several times per day using the same enteral feeding set (EFS). This study aims to determine the safest and most efficacious way to handle the EFS between feedings. Three EFS handling techniques were compared through simulation for bacterial growth, nursing time, and supply costs: (1) rinsing the EFS with sterile water after each feeding, (2) refrigerating the EFS between feedings, and (3) using a ready-to-hang (RTH) product maintained at room temperature. Cultures were obtained at baseline, hour 12, and hour 21 of the 24-hour cycle. A time-in-motion analysis was conducted and reported in average number of seconds to complete each procedure. Supply costs were inventoried for 1 month comparing the actual usage to our estimated usage. Of 1080 cultures obtained, the overall bacterial growth rate was 8.7%. The rinse and refrigeration techniques displayed similar bacterial growth (11.4% vs 10.3%, P = .63). The RTH technique displayed the least bacterial growth of any method (4.4%, P = .002). The time analysis in minutes showed the rinse method was the most time-consuming (44.8 ± 2.7) vs refrigeration (35.8 ± 2.6) and RTH (31.08 ± 0.6) ( P < .0001). All 3 EFS handling techniques displayed low bacterial growth. RTH was superior in bacterial growth, nursing time, and supply costs. Since not all pediatric formulas are available in RTH, we conclude that refrigerating the EFS between uses is the next most efficacious method for handling the EFS between bolus feeds.
... of this page: https://medlineplus.gov/cloud.html Search Cloud To use the sharing features on this ... of Top 110 zoster vaccine Share the MedlinePlus search cloud with your users by embedding our search ...
Approximation methods in gravitational-radiation theory
Will, C. M.
1986-02-01
The observation of gravitational-radiation damping in the binary pulsar PSR 1913+16 and the ongoing experimental search for gravitational waves of extraterrestrial origin have made the theory of gravitational radiation an active branch of classical general relativity. In calculations of gravitational radiation, approximation methods play a crucial role. The author summarizes recent developments in two areas in which approximations are important: (1) the quadrupole approximation, which determines the energy flux and the radiation reaction forces in weak-field, slow-motion, source-within-the-near-zone systems such as the binary pulsar; and (2) the normal modes of oscillation of black holes, where the Wentzel-Kramers-Brillouin approximation gives accurate estimates of the complex frequencies of the modes.
Chalasani, P.; Saias, I. [Los Alamos National Lab., NM (United States); Jha, S. [Carnegie Mellon Univ., Pittsburgh, PA (United States)
1996-04-08
As increasingly large volumes of sophisticated options (called derivative securities) are traded in world financial markets, determining a fair price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-discounted value of the future cash flow on an n-period stock price path. Path-dependent options are particularly difficult to value since the future cash flow depends on the entire stock price path rather than on just the final stock price. Currently such options are approximately priced by Monte carlo methods with error bounds that hold only with high probability and which are reduced by increasing the number of simulation runs. In this paper the authors show that pricing an arbitrary path-dependent option is {number_sign}-P hard. They show that certain types f path-dependent options can be valued exactly in polynomial time. Asian options are path-dependent options that are particularly hard to price, and for these they design deterministic polynomial-time approximate algorithms. They show that the value of a perpetual American put option (which can be computed in constant time) is in many cases a good approximation to the value of an otherwise identical n-period American put option. In contrast to Monte Carlo methods, the algorithms have guaranteed error bounds that are polynormally small (and in some cases exponentially small) in the maturity n. For the error analysis they derive large-deviation results for random walks that may be of independent interest.
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
Orion Entry Handling Qualities Assessments
Bihari, B.; Tiggers, M.; Strahan, A.; Gonzalez, R.; Sullivan, K.; Stephens, J. P.; Hart, J.; Law, H., III; Bilimoria, K.; Bailey, R.
2011-01-01
The Orion Command Module (CM) is a capsule designed to bring crew back from the International Space Station (ISS), the moon and beyond. The atmospheric entry portion of the flight is deigned to be flown in autopilot mode for nominal situations. However, there exists the possibility for the crew to take over manual control in off-nominal situations. In these instances, the spacecraft must meet specific handling qualities criteria. To address these criteria two separate assessments of the Orion CM s entry Handling Qualities (HQ) were conducted at NASA s Johnson Space Center (JSC) using the Cooper-Harper scale (Cooper & Harper, 1969). These assessments were conducted in the summers of 2008 and 2010 using the Advanced NASA Technology Architecture for Exploration Studies (ANTARES) six degree of freedom, high fidelity Guidance, Navigation, and Control (GN&C) simulation. This paper will address the specifics of the handling qualities criteria, the vehicle configuration, the scenarios flown, the simulation background and setup, crew interfaces and displays, piloting techniques, ratings and crew comments, pre- and post-fight briefings, lessons learned and changes made to improve the overall system performance. The data collection tools, methods, data reduction and output reports will also be discussed. The objective of the 2008 entry HQ assessment was to evaluate the handling qualities of the CM during a lunar skip return. A lunar skip entry case was selected because it was considered the most demanding of all bank control scenarios. Even though skip entry is not planned to be flown manually, it was hypothesized that if a pilot could fly the harder skip entry case, then they could also fly a simpler loads managed or ballistic (constant bank rate command) entry scenario. In addition, with the evaluation set-up of multiple tasks within the entry case, handling qualities ratings collected in the evaluation could be used to assess other scenarios such as the constant bank angle
AN EFFICIENT APPROXIMATE MAXIMUM LIKELIHOOD SIGNAL DETECTION FOR MIMO SYSTEMS
Cao Xuehong
2007-01-01
This paper proposes an efficient approximate Maximum Likelihood (ML) detection method for Multiple-Input Multiple-Output (MIMO) systems, which searches local area instead of exhaustive search and selects valid search points in each transmit antenna signal constellation instead of all hyperplane. Both of the selection and search complexity can be reduced significantly. The method performs the tradeoff between computational complexity and system performance by adjusting the neighborhood size to select the valid search points. Simulation results show that the performance is comparable to that of the ML detection while the complexity is only as the small fraction of ML.
Approximate Bayesian computation.
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.
Approximate Method for Solving the Linear Fuzzy Delay Differential Equations
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.
Roy, Swapnoneel; Thakur, Ashok Kumar
2008-01-01
Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.
Approximation by Cylinder Surfaces
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
2010-01-01
... Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (MARKETING AGREEMENTS AND ORDERS; MISCELLANEOUS COMMODITIES), DEPARTMENT OF AGRICULTURE POTATO RESEARCH AND PROMOTION PLAN Potato Research and Promotion Plan Definitions § 1207.307 Handle. Handle means to grade, pack,...
Proper Handling and Storage of Human Milk
... Breastfeeding Micronutrient Malnutrition State and Local Programs Proper Handling and Storage of Human Milk Recommend on Facebook ... sure to wash your hands before expressing or handling breast milk. When collecting milk, be sure to ...
2010-01-01
... AND ORDERS; MISCELLANEOUS COMMODITIES), DEPARTMENT OF AGRICULTURE COTTON RESEARCH AND PROMOTION Cotton Research and Promotion Order Definitions § 1205.312 Handle. Handle means to harvest, gin, warehouse, compress, purchase, market, transport, or otherwise acquire ownership or control of cotton....
HMSRP Hawaiian Monk Seal Handling Data
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains records for all handling and measurement of Hawaiian monk seals since 1981. Live seals are handled and measured during a variety of events...
2010-01-01
... NEW MEXICO Definitions § 983.14 Handle. Handle means to engage in: (a) Receiving pistachios; (b... of interstate or foreign commerce; and/or (d) Placing pistachios into the current of commerce...
S-Approximation: A New Approach to Algebraic Approximation
M. R. Hooshmandasl
2014-01-01
Full Text Available We intend to study a new class of algebraic approximations, called S-approximations, and their properties. We have shown that S-approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of S-approximations, called Sℳ-approximations, and showed that this subclass preserves most of the properties of inclusion based approximations but is not necessarily inclusionbased. The paper concludes by studying some basic operations on S-approximations and counting the number of S-min functions.
... Tips A to Z Map Search Enter your search term 98 results • Advanced Search Everything News Videos e- ... usda.gov https://www.whatscooking.fns.usda.gov/search/solr-results/im_field_term_program/child-nutrition-cnp-163 We would like ...
Feedstock storage, handling and processing
Egg, R.P.; Coble, C.G.; Engler, C.R. (Texas A and M Univ., College Station, TX (United States). Dept. of Agricultural Engineering); Lewis, D.H. (Texas A and M Univ., College Station, TX (United States). Dept. of Veterinary Microbiology and Parasitology)
1993-01-01
This paper is a review of the technology and research covering components of a methane from biomass system between the field and the digester. It deals primarily with sorghum as a feedstock and focuses on research conducted by the Texas Agricultural Experiment Station. Subjects included in this paper are harvesting, hay storage, ansiling, materials handling, pumping and hydraulic characteristics, hydraulic conductivity, pressure/density relationship, and biological pretreatment. This paper is not a comprehensive design manual; however, design equations and coefficients for sorghum are presented, where available, along with references describing the development and application of design models. (author)
Logik, mening, handling og tale
Widell, Peter
2009-01-01
skal ses i relation til sandheds- og meningstilskrivning, sådan som den finder sted ikke i først og fremmest i sproget, men i tanken, sådan som den åbenbarer sig i instrumentelle handling. Det er på baggrund af denne pragmatisering af logikken, talehandlingsbegrebet skal ses: Først og fremmest som den...... instrumentelle handleverdens møde med den sociale verden i assertivet. Dernæst som assertivets nødvendige udspaltninger i normativet og konstativet. Og endelig som de perlokutionære handlinger kommissiv, direktiv og informativ....
29 CFR 1926.953 - Material handling.
2010-07-01
... 29 Labor 8 2010-07-01 2010-07-01 false Material handling. 1926.953 Section 1926.953 Labor... Material handling. (a) Unloading. Prior to unloading steel, poles, cross arms and similar material, the... employees exist tag lines or other suitable devices shall be used to control loads being handled by hoisting...
2010-10-01
... 50 Wildlife and Fisheries 1 2010-10-01 2010-10-01 false Handling. 14.111 Section 14.111 Wildlife and Fisheries UNITED STATES FISH AND WILDLIFE SERVICE, DEPARTMENT OF THE INTERIOR TAKING, POSSESSION... and Birds to the United States § 14.111 Handling. (a) Care shall be exercised to avoid handling the...
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Handling. 3.118 Section 3.118 Animals... WELFARE STANDARDS Specifications for the Humane Handling, Care, Treatment, and Transportation of Marine Mammals Transportation Standards § 3.118 Handling. (a) Carriers and intermediate handlers moving marine...
7 CFR 985.152 - Handling report.
2010-01-01
... 7 Agriculture 8 2010-01-01 2010-01-01 false Handling report. 985.152 Section 985.152 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements... HANDLING OF SPEARMINT OIL PRODUCED IN THE FAR WEST Administrative Rules and Regulations § 985.152 Handling...
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Handling. 3.142 Section 3.142 Animals... WELFARE STANDARDS Specifications for the Humane Handling, Care, Treatment, and Transportation of... Mammals Transportation Standards § 3.142 Handling. (a) Carriers and intermediate handlers shall move live...
Scheduling of outbound luggage handling at airports
Barth, Torben C.; Pisinger, David
2012-01-01
This article considers the outbound luggage handling problem at airports. The problem is to assign handling facilities to outbound flights and decide about the handling start time. This dynamic, near real-time assignment problem is part of the daily airport operations. Quality, efficiency and rob...
Morville, Peter
2010-01-01
What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
Crutchfield, Christopher; Fineman, Jeremy T; Karger, David R; Scott, Jacob
2008-01-01
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes the expected makespan, which is the expected time at which all jobs complete. Lin and Rajaraman gave the first approximations for this NP-hard problem for the special cases of independent jobs, precedence constraints forming disjoint chains, and precedence constraints forming trees. In this paper, we present asymptotically better approximation algorithms. In particular, we give an O(loglog min(m,n))-approximation for indep...
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.
Transfer Area Mechanical Handling Calculation
B. Dianda
2004-06-23
This calculation is intended to support the License Application (LA) submittal of December 2004, in accordance with the directive given by DOE correspondence received on the 27th of January 2004 entitled: ''Authorization for Bechtel SAX Company L.L. C. to Include a Bare Fuel Handling Facility and Increased Aging Capacity in the License Application, Contract Number DE-AC28-01R W12101'' (Arthur, W.J., I11 2004). This correspondence was appended by further Correspondence received on the 19th of February 2004 entitled: ''Technical Direction to Bechtel SAIC Company L.L. C. for Surface Facility Improvements, Contract Number DE-AC28-OIRW12101; TDL No. 04-024'' (BSC 2004a). These documents give the authorization for a Fuel Handling Facility to be included in the baseline. The purpose of this calculation is to establish preliminary bounding equipment envelopes and weights for the Fuel Handling Facility (FHF) transfer areas equipment. This calculation provides preliminary information only to support development of facility layouts and preliminary load calculations. The limitations of this preliminary calculation lie within the assumptions of section 5 , as this calculation is part of an evolutionary design process. It is intended that this calculation is superseded as the design advances to reflect information necessary to support License Application. The design choices outlined within this calculation represent a demonstration of feasibility and may or may not be included in the completed design. This calculation provides preliminary weight, dimensional envelope, and equipment position in building for the purposes of defining interface variables. This calculation identifies and sizes major equipment and assemblies that dictate overall equipment dimensions and facility interfaces. Sizing of components is based on the selection of commercially available products, where applicable. This is not a specific recommendation for the future use
MPI Debugging with Handle Introspection
Brock-Nannestad, Laust; DelSignore, John; Squyres, Jeffrey M.;
The Message Passing Interface, MPI, is the standard programming model for high performance computing clusters. However, debugging applications on large scale clusters is difficult. The widely used Message Queue Dumping interface enables inspection of message queue state but there is no general...... interface for extracting information from MPI objects such as communicators. A developer can debug the MPI library as if it was part of the application, but this exposes an unneeded level of detail. The Tools Working Group in the MPI Forum has proposed a specification for MPI Handle Introspection....... It defines a standard interface that lets debuggers extract information from MPI objects. Extracted information is then presented to the developer, in a human readable format. The interface is designed to be independent of MPI implementations and debuggers. In this paper, we describe our support...
Liberalisation of municipal waste handling
Busck, Ole Gunni
2006-01-01
of price reductions in stead of quality demands in both environmental and working environmental terms. A recent study showed major deficits in the capacities of the municipalities to administer qualitative requirements in the tender process and to manage the contracts as an integral part of a scheme...... for improved performance of municipal waste management. The study stresses the need for training and guidance of municipal administrators. Highlighting ‘best practice’ examples the study shows, however, that it is perfectly possible to end up with quality service on contract. It takes a mixture of careful......Liberalisation of municipal waste handling: How are sustainable practices pursued? In the process of liberalization of public services in Europe contracting out the collection of municipal waste has surged. Research in Denmark has shown that municipalities in general have pursued a narrow policy...
Operators of Approximations and Approximate Power Set Spaces
ZHANG Xian-yong; MO Zhi-wen; SHU Lan
2004-01-01
Boundary inner and outer operators are introduced; and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.
AUTHOR|(SzGeCERN)749939
2015-01-01
As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.
Schrijvers, Tom; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J
2012-01-01
The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the...
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...
Toet, A.; Bijl, P.
2003-01-01
Visual search, with or without the aid of optical or electro-optical instruments, plays a significant role in various types of military and civilian operations (e.g., reconnaissance, surveillance, and search and rescue). Advance knowledge of human visual search and target acquisition performance is
The Electroweak Sudakov approximation in SHERPA
Thompson, Jennifer M
2016-01-01
As experimental particle physics becomes more and more precise, it is becoming increasingly important for Monte Carlo simulations to improve the precision of their predictions. In terms of the hard matrix element, this means calculating to a higher order in perturbation theory. To be consistent this requires both NNLO QCD corrections and NLO EW corrections to be included. There are also interference effects between these processes that are not simple to handle consistently. For a broad description of the behaviour of NLO EW corrections at high energies, the Sudakov logarithmic approach provides a good approximation, and is much less computationally expensive than the full calculation. The implementation of EW Sudakov logarithms within the SHERPA program are outlined here along with some initial results. As well as this, an overview of the status of full NLO EW computations with SHERPA is presented.
Ergonomics: safe patient handling and mobility.
Hallmark, Beth; Mechan, Patricia; Shores, Lynne
2015-03-01
This article reviews and investigates the issues surrounding ergonomics, with a specific focus on safe patient handling and mobility. The health care worker of today faces many challenges, one of which is related to the safety of patients. Safe patient handling and mobility is on the forefront of the movement to improve patient safety. This article reviews the risks associated with patient handling and mobility, and informs the reader of current evidence-based practice relevant to this area of care.
Enclosure for handling high activity materials
Jimeno de Osso, F.
1977-07-01
One of the most important problems that are met at the laboratories producing and handling radioisotopes is that of designing, building and operating enclosures suitable for the safe handling of active substances. With this purpose in mind, an enclosure has been designed and built for handling moderately high activities under a shielding made of 150 mm thick lead. In this report a description is given of those aspects that may be of interest to people working in this field. (Author)
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.
Ergonomic handle for an arthroscopic cutter.
Tuijthof; van Engelen; Herder; Goossens; Snijders; van Dijk
2003-03-01
From an analysis of the routinely performed meniscectomy procedures, it was concluded that a punch with a side-ways steerable tip would improve the reachability of meniscal tissue. This potentially leads to a safer and more efficient meniscectomy. Furthermore, the current scissors handles of arthroscopic punches are ergonomically not sufficient. An ergonomic handle is designed with one lever that enables opening and closing of the instrument tip, and side-ways steering of the instrument tip. The design of the handle complies with ergonomic guidelines that were found in the literature. A model of the instrument tip was added to the new handle for comparison with conventional handles. Experiments were performed with a knee joint model, using objective and subjective criteria. The results show that the concept of a side-ways steerable punch is promising, since faster task times are achieved without increasing the risk of damaging healthy tissue. The current design of the ergonomic handle incorporates two degrees of freedom in an intuitive way, the handle is more comfortable to hold, and easy to control. The external memory capabilities of the new handle could be improved. Further development of this handle and the addition of a sufficient instrument tip and force transmission are recommended.
Nonlinear Approximation Using Gaussian Kernels
Hangelbroek, Thomas
2009-01-01
It is well-known that non-linear approximation has an advantage over linear schemes in the sense that it provides comparable approximation rates to those of the linear schemes, but to a larger class of approximands. This was established for spline approximations and for wavelet approximations, and more recently for homogeneous radial basis function (surface spline) approximations. However, no such results are known for the Gaussian function. The crux of the difficulty lies in the necessity to vary the tension parameter in the Gaussian function spatially according to local information about the approximand: error analysis of Gaussian approximation schemes with varying tension are, by and large, an elusive target for approximators. We introduce and analyze in this paper a new algorithm for approximating functions using translates of Gaussian functions with varying tension parameters. Our scheme is sophisticated to a degree that it employs even locally Gaussians with varying tensions, and that it resolves local ...
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.
Approximation by Multivariate Singular Integrals
Anastassiou, George A
2011-01-01
Approximation by Multivariate Singular Integrals is the first monograph to illustrate the approximation of multivariate singular integrals to the identity-unit operator. The basic approximation properties of the general multivariate singular integral operators is presented quantitatively, particularly special cases such as the multivariate Picard, Gauss-Weierstrass, Poisson-Cauchy and trigonometric singular integral operators are examined thoroughly. This book studies the rate of convergence of these operators to the unit operator as well as the related simultaneous approximation. The last cha
Hagedorn, Claudia; Baiker, Armin; Postberg, Jan; Ehrhardt, Anja; Lipps, Hans J
2012-06-01
Nonviral episomal vectors represent attractive alternatives to currently used virus-based expression systems. In the late 1990s, it was shown that a plasmid containing an expression cassette linked to a scaffold/matrix attached region (S/MAR) replicates as a low copy number episome in all cell lines tested, as well as primary cells, and can be used for the genetic modification of higher animals. Once established in the cell, the S/MAR vector replicates early during S-phase and, in the absence of selection, is stably retained in the cells for an unlimited period of time. This vector can therefore be regarded as a minimal model system for studying the epigenetic regulation of replication and functional nuclear architecture. In theory, this construct represents an almost "ideal" expression system for gene therapy. In practice, S/MAR-based vectors stably modify mammalian cells with efficiencies far below those of virus-based constructs. Consequently, they have not yet found application in gene therapy trials. Furthermore, S/MAR vector systems are not trivial to handle and several critical technical issues have to be considered when modifying these vectors for various applications.
Next Generation Search Interfaces
Roby, W.; Wu, X.; Ly, L.; Goldina, T.
2015-09-01
Astronomers are constantly looking for easier ways to access multiple data sets. While much effort is spent on VO, little thought is given to the types of User Interfaces we need to effectively search this sort of data. For instance, an astronomer might need to search Spitzer, WISE, and 2MASS catalogs and images then see the results presented together in one UI. Moving seamlessly between data sets is key to presenting integrated results. Results need to be viewed using first class, web based, integrated FITS viewers, XY Plots, and advanced table display tools. These components should be able to handle very large datasets. To make a powerful Web based UI that can manage and present multiple searches to the user requires taking advantage of many HTML5 features. AJAX is used to start searches and present results. Push notifications (Server Sent Events) monitor background jobs. Canvas is required for advanced result displays. Lesser known CSS3 technologies makes it all flow seamlessly together. At IPAC, we have been developing our Firefly toolkit for several years. We are now using it to solve this multiple data set, multiple queries, and integrated presentation problem to create a powerful research experience. Firefly was created in IRSA, the NASA/IPAC Infrared Science Archive (http://irsa.ipac.caltech.edu). Firefly is the core for applications serving many project archives, including Spitzer, Planck, WISE, PTF, LSST and others. It is also used in IRSA's new Finder Chart and catalog and image displays.
Approximations of fractional Brownian motion
Li, Yuqiang; 10.3150/10-BEJ319
2012-01-01
Approximations of fractional Brownian motion using Poisson processes whose parameter sets have the same dimensions as the approximated processes have been studied in the literature. In this paper, a special approximation to the one-parameter fractional Brownian motion is constructed using a two-parameter Poisson process. The proof involves the tightness and identification of finite-dimensional distributions.
Approximation by planar elastic curves
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 optimization is then used to find the approximating elastic curve....
Maurin, Adrian Llopart; Ravn, Ole; Andersen, Nils Axel
2017-01-01
In this paper we present a new method that robustly identifies doors, cabinets and their respective handles, with special emphasis on extracting useful features from handles to be then manipulated. The novelty of this system relies on the combination of a Convolutional Neural Net (CNN), as a form...... of reducing the search space, several methods to extract point cloud data and a mobile robot to interact with the objects. The framework consists of the following components: The implementation of a CNN to extract a Region of Interest (ROI) from an image corresponding to a door or cabinet. Several vision...... based techniques to detect handles inside the ROI and its 3D positioning. A complementary plane segmentation method to differentiate door/cabinet from the handle. An algorithm to fuse both approaches robustly and extract essential information from the handle for robotic grasping (i.e. handle point cloud...
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
Space-Time Approximation with Sparse Grids
Griebel, M; Oeltz, D; Vassilevski, P S
2005-04-14
In this article we introduce approximation spaces for parabolic problems which are based on the tensor product construction of a multiscale basis in space and a multiscale basis in time. Proper truncation then leads to so-called space-time sparse grid spaces. For a uniform discretization of the spatial space of dimension d with O(N{sup d}) degrees of freedom, these spaces involve for d > 1 also only O(N{sup d}) degrees of freedom for the discretization of the whole space-time problem. But they provide the same approximation rate as classical space-time Finite Element spaces which need O(N{sup d+1}) degrees of freedoms. This makes these approximation spaces well suited for conventional parabolic and for time-dependent optimization problems. We analyze the approximation properties and the dimension of these sparse grid space-time spaces for general stable multiscale bases. We then restrict ourselves to an interpolatory multiscale basis, i.e. a hierarchical basis. Here, to be able to handle also complicated spatial domains {Omega}, we construct the hierarchical basis from a given spatial Finite Element basis as follows: First we determine coarse grid points recursively over the levels by the coarsening step of the algebraic multigrid method. Then, we derive interpolatory prolongation operators between the respective coarse and fine grid points by a least squares approach. This way we obtain an algebraic hierarchical basis for the spatial domain which we then use in our space-time sparse grid approach. We give numerical results on the convergence rate of the interpolation error of these spaces for various space-time problems with two spatial dimensions. Also implementational issues, data structures and questions of adaptivity are addressed to some extent.
Search and Rescue Plan: Swan Lake National Wildlife Refuge
US Fish and Wildlife Service, Department of the Interior — This plan will provide guidance to help efficiently handle a search and rescue (SAR) operation on Swan Lake National Wildlife Refuge. The purpose of this plan is to...
Approximated solutions to Born-Infeld dynamics
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.
Preliminary Hazard Analysis for the Remote-Handled Low-Level Waste Disposal Facility
Lisa Harvego; Mike Lehto
2010-02-01
The need for remote handled low level waste (LLW) disposal capability has been identified. A new onsite, remote-handled LLW disposal facility has been identified as the highest ranked alternative for providing continued, uninterrupted remote-handled LLW disposal capability for remote-handled LLW that is generated as part of the nuclear mission of the Idaho National Laboratory and from spent nuclear fuel processing activities at the Naval Reactors Facility. Historically, this type of waste has been disposed of at the Radioactive Waste Management Complex. Disposal of remote-handled LLW in concrete disposal vaults at the Radioactive Waste Management Complex will continue until the facility is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). This document supports the conceptual design for the proposed remote-handled LLW disposal facility by providing an initial nuclear facility hazard categorization and by identifying potential hazards for processes associated with onsite handling and disposal of remote-handled LLW.
Preliminary Hazard Analysis for the Remote-Handled Low-Level Waste Disposal Project
Lisa Harvego; Mike Lehto
2010-10-01
The need for remote handled low level waste (LLW) disposal capability has been identified. A new onsite, remote-handled LLW disposal facility has been identified as the highest ranked alternative for providing continued, uninterrupted remote-handled LLW disposal capability for remote-handled LLW that is generated as part of the nuclear mission of the Idaho National Laboratory and from spent nuclear fuel processing activities at the Naval Reactors Facility. Historically, this type of waste has been disposed of at the Radioactive Waste Management Complex. Disposal of remote-handled LLW in concrete disposal vaults at the Radioactive Waste Management Complex will continue until the facility is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). This document supports the conceptual design for the proposed remote-handled LLW disposal facility by providing an initial nuclear facility hazard categorization and by identifying potential hazards for processes associated with onsite handling and disposal of remote-handled LLW.
Research on Event Handling Models of Java
WU Yue; WU Jing; ZHOU Ming-tian
2004-01-01
A new event-handling paradigm and its application model are proposed. The working mechanism and principle of event listener model is given in detail. Finally, the launching event mechanisms,the choosing event handling models and the dispatching mechanism are illustrated.
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Handling. 3.19 Section 3.19 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE STANDARDS Specifications for the Humane Handling, Care, Treatment, and Transportation of Dogs...
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Handling. 3.41 Section 3.41 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE STANDARDS Specifications for the Humane Handling, Care, Treatment, and Transportation of...
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Handling. 3.92 Section 3.92 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE STANDARDS Specifications for the Humane Handling, Care, Treatment, and Transportation of...
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Handling. 3.66 Section 3.66 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE STANDARDS Specifications for the Humane Handling, Care, Treatment and Transportation of...
29 CFR 1917.18 - Log handling.
2010-07-01
... 29 Labor 7 2010-07-01 2010-07-01 false Log handling. 1917.18 Section 1917.18 Labor Regulations...) MARINE TERMINALS Marine Terminal Operations § 1917.18 Log handling. (a) The employer shall ensure that structures (bunks) used to contain logs have rounded corners and rounded structural parts to avoid...
38 CFR 1.660 - Expeditious handling.
2010-07-01
... 38 Pensions, Bonuses, and Veterans' Relief 1 2010-07-01 2010-07-01 false Expeditious handling. 1.660 Section 1.660 Pensions, Bonuses, and Veterans' Relief DEPARTMENT OF VETERANS AFFAIRS GENERAL PROVISIONS Inventions by Employees of Department of Veterans Affairs § 1.660 Expeditious handling. No patent...
30 CFR 715.16 - Topsoil handling.
2010-07-01
... 30 Mineral Resources 3 2010-07-01 2010-07-01 false Topsoil handling. 715.16 Section 715.16 Mineral Resources OFFICE OF SURFACE MINING RECLAMATION AND ENFORCEMENT, DEPARTMENT OF THE INTERIOR INITIAL PROGRAM REGULATIONS GENERAL PERFORMANCE STANDARDS § 715.16 Topsoil handling. To prevent topsoil from being...
2010-01-01
... AND ORDERS; MISCELLANEOUS COMMODITIES), DEPARTMENT OF AGRICULTURE HASS AVOCADO PROMOTION, RESEARCH, AND INFORMATION Hass Avocado Promotion, Research, and Information Order Definitions § 1219.11 Handle. Handle means to pack, process, transport, purchase, or in any other way to place or cause Hass...
Information Handling, Organizational Structure, and Power.
Buckland, Michael K.
1989-01-01
Uses examples from military strategic communications to demonstrate that organizational structures and the distribution of power within organizational structures adapt to changes in information handling capability. It is concluded that delegation and decentralization can be viewed as indicative of inadequate information handling and that improved…
Storage and Handling of Commercially Packaged Foods
Villalba, Abigail; Boyer, Renee Raiden; Bazemore, Sherry
2005-01-01
Proper selection of foods at the grocery store and appropriate storage and handling practices at home are necessary to maintain the quality and safety of commercially processed foods and perishable foods. This brochure offers some guidelines to follow when buying, handling, and storing packaged foods.
Material Handling Equipment Evaluation for Crater Repair
2016-11-01
material handling equipment with a reduced logistical footprint for use by crater repair teams in airfield damage repair (ADR) scenarios. A market ...compared to currently utilized material handling equipment. This report presents the results of the market survey and equipment evaluations. Results...1 1.2 Objective and scope
Feasibility of Upper Port Plug tube handling
Koning, J.F.; Elzendoorn, B.S.Q.; Ronden, D.M.S.; Klinkhamer, J.F.F.; Biel, W.; Krasikov, Y.; Walker, C.I.
2011-01-01
Central, retractable tubes are proposed in several Upper Port Plugs (UPPs) designs for ITER, to enable fast exchange of specific components of diagnostics housed in these UPPs. This paper investigates into possible designs to enable the efficient handling of tubes. The feasibility of tube handling i
7 CFR 765.151 - Handling payments.
2010-01-01
... 7 Agriculture 7 2010-01-01 2010-01-01 false Handling payments. 765.151 Section 765.151 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS DIRECT LOAN SERVICING-REGULAR Borrower Payments § 765.151 Handling payments. (a) Borrower...
Reducing Mouse Anxiety during Handling: Effect of Experience with Handling Tunnels
Kelly Gouveia; Hurst, Jane L.
2013-01-01
Handling stress is a well-recognised source of variation in animal studies that can also compromise the welfare of research animals. To reduce background variation and maximise welfare, methods that minimise handling stress should be developed and used wherever possible. Recent evidence has shown that handling mice by a familiar tunnel that is present in their home cage can minimise anxiety compared with standard tail handling. As yet, it is unclear whether a tunnel is required in each home c...
Healthcare complaints handling systems: a comparison between Britain, Australia and Taiwan.
Hsieh, Sophie Yahui
2011-05-01
This paper explores the health care complaints handling reforms enacted in Britain, Australia and Taiwan. A documentary search for policy documents, reports and studies related to the reforms of the health care complaints handling system was conducted. A keyword search was performed within PubMed and ProQuest for the period 1985-2009 to identify relevant articles. The study found that the major difference in health care complaints handling systems between countries, is the mechanism for running a complaints system. Both Britain and Australia have attempted to incorporate patient complaints into their national quality systems. Their intention was to set up mechanisms to create an effective bridge, at a national policy level, between the patient complaints management system and the quality management system.
Tunkelang, Daniel
2009-01-01
We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more
BDD Minimization for Approximate Computing
Soeken, Mathias; Grosse, Daniel; Chandrasekharan, Arun; Drechsler, Rolf
2016-01-01
We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representation but meets a threshold w.r.t. an error metric. We present operators to derive approximated functions and present algorithms to exactly compute the error metrics directly on the BDD representation. An experimental evaluation demonstrates the app...
Tree wavelet approximations with applications
XU Yuesheng; ZOU Qingsong
2005-01-01
We construct a tree wavelet approximation by using a constructive greedy scheme(CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.
Clark, I.C; Hancox, M
2012-01-01
... --Turning and manoeuvring modern anchor handling vessels --The AHTS design and towing operations --The dangers of very high speed loads during deep water anchor handling operations --The dangers...
How the NWC handles software as product
Vinson, D.
1997-11-01
This tutorial provides a hands-on view of how the Nuclear Weapons Complex project should be handling (or planning to handle) software as a product in response to Engineering Procedure 401099. The SQAS has published the document SQAS96-002, Guidelines for NWC Processes for Handling Software Product, that will be the basis for the tutorial. The primary scope of the tutorial is on software products that result from weapons and weapons-related projects, although the information presented is applicable to many software projects. Processes that involve the exchange, review, or evaluation of software product between or among NWC sites, DOE, and external customers will be described.
Handling of bulk solids theory and practice
Shamlou, P A
1990-01-01
Handling of Bulk Solids provides a comprehensive discussion of the field of solids flow and handling in the process industries. Presentation of the subject follows classical lines of separate discussions for each topic, so each chapter is self-contained and can be read on its own. Topics discussed include bulk solids flow and handling properties; pressure profiles in bulk solids storage vessels; the design of storage silos for reliable discharge of bulk materials; gravity flow of particulate materials from storage vessels; pneumatic transportation of bulk solids; and the hazards of solid-mater
Reducing mouse anxiety during handling: effect of experience with handling tunnels.
Gouveia, Kelly; Hurst, Jane L
2013-01-01
Handling stress is a well-recognised source of variation in animal studies that can also compromise the welfare of research animals. To reduce background variation and maximise welfare, methods that minimise handling stress should be developed and used wherever possible. Recent evidence has shown that handling mice by a familiar tunnel that is present in their home cage can minimise anxiety compared with standard tail handling. As yet, it is unclear whether a tunnel is required in each home cage to improve response to handling. We investigated the influence of prior experience with home tunnels among two common strains of laboratory mice: ICR(CD-1) and C57BL/6. We compared willingness to approach the handler and anxiety in an elevated plus maze test among mice picked up by the tail, by a home cage tunnel or by an external tunnel shared between cages. Willingness to interact with the handler was much greater for mice handled by a tunnel, even when this was unfamiliar, compared to mice picked up by the tail. Once habituated to handling, C57BL/6 mice were most interactive towards a familiar home tunnel, whereas the ICR strain showed strong interaction with all tunnel handling regardless of any experience of a home cage tunnel. Mice handled by a home cage or external tunnel showed less anxiety in an elevated plus maze than those picked up by the tail. This study shows that using a tunnel for routine handling reduces anxiety among mice compared to tail handling regardless of prior familiarity with tunnels. However, as home cage tunnels can further improve response to handling in some mice, we recommend that mice are handled with a tunnel provided in their home cage where possible as a simple practical method to minimise handling stress.
Diophantine approximation and automorphic spectrum
Ghosh, Anish; Nevo, Amos
2010-01-01
The present paper establishes qunatitative estimates on the rate of diophantine approximation in homogeneous varieties of semisimple algebraic groups. The estimates established generalize and improve previous ones, and are sharp in a number of cases. We show that the rate of diophantine approximation is controlled by the spectrum of the automorphic representation, and is thus subject to the generalised Ramanujan conjectures.
Some results in Diophantine approximation
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...
Beyond the random phase approximation
Olsen, Thomas; Thygesen, Kristian S.
2013-01-01
We assess the performance of a recently proposed renormalized adiabatic local density approximation (rALDA) for ab initio calculations of electronic correlation energies in solids and molecules. The method is an extension of the random phase approximation (RPA) derived from time-dependent density...
Uniform approximation by (quantum) polynomials
Drucker, A.; de Wolf, R.
2011-01-01
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectivel
Global approximation of convex functions
Azagra, D
2011-01-01
We show that for every (not necessarily bounded) open convex subset $U$ of $\\R^n$, every (not necessarily Lipschitz or strongly) convex function $f:U\\to\\R$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and $C^k$ smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on $\\R^n$ by strongly convex functions.
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-08-18
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-12-22
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.
Sample Handling in Extreme Environments
Avellar, Louisa; Badescu, Mircea; Sherrit, Stewart; Bar-Cohen, Yoseph
2013-01-01
Harsh environments, such as that on Venus, preclude the use of existing equipment for functions that involve interaction with the environment. The operating limitations of current high temperature electronics are well below the actual temperature and pressure found on Venus (460 deg C and 92 atm), so proposed lander configurations typically include a pressure vessel where the science instruments are kept at Earth-like temperature and pressure (25 deg C and 1 atm). The purpose of this project was to develop and demonstrate a method for sample transfer from an external drill to internal science instruments for a lander on Venus. The initial concepts were string and pneumatically driven systems; and the latter system was selected for its ability to deliver samples at very high speed. The pneumatic system was conceived to be driven by the pressure difference between the Venusian atmosphere and the inside of the lander. The pneumatic transfer of a small capsule was demonstrated, and velocity data was collected from the lab experiment. The sample transfer system was modeled using CAD software and prototyped using 3D printing. General structural and thermal analyses were performed to approximate the proposed system's mass and effects on the temperature and pressure inside of the lander. Additionally, a sampler breadboard for use on Titan was tested and functionality problems were resolved.
Sample Handling in Extreme Environments
Avellar, Louisa; Badescu, Mircea; Sherrit, Stewart; Bar-Cohen, Yoseph
2013-01-01
Harsh environments, such as that on Venus, preclude the use of existing equipment for functions that involve interaction with the environment. The operating limitations of current high temperature electronics are well below the actual temperature and pressure found on Venus (460 deg C and 92 atm), so proposed lander configurations typically include a pressure vessel where the science instruments are kept at Earth-like temperature and pressure (25 deg C and 1 atm). The purpose of this project was to develop and demonstrate a method for sample transfer from an external drill to internal science instruments for a lander on Venus. The initial concepts were string and pneumatically driven systems; and the latter system was selected for its ability to deliver samples at very high speed. The pneumatic system was conceived to be driven by the pressure difference between the Venusian atmosphere and the inside of the lander. The pneumatic transfer of a small capsule was demonstrated, and velocity data was collected from the lab experiment. The sample transfer system was modeled using CAD software and prototyped using 3D printing. General structural and thermal analyses were performed to approximate the proposed system's mass and effects on the temperature and pressure inside of the lander. Additionally, a sampler breadboard for use on Titan was tested and functionality problems were resolved.
Management of transport and handling contracts
Rühl, I
2004-01-01
This paper shall outline the content, application and management strategies for the various contracts related to transport and handling activities. In total, the two sections Logistics and Handling Maintenance are in charge of 27 (!) contracts ranging from small supply contracts to big industrial support contracts. The activities as well as the contracts can generally be divided into four main topics "Vehicle Fleet Management"; "Supply, Installation and Commissioning of Lifting and Hoisting Equipment"; "Equipment Maintenance" and "Industrial Support for Transport and Handling". Each activity and contract requires different approaches and permanent adaptation to the often changing CERN's requirements. In particular, the management and the difficulties experienced with the contracts E072 "Maintenance of lifting and hoisting equipment", F420 "Supply of seven overhead traveling cranes for LHC" and S090/S103 "Industrial support for transport and handling" will be explained in detail.
Handling knowledge on osteoporosis - a qualitative study
Nielsen, Dorthe; Huniche, Lotte; Brixen, Kim
2013-01-01
Scand J Caring Sci; 2012 Handling knowledge on osteoporosis - a qualitative study The aim of this qualitative study was to increase understanding of the importance of osteoporosis information and knowledge for patients' ways of handling osteoporosis in their everyday lives. Interviews were...... performed with 14 patients recruited from two English university hospitals and 12 patients from a Danish university hospital. Critical psychology was used as a theoretical framework for the data analysis, which aimed at shedding light on patients' ways of conducting everyday life with osteoporosis....... The themes that emerged from the analysis showed that life conditions influenced the way in which risk, pain and osteoporosis were handled. Everyday life was also influenced by patients' attitude to treatment. The patients who were experiencing emotional difficulties in handling osteoporosis were not those...
Live-trapping and handling brown bear
US Fish and Wildlife Service, Department of the Interior — This paper reports techniques developed to live trap and handle brown bears on the Kodiak National Wildlife Refuge. The brown bears (Ursus middendorffi) on the...
Aerobot Sampling and Handling System Project
National Aeronautics and Space Administration — Honeybee Robotics proposes to: ?Derive and document the functional and technical requirements for Aerobot surface sampling and sample handling across a range of...
2010-01-01
... the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE DATA COLLECTION, REPORTING AND RECORDKEEPING REQUIREMENTS APPLICABLE TO CRANBERRIES NOT SUBJECT TO THE CRANBERRY MARKETING ORDER § 926.9 Handle....
GeoLab Sample Handling System Project
National Aeronautics and Space Administration — Develop a robotic sample handling/ manipulator system for the GeoLab glovebox. This work leverages from earlier GeoLab work and a 2012 collaboration with a...
Project Execution Plan for the Remote Handled Low-Level Waste Disposal Project
Danny Anderson
2014-07-01
As part of ongoing cleanup activities at the Idaho National Laboratory (INL), closure of the Radioactive Waste Management Complex (RWMC) is proceeding under the Comprehensive Environmental Response, Compensation, and Liability Act (42 USC 9601 et seq. 1980). INL-generated radioactive waste has been disposed of at RWMC since 1952. The Subsurface Disposal Area (SDA) at RWMC accepted the bulk of INL’s contact and remote-handled low-level waste (LLW) for disposal. Disposal of contact-handled LLW and remote-handled LLW ion-exchange resins from the Advanced Test Reactor in the open pit of the SDA ceased September 30, 2008. Disposal of remote-handled LLW in concrete disposal vaults at RWMC will continue until the facility is full or until it must be closed in preparation for final remediation of the SDA (approximately at the end of fiscal year FY 2017). The continuing nuclear mission of INL, associated ongoing and planned operations, and Naval spent fuel activities at the Naval Reactors Facility (NRF) require continued capability to appropriately dispose of contact and remote handled LLW. A programmatic analysis of disposal alternatives for contact and remote-handled LLW generated at INL was conducted by the INL contractor in Fiscal Year 2006; subsequent evaluations were completed in Fiscal Year 2007. The result of these analyses was a recommendation to the Department of Energy (DOE) that all contact-handled LLW generated after September 30, 2008, be disposed offsite, and that DOE proceed with a capital project to establish replacement remote-handled LLW disposal capability. An analysis of the alternatives for providing replacement remote-handled LLW disposal capability has been performed to support Critical Decision-1. The highest ranked alternative to provide this required capability has been determined to be the development of a new onsite remote-handled LLW disposal facility to replace the existing remote-handled LLW disposal vaults at the SDA. Several offsite DOE
Luciana C. C. B. Silva
2013-06-01
Full Text Available BACKGROUND: The handling of materials, which occurs in the industrial sector, is associated with lesions on the lumbar spine and in the upper limbs. Inserting handles in industrial boxes is a way to reduce work-related risks. Although the position and angle of the handles are significant factors in comfort and safety during handling, these factors have rarely been studied objectively. OBJECTIVE: To compare the handling of a commercial box and prototypes with handles and to evaluate the effects on upper limb posture, muscle electrical activity, and perceived acceptability using different grips while handling materials from different heights. METHOD: Thirty-seven healthy volunteers evaluated the handles of prototypes that allowed for changes in position (top and bottom and angle (0°, 15°, and 30°. Wrist, elbow, and shoulder movements were evaluated using electrogoniometry and inclinometry. The muscle electrical activity in the wrist extensors, biceps brachii, and the upper portion of the trapezius was measured using a portable electromyographer. The recorded data on muscle movements and electrical activity were synchronized. Subjective evaluations of acceptability were evaluated using a visual analog scale. RESULTS AND CONCLUSIONS: The prototypes with handles at a 30° angle produced the highest acceptability ratings, more neutral wrist positions, lower levels of electromyographic activity for the upper trapezius, and lower elevation angles for the arms. The different measurement methods were complementary in evaluating the upper limbs during handling.
Development of standard components for remote handling
Taguchi, Kou; Kakudate, Satoshi; Nakahira, Masataka; Ito, Akira [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment
1998-04-01
The core of Fusion Experimental Reactor consists of various components such as superconducting magnets and forced-cooled in-vessel components, which are remotely maintained due to intense of gamma radiation. Mechanical connectors such as cooling pipe connections, insulation joints and electrical connectors are commonly used for maintenance of these components and have to be standardized in terms of remote handling. This paper describes these mechanical connectors developed as the standard component compatible with remote handling and tolerable for radiation. (author)
Safety Training: "Manual Handling" course in September
Safety Training, HSE Unit
2016-01-01
The next "Manual Handling" course will be given, in French, on 26 September 2016. This course is designed for anyone required to carry out manual handling of loads in the course of their work. The main objective of this course is to adopt and apply the basic principles of physical safety and economy of effort. There are places available. If you are interested in following this course, please fill an EDH training request via our catalogue.
Preliminary Safety Design Report for Remote Handled Low-Level Waste Disposal Facility
Timothy Solack; Carol Mason
2012-03-01
A new onsite, remote-handled low-level waste disposal facility has been identified as the highest ranked alternative for providing continued, uninterrupted remote-handled low-level waste disposal for remote-handled low-level waste from the Idaho National Laboratory and for nuclear fuel processing activities at the Naval Reactors Facility. Historically, this type of waste has been disposed of at the Radioactive Waste Management Complex. Disposal of remote-handled low-level waste in concrete disposal vaults at the Radioactive Waste Management Complex will continue until the facility is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). This preliminary safety design report supports the design of a proposed onsite remote-handled low-level waste disposal facility by providing an initial nuclear facility hazard categorization, by discussing site characteristics that impact accident analysis, by providing the facility and process information necessary to support the hazard analysis, by identifying and evaluating potential hazards for processes associated with onsite handling and disposal of remote-handled low-level waste, and by discussing the need for safety features that will become part of the facility design.
Conceptual Safety Design Report for the Remote Handled Low-Level Waste Disposal Facility
Boyd D. Christensen
2010-02-01
A new onsite, remote-handled LLW disposal facility has been identified as the highest ranked alternative for providing continued, uninterrupted remote-handled LLW disposal for remote-handled LLW from the Idaho National Laboratory and for spent nuclear fuel processing activities at the Naval Reactors Facility. Historically, this type of waste has been disposed of at the Radioactive Waste Management Complex. Disposal of remote-handled LLW in concrete disposal vaults at the Radioactive Waste Management Complex will continue until the facility is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). This conceptual safety design report supports the design of a proposed onsite remote-handled LLW disposal facility by providing an initial nuclear facility hazard categorization, by identifying potential hazards for processes associated with onsite handling and disposal of remote-handled LLW, by evaluating consequences of postulated accidents, and by discussing the need for safety features that will become part of the facility design.
Remote-Handled Low-Level Waste Disposal Project Code of Record
S.L. Austad, P.E.; L.E. Guillen, P.E.; C. W. McKnight, P.E.; D. S. Ferguson, P.E.
2012-06-01
The Remote-Handled Low-Level Waste (LLW) Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). Development of a new onsite disposal facility will provide necessary remote-handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability. The report is owned by the Design Authority, who can authorize revisions and exceptions. This report will be retained for the lifetime of the facility.
Remote-Handled Low-Level Waste Disposal Project Code of Record
S.L. Austad, P.E.; L.E. Guillen, P.E.; C. W. McKnight, P.E.; D. S. Ferguson, P.E.
2012-04-01
The Remote-Handled Low-Level Waste (LLW) Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). Development of a new onsite disposal facility will provide necessary remote-handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability. The report is owned by the Design Authority, who can authorize revisions and exceptions. This report will be retained for the lifetime of the facility.
Remote-Handled Low-Level Waste Disposal Project Code of Record
Austad, S. L. [Idaho National Lab. (INL), Idaho Falls, ID (United States); Guillen, L. E. [Idaho National Lab. (INL), Idaho Falls, ID (United States); McKnight, C. W. [Idaho National Lab. (INL), Idaho Falls, ID (United States); Ferguson, D. S. [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2015-04-01
The Remote-Handled Low-Level Waste (LLW) Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). Development of a new onsite disposal facility will provide necessary remote-handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability. The report is owned by the Design Authority, who can authorize revisions and exceptions. This report will be retained for the lifetime of the facility.
Remote-Handled Low-Level Waste Disposal Project Code of Record
S.L. Austad, P.E.; L.E. Guillen, P.E.; C. W. McKnight, P.E.; D. S. Ferguson, P.E.
2014-06-01
The Remote-Handled Low-Level Waste (LLW) Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). Development of a new onsite disposal facility will provide necessary remote-handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability. The report is owned by the Design Authority, who can authorize revisions and exceptions. This report will be retained for the lifetime of the facility.
Remote-Handled Low-Level Waste Disposal Project Code of Record
S.L. Austad, P.E.; L.E. Guillen, P.E.; C. W. McKnight, P.E.; D. S. Ferguson, P.E.
2011-04-01
The Remote-Handled Low-Level Waste (LLW) Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). Development of a new onsite disposal facility, the highest ranked alternative, will provide necessary remote-handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability. The report is owned by the Design Authority, who can authorize revisions and exceptions. This report will be retained for the lifetime of the facility.
Remote-Handled Low-Level Waste Disposal Project Code of Record
S.L. Austad, P.E.; L.E. Guillen, P.E.; C. W. McKnight, P.E.; D. S. Ferguson, P.E.
2011-01-01
The Remote-Handled Low-Level Waste (LLW) Disposal Project addresses an anticipated shortfall in remote-handled LLW disposal capability following cessation of operations at the existing facility, which will continue until it is full or until it must be closed in preparation for final remediation of the Subsurface Disposal Area (approximately at the end of Fiscal Year 2017). Development of a new onsite disposal facility, the highest ranked alternative, will provide necessary remote-handled LLW disposal capability and will ensure continuity of operations that generate remote-handled LLW. This report documents the Code of Record for design of a new LLW disposal capability. The report is owned by the Design Authority, who can authorize revisions and exceptions. This report will be retained for the lifetime of the facility.
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.
HANDLING, STORAGE AND IRON ORE QUALITY
Fabiana Fonseca Fortes
2012-06-01
Full Text Available This paper aims to identify handling and storage impact in iron ore quality, in their physical and chemical characteristics most important for a mining. It is tried to show the interferences in iron ore quality caused by the handling equipment and stockpiling. The research is restricted to Complexo Vargem Grande (Vale. The timeline was demarcated based on the formation of stockpiling. The fieldwork enables data collection and distinction of the routine procedures of casual operations handling. The quantitative analysis is conducted by the statistical method. As a conclusion, handling and storage identified are able to insert changes in physical and chemical characteristics of iron ore. Storage contributes to reduce variability of silica and alumina concentrations, but contributes too particle size deterioration. The handling induces degradation and segregation. However, there is the possibility to decrease handling of the ore and to establish the ideal size of stocks on the system in study, improving the efficiency of the system and consequent in global costs.
GRAPHITE: A GRAPH SEARCH FRAMEWORK
Sushanta Pradhan
2014-07-01
Full Text Available With the recent data deluge, search applications are confronted with the complexity of data they handle in terms of volume, velocity and variety. Traditional frameworks such as Lucene [1], index text for efficient searching but do not consider relationships/semantics of data. Any structural change in data demands re-modelling and re-indexing. This paper presents an indexing model that addresses the challenge. Data is modelled as graph in accordance to object-oriented principles such that the system learns the possible queries that can be executed on the indexed data. The model is generic and flexible enough to adapt to the structural changes in data without the need of additional re-modelling & re-indexing. The result is a framework that enables applications to search domain objects, their relationships and related objects using simple APIs without the structural knowledge of underlying data.
Rytov approximation in electron scattering
Krehl, Jonas; Lubk, Axel
2017-06-01
In this work we introduce the Rytov approximation in the scope of high-energy electron scattering with the motivation of developing better linear models for electron scattering. Such linear models play an important role in tomography and similar reconstruction techniques. Conventional linear models, such as the phase grating approximation, have reached their limits in current and foreseeable applications, most importantly in achieving three-dimensional atomic resolution using electron holographic tomography. The Rytov approximation incorporates propagation effects which are the most pressing limitation of conventional models. While predominately used in the weak-scattering regime of light microscopy, we show that the Rytov approximation can give reasonable results in the inherently strong-scattering regime of transmission electron microscopy.
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
Approximate common divisors via lattices
Cohn, Henry
2011-01-01
We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common divisor of size N^beta, this improves the size of the error tolerated from N^(beta^2) to N^(beta^((m+1)/m)), under a commonly used heuristic assumption. This gives a more detailed analysis of the hardness assumption underlying the recent fully homomorphic cryptosystem of van Dijk, Gentry, Halevi, and Vaikuntanathan. While these results do not challenge the suggested parameters, a 2^sqrt(n) approximation algorithm for lattice basis reduction in n dimensions could be used to break these parameters. We have implemented our algorithm, and it performs better in practice than the theoretical analysis suggests. Our results fit into a broader context of analogies between cryptanalysis and coding theory. The multivariate approximate common divisor problem is the number-theoretic analogue of noisy multivariate polynomial interpolation, and we ...
Approximate Implicitization Using Linear Algebra
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.
Binary nucleation beyond capillarity approximation
Kalikmanov, V.I.
2010-01-01
Large discrepancies between binary classical nucleation theory (BCNT) and experiments result from adsorption effects and inability of BCNT, based on the phenomenological capillarity approximation, to treat small clusters. We propose a model aimed at eliminating both of these deficiencies. Adsorption
Weighted approximation with varying weight
Totik, Vilmos
1994-01-01
A new construction is given for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form w"n"(" "= uppercase)P"n"(" "= uppercase). The new technique settles several open problems, and it leads to a simple proof for the strong asymptotics on some L p(uppercase) extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power- type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified toyield (in a sense) uniformly good approximation on the whole support. This allows one to deduce strong asymptotics in some L p(uppercase) extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behavior of orthogonal polynomials and multipoint Pade approximation. The approach is potential-theoretic, but the text is self-contained.
Nonlinear approximation with redundant dictionaries
Borup, Lasse; Nielsen, M.; Gribonval, R.
2005-01-01
In this paper we study nonlinear approximation and data representation with redundant function dictionaries. In particular, approximation with redundant wavelet bi-frame systems is studied in detail. Several results for orthonormal wavelets are generalized to the redundant case. In general......, for a wavelet bi-frame system the approximation properties are limited by the number of vanishing moments of the system. In some cases this can be overcome by oversampling, but at a price of replacing the canonical expansion by another linear expansion. Moreover, for special non-oversampled wavelet bi-frames we...... can obtain good approximation properties not restricted by the number of vanishing moments, but again without using the canonical expansion....
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
Solidex 84 - modern technology in bulk solids handling
1984-01-01
Proceedings from Conference on solids handling. Sections which are of interest include coal and ash handling, and flow problems and explosion hazards in bulk handling plant. 14 papers have been abstracted separately.
7 CFR 948.23 - Handling for special purposes.
2010-01-01
... Order Regulating Handling Regulation § 948.23 Handling for special purposes. Upon the basis of....77, or any combination thereof, to facilitate handling of potatoes for (a) Relief or charity; (b...
7 CFR 959.53 - Handling for special purposes.
2010-01-01
... Regulating Handling Regulations § 959.53 Handling for special purposes. Regulations in effect pursuant to §§ 959.42, 959.52, or 959.60 may be modified, suspended, or terminated to facilitate handling of...
7 CFR 929.60 - Handling for special purposes.
2010-01-01
... LONG ISLAND IN THE STATE OF NEW YORK Order Regulating Handling Reports and Records § 929.60 Handling... facilitate handling of excess cranberries for the following purposes: (a) Charitable institutions;...
Twisted inhomogeneous Diophantine approximation and badly approximable sets
Harrap, Stephen
2010-01-01
For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max {||qx_1||^(-i), ||qx_2||^(-j)} > c(x)/q for all q in N. Building on a result of Kurzweil, a new characterization of the set Bad(i, j) in terms of `well-approximable' vectors in the area of `twisted' inhomogeneous Diophantine approximation is established. In addition, it is shown that Bad^x(i, j), the `twisted' inhomogeneous analogue of Bad(i, j), has full Hausdorff dimension 2 when x is chosen from the set Bad(i, j).
Approximate Bayesian methods for kernel-based object tracking
Zivkovic, Z.; Cemgil, A.T.; Kröse, B.
2009-01-01
A framework for real-time tracking of complex non-rigid objects is presented. The object shape is approximated by an ellipse and its appearance by histogram based features derived from local image properties. An efficient search procedure is used to find the image region with a histogram most simila
Sahmel, Jennifer; Barlow, Christy A; Gaffney, Shannon; Avens, Heather J; Madl, Amy K; Henshaw, John; Unice, Ken; Galbraith, David; DeRose, Gretchen; Lee, Richard J; Van Orden, Drew; Sanchez, Matthew; Zock, Matthew; Paustenbach, Dennis J
2016-01-01
The potential for para-occupational, domestic, or take-home exposures from asbestos-contaminated work clothing has been acknowledged for decades, but historically has not been quantitatively well characterized. A simulation study was performed to measure airborne chrysotile concentrations associated with laundering of contaminated clothing worn during a full shift work day. Work clothing fitted onto mannequins was exposed for 6.5 h to an airborne concentration of 11.4 f/cc (PCME) of chrysotile asbestos, and was subsequently handled and shaken. Mean 5-min and 15-min concentrations during active clothes handling and shake-out were 3.2 f/cc and 2.9 f/cc, respectively (PCME). Mean airborne PCME concentrations decreased by 55% 15 min after clothes handling ceased, and by 85% after 30 min. PCM concentrations during clothes handling were 11-47% greater than PCME concentrations. Consistent with previously published data, daily mean 8-h TWA airborne concentrations for clothes-handling activity were approximately 1.0% of workplace concentrations. Similarly, weekly 40-h TWAs for clothes handling were approximately 0.20% of workplace concentrations. Estimated take-home cumulative exposure estimates for weekly clothes handling over 25-year working durations were below 1 f/cc-year for handling work clothes contaminated in an occupational environment with full shift airborne chrysotile concentrations of up to 9 f/cc (8-h TWA).
Handling Qualities Optimization for Rotorcraft Conceptual Design
Lawrence, Ben; Theodore, Colin R.; Berger, Tom
2016-01-01
Over the past decade, NASA, under a succession of rotary-wing programs has been moving towards coupling multiple discipline analyses in a rigorous consistent manner to evaluate rotorcraft conceptual designs. Handling qualities is one of the component analyses to be included in a future NASA Multidisciplinary Analysis and Optimization framework for conceptual design of VTOL aircraft. Similarly, the future vision for the capability of the Concept Design and Assessment Technology Area (CD&A-TA) of the U.S Army Aviation Development Directorate also includes a handling qualities component. SIMPLI-FLYD is a tool jointly developed by NASA and the U.S. Army to perform modeling and analysis for the assessment of flight dynamics and control aspects of the handling qualities of rotorcraft conceptual designs. An exploration of handling qualities analysis has been carried out using SIMPLI-FLYD in illustrative scenarios of a tiltrotor in forward flight and single-main rotor helicopter at hover. Using SIMPLI-FLYD and the conceptual design tool NDARC integrated into a single process, the effects of variations of design parameters such as tail or rotor size were evaluated in the form of margins to fixed- and rotary-wing handling qualities metrics as well as the vehicle empty weight. The handling qualities design margins are shown to vary across the flight envelope due to both changing flight dynamic and control characteristics and changing handling qualities specification requirements. The current SIMPLI-FLYD capability and future developments are discussed in the context of an overall rotorcraft conceptual design process.
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.
Comparing numerical and analytic approximate gravitational waveforms
Afshari, Nousha; Lovelace, Geoffrey; SXS Collaboration
2016-03-01
A direct observation of gravitational waves will test Einstein's theory of general relativity under the most extreme conditions. The Laser Interferometer Gravitational-Wave Observatory, or LIGO, began searching for gravitational waves in September 2015 with three times the sensitivity of initial LIGO. To help Advanced LIGO detect as many gravitational waves as possible, a major research effort is underway to accurately predict the expected waves. In this poster, I will explore how the gravitational waveform produced by a long binary-black-hole inspiral, merger, and ringdown is affected by how fast the larger black hole spins. In particular, I will present results from simulations of merging black holes, completed using the Spectral Einstein Code (black-holes.org/SpEC.html), including some new, long simulations designed to mimic black hole-neutron star mergers. I will present comparisons of the numerical waveforms with analytic approximations.
Automated Patent Searching in the EPO: From Online Searching to Document Delivery.
Nuyts, Annemie; Jonckheere, Charles
The European Patent Office (EPO) has recently implemented the last part of its ambitious automation project aimed at creating an automated search environment for approximately 1200 EPO patent search examiners. The examiners now have at their disposal an integrated set of tools offering a full range of functionalities from online searching, via…
Greedy feature replacement for online value function approximation
Feng-fei ZHAO; Zheng QIN; Zhuo SHAO; Jun FANG; Bo-yan REN
2014-01-01
Reinforcement learning (RL) in real-world problems requires function approximations that depend on selecting the appropriate feature representations. Representational expansion techniques can make linear approximators represent value functions more effectively;however, most of these techniques function well only for low dimensional problems. In this paper, we present the greedy feature replacement (GFR), a novel online expansion technique, for value-based RL algorithms that use binary features. Given a simple initial representation, the feature representation is expanded incrementally. New feature dependencies are added automatically to the current representation and conjunctive features are used to replace current features greedily. The virtual temporal difference (TD) error is recorded for each conjunctive feature to judge whether the replacement can improve the approximation. Correctness guarantees and computational complexity analysis are provided for GFR. Experimental results in two domains show that GFR achieves much faster learning and has the capability to handle large-scale problems.
Beacham, James
The Standard Model of particle physics encompasses three of the four known fundamental forces of nature, and has remarkably withstood all of the experimental tests of its predictions, a fact solidified by the discovery, in 2012, of the Higgs boson. However, it cannot be the complete picture. Many measurements have been made that hint at physics beyond the Standard Model, and the main task of the high- energy experimental physics community is to conduct searches for new physics in as many di↵erent places and regimes as possible. I present three searches for new phenomena in three di↵erent high-energy collider experiments, namely, a search for events with at least three photons in the final state, which is sensitive to an exotic decay of a Higgs boson into four photons via intermediate pseudoscalar particles, a, with ATLAS, at the Large Hadron Collider; a search for a dark photon, also known as an A0 , with APEX, at Thomas Je↵erson National Accelerator Facility; and a search for a Higgs decaying into four...
Rotorcraft handling-qualities design criteria development
Aiken, Edwin W.; Lebacqz, J. Victor; Chen, Robert T. N.; Key, David L.
1988-01-01
Joint NASA/Army efforts at the Ames Research Center to develop rotorcraft handling-qualities design criteria began in earnest in 1975. Notable results were the UH-1H VSTOLAND variable stability helicopter, the VFA-2 camera-and-terrain-board simulator visual system, and the generic helicopter real-time mathematical model, ARMCOP. An initial series of handling-qualities studies was conducted to assess the effects of rotor design parameters, interaxis coupling, and various levels of stability and control augmentation. The ability to conduct in-flight handling-qualities research was enhanced by the development of the NASA/Army CH-47 variable-stability helicopter. Research programs conducted using this vehicle include vertical-response investigations, hover augmentation systems, and the effects of control-force characteristics. The handling-qualities data base was judged to be sufficient to allow an update of the military helicopter handling-qualities specification, MIL-H-8501. These efforts, including not only the in-house experimental work but also contracted research and collaborative programs performed under the auspices of various international agreements. The report concludes by reviewing the topics that are currently most in need of work, and the plans for addressing these topics.
Handling Qualities Implications for Crewed Spacecraft Operations
Bailey, Randall E.; Jackson, E. Bruce; Arthur, J. J.
2012-01-01
Abstract Handling qualities embody those qualities or characteristics of an aircraft that govern the ease and precision with which a pilot is able to perform the tasks required in support of an aircraft role. These same qualities are as critical, if not more so, in the operation of spacecraft. A research, development, test, and evaluation process was put into effect to identify, understand, and interpret the engineering and human factors principles which govern the pilot-vehicle dynamic system as they pertain to space exploration missions and tasks. Toward this objective, piloted simulations were conducted at the NASA Langley Research Center and Ames Research Center for earth-orbit proximity operations and docking and lunar landing. These works provide broad guidelines for the design of spacecraft to exhibit excellent handling characteristics. In particular, this work demonstrates how handling qualities include much more than just stability and control characteristics of a spacecraft or aircraft. Handling qualities are affected by all aspects of the pilot-vehicle dynamic system, including the motion, visual and aural cues of the vehicle response as the pilot performs the required operation or task. A holistic approach to spacecraft design, including the use of manual control, automatic control, and pilot intervention/supervision is described. The handling qualities implications of design decisions are demonstrated using these pilot-in-the-loop evaluations of docking operations and lunar landings.
Effective Teaching Practices in Handling Non Readers
Jacklyn S. Dacalos
2016-08-01
Full Text Available The study determined the effective teaching practices in handling nonreaders. This seeks to answer the following objectives: describe the adjustments, effective strategies, and scaffolds utilized by teachers in handling nonreaders; differentiate the teachers’ reading adjustments, strategies and scaffolds in teaching nonreaders; analyze the teaching reading efficiency of nonreaders using effective teaching reading strategies; and find significant correlation of nonreaders’ grades and reading teachers’ reading adjustments, strategies and scaffolds. This study utilized mixed methods of research. Case studies of five public schools teachers were selected as primary subjects, who were interviewed in handling nonreaders in the areas of adjustments, strategies, and reading scaffolds. Actual teaching observation was conducted according to the five subjects’ most convenient time. In ascertaining the nonreaders’ academic performance, the students’ grades in English subject was analyzed using T-Test within subject design. Handling nonreaders in order to read and understand better in the lesson is an arduous act, yet; once done with effectiveness and passion, it yielded a great amount of learning success. Effective teaching practices in handling nonreaders comprised the use of teachers’ adjustments, strategies, and scaffolds to establish reading mastery, exposing them to letter sounds, short stories, and the use of follow-up. WH questions enhanced their reading performance significantly. Variations of reading teachers’ nature as: an enabler, a facilitator, a humanist, a behaviorist, and an expert, as regards to their teaching practices, were proven significant to students’ reading effectiveness.
Approximate Matching of Hierarchial Data
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...... 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...... 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...
Approximating Graphic TSP by Matchings
Mömke, Tobias
2011-01-01
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
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...
Approximation methods in probability theory
Čekanavičius, Vydas
2016-01-01
This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.
Approximate Sparse Regularized Hyperspectral Unmixing
Chengzhi Deng
2014-01-01
Full Text Available Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel. In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU, is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery. And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem. In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer. Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer. Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.
Transfinite Approximation of Hindman's Theorem
Beiglböck, Mathias
2010-01-01
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring of the integers there are arbitrarily long finite sets with the same property. We extend the finite form of Hindman's Theorem to a "transfinite" version for each countable ordinal, and show that Hindman's Theorem is equivalent to the appropriate transfinite approximation holding for every countable ordinal. We then give a proof of Hindman's Theorem by directly proving these transfinite approximations.
Tree wavelet approximations with applications
无
2005-01-01
[1]Baraniuk, R. G., DeVore, R. A., Kyriazis, G., Yu, X. M., Near best tree approximation, Adv. Comput. Math.,2002, 16: 357-373.[2]Cohen, A., Dahmen, W., Daubechies, I., DeVore, R., Tree approximation and optimal encoding, Appl. Comput.Harmonic Anal., 2001, 11: 192-226.[3]Dahmen, W., Schneider, R., Xu, Y., Nonlinear functionals of wavelet expansions-adaptive reconstruction and fast evaluation, Numer. Math., 2000, 86: 49-101.[4]DeVore, R. A., Nonlinear approximation, Acta Numer., 1998, 7: 51-150.[5]Davis, G., Mallat, S., Avellaneda, M., Adaptive greedy approximations, Const. Approx., 1997, 13: 57-98.[6]DeVore, R. A., Temlyakov, V. N., Some remarks on greedy algorithms, Adv. Comput. Math., 1996, 5: 173-187.[7]Kashin, B. S., Temlyakov, V. N., Best m-term approximations and the entropy of sets in the space L1, Mat.Zametki (in Russian), 1994, 56: 57-86.[8]Temlyakov, V. N., The best m-term approximation and greedy algorithms, Adv. Comput. Math., 1998, 8:249-265.[9]Temlyakov, V. N., Greedy algorithm and m-term trigonometric approximation, Constr. Approx., 1998, 14:569-587.[10]Hutchinson, J. E., Fractals and self similarity, Indiana. Univ. Math. J., 1981, 30: 713-747.[11]Binev, P., Dahmen, W., DeVore, R. A., Petruchev, P., Approximation classes for adaptive methods, Serdica Math.J., 2002, 28: 1001-1026.[12]Gilbarg, D., Trudinger, N. S., Elliptic Partial Differential Equations of Second Order, Berlin: Springer-Verlag,1983.[13]Ciarlet, P. G., The Finite Element Method for Elliptic Problems, New York: North Holland, 1978.[14]Birman, M. S., Solomiak, M. Z., Piecewise polynomial approximation of functions of the class Wαp, Math. Sb.,1967, 73: 295-317.[15]DeVore, R. A., Lorentz, G. G., Constructive Approximation, New York: Springer-Verlag, 1993.[16]DeVore, R. A., Popov, V., Interpolation of Besov spaces, Trans. Amer. Math. Soc., 1988, 305: 397-414.[17]Devore, R., Jawerth, B., Popov, V., Compression of wavelet decompositions, Amer. J. Math., 1992, 114: 737-785.[18]Storozhenko, E
Randomly removing g handles at once
Borradaile, Glencora; Sidiropoulos, Anastasios
2010-01-01
Indyk and Sidiropoulos (2007) proved that any orientable graph of genus $g$ can be probabilistically embedded into a graph of genus $g-1$ with constant distortion. Viewing a graph of genus $g$ as embedded on the surface of a sphere with $g$ handles attached, Indyk and Sidiropoulos' method gives an embedding into a distribution over planar graphs with distortion $2^{O(g)}$, by iteratively removing the handles. By removing all $g$ handles at once, we present a probabilistic embedding with distortion $O(g^2)$ for both orientable and non-orientable graphs. Our result is obtained by showing that the nimum-cut graph of Erickson and Har Peled (2004) has low dilation, and then randomly cutting this graph out of the surface using the Peeling Lemma of Lee and Sidiropoulos (2009).
DOE handbook: Tritium handling and safe storage
NONE
1999-03-01
The DOE Handbook was developed as an educational supplement and reference for operations and maintenance personnel. Most of the tritium publications are written from a radiological protection perspective. This handbook provides more extensive guidance and advice on the null range of tritium operations. This handbook can be used by personnel involved in the full range of tritium handling from receipt to ultimate disposal. Compliance issues are addressed at each stage of handling. This handbook can also be used as a reference for those individuals involved in real time determination of bounding doses resulting from inadvertent tritium releases. This handbook provides useful information for establishing processes and procedures for the receipt, storage, assay, handling, packaging, and shipping of tritium and tritiated wastes. It includes discussions and advice on compliance-based issues and adds insight to those areas that currently possess unclear DOE guidance.
Refining Approximating Betweenness Centrality Based on Samplings
Ji, Shiyu
2016-01-01
Betweenness Centrality (BC) is an important measure used widely in complex network analysis, such as social network, web page search, etc. Computing the exact BC values is highly time consuming. Currently the fastest exact BC determining algorithm is given by Brandes, taking $O(nm)$ time for unweighted graphs and $O(nm+n^2\\log n)$ time for weighted graphs, where $n$ is the number of vertices and $m$ is the number of edges in the graph. Due to the extreme difficulty of reducing the time complexity of exact BC determining problem, many researchers have considered the possibility of any satisfactory BC approximation algorithms, especially those based on samplings. Bader et al. give the currently best BC approximation algorithm, with a high probability to successfully estimate the BC of one vertex within a factor of $1/\\varepsilon$ using $\\varepsilon t$ samples, where $t$ is the ratio between $n^2$ and the BC value of the vertex. However, some of the algorithmic parameters in Bader's work are not yet tightly boun...
WKB Approximation in Noncommutative Gravity
Maja Buric
2007-12-01
Full Text Available We consider the quasi-commutative approximation to a noncommutative geometry defined as a generalization of the moving frame formalism. The relation which exists between noncommutativity and geometry is used to study the properties of the high-frequency waves on the flat background.
Approximation properties of haplotype tagging
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.
Truthful approximations to range voting
Filos-Ratsika, Aris; Miltersen, Peter Bro
We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare...
Approximate Reasoning with Fuzzy Booleans
Broek, van den P.M.; Noppen, J.A.R.
2004-01-01
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 ante
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
2013-01-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
On badly approximable complex numbers
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.
Approximation on the complex sphere
Alsaud, Huda; Kushpel, Alexander; Levesley, Jeremy
2012-01-01
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations. The results obtained is a synthesis of new results on classical orthogonal polynomials, harmonic analysis on manifolds and geometric properties of Euclidean spaces.
On badly approximable complex numbers
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...
Pythagorean Approximations and Continued Fractions
Peralta, Javier
2008-01-01
In this article, we will show that the Pythagorean approximations of [the square root of] 2 coincide with those achieved in the 16th century by means of continued fractions. Assuming this fact and the known relation that connects the Fibonacci sequence with the golden section, we shall establish a procedure to obtain sequences of rational numbers…
Approximation of Surfaces by Cylinders
Randrup, Thomas
1998-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...
Approximate Reanalysis in Topology Optimization
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...
Handling of fuel chips - a health problem
Stroemquist, L.H.; Blomqvist, G.; Karlsson, E.; Vincent, A.; Lundgren, R.; Eliasson, L.
1980-01-01
An investigation has been made about health problems and occurrence of mold in connection with handling of fuel chips. The investigation was composed of three different parts. First, an inquiry was made to chip stokers about handling, storage etc. of chips as well as possible medical trouble. The answers indicated that symptoms on allergic alveolitis are common among chip stokers, 13% of the answers. Second, a determination of the proportion of living airborne colony-forming mold fungi was made at some chip using units. Third, a pilot study was made to examine the possibilities to improve storability of fuel chips using high-temperature drying.
Fatmaa El Zahraa Mohamed Abdou
2004-01-01
A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.
Fatmaa El Zahraa Mohamed Abdou
2004-09-01
Full Text Available A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.
Low Rank Approximation in $G_0W_0$ Approximation
Shao, Meiyue; Yang, Chao; Liu, Fang; da Jornada, Felipe H; Deslippe, Jack; Louie, Steven G
2016-01-01
The single particle energies obtained in a Kohn--Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in transport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green's function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The $G_0W_0$ approximation is a widely used technique in which the self energy is expressed as the convolution of a non-interacting Green's function ($G_0$) and a screened Coulomb interaction ($W_0$) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating $W_0$ at multiple frequencies. In this paper, we discuss how the cos...
Regulation and practice of workers' protection from chemical exposures during container handling
Nørgaard Fløe Pedersen, Randi; Jepsen, Jørgen Riis; Ádám, Balázs
2014-01-01
Background: Fumigation of freight containers to prevent spread of pests and off-gassing of freight are sources of volatile chemicals that may constitute significant health risks when released. The aim of the study was to investigate the regulation and practice of container handling in Denmark...... with focus on preventive measures to reduce risk of chemical exposure. Methods: A comprehensive systematic search of scientific literature, legislation and recommendations related to safe work with transport containers from international and Danish regulatory bodies was performed. The practice of handling...... instructions relate to container handling, the provided information is not sufficiently detailed to conduct safe practice in many aspects. In accordance with the scientific literature, the interviewees estimate that there is a high frequency (5 to 50%) of containers with hazardous chemical exposure...
Remote-handled transuranic system assessment appendices. Volume 2
NONE
1995-11-01
Volume 2 of this report contains six appendices to the report: Inventory and generation of remote-handled transuranic waste; Remote-handled transuranic waste site storage; Characterization of remote-handled transuranic waste; RH-TRU waste treatment alternatives system analysis; Packaging and transportation study; and Remote-handled transuranic waste disposal alternatives.
Remote-handled transuranic system assessment appendices. Volume 2
NONE
1995-11-01
Volume 2 of this report contains six appendices to the report: Inventory and generation of remote-handled transuranic waste; Remote-handled transuranic waste site storage; Characterization of remote-handled transuranic waste; RH-TRU waste treatment alternatives system analysis; Packaging and transportation study; and Remote-handled transuranic waste disposal alternatives.
30 CFR 77.1303 - Explosives, handling and use.
2010-07-01
... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Explosives, handling and use. 77.1303 Section... MINES Explosives and Blasting § 77.1303 Explosives, handling and use. (a) Persons who use or handle... treated and handled with the same safety precautions as blasting caps and electric detonators. (o) Capped...
Multigroup Approximation of Radiation Transfer in SF6 Arc Plasmas
Milada Bartlova
2013-01-01
Full Text Available The first order of the method of spherical harmonics (P1-approximation has been used to evaluate the radiation properties of arc plasmas of various mixtures of SF6 and PTFE ((C2F4n, polytetrafluoroethylene in the temperature range (1000 ÷ 35 000 K and pressures from 0.5 to 5 MPa. Calculations have been performed for isothermal cylindrical plasma of various radii (0.01 ÷ 10 cm. The frequency dependence of the absorption coefficients has been handled using the Planck and Rosseland averaging methods for several frequency intervals. Results obtained using various means calculated for different choices of frequency intervals are discussed.
Efficient compensation handling via subjective updates
J. Dedeić (Jovana); J. Pantović (Jovanka); J.A. Pérez Parra (Jorge)
2017-01-01
textabstractProgramming abstractions for compensation handling and dynamic update are crucial in specifying reliable interacting systems, such as Collective Adaptive Systems (CAS). Compensations and updates both specify how a system reacts in response to exceptional events. Prior work showed that
CLINICAL WASTE HANDLING AND OBSTACLES IN MALAYSIA
Shaidatul Shida Razali
2010-12-01
Full Text Available As in many other developing countries, the generation of clinical waste in Malaysia has increased significantly over the last few decades. Even though the serious impact of the clinical waste on human beings and the environment is significant, only minor attention is directed to its proper handling and legal aspects. This study seeks to examine the management of clinical waste in Selangor’s government hospitals as well as problems that arise from the current practice of clinical waste management. A depth interview with the responsible concession who handles the clinical waste management in those hospitals also has been taken. In general, it was found that the consortium’s administration was reasonably aware of the importance of clinical waste management. However, significant voids were presented that need to be addressed in future including efficient segregation, better handling and transfer means, as well as the need for training and awareness programs for the personnel. Other obstacles faced by consortiums were to handle the clinical waste including the operational costs. Waste minimizing and recycling, as well as the alternative treatment methods for incineration are regarded to be major challenges in the future.
Confluence Modulo Equivalence in Constraint Handling Rules
Christiansen, Henning; Kirkeby, Maja Hanne
2014-01-01
Previous results on confluence for Constraint Handling Rules, CHR, are generalized to take into account user-defined state equivalence relations. This allows a much larger class of programs to enjoy the ad- vantages of confluence, which include various optimization techniques and simplified corre...
Materials handling centre: making business more efficient
B. Bollen (Brian)
2012-01-01
textabstractThe aim of the Materials Handling Forum at RSM is to narrow the gap between research and practice by promoting and disseminating academic knowledge, sharing innovative ideas, generating research questions, and co-developing new research themes with industry partners.
Waiting on More than 64 Handles
2015-10-01
parameter stuct is comprised of an array of handles with a maximum size of MAX_WAIT_OBJECTS and an integer holding the total quantity. Once all the...GIDEP Operations Center P.O. Box 8000 Corona , CA 91718-8000 gidep@gidep.org UNCLASSIFIED Approved for public release; distribution is unlimited. 4 Patricia Alameda Patricia Alameda Andrew Pskowski
Biodiesel Handling and Use Guide (Fifth Edition)
Alleman, Teresa L.; McCormick, Robert L.; Christensen, Earl D.; Fioroni, Gina; Moriarty, Kristi; Yanowitz, Janet
2016-11-08
This document is a guide for those who blend, distribute, and use biodiesel and biodiesel blends. It provides basic information on the proper and safe use of biodiesel and biodiesel blends in engines and boilers, and is intended to help fleets, individual users, blenders, distributors, and those involved in related activities understand procedures for handling and using biodiesel fuels.
Australia: round module handling and cotton classing
Round modules of seed cotton produced via on-board module building harvesters are the reality of the cotton industry, worldwide. Although round modules have been available to the industry for almost a decade, there is still no consensus on the best method to handle the modules, particularly when th...
Laboratory rearing and handling of cerambycids
Melody A. Keena
2017-01-01
Lack of suitable rearing and handling techniques has hampered research on the biology and control of many species of cerambycids that feed on host species of economic importance. Furthermore, because cerambycids spend most or all of their pre-adult life cycle inside the host plant, the biology of many is not well-known and would be dif
Intertextuality for Handling Complex Environmental Issues
Byhring, Anne Kristine; Knain, Erik
2016-01-01
Nowhere is the need for handling complexity more pertinent than in addressing environmental issues. Our study explores students' situated constructs of complexity in unfolding discourses on socio-scientific issues. Students' dialogues in two group-work episodes are analysed in detail, with tools from Systemic Functional Linguistics. We identify…
Railcar handling systems - designs for individual solutions
NONE
1995-04-01
The article examines the latest state of the art developments in railcar handling technology, with profiles of leading equipment suppliers in this field and recent projects completed worldwide. Equipment covered includes: railcar discharge systems; rotary dumpers; side discharge dumpers; and railcar loading systems. 2 figs., 7 photos.
2010-01-01
... 7 Agriculture 8 2010-01-01 2010-01-01 false Handle. 915.10 Section 915.10 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements and... prepared for market. In the event a grower sells his avocados to a handler who is not so registered...
340 Waste handling facility interim safety basis
Stordeur, R.T.
1996-10-04
This document presents an interim safety basis for the 340 Waste Handling Facility classifying the 340 Facility as a Hazard Category 3 facility. The hazard analysis quantifies the operating safety envelop for this facility and demonstrates that the facility can be operated without a significant threat to onsite or offsite people.
340 waste handling facility interim safety basis
VAIL, T.S.
1999-04-01
This document presents an interim safety basis for the 340 Waste Handling Facility classifying the 340 Facility as a Hazard Category 3 facility. The hazard analysis quantifies the operating safety envelop for this facility and demonstrates that the facility can be operated without a significant threat to onsite or offsite people.
Intertextuality for Handling Complex Environmental Issues
Byhring, Anne Kristine; Knain, Erik
2016-01-01
Nowhere is the need for handling complexity more pertinent than in addressing environmental issues. Our study explores students' situated constructs of complexity in unfolding discourses on socio-scientific issues. Students' dialogues in two group-work episodes are analysed in detail, with tools from Systemic Functional Linguistics. We identify…
Goods handling: tugs, trailers and tractors.
Grayson, H
1980-09-26
Ease of handling ought to be a priority in any supply and disposal system. Hazel Grayson, senior research officer at the Medical Architecture Research Unit, Polytechnic of North London, suggests that even where driver-operated electric tow tractors cannot be used, other types of electric pulling device should be considered.
'Safe handling of nanotechnology' ten years on
Maynard, Andrew D.; Aitken, Robert J.
2016-12-01
In 2006, a group of scientists proposed five grand challenges to support the safe handling of nanotechnology. Ten years on, Andrew Maynard and Robert Aitken -- two of the original authors -- look at where we have come, and where we still need to go.
Caution required for handling genome editing technology.
Araki, Motoko; Nojima, Kumie; Ishii, Tetsuya
2014-05-01
Genome-editing technology, although a robust tool for genetic engineering, is creating indistinct regulatory boundaries between naturally occurring and modified organisms. However, researchers must act with caution in research and development to avoid misleading society. Furthermore, appropriate regulations should be proactively discussed and established for handling genome-editing technology.
Tips for Handling Gourds this Fall Season
Bratsch, Tony
2009-01-01
Each year, more direct market and wholesale growers are adding gourds to their fall sales mix, along with pumpkins, ornamental corn and fall mums. Proper harvest timing, handling and curing are important to ensure maximum longevity of gourds once the consumer brings them home.
Instrumentation to handle thermal polarized neutron beams
Kraan, W.H.
2004-01-01
In this thesis we investigate devices needed to handle the polarization of thermal neutron beams: Ï/2-flippers (to start/stop Larmor precession) and Ï-flippers (to reverse polarization/precession direction) and illustrate how these devices are used to investigate the properties of matter and of the
Ergonomics intervention in manual handling of oxygen
M Motamedzadeh
2013-05-01
Conclusion: With the implementation of ergonomic intervention is casting unit, the risk of exposure to musculoskeletal disorders caused by manual handling of oxygen cylinders was eliminated and safety of employees against the risk of explosion of the cylinders in comparison with before the intervention was improved.
Handling Sparse Data by Successive Abstraction
Samuelsson, C
1996-01-01
A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed (deleted) interpolation with context-independent weights, even when the latter used a globally optimal parameter setting determined a posteriori.
2010-01-01
... 7 Agriculture 8 2010-01-01 2010-01-01 false Handle. 920.11 Section 920.11 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE KIWIFRUIT GROWN IN CALIFORNIA...
2010-01-01
... 7 Agriculture 8 2010-01-01 2010-01-01 false Handle. 955.7 Section 955.7 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE VIDALIA ONIONS GROWN IN GEORGIA...
Wet handling of solids using submersible pumps
Czarnota, Z.; Fahlgren, M.; Grainger, M. [ITT Flygt Slurry Laboratory, Soina (Sweden)
1996-12-31
A complete and efficient concept for handling solids in short distance pumping applications is described. The function of pump, mixer, agitator, and sump have been determined in experimental studies. The major factors that affect pump performance such as impeller design and slurry characteristics are discussed. The results apply to a range of applications in industry and mining. 10 refs., 6 figs.
Approximate Inference for Wireless Communications
Hansen, Morten
This thesis investigates signal processing techniques for wireless communication receivers. The aim is to improve the performance or reduce the computationally complexity of these, where the primary focus area is cellular systems such as Global System for Mobile communications (GSM) (and extensions...... complexity can potentially lead to limited power consumption, which translates into longer battery life-time in the handsets. The scope of the thesis is more specifically to investigate approximate (nearoptimal) detection methods that can reduce the computationally complexity significantly compared...... 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...
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
Validity of the eikonal approximation
Kabat, D
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymptotic behavior of the full amplitude. For spin--2 tensor fields the eikonal captures the leading behavior of each order in perturbation theory, but the sum of eikonal terms is subdominant to graphs neglected by the approximation. We also comment on the eikonal for Yang-Mills vector exchange, where the additional complexities of the non-abelian theory may be absorbed into Regge-type modifications of the gauge boson propagators.
Approximate Privacy: Foundations and Quantification
Feigenbaum, Joan; Schapira, Michael
2009-01-01
Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of online sensitive data about individuals and organizations. Consequently, concern about the privacy of these data has become a top priority, particularly those data that are created and used in electronic commerce. There have been many formulations of privacy and, unfortunately, many negative results about the feasibility of maintaining privacy of sensitive data in realistic networked environments. We formulate communication-complexity-based definitions, both worst-case and average-case, of a problem's privacy-approximation ratio. We use our definitions to investigate the extent to which approximate privacy is achievable in two standard problems: the second-price Vickrey auction and the millionaires problem of Yao. For both the second-price Vickrey auction and the millionaires problem, we show that not only is perfect privacy impossible or infeasibly costly to achieve...
SIMULATION OF DRIVER’S LOCOMOTIVE-HANDLING ACTIVITY USING THE THEORY OF FUZZY GRAPHS
T. V. Butko
2015-03-01
Full Text Available Purpose. The efficiency and safety of locomotive control improving is important and relevant scientific and practical problem. Every driver during the trains-handling bases on his experience and knowledge, that is why the compilation and detection the most efficient ways to control the locomotive-handling is one of the stages of measures development to reduce transportation costs. The purpose of this paper is a formalization process description of locomotive-handling and quality parameters determination of this process. Methodology. In order to achieve this goal the theory of fuzzy probabilistic graphs was used. Vertices of the graph correspond to the events start and end operations at train-handling. The graph arcs describe operations on train-handling. Graph consists of thirteen peaks corresponding to the main control actions of the engine-driver. The weighting factors of transitions between vertices are assigned by fuzzy numbers. Their values were obtained by expert estimates. Fuzzy probabilities and transition time are presented as numbers with trapezoidal membership function. Findings. Using successive merging of parallel arcs, loops and vertices elimination, the equivalent fuzzy graph of train-handling and the corresponding L-matrix were obtained. Equivalent graph takes into account separately activity of the driver during normal operation and during emergency situations. Originality. The theoretical foundations of describing process formalization in driver’s locomotive-handling activity were developed using the fuzzy probabilistic graph. The parameters characterizing the decision-making process of engineer were obtained. Practical value. With the resulting model it is possible to estimate the available reserves for the quality improvement of locomotive-handling. Reduction in the time for decision-making will lead to the approximation the current mode of control to the rational one and decrease costs of hauling operations. And reduction
Validity of the Eikonal Approximation
Kabat, Daniel
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymp...
Enbridge system : crude types, transportation and handling systems
Anand, A. [Enbridge Corp., Edmonton, AB (Canada)
2009-07-01
The supply of crude oil from the Western Canada Sedimentary Basin is expected to increase by approximately 2.1 million barrels per day by 2015. The crudes that Enbridge handles range from 19 API to 40 API and 0.1 per cent sulphur to 4.7 per cent sulphur. The diverse supply of crude oil that the Enbridge system handles includes conventional heavy, synthetic heavy, heavy high tan, heavy low residual, medium, light sour, heavy sour, light sweet, light sweet synthetic, condensate and olefinic crudes. This presentation discussed Enbridge's plans for infrastructure expansion, crude types and quality assurance program. The company's infrastructure plans include the expansion of regional pipelines to bring more supplies to the mainline; expansion of the mainline capacity to existing markets; and providing pipeline access to new markets. Merchant storage terminals will be provided in some locations. The quality of various crude types will be maintained through judicious sequencing and tank bottoms crossings. tabs., figs.
Approximate Counting of Graphical Realizations.
Erdős, Péter L; Kiss, Sándor Z; Miklós, István; Soukup, Lajos
2015-01-01
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007), for regular directed graphs (by Greenhill, 2011) and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013). Several heuristics on counting the number of possible realizations exist (via sampling processes), and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases) the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS) for counting of all realizations.
Approximate Counting of Graphical Realizations.
Péter L Erdős
Full Text Available In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007, for regular directed graphs (by Greenhill, 2011 and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013. Several heuristics on counting the number of possible realizations exist (via sampling processes, and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS for counting of all realizations.
Many Faces of Boussinesq Approximations
Vladimirov, Vladimir A
2016-01-01
The \\emph{equations of Boussinesq approximation} (EBA) for an incompressible and inhomogeneous in density fluid are analyzed from a viewpoint of the asymptotic theory. A systematic scaling shows that there is an infinite number of related asymptotic models. We have divided them into three classes: `poor', `reasonable' and `good' Boussinesq approximations. Each model can be characterized by two parameters $q$ and $k$, where $q =1, 2, 3, \\dots$ and $k=0, \\pm 1, \\pm 2,\\dots$. Parameter $q$ is related to the `quality' of approximation, while $k$ gives us an infinite set of possible scales of velocity, time, viscosity, \\emph{etc.} Increasing $q$ improves the quality of a model, but narrows the limits of its applicability. Parameter $k$ allows us to vary the scales of time, velocity and viscosity and gives us the possibility to consider any initial and boundary conditions. In general, we discover and classify a rich variety of possibilities and restrictions, which are hidden behind the routine use of the Boussinesq...
An integrated approach for modeling and solving the scheduling problem of container handling systems
CHEN Lu; XI Li-feng; CAI Jian-guo; BOSTEL Nathalie; DEJAX Pierre
2006-01-01
An integrated model is presented to schedule the container handling system. The objective is to improve the cooperation between different types of equipments, and to increase the productivity of the terminal. The problem is formulated as a Hybrid Flow Shop Scheduling problem with precedence constraint, setup times and blocking (HFSS-B). A tabu search algorithm is proposed to solve this problem. The quality and efficiency of the proposed algorithm is analyzed from the computational point of view.
Data handling and representation of freeform surfaces
Steinkopf, Ralf; Dick, Lars; Kopf, Tino; Gebhardt, Andreas; Risse, Stefan; Eberhardt, Ramona
2011-10-01
Freeform surfaces enable innovative optics. They are not limited by axis symmetry and hence they are almost free in design. They are used to reduce the installation space and enhance the performance of optical elements. State of the art optical design tools are computing with powerful algorithms to simulate freeform surfaces. Even new mathematical approaches are under development /1/. In consequence, new optical designs /2/ are pushing the development of manufacturing processes consequently and novel types of datasets have to proceed through the process chain /3/. The complexity of these data is the huge challenge for the data handling. Because of the asymmetrical and 3-dimensional surfaces of freeforms, large data volumes have to be created, trimmed, extended and fitted. All these processes must be performed without losing the accuracy of the original design data. Additionally, manifold types of geometries results in different kinds of mathematical representations of freeform surfaces and furthermore the used CAD/CAM tools are dealing with a set of spatial transport formats. These are all reasons why manufacture-oriented approaches for the freeform data handling are not yet sufficiently developed. This paper suggests a classification of freeform surfaces based on the manufacturing methods which are offered by diamond machining. The different manufacturing technologies, ranging from servo-turning to shaping, require a differentiated approach for the data handling process. The usage of analytical descriptions in form of splines and polynomials as well as the application of discrete descriptions like point clouds is shown in relation to the previously made classification. Advantages and disadvantages of freeform representations are discussed. Aspects of the data handling in between different process steps are pointed out and suitable exchange formats for freeform data are proposed. The described approach offers the possibility for efficient data handling from optical
Astier, P.; Autiero, D.; Baldisseri, A.; Baldo-Ceolin, M.; Banner, M.; Bassompierre, G.; Benslama, K.; Besson, N.; Bird, I.; Blumenfeld, B.; Bobisut, F.; J. Bouchez; Boyd, S.; A. Bueno; Bunyatov, S.
2003-01-01
Neutrinos; We present the results of a search for nu_mu → nu_e oscillations in the NOMAD experiment at Cern. The experiment looked for the appearance of nu_e in a predominantly nu_mu wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are Delta m^2 ~ 10 eV^2.
Astier, Pierre; Baldisseri, Alberto; Baldo-Ceolin, Massimilla; Banner, M; Bassompierre, Gabriel; Benslama, K; Besson, N; Bird, I; Blumenfeld, B; Bobisut, F; Bouchez, J; Boyd, S; Bueno, A G; Bunyatov, S A; Camilleri, L L; Cardini, A; Cattaneo, Paolo Walter; Cavasinni, V; Cervera-Villanueva, A; Challis, R C; Chukanov, A; Collazuol, G; Conforto, G; Conta, C; Contalbrigo, M; Cousins, R D; Daniels, D; De Santo, A; Degaudenzi, H M; Del Prete, T; Di Lella, L; Dignan, T; Dumarchez, J; Feldman, G J; Ferrari, A; Ferrari, R; Ferrère, D; Flaminio, Vincenzo; Fraternali, M; Gaillard, J M; Gangler, E; Geiser, A; Geppert, D; Gibin, D; Gninenko, S N; Godley, A; Gosset, J; Gouanère, M; Grant, A; Graziani, G; Guglielmi, A M; Gómez-Cadenas, J J; Gössling, C; Hagner, C; Hernando, J; Hong, T M; Hubbard, D B; Hurst, P; Hyett, N; Iacopini, E; Joseph, C L; Juget, F R; Kent, N; Kirsanov, M M; Klimov, O; Kokkonen, J; Kovzelev, A; Krasnoperov, A V; Kustov, D; La Rotonda, L; Lacaprara, S; Lachaud, C; Lakic, B; Lanza, A; Laveder, M; Letessier-Selvon, A A; Linssen, Lucie; Ljubicic, A; Long, J; Lupi, A; Lévy, J M; Marchionni, A; Martelli, F; Mendiburu, J P; Meyer, J P; Mezzetto, Mauro; Mishra, S R; Moorhead, G F; Méchain, X; Naumov, D V; Nefedov, Yu A; Nguyen-Mau, C; Nédélec, P; Orestano, D; Pastore, F; Peak, L S; Pennacchio, E; Pessard, H; Petti, R; Placci, A; Polesello, G; Pollmann, D; Polyarush, A Yu; Popov, B; Poulsen, C; Rebuffi, L; Renò, R; Rico, J; Riemann, P; Roda, C; Rubbia, André; Salvatore, F; Schahmaneche, K; Schmidt, B; Schmidt, T; Sconza, A; Sevior, M E; Shih, D; Sillou, D; Soler, F J P; Sozzi, G; Steele, D; Stiegler, U; Stipcevic, M; Stolarczyk, T; Tareb-Reyes, M; Taylor, G N; Tereshchenko, V V; Toropin, A N; Touchard, A M; Tovey, Stuart N; Tran, M T; Tsesmelis, E; Ulrichs, J; Vacavant, L; Valdata-Nappi, M; Valuev, V Yu; Vannucci, François; Varvell, K E; Veltri, M; Vercesi, V; Vidal-Sitjes, G; Vieira, J M; Vinogradova, T G; Weber, F V; Weisse, T; Wilson, F F; Winton, L J; Yabsley, B D; Zaccone, Henri; Zuber, K; Zuccon, P; do Couto e Silva, E
2003-01-01
We present the results of a search for nu_mu → nu_e oscillations in the NOMAD experiment at Cern. The experiment looked for the appearance of nu_e in a predominantly nu_mu wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are Delta m^2 ~ 10 eV^2.
Astier, Pierre; Baldisseri, Alberto; Baldo-Ceolin, Massimilla; Banner, M; Bassompierre, Gabriel; Benslama, K; Besson, N; Bird, I; Blumenfeld, B; Bobisut, F; Bouchez, J; Boyd, S; Bueno, A G; Bunyatov, S; Camilleri, L L; Cardini, A; Cattaneo, Paolo Walter; Cavasinni, V; Cervera-Villanueva, A; Challis, R C; Chukanov, A; Collazuol, G; Conforto, G; Conta, C; Contalbrigo, M; Cousins, R; Daniels, D; Degaudenzi, H M; Del Prete, T; De Santo, A; Dignan, T; Di Lella, L; do Couto e Silva, E; Dumarchez, J; Ellis, M; Feldman, G J; Ferrari, R; Ferrère, D; Flaminio, Vincenzo; Fraternali, M; Gaillard, J M; Gangler, E; Geiser, A; Geppert, D; Gibin, D; Gninenko, S N; Godley, A; Gómez-Cadenas, J J; Gosset, J; Gössling, C; Gouanère, M; Grant, A; Graziani, G; Guglielmi, A M; Hagner, C; Hernando, J A; Hubbard, D B; Hurst, P; Hyett, N; Iacopini, E; Joseph, C L; Juget, F R; Kent, N; Kirsanov, M M; Klimov, O; Kokkonen, J; Kovzelev, A; Krasnoperov, A V; Kustov, D; Lacaprara, S; Lachaud, C; Lakic, B; Lanza, A; La Rotonda, L; Laveder, M; Letessier-Selvon, A A; Lévy, J M; Linssen, Lucie; Ljubicic, A; Long, J; Lupi, A; Marchionni, A; Martelli, F; Méchain, X; Mendiburu, J P; Meyer, J P; Mezzetto, Mauro; Mishra, S R; Moorhead, G F; Naumov, D V; Nédélec, P; Nefedov, Yu A; Nguyen-Mau, C; Orestano, D; Pastore, F; Peak, L S; Pennacchio, E; Pessard, H; Petti, R; Placci, A; Polesello, G; Pollmann, D; Polyarush, A Yu; Popov, B; Poulsen, C; Rebuffi, L; Renò, R; Rico, J; Riemann, P; Roda, C; Rubbia, André; Salvatore, F; Schahmaneche, K; Schmidt, B; Schmidt, T; Sconza, A; Sevior, M E; Sillou, D; Soler, F J P; Sozzi, G; Steele, D; Stiegler, U; Stipcevic, M; Stolarczyk, T; Tareb-Reyes, M; Taylor, G; Tereshchenko, V V; Toropin, A N; Touchard, A M; Tovey, Stuart N; Tran, M T; Tsesmelis, E; Ulrichs, J; Vacavant, L; Valdata-Nappi, M; Valuev, V Y; Vannucci, François; Varvell, K E; Veltri, M; Vercesi, V; Vidal-Sitjes, G; Vieira, J M; Vinogradova, T G; Weber, F V; Weisse, T; Wilson, F F; Winton, L J; Yabsley, B D; Zaccone, Henri; Zuber, K; Zuccon, P
2001-01-01
We present the results of a search for nu(mu)-->nu(e) oscillations in the NOMAD experiment at CERN. The experiment looked for the appearance of nu(e) in a predominantly nu(mu) wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are delta m^2 10 eV^2.
Rollout Sampling Approximate Policy Iteration
Dimitrakakis, Christos
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 supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.
Approximate Deconvolution Reduced Order Modeling
Xie, Xuping; Wang, Zhu; Iliescu, Traian
2015-01-01
This paper proposes a large eddy simulation reduced order model(LES-ROM) framework for the numerical simulation of realistic flows. In this LES-ROM framework, the proper orthogonal decomposition(POD) is used to define the ROM basis and a POD differential filter is used to define the large ROM structures. An approximate deconvolution(AD) approach is used to solve the ROM closure problem and develop a new AD-ROM. This AD-ROM is tested in the numerical simulation of the one-dimensional Burgers equation with a small diffusion coefficient(10^{-3})
Approximation for Bayesian Ability Estimation.
1987-02-18
posterior pdfs of ande are given by p(-[Y) p(F) F P((y lei’ j)P )d. SiiJ i (4) a r~d p(e Iy) - p(t0) 1 J i P(Yij ei, (5) As shown in Tsutakawa and Lin...inverse A Hessian of the log of (27) with respect to , evaulatedat a Then, under regularity conditions, the marginal posterior pdf of O is...two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31
YAMAN, Ramazan
2001-01-01
For material handling system design, material handling equipment selection is the first stage. Also the material handling system and facility layout design problems are coupled. Solving these problems needs consideration of these three different problems. Right material handling equipment selection and good design of the material handling system and facility layout can increase productivity and reduce investments and operations' costs. In this study, after describing the m...
Approximation of NURBS Curves and Surfaces Using Adaptive Equidistant Parameterizations
Aziguli Wulamu; GOETTING Marc; ZECKZER Dirk
2005-01-01
Non-uniform rational B-spline (NURBS) curves and surfaces are very important tools for modelling curves and surfaces. Several important details, such as the choice of the sample points, of the parameterization, and of the termination condition, are however not well described. These details have a great influence on the performance of the approximation algorithm, both in terms of quality as well as time and space usage. This paper described how to sample points, examining two standard parameterizations: equidistant and chordal. A new and local parameterization, namely an adaptive equidistant model, was proposed, which enhances the equidistant model. Localization can also be used to enhance the chordal parameterization. For NURBS surfaces, one must choose which direction will be approximated first and must pay special attention to surfaces of degree 1 which have to be handled as a special case.
Molen, H.F. van der; Sluiter, J.; Hulshof, C.T.J.; Vink, P.; Frings-Dresen, M.H.W.
2005-01-01
This is a study of the effectiveness of interventions to reduce the physical work demands associated with manual (materials) handling in the work situation and musculoskeletal symptoms in the longer term. A systematic electronic literature search between 1990 and February 2003 was performed in 5 dat
Approximate nearest neighbors via dictionary learning
Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2011-06-01
Approximate Nearest Neighbors (ANN) in high dimensional vector spaces is a fundamental, yet challenging problem in many areas of computer science, including computer vision, data mining and robotics. In this work, we investigate this problem from the perspective of compressive sensing, especially the dictionary learning aspect. High dimensional feature vectors are seldom seen to be sparse in the feature domain; examples include, but not limited to Scale Invariant Feature Transform (SIFT) descriptors, Histogram Of Gradients, Shape Contexts, etc. Compressive sensing advocates that if a given vector has a dense support in a feature space, then there should exist an alternative high dimensional subspace where the features are sparse. This idea is leveraged by dictionary learning techniques through learning an overcomplete projection from the feature space so that the vectors are sparse in the new space. The learned dictionary aids in refining the search for the nearest neighbors to a query feature vector into the most likely subspace combination indexed by its non-zero active basis elements. Since the size of the dictionary is generally very large, distinct feature vectors are most likely to have distinct non-zero basis. Utilizing this observation, we propose a novel representation of the feature vectors as tuples of non-zero dictionary indices, which then reduces the ANN search problem into hashing the tuples to an index table; thereby dramatically improving the speed of the search. A drawback of this naive approach is that it is very sensitive to feature perturbations. This can be due to two possibilities: (i) the feature vectors are corrupted by noise, (ii) the true data vectors undergo perturbations themselves. Existing dictionary learning methods address the first possibility. In this work we investigate the second possibility and approach it from a robust optimization perspective. This boils down to the problem of learning a dictionary robust to feature
Plasma Physics Approximations in Ares
Managan, R. A.
2015-01-08
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, F_{n}( μ/θ ), 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.
Rational approximations to fluid properties
Kincaid, J. M.
1990-05-01
The purpose of this report is to summarize some results that were presented at the Spring AIChE meeting in Orlando, Florida (20 March 1990). We report on recent attempts to develop a systematic method, based on the technique of rational approximation, for creating mathematical models of real-fluid equations of state and related properties. Equation-of-state models for real fluids are usually created by selecting a function tilde p(T,rho) that contains a set of parameters (gamma sub i); the (gamma sub i) is chosen such that tilde p(T,rho) provides a good fit to the experimental data. (Here p is the pressure, T the temperature and rho is the density). In most cases, a nonlinear least-squares numerical method is used to determine (gamma sub i). There are several drawbacks to this method: one has essentially to guess what tilde p(T,rho) should be; the critical region is seldom fit very well and nonlinear numerical methods are time consuming and sometimes not very stable. The rational approximation approach we describe may eliminate all of these drawbacks. In particular, it lets the data choose the function tilde p(T,rho) and its numerical implementation involves only linear algorithms.
Sodium Handling Technology and Engineering Design of the Madison Dynamo Experiment.
Kendrick, R.; Forest, C. B.; O'Connell, R.; Wright, A.; Robinson, K.
1998-11-01
A new liquid metal MHD experiment is being constructed at the University of Wisconsin to test several key predictions of dynamo theory: magnetic instabilities driven by sheared flow, the effects of turbulence on current generation, and the back-reaction of the self-generated magnetic field on the fluid motion which brings saturation. This presentation describes the engineering design of the experiment, which is a 0.5 m radius spherical vessel, filled with liquid sodium at 150 degrees Celsius. The experiment is designed to achieve a magnetic Reynolds number in excess of 100, which requires approximately 80 Hp of mechanical drive, producing flow velocities in sodium of 15 m/s through impellers. Handling liquid sodium offers a number of technical challenges, but routine techniques have been developed over the past several decades for safely handling large quantities for the fast breeder reactor. The handling strategy is discussed, technical details concerning seals and pressurazation are presented, and safety elements are highlighted.
Editorial Special issue on approximate dynamic programming and reinforcement learning
Silvia Ferrari; Jagannathan Sarangapani; Frank L. Lewis
2011-01-01
We are extremely pleased to present this special issue of the Journal of Control Theory and Applications.Approximate dynamic programming (ADP) is a general and effective approach for solving optimal control and estimation problems by adapting to uncertain environments over time.ADP optimizes the sensing objectives accrued over a future time interval with respect to an adaptive control law,conditioned on prior knowledge of the system,its state,and uncertainties.A numerical search over the present value of the control minimizes a Hamilton-Jacobi-Bellman (HJB) equation providing a basis for real-time,approximate optimal control.
APPECT: An Approximate Backbone-Based Clustering Algorithm for Tags
Zong, Yu; Xu, Guandong; Jin, Pin
2011-01-01
algorithm for Tags (APPECT). The main steps of APPECT are: (1) we execute the K-means algorithm on a tag similarity matrix for M times and collect a set of tag clustering results Z={C1,C2,…,Cm}; (2) we form the approximate backbone of Z by executing a greedy search; (3) we fix the approximate backbone...... resulting from the severe difficulty of ambiguity, redundancy and less semantic nature of tags. Clustering method is a useful tool to address the aforementioned difficulties. Most of the researches on tag clustering are directly using traditional clustering algorithms such as K-means or Hierarchical...
Kriging-approximation simulated annealing algorithm for groundwater modeling
Shen, C. H.
2015-12-01
Optimization algorithms are often applied to search best parameters for complex groundwater models. Running the complex groundwater models to evaluate objective function might be time-consuming. This research proposes a Kriging-approximation simulated annealing algorithm. Kriging is a spatial statistics method used to interpolate unknown variables based on surrounding given data. In the algorithm, Kriging method is used to estimate complicate objective function and is incorporated with simulated annealing. The contribution of the Kriging-approximation simulated annealing algorithm is to reduce calculation time and increase efficiency.
Polygonal Approximation Using an Artificial Bee Colony Algorithm
Shu-Chien Huang
2015-01-01
Full Text Available A polygonal approximation method based on the new artificial bee colony (NABC algorithm is proposed in this paper. In the present method, a solution is represented by a vector, and the objective function is defined as the integral square error between the given curve and its corresponding polygon. The search process, including the employed bee stage, the onlooker bee stage, and the scout bee stage, has been constructed for this specific problem. Most experiments show that the present method when compared with the DE-based method can obtain superior approximation results with less error norm with respect to the original curves.
APPECT: An Approximate Backbone-Based Clustering Algorithm for Tags
Zong, Yu; Xu, Guandong; Jin, Pin
2011-01-01
algorithm for Tags (APPECT). The main steps of APPECT are: (1) we execute the K-means algorithm on a tag similarity matrix for M times and collect a set of tag clustering results Z={C1,C2,…,Cm}; (2) we form the approximate backbone of Z by executing a greedy search; (3) we fix the approximate backbone...... resulting from the severe difficulty of ambiguity, redundancy and less semantic nature of tags. Clustering method is a useful tool to address the aforementioned difficulties. Most of the researches on tag clustering are directly using traditional clustering algorithms such as K-means or Hierarchical...
Analysis of aircraft longitudinal handling qualities
Hess, R. A.
1981-01-01
The optimal control model (OCM) of the human pilot is applied to the study of aircraft handling qualities. Attention is focused primarily on longitudinal tasks. The modeling technique differs from previous applications of the OCM in that considerable effort is expended in simplifying the pilot/vehicle analysis. After briefly reviewing the OCM, a technique for modeling the pilot controlling higher order systems is introduced. Following this, a simple criterion for determining the susceptibility of an aircraft to pilot induced oscillations (PIO) is formulated. Finally, a model-based metric for pilot rating prediction is discussed. The resulting modeling procedure provides a relatively simple, yet unified approach to the study of a variety of handling qualities problems.
Energy efficiency in air handling applications
Fontaine, P. [Australian Baldor (Australia)
1995-07-01
It is estimated that the cost of air handling in a typical office building is $25,000 to $60,000 per 10,000 sq metres. New technologies are now available to reduce this by 50 percent with an investment that is recoverable within two years. Old systems of air handling operated at full speed with flow rates changed by mechanical vanes or dampers. The excess capacity generated is wasting energy which could be saved using modern motor controls that match the system output with actual needs. Comparisons of relative energy consumptions of different fan flow control methods show that the more time a system spends throttled down, the better candidate it is for the more efficient Variable Speed Drive (VSD) device which matches the motor`s speed to actual needs. The use of VSD instead of vanes and dampers reduces operating costs which impacts directly on profitability. 2 tables, 1 fig.
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners. Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the
Gaona Román, Alejandro
2015-01-01
"Search in" consiste en una instalación artística compuesta por escultura y video con un trasfondo conceptual sobre la identidad. Es una obra que invita al espectador a rodearla e introducirse en ella viéndose así como parte de la obra, al igual que el concepto de identidad puede vivirse desde la sensación del “yo” separado del mundo y a su vez desde el “yo” como parte de la sociedad. Nos hace viajar desde nuestros inicios como sociedad y seres conscientes hasta la actualidad, la era de las c...
Handling System for Iridium-192 Seeds
Carpenter, W.; Wodicka, D.
1973-01-01
A complete system is proposed for safe handling of iridium-192 seeds used to internally irradiate malignant growths. A vibratory hopper feeds the seeds onto a transport system for deposit in a magazine or storage area. A circular magazine consisting of segmented plastic tubing with holes in the walls to accommodate the seeds seems feasible. The magazine is indexed to stop and release a seed for calibration and deposition.
NB Power`s fish handling facilities
Hickman, C. N. [New Brunswick Power, Fredericton, NB (Canada)
1995-12-31
Fish handling facilities at the various hydroelectric power generating stations of New Brunswick Power on the St. John River, were described. The facilities described included the fish hoist at the Beechwood Generating Station , the fish ladder at the Tobique Generating Station and a trap and truck operation at the Mactaquac Station. Details of operating arrangements were provided. Operating issues, solutions and ongoing efforts to improve operations further, were discussed. 4 refs., 4 figs.
Reactions and interactions in handling anticancer drugs.
D'Arcy, P F
1983-01-01
The clinical toxicity of anticancer drugs has been well documented with regard to the adverse effects of treatment in patients. However, many of these drugs have a direct irritant effect on the skin, eyes, mucous membranes, and other tissues. Handled without due care, especially when being prepared for injection, most cytotoxic drugs can cause local toxic or allergic reactions; they also present hazards of carcinogenicity and mutagenicity. This spectrum of potential risk should be kept in mind by personnel administering or handling these drugs, especially in oncology units where just a few individuals may routinely and frequently reconstitute many doses of cytotoxic agents. This is work in which the hospital pharmacist should and must be involved; indeed, many of the techniques and skills required are identical with those used in standard aseptic procedures for preparing pharmaceutical products. Pharmacy departments should take the initiative in making hospital staff aware of the potential risks of handling neoplastic agents, and they should spearhead a multidisciplinary assessment for producing local guidelines for working with these drugs. This article warns practitioners about the inherent dangers of these practitioner-drug interactions and suggests ways in which they may be reduced. Information is given in tabular form regarding recommended procedures for reconstituting 24 anticancer drugs and precautions to protect the personnel handling them, especially when there is spillage of powdered or liquid drugs. Also, guidelines are given about incompatibilities with admixtures of such drugs, and the literature is reviewed relative to recent developments in hospital pharmacy departments where reconstitution of anticancer drugs has been incorporated into existing intravenous fluid preparation/admixture units. Not only has this been shown to be safer and more effective in terms of time and labor, but also it has cut the cost of injectable cytotoxic drugs by an
Browsing TAP Services with TapHandle
Louys, M.; Michel, L.; Mantelet, G.; Bonnarel, F.
2012-09-01
TapHandle is a Web application merging multiple services based on the IVOA Table Access Protocol (TAP) in one page. TAP resources are presented in an expandable tree whose leaves represent SQL tables. Both table description and content can be immediately displayed. A smart ADQL editor helps to setup queries on one table. A shopping cart facility allows users to get data of interest. A filter enriches the data layout with anchors pointing to remote services.
Statistical methods for handling incomplete data
Kim, Jae Kwang
2013-01-01
""… this book nicely blends the theoretical material and its application through examples, and will be of interest to students and researchers as a textbook or a reference book. Extensive coverage of recent advances in handling missing data provides resources and guidelines for researchers and practitioners in implementing the methods in new settings. … I plan to use this as a textbook for my teaching and highly recommend it.""-Biometrics, September 2014
Development of spent fuel remote handling technology
Yoon, Ji Sup; Park, B. S.; Park, Y. S.; Oh, S. C.; Kim, S. H.; Cho, M. W.; Hong, D. H
1997-12-01
Since the nation`s policy on spent fuel management is not finalized, the technical items commonly required for safe management and recycling of spent fuel - remote technologies of transportation, inspection, maintenance, and disassembly of spent fuel - are selected and pursued. In this regards, the following R and D activities are carried out : collision free transportation of spent fuel assembly, mechanical disassembly of spent nuclear fuel and graphical simulation of fuel handling / disassembly process. (author). 36 refs., 16 tabs., 77 figs
Remote handling systems for the Pride application
NONE
2010-10-15
In this paper is described the development of remote handling systems for use in the pyro processing technology development. Remote handling systems mainly include a BDSM (Bridge transported Dual arm Servo-Manipulator) and a simulator, all of which will be applied to the Pride (Pyro process integrated inactive demonstration facility) that is under construction at KAERI. BDMS that will traverse the length of the ceiling is designed to have two pairs of master-slave manipulators of which each pair of master-slave manipulators has a kinematic similarity and a force reflection. A simulator is also designed to provide an efficient means for simulating and verifying the conceptual design, developments, arrangements, and rehearsal of the pyro processing equipment and relevant devices from the viewpoint of remote operation and maintenance. In our research is presented activities and progress made in developing remote handling systems to be used for the remote operation and maintenance of the pyro processing equipment and relevant devices in the Pride. (Author)
Renal sodium handling and sodium sensitivity
Alissa A. Frame
2017-06-01
Full Text Available The pathophysiology of hypertension, which affects over 1 billion individuals worldwide, involves the integration of the actions of multiple organ systems, including the kidney. The kidney, which governs sodium excretion via several mechanisms including pressure natriuresis and the actions of renal sodium transporters, is central to long term blood pressure regulation and the salt sensitivity of blood pressure. The impact of renal sodium handling and the salt sensitivity of blood pressure in health and hypertension is a critical public health issue owing to the excess of dietary salt consumed globally and the significant percentage of the global population exhibiting salt sensitivity. This review highlights recent advances that have provided new insight into the renal handling of sodium and the salt sensitivity of blood pressure, with a focus on genetic, inflammatory, dietary, sympathetic nervous system and oxidative stress mechanisms that influence renal sodium excretion. Increased understanding of the multiple integrated mechanisms that regulate the renal handling of sodium and the salt sensitivity of blood pressure has the potential to identify novel therapeutic targets and refine dietary guidelines designed to treat and prevent hypertension.
D0 data handling operational experience
Lee Lueking et al.
2003-08-11
We report on the production experience of the D0 experiment at the Fermilab Tevatron, using the SAM data handling system with a variety of computing hardware configurations, batch systems, and mass storage strategies. We have stored more than 300 TB of data in the Fermilab Enstore mass storage system. We deliver data through this system at an average rate of more than 2 TB/day to analysis programs, with a substantial multiplication factor in the consumed data through intelligent cache management. We handle more than 1.7 Million files in this system and provide data delivery to user jobs at Fermilab on four types of systems: a reconstruction farm, a large SMP system, a Linux batch cluster, and a Linux desktop cluster. In addition, we import simulation data generated at 6 sites worldwide, and deliver data to jobs at many more sites. We describe the scope of the data handling deployment worldwide, the operational experience with this system, and the feedback of that experience.
Improving Memory Error Handling Using Linux
Carlton, Michael Andrew [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Blanchard, Sean P. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Debardeleben, Nathan A. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2014-07-25
As supercomputers continue to get faster and more powerful in the future, they will also have more nodes. If nothing is done, then the amount of memory in supercomputer clusters will soon grow large enough that memory failures will be unmanageable to deal with by manually replacing memory DIMMs. "Improving Memory Error Handling Using Linux" is a process oriented method to solve this problem by using the Linux kernel to disable (offline) faulty memory pages containing bad addresses, preventing them from being used again by a process. The process of offlining memory pages simplifies error handling and results in reducing both hardware and manpower costs required to run Los Alamos National Laboratory (LANL) clusters. This process will be necessary for the future of supercomputing to allow the development of exascale computers. It will not be feasible without memory error handling to manually replace the number of DIMMs that will fail daily on a machine consisting of 32-128 petabytes of memory. Testing reveals the process of offlining memory pages works and is relatively simple to use. As more and more testing is conducted, the entire process will be automated within the high-performance computing (HPC) monitoring software, Zenoss, at LANL.
Handle-attachments from nubia. A note
William CULICAN
2009-10-01
Full Text Available Information on the distinctive bronze handle - attachments in the shape of a pair of human hands has been painstakingly collected by Dr. E. Cuadrado in his Refertorio de los Recipientes Rituales metálicos con "Asas de Manos" de la Península Ibérica (Trabajos de Prehistoria XXI, Madrid 1966. There is little room to doubt that metal vessels with this form of handle, whether we regard them as braziers (braserillos in the older terminology or 'ritual vessels' as does Cuadrado, are related to the distribution of Phoenician or Punic trade and influence in the Iberian peninsula. The southerly 'Tartessian' distribution speaks for itself; for the western 'Levantine' distribution (from Murcia, Alicante, Valencia, Teruel, Tarragona, Málaga, Ibiza we can postulate Ibiza, Málaga or Cartagena as a probable distribution centre. The examples in the west central meseta (Sanchorreja, El Berrueco, La Osera come as no surprise in view of the fact that such obviously Phoenician objects as the Sanchorreja belt-buckle, the Berrueco bronzes reached the regions of Avila and Salamanca respectively. Even for the outlying spot on the hand-handle distribution map at Santa Olaya, the cèltic oppidum at the mouth of the River Mondego, a context of Phoenician trade is likely, since pottery of Carmona and later types was found there and is now in the museum at Figueira da Foz.
Vestibule and Cask Preparation Mechanical Handling Calculation
N. Ambre
2004-05-26
The scope of this document is to develop the size, operational envelopes, and major requirements of the equipment to be used in the vestibule, cask preparation area, and the crane maintenance area of the Fuel Handling Facility. This calculation is intended to support the License Application (LA) submittal of December 2004, in accordance with the directive given by DOE correspondence received on the 27th of January 2004 entitled: ''Authorization for Bechtel SAIC Company L.L.C. to Include a Bare Fuel Handling Facility and Increased Aging Capacity in the License Application, Contract Number DE-AC28-01R W12101'' (Ref. 167124). This correspondence was appended by further correspondence received on the 19th of February 2004 entitled: ''Technical Direction to Bechtel SAIC Company L.L. C. for Surface Facility Improvements, Contract Number DE-AC28-01R W12101; TDL No. 04-024'' (Ref. 16875 1). These documents give the authorization for a Fuel Handling Facility to be included in the baseline. The limitations of this preliminary calculation lie within the assumptions of section 5 , as this calculation is part of an evolutionary design process.
Complex method for approximated solutions to Born-Infeld equation
Ferraro, Rafael
2015-01-01
We display the method to solve the Born-Infeld equation in the complex plane. As the exact solution is obtained in an implicit form, we turn it into an explicit form by means of a perturbative procedure which takes care of secular behaviors common to this kind of approximations. We apply the method to build solutions to Born-Infeld electrodynamics. In particular, we study BI electromagnetic waves at interfaces, with the aim of searching for effects susceptible of experimental detection.
Dodgson's Rule Approximations and Absurdity
McCabe-Dansted, John C
2010-01-01
With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe et al., 2003), unlike the traditional Dodgson rule. We call this rule DC and introduce two new related rules (DR and D&). Dodgson did not explicitly propose the "Dodgson rule" (Tideman, 1987); we argue that DC and DR are better realizations of the principle behind the Dodgson rule than the traditional Dodgson rule. These rules, especially D&, are also effective approximations to the traditional Dodgson's rule. We show that, unlike the rules we have considered previously, the DC, DR and D& scores differ from the Dodgson score by no more than a fixed amount given a fixed number of alternatives, and thus these new rules converge to Dodgson under any reasonable assumption on voter behaviour, including the Impartial Anonymous Culture assumption.
Approximation by double Walsh polynomials
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.
Approximate reduction of dynamical systems
Tabuada, Paulo; Julius, Agung; Pappas, George J
2007-01-01
The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with mechanical systems with symmetry--which, unfortunately, limits the type of systems to which it can be applied. The goal of this paper is to consider a more general form of reduction, termed approximate reduction, in order to extend the class of systems that can be reduced. Using notions related to incremental stability, we give conditions on when a dynamical system can be projected to a lower dimensional space while providing hard bounds on the induced errors, i.e., when it is behaviorally similar to a dynamical system on a lower dimensional space. These concepts are illustrated on a series of examples.
Diophantine approximations and Diophantine equations
Schmidt, Wolfgang M
1991-01-01
"This book by a leading researcher and masterly expositor of the subject studies diophantine approximations to algebraic numbers and their applications to diophantine equations. The methods are classical, and the results stressed can be obtained without much background in algebraic geometry. In particular, Thue equations, norm form equations and S-unit equations, with emphasis on recent explicit bounds on the number of solutions, are included. The book will be useful for graduate students and researchers." (L'Enseignement Mathematique) "The rich Bibliography includes more than hundred references. The book is easy to read, it may be a useful piece of reading not only for experts but for students as well." Acta Scientiarum Mathematicarum
Truthful approximations to range voting
Filos-Ratsika, Aris; Miltersen, Peter Bro
We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare...... maximization in this setting. With m being the number of alternatives, we exhibit a randomized truthful-in-expectation ordinal mechanism implementing an outcome whose expected social welfare is at least an Omega(m^{-3/4}) fraction of the social welfare of the socially optimal alternative. On the other hand, we...... show that for sufficiently many agents and any truthful-in-expectation ordinal mechanism, there is a valuation profile where the mechanism achieves at most an O(m^{-{2/3}) fraction of the optimal social welfare in expectation. We get tighter bounds for the natural special case of m = 3...
Approximation of Surfaces by Cylinders
Randrup, Thomas
1998-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
Analytical approximations for spiral waves
Löber, Jakob, E-mail: jakob@physik.tu-berlin.de; Engel, Harald [Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstrasse 36, EW 7-1, 10623 Berlin (Germany)
2013-12-15
We propose a non-perturbative attempt to solve the kinematic equations for spiral waves in excitable media. From the eikonal equation for the wave front we derive an implicit analytical relation between rotation frequency Ω and core radius R{sub 0}. For free, rigidly rotating spiral waves our analytical prediction is in good agreement with numerical solutions of the linear eikonal equation not only for very large but also for intermediate and small values of the core radius. An equivalent Ω(R{sub +}) dependence improves the result by Keener and Tyson for spiral waves pinned to a circular defect of radius R{sub +} with Neumann boundaries at the periphery. Simultaneously, analytical approximations for the shape of free and pinned spirals are given. We discuss the reasons why the ansatz fails to correctly describe the dependence of the rotation frequency on the excitability of the medium.
On quantum and approximate privacy
Klauck, H
2001-01-01
This paper studies privacy in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not increased by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) privately which are not computable using quantum communication without leakage or using classical communication with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of o(1) instead of privacy loss 0.
IONIS: Approximate atomic photoionization intensities
Heinäsmäki, Sami
2012-02-01
A program to compute relative atomic photoionization cross sections is presented. The code applies the output of the multiconfiguration Dirac-Fock method for atoms in the single active electron scheme, by computing the overlap of the bound electron states in the initial and final states. The contribution from the single-particle ionization matrix elements is assumed to be the same for each final state. This method gives rather accurate relative ionization probabilities provided the single-electron ionization matrix elements do not depend strongly on energy in the region considered. The method is especially suited for open shell atoms where electronic correlation in the ionic states is large. Program summaryProgram title: IONIS Catalogue identifier: AEKK_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKK_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 1149 No. of bytes in distributed program, including test data, etc.: 12 877 Distribution format: tar.gz Programming language: Fortran 95 Computer: Workstations Operating system: GNU/Linux, Unix Classification: 2.2, 2.5 Nature of problem: Photoionization intensities for atoms. Solution method: The code applies the output of the multiconfiguration Dirac-Fock codes Grasp92 [1] or Grasp2K [2], to compute approximate photoionization intensities. The intensity is computed within the one-electron transition approximation and by assuming that the sum of the single-particle ionization probabilities is the same for all final ionic states. Restrictions: The program gives nonzero intensities for those transitions where only one electron is removed from the initial configuration(s). Shake-type many-electron transitions are not computed. The ionized shell must be closed in the initial state. Running time: Few seconds for a
Approximate analytic solutions to the NPDD: Short exposure approximations
Close, Ciara E.; Sheridan, John T.
2014-04-01
There have been many attempts to accurately describe the photochemical processes that take places in photopolymer materials. As the models have become more accurate, solving them has become more numerically intensive and more 'opaque'. Recent models incorporate the major photochemical reactions taking place as well as the diffusion effects resulting from the photo-polymerisation process, and have accurately described these processes in a number of different materials. It is our aim to develop accessible mathematical expressions which provide physical insights and simple quantitative predictions of practical value to material designers and users. In this paper, starting with the Non-Local Photo-Polymerisation Driven Diffusion (NPDD) model coupled integro-differential equations, we first simplify these equations and validate the accuracy of the resulting approximate model. This new set of governing equations are then used to produce accurate analytic solutions (polynomials) describing the evolution of the monomer and polymer concentrations, and the grating refractive index modulation, in the case of short low intensity sinusoidal exposures. The physical significance of the results and their consequences for holographic data storage (HDS) are then discussed.
CANISTER HANDLING FACILITY CRITICALITY SAFETY CALCULATIONS
C.E. Sanders
2005-04-07
This design calculation revises and updates the previous criticality evaluation for the canister handling, transfer and staging operations to be performed in the Canister Handling Facility (CHF) documented in BSC [Bechtel SAIC Company] 2004 [DIRS 167614]. The purpose of the calculation is to demonstrate that the handling operations of canisters performed in the CHF meet the nuclear criticality safety design criteria specified in the ''Project Design Criteria (PDC) Document'' (BSC 2004 [DIRS 171599], Section 4.9.2.2), the nuclear facility safety requirement in ''Project Requirements Document'' (Canori and Leitner 2003 [DIRS 166275], p. 4-206), the functional/operational nuclear safety requirement in the ''Project Functional and Operational Requirements'' document (Curry 2004 [DIRS 170557], p. 75), and the functional nuclear criticality safety requirements described in the ''Canister Handling Facility Description Document'' (BSC 2004 [DIRS 168992], Sections 3.1.1.3.4.13 and 3.2.3). Specific scope of work contained in this activity consists of updating the Category 1 and 2 event sequence evaluations as identified in the ''Categorization of Event Sequences for License Application'' (BSC 2004 [DIRS 167268], Section 7). The CHF is limited in throughput capacity to handling sealed U.S. Department of Energy (DOE) spent nuclear fuel (SNF) and high-level radioactive waste (HLW) canisters, defense high-level radioactive waste (DHLW), naval canisters, multicanister overpacks (MCOs), vertical dual-purpose canisters (DPCs), and multipurpose canisters (MPCs) (if and when they become available) (BSC 2004 [DIRS 168992], p. 1-1). It should be noted that the design and safety analyses of the naval canisters are the responsibility of the U.S. Department of the Navy (Naval Nuclear Propulsion Program) and will not be included in this document. In addition, this calculation is valid for
Waste Handling Equipment Devleopment Test and Evaluation
R.L. Tome
1998-12-01
The purpose of this study is to identify candidate Monitored Geologic Repository (MGR) surface waste handling equipment for development testing. This study will also identify strategies for performing the development tests. Development testing shall be implemented to support detail design and reduce design risks. Development testing shall be conducted to confirm design concepts, evaluate alternative design concepts, show the availability of needed technology, and provide design documentation. The candidate equipment will be selected from MGR surface waste handling equipment that is the responsibility of the Management and Operating Contractor (M&O) Surface Design Department. The equipment identified in this study is based on Viability Assessment (VA) design. The ''Monitored Geologic Repository Test and Evaluation Plan'' (MGR T&EP), Reference 5.1, was used as a basis for this study. The MGR T&EP reflects the extent of test planning and analysis that can be conducted, given the current status of the MGR requirements and latest VA design information. The MGR T&EP supports the appropriate sections in the license application (LA) in accordance with 10 CFR 60.2 1(c)(14). The MGR T&EP describes the following test activities: site characterization to confirm, by test and analysis, the suitability of the Yucca Mountain site for housing a geologic repository; development testing to investigate and document design concepts to reduce risk; qualification testing to verify equipment compliance with design requirements, specifications, and regulatory requirements; system testing to validate compliance with MGR requirements, which include the receipt, handling, retrieval, and disposal of waste; periodic performance testing to verify preclosure requirements and to demonstrate safe and reliable MGR operation; and performance confirmation modeling, testing, and analysis to verify adherence to postclosure regulatory requirements. Development test activities can be
Stochastic approximation with state-dependent noise
无
2000-01-01
The purpose of stochastic approximation (SA) is to find the roots of f(·) or the maximizer (minimizer) of L(·) when the unknown function f(·) or L(·) can be observed but with noise. SA is an important tool in dealing with many problems arising from systems and control, whose solutions often rely on convergence of the SA algorithm applied. Here the pathwise convergence of SA algorithms is considered, when the observation noise may depend on state by which we mean those x at which f(x) or L(x) are observed. The conditions imposed on the observation noise are the weakest in comparison with the existing ones. When the algorithm is to find the roots of f(·), the superiority of the condition given in the paper over those used in literature consists in the fact that the present condition is directly verifiable, needless to see the behaviour of the algorithm. When the algorithm is to find the maximizer (minimizer) of L(·), the present conditioin allows the observation noise to depend on the state. The conditions imposed on f(·) and L(·) are truly general: f(·) is required to be measurable and locally bounded if the roots of f(·) are sought, and the gradient of L(·) is required to be locally Lipschitz continuous if the maximizer (minimizer) of L(·) is searched.
HaNDL Syndrome Presenting During Pregnancy: A Case Report and Review of the Literature
Yüksel Kaplan
2014-09-01
Full Text Available Headache associated with neurological deficits and cerebrospinal fluid lymphocytosis (HaNDL is a self-limited syndrome characterized by sudden-onset headache with a temporary neurological deficit and cerebrospinal fluid (CSF lymphocytosis. We aimed to disscus a case of HaNDL syndrome presenting during pregnancy with relevant literature. A 20-year-old female presented with a 5-day history of severe, bilateral throbbing headache accompanied by nausea, vomiting, and phonophobia. Approximately 2 days after the pain developed, she became acutely confused for less than 90 minutes. 2 days after this episode, she experienced again confusional state and left hemiparesis. There were no symptoms consistent with meningoencephalitis. She was pregnant and at 11 weeks gestation. A neurologic examination showed confusional state, bilateral papilledema, and mild left hemiparesis. The neuroradiological examination was normal. The cerebrospinal fluid revealed lymphocytic pleocytosis, mildly elevated protein, and increased opening pressure. She recovered completely after 8 days. The precise etiology of HaNDL is unknown, although an inflammatory or infectious origin and autoimmune factors have been proposed. Moreover, the risk factors and medical conditions associated with HaNDL are unknown. It is obviously difficult to determine whether the pregnancy was coincidental or associated in this case. We believe that comprehensive studies are needed to clarify the risk factors and medical conditions associated with HaNDL.
Arctic Data Explorer: A Rich Solr Powered Metadata Search Portal
Liu, M.; Truslove, I.; Yarmey, L.; Lopez, L.; Reed, S. A.; Brandt, M.
2013-12-01
The Advanced Cooperative Arctic Data and Information Service (ACADIS) manages data and is the gateway for all relevant Arctic physical, life, and social science data for the Arctic Sciences (ARC) research community. Arctic Data Explorer (ADE), developed by the National Snow and Ice Data Center (NSIDC) under the ACADIS umbrella, is a data portal that provides users the ability to search across multiple Arctic data catalogs rapidly and precisely. In order to help the users quickly find the data they are interested in, we provided a simple search interface -- a search box with spatial and temporal options. The core of the interface is a ';google-like' single search box with logic to handle complex queries behind the scenes. ACADIS collects all metadata through the GI-Cat metadata broker service and indexes it in Solr. The single search box is implemented as a text based search utilizing the powerful tools provided by Solr. In this poster, we briefly explain Solr's indexing and searching capabilities. Several examples are presented to illustrate the rich search functionality the simple search box supports. Then we dive into the implementation details such as how phrase query, wildcard query, range query, fuzzy query and special query search term handling was integrated into ADE search. To provide our users the most relevant answers to their queries as quickly as possible, we worked with the Advisory Committee and the expanding Arctic User Community (scientists and data experts) to collect feedback to improve the search results and adjust the relevance/ranking logic to return more precise search results. The poster has specific examples on how we tuned the relevance ranking to achieve higher quality search results. A feature in the plan is to provide data sets recommendations based on user's current search history. Both collaborative filtering and content-based approaches were considered and researched. A feasible solution is proposed based on the content-based approach.
Web Search Engines: Search Syntax and Features.
Ojala, Marydee
2002-01-01
Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)
Web Search Engines: Search Syntax and Features.
Ojala, Marydee
2002-01-01
Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)
Solidex 86 - modern technology in bulk solids handling
1986-01-01
A total of 30 papers were presented covering the following topics: coal and ash handling; dust control and explosion hazards; pneumatic conveying; mechanical conveying; storage and wear; and weighing technology and automated materials handling. 15 papers have been abstracted separately.
7 CFR 958.53 - Handling for specified purposes.
2010-01-01
... DESIGNATED COUNTIES IN IDAHO, AND MALHEUR COUNTY, OREGON Order Regulating Handling Regulation § 958.53..., in order to facilitate the handling of onions for the following purposes whenever he finds that to...
A Green's function method for handling radiative effects on false vacuum decay
Garbrecht, Bjorn
2015-01-01
We introduce a Green's function method for handling radiative effects on false vacuum decay. In addition to the usual thin-wall approximation, we achieve further simplification by treating the bubble wall in the planar limit. As an application, we take the $\\lambda\\phi^4$ theory, extended with $N$ additional heavier scalars, wherein we calculate analytically both the functional determinant of the quadratic fluctuations about the classical soliton configuration as well as the first correction to the soliton configuration itself.
Concurrent projects: how many can you handle?
Steyn, Herman
2015-11-01
Full Text Available The number of projects a person can handle simultaneously is a relevant factor in strategic planning and in project portfolio management. Internationally the de facto standard seems to be that a person should not work on more than two or three projects simultaneously; but several factors could influence this figure. Empirical evidence indicates that, in some South African sectors, people tend to work on many more than two or three projects simultaneously. In this paper, factors that influence the number of projects a person can work on are identified so that they can be investigated in further studies. Some ideas about using key resources optimally are also presented.
Factors influencing aircraft ground handling performance
Yager, T. J.
1983-01-01
Problems associated with aircraft ground handling operations on wet runways are discussed and major factors which influence tire/runway braking and cornering traction capability are identified including runway characteristics, tire hydroplaning, brake system anomalies, and pilot inputs. Research results from tests with instrumented ground vehicles and aircraft, and aircraft wet runway accident investigation are summarized to indicate the effects of different aircraft, tire, and runway parameters. Several promising means are described for improving tire/runway water drainage capability, brake system efficiency, and pilot training to help optimize aircraft traction performance on wet runways.
Scheuer, Steen
2014-01-01
Fagbevægelsens situation og opgaver påvirkes af forandringer i de institutionelle makrostrukturer, som indebærer et øget fokus på lønrelativiteter og på at overvåge ens egen faggruppes eller erhvervsgruppes relative position i lønhierarkiet. Dette fokus er ikke nyt, men det er øget, og det er int...... serviceydelser, fagforeningerne oprindeligt blev sat i verden for at levere. Det er i disse ændrede vilkår for kollektive handling, i dette krydspres, at fagbevægelsen skal finde ny strategier og definere ny former for solidaritet...
CANISTER HANDLING FACILITY WORKER DOSE ASSESSMENT
D.T. Dexheimer
2004-02-27
The purpose of this calculation is to estimate radiation doses received by personnel working in the Canister Handling Facility (CHF) performing operations to receive transportation casks, transfer wastes, prepare waste packages, perform associated equipment maintenance. The specific scope of work contained in this calculation covers individual worker group doses on an annual basis, and includes the contributions due to external and internal radiation. The results of this calculation will be used to support the design of the CHF and provide occupational dose estimates for the License Application.
Optimal approximation of linear systems by artificial immune response
无
2006-01-01
This paper puts forward a novel artificial immune response algorithm for optimal approximation of linear systems. A quaternion model of artificial immune response is proposed for engineering computing. The model abstracts four elements, namely, antigen, antibody, reaction rules among antibodies, and driving algorithm describing how the rules are applied to antibodies, to simulate the process of immune response. Some reaction rules including clonal selection rules, immunological memory rules and immune regulation rules are introduced. Using the theorem of Markov chain, it is proofed that the new model is convergent. The experimental study on the optimal approximation of a stable linear system and an unstable one show that the approximate models searched by the new model have better performance indices than those obtained by some existing algorithms including the differential evolution algorithm and the multi-agent genetic algorithm.
76 FR 37118 - Manual Materials Handling (MMH) Workshop
2011-06-24
... HUMAN SERVICES Centers for Disease Control and Prevention Manual Materials Handling (MMH) Workshop... Health, will be holding a two-day Manual Materials Handling (MMH) Workshop. The Workshop is a National... engineering solutions for manual materials handling jobs in Retail, Wholesale and Warehouse industries....
30 CFR 77.606 - Energized trailing cables; handling.
2010-07-01
... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Energized trailing cables; handling. 77.606... COAL MINES Trailing Cables § 77.606 Energized trailing cables; handling. Energized medium- and high-voltage trailing cables shall be handled only by persons wearing protective rubber gloves (see § 77.606-1...
Execution Constraint Verification of Exception Handling on UML Sequence Diagrams
Ciraci, S.; Sözer, Hasan; Aksit, Mehmet; Havinga, W.K.
2011-01-01
Exception handling alters the control flow of the program. As such, errors introduced in exception handling code may influence the overall program in undesired ways. To detect such errors early and thereby decrease the programming costs, it is worthwhile to consider exception handling at design
49 CFR 219.205 - Specimen collection and handling.
2010-10-01
... 49 Transportation 4 2010-10-01 2010-10-01 false Specimen collection and handling. 219.205 Section... § 219.205 Specimen collection and handling. (a) General. Urine and blood specimens must be obtained, marked, preserved, handled, and made available to FRA consistent with the requirements of this subpart...
9 CFR 114.11 - Storage and handling.
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Storage and handling. 114.11 Section... BIOLOGICAL PRODUCTS § 114.11 Storage and handling. Biological products at licensed establishments shall be protected at all times against improper storage and handling. Completed product shall be kept under...
46 CFR 151.45-4 - Cargo-handling.
2010-10-01
... 46 Shipping 5 2010-10-01 2010-10-01 false Cargo-handling. 151.45-4 Section 151.45-4 Shipping COAST... LIQUID HAZARDOUS MATERIAL CARGOES Operations § 151.45-4 Cargo-handling. (a) On a United States tank barge... the persons in charge of cargo handling. (h) Auxiliary steam, air, fuel, or electric current. When...
49 CFR 176.57 - Supervision of handling and stowage.
2010-10-01
... 49 Transportation 2 2010-10-01 2010-10-01 false Supervision of handling and stowage. 176.57 Section 176.57 Transportation Other Regulations Relating to Transportation PIPELINE AND HAZARDOUS... VESSEL General Handling and Stowage § 176.57 Supervision of handling and stowage. (a) Hazardous...
30 CFR 75.817 - Cable handling and support systems.
2010-07-01
... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Cable handling and support systems. 75.817... High-Voltage Longwalls § 75.817 Cable handling and support systems. Longwall mining equipment must be provided with cable-handling and support systems that are constructed, installed and maintained to...
7 CFR 923.322 - Washington cherry handling regulation.
2010-01-01
... 7 Agriculture 8 2010-01-01 2010-01-01 false Washington cherry handling regulation. 923.322 Section... CHERRIES GROWN IN DESIGNATED COUNTIES IN WASHINGTON Order Regulating Handling Grade, Size, Container and Pack Regulation § 923.322 Washington cherry handling regulation. (a) Grade. No handler shall...
77 FR 76815 - Handling of Animals; Contingency Plans
2012-12-31
... Animal and Plant Health Inspection Service 9 CFR Parts 2 and 3 RIN 0579-AC69 Handling of Animals... handling, care, treatment, and transportation of certain animals by dealers, research facilities... humane handling, care, treatment, and transportation of animals covered by the AWA. Currently, part 3...
46 CFR 154.1850 - Entering cargo handling spaces.
2010-10-01
... 46 Shipping 5 2010-10-01 2010-10-01 false Entering cargo handling spaces. 154.1850 Section 154... cargo handling spaces. (a) The master shall ensure that the ventilation system under § 154.1200 is in... handling equipment. (b) The master shall ensure that a warning sign listing the requirement for use of the...
Handling of damaged spent fuel at Ignalina NPP
Ziehm, Ronny [NUKEM Technologies GmbH (Germany); Bechtel, Sascha [Hoefer und Bechtel GmbH (Germany)
2012-11-01
The Ignalina Nuclear Power Plant (INPP) is situated in the north-eastern part of Lithuania close to the borders with Latvia and Belarus and on the shore of Lake Druksiai. It is approximately 120 km from the capital city Vilnius. The power plant has two RMBK type water cooled graphite moderated pressure tube reactors each of design capacity 1500MW(e). The start of operation of the Unit 1 was in 1983 and of the Unit 2 in 1987. In the period 1987 - 1991 (i.e. Soviet period) a small proportion of the existing spent nuclear fuel suffered minor to major damages. In the frame of decommissioning of INPP it is necessary that this damaged fuel is retrieved from the storage pools and stored in an interim spent fuel store. NUKEM Technologies GmbH (Germany) as part of a consortium with GNS mbH (Germany) was awarded the contract for an Interim Spent Fuel Storage Facility (B1- ISFSF). This contract includes the design, procurement, manufacturing, supply and installation of a damaged fuel handling system (DFHS). Objective of this DFHS is the safe handling of spent nuclear fuel with major damages, which result in rupture of the cladding and potential loss of fuel pellets from within the cladding. Typical damages are bent fuel bundle skeletons, broken fuel rods, missing or damaged end plugs, very small gaps between fuel bundles, bent central rods between fuel bundles. The presented concept is designed for Ignalina NPP. However, the design is developed more generally to solve these problems with damaged fuel at other nuclear power plants applying these proven techniques. (orig.)
Orion Handling Qualities During ISS Rendezvous and Docking
Hart, Jeremy J.; Stephens, J. P.; Spehar, P.; Bilimoria, K.; Foster, C.; Gonzalex, R.; Sullivan, K.; Jackson, B.; Brazzel, J.; Hart, J.
2011-01-01
The Orion spacecraft was designed to rendezvous with multiple vehicles in low earth orbit (LEO) and beyond. To perform the required rendezvous and docking task, Orion must provide enough control authority to perform coarse translational maneuvers while maintaining precision to perform the delicate docking corrections. While Orion has autonomous docking capabilities, it is expected that final approach and docking operations with the International Space Station (ISS) will initially be performed in a manual mode. A series of evaluations was conducted by NASA and Lockheed Martin at the Johnson Space Center to determine the handling qualities (HQ) of the Orion spacecraft during different docking and rendezvous conditions using the Cooper-Harper scale. This paper will address the specifics of the handling qualities methodology, vehicle configuration, scenarios flown, data collection tools, and subject ratings and comments. The initial Orion HQ assessment examined Orion docking to the ISS. This scenario demonstrates the Translational Hand Controller (THC) handling qualities of Orion. During this initial assessment, two different scenarios were evaluated. The first was a nominal docking approach to a stable ISS, with Orion initializing with relative position dispersions and a closing rate of approximately 0.1 ft/sec. The second docking scenario was identical to the first, except the attitude motion of the ISS was modeled to simulate a stress case ( 1 degree deadband per axis and 0.01 deg/sec rate deadband per axis). For both scenarios, subjects started each run on final approach at a docking port-to-port range of 20 ft. Subjects used the THC in pulse mode with cues from the docking camera image, window views, and range and range rate data displayed on the Orion display units. As in the actual design, the attitude of the Orion vehicle was held by the automated flight control system at 0.5 degree deadband per axis. Several error sources were modeled including Reaction
Hybridization of Adaptive Differential Evolution with an Expensive Local Search Method
Rashida Adeeb Khanum
2016-01-01
Full Text Available Differential evolution (DE is an effective and efficient heuristic for global optimization problems. However, it faces difficulty in exploiting the local region around the approximate solution. To handle this issue, local search (LS techniques could be hybridized with DE to improve its local search capability. In this work, we hybridize an updated version of DE, adaptive differential evolution with optional external archive (JADE with an expensive LS method, Broydon-Fletcher-Goldfarb-Shano (BFGS for solving continuous unconstrained global optimization problems. The new hybrid algorithm is denoted by DEELS. To validate the performance of DEELS, we carried out extensive experiments on well known test problems suits, CEC2005 and CEC2010. The experimental results, in terms of function error values, success rate, and some other statistics, are compared with some of the state-of-the-art algorithms, self-adaptive control parameters in differential evolution (jDE, sequential DE enhanced by neighborhood search for large-scale global optimization (SDENS, and differential ant-stigmergy algorithm (DASA. These comparisons reveal that DEELS outperforms jDE and SDENS except DASA on the majority of test instances.
Obtaining exact value by approximate computations
Jing-zhong ZHANG; Yong FENG
2007-01-01
Numerical approximate computations can solve large and complex problems fast. They have the advantage of high efficiency. However they only give approximate results, whereas we need exact results in some fields. There is a gap between approximate computations and exact results.In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.
Fuzzy Set Approximations in Fuzzy Formal Contexts
Mingwen Shao; Shiqing Fan
2006-01-01
In this paper, a kind of multi-level formal concept is introduced. Based on the proposed multi-level formal concept, we present a pair of rough fuzzy set approximations within fuzzy formal contexts. By the proposed rough fuzzy set approximations, we can approximate a fuzzy set according to different precision level. We discuss the properties of the proposed approximation operators in detail.
Obtaining exact value by approximate computations
2007-01-01
Numerical approximate computations can solve large and complex problems fast.They have the advantage of high efficiency.However they only give approximate results,whereas we need exact results in some fields.There is a gap between approximate computations and exact results. In this paper,we build a bridge by which exact results can be obtained by numerical approximate computations.
Improved Scatter Search Using Cuckoo Search
Ahmed T.Sadiq Al-Obaidi
2013-02-01
Full Text Available The Scatter Search (SS is a deterministic strategy that has been applied successfully to some combinatorial and continuous optimization problems. Cuckoo Search (CS is heuristic search algorithm which is inspired by the reproduction strategy of cuckoos. This paper presents enhanced scatter search algorithm using CS algorithm. The improvement provides Scatter Search with random exploration for search space of problem and more of diversity and intensification for promising solutions. The original and improved Scatter Search has been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the improved Scatter Search algorithms produce better performance than original Scatter Search algorithm. The improvement in the value of average fitness is 23.2% comparing with original SS. The developed algorithm has been compared with other algorithms for the same problem, and the result was competitive with some algorithm and insufficient with another.
Nonlinear approximation with dictionaries I. Direct estimates
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...
Nonlinear approximation with dictionaries, I: Direct estimates
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...
Air-handling energy efficiency and design practices
Nilsson, Lars J.
1993-12-31
With good design practices and life-cycle cost optimization, specific fan power for individual fans will be between 0.5 and 1kW/m{sup 3}/s. Data from nearly 1000 audited fans in Sweden show that the average measured SFPI weighted by drawn motor power is 1.5 kW/m{sup 3}/s and the situation appears to be similar in other countries. Contract forms used by Swedish builders, and consultants` design practices are analyzed here to search for an explanation to the low performance of installed systems. Identified as two major barriers to efficient system design are the lack of performance specifications when procuring systems and the incentive structure in the building sector. As a consequence, duct design methods, rules of thumb, and vendor recommendations are not leading to system optimization. The broad minima in life cycle costs over a range of air-handling unit sizes show that potential economic welfare losses from efficiency standards are likely to be smaller than the losses that result from today`s design practices. 73 refs, 4 figs, 3 tabs
Improved Range Searching Lower Bounds
Larsen, Kasper Green; Nguyen, Huy L.
2012-01-01
Table of Contents -------------------------------------------------------------------------------- In this paper we present a number of improved lower bounds for range searching in the pointer machine and the group model. In the pointer machine, we prove lower bounds for the approximate simplex...... range reporting problem. In approximate simplex range reporting, points that lie within a distance of ε ⋅ Diam(s) from the border of a query simplex s, are free to be included or excluded from the output, where ε ≥ 0 is an input parameter to the range searching problem. We prove our lower bounds...... by constructing a hard input set and query set, and then invoking Chazelle and Rosenberg's [CGTA'96] general theorem on the complexity of navigation in the pointer machine. For the group model, we show that input sets and query sets that are hard for range reporting in the pointer machine (i.e. by Chazelle...
Nozzle extraction process and handlemeter for measuring handle
Alley, V. L., Jr.; Mchatton, A. D. (Inventor)
1978-01-01
Method and apparatus for quantitatively measuring the handle of fabrics and other flexible materials is presented. Handle is that term used to refer to the qualities of drapability, flexibility, compressibility, foldability, stretchability, pliability, etc., possessed by fabrics and other flexible materials. In the present invention the handle of a material sample is quantified by measuring the force required to draw the sample through an orifice and expressing the resultant extractive force as a function of test apparatus geometry and the amount of sample drawn through the orifice to arrive at quantitative measure of handle, to be defined as handle modulus, for the sample in question.
Brief neonatal handling alters sexually dimorphic behaviors in adult rats.
Fujimoto, Tetsuya; Kubo, Kazuhiko; Nishikawa, Yasuo; Aou, Shuji
2014-03-01
Several effects of neonatal handling on brain and behavior have been reported. We investigated the effects of neonatal handling on behaviors that have been shown to be sexually dimorphic in rats using an open-field test. "Gender differences" were observed in locomotor activity, exploratory behavior and grooming in the handled group. However, clear gender differences in these behaviors were not observed in the non-handled group. Our findings show that brief daily handling sessions (~ 1 min) in the first 2 weeks of postnatal life increased locomotor activity and exploratory behavior, and that these effects were more pronounced in females. Moreover, many rats in the non-handling group exhibited an increase in defecation relative to the handling group during the 10-min observation period. This suggests that the non-handling group experienced more stress in response to the novel open-field arena, and that this resulted in the absence of gender differences. Notably, this anxiety-related response was attenuated by neonatal handling. Our study underscores the impact of brief neonatal handling on sexually dimorphic behaviors, and indicates that caution should be exercised in controlling for the effects of handling between experimental groups, particularly in neurotoxicological studies that evaluate gender differences.
PatchMatch Filter: Edge-Aware Filtering Meets Randomized Search for Visual Correspondence.
Lu, Jiangbo; Li, Yu; Yang, Hongsheng; Min, Dongbo; Eng, Weiyong; Do, Minh N
2017-09-01
Though many tasks in computer vision can be formulated elegantly as pixel-labeling problems, a typical challenge discouraging such a discrete formulation is often due to computational efficiency. Recent studies on fast cost volume filtering based on efficient edge-aware filters provide a fast alternative to solve discrete labeling problems, with the complexity independent of the support window size. However, these methods still have to step through the entire cost volume exhaustively, which makes the solution speed scale linearly with the label space size. When the label space is huge or even infinite, which is often the case for (subpixel-accurate) stereo and optical flow estimation, their computational complexity becomes quickly unacceptable. Developed to search approximate nearest neighbors rapidly, the PatchMatch method can significantly reduce the complexity dependency on the search space size. But, its pixel-wise randomized search and fragmented data access within the 3D cost volume seriously hinder the application of efficient cost slice filtering. This paper presents a generic and fast computational framework for general multi-labeling problems called PatchMatch Filter (PMF). We explore effective and efficient strategies to weave together these two fundamental techniques developed in isolation, i.e., PatchMatch-based randomized search and efficient edge-aware image filtering. By decompositing an image into compact superpixels, we also propose superpixel-based novel search strategies that generalize and improve the original PatchMatch method. Further motivated to improve the regularization strength, we propose a simple yet effective cross-scale consistency constraint, which handles labeling estimation for large low-textured regions more reliably than a single-scale PMF algorithm. Focusing on dense correspondence field estimation in this paper, we demonstrate PMF's applications in stereo and optical flow. Our PMF methods achieve top-tier correspondence
Peggy Hinman
2010-10-01
The U.S. Department of Energy (DOE) needs to have disposal capability for remote-handled low level waste (LLW) generated at the Idaho National Laboratory (INL) at the time the existing disposal facility is full or must be closed in preparation for final remediation of the INL Subsurface Disposal Area in approximately the year 2017.
Li, Chen; Lu, Zhiqiang; Han, Xiaole; Zhang, Yuejun; Wang, Li
2016-03-01
The integrated scheduling of container handling systems aims to optimize the coordination and overall utilization of all handling equipment, so as to minimize the makespan of a given set of container tasks. A modified disjunctive graph is proposed and a mixed 0-1 programming model is formulated. A heuristic algorithm is presented, in which the original problem is divided into two subproblems. In the first subproblem, contiguous bay crane operations are applied to obtain a good quay crane schedule. In the second subproblem, proper internal truck and yard crane schedules are generated to match the given quay crane schedule. Furthermore, a genetic algorithm based on the heuristic algorithm is developed to search for better solutions. The computational results show that the proposed algorithm can efficiently find high-quality solutions. They also indicate the effectiveness of simultaneous loading and discharging operations compared with separate ones.
CERN Sells its Electronic Document Handling System
2001-01-01
The EDH team. Left to right: Derek Mathieson, Rotislav Titov, Per Gunnar Jonsson, Ivica Dobrovicova, James Purvis. Missing from the photo is Jurgen De Jonghe. In a 1 MCHF deal announced this week, the British company Transacsys bought the rights to CERN's Electronic Document Handling (EDH) system, which has revolutionised the Laboratory's administrative procedures over the last decade. Under the deal, CERN and Transacsys will collaborate on developing EDH over the coming 12 months. CERN will provide manpower and expertise and will retain the rights to use EDH, which will also be available freely to other particle physics laboratories. This development is an excellent example of the active technology transfer policy CERN is currently pursuing. The negotiations were carried out through a fruitful collaboration between AS and ETT Divisions, following the recommendations of the Technology Advisory Board, and with the help of SPL Division. EDH was born in 1991 when John Ferguson and Achille Petrilli of AS Divisi...
Primer on tritium safe handling practices
1994-12-01
This Primer is designed for use by operations and maintenance personnel to improve their knowledge of tritium safe handling practices. It is applicable to many job classifications and can be used as a reference for classroom work or for self-study. It is presented in general terms for use throughout the DOE Complex. After reading it, one should be able to: describe methods of measuring airborne tritium concentration; list types of protective clothing effective against tritium uptake from surface and airborne contamination; name two methods of reducing the body dose after a tritium uptake; describe the most common method for determining amount of tritium uptake in the body; describe steps to take following an accidental release of airborne tritium; describe the damage to metals that results from absorption of tritium; explain how washing hands or showering in cold water helps reduce tritium uptake; and describe how tritium exchanges with normal hydrogen in water and hydrocarbons.
Error handling strategies in multiphase inverse modeling
Finsterle, S.; Zhang, Y.
2010-12-01
Parameter estimation by inverse modeling involves the repeated evaluation of a function of residuals. These residuals represent both errors in the model and errors in the data. In practical applications of inverse modeling of multiphase flow and transport, the error structure of the final residuals often significantly deviates from the statistical assumptions that underlie standard maximum likelihood estimation using the least-squares method. Large random or systematic errors are likely to lead to convergence problems, biased parameter estimates, misleading uncertainty measures, or poor predictive capabilities of the calibrated model. The multiphase inverse modeling code iTOUGH2 supports strategies that identify and mitigate the impact of systematic or non-normal error structures. We discuss these approaches and provide an overview of the error handling features implemented in iTOUGH2.
Handling of wet residues in industry
Villanueva, Alejandro
In countries with high prices of fresh water use and wastewater discharge, water recycling has become an alternative to traditional water consumption and discharge for industries with water-based processes. Industrial water recycling means in many cases that water has to be treated and cleaned......, to remove from it the substances which presence impedes reusing the water. These substances accumulate in a by-product called wet residue. An integral part of water recycling projects in the industry is the handling and disposal of the wet residues generated. The treatment, utilisation and disposal of wet...... residues depend totally on the industrial sector of origin and the composition of the water to be recycled. Treatment is more problematic in some cases than in others, but in all water recycling applications it is an issue of concern. The present study addresses this concern by providing a package...
Handling Occlusions for Robust Augmented Reality Systems
Madjid Maidi
2010-01-01
Full Text Available In Augmented Reality applications, the human perception is enhanced with computer-generated graphics. These graphics must be exactly registered to real objects in the scene and this requires an effective Augmented Reality system to track the user's viewpoint. In this paper, a robust tracking algorithm based on coded fiducials is presented. Square targets are identified and pose parameters are computed using a hybrid approach based on a direct method combined with the Kalman filter. An important factor for providing a robust Augmented Reality system is the correct handling of targets occlusions by real scene elements. To overcome tracking failure due to occlusions, we extend our method using an optical flow approach to track visible points and maintain virtual graphics overlaying when targets are not identified. Our proposed real-time algorithm is tested with different camera viewpoints under various image conditions and shows to be accurate and robust.
Handling Occlusions for Robust Augmented Reality Systems
Maidi Madjid
2010-01-01
Full Text Available Abstract In Augmented Reality applications, the human perception is enhanced with computer-generated graphics. These graphics must be exactly registered to real objects in the scene and this requires an effective Augmented Reality system to track the user's viewpoint. In this paper, a robust tracking algorithm based on coded fiducials is presented. Square targets are identified and pose parameters are computed using a hybrid approach based on a direct method combined with the Kalman filter. An important factor for providing a robust Augmented Reality system is the correct handling of targets occlusions by real scene elements. To overcome tracking failure due to occlusions, we extend our method using an optical flow approach to track visible points and maintain virtual graphics overlaying when targets are not identified. Our proposed real-time algorithm is tested with different camera viewpoints under various image conditions and shows to be accurate and robust.
Handling large variations in mechanics: Some applications
K Balaji Rao; M B Anoop; S Muralidhara; B K Raghu Prasad
2015-08-01
There is a need to use probability distributions with power-law decaying tails to describe the large variations exhibited by some of the physical phenomena. The Weierstrass Random Walk (WRW) shows promise for modeling such phenomena. The theory of anomalous diffusion is now well established. It has found number of applications in Physics, Chemistry and Biology. However, its applications are limited in structural mechanics in general, and structural engineering in particular. The aim of this paper is to present some mathematical preliminaries related to WRW that would help in possible applications. In the limiting case, it represents a diffusion process whose evolution is governed by a fractional partial differential equation. Three applications of superdiffusion processes in mechanics, illustrating their effectiveness in handling large variations, are presented.
An approximation approach for uncertainty quantification using evidence theory
Bae, Ha-Rok; Grandhi, Ramana V.; Canfield, Robert A
2004-12-01
Over the last two decades, uncertainty quantification (UQ) in engineering systems has been performed by the popular framework of probability theory. However, many scientific and engineering communities realize that there are limitations in using only one framework for quantifying the uncertainty experienced in engineering applications. Recently evidence theory, also called Dempster-Shafer theory, was proposed to handle limited and imprecise data situations as an alternative to the classical probability theory. Adaptation of this theory for large-scale engineering structures is a challenge due to implicit nature of simulations and excessive computational costs. In this work, an approximation approach is developed to improve the practical utility of evidence theory in UQ analysis. The techniques are demonstrated on composite material structures and airframe wing aeroelastic design problem.
APPROXIMATE SAMPLING THEOREM FOR BIVARIATE CONTINUOUS FUNCTION
杨守志; 程正兴; 唐远炎
2003-01-01
An approximate solution of the refinement equation was given by its mask, and the approximate sampling theorem for bivariate continuous function was proved by applying the approximate solution. The approximate sampling function defined uniquely by the mask of the refinement equation is the approximate solution of the equation, a piece-wise linear function, and posseses an explicit computation formula. Therefore the mask of the refinement equation is selected according to one' s requirement, so that one may controll the decay speed of the approximate sampling function.
Bernstein-type approximations of smooth functions
Andrea Pallini
2007-10-01
Full Text Available The Bernstein-type approximation for smooth functions is proposed and studied. We propose the Bernstein-type approximation with definitions that directly apply the binomial distribution and the multivariate binomial distribution. The Bernstein-type approximations generalize the corresponding Bernstein polynomials, by considering definitions that depend on a convenient approximation coefficient in linear kernels. In the Bernstein-type approximations, we study the uniform convergence and the degree of approximation. The Bernstein-type estimators of smooth functions of population means are also proposed and studied.
Overview on Hydrate Coring, Handling and Analysis
Jon Burger; Deepak Gupta; Patrick Jacobs; John Shillinglaw
2003-06-30
Gas hydrates are crystalline, ice-like compounds of gas and water molecules that are formed under certain thermodynamic conditions. Hydrate deposits occur naturally within ocean sediments just below the sea floor at temperatures and pressures existing below about 500 meters water depth. Gas hydrate is also stable in conjunction with the permafrost in the Arctic. Most marine gas hydrate is formed of microbially generated gas. It binds huge amounts of methane into the sediments. Worldwide, gas hydrate is estimated to hold about 1016 kg of organic carbon in the form of methane (Kvenvolden et al., 1993). Gas hydrate is one of the fossil fuel resources that is yet untapped, but may play a major role in meeting the energy challenge of this century. In June 2002, Westport Technology Center was requested by the Department of Energy (DOE) to prepare a ''Best Practices Manual on Gas Hydrate Coring, Handling and Analysis'' under Award No. DE-FC26-02NT41327. The scope of the task was specifically targeted for coring sediments with hydrates in Alaska, the Gulf of Mexico (GOM) and from the present Ocean Drilling Program (ODP) drillship. The specific subjects under this scope were defined in 3 stages as follows: Stage 1: Collect information on coring sediments with hydrates, core handling, core preservation, sample transportation, analysis of the core, and long term preservation. Stage 2: Provide copies of the first draft to a list of experts and stakeholders designated by DOE. Stage 3: Produce a second draft of the manual with benefit of input from external review for delivery. The manual provides an overview of existing information available in the published literature and reports on coring, analysis, preservation and transport of gas hydrates for laboratory analysis as of June 2003. The manual was delivered as draft version 3 to the DOE Project Manager for distribution in July 2003. This Final Report is provided for records purposes.
Development of spent fuel remote handling technology
Park, B. S.; Yoon, J. S.; Hong, H. D. (and others)
2007-02-15
In this research, the remote handling technology was developed for the ACP application. The ACP gives a possible solution to reduce the rapidly cumulative amount of spent fuels generated from the nuclear power plants in Korea. The remote technologies developed in this work are a slitting device, a voloxidizer, a modified telescopic servo manipulator and a digital mock-up. A slitting device was developed to declad the spent fuel rod-cuts and collect the spent fuel UO{sub 2} pellets. A voloxidizer was developed to convert the spent fuel UO{sub 2} pellets obtained from the slitting process in to U{sub 3}O{sub 8} powder. Experiments were performed to test the capabilities and remote operation of the developed slitting device and voloxidizer by using simulated rod-cuts and fuel in the ACP hot cell. A telescopic servo manipulator was redesigned and manufactured improving the structure of the prototype. This servo manipulator was installed in the ACP hot cell, and the target module for maintenance of the process equipment was selected. The optimal procedures for remote operation were made through the maintenance tests by using the servo manipulator. The ACP digital mockup in a virtual environment was established to secure a reliability and safety of remote operation and maintenance. The simulation for the remote operation and maintenance was implemented and the operability was analyzed. A digital mockup about the preliminary conceptual design of an enginnering-scale ACP was established, and an analysis about a scale of facility and remote handling was accomplished. The real-time diagnostic technique was developed to detect the possible fault accidents of the slitting device. An assessment of radiation effect for various sensors was also conducted in the radiation environment.
Evaluating ITER remote handling middleware concepts
Koning, J.F., E-mail: j.f.koning@differ.nl [FOM Institute DIFFER, Association EURATOM-FOM, Partner in the Trilateral Euregio Cluster and ITER-NL, PO Box 1207, 3430 BE Nieuwegein (Netherlands); Heemskerk, C.J.M.; Schoen, P.; Smedinga, D. [Heemskerk Innovative Technology, Noordwijk (Netherlands); Boode, A.H. [University of Applied Sciences InHolland, Alkmaar (Netherlands); Hamilton, D.T. [ITER Organization, Route de Vinon sur Verdon, 13115 Saint Paul Lez Durance (France)
2013-10-15
Highlights: ► Remote Handling Study Centre: middleware system setup and modules built. ► Aligning to ITER RH Control System Layout: prototype of database, VR and simulator. ► OpenSplice DDS, ZeroC ICE messaging and object oriented middlewares reviewed. ► Windows network latency found problematic for semi-realtime control over the network. -- Abstract: Remote maintenance activities in ITER will be performed by a unique set of hardware systems, supported by an extensive software kit. A layer of middleware will manage and control a complex set of interconnections between teams of operators, hardware devices in various operating theatres, and databases managing tool and task logistics. The middleware is driven by constraints on amounts and timing of data like real-time control loops, camera images, and database access. The Remote Handling Study Centre (RHSC), located at FOM institute DIFFER, has a 4-operator work cell in an ITER relevant RH Control Room setup which connects to a virtual hot cell back-end. The centre is developing and testing flexible integration of the Control Room components, resulting in proof-of-concept tests of this middleware layer. SW components studied include generic human-machine interface software, a prototype of a RH operations management system, and a distributed virtual reality system supporting multi-screen, multi-actor, and multiple independent views. Real-time rigid body dynamics and contact interaction simulation software supports simulation of structural deformation, “augmented reality” operations and operator training. The paper presents generic requirements and conceptual design of middleware components and Operations Management System in the context of a RH Control Room work cell. The simulation software is analyzed for real-time performance and it is argued that it is critical for middleware to have complete control over the physical network to be able to guarantee bandwidth and latency to the components.
Safety Enhancements for TRU Waste Handling - 12258
Cannon, Curt N. [Perma-Fix Northwest Richland, Inc., Richland, WA 99354 (United States)
2012-07-01
For years, proper Health Physics practices and 'As Low As Reasonably Achievable' (ALARA) principles have fostered the use of glove boxes or other methods of handling (without direct contact) high activities of radioactive material. The physical limitations of using glove boxes on certain containers have resulted in high-activity wastes being held in storage awaiting a path forward. Highly contaminated glove boxes and other remote handling equipment no longer in use have also been added to the growing list of items held for storage with no efficient method of preparation for proper disposal without creating exposure risks to personnel. This is especially true for wastes containing alpha-emitting radionuclides such as Plutonium and Americium that pose significant health risks to personnel if these Transuranic (TRU) wastes are not controlled effectively. Like any good safety program or root cause investigation PFNW has found that the identification of the cause of a negative change, if stopped, can result in a near miss and lessons learned. If this is done in the world of safety, it is considered a success story and is to be shared with others to protect the workers. PFNW believes that the tools, equipment and resources have improved over the past number of years but that the use of them has not progressed at the same rate. If we use our tools to timely identify the effect on the work environment and immediately following or possibly even simultaneously identify the cause or some of the causal factors, we may have the ability to continue to work rather than succumb to the start and stop-work mentality trap that is not beneficial in waste minimization, production efficiency or ALARA. (authors)
Instruments for minimally invasive surgery: principles of ergonomic handles.
Matern, U; Waller, P
1999-02-01
Although the advantages of minimally invasive surgery (MIS) have been clearly established for the patient, the surgeon must cope with disadvantages caused by unergonomic instrument handles. Pressure areas and persisting nerve lesions have been described in the literature. The shape of the instrument handles has been identified as the reason for these disorders. To prevent these, it is necessary to use ergonomically designed handles for MIS instruments. Anatomic, physiologic, and ergonomic facts as well as the results of the authors' own experiences and tests are presented. On this basis, an ideal ergonomic working posture for the laparoscopic surgeon and an optimal grasp for manipulating the instruments' functional elements are recommended. To enable the surgeon to evaluate ergonomic handles for MIS instruments according to his own needs, 14 criteria for genuine "ergonomic handles" are established. On the basis of these criteria, deficiencies of handles currently available (ring and shank handles at an angle or with axial extension to the instrument shaft, and pistol handles) are discussed. Furthermore, new handles, developed by the authors according to the criteria for genuine ergonomic handles, are presented.
Slater, Charlotte; Dymond, Simon
2011-03-01
Inappropriate behavior during common handling procedures with horses is often subject to aversive treatment. The present study replicated and extended previous findings using differential reinforcement to shape appropriate equine handling behavior. In Study 1, a multiple baseline across subjects design was used with four horses to determine first the effects of shaping target-touch responses and then successive approximations of full truck loading under continuous and intermittent schedules of reinforcement. Full loading responses were shaped and maintained in all four horses and occurrences of inappropriate behaviors reduced to zero. Generalization of the loading response was also observed to both a novel trainer and trailer. In Study 2, a changing criterion design was used to increase the duration of feet handling with one horse. The horse's responding reached the terminal duration criterion of 1min and showed consistent generalization and one-week maintenance. Overall, the results of both studies support the use of applied equine training systems based on positive reinforcement for increasing appropriate behavior during common handling procedures. 2011 Elsevier B.V. All rights reserved.
Variable identification in group method of data handling methodology
Pereira, Iraci Martinez, E-mail: martinez@ipen.b [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil); Bueno, Elaine Inacio [Instituto Federal de Educacao, Ciencia e Tecnologia, Guarulhos, SP (Brazil)
2011-07-01
The Group Method of Data Handling - GMDH is a combinatorial multi-layer algorithm in which a network of layers and nodes is generated using a number of inputs from the data stream being evaluated. The GMDH network topology has been traditionally determined using a layer by layer pruning process based on a preselected criterion of what constitutes the best nodes at each level. The traditional GMDH method is based on an underlying assumption that the data can be modeled by using an approximation of the Volterra Series or Kolmorgorov-Gabor polynomial. A Monitoring and Diagnosis System was developed based on GMDH and Artificial Neural Network - ANN methodologies, and applied to the IPEN research Reactor IEA-R1. The GMDH was used to study the best set of variables to be used to train an ANN, resulting in a best monitoring variable estimative. The system performs the monitoring by comparing these estimative calculated values with measured ones. The IPEN Reactor Data Acquisition System is composed of 58 variables (process and nuclear variables). As the GMDH is a self-organizing methodology, the input variables choice is made automatically, and the real input variables used in the Monitoring and Diagnosis System were not showed in the final result. This work presents a study of variable identification of GMDH methodology by means of an algorithm that works in parallel with the GMDH algorithm and traces the initial variables paths, resulting in an identification of the variables that composes the best Monitoring and Diagnosis Model. (author)
Variable identification in group method of data handling methodology
Pereira, Iraci Martinez, E-mail: martinez@ipen.b [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil); Bueno, Elaine Inacio [Instituto Federal de Educacao, Ciencia e Tecnologia, Guarulhos, SP (Brazil)
2011-07-01
The Group Method of Data Handling - GMDH is a combinatorial multi-layer algorithm in which a network of layers and nodes is generated using a number of inputs from the data stream being evaluated. The GMDH network topology has been traditionally determined using a layer by layer pruning process based on a preselected criterion of what constitutes the best nodes at each level. The traditional GMDH method is based on an underlying assumption that the data can be modeled by using an approximation of the Volterra Series or Kolmorgorov-Gabor polynomial. A Monitoring and Diagnosis System was developed based on GMDH and Artificial Neural Network - ANN methodologies, and applied to the IPEN research Reactor IEA-R1. The GMDH was used to study the best set of variables to be used to train an ANN, resulting in a best monitoring variable estimative. The system performs the monitoring by comparing these estimative calculated values with measured ones. The IPEN Reactor Data Acquisition System is composed of 58 variables (process and nuclear variables). As the GMDH is a self-organizing methodology, the input variables choice is made automatically, and the real input variables used in the Monitoring and Diagnosis System were not showed in the final result. This work presents a study of variable identification of GMDH methodology by means of an algorithm that works in parallel with the GMDH algorithm and traces the initial variables paths, resulting in an identification of the variables that composes the best Monitoring and Diagnosis Model. (author)
Fitzgerald, Michael
2007-01-01
Use the Google Ajax Search API to integrateweb search, image search, localsearch, and other types of search intoyour web site by embedding a simple, dynamicsearch box to display search resultsin your own web pages using a fewlines of JavaScript. For those who do not want to write code,the search wizards and solutions builtwith the Google Ajax Search API generatecode to accomplish common taskslike adding local search results to a GoogleMaps API mashup, adding videosearch thumbnails to your web site, oradding a news reel with the latest up todate stories to your blog. More advanced users can
Applications of Discrepancy Theory in Multiobjective Approximation
Glaßer, Christian; Witek, Maximilian
2011-01-01
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
Fractal Trigonometric Polynomials for Restricted Range Approximation
Chand, A. K. B.; Navascués, M. A.; Viswanathan, P.; Katiyar, S. K.
2016-05-01
One-sided approximation tackles the problem of approximation of a prescribed function by simple traditional functions such as polynomials or trigonometric functions that lie completely above or below it. In this paper, we use the concept of fractal interpolation function (FIF), precisely of fractal trigonometric polynomials, to construct one-sided uniform approximants for some classes of continuous functions.
Axiomatic Characterizations of IVF Rough Approximation Operators
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.
Some relations between entropy and approximation numbers
郑志明
1999-01-01
A general result is obtained which relates the entropy numbers of compact maps on Hilbert space to its approximation numbers. Compared with previous works in this area, it is particularly convenient for dealing with the cases where the approximation numbers decay rapidly. A nice estimation between entropy and approximation numbers for noncompact maps is given.
Nonlinear approximation with dictionaries, I: Direct estimates
Gribonval, Rémi; Nielsen, Morten
$-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...
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.
Advanced Concepts and Methods of Approximate Reasoning
1989-12-01
and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka, editors, Approximate Reasoning and...190, 1981. [43] E. Trillas and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka
NONLINEAR APPROXIMATION WITH GENERAL WAVE PACKETS
L. Borup; M. Nielsen
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 characterization of the approximation spaces is derived.
Nonlinear approximation with general wave packets
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...... characterization of the approximation spaces is derived....
Nonlinear approximation with bi-framelets
Borup, Lasse; Nielsen, Morten; Gribonval, Rémi
2005-01-01
We study the approximation in Lebesgue spaces of wavelet bi-frame systems given by translations and dilations of a finite set of generators. A complete characterization of the approximation spaces associated with best m-term approximation of wavelet bi-framelet systems is given...
Approximation properties of fine hyperbolic graphs
Benyin Fu
2016-05-01
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 the techniques of Ozawa’s to prove that a fine hyperbolic graph has the metric invariant translation approximation property.
Taylor, Janice; Sims, Jane; Haines, Terry P
2011-08-01
This systematic review aimed to investigate the impact of staff manual handling practices and physical training interventions on nursing home residents' ability to transfer on and off furniture. Key words and subject headings were used to search databases for English language studies published after 1994. Ten studies met the inclusion criteria. Studies of physical activity interventions indicated that physical activity training will benefit residents' transfer ability. One study examined the effect of a safe manual handling program on resident quality care outcomes. Further research is required into the nature and impact of the assistance provided by staff to residents during transfers. Innovative and sustainable approaches to safe manual handling that promote resident mobility are needed.
Approximation algorithms for scheduling unrelated parallel machines with release dates
Avdeenko, T. V.; Mesentsev, Y. A.; Estraykh, I. V.
2017-01-01
In this paper we propose approaches to optimal scheduling of unrelated parallel machines with release dates. One approach is based on the scheme of dynamic programming modified with adaptive narrowing of search domain ensuring its computational effectiveness. We discussed complexity of the exact schedules synthesis and compared it with approximate, close to optimal, solutions. Also we explain how the algorithm works for the example of two unrelated parallel machines and five jobs with release dates. Performance results that show the efficiency of the proposed approach have been given.
Design and sizing of ergonomic handles for hand tools.
Lewis, W G; Narayan, C V
1993-10-01
In this paper, handles for two commonly used hand tools, the chisel and the off-set pliers, are designed using ergonomic principles. These were sized for both males and females falling in the 5th percentile, 50th percentile and 95th percentile groupings. The stresses developed in the ergonomically designed chisel handle while in use were analysed to verify the validity of the design. This chisel handle was then manufactured, and preliminary evaluation using electromyography was conducted. In these tests, the stresses exerted on the flexor and extensor muscles of the arm were measured and compared with those obtained during the use of a conventional handle. Under similar working conditions, results clearly showed that the ergonomically designed handle allows higher working efficiency than existing handles.
Effects of handling on fear reactions in young Icelandic horses
Marsbøll, Anna Feldberg; Christensen, Janne Winther
2015-01-01
Reasons for performing the study Inclusion of objective temperament tests at practical horse breeding evaluations is of increased interest. It has been debated whether such tests may involve human handling, since there may be considerable differences in horses' handling experience. Objectives...... of fearfulness. Known handlers may ‘mask’ behavioural responses of horses in fear tests and thus handling by a known handler during testing may not be appropriate for objective evaluation of fearfulness in a practical situation....... To investigate the effect of a short-term standardised handling procedure on reactions of young horses in 2 types of fear tests (including and excluding human handling). Study design An experimental study with 3-year-old Icelandic horses (n = 24). Methods Handled horses (n = 12) were trained according...
Manual handling the deceased child in a children's hospice.
Pike, Anne M
2004-09-01
The introduction of the Manual Handling Operation Regulations 1992 has forced organizations to review all manual handling carried out in the work-place. Safe manual handling is now a legislative requirement to enable the workforce to carry out their jobs in a safe and structured environment. This project looked in detail at the manual handling that was being carried out when caring for a child after they have died. It was undertaken at CHASE Children's Hospice in the period up until December 2002, with a telephone survey investigating practice at six other children's hospices. It aimed to identify incorrect procedures and, by applying the theory of ergonomics, identify changes that needed to occur in practice, making recommendations for environmental changes. The study led to the production of a policy for handling the children, devising child-specific handling guidelines, reducing the number of times the children are moved after they have died and providing appropriate equipment.
Development of software for handling ship's pharmacy.
Nittari, Giulio; Peretti, Alessandro; Sibilio, Fabio; Ioannidis, Nicholas; Amenta, Francesco
2016-01-01
Ships are required to carry a given amount of medicinal products and medications depending on the flag and the type of vessel. These medicines are stored in the so called ship's "medicine chest" or more properly - a ship pharmacy. Owing to the progress of medical sciences and to the increase in the mean age of seafarers employed on board ships, the number of pharmaceutical products and medical devices required by regulations to be carried on board ships is increasing. This may make handling of the ship's medicine chest a problem primarily on large ships sailing on intercontinental routes due to the difficulty in identifying the correspondence between medicines obtained abroad with those available at the national market. To minimise these problems a tool named Pharmacy Ship (acronym: PARSI) has been developed. The application PARSI is based on a database containing the information about medicines and medical devices required by different countries regulations. In the first application the system was standardised to comply with the Italian regulations issued on the 1st October, 2015 which entered into force on the 18 January 2016. Thanks to PARSI it was possible to standardize the inventory procedures, facilitate the work of maritime health authorities and make it easier for the crew, not professional in the field, to handle the 'medicine chest' correctly by automating the procedures for medicines management. As far as we know there are no other similar tools available at the moment. The application of the software, as well as the automation of different activities, currently carried out manually, will help manage (qualitatively and quantitatively) the ship's pharmacy. The system developed in this study has proved to be an effective tool which serves to guarantee the compliance of the ship pharmacy with regulations of the flag state in terms of medicinal products and medications. Sharing the system with the Telemedical Maritime Assistance Service may result in
Resonant-state expansion Born Approximation
Doost, M B
2015-01-01
The Born Approximation is a fundamental formula in Physics, it allows the calculation of weak scattering via the Fourier transform of the scattering potential. I extend the Born Approximation by including in the formula the Fourier transform of a truncated basis of the infinite number of appropriately normalised resonant states. This extension of the Born Approximation is named the Resonant-State Expansion Born Approximation or RSE Born Approximation. The resonant-states of the system can be calculated using the recently discovered RSE perturbation theory for electrodynamics and normalised correctly to appear in spectral Green's functions via the flux volume normalisation.
Building a framework for ergonomic research on laparoscopic instrument handles.
Li, Zheng; Wang, Guohui; Tan, Juan; Sun, Xulong; Lin, Hao; Zhu, Shaihong
2016-06-01
Laparoscopic surgery carries the advantage of minimal invasiveness, but ergonomic design of the instruments used has progressed slowly. Previous studies have demonstrated that the handle of laparoscopic instruments is vital for both surgical performance and surgeon's health. This review provides an overview of the sub-discipline of handle ergonomics, including an evaluation framework, objective and subjective assessment systems, data collection and statistical analyses. Furthermore, a framework for ergonomic research on laparoscopic instrument handles is proposed to standardize work on instrument design.
Towards an efficient retractor handle: an ergonomic study.
Brearley, S; Watson, H
1983-11-01
In a study whose aim was to design an ergonomically efficient retractor handle, surgeons' views on retractor design were canvassed by questionnaire. After observing retractors in use and measuring the forces involved peroperatively, prototype handles were made and tested in a laboratory. Experimental subjects showed a marked preference for a vertical 'T' configuration. Such a handle could easily be incorporated into most existing retractor designs.
The prevention and handling of the missing data.
Kang, Hyun
2013-05-01
Even in a well-designed and controlled study, missing data occurs in almost all research. Missing data can reduce the statistical power of a study and can produce biased estimates, leading to invalid conclusions. This manuscript reviews the problems and types of missing data, along with the techniques for handling missing data. The mechanisms by which missing data occurs are illustrated, and the methods for handling the missing data are discussed. The paper concludes with recommendations for the handling of missing data.
Slow-roll approximation in loop quantum cosmology
Luc, Joanna
2016-01-01
The slow-roll approximation is an analytical approach to study dynamical properties of the inflationary universe. In this article, systematic construction of the slow-roll expansion for effective loop quantum cosmology is presented. The analysis is performed up to the fourth order in both slow-roll parameters and the parameter controlling the strength of deviation from the classical case. The expansion is performed for three types of the slow-roll parameters: Hubble slow-roll parameters, Hubble flow parameters and potential slow-roll parameters. An accuracy of the approximation is verified by comparison with the numerical phase space trajectories for the case with a massive potential term. The results obtained in this article may be helpful in the search for the subtle quantum gravitational effects with use of the cosmological data.
Slow-roll approximation in loop quantum cosmology
Luc, Joanna; Mielczarek, Jakub
2017-01-01
The slow-roll approximation is an analytical approach to study dynamical properties of the inflationary universe. In this article, systematic construction of the slow-roll expansion for effective loop quantum cosmology is presented. The analysis is performed up to the fourth order in both slow-roll parameters and the parameter controlling the strength of deviation from the classical case. The expansion is performed for three types of the slow-roll parameters: Hubble slow-roll parameters, Hubble flow parameters and potential slow-roll parameters. An accuracy of the approximation is verified by comparison with the numerical phase space trajectories for the case with a massive potential term. The results obtained in this article may be helpful in the search for the subtle quantum gravitational effects with use of the cosmological data.
Approximate Universal Relations among Tidal Parameters for Neutron Star Binaries
Yagi, Kent
2016-01-01
One of largest uncertainties in nuclear physics is the relation between the pressure and density of supranuclear matter: the equation of state. Some of this uncertainty may be removed through future gravitational wave observations of neutron star binaries by extracting the tidal deformabilities (or Love numbers) of neutron stars. Previous studies showed that only a certain combination of the individual deformabilities of each body (chirp tidal deformability) can be measured with second-generation gravitational wave interferometers, such as Adv. LIGO, due to correlations between the individual deformabilities. To overcome this, we search for approximately universal (or equation-of-state independent) relations between two combinations of the individual tidal deformabilities, such that once one of them has been measured, the other can be automatically obtained and the individual ones decoupled through these relations. We find an approximately universal relation between the symmetric and the anti-symmetric combin...
Canonical Sets of Best L1-Approximation
Dimiter Dryanov
2012-01-01
Full Text Available In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are called canonical sets of best approximation. The present paper summarizes results on canonical sets of best L1-approximation with emphasis on multivariate interpolation and best L1-approximation by blending functions. The best L1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariate L1-approximation by sums of univariate functions. Explicit constructions of best one-sided L1-approximants give rise to well-known and new inequalities.
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.
An Approximate Approach to Automatic Kernel Selection.
Ding, Lizhong; Liao, Shizhong
2016-02-02
Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.
On Gakerkin approximations for the quasigeostrophic equations
Rocha, Cesar B; Grooms, Ian
2015-01-01
We study the representation of approximate solutions of the three-dimensional quasigeostrophic (QG) equations using Galerkin series with standard vertical modes. In particular, we show that standard modes are compatible with nonzero buoyancy at the surfaces and can be used to solve the Eady problem. We extend two existing Galerkin approaches (A and B) and develop a new Galerkin approximation (C). Approximation A, due to Flierl (1978), represents the streamfunction as a truncated Galerkin series and defines the potential vorticity (PV) that satisfies the inversion problem exactly. Approximation B, due to Tulloch and Smith (2009b), represents the PV as a truncated Galerkin series and calculates the streamfunction that satisfies the inversion problem exactly. Approximation C, the true Galerkin approximation for the QG equations, represents both streamfunction and PV as truncated Galerkin series, but does not satisfy the inversion equation exactly. The three approximations are fundamentally different unless the b...
Automation of 3D micro object handling process
Gegeckaite, Asta; Hansen, Hans Nørgaard
2007-01-01
Most of the micro objects in industrial production are handled with manual labour or in semiautomatic stations. Manual labour usually makes handling and assembly operations highly flexible, but slow, relatively imprecise and expensive. Handling of 3D micro objects poses special challenges due...... to the small absolute scale. In this article, the results of the pick-and-place operations of three different 3D micro objects were investigated. This study shows that depending on the correct gripping tool design as well as handling and assembly scenarios, a high success rate of up to 99% repeatability can...
Human handling promotes compliant behavior in adult laboratory rabbits.
Swennes, Alton G; Alworth, Leanne C; Harvey, Stephen B; Jones, Carolyn A; King, Christopher S; Crowell-Davis, Sharon L
2011-01-01
Routine laboratory procedures can be stressful for laboratory animals. We wanted to determine whether human handling of adult rabbits could induce a degree of habituation, reducing stress and facilitating research-related manipulation. To this end, adult New Zealand white rabbits were handled either frequently or minimally. After being handled over 3 wk, these rabbits were evaluated by novel personnel and compared with minimally handled controls. Evaluators subjectively scored the rabbits for their relative compliance or resistance to being scruffed and removed from their cages, being transported to a treatment room, and their behavior at all stages of the exercise. Upon evaluation, handled rabbits scored significantly more compliant than nontreated controls. During evaluation, behaviors that the rabbits displayed when they were approached in their cages and while being handled outside their cages were recorded and compared between study groups. Handled rabbits displayed behavior consistent with a reduction in human-directed fear. This study illustrates the potential for handling to improve compliance in laboratory procedures and reduce fear-related behavior in laboratory rabbits. Such handling could be used to improve rabbit welfare through the reduction of stress and exposure to novel stimuli.
Cooper-Harper Experience Report for Spacecraft Handling Qualities Applications
Bailey, Randall E.; Jackson, E. Bruce; Bilimoria, Karl D.; Mueller, Eric R.; Frost, Chad R.; Alderete, Thomas S.
2009-01-01
A synopsis of experience from the fixed-wing and rotary-wing aircraft communities in handling qualities development and the use of the Cooper-Harper pilot rating scale is presented as background for spacecraft handling qualities research, development, test, and evaluation (RDT&E). In addition, handling qualities experiences and lessons-learned from previous United States (US) spacecraft developments are reviewed. This report is intended to provide a central location for references, best practices, and lessons-learned to guide current and future spacecraft handling qualities RDT&E.
MVAPACK: a complete data handling package for NMR metabolomics.
Worley, Bradley; Powers, Robert
2014-05-16
Data handling in the field of NMR metabolomics has historically been reliant on either in-house mathematical routines or long chains of expensive commercial software. Thus, while the relatively simple biochemical protocols of metabolomics maintain a low barrier to entry, new practitioners of metabolomics experiments are forced to either purchase expensive software packages or craft their own data handling solutions from scratch. This inevitably complicates the standardization and communication of data handling protocols in the field. We report a newly developed open-source platform for complete NMR metabolomics data handling, MVAPACK, and describe its application on an example metabolic fingerprinting data set.
Pre-mortem handling effect on the meat quality
Jorgue Hernandez-Bautista
2013-12-01
Full Text Available The main characteristics that define meat quality are the physicochemical, organoleptic and microbiological properties. These characteristics are influenced by like production system, racial group, feed, transport, ante-mortem animals handling and post-mortem meat handling. The ante-mortem handling is very important, where stress physiology and the factors that provoke it (fasting, transportation, stunning, specie and their effect in each step of the ante-mortem handling is reflected in final meat quality (pH, conductivity, color, water holding capacity and shelf life.
Mars Sample Handling and Requirements Panel (MSHARP)
Carr, Michael H.; McCleese, Daniel J.; Bada, Jeffrey L.; Bogard, Donald D.; Clark, Benton C.; DeVincenzi, Donald; Drake, Michael J.; Nealson, Kenneth H.; Papike, James J.; Race, Margaret S.; Stahl, David
1999-01-01
In anticipation of the return of samples from Mars toward the end of the first decade of the next century, NASA's Office of Space Sciences chartered a panel to examine how Mars samples should be handled. The panel was to make recommendations in three areas: (1) sample collection and transport back to Earth; (2) certification of the samples as nonhazardous; and (3) sample receiving, curation, and distribution. This report summarizes the findings of that panel. The samples should be treated as hazardous until proven otherwise. They are to be sealed within a canister on Mars, and the canister is not to be opened until within a Biosafety Hazard Level 4 (BSL-4) containment facility here on Earth. This facility must also meet or exceed the cleanliness requirements of the Johnson Space Center (JSC) facility for curation of extraterrestrial materials. A containment facility meeting both these requirements does not yet exist. Hazard assessment and life detection experiments are to be done at the containment facility, while geochemical characterization is being performed on a sterilized subset of the samples released to the science community. When and if the samples are proven harmless, they are to be transferred to a curation facility, such as that at JSC.
Valve Concepts for Microfluidic Cell Handling
M. Grabowski
2010-01-01
Full Text Available In this paper we present various pneumatically actuated microfluidic valves to enable user-defined fluid management within a microfluidic chip. To identify a feasible valve design, certain valve concepts are simulated in ANSYS to investigate the pressure dependent opening and closing characteristics of each design. The results are verified in a series of tests. Both the microfluidic layer and the pneumatic layer are realized by means of soft-lithographic techniques. In this way, a network of channels is fabricated in photoresist as a molding master. By casting these masters with PDMS (polydimethylsiloxane we get polymeric replicas containing the channel network. After a plasma-enhanced bonding process, the two layers are irreversibly bonded to each other. The bonding is tight for pressures up to 2 bar. The valves are integrated into a microfluidic cell handling system that is designed to manipulate cells in the presence of a liquid reagent (e.g. PEG – polyethylene glycol, for cell fusion. For this purpose a user-defined fluid management system is developed. The first test series with human cell lines show that the microfluidic chip is suitable for accumulating cells within a reaction chamber, where they can be flushed by a liquid medium.
Whole Teflon valves for handling droplets.
Cybulski, Olgierd; Jakiela, Slawomir; Garstecki, Piotr
2016-06-21
We propose and test a new whole-Teflon gate valve for handling droplets. The valve allows droplet plugs to pass through without disturbing them. This is possible due to the geometric design, the choice of material and lack of any pulses of flow generated by closing or opening the valve. The duct through the valve resembles a simple segment of tubing, without constrictions, change in lumen or side pockets. There are no extra sealing materials with different wettability or chemical resistance. The only material exposed to liquids is FEP Teflon, which is resistant to aggressive chemicals and fully biocompatible. The valve can be integrated into microfluidic systems: we demonstrate a complex system for culturing bacteria in hundreds of microliter droplet chemostats. The valve effectively isolates modules of the system to increase precision of operations on droplets. We verified that the valve allowed millions of droplet plugs to safely pass through, without any cross-contamination with bacteria between the droplets. The valve can be used in automating complex microfluidic systems for experiments in biochemistry, biology and organic chemistry.
The NOAO KOSMOS Data Handling System
Seaman, Rob
2015-01-01
KOSMOS and COSMOS are twin high-efficiency imaging spectrographs that have been deployed as NOAO facility instruments for the Mayall 4-meter telescope on Kitt Peak in Arizona and for the Blanco telescope on Cerro Tololo in Chile, respectively. The NOAO Data Handling System (DHS) has seen aggressive use over several years at both the Blanco and Mayall telescopes with NEWFIRM (the NOAO Extremely Wide-Field Infrared Imager) and the Mosaic-1.1 wide-field optical imager. Both of these instruments also rely on the Monsoon array controller and related software, and on instrument-specific versions of the NOAO Observation Control System (NOCS). NOCS, Monsoon and DHS are thus a well-tested software suite that was adopted by the KOSMOS project. This document describes the specifics of the KOSMOS implementation of DHS, in particular in support of the original two-amplifier e2v 2Kx4K CCD detectors with which the instruments were commissioned. The emphasis will be on the general layout of the DHS software components and th...
Conceptual Design Report for the Remote-Handled Low-Level Waste Disposal Project
David Duncan
2011-05-01
This conceptual design report addresses development of replacement remote-handled low-level waste disposal capability for the Idaho National Laboratory. Current disposal capability at the Radioactive Waste Management Complex is planned until the facility is full or until it must be closed in preparation for final remediation (approximately at the end of Fiscal Year 2017). This conceptual design report includes key project assumptions; design options considered in development of the proposed onsite disposal facility (the highest ranked alternative for providing continued uninterrupted remote-handled low level waste disposal capability); process and facility descriptions; safety and environmental requirements that would apply to the proposed facility; and the proposed cost and schedule for funding, design, construction, and operation of the proposed onsite disposal facility.
Conceptual Design Report for the Remote-Handled Low-Level Waste Disposal Project
Lisa Harvego; David Duncan; Joan Connolly; Margaret Hinman; Charles Marcinkiewicz; Gary Mecham
2011-03-01
This conceptual design report addresses development of replacement remote-handled low-level waste disposal capability for the Idaho National Laboratory. Current disposal capability at the Radioactive Waste Management Complex is planned until the facility is full or until it must be closed in preparation for final remediation (approximately at the end of Fiscal Year 2017). This conceptual design report includes key project assumptions; design options considered in development of the proposed onsite disposal facility (the highest ranked alternative for providing continued uninterrupted remote-handled low level waste disposal capability); process and facility descriptions; safety and environmental requirements that would apply to the proposed facility; and the proposed cost and schedule for funding, design, construction, and operation of the proposed onsite disposal facility.
Conceptual Design Report for Remote-Handled Low-Level Waste Disposal Facility
Lisa Harvego; David Duncan; Joan Connolly; Margaret Hinman; Charles Marcinkiewicz; Gary Mecham
2010-10-01
This conceptual design report addresses development of replacement remote-handled low-level waste disposal capability for the Idaho National Laboratory. Current disposal capability at the Radioactive Waste Management Complex is planned until the facility is full or until it must be closed in preparation for final remediation (approximately at the end of Fiscal Year 2017). This conceptual design report includes key project assumptions; design options considered in development of the proposed onsite disposal facility (the highest ranked alternative for providing continued uninterrupted remote-handled low level waste disposal capability); process and facility descriptions; safety and environmental requirements that would apply to the proposed facility; and the proposed cost and schedule for funding, design, construction, and operation of the proposed onsite disposal facility.
Boundary condition handling approaches for the model reduction of a vehicle frame
Xie, Qingxi; Zhang, Nong; Zhang, Bangji; Ji, Jinchen
2016-06-01
In order to apply model reduction technique to improve the computational efficiency for the large-scale FEM model of a vehicle, this paper presents the handling approaches for three widely-used boundary conditions, namely fixed boundary condition (FBC), prescribed motion (PSM) and coupling (COUP), respectively. It is found that iterated improved reduction system (IIRS) reduction method tends to generate better reduction approximation. Guyan method is not sensitive to the sequence of reduction and constraint under FBC, and can thus provide flexibility in handling different boundary conditions for the same system. As for PSM, 'constraint first' is recommended no matter which reduction method is used, and then separate reduction models can be coupled to form a new model with relative small dofs. By selecting appropriate master dofs for model reduction, the coupled model based on reduced models could produce same results as the original full one.
A fast DNA sequence handling program for Apple II computer in BASIC and 6502 assembler.
Paolella, G
1985-01-01
A fast general purpose DNA handling program has been developed in BASIC and machine language. The program runs on the Apple II plus or on the Apple IIe microcomputer, without additional hardware except for disk drives and printer. The program allows file insertion and editing, translation into protein sequence, reverse translation, search for small strings and restriction enzyme sites. The homology may be shown either as a comparison of two sequences or through a matrix on screen. Two additional features are: (i) drawing restriction site maps on the printer; and (ii) simulating a gel electrophoresis of restriction fragments both on screen and on paper. All the operations are very fast. The more common tasks are carried out almost instantly; only more complex routines, like finding homology between large sequences or searching and sorting all the restriction sites in a long sequence require longer, but still quite acceptable, times (generally under 30 s).
2006-01-01
Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...
2006-01-01
Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...
Rajashekar, TB
1998-01-01
The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.
Sparse approximation problem: how rapid simulated annealing succeeds and fails
Obuchi, Tomoyuki; Kabashima, Yoshiyuki
2016-03-01
Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an overcomplete basis is termed the sparse approximation. In this paper, we apply simulated annealing, a metaheuristic algorithm for general optimization problems, to sparse approximation in the situation where the given data have a planted sparse representation and noise is present. The result in the noiseless case shows that our simulated annealing works well in a reasonable parameter region: the planted solution is found fairly rapidly. This is true even in the case where a common relaxation of the sparse approximation problem, the G-relaxation, is ineffective. On the other hand, when the dimensionality of the data is close to the number of non-zero components, another metastable state emerges, and our algorithm fails to find the planted solution. This phenomenon is associated with a first-order phase transition. In the case of very strong noise, it is no longer meaningful to search for the planted solution. In this situation, our algorithm determines a solution with close-to-minimum distortion fairly quickly.
Pisinger, David; Røpke, Stefan
2010-01-01
Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...... search....
A multiscale two-point flux-approximation method
Møyner, Olav; Lie, Knut-Andreas
2014-10-01
A large number of multiscale finite-volume methods have been developed over the past decade to compute conservative approximations to multiphase flow problems in heterogeneous porous media. In particular, several iterative and algebraic multiscale frameworks that seek to reduce the fine-scale residual towards machine precision have been presented. Common for all such methods is that they rely on a compatible primal-dual coarse partition, which makes it challenging to extend them to stratigraphic and unstructured grids. Herein, we propose a general idea for how one can formulate multiscale finite-volume methods using only a primal coarse partition. To this end, we use two key ingredients that are computed numerically: (i) elementary functions that correspond to flow solutions used in transmissibility upscaling, and (ii) partition-of-unity functions used to combine elementary functions into basis functions. We exemplify the idea by deriving a multiscale two-point flux-approximation (MsTPFA) method, which is robust with regards to strong heterogeneities in the permeability field and can easily handle general grids with unstructured fine- and coarse-scale connections. The method can easily be adapted to arbitrary levels of coarsening, and can be used both as a standalone solver and as a preconditioner. Several numerical experiments are presented to demonstrate that the MsTPFA method can be used to solve elliptic pressure problems on a wide variety of geological models in a robust and efficient manner.
Quantum Calisthenics: Gaussians, The Path Integral and Guided Numerical Approximations
Weinstein, Marvin; /SLAC
2009-02-12
It is apparent to anyone who thinks about it that, to a large degree, the basic concepts of Newtonian physics are quite intuitive, but quantum mechanics is not. My purpose in this talk is to introduce you to a new, much more intuitive way to understand how quantum mechanics works. I begin with an incredibly easy way to derive the time evolution of a Gaussian wave-packet for the case free and harmonic motion without any need to know the eigenstates of the Hamiltonian. This discussion is completely analytic and I will later use it to relate the solution for the behavior of the Gaussian packet to the Feynman path-integral and stationary phase approximation. It will be clear that using the information about the evolution of the Gaussian in this way goes far beyond what the stationary phase approximation tells us. Next, I introduce the concept of the bucket brigade approach to dealing with problems that cannot be handled totally analytically. This approach combines the intuition obtained in the initial discussion, as well as the intuition obtained from the path-integral, with simple numerical tools. My goal is to show that, for any specific process, there is a simple Hilbert space interpretation of the stationary phase approximation. I will then argue that, from the point of view of numerical approximations, the trajectory obtained from my generalization of the stationary phase approximation specifies that subspace of the full Hilbert space that is needed to compute the time evolution of the particular state under the full Hamiltonian. The prescription I will give is totally non-perturbative and we will see, by the grace of Maple animations computed for the case of the anharmonic oscillator Hamiltonian, that this approach allows surprisingly accurate computations to be performed with very little work. I think of this approach to the path-integral as defining what I call a guided numerical approximation scheme. After the discussion of the anharmonic oscillator I will
Improving biconnectivity approximation via local optimization
Ka Wong Chong; Tak Wah Lam [Univ. of Hong Kong (Hong Kong)
1996-12-31
The problem of finding the minimum biconnected spanning subgraph of an undirected graph is NP-hard. A lot of effort has been made to find biconnected spanning subgraphs that approximate to the minimum one as close as possible. Recently, new polynomial-time (sequential) approximation algorithms have been devised to improve the approximation factor from 2 to 5/3 , then 3/2, while NC algorithms have also been known to achieve 7/4 + {epsilon}. This paper presents a new technique which can be used to further improve parallel approximation factors to 5/3 + {epsilon}. In the sequential context, the technique reveals an algorithm with a factor of {alpha} + 1/5, where a is the approximation factor of any 2-edge connectivity approximation algorithm.
Frankenstein's Glue: Transition functions for approximate solutions
Yunes, N
2006-01-01
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we provide an attempt to formalize this gluing scheme by studying transition functions that join approximate solutions together. In particular, we propose certain sufficient conditions on these functions and proof that these conditions guarantee that the joined solution still satisfies the Einstein equations to the same order as the approximate ones. An example is also provided for a binary system of non-spinning black holes, where the approximate solutions are taken to be given by a post-Newtonian expansion and a perturbed Schwarzschild solution. For this specific case, we show that if the transition functions satisfy the...
Approximation-Based Adaptive Tracking Control for MIMO Nonlinear Systems With Input Saturation.
Zhou, Qi; Shi, Peng; Tian, Yang; Wang, Mingyu
2015-10-01
In this paper, an approximation-based adaptive tracking control approach is proposed for a class of multiinput multioutput nonlinear systems. Based on the method of neural network, a novel adaptive controller is designed via backstepping design process. Furthermore, by introducing Nussbaum function, the issue of unknown control directions is handled. In the backstepping design process, the dynamic surface control technique is employed to avoid differentiating certain nonlinear functions repeatedly. Moreover, in order to reduce the number of adaptation laws, we do not use the neural networks to directly approximate the unknown nonlinear functions but the desired control signals. Finally, we provide two examples to illustrate the effectiveness of the proposed approach.
Floating-Point $L^2$-Approximations
Brisebarre, Nicolas; Hanrot, Guillaume
2007-01-01
International audience; Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those functions. These approximations can be good under several criteria, the most desirable being probably that the relative error is as small as possible in the $L^{\\infty}$ sense, i.e. everywhere on the interval under study. In the present paper, we investigate a simpler criterion, the $L^2$ case. Though finding a best polynomial $L^2$-approximation with ...
Metric Diophantine approximation on homogeneous varieties
Ghosh, Anish; Nevo, Amos
2012-01-01
We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khinchin and Jarnik theorems. In full generality our results establish simultaneous Diophantine approximation with respect to several completions, and Diophantine approximation over general number fields using S-algebraic integers. In several important examples, the metric results we obtain are optimal. The proof uses quantitative equidistribution properties of suitable averaging operators, which are derived from spectral bounds in automorphic representations.
Approximately liner phase IIR digital filter banks
J. D. Ćertić; M. D. Lutovac; L. D. Milić
2013-01-01
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 li...
[Clinical Handling of Patients with Dissociative Disorders].
Okano, Kenichiro
2015-01-01
This paper discusses the way informed psychiatrists are expected to handle dissociative patients in clinical situations, with a specific focus on dissociative identity disorders and dissociative fugue. On the initial interview with dissociative patients, information on their history of trauma and any nascent dissociative symptoms in their childhood should be carefully obtained. Their level of stress in their current life should also be assessed in order to understand their symptomatology, as well as to predict their future clinical course. A psychoeducational approach is crucial; it might be helpful to give information on dissociative disorder to these patients as well as their family members in order to promote their adherence to treatment. Regarding the symptomatology of dissociative disorders, detailed symptoms and the general clinical course are presented. It was stressed that dissociative identity disorder and dissociative fugue, the most high-profile dissociative disorders, are essentially different in their etiology and clinical presentation. Dissociative disorders are often confused with and misdiagnosed as psychotic disorders, such as schizophrenia. Other conditions considered in terms of the differential diagnosis include borderline personality disorder as well as temporal lobe epilepsy. Lastly, the therapeutic approach to dissociative identity disorder is discussed. Each dissociative identity should be understood as potentially representing some traumatically stressful event in the past. The therapist should be careful not to excessively promote the creation or elaboration of any dissociative identities. Three stages are proposed in the individual psychotherapeutic process. In the initial stage, a secure environment and stabilization of symptoms should be sought. The second stage consists of aiding the "host" personality to make use of other more adaptive coping skills in their life. The third stage involves coaching as well as continuous awareness of
Handling Protest Responses in Contingent Valuation Surveys.
Pennington, Mark; Gomes, Manuel; Donaldson, Cam
2017-08-01
Protest responses, whereby respondents refuse to state the value they place on the health gain, are commonly encountered in contingent valuation (CV) studies, and they tend to be excluded from analyses. Such an approach will be biased if protesters differ from non-protesters on characteristics that predict their responses. The Heckman selection model has been commonly used to adjust for protesters, but its underlying assumptions may be implausible in this context. We present a multiple imputation (MI) approach to appropriately address protest responses in CV studies, and compare it with the Heckman selection model. This study exploits data from the multinational EuroVaQ study, which surveyed respondents' willingness-to-pay (WTP) for a Quality Adjusted Life Year (QALY). Here, our simulation study assesses the relative performance of MI and Heckman selection models across different realistic settings grounded in the EuroVaQ study, including scenarios with different proportions of missing data and non-response mechanisms. We then illustrate the methods in the EuroVaQ study for estimating mean WTP for a QALY gain. We find that MI provides lower bias and mean squared error compared with the Heckman approach across all considered scenarios. The simulations suggest that the Heckman approach can lead to considerable underestimation or overestimation of mean WTP due to violations in the normality assumption, even after log-transforming the WTP responses. The case study illustrates that protesters are associated with a lower mean WTP for a QALY gain compared with non-protesters, but that the results differ according to method for handling protesters. MI is an appropriate method for addressing protest responses in CV studies.
Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation.
Nguyen, Minh Luan; Hui, Siu Cheung; Fong, Alvis C M
2016-06-23
Parallel test paper generation is a biobjective distributed resource optimization problem, which aims to generate multiple similarly optimal test papers automatically according to multiple user-specified assessment criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in both of the collective objective functions. In this paper, we propose a submodular memetic approximation algorithm for solving this problem. The proposed algorithm is an adaptive memetic algorithm (MA), which exploits the submodular property of the collective objective functions to design greedy-based approximation algorithms for enhancing steps of the multiobjective MA. Synergizing the intensification of submodular local search mechanism with the diversification of the population-based submodular crossover operator, our algorithm can jointly optimize the total quality maximization objective and the fairness quality maximization objective. Our MA can achieve provable near-optimal solutions in a huge search space of large datasets in efficient polynomial runtime. Performance results on various datasets have shown that our algorithm has drastically outperformed the current techniques in terms of paper quality and runtime efficiency.
Brown, Michael E.; Batygin, Konstantin
2016-10-01
We use an extensive suite of numerical simulations to constrain the mass and orbit of Planet Nine, and we use these constraints to begin the search for this newly proposed planet in new and in archival data. Here, we compare our simulations to the observed population of aligned eccentric high semimajor axis Kuiper belt objects and determine which simulation parameters are statistically compatible with the observations. We find that only a narrow range of orbital elements can reproduce the observations. In particular, the combination of semimajor axis, eccentricity, and mass of Planet Nine strongly dictates the semimajor axis range of the orbital confinement of the distant eccentric Kuiper belt objects. Allowed orbits, which confine Kuiper belt objects with semimajor axis beyond 380 AU, have perihelia roughly between 150 and 350 AU, semimajor axes between 380 and 980 AU, and masses between 5 and 20 Earth masses. Orbitally confined objects also generally have orbital planes similar to that of the planet, suggesting that the planet is inclined approximately 30 degrees to the ecliptic. We compare the allowed orbital positions and estimated brightness of Planet Nine to previous and ongoing surveys which would be sensitive to the planet's detection and use these surveys to rule out approximately two-thirds of the planet's orbit. Planet Nine is likely near aphelion with an approximate brightness of 22hours. We discuss the state of our current and archival searches for this newly predicted planet.
A Note on Generalized Approximation Property
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.
Upper Bounds on Numerical Approximation Errors
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....... The bounds apply to moregeneral problems than existing bounding methods do. For instance, since strict concavityis not required, linear models and piecewise linear approximations can bedealt with. Despite the generality, the bounds perform well in comparison with existingmethods even when applied...... to approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...
TMB: Automatic differentiation and laplace approximation
Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte
2016-01-01
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...... 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...
The Search Performance Evaluation and Prediction in Exploratory Search
2016-01-01
The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...