Science.gov

Sample records for adaptive search procedure

  1. Adaptive Modeling Procedure Selection by Data Perturbation*

    PubMed Central

    Zhang, Yongli; Shen, Xiaotong

    2015-01-01

    Summary Many procedures have been developed to deal with the high-dimensional problem that is emerging in various business and economics areas. To evaluate and compare these procedures, modeling uncertainty caused by model selection and parameter estimation has to be assessed and integrated into a modeling process. To do this, a data perturbation method estimates the modeling uncertainty inherited in a selection process by perturbing the data. Critical to data perturbation is the size of perturbation, as the perturbed data should resemble the original dataset. To account for the modeling uncertainty, we derive the optimal size of perturbation, which adapts to the data, the model space, and other relevant factors in the context of linear regression. On this basis, we develop an adaptive data-perturbation method that, unlike its nonadaptive counterpart, performs well in different situations. This leads to a data-adaptive model selection method. Both theoretical and numerical analysis suggest that the data-adaptive model selection method adapts to distinct situations in that it yields consistent model selection and optimal prediction, without knowing which situation exists a priori. The proposed method is applied to real data from the commodity market and outperforms its competitors in terms of price forecasting accuracy. PMID:26640319

  2. Adaptation and visual search in mammographic images.

    PubMed

    Kompaniez-Dunigan, Elysse; Abbey, Craig K; Boone, John M; Webster, Michael A

    2015-05-01

    Radiologists face the visually challenging task of detecting suspicious features within the complex and noisy backgrounds characteristic of medical images. We used a search task to examine whether the salience of target features in x-ray mammograms could be enhanced by prior adaptation to the spatial structure of the images. The observers were not radiologists, and thus had no diagnostic training with the images. The stimuli were randomly selected sections from normal mammograms previously classified with BIRADS Density scores of "fatty" versus "dense," corresponding to differences in the relative quantities of fat versus fibroglandular tissue. These categories reflect conspicuous differences in visual texture, with dense tissue being more likely to obscure lesion detection. The targets were simulated masses corresponding to bright Gaussian spots, superimposed by adding the luminance to the background. A single target was randomly added to each image, with contrast varied over five levels so that they varied from difficult to easy to detect. Reaction times were measured for detecting the target location, before or after adapting to a gray field or to random sequences of a different set of dense or fatty images. Observers were faster at detecting the targets in either dense or fatty images after adapting to the specific background type (dense or fatty) that they were searching within. Thus, the adaptation led to a facilitation of search performance that was selective for the background texture. Our results are consistent with the hypothesis that adaptation allows observers to more effectively suppress the specific structure of the background, thereby heightening visual salience and search efficiency.

  3. Adaptive cuckoo search algorithm for unconstrained optimization.

    PubMed

    Ong, Pauline

    2014-01-01

    Modification of the intensification and diversification approaches in the recently developed cuckoo search algorithm (CSA) is performed. The alteration involves the implementation of adaptive step size adjustment strategy, and thus enabling faster convergence to the global optimal solutions. The feasibility of the proposed algorithm is validated against benchmark optimization functions, where the obtained results demonstrate a marked improvement over the standard CSA, in all the cases. PMID:25298971

  4. Adaptive cuckoo search algorithm for unconstrained optimization.

    PubMed

    Ong, Pauline

    2014-01-01

    Modification of the intensification and diversification approaches in the recently developed cuckoo search algorithm (CSA) is performed. The alteration involves the implementation of adaptive step size adjustment strategy, and thus enabling faster convergence to the global optimal solutions. The feasibility of the proposed algorithm is validated against benchmark optimization functions, where the obtained results demonstrate a marked improvement over the standard CSA, in all the cases.

  5. Visual search behaviour during laparoscopic cadaveric procedures

    NASA Astrophysics Data System (ADS)

    Dong, Leng; Chen, Yan; Gale, Alastair G.; Rees, Benjamin; Maxwell-Armstrong, Charles

    2014-03-01

    Laparoscopic surgery provides a very complex example of medical image interpretation. The task entails: visually examining a display that portrays the laparoscopic procedure from a varying viewpoint; eye-hand coordination; complex 3D interpretation of the 2D display imagery; efficient and safe usage of appropriate surgical tools, as well as other factors. Training in laparoscopic surgery typically entails practice using surgical simulators. Another approach is to use cadavers. Viewing previously recorded laparoscopic operations is also a viable additional approach and to examine this a study was undertaken to determine what differences exist between where surgeons look during actual operations and where they look when simply viewing the same pre-recorded operations. It was hypothesised that there would be differences related to the different experimental conditions; however the relative nature of such differences was unknown. The visual search behaviour of two experienced surgeons was recorded as they performed three types of laparoscopic operations on a cadaver. The operations were also digitally recorded. Subsequently they viewed the recording of their operations, again whilst their eye movements were monitored. Differences were found in various eye movement parameters when the two surgeons performed the operations and where they looked when they simply watched the recordings of the operations. It is argued that this reflects the different perceptual motor skills pertinent to the different situations. The relevance of this for surgical training is explored.

  6. Adaptive Distributed Environment for Procedure Training (ADEPT)

    NASA Technical Reports Server (NTRS)

    Domeshek, Eric; Ong, James; Mohammed, John

    2013-01-01

    ADEPT (Adaptive Distributed Environment for Procedure Training) is designed to provide more effective, flexible, and portable training for NASA systems controllers. When creating a training scenario, an exercise author can specify a representative rationale structure using the graphical user interface, annotating the results with instructional texts where needed. The author's structure may distinguish between essential and optional parts of the rationale, and may also include "red herrings" - hypotheses that are essential to consider, until evidence and reasoning allow them to be ruled out. The system is built from pre-existing components, including Stottler Henke's SimVentive? instructional simulation authoring tool and runtime. To that, a capability was added to author and exploit explicit control decision rationale representations. ADEPT uses SimVentive's Scalable Vector Graphics (SVG)- based interactive graphic display capability as the basis of the tool for quickly noting aspects of decision rationale in graph form. The ADEPT prototype is built in Java, and will run on any computer using Windows, MacOS, or Linux. No special peripheral equipment is required. The software enables a style of student/ tutor interaction focused on the reasoning behind systems control behavior that better mimics proven Socratic human tutoring behaviors for highly cognitive skills. It supports fast, easy, and convenient authoring of such tutoring behaviors, allowing specification of detailed scenario-specific, but content-sensitive, high-quality tutor hints and feedback. The system places relatively light data-entry demands on the student to enable its rationale-centered discussions, and provides a support mechanism for fostering coherence in the student/ tutor dialog by including focusing, sequencing, and utterance tuning mechanisms intended to better fit tutor hints and feedback into the ongoing context.

  7. Interactive solution-adaptive grid generation procedure

    NASA Technical Reports Server (NTRS)

    Henderson, Todd L.; Choo, Yung K.; Lee, Ki D.

    1992-01-01

    TURBO-AD is an interactive solution adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution adaptive grid generation technique into a single interactive package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on the unit square in the parametric domain, and the new adapted grid is then mapped back to the physical domain. The grid adaption is achieved by adapting the control points to a numerical solution in the parametric domain using control sources obtained from the flow properties. Then a new modified grid is generated from the adapted control net. This process is efficient because the number of control points is much less than the number of grid points and the generation of the grid is an efficient algebraic process. TURBO-AD provides the user with both local and global controls.

  8. Particle Swarm Based Collective Searching Model for Adaptive Environment

    SciTech Connect

    Cui, Xiaohui; Patton, Robert M; Potok, Thomas E; Treadwell, Jim N

    2008-01-01

    This report presents a pilot study of an integration of particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the collective search behavior of self-organized groups in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social group adaptation for the dynamic environment and to provide insight and understanding of social group knowledge discovering and strategic searching. A new adaptive environment model, which dynamically reacts to the group collective searching behaviors, is proposed in this research. The simulations in the research indicate that effective communication between groups is not the necessary requirement for whole self-organized groups to achieve the efficient collective searching behavior in the adaptive environment.

  9. Particle Swarm Based Collective Searching Model for Adaptive Environment

    SciTech Connect

    Cui, Xiaohui; Patton, Robert M; Potok, Thomas E; Treadwell, Jim N

    2007-01-01

    This report presents a pilot study of an integration of particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the collective search behavior of self-organized groups in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social group adaptation for the dynamic environment and to provide insight and understanding of social group knowledge discovering and strategic searching. A new adaptive environment model, which dynamically reacts to the group collective searching behaviors, is proposed in this research. The simulations in the research indicate that effective communication between groups is not the necessary requirement for whole self-organized groups to achieve the efficient collective searching behavior in the adaptive environment.

  10. Robust local search for spacecraft operations using adaptive noise

    NASA Technical Reports Server (NTRS)

    Fukunaga, Alex S.; Rabideau, Gregg; Chien, Steve

    2004-01-01

    Randomization is a standard technique for improving the performance of local search algorithms for constraint satisfaction. However, it is well-known that local search algorithms are constraints satisfaction. However, it is well-known that local search algorithms are to the noise values selected. We investigate the use of an adaptive noise mechanism in an iterative repair-based planner/scheduler for spacecraft operations. Preliminary results indicate that adaptive noise makes the use of randomized repair moves safe and robust; that is, using adaptive noise makes it possible to consistently achieve, performance comparable with the best tuned noise setting without the need for manually tuning the noise parameter.

  11. The Search for the Adaptable ICT Student

    ERIC Educational Resources Information Center

    Van Der Vyver, Glen

    2009-01-01

    The "new" ICT professional should be an articulate problem-solver who understands business and technology, in particular how technology can solve business problems. Furthermore, the ideal ICT student should be adaptable. The adaptable student embraces change, learns quickly, understands the job market, thrives on variety, is autonomous, predicts…

  12. Guided Text Search Using Adaptive Visual Analytics

    SciTech Connect

    Steed, Chad A; Symons, Christopher T; Senter, James K; DeNap, Frank A

    2012-10-01

    This research demonstrates the promise of augmenting interactive visualizations with semi- supervised machine learning techniques to improve the discovery of significant associations and insights in the search and analysis of textual information. More specifically, we have developed a system called Gryffin that hosts a unique collection of techniques that facilitate individualized investigative search pertaining to an ever-changing set of analytical questions over an indexed collection of open-source documents related to critical national infrastructure. The Gryffin client hosts dynamic displays of the search results via focus+context record listings, temporal timelines, term-frequency views, and multiple coordinate views. Furthermore, as the analyst interacts with the display, the interactions are recorded and used to label the search records. These labeled records are then used to drive semi-supervised machine learning algorithms that re-rank the unlabeled search records such that potentially relevant records are moved to the top of the record listing. Gryffin is described in the context of the daily tasks encountered at the US Department of Homeland Security s Fusion Center, with whom we are collaborating in its development. The resulting system is capable of addressing the analysts information overload that can be directly attributed to the deluge of information that must be addressed in the search and investigative analysis of textual information.

  13. An Innovative Adaptive Pushover Procedure Based on Storey Shear

    SciTech Connect

    Shakeri, Kazem; Shayanfar, Mohsen A.

    2008-07-08

    Since the conventional pushover analyses are unable to consider the effect of the higher modes and progressive variation in dynamic properties, recent years have witnessed the development of some advanced adaptive pushover methods. However in these methods, using the quadratic combination rules to combine the modal forces result in a positive value in load pattern at all storeys and the reversal sign of the modes is removed; consequently these methods do not have a major advantage over their non-adaptive counterparts. Herein an innovative adaptive pushover method based on storey shear is proposed which can take into account the reversal signs in higher modes. In each storey the applied load pattern is derived from the storey shear profile; consequently, the sign of the applied loads in consecutive steps could be changed. Accuracy of the proposed procedure is examined by applying it to a 20-storey steel building. It illustrates a good estimation of the peak response in inelastic phase.

  14. Searching for adaptive traits in genetic resources - phenology based approach

    NASA Astrophysics Data System (ADS)

    Bari, Abdallah

    2015-04-01

    Searching for adaptive traits in genetic resources - phenology based approach Abdallah Bari, Kenneth Street, Eddy De Pauw, Jalal Eddin Omari, and Chandra M. Biradar International Center for Agricultural Research in the Dry Areas, Rabat Institutes, Rabat, Morocco Phenology is an important plant trait not only for assessing and forecasting food production but also for searching in genebanks for adaptive traits. Among the phenological parameters we have been considering to search for such adaptive and rare traits are the onset (sowing period) and the seasonality (growing period). Currently an application is being developed as part of the focused identification of germplasm strategy (FIGS) approach to use climatic data in order to identify crop growing seasons and characterize them in terms of onset and duration. These approximations of growing period characteristics can then be used to estimate flowering and maturity dates for dryland crops, such as wheat, barley, faba bean, lentils and chickpea, and assess, among others, phenology-related traits such as days to heading [dhe] and grain filling period [gfp]. The approach followed here is based on first calculating long term average daily temperatures by fitting a curve to the monthly data over days from beginning of the year. Prior to the identification of these phenological stages the onset is extracted first from onset integer raster GIS layers developed based on a model of the growing period that considers both moisture and temperature limitations. The paper presents some examples of real applications of the approach to search for rare and adaptive traits.

  15. Self-Adaptive Stepsize Search Applied to Optimal Structural Design

    NASA Astrophysics Data System (ADS)

    Nolle, L.; Bland, J. A.

    Structural engineering often involves the design of space frames that are required to resist predefined external forces without exhibiting plastic deformation. The weight of the structure and hence the weight of its constituent members has to be as low as possible for economical reasons without violating any of the load constraints. Design spaces are usually vast and the computational costs for analyzing a single design are usually high. Therefore, not every possible design can be evaluated for real-world problems. In this work, a standard structural design problem, the 25-bar problem, has been solved using self-adaptive stepsize search (SASS), a relatively new search heuristic. This algorithm has only one control parameter and therefore overcomes the drawback of modern search heuristics, i.e. the need to first find a set of optimum control parameter settings for the problem at hand. In this work, SASS outperforms simulated-annealing, genetic algorithms, tabu search and ant colony optimization.

  16. Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search.

    PubMed

    Liu, Xianglong; Deng, Cheng; Lang, Bo; Tao, Dacheng; Li, Xuelong

    2016-02-01

    Recent years have witnessed the success of binary hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually built using hashing to cover more desired results in the hit buckets of each table. However, rare work studies the unified approach to constructing multiple informative hash tables using any type of hashing algorithms. Meanwhile, for multiple table search, it also lacks of a generic query-adaptive and fine-grained ranking scheme that can alleviate the binary quantization loss suffered in the standard hashing techniques. To solve the above problems, in this paper, we first regard the table construction as a selection problem over a set of candidate hash functions. With the graph representation of the function set, we propose an efficient solution that sequentially applies normalized dominant set to finding the most informative and independent hash functions for each table. To further reduce the redundancy between tables, we explore the reciprocal hash tables in a boosting manner, where the hash function graph is updated with high weights emphasized on the misclassified neighbor pairs of previous hash tables. To refine the ranking of the retrieved buckets within a certain Hamming radius from the query, we propose a query-adaptive bitwise weighting scheme to enable fine-grained bucket ranking in each hash table, exploiting the discriminative power of its hash functions and their complement for nearest neighbor search. Moreover, we integrate such scheme into the multiple table search using a fast, yet reciprocal table lookup algorithm within the adaptive weighted Hamming radius. In this paper, both the construction method and the query-adaptive search method are general and compatible with different types of hashing algorithms using different feature spaces and/or parameter settings. Our extensive experiments on several large-scale benchmarks demonstrate that the proposed techniques can significantly outperform both

  17. An Adaptive Ridge Procedure for L0 Regularization

    PubMed Central

    Frommlet, Florian; Nuel, Grégory

    2016-01-01

    Penalized selection criteria like AIC or BIC are among the most popular methods for variable selection. Their theoretical properties have been studied intensively and are well understood, but making use of them in case of high-dimensional data is difficult due to the non-convex optimization problem induced by L0 penalties. In this paper we introduce an adaptive ridge procedure (AR), where iteratively weighted ridge problems are solved whose weights are updated in such a way that the procedure converges towards selection with L0 penalties. After introducing AR its specific shrinkage properties are studied in the particular case of orthogonal linear regression. Based on extensive simulations for the non-orthogonal case as well as for Poisson regression the performance of AR is studied and compared with SCAD and adaptive LASSO. Furthermore an efficient implementation of AR in the context of least-squares segmentation is presented. The paper ends with an illustrative example of applying AR to analyze GWAS data. PMID:26849123

  18. Rapid Catalytic Template Searching as an Enzyme Function Prediction Procedure

    PubMed Central

    Nilmeier, Jerome P.; Kirshner, Daniel A.; Wong, Sergio E.; Lightstone, Felice C.

    2013-01-01

    We present an enzyme protein function identification algorithm, Catalytic Site Identification (CatSId), based on identification of catalytic residues. The method is optimized for highly accurate template identification across a diverse template library and is also very efficient in regards to time and scalability of comparisons. The algorithm matches three-dimensional residue arrangements in a query protein to a library of manually annotated, catalytic residues – The Catalytic Site Atlas (CSA). Two main processes are involved. The first process is a rapid protein-to-template matching algorithm that scales quadratically with target protein size and linearly with template size. The second process incorporates a number of physical descriptors, including binding site predictions, in a logistic scoring procedure to re-score matches found in Process 1. This approach shows very good performance overall, with a Receiver-Operator-Characteristic Area Under Curve (AUC) of 0.971 for the training set evaluated. The procedure is able to process cofactors, ions, nonstandard residues, and point substitutions for residues and ions in a robust and integrated fashion. Sites with only two critical (catalytic) residues are challenging cases, resulting in AUCs of 0.9411 and 0.5413 for the training and test sets, respectively. The remaining sites show excellent performance with AUCs greater than 0.90 for both the training and test data on templates of size greater than two critical (catalytic) residues. The procedure has considerable promise for larger scale searches. PMID:23675414

  19. Rapid catalytic template searching as an enzyme function prediction procedure.

    PubMed

    Nilmeier, Jerome P; Kirshner, Daniel A; Wong, Sergio E; Lightstone, Felice C

    2013-01-01

    We present an enzyme protein function identification algorithm, Catalytic Site Identification (CatSId), based on identification of catalytic residues. The method is optimized for highly accurate template identification across a diverse template library and is also very efficient in regards to time and scalability of comparisons. The algorithm matches three-dimensional residue arrangements in a query protein to a library of manually annotated, catalytic residues--The Catalytic Site Atlas (CSA). Two main processes are involved. The first process is a rapid protein-to-template matching algorithm that scales quadratically with target protein size and linearly with template size. The second process incorporates a number of physical descriptors, including binding site predictions, in a logistic scoring procedure to re-score matches found in Process 1. This approach shows very good performance overall, with a Receiver-Operator-Characteristic Area Under Curve (AUC) of 0.971 for the training set evaluated. The procedure is able to process cofactors, ions, nonstandard residues, and point substitutions for residues and ions in a robust and integrated fashion. Sites with only two critical (catalytic) residues are challenging cases, resulting in AUCs of 0.9411 and 0.5413 for the training and test sets, respectively. The remaining sites show excellent performance with AUCs greater than 0.90 for both the training and test data on templates of size greater than two critical (catalytic) residues. The procedure has considerable promise for larger scale searches.

  20. Symmetry-adapted Wannier functions in the maximal localization procedure

    NASA Astrophysics Data System (ADS)

    Sakuma, R.

    2013-06-01

    A procedure to construct symmetry-adapted Wannier functions in the framework of the maximally localized Wannier function approach [Marzari and Vanderbilt, Phys. Rev. BPRBMDO1098-012110.1103/PhysRevB.56.12847 56, 12847 (1997); Souza, Marzari, and Vanderbilt, Phys. Rev. BPRBMDO1098-012110.1103/PhysRevB.65.035109 65, 035109 (2001)] is presented. In this scheme, the minimization of the spread functional of the Wannier functions is performed with constraints that are derived from symmetry properties of the specified set of the Wannier functions and the Bloch functions used to construct them, therefore one can obtain a solution that does not necessarily yield the global minimum of the spread functional. As a test of this approach, results of atom-centered Wannier functions for GaAs and Cu are presented.

  1. Radiographic skills learning: procedure simulation using adaptive hypermedia.

    PubMed

    Costaridou, L; Panayiotakis, G; Pallikarakis, N; Proimos, B

    1996-10-01

    The design and development of a simulation tool supporting learning of radiographic skills is reported. This tool has by textual, graphical and iconic resources, organized according to a building-block, adaptive hypermedia approach, which is described and supported by an image base of radiographs. It offers interactive user-controlled simulation of radiographic imaging procedures. The development is based on a commercially available environment (Toolbook 3.0, Asymetrix Corporation). The core of the system is an attributed precedence (priority) graph, which represents a task outline (concept and resources structure), which is dynamically adjusted to selected procedures. The user interface imitates a conventional radiography system, i.e. operating console, tube, table, patient and cassette. System parameters, such as patient positioning, focus-to-patient distance, magnification, field dimensions, tube voltage and mAs are under user control. Their effects on image quality are presented, by means of an image base acquired under controlled exposure conditions. Innovative use of hypermedia, computer based learning and simulation principles and technology in the development of this tool resulted in an enhanced interactive environment providing radiographic parameter control and visualization of parameter effects on image quality. PMID:9038530

  2. An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm.

    PubMed

    Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

    2015-01-01

    Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper. PMID:25784928

  3. An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm.

    PubMed

    Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

    2015-01-01

    Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper.

  4. An Adaptive Image Enhancement Technique by Combining Cuckoo Search and Particle Swarm Optimization Algorithm

    PubMed Central

    Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

    2015-01-01

    Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper. PMID:25784928

  5. Generalized pattern search algorithms with adaptive precision function evaluations

    SciTech Connect

    Polak, Elijah; Wetter, Michael

    2003-05-14

    In the literature on generalized pattern search algorithms, convergence to a stationary point of a once continuously differentiable cost function is established under the assumption that the cost function can be evaluated exactly. However, there is a large class of engineering problems where the numerical evaluation of the cost function involves the solution of systems of differential algebraic equations. Since the termination criteria of the numerical solvers often depend on the design parameters, computer code for solving these systems usually defines a numerical approximation to the cost function that is discontinuous with respect to the design parameters. Standard generalized pattern search algorithms have been applied heuristically to such problems, but no convergence properties have been stated. In this paper we extend a class of generalized pattern search algorithms to a form that uses adaptive precision approximations to the cost function. These numerical approximations need not define a continuous function. Our algorithms can be used for solving linearly constrained problems with cost functions that are at least locally Lipschitz continuous. Assuming that the cost function is smooth, we prove that our algorithms converge to a stationary point. Under the weaker assumption that the cost function is only locally Lipschitz continuous, we show that our algorithms converge to points at which the Clarke generalized directional derivatives are nonnegative in predefined directions. An important feature of our adaptive precision scheme is the use of coarse approximations in the early iterations, with the approximation precision controlled by a test. Such an approach leads to substantial time savings in minimizing computationally expensive functions.

  6. A novel adaptive Cuckoo search for optimal query plan generation.

    PubMed

    Gomathi, Ramalingam; Sharmila, Dhandapani

    2014-01-01

    The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented. PMID:25215330

  7. A novel adaptive Cuckoo search for optimal query plan generation.

    PubMed

    Gomathi, Ramalingam; Sharmila, Dhandapani

    2014-01-01

    The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented.

  8. A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation

    PubMed Central

    Gomathi, Ramalingam; Sharmila, Dhandapani

    2014-01-01

    The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented. PMID:25215330

  9. Accelerated search for materials with targeted properties by adaptive design

    PubMed Central

    Xue, Dezhen; Balachandran, Prasanna V.; Hogden, John; Theiler, James; Xue, Deqing; Lookman, Turab

    2016-01-01

    Finding new materials with targeted properties has traditionally been guided by intuition, and trial and error. With increasing chemical complexity, the combinatorial possibilities are too large for an Edisonian approach to be practical. Here we show how an adaptive design strategy, tightly coupled with experiments, can accelerate the discovery process by sequentially identifying the next experiments or calculations, to effectively navigate the complex search space. Our strategy uses inference and global optimization to balance the trade-off between exploitation and exploration of the search space. We demonstrate this by finding very low thermal hysteresis (ΔT) NiTi-based shape memory alloys, with Ti50.0Ni46.7Cu0.8Fe2.3Pd0.2 possessing the smallest ΔT (1.84 K). We synthesize and characterize 36 predicted compositions (9 feedback loops) from a potential space of ∼800,000 compositions. Of these, 14 had smaller ΔT than any of the 22 in the original data set. PMID:27079901

  10. Accelerated search for materials with targeted properties by adaptive design

    NASA Astrophysics Data System (ADS)

    Xue, Dezhen; Balachandran, Prasanna V.; Hogden, John; Theiler, James; Xue, Deqing; Lookman, Turab

    2016-04-01

    Finding new materials with targeted properties has traditionally been guided by intuition, and trial and error. With increasing chemical complexity, the combinatorial possibilities are too large for an Edisonian approach to be practical. Here we show how an adaptive design strategy, tightly coupled with experiments, can accelerate the discovery process by sequentially identifying the next experiments or calculations, to effectively navigate the complex search space. Our strategy uses inference and global optimization to balance the trade-off between exploitation and exploration of the search space. We demonstrate this by finding very low thermal hysteresis (ΔT) NiTi-based shape memory alloys, with Ti50.0Ni46.7Cu0.8Fe2.3Pd0.2 possessing the smallest ΔT (1.84 K). We synthesize and characterize 36 predicted compositions (9 feedback loops) from a potential space of ~800,000 compositions. Of these, 14 had smaller ΔT than any of the 22 in the original data set.

  11. Accelerated search for materials with targeted properties by adaptive design.

    PubMed

    Xue, Dezhen; Balachandran, Prasanna V; Hogden, John; Theiler, James; Xue, Deqing; Lookman, Turab

    2016-01-01

    Finding new materials with targeted properties has traditionally been guided by intuition, and trial and error. With increasing chemical complexity, the combinatorial possibilities are too large for an Edisonian approach to be practical. Here we show how an adaptive design strategy, tightly coupled with experiments, can accelerate the discovery process by sequentially identifying the next experiments or calculations, to effectively navigate the complex search space. Our strategy uses inference and global optimization to balance the trade-off between exploitation and exploration of the search space. We demonstrate this by finding very low thermal hysteresis (ΔT) NiTi-based shape memory alloys, with Ti50.0Ni46.7Cu0.8Fe2.3Pd0.2 possessing the smallest ΔT (1.84 K). We synthesize and characterize 36 predicted compositions (9 feedback loops) from a potential space of ∼800,000 compositions. Of these, 14 had smaller ΔT than any of the 22 in the original data set. PMID:27079901

  12. Accelerated search for materials with targeted properties by adaptive design.

    PubMed

    Xue, Dezhen; Balachandran, Prasanna V; Hogden, John; Theiler, James; Xue, Deqing; Lookman, Turab

    2016-04-15

    Finding new materials with targeted properties has traditionally been guided by intuition, and trial and error. With increasing chemical complexity, the combinatorial possibilities are too large for an Edisonian approach to be practical. Here we show how an adaptive design strategy, tightly coupled with experiments, can accelerate the discovery process by sequentially identifying the next experiments or calculations, to effectively navigate the complex search space. Our strategy uses inference and global optimization to balance the trade-off between exploitation and exploration of the search space. We demonstrate this by finding very low thermal hysteresis (ΔT) NiTi-based shape memory alloys, with Ti50.0Ni46.7Cu0.8Fe2.3Pd0.2 possessing the smallest ΔT (1.84 K). We synthesize and characterize 36 predicted compositions (9 feedback loops) from a potential space of ∼800,000 compositions. Of these, 14 had smaller ΔT than any of the 22 in the original data set.

  13. Methodological aspects of an adaptive multidirectional pattern search to optimize speech perception using three hearing-aid algorithms

    NASA Astrophysics Data System (ADS)

    Franck, Bas A. M.; Dreschler, Wouter A.; Lyzenga, Johannes

    2004-12-01

    In this study we investigated the reliability and convergence characteristics of an adaptive multidirectional pattern search procedure, relative to a nonadaptive multidirectional pattern search procedure. The procedure was designed to optimize three speech-processing strategies. These comprise noise reduction, spectral enhancement, and spectral lift. The search is based on a paired-comparison paradigm, in which subjects evaluated the listening comfort of speech-in-noise fragments. The procedural and nonprocedural factors that influence the reliability and convergence of the procedure are studied using various test conditions. The test conditions combine different tests, initial settings, background noise types, and step size configurations. Seven normal hearing subjects participated in this study. The results indicate that the reliability of the optimization strategy may benefit from the use of an adaptive step size. Decreasing the step size increases accuracy, while increasing the step size can be beneficial to create clear perceptual differences in the comparisons. The reliability also depends on starting point, stop criterion, step size constraints, background noise, algorithms used, as well as the presence of drifting cues and suboptimal settings. There appears to be a trade-off between reliability and convergence, i.e., when the step size is enlarged the reliability improves, but the convergence deteriorates. .

  14. Procedure for Adapting Direct Simulation Monte Carlo Meshes

    NASA Technical Reports Server (NTRS)

    Woronowicz, Michael S.; Wilmoth, Richard G.; Carlson, Ann B.; Rault, Didier F. G.

    1992-01-01

    A technique is presented for adapting computational meshes used in the G2 version of the direct simulation Monte Carlo method. The physical ideas underlying the technique are discussed, and adaptation formulas are developed for use on solutions generated from an initial mesh. The effect of statistical scatter on adaptation is addressed, and results demonstrate the ability of this technique to achieve more accurate results without increasing necessary computational resources.

  15. Adapting Assessment Procedures for Delivery via an Automated Format.

    ERIC Educational Resources Information Center

    Kelly, Karen L.; And Others

    The Office of Personnel Management (OPM) decided to explore alternative examining procedures for positions covered by the Administrative Careers with America (ACWA) examination. One requirement for new procedures was that they be automated for use with OPM's recently developed Microcomputer Assisted Rating System (MARS), a highly efficient system…

  16. Adaptive nowcasting of influenza outbreaks using Google searches

    PubMed Central

    Preis, Tobias; Moat, Helen Susannah

    2014-01-01

    Seasonal influenza outbreaks and pandemics of new strains of the influenza virus affect humans around the globe. However, traditional systems for measuring the spread of flu infections deliver results with one or two weeks delay. Recent research suggests that data on queries made to the search engine Google can be used to address this problem, providing real-time estimates of levels of influenza-like illness in a population. Others have however argued that equally good estimates of current flu levels can be forecast using historic flu measurements. Here, we build dynamic ‘nowcasting’ models; in other words, forecasting models that estimate current levels of influenza, before the release of official data one week later. We find that when using Google Flu Trends data in combination with historic flu levels, the mean absolute error (MAE) of in-sample ‘nowcasts’ can be significantly reduced by 14.4%, compared with a baseline model that uses historic data on flu levels only. We further demonstrate that the MAE of out-of-sample nowcasts can also be significantly reduced by between 16.0% and 52.7%, depending on the length of the sliding training interval. We conclude that, using adaptive models, Google Flu Trends data can indeed be used to improve real-time influenza monitoring, even when official reports of flu infections are available with only one week's delay. PMID:26064532

  17. Licensee Event Report sequence coding and search procedure workshop

    SciTech Connect

    Cottrell, W.B.; Gallaher, R.B.

    1981-03-01

    Since mid-1980, the Office for Analysis and Evaluation of Operational Data (AEOD) of the Nuclear Regulatory Commission (NRC) has been developing procedures for the systematic review and analysis of Licensee Event Reports (LERs). These procedures generally address several areas of concern, including identification of significant trends and patterns, event sequence of occurrences, component failures, and system and plant effects. The AEOD and NSIC conducted a workshop on the new coding procedure at the American Museum of Science and Energy in Oak Ridge, TN, on November 24, 1980.

  18. Adaptive search in mobile peer-to-peer databases

    NASA Technical Reports Server (NTRS)

    Wolfson, Ouri (Inventor); Xu, Bo (Inventor)

    2010-01-01

    Information is stored in a plurality of mobile peers. The peers communicate in a peer to peer fashion, using a short-range wireless network. Occasionally, a peer initiates a search for information in the peer to peer network by issuing a query. Queries and pieces of information, called reports, are transmitted among peers that are within a transmission range. For each search additional peers are utilized, wherein these additional peers search and relay information on behalf of the originator of the search.

  19. Procedure for Adaptive Laboratory Evolution of Microorganisms Using a Chemostat.

    PubMed

    Jeong, Haeyoung; Lee, Sang J; Kim, Pil

    2016-01-01

    Natural evolution involves genetic diversity such as environmental change and a selection between small populations. Adaptive laboratory evolution (ALE) refers to the experimental situation in which evolution is observed using living organisms under controlled conditions and stressors; organisms are thereby artificially forced to make evolutionary changes. Microorganisms are subject to a variety of stressors in the environment and are capable of regulating certain stress-inducible proteins to increase their chances of survival. Naturally occurring spontaneous mutations bring about changes in a microorganism's genome that affect its chances of survival. Long-term exposure to chemostat culture provokes an accumulation of spontaneous mutations and renders the most adaptable strain dominant. Compared to the colony transfer and serial transfer methods, chemostat culture entails the highest number of cell divisions and, therefore, the highest number of diverse populations. Although chemostat culture for ALE requires more complicated culture devices, it is less labor intensive once the operation begins. Comparative genomic and transcriptome analyses of the adapted strain provide evolutionary clues as to how the stressors contribute to mutations that overcome the stress. The goal of the current paper is to bring about accelerated evolution of microorganisms under controlled laboratory conditions.

  20. Procedure for Adaptive Laboratory Evolution of Microorganisms Using a Chemostat.

    PubMed

    Jeong, Haeyoung; Lee, Sang J; Kim, Pil

    2016-01-01

    Natural evolution involves genetic diversity such as environmental change and a selection between small populations. Adaptive laboratory evolution (ALE) refers to the experimental situation in which evolution is observed using living organisms under controlled conditions and stressors; organisms are thereby artificially forced to make evolutionary changes. Microorganisms are subject to a variety of stressors in the environment and are capable of regulating certain stress-inducible proteins to increase their chances of survival. Naturally occurring spontaneous mutations bring about changes in a microorganism's genome that affect its chances of survival. Long-term exposure to chemostat culture provokes an accumulation of spontaneous mutations and renders the most adaptable strain dominant. Compared to the colony transfer and serial transfer methods, chemostat culture entails the highest number of cell divisions and, therefore, the highest number of diverse populations. Although chemostat culture for ALE requires more complicated culture devices, it is less labor intensive once the operation begins. Comparative genomic and transcriptome analyses of the adapted strain provide evolutionary clues as to how the stressors contribute to mutations that overcome the stress. The goal of the current paper is to bring about accelerated evolution of microorganisms under controlled laboratory conditions. PMID:27684991

  1. Adaptation to a simulated central scotoma during visual search training.

    PubMed

    Walsh, David V; Liu, Lei

    2014-03-01

    Patients with a central scotoma usually use a preferred retinal locus (PRL) consistently in daily activities. The selection process and time course of the PRL development are not well understood. We used a gaze-contingent display to simulate an isotropic central scotoma in normal subjects while they were practicing a difficult visual search task. As compared to foveal search, initial exposure to the simulated scotoma resulted in prolonged search reaction time, many more fixations and unorganized eye movements during search. By the end of a 1782-trial training with the simulated scotoma, the search performance improved to within 25% of normal foveal search. Accompanying the performance improvement, there were also fewer fixations, fewer repeated fixations in the same area of the search stimulus and a clear tendency of using one area near the border of the scotoma to identify the search target. The results were discussed in relation to natural development of PRL in central scotoma patients and potential visual training protocols to facilitate PRL development. PMID:24456805

  2. Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

    NASA Astrophysics Data System (ADS)

    Sheng, Zheng; Wang, Jun; Zhou, Shudao; Zhou, Bihua

    2014-03-01

    This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

  3. Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm.

    PubMed

    Sheng, Zheng; Wang, Jun; Zhou, Shudao; Zhou, Bihua

    2014-03-01

    This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

  4. Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm.

    PubMed

    Sheng, Zheng; Wang, Jun; Zhou, Shudao; Zhou, Bihua

    2014-03-01

    This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm. PMID:24697395

  5. Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

    SciTech Connect

    Sheng, Zheng; Wang, Jun; Zhou, Bihua; Zhou, Shudao

    2014-03-15

    This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

  6. Features: Real-Time Adaptive Feature and Document Learning for Web Search.

    ERIC Educational Resources Information Center

    Chen, Zhixiang; Meng, Xiannong; Fowler, Richard H.; Zhu, Binhai

    2001-01-01

    Describes Features, an intelligent Web search engine that is able to perform real-time adaptive feature (i.e., keyword) and document learning. Explains how Features learns from users' document relevance feedback and automatically extracts and suggests indexing keywords relevant to a search query, and learns from users' keyword relevance feedback…

  7. An adaptive embedded mesh procedure for leading-edge vortex flows

    NASA Technical Reports Server (NTRS)

    Powell, Kenneth G.; Beer, Michael A.; Law, Glenn W.

    1989-01-01

    A procedure for solving the conical Euler equations on an adaptively refined mesh is presented, along with a method for determining which cells to refine. The solution procedure is a central-difference cell-vertex scheme. The adaptation procedure is made up of a parameter on which the refinement decision is based, and a method for choosing a threshold value of the parameter. The refinement parameter is a measure of mesh-convergence, constructed by comparison of locally coarse- and fine-grid solutions. The threshold for the refinement parameter is based on the curvature of the curve relating the number of cells flagged for refinement to the value of the refinement threshold. Results for three test cases are presented. The test problem is that of a delta wing at angle of attack in a supersonic free-stream. The resulting vortices and shocks are captured efficiently by the adaptive code.

  8. Procedures for conducting underwater searches for invasive mussels (Dreissena sp.)

    USGS Publications Warehouse

    Adams, Noah

    2010-01-01

    available also can kill other aquatic life. Early implementation of containment and eradication efforts requires getting reliable information to confirm the location of the infestation. One way to get this information is through the use of properly trained SCUBA divers. This document provides SCUBA divers with the necessary information to conduct underwater searchers for mussels. However, using SCUBA divers to search for mussels over a large geographic area is relatively expensive and inefficient. Early detection monitoring methods can be used to optimize the use of SCUBA divers. Early detection monitoring can be accomplished by collecting water samples or deploying artificial settlement substrates (fig. 1). Water samples are used to look for free-swimming larval mussels (called veligers). Because the veligers cannot be identified with the naked eye, the water samples are sent to a laboratory where they are examined under a microscope and/or analyzed using molecular techniques to detect veligers. To detect the presences of adult mussels, artificial substrates are deployed and periodically retrieved to determine if mussels have settled on the substrate. If veligers or adults are identified, SCUBA divers can be deployed to confirm the presence of mussels.

  9. [Adaptive procedures for measuring arterial blood flow velocity in retinal vessels using indicator technique].

    PubMed

    Vilser, W; Schack, B; Bareshova, E; Senff, I; Bräuer-Burchardt, C; Münch, K; Strobel, J

    1995-10-01

    There are highly significant differences in the measuring results of arterial blood velocity between the indicator and laser-Doppler techniques (up to 800%). A new measuring procedure for the analysis of indicator dilution curves was developed based on indicator model and experimental results. The use of this new measuring procedure results in reduced mean systematic error between the indicator and laser-Doppler techniques to values around 10%. With the introduction of adaptive measuring arrays for the creation of indicator dilution curves and the application of adaptive algorithms for centering and spectral normalizing of the dilution curves, improved reproducibility can be expected.

  10. An adaptive refinement procedure for transient thermal analysis using nodeless variable finite elements

    NASA Technical Reports Server (NTRS)

    Ramakrishnan, R.; Wieting, Allan R.; Thornton, Earl A.

    1990-01-01

    An adaptive mesh refinement procedure that uses nodeless variables and quadratic interpolation functions is presented for analyzing transient thermal problems. A temperature based finite element scheme with Crank-Nicolson time marching is used to obtain the thermal solution. The strategies used for mesh adaption, computing refinement indicators, and time marching are described. Examples in one and two dimensions are presented and comparisons are made with exact solutions. The effectiveness of this procedure for transient thermal analysis is reflected in good solution accuracy, reduction in number of elements used, and computational efficiency.

  11. Face adaptation does not improve performance on search or discrimination tasks.

    PubMed

    Ng, Minna; Boynton, Geoffrey M; Fine, Ione

    2008-01-04

    The face adaptation effect, as described by M. A. Webster and O. H. MacLin (1999), is a robust perceptual shift in the appearance of faces after a brief adaptation period. For example, prolonged exposure to Asian faces causes a Eurasian face to appear distinctly Caucasian. This adaptation effect has been documented for general configural effects, as well as for the facial properties of gender, ethnicity, expression, and identity. We began by replicating the finding that adaptation to ethnicity, gender, and a combination of both features induces selective shifts in category appearance. We then investigated whether this adaptation has perceptual consequences beyond a shift in the perceived category boundary by measuring the effects of adaptation on RSVP, spatial search, and discrimination tasks. Adaptation had no discernable effect on performance for any of these tasks.

  12. Visual search disorders in acute and chronic homonymous hemianopia: lesion effects and adaptive strategies.

    PubMed

    Machner, Björn; Sprenger, Andreas; Sander, Thurid; Heide, Wolfgang; Kimmig, Hubert; Helmchen, Christoph; Kömpf, Detlef

    2009-05-01

    Patients with homonymous hemianopia due to occipital brain lesions show disorders of visual search. In everyday life this leads to difficulties in reading and spatial orientation. It is a matter of debate whether these disorders are due to the brain lesion or rather reflect compensatory eye movement strategies developing over time. For the first time, eye movements of acute hemianopic patients (n= 9) were recorded during the first days following stroke while they performed an exploratory visual-search task. Compared to age-matched control subjects their search duration was prolonged due to increased fixations and refixations, that is, repeated scanning of previously searched locations. Saccadic amplitudes were smaller in patients. Right hemianopic patients were more impaired than left hemianopic patients. The number of fixations and refixations did not differ significantly between both hemifields in the patients. Follow-up of one patient revealed changes of visual search over 18 months. By using more structured scanpaths with fewer saccades his search duration decreased. Furthermore, he developed a more efficient eye-movement strategy by making larger but less frequent saccades toward his blind side. In summary, visual-search behavior of acute hemianopic patients differs from healthy control subjects and from chronic hemianopic patients. We conclude that abnormal visual search in acute hemianopic patients is related to the brain lesion. We provide some evidence for adaptive eye-movement strategies developed over time. These adaptive strategies make the visual search more efficient and may help to compensate for the persisting visual-field loss.

  13. Stochastic Leader Gravitational Search Algorithm for Enhanced Adaptive Beamforming Technique

    PubMed Central

    Darzi, Soodabeh; Islam, Mohammad Tariqul; Tiong, Sieh Kiong; Kibria, Salehin; Singh, Mandeep

    2015-01-01

    In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by eliminating the agents with the poorest performances to allow rapid convergence. The performance of the SL-GSA was analyzed for six well-known benchmark functions, and the results are compared with SGSA and some of its variants. Furthermore, the SL-GSA is applied to minimum variance distortionless response (MVDR) beamforming technique to ensure compatibility with real world optimization problems. The proposed algorithm demonstrates superior convergence rate and quality of solution for both real world problems and benchmark functions compared to original algorithm and other recent variants of SGSA. PMID:26552032

  14. Simple and effective procedure for conformational search of macromolecules. Application to Met- and Leu-Enkephalin

    SciTech Connect

    Meirovitch, H.; Meirovitch, E. ); Michel, A.G. ); Vasquez, M. )

    1994-06-23

    A simple and efficient method for searching the conformational space of macromolecules is presented. With this method an initial set of relatively low-energy structures is generated, and their energies are further minimized with a procedure that enables escaping from local energy minima. Illustrative calculations are described for Met- and Leu-enkephalin. 37 refs., 1 tab.

  15. An autonomous adaptive scheduling agent for period searching

    NASA Astrophysics Data System (ADS)

    Saunders, E. S.; Naylor, T.; Allan, A.

    2008-03-01

    We describe the design and implementation of an autonomous adaptive software agent that addresses the practical problem of observing undersampled, periodic, time-varying phenomena using a network of HTN-compliant robotic telescopes. The algorithm governing the behaviour of the agent uses an optimal geometric sampling technique to cover the period range of interest, but additionally implements proactive behaviour that maximises the optimality of the dataset in the face of an uncertain and changing operating environment.

  16. Through the interaction of neutral and adaptive mutations, evolutionary search finds a way.

    PubMed

    Yu, Tina; Miller, Julian Francis

    2006-01-01

    An evolutionary system that supports the interaction of neutral and adaptive mutations is investigated. Experimental results on a Boolean function and needle-in-haystack problems show that this system enables evolutionary search to find better solutions faster. Through a novel analysis based on the ratio of neutral to adaptive mutations, we identify this interaction as an engine that automatically adjusts the relative amounts of exploration and exploitation to achieve effective search (i.e., it is self-adaptive). Moreover, a hypothesis to describe the search process in this system is proposed and investigated. Our findings lead us to counter the arguments of those who dismiss the usefulness of neutrality. We argue that the benefits of neutrality are intimately related to its implementation, so that one must be cautious about making general claims about its merits or demerits.

  17. A Procedure for Controlling General Test Overlap in Computerized Adaptive Testing

    ERIC Educational Resources Information Center

    Chen, Shu-Ying

    2010-01-01

    To date, exposure control procedures that are designed to control test overlap in computerized adaptive tests (CATs) are based on the assumption of item sharing between pairs of examinees. However, in practice, examinees may obtain test information from more than one previous test taker. This larger scope of information sharing needs to be…

  18. Dementia alters standing postural adaptation during a visual search task in older adult men.

    PubMed

    Jor'dan, Azizah J; McCarten, J Riley; Rottunda, Susan; Stoffregen, Thomas A; Manor, Brad; Wade, Michael G

    2015-04-23

    This study investigated the effects of dementia on standing postural adaptation during performance of a visual search task. We recruited 16 older adults with dementia and 15 without dementia. Postural sway was assessed by recording medial-lateral (ML) and anterior-posterior (AP) center-of-pressure when standing with and without a visual search task; i.e., counting target letter frequency within a block of displayed randomized letters. ML sway variability was significantly higher in those with dementia during visual search as compared to those without dementia and compared to both groups during the control condition. AP sway variability was significantly greater in those with dementia as compared to those without dementia, irrespective of task condition. In the ML direction, the absolute and percent change in sway variability between the control condition and visual search (i.e., postural adaptation) was greater in those with dementia as compared to those without. In contrast, postural adaptation to visual search was similar between groups in the AP direction. As compared to those without dementia, those with dementia identified fewer letters on the visual task. In the non-dementia group only, greater increases in postural adaptation in both the ML and AP direction, correlated with lower performance on the visual task. The observed relationship between postural adaptation during the visual search task and visual search task performance--in the non-dementia group only--suggests a critical link between perception and action. Dementia reduces the capacity to perform a visual-based task while standing and thus, appears to disrupt this perception-action synergy.

  19. Length-adaptive graph search for automatic segmentation of pathological features in optical coherence tomography images

    NASA Astrophysics Data System (ADS)

    Keller, Brenton; Cunefare, David; Grewal, Dilraj S.; Mahmoud, Tamer H.; Izatt, Joseph A.; Farsiu, Sina

    2016-07-01

    We introduce a metric in graph search and demonstrate its application for segmenting retinal optical coherence tomography (OCT) images of macular pathology. Our proposed "adjusted mean arc length" (AMAL) metric is an adaptation of the lowest mean arc length search technique for automated OCT segmentation. We compare this method to Dijkstra's shortest path algorithm, which we utilized previously in our popular graph theory and dynamic programming segmentation technique. As an illustrative example, we show that AMAL-based length-adaptive segmentation outperforms the shortest path in delineating the retina/vitreous boundary of patients with full-thickness macular holes when compared with expert manual grading.

  20. Query-Adaptive Hash Code Ranking for Large-Scale Multi-View Visual Search.

    PubMed

    Liu, Xianglong; Huang, Lei; Deng, Cheng; Lang, Bo; Tao, Dacheng

    2016-10-01

    Hash-based nearest neighbor search has become attractive in many applications. However, the quantization in hashing usually degenerates the discriminative power when using Hamming distance ranking. Besides, for large-scale visual search, existing hashing methods cannot directly support the efficient search over the data with multiple sources, and while the literature has shown that adaptively incorporating complementary information from diverse sources or views can significantly boost the search performance. To address the problems, this paper proposes a novel and generic approach to building multiple hash tables with multiple views and generating fine-grained ranking results at bitwise and tablewise levels. For each hash table, a query-adaptive bitwise weighting is introduced to alleviate the quantization loss by simultaneously exploiting the quality of hash functions and their complement for nearest neighbor search. From the tablewise aspect, multiple hash tables are built for different data views as a joint index, over which a query-specific rank fusion is proposed to rerank all results from the bitwise ranking by diffusing in a graph. Comprehensive experiments on image search over three well-known benchmarks show that the proposed method achieves up to 17.11% and 20.28% performance gains on single and multiple table search over the state-of-the-art methods. PMID:27448359

  1. Query-Adaptive Hash Code Ranking for Large-Scale Multi-View Visual Search.

    PubMed

    Liu, Xianglong; Huang, Lei; Deng, Cheng; Lang, Bo; Tao, Dacheng

    2016-10-01

    Hash-based nearest neighbor search has become attractive in many applications. However, the quantization in hashing usually degenerates the discriminative power when using Hamming distance ranking. Besides, for large-scale visual search, existing hashing methods cannot directly support the efficient search over the data with multiple sources, and while the literature has shown that adaptively incorporating complementary information from diverse sources or views can significantly boost the search performance. To address the problems, this paper proposes a novel and generic approach to building multiple hash tables with multiple views and generating fine-grained ranking results at bitwise and tablewise levels. For each hash table, a query-adaptive bitwise weighting is introduced to alleviate the quantization loss by simultaneously exploiting the quality of hash functions and their complement for nearest neighbor search. From the tablewise aspect, multiple hash tables are built for different data views as a joint index, over which a query-specific rank fusion is proposed to rerank all results from the bitwise ranking by diffusing in a graph. Comprehensive experiments on image search over three well-known benchmarks show that the proposed method achieves up to 17.11% and 20.28% performance gains on single and multiple table search over the state-of-the-art methods.

  2. Lost in Search: (Mal-)Adaptation to Probabilistic Decision Environments in Children and Adults

    ERIC Educational Resources Information Center

    Betsch, Tilmann; Lehmann, Anne; Lindow, Stefanie; Lang, Anna; Schoemann, Martin

    2016-01-01

    Adaptive decision making in probabilistic environments requires individuals to use probabilities as weights in predecisional information searches and/or when making subsequent choices. Within a child-friendly computerized environment (Mousekids), we tracked 205 children's (105 children 5-6 years of age and 100 children 9-10 years of age) and 103…

  3. A Need for an Adaptive Search Tool for Teachers: Case Study

    ERIC Educational Resources Information Center

    Seyedarabi, Faezeh; Seyedarabi, Arefeh

    2005-01-01

    Whether intentionally or not, teachers are excluded from having the full benefit of the new technologies developed and adapted by the search engine developers, while all the current and proposed research and developments are focused mainly on the end users (students/learners, businesses and/the government) and not specifically on teachers who act…

  4. Visual search disorders in acute and chronic homonymous hemianopia: lesion effects and adaptive strategies.

    PubMed

    Machner, Björn; Sprenger, Andreas; Sander, Thurid; Heide, Wolfgang; Kimmig, Hubert; Helmchen, Christoph; Kömpf, Detlef

    2009-05-01

    Patients with homonymous hemianopia due to occipital brain lesions show disorders of visual search. In everyday life this leads to difficulties in reading and spatial orientation. It is a matter of debate whether these disorders are due to the brain lesion or rather reflect compensatory eye movement strategies developing over time. For the first time, eye movements of acute hemianopic patients (n= 9) were recorded during the first days following stroke while they performed an exploratory visual-search task. Compared to age-matched control subjects their search duration was prolonged due to increased fixations and refixations, that is, repeated scanning of previously searched locations. Saccadic amplitudes were smaller in patients. Right hemianopic patients were more impaired than left hemianopic patients. The number of fixations and refixations did not differ significantly between both hemifields in the patients. Follow-up of one patient revealed changes of visual search over 18 months. By using more structured scanpaths with fewer saccades his search duration decreased. Furthermore, he developed a more efficient eye-movement strategy by making larger but less frequent saccades toward his blind side. In summary, visual-search behavior of acute hemianopic patients differs from healthy control subjects and from chronic hemianopic patients. We conclude that abnormal visual search in acute hemianopic patients is related to the brain lesion. We provide some evidence for adaptive eye-movement strategies developed over time. These adaptive strategies make the visual search more efficient and may help to compensate for the persisting visual-field loss. PMID:19645941

  5. Paradoxical results of adaptive false discovery rate procedures in neuroimaging studies.

    PubMed

    Reiss, Philip T; Schwartzman, Armin; Lu, Feihan; Huang, Lei; Proal, Erika

    2012-12-01

    Adaptive false discovery rate (FDR) procedures, which offer greater power than the original FDR procedure of Benjamini and Hochberg, are often applied to statistical maps of the brain. When a large proportion of the null hypotheses are false, as in the case of widespread effects such as cortical thinning throughout much of the brain, adaptive FDR methods can surprisingly reject more null hypotheses than not accounting for multiple testing at all-i.e., using uncorrected p-values. A straightforward mathematical argument is presented to explain why this can occur with the q-value method of Storey and colleagues, and a simulation study shows that it can also occur, to a lesser extent, with a two-stage FDR procedure due to Benjamini and colleagues. We demonstrate the phenomenon with reference to a published data set documenting cortical thinning in attention deficit/hyperactivity disorder. The paper concludes with recommendations for how to proceed when adaptive FDR results of this kind are encountered in practice.

  6. An adaptive mesh-moving and refinement procedure for one-dimensional conservation laws

    NASA Technical Reports Server (NTRS)

    Biswas, Rupak; Flaherty, Joseph E.; Arney, David C.

    1993-01-01

    We examine the performance of an adaptive mesh-moving and /or local mesh refinement procedure for the finite difference solution of one-dimensional hyperbolic systems of conservation laws. Adaptive motion of a base mesh is designed to isolate spatially distinct phenomena, and recursive local refinement of the time step and cells of the stationary or moving base mesh is performed in regions where a refinement indicator exceeds a prescribed tolerance. These adaptive procedures are incorporated into a computer code that includes a MacCormack finite difference scheme wih Davis' artificial viscosity model and a discretization error estimate based on Richardson's extrapolation. Experiments are conducted on three problems in order to qualify the advantages of adaptive techniques relative to uniform mesh computations and the relative benefits of mesh moving and refinement. Key results indicate that local mesh refinement, with and without mesh moving, can provide reliable solutions at much lower computational cost than possible on uniform meshes; that mesh motion can be used to improve the results of uniform mesh solutions for a modest computational effort; that the cost of managing the tree data structure associated with refinement is small; and that a combination of mesh motion and refinement reliably produces solutions for the least cost per unit accuracy.

  7. How to adapt broad-band gravitational-wave searches for r-modes

    SciTech Connect

    Owen, Benjamin J.

    2010-11-15

    Up to now there has been no search for gravitational waves from the r-modes of neutron stars in spite of the theoretical interest in the subject. Several oddities of r-modes must be addressed to obtain an observational result: The gravitational radiation field is dominated by the mass current (gravitomagnetic) quadrupole rather than the usual mass quadrupole, and the consequent difference in polarization affects detection statistics and parameter estimation. To astrophysically interpret a detection or upper limit it is necessary to convert the gravitational-wave amplitude to an r-mode amplitude. Also, it is helpful to know indirect limits on gravitational-wave emission to gauge the interest of various searches. Here I address these issues, thereby providing the ingredients to adapt broad-band searches for continuous gravitational waves to obtain r-mode results. I also show that searches of existing data can already have interesting sensitivities to r-modes.

  8. An adaptive weighted ensemble procedure for efficient computation of free energies and first passage rates.

    PubMed

    Bhatt, Divesh; Bahar, Ivet

    2012-09-14

    We introduce an adaptive weighted-ensemble procedure (aWEP) for efficient and accurate evaluation of first-passage rates between states for two-state systems. The basic idea that distinguishes aWEP from conventional weighted-ensemble (WE) methodology is the division of the configuration space into smaller regions and equilibration of the trajectories within each region upon adaptive partitioning of the regions themselves into small grids. The equilibrated conditional∕transition probabilities between each pair of regions lead to the determination of populations of the regions and the first-passage times between regions, which in turn are combined to evaluate the first passage times for the forward and backward transitions between the two states. The application of the procedure to a non-trivial coarse-grained model of a 70-residue calcium binding domain of calmodulin is shown to efficiently yield information on the equilibrium probabilities of the two states as well as their first passage times. Notably, the new procedure is significantly more efficient than the canonical implementation of the WE procedure, and this improvement becomes even more significant at low temperatures.

  9. Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm.

    PubMed

    Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

    2016-01-01

    Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter. PMID:27212938

  10. Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm.

    PubMed

    Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

    2016-01-01

    Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter.

  11. Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm

    PubMed Central

    Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

    2016-01-01

    Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter. PMID:27212938

  12. Prism Adaptation and Aftereffect: Specifying the Properties of a Procedural Memory System

    PubMed Central

    Fernández-Ruiz, Juan; Díaz, Rosalinda

    1999-01-01

    Prism adaptation, a form of procedural learning, is a phenomenon in which the motor system adapts to new visuospatial coordinates imposed by prisms that displace the visual field. Once the prisms are withdrawn, the degree and strength of the adaptation can be measured by the spatial deviation of the motor actions in the direction opposite to the visual displacement imposed by the prisms, a phenomenon known as aftereffect. This study was designed to define the variables that affect the acquisition and retention of the aftereffect. Subjects were required to throw balls to a target in front of them before, during, and after lateral displacement of the visual field with prismatic spectacles. The diopters of the prisms and the number of throws were varied among different groups of subjects. The results show that the adaptation process is dependent on the number of interactions between the visual and motor system, and not on the time spent wearing the prisms. The results also show that the magnitude of the aftereffect is highly correlated with the magnitude of the adaptation, regardless of the diopters of the prisms or the number of throws. Finally, the results suggest that persistence of the aftereffect depends on the number of throws after the adaptation is complete. On the basis of these results, we propose that the system underlying this kind of learning stores at least two different parameters, the contents (measured as the magnitude of displacement) and the persistence (measured as the number of throws to return to the baseline) of the learned information. PMID:10355523

  13. Multi-threaded adaptive extrapolation procedure for Feynman loop integrals in the physical region

    NASA Astrophysics Data System (ADS)

    de Doncker, E.; Yuasa, F.; Assaf, R.

    2013-08-01

    Feynman loop integrals appear in higher order corrections of interaction cross section calculations in perturbative quantum field theory. The integrals are computationally intensive especially in view of singularities which may occur within the integration domain. For the treatment of threshold and infrared singularities we developed techniques using iterated (repeated) adaptive integration and extrapolation. In this paper we describe a shared memory parallelization and its application to one- and two-loop problems, by multi-threading in the outer integrations of the iterated integral. The implementation is layered over OpenMP and retains the adaptive procedure of the sequential method exactly. We give performance results for loop integrals associated with various types of diagrams including one-loop box, pentagon, two-loop self-energy and two-loop vertex diagrams.

  14. Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.

    PubMed

    Mei, Gang; Xu, Nengxiong; Xu, Liangliang

    2016-01-01

    This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm. PMID:27610308

  15. A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

    NASA Astrophysics Data System (ADS)

    Chen, Xianshun; Feng, Liang; Ong, Yew Soon

    2012-07-01

    In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRPSD). In particular, the contribution of this article is three-fold. First, the proposed SAMRS employs the robust solution search scheme (RS 3) as an approximation of the computationally intensive Monte Carlo simulation, thus reducing the computation cost of fitness evaluation in VRPSD, while directing the search towards robust and reliable solutions. Furthermore, a self-adaptive individual learning based on the conceptual modelling of memeplex is introduced in the SAMRS. Finally, SAMRS incorporates a gene-meme co-evolution model with genetic and memetic representation to effectively manage the search for solutions in VRPSD. Extensive experimental results are then presented for benchmark problems to demonstrate that the proposed SAMRS serves as an efficable means of generating high-quality robust and reliable solutions in VRPSD.

  16. Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.

    PubMed

    Mei, Gang; Xu, Nengxiong; Xu, Liangliang

    2016-01-01

    This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm.

  17. An adaptive procedure for the numerical parameters of a particle simulation

    NASA Astrophysics Data System (ADS)

    Galitzine, Cyril; Boyd, Iain D.

    2015-01-01

    In this article, a computational procedure that automatically determines the optimum time step, cell weight and species weights for steady-state multi-species DSMC (direct simulation Monte Carlo) simulations is presented. The time step is required to satisfy the basic requirements of the DSMC method while the weight and relative weights fields are chosen so as to obtain a user-specified average number of particles in all cells of the domain. The procedure allows the conduct of efficient DSMC simulations with minimal user input and is integrable into existing DSMC codes. The adaptive method is used to simulate a test case consisting of two counterflowing jets at a Knudsen number of 0.015. Large accuracy gains for sampled number densities and velocities over a standard simulation approach for the same number of particles are observed.

  18. An adaptive clinical trials procedure for a sensitive subgroup examined in the multiple sclerosis context.

    PubMed

    Riddell, Corinne A; Zhao, Yinshan; Petkau, John

    2016-08-01

    The biomarker-adaptive threshold design (BATD) allows researchers to simultaneously study the efficacy of treatment in the overall group and to investigate the relationship between a hypothesized predictive biomarker and the treatment effect on the primary outcome. It was originally developed for survival outcomes for Phase III clinical trials where the biomarker of interest is measured on a continuous scale. In this paper, generalizations of the BATD to accommodate count biomarkers and outcomes are developed and then studied in the multiple sclerosis (MS) context where the number of relapses is a commonly used outcome. Through simulation studies, we find that the BATD has increased power compared with a traditional fixed procedure under varying scenarios for which there exists a sensitive patient subgroup. As an illustration, we apply the procedure for two hypothesized markers, baseline enhancing lesion count and disease duration at baseline, using data from a previously completed trial. MS duration appears to be a predictive marker relationship for this dataset, and the procedure indicates that the treatment effect is strongest for patients who have had MS for less than 7.8 years. The procedure holds promise of enhanced statistical power when the treatment effect is greatest in a sensitive patient subgroup.

  19. An adaptive gating approach for x-ray dose reduction during cardiac interventional procedures

    SciTech Connect

    Abdel-Malek, A.; Yassa, F.; Bloomer, J. )

    1994-03-01

    The increasing number of cardiac interventional procedures has resulted in a tremendous increase in the absorbed x-ray dose by radiologists as well as patients. A new method is presented for x-ray dose reduction which utilizes adaptive tube pulse-rate scheduling in pulsed fluoroscopic systems. In the proposed system, pulse-rate scheduling depends on the heart muscle activity phase determined through continuous guided segmentation of the patient's electrocardiogram (ECG). Displaying images generated at the proposed adaptive nonuniform rate is visually unacceptable; therefore, a frame-filling approach is devised to ensure a 30 frame/sec display rate. The authors adopted two approaches for the frame-filling portion of the system depending on the imaging mode used in the procedure. During cine-mode imaging (high x-ray dose), collected image frame-to-frame pixel motion is estimated using a pel-recursive algorithm followed by motion-based pixel interpolation to estimate the frames necessary to increase the rate to 30 frames/sec. The other frame-filling approach is adopted during fluoro-mode imaging (low x-ray dose), characterized by low signal-to-noise ratio images. This approach consists of simply holding the last collected frame for as many frames as necessary to maintain the real-time display rate.

  20. Persistence and Adaptation in Immunity: T Cells Balance the Extent and Thoroughness of Search.

    PubMed

    Fricke, G Matthew; Letendre, Kenneth A; Moses, Melanie E; Cannon, Judy L

    2016-03-01

    Effective search strategies have evolved in many biological systems, including the immune system. T cells are key effectors of the immune response, required for clearance of pathogenic infection. T cell activation requires that T cells encounter antigen-bearing dendritic cells within lymph nodes, thus, T cell search patterns within lymph nodes may be a crucial determinant of how quickly a T cell immune response can be initiated. Previous work suggests that T cell motion in the lymph node is similar to a Brownian random walk, however, no detailed analysis has definitively shown whether T cell movement is consistent with Brownian motion. Here, we provide a precise description of T cell motility in lymph nodes and a computational model that demonstrates how motility impacts T cell search efficiency. We find that both Brownian and Lévy walks fail to capture the complexity of T cell motion. Instead, T cell movement is better described as a correlated random walk with a heavy-tailed distribution of step lengths. Using computer simulations, we identify three distinct factors that contribute to increasing T cell search efficiency: 1) a lognormal distribution of step lengths, 2) motion that is directionally persistent over short time scales, and 3) heterogeneity in movement patterns. Furthermore, we show that T cells move differently in specific frequently visited locations that we call "hotspots" within lymph nodes, suggesting that T cells change their movement in response to the lymph node environment. Our results show that like foraging animals, T cells adapt to environmental cues, suggesting that adaption is a fundamental feature of biological search.

  1. Persistence and Adaptation in Immunity: T Cells Balance the Extent and Thoroughness of Search

    PubMed Central

    Fricke, G. Matthew; Letendre, Kenneth A.; Moses, Melanie E.; Cannon, Judy L.

    2016-01-01

    Effective search strategies have evolved in many biological systems, including the immune system. T cells are key effectors of the immune response, required for clearance of pathogenic infection. T cell activation requires that T cells encounter antigen-bearing dendritic cells within lymph nodes, thus, T cell search patterns within lymph nodes may be a crucial determinant of how quickly a T cell immune response can be initiated. Previous work suggests that T cell motion in the lymph node is similar to a Brownian random walk, however, no detailed analysis has definitively shown whether T cell movement is consistent with Brownian motion. Here, we provide a precise description of T cell motility in lymph nodes and a computational model that demonstrates how motility impacts T cell search efficiency. We find that both Brownian and Lévy walks fail to capture the complexity of T cell motion. Instead, T cell movement is better described as a correlated random walk with a heavy-tailed distribution of step lengths. Using computer simulations, we identify three distinct factors that contribute to increasing T cell search efficiency: 1) a lognormal distribution of step lengths, 2) motion that is directionally persistent over short time scales, and 3) heterogeneity in movement patterns. Furthermore, we show that T cells move differently in specific frequently visited locations that we call “hotspots” within lymph nodes, suggesting that T cells change their movement in response to the lymph node environment. Our results show that like foraging animals, T cells adapt to environmental cues, suggesting that adaption is a fundamental feature of biological search. PMID:26990103

  2. Adjoint-based error estimation and mesh adaptation for the correction procedure via reconstruction method

    NASA Astrophysics Data System (ADS)

    Shi, Lei; Wang, Z. J.

    2015-08-01

    Adjoint-based mesh adaptive methods are capable of distributing computational resources to areas which are important for predicting an engineering output. In this paper, we develop an adjoint-based h-adaptation approach based on the high-order correction procedure via reconstruction formulation (CPR) to minimize the output or functional error. A dual-consistent CPR formulation of hyperbolic conservation laws is developed and its dual consistency is analyzed. Super-convergent functional and error estimate for the output with the CPR method are obtained. Factors affecting the dual consistency, such as the solution point distribution, correction functions, boundary conditions and the discretization approach for the non-linear flux divergence term, are studied. The presented method is then used to perform simulations for the 2D Euler and Navier-Stokes equations with mesh adaptation driven by the adjoint-based error estimate. Several numerical examples demonstrate the ability of the presented method to dramatically reduce the computational cost comparing with uniform grid refinement.

  3. Shack-Hartmann wavefront sensor with large dynamic range by adaptive spot search method.

    PubMed

    Shinto, Hironobu; Saita, Yusuke; Nomura, Takanori

    2016-07-10

    A Shack-Hartmann wavefront sensor (SHWFS) that consists of a microlens array and an image sensor has been used to measure the wavefront aberrations of human eyes. However, a conventional SHWFS has finite dynamic range depending on the diameter of the each microlens. The dynamic range cannot be easily expanded without a decrease of the spatial resolution. In this study, an adaptive spot search method to expand the dynamic range of an SHWFS is proposed. In the proposed method, spots are searched with the help of their approximate displacements measured with low spatial resolution and large dynamic range. By the proposed method, a wavefront can be correctly measured even if the spot is beyond the detection area. The adaptive spot search method is realized by using the special microlens array that generates both spots and discriminable patterns. The proposed method enables expanding the dynamic range of an SHWFS with a single shot and short processing time. The performance of the proposed method is compared with that of a conventional SHWFS by optical experiments. Furthermore, the dynamic range of the proposed method is quantitatively evaluated by numerical simulations.

  4. Adapt

    NASA Astrophysics Data System (ADS)

    Bargatze, L. F.

    2015-12-01

    Active Data Archive Product Tracking (ADAPT) is a collection of software routines that permits one to generate XML metadata files to describe and register data products in support of the NASA Heliophysics Virtual Observatory VxO effort. ADAPT is also a philosophy. The ADAPT concept is to use any and all available metadata associated with scientific data to produce XML metadata descriptions in a consistent, uniform, and organized fashion to provide blanket access to the full complement of data stored on a targeted data server. In this poster, we present an application of ADAPT to describe all of the data products that are stored by using the Common Data File (CDF) format served out by the CDAWEB and SPDF data servers hosted at the NASA Goddard Space Flight Center. These data servers are the primary repositories for NASA Heliophysics data. For this purpose, the ADAPT routines have been used to generate data resource descriptions by using an XML schema named Space Physics Archive, Search, and Extract (SPASE). SPASE is the designated standard for documenting Heliophysics data products, as adopted by the Heliophysics Data and Model Consortium. The set of SPASE XML resource descriptions produced by ADAPT includes high-level descriptions of numerical data products, display data products, or catalogs and also includes low-level "Granule" descriptions. A SPASE Granule is effectively a universal access metadata resource; a Granule associates an individual data file (e.g. a CDF file) with a "parent" high-level data resource description, assigns a resource identifier to the file, and lists the corresponding assess URL(s). The CDAWEB and SPDF file systems were queried to provide the input required by the ADAPT software to create an initial set of SPASE metadata resource descriptions. Then, the CDAWEB and SPDF data repositories were queried subsequently on a nightly basis and the CDF file lists were checked for any changes such as the occurrence of new, modified, or deleted

  5. An adaptive immune optimization algorithm with dynamic lattice searching operation for fast optimization of atomic clusters

    NASA Astrophysics Data System (ADS)

    Wu, Xia; Wu, Genhua

    2014-08-01

    Geometrical optimization of atomic clusters is performed by a development of adaptive immune optimization algorithm (AIOA) with dynamic lattice searching (DLS) operation (AIOA-DLS method). By a cycle of construction and searching of the dynamic lattice (DL), DLS algorithm rapidly makes the clusters more regular and greatly reduces the potential energy. DLS can thus be used as an operation acting on the new individuals after mutation operation in AIOA to improve the performance of the AIOA. The AIOA-DLS method combines the merit of evolutionary algorithm and idea of dynamic lattice. The performance of the proposed method is investigated in the optimization of Lennard-Jones clusters within 250 atoms and silver clusters described by many-body Gupta potential within 150 atoms. Results reported in the literature are reproduced, and the motif of Ag61 cluster is found to be stacking-fault face-centered cubic, whose energy is lower than that of previously obtained icosahedron.

  6. qPR: An adaptive partial-report procedure based on Bayesian inference

    PubMed Central

    Baek, Jongsoo; Lesmes, Luis Andres; Lu, Zhong-Lin

    2016-01-01

    Iconic memory is best assessed with the partial report procedure in which an array of letters appears briefly on the screen and a poststimulus cue directs the observer to report the identity of the cued letter(s). Typically, 6–8 cue delays or 600–800 trials are tested to measure the iconic memory decay function. Here we develop a quick partial report, or qPR, procedure based on a Bayesian adaptive framework to estimate the iconic memory decay function with much reduced testing time. The iconic memory decay function is characterized by an exponential function and a joint probability distribution of its three parameters. Starting with a prior of the parameters, the method selects the stimulus to maximize the expected information gain in the next test trial. It then updates the posterior probability distribution of the parameters based on the observer's response using Bayesian inference. The procedure is reiterated until either the total number of trials or the precision of the parameter estimates reaches a certain criterion. Simulation studies showed that only 100 trials were necessary to reach an average absolute bias of 0.026 and a precision of 0.070 (both in terms of probability correct). A psychophysical validation experiment showed that estimates of the iconic memory decay function obtained with 100 qPR trials exhibited good precision (the half width of the 68.2% credible interval = 0.055) and excellent agreement with those obtained with 1,600 trials of the conventional method of constant stimuli procedure (RMSE = 0.063). Quick partial-report relieves the data collection burden in characterizing iconic memory and makes it possible to assess iconic memory in clinical populations. PMID:27580045

  7. An adaptive knowledge-driven medical image search engine for interactive diffuse parenchymal lung disease quantification

    NASA Astrophysics Data System (ADS)

    Tao, Yimo; Zhou, Xiang Sean; Bi, Jinbo; Jerebkoa, Anna; Wolf, Matthias; Salganicoff, Marcos; Krishnana, Arun

    2009-02-01

    Characterization and quantification of the severity of diffuse parenchymal lung diseases (DPLDs) using Computed Tomography (CT) is an important issue in clinical research. Recently, several classification-based computer-aided diagnosis (CAD) systems [1-3] for DPLD have been proposed. For some of those systems, a degradation of performance [2] was reported on unseen data because of considerable inter-patient variances of parenchymal tissue patterns. We believe that a CAD system of real clinical value should be robust to inter-patient variances and be able to classify unseen cases online more effectively. In this work, we have developed a novel adaptive knowledge-driven CT image search engine that combines offline learning aspects of classification-based CAD systems with online learning aspects of content-based image retrieval (CBIR) systems. Our system can seamlessly and adaptively fuse offline accumulated knowledge with online feedback, leading to an improved online performance in detecting DPLD in both accuracy and speed aspects. Our contribution lies in: (1) newly developed 3D texture-based and morphology-based features; (2) a multi-class offline feature selection method; and, (3) a novel image search engine framework for detecting DPLD. Very promising results have been obtained on a small test set.

  8. Adaptive Lévy Processes and Area-Restricted Search in Human Foraging

    PubMed Central

    Hills, Thomas T.; Kalff, Christopher; Wiener, Jan M.

    2013-01-01

    A considerable amount of research has claimed that animals’ foraging behaviors display movement lengths with power-law distributed tails, characteristic of Lévy flights and Lévy walks. Though these claims have recently come into question, the proposal that many animals forage using Lévy processes nonetheless remains. A Lévy process does not consider when or where resources are encountered, and samples movement lengths independently of past experience. However, Lévy processes too have come into question based on the observation that in patchy resource environments resource-sensitive foraging strategies, like area-restricted search, perform better than Lévy flights yet can still generate heavy-tailed distributions of movement lengths. To investigate these questions further, we tracked humans as they searched for hidden resources in an open-field virtual environment, with either patchy or dispersed resource distributions. Supporting previous research, for both conditions logarithmic binning methods were consistent with Lévy flights and rank-frequency methods–comparing alternative distributions using maximum likelihood methods–showed the strongest support for bounded power-law distributions (truncated Lévy flights). However, goodness-of-fit tests found that even bounded power-law distributions only accurately characterized movement behavior for 4 (out of 32) participants. Moreover, paths in the patchy environment (but not the dispersed environment) showed a transition to intensive search following resource encounters, characteristic of area-restricted search. Transferring paths between environments revealed that paths generated in the patchy environment were adapted to that environment. Our results suggest that though power-law distributions do not accurately reflect human search, Lévy processes may still describe movement in dispersed environments, but not in patchy environments–where search was area-restricted. Furthermore, our results indicate that

  9. Individual Differences and Test Administration Procedures: A Comparison of Fixed-Item, Computerized-Adaptive, and Self-Adapted Testing.

    ERIC Educational Resources Information Center

    Vispoel, Walter P.; And Others

    1994-01-01

    Vocabulary fixed-item (FIT), computerized-adaptive (CAT), and self-adapted (SAT) tests were compared with 121 college students. CAT was more precise and efficient than SAT, which was more precise and efficient than FIT. SAT also yielded higher ability estimates for individuals with lower verbal self-concepts. (SLD)

  10. Procedures for Computing Transonic Flows for Control of Adaptive Wind Tunnels. Ph.D. Thesis - Technische Univ., Berlin, Mar. 1986

    NASA Technical Reports Server (NTRS)

    Rebstock, Rainer

    1987-01-01

    Numerical methods are developed for control of three dimensional adaptive test sections. The physical properties of the design problem occurring in the external field computation are analyzed, and a design procedure suited for solution of the problem is worked out. To do this, the desired wall shape is determined by stepwise modification of an initial contour. The necessary changes in geometry are determined with the aid of a panel procedure, or, with incident flow near the sonic range, with a transonic small perturbation (TSP) procedure. The designed wall shape, together with the wall deflections set during the tunnel run, are the input to a newly derived one-step formula which immediately yields the adapted wall contour. This is particularly important since the classical iterative adaptation scheme is shown to converge poorly for 3D flows. Experimental results obtained in the adaptive test section with eight flexible walls are presented to demonstrate the potential of the procedure. Finally, a method is described to minimize wall interference in 3D flows by adapting only the top and bottom wind tunnel walls.

  11. An Adaptive Landscape Classification Procedure using Geoinformatics and Artificial Neural Networks

    SciTech Connect

    Coleman, Andre Michael

    2008-06-01

    The Adaptive Landscape Classification Procedure (ALCP), which links the advanced geospatial analysis capabilities of Geographic Information Systems (GISs) and Artificial Neural Networks (ANNs) and particularly Self-Organizing Maps (SOMs), is proposed as a method for establishing and reducing complex data relationships. Its adaptive and evolutionary capability is evaluated for situations where varying types of data can be combined to address different prediction and/or management needs such as hydrologic response, water quality, aquatic habitat, groundwater recharge, land use, instrumentation placement, and forecast scenarios. The research presented here documents and presents favorable results of a procedure that aims to be a powerful and flexible spatial data classifier that fuses the strengths of geoinformatics and the intelligence of SOMs to provide data patterns and spatial information for environmental managers and researchers. This research shows how evaluation and analysis of spatial and/or temporal patterns in the landscape can provide insight into complex ecological, hydrological, climatic, and other natural and anthropogenic-influenced processes. Certainly, environmental management and research within heterogeneous watersheds provide challenges for consistent evaluation and understanding of system functions. For instance, watersheds over a range of scales are likely to exhibit varying levels of diversity in their characteristics of climate, hydrology, physiography, ecology, and anthropogenic influence. Furthermore, it has become evident that understanding and analyzing these diverse systems can be difficult not only because of varying natural characteristics, but also because of the availability, quality, and variability of spatial and temporal data. Developments in geospatial technologies, however, are providing a wide range of relevant data, and in many cases, at a high temporal and spatial resolution. Such data resources can take the form of high

  12. Adaptive correction procedure for TVL1 image deblurring under impulse noise

    NASA Astrophysics Data System (ADS)

    Bai, Minru; Zhang, Xiongjun; Shao, Qianqian

    2016-08-01

    For the problem of image restoration of observed images corrupted by blur and impulse noise, the widely used TVL1 model may deviate from both the data-acquisition model and the prior model, especially for high noise levels. In order to seek a solution of high recovery quality beyond the reach of the TVL1 model, we propose an adaptive correction procedure for TVL1 image deblurring under impulse noise. Then, a proximal alternating direction method of multipliers (ADMM) is presented to solve the corrected TVL1 model and its convergence is also established under very mild conditions. It is verified by numerical experiments that our proposed approach outperforms the TVL1 model in terms of signal-to-noise ratio (SNR) values and visual quality, especially for high noise levels: it can handle salt-and-pepper noise as high as 90% and random-valued noise as high as 70%. In addition, a comparison with a state-of-the-art method, the two-phase method, demonstrates the superiority of the proposed approach.

  13. Adaptive polarimetric sensing for optimum radar signature classification using a genetic search algorithm.

    PubMed

    Sadjadi, Firooz A

    2006-08-01

    An automated technique for adaptive radar polarimetric pattern classification is described. The approach is based on a genetic algorithm that uses a probabilistic pattern separation distance function and searches for those transmit and receive states of polarization sensing angles that optimize this function. Seven pattern separation distance functions--the Rayleigh quotient, the Bhattacharyya, divergence, Kolmogorov, Matusta, Kullback-Leibler distances, and the Bayesian probability of error--are used on real, fully polarimetric synthetic aperture radar target signatures. Each of these signatures is represented as functions of transmit and receive polarization ellipticity angles and the angle of polarization ellipse. The results indicate that, based on the majority of the distance functions used, there is a unique set of state of polarization angles whose use will lead to improved classification performance.

  14. Effects of Estimation Bias on Multiple-Category Classification with an IRT-Based Adaptive Classification Procedure

    ERIC Educational Resources Information Center

    Yang, Xiangdong; Poggio, John C.; Glasnapp, Douglas R.

    2006-01-01

    The effects of five ability estimators, that is, maximum likelihood estimator, weighted likelihood estimator, maximum a posteriori, expected a posteriori, and Owen's sequential estimator, on the performances of the item response theory-based adaptive classification procedure on multiple categories were studied via simulations. The following…

  15. A procedure of multiple period searching in unequally spaced time-series with the Lomb-Scargle method

    NASA Technical Reports Server (NTRS)

    Van Dongen, H. P.; Olofsen, E.; VanHartevelt, J. H.; Kruyt, E. W.; Dinges, D. F. (Principal Investigator)

    1999-01-01

    Periodogram analysis of unequally spaced time-series, as part of many biological rhythm investigations, is complicated. The mathematical framework is scattered over the literature, and the interpretation of results is often debatable. In this paper, we show that the Lomb-Scargle method is the appropriate tool for periodogram analysis of unequally spaced data. A unique procedure of multiple period searching is derived, facilitating the assessment of the various rhythms that may be present in a time-series. All relevant mathematical and statistical aspects are considered in detail, and much attention is given to the correct interpretation of results. The use of the procedure is illustrated by examples, and problems that may be encountered are discussed. It is argued that, when following the procedure of multiple period searching, we can even benefit from the unequal spacing of a time-series in biological rhythm research.

  16. Incorporating Deeply Uncertain Factors into the Many Objective Search Process: Improving Adaptation to Environmental Change

    NASA Astrophysics Data System (ADS)

    Kasprzyk, J. R.; Watson, A. A.

    2014-12-01

    Deep uncertainty refers to situations in which decision makers or stakeholders do not know, or cannot fully agree upon, the full suite of risk factors within a planning problem. This phenomenon is especially important when considering scenarios of future environmental change, since there exist multiple trajectories of environmental forcings (e.g., streamflow timing and magnitude) and socioeconomic factors (e.g., population growth). This presentation first briefly reviews robust optimization and scenario approaches that have been proposed to plan for systems under deep uncertainty. One recently introduced framework is Many Objective Robust Decision Making (MORDM). MORDM combines two techniques: evolutionary algorithm search is used to generate planning alternatives, and robust decision making methods are used to sample performance over a large range of plausible factors and, subsequently, choose a robust solution. Within MORDM, Pareto approximate tradeoff sets of solutions are used to balance objectives and examine alternatives. However, MORDM does not currently incorporate the deeply uncertain scenario information into the search process itself. In this presentation, we suggest several avenues for doing so, that are focused on modifying the suite of uncertain data that is selected within the search process. Visualizations that compare tradeoff sets across different sets of assumptions can be used to guide decision makers' learning and, ultimately, their selection of several candidate solutions for further planning. For example, the baseline assumptions about probability distributions can be compared to optimization results under severe events to determine adaptive management strategies. A case study of water planning in the Lower Rio Grande Valley (LRGV) in Texas is used to demonstrate the approach. Our LRGV results compare baseline optimization with new solution sets that examine optimal management strategies under scenarios characterized by lower than average

  17. Unique search and track procedures utilizing the Ground-based Electro-Optical Deep Space Surveillance (GEODSS) worldwide sites

    NASA Astrophysics Data System (ADS)

    Burgio, E.; Grant, K.

    2011-09-01

    The GEODSS Vela Search Team developed revolutionary, new procedures for searching for man-made objects in deep space. The procedures were designed to find the Vela communication satellites launched in the 1960s. The satellites were in very high and eccentric orbits and had not been tracked in over 40 years. The approach used the sun to provide illumination along with modifying optical parameters. The GEODSS team has found 6 lost Vela satellites and enhanced the Air Force Space Command satellite catalog. This Vela Search Team worked with the Air Force to aggressively launch a first-ever proactive campaign against a series of lost satellites using our three GEODSS optical detachments. Two new tactics, techniques & procedures were successfully used to capture very hard to track objects. The revisit time was increased from intermittent and yearly tracking to weeks or better for 3 Vela’s lost for over four decades. Lessons learned were established for Vela & other orbit types. The Joint Space Operations Center (JSPOC) analysts stated that the Vela search and tracking was a great success. Additionally, a GEODSS Space Shuttle Track Team was the first to use a deep space observing telescope to observe the space shuttle flying at low altitude. The Team developed a procedure using modified optical viewing parameters and new search techniques using the GEODSS telescope in a mission it was not designed to perform. The team was able to observe the space shuttle 14 times over two nights. The ability to observe and then successfully repeat the process was an astronomical achievement. The GEODSS team accomplishment contributed to shuttle safety and mission success.

  18. Job-Search Strategies and Reemployment Quality: The Impact of Career Adaptability

    ERIC Educational Resources Information Center

    Koen, Jessie; Klehe, Ute-Christine; Van Vianen, Annelies E. M.; Zikic, Jelena; Nauta, Aukje

    2010-01-01

    Past job-search research has focused on how hard unemployed people search for a job, but we still know little about the strategies that people use during their search and how we can predict the quality of the reemployment found. The first aim of this study was to predict the use of different job-search strategies via job-seekers' career…

  19. Adaptive kernel independent component analysis and UV spectrometry applied to characterize the procedure for processing prepared rhubarb roots.

    PubMed

    Wang, Guoqing; Hou, Zhenyu; Peng, Yang; Wang, Yanjun; Sun, Xiaoli; Sun, Yu-an

    2011-11-01

    By determination of the number of absorptive chemical components (ACCs) in mixtures using median absolute deviation (MAD) analysis and extraction of spectral profiles of ACCs using kernel independent component analysis (KICA), an adaptive KICA (AKICA) algorithm was proposed. The proposed AKICA algorithm was used to characterize the procedure for processing prepared rhubarb roots by resolution of the measured mixed raw UV spectra of the rhubarb samples that were collected at different steaming intervals. The results show that the spectral features of ACCs in the mixtures can be directly estimated without chemical and physical pre-separation and other prior information. The estimated three independent components (ICs) represent different chemical components in the mixtures, which are mainly polysaccharides (IC1), tannin (IC2), and anthraquinone glycosides (IC3). The variations of the relative concentrations of the ICs can account for the chemical and physical changes during the processing procedure: IC1 increases significantly before the first 5 h, and is nearly invariant after 6 h; IC2 has no significant changes or is slightly decreased during the processing procedure; IC3 decreases significantly before the first 5 h and decreases slightly after 6 h. The changes of IC1 can explain why the colour became black and darkened during the processing procedure, and the changes of IC3 can explain why the processing procedure can reduce the bitter and dry taste of the rhubarb roots. The endpoint of the processing procedure can be determined as 5-6 h, when the increasing or decreasing trends of the estimated ICs are insignificant. The AKICA-UV method provides an alternative approach for the characterization of the processing procedure of rhubarb roots preparation, and provides a novel way for determination of the endpoint of the traditional Chinese medicine (TCM) processing procedure by inspection of the change trends of the ICs.

  20. Autofocus using adaptive prediction approximation combined search for the fluorescence microscope in second-generation DNA sequencing system.

    PubMed

    Xu, Hancong; Liu, Jinfeng; Li, Yang; Yin, Yan; Zhu, Chenxu; Lu, Hua

    2014-07-10

    Autofocus is an important technique for high-speed image acquisition in the second-generation DNA sequencing system, and this paper studies the passive focus algorithm for the system, which consists of two parts: focus measurement (FM) and focus search (FS). Based on the properties of DNA chips' images, we choose the normalized variance as the FM algorithm and develop a new robust FS named adaptive prediction approximation combined search (APACS). APACS utilizes golden section search (GSS) to approximate the focus position and engages the curve-fitting search (CFS) to predict the position simultaneously in every step of GSS. When the difference between consecutive predictions meets the set precision, the search finishes. Otherwise, it ends as GSS. In APACS, we also propose an estimation method, named the combination of centroid estimation and overdetermined equations estimation by least squares solution, to calculate the initial vector for the nonlinear equations in APACS prediction, which reduces the iterations and accelerates the search. The simulation and measured results demonstrate that APACS not only maintains the stability but also reduces the focus time compared with GSS and CFS, which indicates APACS is a robust and fast FS for the fluorescence microscope in a sequencing system.

  1. A Minimax Sequential Procedure in the Context of Computerized Adaptive Mastery Testing.

    ERIC Educational Resources Information Center

    Vos, Hans J.

    The purpose of this paper is to derive optimal rules for variable-length mastery tests in case three mastery classification decisions (nonmastery, partial mastery, and mastery) are distinguished. In a variable-length or adaptive mastery test, the decision is to classify a subject as a master, a partial master, a nonmaster, or continuing sampling…

  2. Two-stage sequential sampling: A neighborhood-free adaptive sampling procedure

    USGS Publications Warehouse

    Salehi, M.; Smith, D.R.

    2005-01-01

    Designing an efficient sampling scheme for a rare and clustered population is a challenging area of research. Adaptive cluster sampling, which has been shown to be viable for such a population, is based on sampling a neighborhood of units around a unit that meets a specified condition. However, the edge units produced by sampling neighborhoods have proven to limit the efficiency and applicability of adaptive cluster sampling. We propose a sampling design that is adaptive in the sense that the final sample depends on observed values, but it avoids the use of neighborhoods and the sampling of edge units. Unbiased estimators of population total and its variance are derived using Murthy's estimator. The modified two-stage sampling design is easy to implement and can be applied to a wider range of populations than adaptive cluster sampling. We evaluate the proposed sampling design by simulating sampling of two real biological populations and an artificial population for which the variable of interest took the value either 0 or 1 (e.g., indicating presence and absence of a rare event). We show that the proposed sampling design is more efficient than conventional sampling in nearly all cases. The approach used to derive estimators (Murthy's estimator) opens the door for unbiased estimators to be found for similar sequential sampling designs. ?? 2005 American Statistical Association and the International Biometric Society.

  3. Multidisciplinary Procedures for Designing Housing Adaptations for People with Mobility Disabilities.

    PubMed

    Sukkay, Sasicha

    2016-01-01

    Based on a 2013 statistic published by Thai with Disability foundation, five percent of Thailand's population are disabled people. Six hundred thousand of them have mobility disability, and the number is increasing every year. To support them, the Thai government has implemented a number of disability laws and policies. One of the policies is to better disabled people's quality of life by adapting their houses to facilitate their activities. However, the policy has not been fully realized yet-there is still no specific guideline for housing adaptation for people with disabilities. This study is an attempt to address the lack of standardized criteria for such adaptation by developing a number of effective ones. Our development had 3 objectives: first, to identify the body functioning of a group of people with mobility disability according to the international classification functioning concept (ICF); second, to perform post-occupancy evaluation of this group and their houses; and third, with the collected data, to have a group of multidisciplinary experts cooperatively develop criteria for housing adaptation. The major findings were that room dimensions and furniture materials really had an impact on accessibility and toilet as well as bed room were the most difficult areas to access. PMID:27534326

  4. Unique Search and Track Procedures Utilizing the Ground-based Electro-Optical Deep Space Surveillance (GEODSS) Worldwide Sites

    NASA Astrophysics Data System (ADS)

    Bruck, R.; Peppard, T.

    2012-09-01

    The GEODSS Vela Search Team, in conjunction with the Air Force, developed revolutionary new procedures to search for man-made objects in deep space. In the first-ever aggressive, proactive campaign against a series of lost satellites, three GEODSS optical detachments were employed to find Vela communication satellites launched in the 1960s. These satellites, in highly eccentric orbits, had not been tracked in over 40 years. The Team exploited GEODSS telescopes and technology for a mission they were not designed to perform by employing modified optical viewing parameters and new search techniques. Using the sun to provide illumination, while modifying optical parameters, the GEODSS team found 5 lost Vela satellites and enhanced the Air Force Space Command satellite catalog. In addition, the Team developed two new tactics, techniques & procedures to capture very hard-to-track objects. Revisit time was increased from intermittent and yearly tracking to weeks or better to find 3 Velas lost for over four decades. The Joint Space Operations Center (JSPOC) analysts stated that the Vela search and tracking was a great success. Additionally, a GEODSS Tactics Development Team was the first to use a deep space observing telescope to track satellites in near earth orbits and outside of the traditional observing period. The team was able to observe and provide metric track data on the International Space Station, Hubble Space Telescope and several other satellites in Near Earth Orbits. Additionally, data was collected before the civil sunset observing period on the Phobos-Grunt re-entry and an Iridium Communications Satellite in Low Earth Orbit. The ability to observe and then successfully repeat the process was an astronomical achievement. The GEODSS team accomplishments pushed the boundaries of the GEODSS system design and proved existing capabilities that had not yet been considered. Lessons learned were established for Vela & other orbit types.

  5. Dissociating proportion congruent and conflict adaptation effects in a Simon-Stroop procedure.

    PubMed

    Torres-Quesada, Maryem; Funes, Maria Jesús; Lupiáñez, Juan

    2013-02-01

    Proportion congruent and conflict adaptation are two well known effects associated with cognitive control. A critical open question is whether they reflect the same or separate cognitive control mechanisms. In this experiment, in a training phase we introduced a proportion congruency manipulation for one conflict type (i.e. Simon), whereas in pre-training and post-training phases two conflict types (e.g. Simon and Spatial Stroop) were displayed with the same incongruent-to-congruent ratio. The results supported the sustained nature of the proportion congruent effect, as it transferred from the training to the post-training phase. Furthermore, this transfer generalized to both conflict types. By contrast, the conflict adaptation effect was specific to conflict type, as it was only observed when the same conflict type (either Simon or Stroop) was presented on two consecutive trials (no effect was observed on conflict type alternation trials). Results are interpreted as supporting the reactive and proactive control mechanisms distinction.

  6. Detecting DIF for Polytomously Scored Items: An Adaptation of the SIBTEST Procedure. Research Report.

    ERIC Educational Resources Information Center

    Chang, Hua-Hua; And Others

    Recently, R. Shealy and W. Stout (1993) proposed a procedure for detecting differential item functioning (DIF) called SIBTEST. Current versions of SIBTEST can only be used for dichotomously scored items, but this paper presents an extension to handle polytomous items. The paper presents: (1) a discussion of an appropriate definition of DIF for…

  7. Bayesian Procedures for Identifying Aberrant Response-Time Patterns in Adaptive Testing

    ERIC Educational Resources Information Center

    van der Linden, Wim J.; Guo, Fanmin

    2008-01-01

    In order to identify aberrant response-time patterns on educational and psychological tests, it is important to be able to separate the speed at which the test taker operates from the time the items require. A lognormal model for response times with this feature was used to derive a Bayesian procedure for detecting aberrant response times.…

  8. EEG-Based BCI System Using Adaptive Features Extraction and Classification Procedures

    PubMed Central

    Mangia, Anna Lisa; Cappello, Angelo

    2016-01-01

    Motor imagery is a common control strategy in EEG-based brain-computer interfaces (BCIs). However, voluntary control of sensorimotor (SMR) rhythms by imagining a movement can be skilful and unintuitive and usually requires a varying amount of user training. To boost the training process, a whole class of BCI systems have been proposed, providing feedback as early as possible while continuously adapting the underlying classifier model. The present work describes a cue-paced, EEG-based BCI system using motor imagery that falls within the category of the previously mentioned ones. Specifically, our adaptive strategy includes a simple scheme based on a common spatial pattern (CSP) method and support vector machine (SVM) classification. The system's efficacy was proved by online testing on 10 healthy participants. In addition, we suggest some features we implemented to improve a system's “flexibility” and “customizability,” namely, (i) a flexible training session, (ii) an unbalancing in the training conditions, and (iii) the use of adaptive thresholds when giving feedback.

  9. EEG-Based BCI System Using Adaptive Features Extraction and Classification Procedures

    PubMed Central

    Mangia, Anna Lisa; Cappello, Angelo

    2016-01-01

    Motor imagery is a common control strategy in EEG-based brain-computer interfaces (BCIs). However, voluntary control of sensorimotor (SMR) rhythms by imagining a movement can be skilful and unintuitive and usually requires a varying amount of user training. To boost the training process, a whole class of BCI systems have been proposed, providing feedback as early as possible while continuously adapting the underlying classifier model. The present work describes a cue-paced, EEG-based BCI system using motor imagery that falls within the category of the previously mentioned ones. Specifically, our adaptive strategy includes a simple scheme based on a common spatial pattern (CSP) method and support vector machine (SVM) classification. The system's efficacy was proved by online testing on 10 healthy participants. In addition, we suggest some features we implemented to improve a system's “flexibility” and “customizability,” namely, (i) a flexible training session, (ii) an unbalancing in the training conditions, and (iii) the use of adaptive thresholds when giving feedback. PMID:27635129

  10. EEG-Based BCI System Using Adaptive Features Extraction and Classification Procedures.

    PubMed

    Mondini, Valeria; Mangia, Anna Lisa; Cappello, Angelo

    2016-01-01

    Motor imagery is a common control strategy in EEG-based brain-computer interfaces (BCIs). However, voluntary control of sensorimotor (SMR) rhythms by imagining a movement can be skilful and unintuitive and usually requires a varying amount of user training. To boost the training process, a whole class of BCI systems have been proposed, providing feedback as early as possible while continuously adapting the underlying classifier model. The present work describes a cue-paced, EEG-based BCI system using motor imagery that falls within the category of the previously mentioned ones. Specifically, our adaptive strategy includes a simple scheme based on a common spatial pattern (CSP) method and support vector machine (SVM) classification. The system's efficacy was proved by online testing on 10 healthy participants. In addition, we suggest some features we implemented to improve a system's "flexibility" and "customizability," namely, (i) a flexible training session, (ii) an unbalancing in the training conditions, and (iii) the use of adaptive thresholds when giving feedback.

  11. EEG-Based BCI System Using Adaptive Features Extraction and Classification Procedures.

    PubMed

    Mondini, Valeria; Mangia, Anna Lisa; Cappello, Angelo

    2016-01-01

    Motor imagery is a common control strategy in EEG-based brain-computer interfaces (BCIs). However, voluntary control of sensorimotor (SMR) rhythms by imagining a movement can be skilful and unintuitive and usually requires a varying amount of user training. To boost the training process, a whole class of BCI systems have been proposed, providing feedback as early as possible while continuously adapting the underlying classifier model. The present work describes a cue-paced, EEG-based BCI system using motor imagery that falls within the category of the previously mentioned ones. Specifically, our adaptive strategy includes a simple scheme based on a common spatial pattern (CSP) method and support vector machine (SVM) classification. The system's efficacy was proved by online testing on 10 healthy participants. In addition, we suggest some features we implemented to improve a system's "flexibility" and "customizability," namely, (i) a flexible training session, (ii) an unbalancing in the training conditions, and (iii) the use of adaptive thresholds when giving feedback. PMID:27635129

  12. Steady inviscid transonic flows over planar airfoils: A search for a simplified procedure

    NASA Technical Reports Server (NTRS)

    Magnus, R.; Yoshihara, H.

    1973-01-01

    A finite difference procedure based upon a system of unsteady equations in proper conservation form with either exact or small disturbance steady terms is used to calculate the steady flows over several classes of airfoils. The airfoil condition is fulfilled on a slab whose upstream extremity is a semi-circle overlaying the airfoil leading edge circle. The limitations of the small disturbance equations are demonstrated in an extreme example of a blunt-nosed, aft-cambered airfoil. The necessity of using the equations in proper conservation form to capture the shock properly is stressed. Ability of the steady relaxation procedures to capture the shock is briefly examined.

  13. Adaptation of Decoy Fusion Strategy for Existing Multi-Stage Search Workflows.

    PubMed

    Ivanov, Mark V; Levitsky, Lev I; Gorshkov, Mikhail V

    2016-09-01

    A number of proteomic database search engines implement multi-stage strategies aiming at increasing the sensitivity of proteome analysis. These approaches often employ a subset of the original database for the secondary stage of analysis. However, if target-decoy approach (TDA) is used for false discovery rate (FDR) estimation, the multi-stage strategies may violate the underlying assumption of TDA that false matches are distributed uniformly across the target and decoy databases. This violation occurs if the numbers of target and decoy proteins selected for the second search are not equal. Here, we propose a method of decoy database generation based on the previously reported decoy fusion strategy. This method allows unbiased TDA-based FDR estimation in multi-stage searches and can be easily integrated into existing workflows utilizing popular search engines and post-search algorithms. Graphical Abstract ᅟ. PMID:27349255

  14. Adaptation of Decoy Fusion Strategy for Existing Multi-Stage Search Workflows

    NASA Astrophysics Data System (ADS)

    Ivanov, Mark V.; Levitsky, Lev I.; Gorshkov, Mikhail V.

    2016-09-01

    A number of proteomic database search engines implement multi-stage strategies aiming at increasing the sensitivity of proteome analysis. These approaches often employ a subset of the original database for the secondary stage of analysis. However, if target-decoy approach (TDA) is used for false discovery rate (FDR) estimation, the multi-stage strategies may violate the underlying assumption of TDA that false matches are distributed uniformly across the target and decoy databases. This violation occurs if the numbers of target and decoy proteins selected for the second search are not equal. Here, we propose a method of decoy database generation based on the previously reported decoy fusion strategy. This method allows unbiased TDA-based FDR estimation in multi-stage searches and can be easily integrated into existing workflows utilizing popular search engines and post-search algorithms.

  15. Adaptation of Decoy Fusion Strategy for Existing Multi-Stage Search Workflows.

    PubMed

    Ivanov, Mark V; Levitsky, Lev I; Gorshkov, Mikhail V

    2016-09-01

    A number of proteomic database search engines implement multi-stage strategies aiming at increasing the sensitivity of proteome analysis. These approaches often employ a subset of the original database for the secondary stage of analysis. However, if target-decoy approach (TDA) is used for false discovery rate (FDR) estimation, the multi-stage strategies may violate the underlying assumption of TDA that false matches are distributed uniformly across the target and decoy databases. This violation occurs if the numbers of target and decoy proteins selected for the second search are not equal. Here, we propose a method of decoy database generation based on the previously reported decoy fusion strategy. This method allows unbiased TDA-based FDR estimation in multi-stage searches and can be easily integrated into existing workflows utilizing popular search engines and post-search algorithms. Graphical Abstract ᅟ.

  16. Designing experimental setup and procedures for studying alpha-particle-induced adaptive response in zebrafish embryos in vivo

    NASA Astrophysics Data System (ADS)

    Choi, V. W. Y.; Lam, R. K. K.; Chong, E. Y. W.; Cheng, S. H.; Yu, K. N.

    2010-03-01

    The present work was devoted to designing the experimental setup and the associated procedures for alpha-particle-induced adaptive response in zebrafish embryos in vivo. Thin PADC films with a thickness of 16 μm were fabricated and employed as support substrates for holding dechorionated zebrafish embryos for alpha-particle irradiation from the bottom through the films. Embryos were collected within 15 min when the light photoperiod began, which were then incubated and dechorionated at 4 h post fertilization (hpf). They were then irradiated at 5 hpf by alpha particles using a planar 241Am source with an activity of 0.1151 μCi for 24 s (priming dose), and subsequently at 10 hpf using the same source for 240 s (challenging dose). The levels of apoptosis in irradiated zebrafish embryos at 24 hpf were quantified through staining with the vital dye acridine orange, followed by counting the stained cells under a florescent microscope. The results revealed the presence of the adaptive response in zebrafish embryos in vivo, and demonstrated the feasibility of the adopted experimental setup and procedures.

  17. Multilevel adaptive solution procedure for material nonlinear problems in visual programming environment

    SciTech Connect

    Kim, D.; Ghanem, R.

    1994-12-31

    Multigrid solution technique to solve a material nonlinear problem in a visual programming environment using the finite element method is discussed. The nonlinear equation of equilibrium is linearized to incremental form using Newton-Rapson technique, then multigrid solution technique is used to solve linear equations at each Newton-Rapson step. In the process, adaptive mesh refinement, which is based on the bisection of a pair of triangles, is used to form grid hierarchy for multigrid iteration. The solution process is implemented in a visual programming environment with distributed computing capability, which enables more intuitive understanding of solution process, and more effective use of resources.

  18. EEG/ERP adaptive noise canceller design with controlled search space (CSS) approach in cuckoo and other optimization algorithms.

    PubMed

    Ahirwal, M K; Kumar, Anil; Singh, G K

    2013-01-01

    This paper explores the migration of adaptive filtering with swarm intelligence/evolutionary techniques employed in the field of electroencephalogram/event-related potential noise cancellation or extraction. A new approach is proposed in the form of controlled search space to stabilize the randomness of swarm intelligence techniques especially for the EEG signal. Swarm-based algorithms such as Particles Swarm Optimization, Artificial Bee Colony, and Cuckoo Optimization Algorithm with their variants are implemented to design optimized adaptive noise canceler. The proposed controlled search space technique is tested on each of the swarm intelligence techniques and is found to be more accurate and powerful. Adaptive noise canceler with traditional algorithms such as least-mean-square, normalized least-mean-square, and recursive least-mean-square algorithms are also implemented to compare the results. ERP signals such as simulated visual evoked potential, real visual evoked potential, and real sensorimotor evoked potential are used, due to their physiological importance in various EEG studies. Average computational time and shape measures of evolutionary techniques are observed 8.21E-01 sec and 1.73E-01, respectively. Though, traditional algorithms take negligible time consumption, but are unable to offer good shape preservation of ERP, noticed as average computational time and shape measure difference, 1.41E-02 sec and 2.60E+00, respectively.

  19. Never Use the Complete Search Space: a Concept to Enhance the Optimization Procedure for Monitoring Networks

    NASA Astrophysics Data System (ADS)

    Bode, F.; Reuschen, S.; Nowak, W.

    2015-12-01

    Drinking-water well catchments include many potential sources of contaminations like gas stations or agriculture. Finding optimal positions of early-warning monitoring wells is challenging because there are various parameters (and their uncertainties) that influence the reliability and optimality of any suggested monitoring location or monitoring network.The overall goal of this project is to develop and establish a concept to assess, design and optimize early-warning systems within well catchments. Such optimal monitoring networks need to optimize three competing objectives: a high detection probability, which can be reached by maximizing the "field of vision" of the monitoring network, a long early-warning time such that there is enough time left to install counter measures after first detection, and the overall operating costs of the monitoring network, which should ideally be reduced to a minimum. The method is based on numerical simulation of flow and transport in heterogeneous porous media coupled with geostatistics and Monte-Carlo, scenario analyses for real data, respectively, wrapped up within the framework of formal multi-objective optimization using a genetic algorithm.In order to speed up the optimization process and to better explore the Pareto-front, we developed a concept that forces the algorithm to search only in regions of the search space where promising solutions can be expected. We are going to show how to define these regions beforehand, using knowledge of the optimization problem, but also how to define them independently of problem attributes. With that, our method can be used with and/or without detailed knowledge of the objective functions.In summary, our study helps to improve optimization results in less optimization time by meaningful restrictions of the search space. These restrictions can be done independently of the optimization problem, but also in a problem-specific manner.

  20. Flexible design of two-stage adaptive procedures for phase III clinical trials.

    PubMed

    Koyama, Tatsuki

    2007-07-01

    The recent popularity of two-stage adaptive designs has fueled a number of proposals for their use in phase III clinical trials. Many of these designs assign certain restrictive functional forms to the design elements of stage 2, such as sample size, critical value and conditional power functions. We propose a more flexible method of design without imposing any particular functional forms on these design elements. Our methodology permits specification of a design based on either conditional or unconditional characteristics, and allows accommodation of sample size limit. Furthermore, we show how to compute the P value, confidence interval and a reasonable point estimate for any design that can be placed under the proposed framework. PMID:17307399

  1. Adaptation of the Unterzaucher procedure for determination of oxygen-18 in organic substances

    SciTech Connect

    Santrock, J.; Hayes, J.M.

    1987-01-01

    A method for the preparation of carbon dioxide from complex organic material for oxygen isotopic analysis is described. A commercial elemental analyzer has been modified so that oxygen contained in the organic material is quantitatively converted to carbon dioxide by the Schuetze-Unterzaucher technique, chromatographically purified, and transferred to a sample container for subsequent analysis by isotope ratio mass spectrometry. The organic sample is pyrolyzed, and the products of pyrolysis are equilibrated with elemental carbon at 1060 /sup 0/C to produce CO, and the CO is oxidized to CO/sub 2/ by I/sub 2/O/sub 5/. The details of these processes are considered, and a quantitative model is developed to allow correction for contamination of the carbon dioxide oxygen pool by an oxygen blank, oxygen from previous samples (memory), an oxygen from iodine pentoxide. Procedures for determination of the parameters used in the mathematical correction and routine application of the model to isotopic analysis are outlined. At natural abundance, the standard deviation for determination of the fractional abundance of oxygen-18 in a sample of organic material is 2 x 10/sup -7/ (equivalent to 0.1%). The detection limit for /sup 18/O as a tracer in biological materials is better than 1 atom excess/10/sup 6/ atoms total O. Analyses of independently established standards show that results obtained by the mathematical correction procedure are accurate and allow determination of abundances of /sup 18/O in the sucrose standards prepared by Hardcastle and Friedman.

  2. A formal protocol test procedure for the Survivable Adaptable Fiber Optic Embedded Network (SAFENET)

    NASA Astrophysics Data System (ADS)

    High, Wayne

    1993-03-01

    This thesis focuses upon a new method for verifying the correct operation of a complex, high speed fiber optic communication network. These networks are of growing importance to the military because of their increased connectivity, survivability, and reconfigurability. With the introduction and increased dependence on sophisticated software and protocols, it is essential that their operation be correct. Because of the speed and complexity of fiber optic networks being designed today, they are becoming increasingly difficult to test. Previously, testing was accomplished by application of conformance test methods which had little connection with an implementation's specification. The major goal of conformance testing is to ensure that the implementation of a profile is consistent with its specification. Formal specification is needed to ensure that the implementation performs its intended operations while exhibiting desirable behaviors. The new conformance test method presented is based upon the System of Communicating Machine model which uses a formal protocol specification to generate a test sequence. The major contribution of this thesis is the application of the System of Communicating Machine model to formal profile specifications of the Survivable Adaptable Fiber Optic Embedded Network (SAFENET) standard which results in the derivation of test sequences for a SAFENET profile. The results applying this new method to SAFENET's OSI and Lightweight profiles are presented.

  3. PHYCAA+: an optimized, adaptive procedure for measuring and controlling physiological noise in BOLD fMRI.

    PubMed

    Churchill, Nathan W; Strother, Stephen C

    2013-11-15

    The presence of physiological noise in functional MRI can greatly limit the sensitivity and accuracy of BOLD signal measurements, and produce significant false positives. There are two main types of physiological confounds: (1) high-variance signal in non-neuronal tissues of the brain including vascular tracts, sinuses and ventricles, and (2) physiological noise components which extend into gray matter tissue. These physiological effects may also be partially coupled with stimuli (and thus the BOLD response). To address these issues, we have developed PHYCAA+, a significantly improved version of the PHYCAA algorithm (Churchill et al., 2011) that (1) down-weights the variance of voxels in probable non-neuronal tissue, and (2) identifies the multivariate physiological noise subspace in gray matter that is linked to non-neuronal tissue. This model estimates physiological noise directly from EPI data, without requiring external measures of heartbeat and respiration, or manual selection of physiological components. The PHYCAA+ model significantly improves the prediction accuracy and reproducibility of single-subject analyses, compared to PHYCAA and a number of commonly-used physiological correction algorithms. Individual subject denoising with PHYCAA+ is independently validated by showing that it consistently increased between-subject activation overlap, and minimized false-positive signal in non gray-matter loci. The results are demonstrated for both block and fast single-event task designs, applied to standard univariate and adaptive multivariate analysis models.

  4. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

    PubMed Central

    Hemmelmayr, Vera C.; Cordeau, Jean-François; Crainic, Teodor Gabriel

    2012-01-01

    In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP. PMID:23483764

  5. MO-A-16A-01: QA Procedures and Metrics: In Search of QA Usability

    SciTech Connect

    Sathiaseelan, V; Thomadsen, B

    2014-06-15

    Radiation therapy has undergone considerable changes in the past two decades with a surge of new technology and treatment delivery methods. The complexity of radiation therapy treatments has increased and there has been increased awareness and publicity about the associated risks. In response, there has been proliferation of guidelines for medical physicists to adopt to ensure that treatments are delivered safely. Task Group recommendations are copious, and clinical physicists' hours are longer, stretched to various degrees between site planning and management, IT support, physics QA, and treatment planning responsibilities.Radiation oncology has many quality control practices in place to ensure the delivery of high-quality, safe treatments. Incident reporting systems have been developed to collect statistics about near miss events at many radiation oncology centers. However, tools are lacking to assess the impact of these various control measures. A recent effort to address this shortcoming is the work of Ford et al (2012) who recently published a methodology enumerating quality control quantification for measuring the effectiveness of safety barriers. Over 4000 near-miss incidents reported from 2 academic radiation oncology clinics were analyzed using quality control quantification, and a profile of the most effective quality control measures (metrics) was identified.There is a critical need to identify a QA metric to help the busy clinical physicists to focus their limited time and resources most effectively in order to minimize or eliminate errors in the radiation treatment delivery processes. In this symposium the usefulness of workflows and QA metrics to assure safe and high quality patient care will be explored.Two presentations will be given:Quality Metrics and Risk Management with High Risk Radiation Oncology ProceduresStrategies and metrics for quality management in the TG-100 Era Learning Objectives: Provide an overview and the need for QA usability

  6. Visual acuity trade-offs and microhabitat-driven adaptation of searching behaviour in psyllids (Hemiptera: Psylloidea: Aphalaridae).

    PubMed

    Farnier, Kevin; Dyer, Adrian G; Taylor, Gary S; Peters, Richard A; Steinbauer, Martin J

    2015-05-15

    Insects have evolved morphological and physiological adaptations in response to selection pressures inherent to their ecology. Consequently, visual performance and acuity often significantly vary between different insect species. Whilst psychophysics has allowed for the accurate determination of visual acuity for some Lepidoptera and Hymenoptera, very little is known about other insect taxa that cannot be trained to positively respond to a given stimulus. In this study, we demonstrate that prior knowledge of insect colour preferences can be used to facilitate acuity testing. We focused on four psyllid species (Hemiptera: Psylloidea: Aphalaridae), namely Ctenarytaina eucalypti, Ctenarytaina bipartita, Anoeconeossa bundoorensis and Glycaspis brimblecombei, that differ in their colour preferences and utilization of different host-plant modules (e.g. apical buds, stems, leaf lamellae) and tested their visual acuity in a modified Y-maze adapted to suit psyllid searching behaviour. Our study revealed that psyllids have visual acuity ranging from 6.3 to 8.7 deg. Morphological measurements for different species showed a close match between inter-ommatidial angles and behaviourally determined visual angles (between 5.5 and 6.6 deg) suggesting detection of colour stimuli at the single ommatidium level. Whilst our data support isometric scaling of psyllids' eyes for C. eucalypti, C. bipartita and G. brimblecombei, a morphological trade-off between light sensitivity and spatial resolution was found in A. bundoorensis. Overall, species whose microhabitat preferences require more movement between modules appear to possess superior visual acuity. The psyllid searching behaviours that we describe with the help of tracking software depict species-specific strategies that presumably evolved to optimize searching for food and oviposition sites.

  7. A CLOSE COMPANION SEARCH AROUND L DWARFS USING APERTURE MASKING INTERFEROMETRY AND PALOMAR LASER GUIDE STAR ADAPTIVE OPTICS

    SciTech Connect

    Bernat, David; Bouchez, Antonin H.; Cromer, John L.; Dekany, Richard G.; Moore, Anna M.; Ireland, Michael; Tuthill, Peter; Martinache, Frantz; Angione, John; Burruss, Rick S.; Guiwits, Stephen R.; Henning, John R.; Hickey, Jeff; Kibblewhite, Edward; McKenna, Daniel L.; Petrie, Harold L.; Roberts, Jennifer; Shelton, J. Chris; Thicksten, Robert P.; Trinh, Thang

    2010-06-01

    We present a close companion search around 16 known early L dwarfs using aperture masking interferometry with Palomar laser guide star adaptive optics (LGS AO). The use of aperture masking allows the detection of close binaries, corresponding to projected physical separations of 0.6-10.0 AU for the targets of our survey. This survey achieved median contrast limits of {Delta}K {approx} 2.3 for separations between 1.2 {lambda}/D-4{lambda}/D and {Delta}K {approx} 1.4 at 2/3 {lambda}/D. We present four candidate binaries detected with moderate-to-high confidence (90%-98%). Two have projected physical separations less than 1.5 AU. This may indicate that tight-separation binaries contribute more significantly to the binary fraction than currently assumed, consistent with spectroscopic and photometric overluminosity studies. Ten targets of this survey have previously been observed with the Hubble Space Telescope as part of companion searches. We use the increased resolution of aperture masking to search for close or dim companions that would be obscured by full aperture imaging, finding two candidate binaries. This survey is the first application of aperture masking with LGS AO at Palomar. Several new techniques for the analysis of aperture masking data in the low signal-to-noise regime are explored.

  8. Practical High-Order Adaptive Optics Systems For Extrasolar Planet Searches

    SciTech Connect

    Macintosh, B A; Olivier, S; Bauman, B; Brase, J; Carr, E; Carrano, C J; Gavel, D; Max, C E; Patience, J

    2001-08-29

    Direct detection of photons emitted or reflected by an extrasolar planet is an extremely difficult but extremely exciting application of adaptive optics. Typical contrast levels for an extrasolar planet would be 10{sup 9}-Jupiter is a billion times fainter than the sun. Current adaptive optics systems can only achieve contrast levels of 10{sup 6}, but so-called ''extreme'' adaptive optics systems with 10{sup 4}-10{sup 5} degrees of freedom could potentially detect extrasolar planets. We explore the scaling laws defining the performance of these systems, first set out by Angel (1994), and derive a different definition of an optimal system. Our sensitivity predictions are somewhat more pessimistic than the original paper, due largely to slow decorrelation timescales for some noise sources, though choosing to site an ExAO system at a location with exceptional r{sub 0} (e.g. Mauna Kea) can offset this. We also explore the effects of segment aberrations in a Keck-like telescope on ExAO; although the effects are significant, they can be mitigated through Lyot coronagraphy.

  9. Enhancing artificial bee colony algorithm with self-adaptive searching strategy and artificial immune network operators for global optimization.

    PubMed

    Chen, Tinggui; Xiao, Renbin

    2014-01-01

    Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments. PMID:24772023

  10. Enhancing Artificial Bee Colony Algorithm with Self-Adaptive Searching Strategy and Artificial Immune Network Operators for Global Optimization

    PubMed Central

    Chen, Tinggui; Xiao, Renbin

    2014-01-01

    Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments. PMID:24772023

  11. Design for a region-wide adaptive search for the ivorybilled woodpecker with the objective of estimating occupancy and related parameters

    USGS Publications Warehouse

    Cooper, R.J.; Mordecai, Rua S.; Mattsson, B.G.; Conroy, M.J.; Pacifici, K.; Peterson, J.T.; Moore, C.T.

    2008-01-01

    We describe a survey design and field protocol for the Ivory-billed Woodpecker (Campephilus principalis) search effort that will: (1) allow estimation of occupancy, use, and detection probability for habitats at two spatial scales within the bird?s former range, (2) assess relationships between occupancy, use, and habitat characteristics at those scales, (3) eventually allow the development of a population viability model that depends on patch occupancy instead of difficult-to-measure demographic parameters, and (4) be adaptive, allowing newly collected information to update the above models and search locations. The approach features random selection of patches to be searched from a sampling frame stratified and weighted by patch quality, and requires multiple visits per patch. It is adaptive within a season in that increased search activity is allowed in and around locations of strong visual and/or aural evidence, and adaptive among seasons in that habitat associations allow modification of stratum weights. This statistically rigorous approach is an improvement over simply visiting the ?best? habitat in an ad hoc fashion because we can learn from prior effort and modify the search accordingly. Results from the 2006-07 search season indicate weak relationships between occupancy and habitat (although we suggest modifications of habitat measurement protocols), and a very low detection probability, suggesting more visits per patch are required. Sample size requirements will be discussed.

  12. Broad-area search for targets in SAR imagery with context-adaptive algorithms

    NASA Astrophysics Data System (ADS)

    Patterson, Tim J.; Fairchild, Scott R.

    1996-06-01

    This paper describes an ATR system based on gray scale morphology which has proven very effective in performing broad area search for targets of interest. Gray scale morphology is used to extract several distinctive sets of features which combine intensity and spatial information. Results of direct comparisons with other algorithms are presented. In a series of tests which were scored independently the morphological approach has shown superior results. An automated training systems based on a combination of genetic algorithms and classification and regression trees is described. Further performance gains are expected by allowing context sensitive selection of parameter sets for the morphological processing. Context is acquired from the image using texture measures to identify the local clutter environment. The system is designed to be able to build new classifiers on the fly to match specific image to image variations.

  13. Small infrared target detection by region-adaptive clutter rejection for sea-based infrared search and track.

    PubMed

    Kim, Sungho; Lee, Joohyoung

    2014-07-22

    This paper presents a region-adaptive clutter rejection method for small target detection in sea-based infrared search and track. In the real world, clutter normally generates many false detections that impede the deployment of such detection systems. Incoming targets (missiles, boats, etc.) can be located in the sky, horizon and sea regions, which have different types of clutters, such as clouds, a horizontal line and sea-glint. The characteristics of regional clutter were analyzed after the geometrical analysis-based region segmentation. The false detections caused by cloud clutter were removed by the spatial attribute-based classification. Those by the horizontal line were removed using the heterogeneous background removal filter. False alarms by sun-glint were rejected using the temporal consistency filter, which is the most difficult part. The experimental results of the various cluttered background sequences show that the proposed region adaptive clutter rejection method produces fewer false alarms than that of the mean subtraction filter (MSF) with an acceptable degradation detection rate.

  14. Small Infrared Target Detection by Region-Adaptive Clutter Rejection for Sea-Based Infrared Search and Track

    PubMed Central

    Kim, Sungho; Lee, Joohyoung

    2014-01-01

    This paper presents a region-adaptive clutter rejection method for small target detection in sea-based infrared search and track. In the real world, clutter normally generates many false detections that impede the deployment of such detection systems. Incoming targets (missiles, boats, etc.) can be located in the sky, horizon and sea regions, which have different types of clutters, such as clouds, a horizontal line and sea-glint. The characteristics of regional clutter were analyzed after the geometrical analysis-based region segmentation. The false detections caused by cloud clutter were removed by the spatial attribute-based classification. Those by the horizontal line were removed using the heterogeneous background removal filter. False alarms by sun-glint were rejected using the temporal consistency filter, which is the most difficult part. The experimental results of the various cluttered background sequences show that the proposed region adaptive clutter rejection method produces fewer false alarms than that of the mean subtraction filter (MSF) with an acceptable degradation detection rate. PMID:25054633

  15. Ultimately accurate SRAF replacement for practical phases using an adaptive search algorithm based on the optimal gradient method

    NASA Astrophysics Data System (ADS)

    Maeda, Shimon; Nosato, Hirokazu; Matsunawa, Tetsuaki; Miyairi, Masahiro; Nojima, Shigeki; Tanaka, Satoshi; Sakanashi, Hidenori; Murakawa, Masahiro; Saito, Tamaki; Higuchi, Tetsuya; Inoue, Soichi

    2010-04-01

    SRAF (Sub Resolution Assist Feature) technique has been widely used for DOF enhancement. Below 40nm design node, even in the case of using the SRAF technique, the resolution limit is approached due to the use of hyper NA imaging or low k1 lithography conditions especially for the contact layer. As a result, complex layout patterns or random patterns like logic data or intermediate pitch patterns become increasingly sensitive to photo-resist pattern fidelity. This means that the need for more accurate resolution technique is increasing in order to cope with lithographic patterning fidelity issues in low k1 lithography conditions. To face with these issues, new SRAF technique like model based SRAF using an interference map or inverse lithography technique has been proposed. But these approaches don't have enough assurance for accuracy or performance, because the ideal mask generated by these techniques is lost when switching to a manufacturable mask with Manhattan structures. As a result it might be very hard to put these things into practice and production flow. In this paper, we propose the novel method for extremely accurate SRAF placement using an adaptive search algorithm. In this method, the initial position of SRAF is generated by the traditional SRAF placement such as rule based SRAF, and it is adjusted by adaptive algorithm using the evaluation of lithography simulation. This method has three advantages which are preciseness, efficiency and industrial applicability. That is, firstly, the lithography simulation uses actual computational model considering process window, thus our proposed method can precisely adjust the SRAF positions, and consequently we can acquire the best SRAF positions. Secondly, because our adaptive algorithm is based on optimal gradient method, which is very simple algorithm and rectilinear search, the SRAF positions can be adjusted with high efficiency. Thirdly, our proposed method, which utilizes the traditional SRAF placement, is

  16. Cerebellar cathodal tDCS interferes with recalibration and spatial realignment during prism adaptation procedure in healthy subjects.

    PubMed

    Panico, Francesco; Sagliano, Laura; Grossi, Dario; Trojano, Luigi

    2016-06-01

    The aim of this study is to clarify the specific role of the cerebellum during prism adaptation procedure (PAP), considering its involvement in early prism exposure (i.e., in the recalibration process) and in post-exposure phase (i.e., in the after-effect, related to spatial realignment). For this purpose we interfered with cerebellar activity by means of cathodal transcranial direct current stimulation (tDCS), while young healthy individuals were asked to perform a pointing task on a touch screen before, during and after wearing base-left prism glasses. The distance from the target dot in each trial (in terms of pixels) on horizontal and vertical axes was recorded and served as an index of accuracy. Results on horizontal axis, that was shifted by prism glasses, revealed that participants who received cathodal stimulation showed increased rightward deviation from the actual position of the target while wearing prisms and a larger leftward deviation from the target after prisms removal. Results on vertical axis, in which no shift was induced, revealed a general trend in the two groups to improve accuracy through the different phases of the task, and a trend, more visible in cathodal stimulated participants, to worsen accuracy from the first to the last movements in each phase. Data on horizontal axis allow to confirm that the cerebellum is involved in all stages of PAP, contributing to early strategic recalibration process, as well as to spatial realignment. On vertical axis, the improving performance across the different stages of the task and the worsening accuracy within each task phase can be ascribed, respectively, to a learning process and to the task-related fatigue. PMID:27031676

  17. PANMIN: sequential and parallel global optimization procedures with a variety of options for the local search strategy

    NASA Astrophysics Data System (ADS)

    Theos, F. V.; Lagaris, I. E.; Papageorgiou, D. G.

    2004-05-01

    We present two sequential and one parallel global optimization codes, that belong to the stochastic class, and an interface routine that enables the use of the Merlin/MCL environment as a non-interactive local optimizer. This interface proved extremely important, since it provides flexibility, effectiveness and robustness to the local search task that is in turn employed by the global procedures. We demonstrate the use of the parallel code to a molecular conformation problem. Program summaryTitle of program: PANMIN Catalogue identifier: ADSU Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADSU Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: PANMIN is designed for UNIX machines. The parallel code runs on either shared memory architectures or on a distributed system. The code has been tested on a SUN Microsystems ENTERPRISE 450 with four CPUs, and on a 48-node cluster under Linux, with both the GNU g77 and the Portland group compilers. The parallel implementation is based on MPI and has been tested with LAM MPI and MPICH Installation: University of Ioannina, Greece Programming language used: Fortran-77 Memory required to execute with typical data: Approximately O( n2) words, where n is the number of variables No. of bits in a word: 64 No. of processors used: 1 or many Has the code been vectorised or parallelized?: Parallelized using MPI No. of bytes in distributed program, including test data, etc.: 147163 No. of lines in distributed program, including the test data, etc.: 14366 Distribution format: gzipped tar file Nature of physical problem: A multitude of problems in science and engineering are often reduced to minimizing a function of many variables. There are instances that a local optimum does not correspond to the desired physical solution and hence the search for a better solution is required. Local optimization techniques can be

  18. A procedure for weighted summation of the derivatives of reflection coefficients in adaptive Schur filter with application to fault detection in rolling element bearings

    NASA Astrophysics Data System (ADS)

    Makowski, Ryszard; Zimroz, Radoslaw

    2013-07-01

    A procedure for feature extraction using adaptive Schur filter for damage detection in rolling element bearings is proposed in the paper. Damaged bearings produce impact signals (shocks) related with local change (loss) of stiffness in pairs: inner/outer race-rolling element. If significant disturbances do not occur (i.e. signal to noise ratio is sufficient), diagnostics is not very complicated and usually envelope analysis is used. Unfortunately, in most industrial examples, these impulsive contributions in vibration are completely masked by noise or other high energy sources. Moreover, impulses may have time varying amplitudes caused by transmission path, load and properties of noise changing in time. Thus, in order to extract time varying signal of interest, the solution would be an adaptive one. The proposed approach is based on the normalized exact least-square time-variant lattice filter (adaptive Schur filter). It is characterized by an extremely fast start-up performance, excellent convergence behavior, and fast parameter tracking capability, making this approach interesting. Schur adaptive filter consists of P sections, estimating, among others, time-varying reflection coefficients (RCs). In this paper it is proposed to use RCs and their derivatives as diagnostic features. However, it is not convenient to analyze simultaneously P signals for P sections, so instead of these, weighted sum of derivatives of RCs can be used. The key question is how to find these weight values for summation procedure. An original contributions are: application of Schur filter to bearings vibration processing, proposal of several features that can be used for detection and mentioned procedure of weighted summation of signal from sections of Schur filter. The method of signal processing is well-adapted for analysis of the non-stationary time-series, so it sounds very promising for diagnostics of machines working in time varying load/speed conditions.

  19. Characterization of the non-uniqueness of used nuclear fuel burnup signatures through a Mesh-Adaptive Direct Search

    NASA Astrophysics Data System (ADS)

    Skutnik, Steven E.; Davis, David R.

    2016-05-01

    The use of passive gamma and neutron signatures from fission indicators is a common means of estimating used fuel burnup, enrichment, and cooling time. However, while characteristic fission product signatures such as 134Cs, 137Cs, 154Eu, and others are generally reliable estimators for used fuel burnup within the context where the assembly initial enrichment and the discharge time are known, in the absence of initial enrichment and/or cooling time information (such as when applying NDA measurements in a safeguards/verification context), these fission product indicators no longer yield a unique solution for assembly enrichment, burnup, and cooling time after discharge. Through the use of a new Mesh-Adaptive Direct Search (MADS) algorithm, it is possible to directly probe the shape of this "degeneracy space" characteristic of individual nuclides (and combinations thereof), both as a function of constrained parameters (such as the assembly irradiation history) and unconstrained parameters (e.g., the cooling time before measurement and the measurement precision for particular indicator nuclides). In doing so, this affords the identification of potential means of narrowing the uncertainty space of potential assembly enrichment, burnup, and cooling time combinations, thereby bounding estimates of assembly plutonium content. In particular, combinations of gamma-emitting nuclides with distinct half-lives (e.g., 134Cs with 137Cs and 154Eu) in conjunction with gross neutron counting (via 244Cm) are able to reasonably constrain the degeneracy space of possible solutions to a space small enough to perform useful discrimination and verification of fuel assemblies based on their irradiation history.

  20. A hybrid, auto-adaptive and rule-based multi-agent approach using evolutionary algorithms for improved searching

    NASA Astrophysics Data System (ADS)

    Izquierdo, Joaquín; Montalvo, Idel; Campbell, Enrique; Pérez-García, Rafael

    2016-08-01

    Selecting the most appropriate heuristic for solving a specific problem is not easy, for many reasons. This article focuses on one of these reasons: traditionally, the solution search process has operated in a given manner regardless of the specific problem being solved, and the process has been the same regardless of the size, complexity and domain of the problem. To cope with this situation, search processes should mould the search into areas of the search space that are meaningful for the problem. This article builds on previous work in the development of a multi-agent paradigm using techniques derived from knowledge discovery (data-mining techniques) on databases of so-far visited solutions. The aim is to improve the search mechanisms, increase computational efficiency and use rules to enrich the formulation of optimization problems, while reducing the search space and catering to realistic problems.

  1. Genetic-Algorithm Tool For Search And Optimization

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven

    1995-01-01

    SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

  2. Expanding Talent Search Procedures by Including Measures of Spatial Ability: CTY's Spatial Test Battery

    ERIC Educational Resources Information Center

    Stumpf, Heinrich; Mills, Carol J.; Brody, Linda E.; Baxley, Philip G.

    2013-01-01

    The importance of spatial ability for success in a variety of domains, particularly in science, technology, engineering, and mathematics (STEM), is widely acknowledged. Yet, students with high spatial ability are rarely identified, as Talent Searches for academically talented students focus on identifying high mathematical and verbal abilities.…

  3. A MATLAB toolbox for the efficient estimation of the psychometric function using the updated maximum-likelihood adaptive procedure.

    PubMed

    Shen, Yi; Dai, Wei; Richards, Virginia M

    2015-03-01

    A MATLAB toolbox for the efficient estimation of the threshold, slope, and lapse rate of the psychometric function is described. The toolbox enables the efficient implementation of the updated maximum-likelihood (UML) procedure. The toolbox uses an object-oriented architecture for organizing the experimental variables and computational algorithms, which provides experimenters with flexibility in experimental design and data management. Descriptions of the UML procedure and the UML Toolbox are provided, followed by toolbox use examples. Finally, guidelines and recommendations of parameter configurations are given.

  4. Anatomy of Student Models in Adaptive Learning Systems: A Systematic Literature Review of Individual Differences from 2001 to 2013

    ERIC Educational Resources Information Center

    Nakic, Jelena; Granic, Andrina; Glavinic, Vlado

    2015-01-01

    This study brings an evidence-based review of user individual characteristics employed as sources of adaptation in recent adaptive learning systems. Twenty-two user individual characteristics were explored in a systematically designed search procedure, while 17 of them were identified as sources of adaptation in final selection. The content…

  5. SPIN or LURCH : a Comparative Assessment of Model Checking and Stochastic Search for Temporal Properties in Procedural Code

    NASA Technical Reports Server (NTRS)

    Powell, John D.; Owens, David; Menzies, Tim

    2004-01-01

    The difficulty of how to test large systems, such as the one on board a NASA robotic remote explorer (RRE) vehicle, is fundamentally a search issue: the global state space representing all possible has yet to be solved, even after many decades of work. Randomized algorithms have been known to outperform their deterministic counterparts for search problems representing a wide range of applications. In the case study presented here, the LURCH randomized algorithm proved to be adequate to the task of testing a NASA RRE vehicle. LURCH found all the errors found by an earlier analysis of a more complete method (SPIN). Our empirical results are that LURCH can scale to much larger models than standard model checkers like SMV and SPIN. Further, the LURCH analysis was simpler than the SPIN analysis. The simplicity and scalability of LURCH are two compelling reasons for experimenting further with this tool.

  6. Measuring acuity of the approximate number system reliably and validly: the evaluation of an adaptive test procedure

    PubMed Central

    Lindskog, Marcus; Winman, Anders; Juslin, Peter; Poom, Leo

    2013-01-01

    Two studies investigated the reliability and predictive validity of commonly used measures and models of Approximate Number System acuity (ANS). Study 1 investigated reliability by both an empirical approach and a simulation of maximum obtainable reliability under ideal conditions. Results showed that common measures of the Weber fraction (w) are reliable only when using a substantial number of trials, even under ideal conditions. Study 2 compared different purported measures of ANS acuity as for convergent and predictive validity in a within-subjects design and evaluated an adaptive test using the ZEST algorithm. Results showed that the adaptive measure can reduce the number of trials needed to reach acceptable reliability. Only direct tests with non-symbolic numerosity discriminations of stimuli presented simultaneously were related to arithmetic fluency. This correlation remained when controlling for general cognitive ability and perceptual speed. Further, the purported indirect measure of ANS acuity in terms of the Numeric Distance Effect (NDE) was not reliable and showed no sign of predictive validity. The non-symbolic NDE for reaction time was significantly related to direct w estimates in a direction contrary to the expected. Easier stimuli were found to be more reliable, but only harder (7:8 ratio) stimuli contributed to predictive validity. PMID:23964256

  7. Measuring acuity of the approximate number system reliably and validly: the evaluation of an adaptive test procedure.

    PubMed

    Lindskog, Marcus; Winman, Anders; Juslin, Peter; Poom, Leo

    2013-01-01

    Two studies investigated the reliability and predictive validity of commonly used measures and models of Approximate Number System acuity (ANS). Study 1 investigated reliability by both an empirical approach and a simulation of maximum obtainable reliability under ideal conditions. Results showed that common measures of the Weber fraction (w) are reliable only when using a substantial number of trials, even under ideal conditions. Study 2 compared different purported measures of ANS acuity as for convergent and predictive validity in a within-subjects design and evaluated an adaptive test using the ZEST algorithm. Results showed that the adaptive measure can reduce the number of trials needed to reach acceptable reliability. Only direct tests with non-symbolic numerosity discriminations of stimuli presented simultaneously were related to arithmetic fluency. This correlation remained when controlling for general cognitive ability and perceptual speed. Further, the purported indirect measure of ANS acuity in terms of the Numeric Distance Effect (NDE) was not reliable and showed no sign of predictive validity. The non-symbolic NDE for reaction time was significantly related to direct w estimates in a direction contrary to the expected. Easier stimuli were found to be more reliable, but only harder (7:8 ratio) stimuli contributed to predictive validity. PMID:23964256

  8. Constrained Self-adaptive Solutions Procedures for Structure Subject to High Temperature Elastic-plastic Creep Effects

    NASA Technical Reports Server (NTRS)

    Padovan, J.; Tovichakchaikul, S.

    1983-01-01

    This paper will develop a new solution strategy which can handle elastic-plastic-creep problems in an inherently stable manner. This is achieved by introducing a new constrained time stepping algorithm which will enable the solution of creep initiated pre/postbuckling behavior where indefinite tangent stiffnesses are encountered. Due to the generality of the scheme, both monotone and cyclic loading histories can be handled. The presentation will give a thorough overview of current solution schemes and their short comings, the development of constrained time stepping algorithms as well as illustrate the results of several numerical experiments which benchmark the new procedure.

  9. Deconvolution of post-adaptive optics images of faint circumstellar environments by means of the inexact Bregman procedure

    NASA Astrophysics Data System (ADS)

    Benfenati, A.; La Camera, A.; Carbillet, M.

    2016-02-01

    Aims: High-dynamic range images of astrophysical objects present some difficulties in their restoration because of the presence of very bright point-wise sources surrounded by faint and smooth structures. We propose a method that enables the restoration of this kind of images by taking these kinds of sources into account and, at the same time, improving the contrast enhancement in the final image. Moreover, the proposed approach can help to detect the position of the bright sources. Methods: The classical variational scheme in the presence of Poisson noise aims to find the minimum of a functional compound of the generalized Kullback-Leibler function and a regularization functional: the latter function is employed to preserve some characteristic in the restored image. The inexact Bregman procedure substitutes the regularization function with its inexact Bregman distance. This proposed scheme allows us to take under control the level of inexactness arising in the computed solution and permits us to employ an overestimation of the regularization parameter (which balances the trade-off between the Kullback-Leibler and the Bregman distance). This aspect is fundamental, since the estimation of this kind of parameter is very difficult in the presence of Poisson noise. Results: The inexact Bregman procedure is tested on a bright unresolved binary star with a faint circumstellar environment. When the sources' position is exactly known, this scheme provides us with very satisfactory results. In case of inexact knowledge of the sources' position, it can in addition give some useful information on the true positions. Finally, the inexact Bregman scheme can be also used when information about the binary star's position concerns a connected region instead of isolated pixels.

  10. Searching for signatures of cold adaptations in modern and archaic humans: hints from the brown adipose tissue genes.

    PubMed

    Sazzini, M; Schiavo, G; De Fanti, S; Martelli, P L; Casadio, R; Luiselli, D

    2014-09-01

    Adaptation to low temperatures has been reasonably developed in the human species during the colonization of the Eurasian landmass subsequent to Out of Africa migrations of anatomically modern humans. In addition to morphological and cultural changes, also metabolic ones are supposed to have favored human isolation from cold and body heat production and this can be hypothesized also for most Neandertal and at least for some Denisovan populations, which lived in geographical areas that strongly experienced the last glacial period. Modulation of non-shivering thermogenesis, for which adipocytes belonging to the brown adipose tissue are the most specialized cells, might have driven these metabolic adaptations. To perform an exploratory analysis aimed at looking into this hypothesis, variation at 28 genes involved in such functional pathway was investigated in modern populations from different climate zones, as well as in Neandertal and Denisovan genomes. Patterns of variation at the LEPR gene, strongly related to increased heat dissipation by mitochondria, appeared to have been shaped by positive selection in modern East Asians, but not in Europeans. Moreover, a single potentially cold-adapted LEPR allele, different from the supposed adaptive one identified in Homo sapiens, was found also in Neandertal and Denisovan genomes. These findings suggest that independent mechanisms for cold adaptations might have been developed in different non-African human groups, as well as that the evolution of possible enhanced thermal efficiency in Neandertals and in some Denisovan populations has plausibly entailed significant changes also in other functional pathways than in the examined one.

  11. Searching for signatures of cold adaptations in modern and archaic humans: hints from the brown adipose tissue genes

    PubMed Central

    Sazzini, M; Schiavo, G; De Fanti, S; Martelli, P L; Casadio, R; Luiselli, D

    2014-01-01

    Adaptation to low temperatures has been reasonably developed in the human species during the colonization of the Eurasian landmass subsequent to Out of Africa migrations of anatomically modern humans. In addition to morphological and cultural changes, also metabolic ones are supposed to have favored human isolation from cold and body heat production and this can be hypothesized also for most Neandertal and at least for some Denisovan populations, which lived in geographical areas that strongly experienced the last glacial period. Modulation of non-shivering thermogenesis, for which adipocytes belonging to the brown adipose tissue are the most specialized cells, might have driven these metabolic adaptations. To perform an exploratory analysis aimed at looking into this hypothesis, variation at 28 genes involved in such functional pathway was investigated in modern populations from different climate zones, as well as in Neandertal and Denisovan genomes. Patterns of variation at the LEPR gene, strongly related to increased heat dissipation by mitochondria, appeared to have been shaped by positive selection in modern East Asians, but not in Europeans. Moreover, a single potentially cold-adapted LEPR allele, different from the supposed adaptive one identified in Homo sapiens, was found also in Neandertal and Denisovan genomes. These findings suggest that independent mechanisms for cold adaptations might have been developed in different non-African human groups, as well as that the evolution of possible enhanced thermal efficiency in Neandertals and in some Denisovan populations has plausibly entailed significant changes also in other functional pathways than in the examined one. PMID:24667833

  12. Tuning into Scorpius X-1: adapting a continuous gravitational-wave search for a known binary system

    NASA Astrophysics Data System (ADS)

    Meadors, Grant David; Goetz, Evan; Riles, Keith

    2016-05-01

    We describe how the TwoSpect data analysis method for continuous gravitational waves (GWs) has been tuned for directed sources such as the low-mass X-ray binary (LMXB), Scorpius X-1 (Sco X-1). A comparison of five search algorithms generated simulations of the orbital and GW parameters of Sco X-1. Whereas that comparison focused on relative performance, here the simulations help quantify the sensitivity enhancement and parameter estimation abilities of this directed method, derived from an all-sky search for unknown sources, using doubly Fourier-transformed data. Sensitivity is shown to be enhanced when the source sky location and period are known, because we can run a fully templated search, bypassing the all-sky hierarchical stage using an incoherent harmonic sum. The GW strain and frequency, as well as the projected semi-major axis of the binary system, are recovered and uncertainty estimated, for simulated signals that are detected. Upper limits for GW strain are set for undetected signals. Applications to future GW observatory data are discussed. Robust against spin-wandering and computationally tractable despite an unknown frequency, this directed search is an important new tool for finding gravitational signals from LMXBs.

  13. Peak procedure performance in young adult and aged rats: acquisition and adaptation to a changing temporal criterion.

    PubMed

    Lejeune, H; Ferrara, A; Soffíe, M; Bronchart, M; Wearden, J H

    1998-08-01

    Twenty-four-month-old and 4-month-old rats were trained on a peak-interval procedure, where the time of reinforcement was varied twice between 20 and 40 sec. Peak times from the old rats were consistently longer than the reinforcement time, whereas those from younger animals tracked the 20- and 40-sec durations more closely. Different measures of performance suggested that the old rats were either (1) systematically misremembering the time of reinforcement or (2) using an internal clock with a substantially greater latency to start and stop timing than the younger animals. Old rats also adjusted more slowly to the first transition from 20 to 40 sec than did the younger ones, but not to later transitions. Correlations between measures derived from within-trial patterns of responding conformed in general to detailed predictions derived from scalar expectancy theory. However, some correlation values more closely resembled those derived from a study of peak-interval performance in humans and a theoretical model developed by Cheng and Westwood (1993), than those obtained in previous work with animals, for reasons that are at present unclear.

  14. A systematic search for SNPs/haplotypes associated with disease phenotypes using a haplotype-based stepwise procedure

    PubMed Central

    Yang, Yin; Li, Shuying Sue; Chien, Jason W; Andriesen, Jessica; Zhao, Lue Ping

    2008-01-01

    Background Genotyping technologies enable us to genotype multiple Single Nucleotide Polymorphisms (SNPs) within selected genes/regions, providing data for haplotype association analysis. While haplotype-based association analysis is powerful for detecting untyped causal alleles in linkage-disequilibrium (LD) with neighboring SNPs/haplotypes, the inclusion of extraneous SNPs could reduce its power by increasing the number of haplotypes with each additional SNP. Methods Here, we propose a haplotype-based stepwise procedure (HBSP) to eliminate extraneous SNPs. To evaluate its properties, we applied HBSP to both simulated and real data, generated from a study of genetic associations of the bactericidal/permeability-increasing (BPI) gene with pulmonary function in a cohort of patients following bone marrow transplantation. Results Under the null hypothesis, use of the HBSP gave results that retained the desired false positive error rates when multiple comparisons were considered. Under various alternative hypotheses, HBSP had adequate power to detect modest genetic associations in case-control studies with 500, 1,000 or 2,000 subjects. In the current application, HBSP led to the identification of two specific SNPs with a positive validation. Conclusion These results demonstrate that HBSP retains the essence of haplotype-based association analysis while improving analytic power by excluding extraneous SNPs. Minimizing the number of SNPs also enables simpler interpretation and more cost-effective applications. PMID:19102730

  15. The Search for Relevant Climate Change Information to Support Adaptation Decision Makers: Lessons from Reductionism, Emergence and the Past (Invited)

    NASA Astrophysics Data System (ADS)

    Stainforth, D.; Harrison, S.; Smith, L. A.

    2009-12-01

    The reality of anthropogenic climate change is founded on well understood scientific principles and is now widely accepted. The need for international efforts to limit the extent of future changes in climate - climate change mitigation - is therefore clear. Since anthropogenic climate change is well underway, however, and the planet is committed to further changes based on past emissions alone, there will certainly be a need for global society to adapt to the consequences. The physical sciences are increasingly being looked to as sources of information and guidance on adaptation policy and decision making. Unlike mitigation efforts such decisions generally require information on local or regional scales. What is the source of such information? How can we tell when it is robust and fit for the purpose of supporting a specific decision? The availability of rapidly increasing computational resources has led to a steady increase in the resolution of global climate models and of embedded regional climate models. They are approaching a point where they can provide data at a resolution which may be usable in adaptation decision support. Yet models are not equivalent to reality and model errors are significant even at the global scale. By contrast scientific understanding of climatic processes now and in the past can provide information about plausible responses which are more qualitative but may be equally useful. This talk will focus on the relative roles of fundamentally reductionist, model approaches with alternatives based on observations and process understanding. The latter, although more qualitative, are able to inform us about emergent properties; properties which may be difficult or impossible to reproduce within a reductionist paradigm. The contrast between emergent and reductionist approaches has a long history in the physical sciences; a history which provides valuable lessons for the relationship between climate science and societal / policy decisions. Here

  16. Genetic algorithms in adaptive fuzzy control

    NASA Technical Reports Server (NTRS)

    Karr, C. Lucas; Harper, Tony R.

    1992-01-01

    Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust fuzzy membership functions in response to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific computer-simulated chemical system is used to demonstrate the ideas presented.

  17. Searching for Binary Y Dwarfs with the Gemini Multi-conjugate Adaptive Optics System (GeMS)

    NASA Astrophysics Data System (ADS)

    Opitz, Daniela; Tinney, C. G.; Faherty, Jacqueline K.; Sweet, Sarah; Gelino, Christopher R.; Kirkpatrick, J. Davy

    2016-03-01

    The NASA Wide-field Infrared Survey Explorer (WISE) has discovered almost all the known members of the new class of Y-type brown dwarfs. Most of these Y dwarfs have been identified as isolated objects in the field. It is known that binaries with L- and T-type brown dwarf primaries are less prevalent than either M-dwarf or solar-type primaries, they tend to have smaller separations and are more frequently detected in near-equal mass configurations. The binary statistics for Y-type brown dwarfs, however, are sparse, and so it is unclear if the same trends that hold for L- and T-type brown dwarfs also hold for Y-type ones. In addition, the detection of binary companions to very cool Y dwarfs may well be the best means available for discovering even colder objects. We present results for binary properties of a sample of five WISE Y dwarfs with the Gemini Multi-Conjugate Adaptive Optics System. We find no evidence for binary companions in these data, which suggests these systems are not equal-luminosity (or equal-mass) binaries with separations larger than ˜0.5-1.9 AU. For equal-mass binaries at an age of 5 Gyr, we find that the binary binding energies ruled out by our observations (i.e., 1042 erg) are consistent with those observed in previous studies of hotter ultra-cool dwarfs.

  18. Evaluation of total effective dose due to certain environmentally placed naturally occurring radioactive materials using a procedural adaptation of RESRAD code.

    PubMed

    Beauvais, Z S; Thompson, K H; Kearfott, K J

    2009-07-01

    Due to a recent upward trend in the price of uranium and subsequent increased interest in uranium mining, accurate modeling of baseline dose from environmental sources of radioactivity is of increasing interest. Residual radioactivity model and code (RESRAD) is a program used to model environmental movement and calculate the dose due to the inhalation, ingestion, and exposure to radioactive materials following a placement. This paper presents a novel use of RESRAD for the calculation of dose from non-enhanced, or ancient, naturally occurring radioactive material (NORM). In order to use RESRAD to calculate the total effective dose (TED) due to ancient NORM, a procedural adaptation was developed to negate the effects of time progressive distribution of radioactive materials. A dose due to United States' average concentrations of uranium, actinium, and thorium series radionuclides was then calculated. For adults exposed in a residential setting and assumed to eat significant amounts of food grown in NORM concentrated areas, the annual dose due to national average NORM concentrations was 0.935 mSv y(-1). A set of environmental dose factors were calculated for simple estimation of dose from uranium, thorium, and actinium series radionuclides for various age groups and exposure scenarios as a function of elemental uranium and thorium activity concentrations in groundwater and soil. The values of these factors for uranium were lowest for an adult exposed in an industrial setting: 0.00476 microSv kg Bq(-1) y(-1) for soil and 0.00596 microSv m(3) Bq(-1) y(-1) for water (assuming a 1:1 234U:238U activity ratio in water). The uranium factors were highest for infants exposed in a residential setting and assumed to ingest food grown onsite: 34.8 microSv kg Bq(-1) y(-1) in soil and 13.0 microSv m(3) Bq(-1) y(-1) in water. PMID:19509509

  19. Null Steering of Adaptive Beamforming Using Linear Constraint Minimum Variance Assisted by Particle Swarm Optimization, Dynamic Mutated Artificial Immune System, and Gravitational Search Algorithm

    PubMed Central

    Sieh Kiong, Tiong; Tariqul Islam, Mohammad; Ismail, Mahamod; Salem, Balasem

    2014-01-01

    Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program. PMID:25147859

  20. Null steering of adaptive beamforming using linear constraint minimum variance assisted by particle swarm optimization, dynamic mutated artificial immune system, and gravitational search algorithm.

    PubMed

    Darzi, Soodabeh; Kiong, Tiong Sieh; Islam, Mohammad Tariqul; Ismail, Mahamod; Kibria, Salehin; Salem, Balasem

    2014-01-01

    Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program.

  1. Visual search.

    PubMed

    Chan, Louis K H; Hayward, William G

    2013-07-01

    Visual search is the act of looking for a predefined target among other objects. This task has been widely used as an experimental paradigm to study visual attention, and because of its influence has also become a subject of research itself. When used as a paradigm, visual search studies address questions including the nature, function, and limits of preattentive processing and focused attention. As a subject of research, visual search studies address the role of memory in search, the procedures involved in search, and factors that affect search performance. In this article, we review major theories of visual search, the ways in which preattentive information is used to guide attentional allocation, the role of memory, and the processes and decisions involved in its successful completion. We conclude by summarizing the current state of knowledge about visual search and highlight some unresolved issues. WIREs Cogn Sci 2013, 4:415-429. doi: 10.1002/wcs.1235 The authors have declared no conflicts of interest for this article. For further resources related to this article, please visit the WIREs website.

  2. Search for associations containing young stars (SACY). VI. Is multiplicity universal? Stellar multiplicity in the range 3-1000 au from adaptive-optics observations

    NASA Astrophysics Data System (ADS)

    Elliott, P.; Huélamo, N.; Bouy, H.; Bayo, A.; Melo, C. H. F.; Torres, C. A. O.; Sterzik, M. F.; Quast, G. R.; Chauvin, G.; Barrado, D.

    2015-08-01

    Context. Young loose nearby associations are unique samples of close (<150 pc), young (≈5-100 Myr) pre-main-sequence (PMS) stars. A significant number of members of these associations have been identified in the SACY (search for associations containing young stars) collaboration. We can use the proximity and youth of these members to investigate key ingredients in star formation processes, such as multiplicity. Aims: With the final goal of better understanding multiplicity properties at different evolutionary stages of PMS stars, we present the statistics of identified multiple systems from 113 confirmed SACY members. We derive multiplicity frequencies, mass-ratio, and physical separation distributions in a consistent parameter space, and compare our results to other PMS populations and the field. Methods: We have obtained adaptive-optics assisted near-infrared observations with the Nasmyth Adaptive Optics System and Near-Infrared Imager and Spectrograph (NACO), ESO/VLT, and the Infrared Camera for Adaptive optics at Lick observatory (IRCAL), Lick Observatory, for at least one epoch of all 113 SACY members. We have identified multiple systems using co-moving proper-motion analysis for targets with multi-epoch data, and using contamination estimates in terms of mass-ratio and physical separation for targets with single-epoch data. We have explored ranges in projected separation and mass-ratio of a [3-1000 au], and q [0.1-1], respectively. Results: We have identified 31 multiple systems (28 binaries and 3 triples). We derive a multiplicity frequency (MF) of MF3-1000 au=28.4+4.7_{-3.9}% and a triple frequency (TF) of TF3-1000 au =2.8 +2.5-0.8% in the separation range of 3-1000 au. We do not find any evidence for an increase in the MF with primary mass. The estimated mass-ratio of our statistical sample (with power-law index γ = -0.04 ± 0.14) is consistent with a flat distribution (γ = 0). Conclusions: Analysis from previous work using tight binaries indicated

  3. Standardization of Keyword Search Mode

    ERIC Educational Resources Information Center

    Su, Di

    2010-01-01

    In spite of its popularity, keyword search mode has not been standardized. Though information professionals are quick to adapt to various presentations of keyword search mode, novice end-users may find keyword search confusing. This article compares keyword search mode in some major reference databases and calls for standardization. (Contains 3…

  4. Adaptive management

    USGS Publications Warehouse

    Allen, Craig R.; Garmestani, Ahjond S.

    2015-01-01

    Adaptive management is an approach to natural resource management that emphasizes learning through management where knowledge is incomplete, and when, despite inherent uncertainty, managers and policymakers must act. Unlike a traditional trial and error approach, adaptive management has explicit structure, including a careful elucidation of goals, identification of alternative management objectives and hypotheses of causation, and procedures for the collection of data followed by evaluation and reiteration. The process is iterative, and serves to reduce uncertainty, build knowledge and improve management over time in a goal-oriented and structured process.

  5. A Comparison of Item Selection Procedures Using Different Ability Estimation Methods in Computerized Adaptive Testing Based on the Generalized Partial Credit Model

    ERIC Educational Resources Information Center

    Ho, Tsung-Han

    2010-01-01

    Computerized adaptive testing (CAT) provides a highly efficient alternative to the paper-and-pencil test. By selecting items that match examinees' ability levels, CAT not only can shorten test length and administration time but it can also increase measurement precision and reduce measurement error. In CAT, maximum information (MI) is the most…

  6. Adaptive Process Control with Fuzzy Logic and Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Karr, C. L.

    1993-01-01

    Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision-making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

  7. Adaptive process control using fuzzy logic and genetic algorithms

    NASA Technical Reports Server (NTRS)

    Karr, C. L.

    1993-01-01

    Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

  8. Adaptive Image Denoising by Mixture Adaptation

    NASA Astrophysics Data System (ADS)

    Luo, Enming; Chan, Stanley H.; Nguyen, Truong Q.

    2016-10-01

    We propose an adaptive learning procedure to learn patch-based image priors for image denoising. The new algorithm, called the Expectation-Maximization (EM) adaptation, takes a generic prior learned from a generic external database and adapts it to the noisy image to generate a specific prior. Different from existing methods that combine internal and external statistics in ad-hoc ways, the proposed algorithm is rigorously derived from a Bayesian hyper-prior perspective. There are two contributions of this paper: First, we provide full derivation of the EM adaptation algorithm and demonstrate methods to improve the computational complexity. Second, in the absence of the latent clean image, we show how EM adaptation can be modified based on pre-filtering. Experimental results show that the proposed adaptation algorithm yields consistently better denoising results than the one without adaptation and is superior to several state-of-the-art algorithms.

  9. Combining image-seeking functions and a subtraction strategy: a vector-space procedure to improve many-body searches in molecular replacement.

    PubMed

    Alvarez-Rúa, Carmen; Borge, Javier; García-Granda, Santiago

    2002-02-01

    Many-body searches in molecular replacement are usually carried out sequentially and each step benefits from the structural information obtained in previous rotational and translational stages. In this context, the incorporation of known structural information has proved to enhance the discrimination of a rotation function in Patterson space when many independent molecules have to be located in the asymmetric unit of the crystal cell. This improvement is achieved by subtraction of the contributions of already positioned molecules from the observed Patterson map, which makes the determination of the correct orientation of the remaining molecules easier. The quality of the resultant difference Patterson map is greatly influenced by the application of a bulk-solvent correction to the structure-factor amplitudes of the molecules that are being subtracted. The results obtained in the rotation search benefit both from the availability of high-resolution data and from the combination of the subtraction strategy and the refinement of a great number of the peaks of the rotation function.

  10. A finite difference Davidson procedure to sidestep full ab initio hessian calculation: application to characterization of stationary points and transition state searches.

    PubMed

    Sharada, Shaama Mallikarjun; Bell, Alexis T; Head-Gordon, Martin

    2014-04-28

    The cost of calculating nuclear hessians, either analytically or by finite difference methods, during the course of quantum chemical analyses can be prohibitive for systems containing hundreds of atoms. In many applications, though, only a few eigenvalues and eigenvectors, and not the full hessian, are required. For instance, the lowest one or two eigenvalues of the full hessian are sufficient to characterize a stationary point as a minimum or a transition state (TS), respectively. We describe here a method that can eliminate the need for hessian calculations for both the characterization of stationary points as well as searches for saddle points. A finite differences implementation of the Davidson method that uses only first derivatives of the energy to calculate the lowest eigenvalues and eigenvectors of the hessian is discussed. This method can be implemented in conjunction with geometry optimization methods such as partitioned-rational function optimization (P-RFO) to characterize stationary points on the potential energy surface. With equal ease, it can be combined with interpolation methods that determine TS guess structures, such as the freezing string method, to generate approximate hessian matrices in lieu of full hessians as input to P-RFO for TS optimization. This approach is shown to achieve significant cost savings relative to exact hessian calculation when applied to both stationary point characterization as well as TS optimization. The basic reason is that the present approach scales one power of system size lower since the rate of convergence is approximately independent of the size of the system. Therefore, the finite-difference Davidson method is a viable alternative to full hessian calculation for stationary point characterization and TS search particularly when analytical hessians are not available or require substantial computational effort. PMID:24784261

  11. A finite difference Davidson procedure to sidestep full ab initio hessian calculation: Application to characterization of stationary points and transition state searches

    SciTech Connect

    Sharada, Shaama Mallikarjun; Bell, Alexis T. E-mail: bell@cchem.berkeley.edu; Head-Gordon, Martin E-mail: bell@cchem.berkeley.edu

    2014-04-28

    The cost of calculating nuclear hessians, either analytically or by finite difference methods, during the course of quantum chemical analyses can be prohibitive for systems containing hundreds of atoms. In many applications, though, only a few eigenvalues and eigenvectors, and not the full hessian, are required. For instance, the lowest one or two eigenvalues of the full hessian are sufficient to characterize a stationary point as a minimum or a transition state (TS), respectively. We describe here a method that can eliminate the need for hessian calculations for both the characterization of stationary points as well as searches for saddle points. A finite differences implementation of the Davidson method that uses only first derivatives of the energy to calculate the lowest eigenvalues and eigenvectors of the hessian is discussed. This method can be implemented in conjunction with geometry optimization methods such as partitioned-rational function optimization (P-RFO) to characterize stationary points on the potential energy surface. With equal ease, it can be combined with interpolation methods that determine TS guess structures, such as the freezing string method, to generate approximate hessian matrices in lieu of full hessians as input to P-RFO for TS optimization. This approach is shown to achieve significant cost savings relative to exact hessian calculation when applied to both stationary point characterization as well as TS optimization. The basic reason is that the present approach scales one power of system size lower since the rate of convergence is approximately independent of the size of the system. Therefore, the finite-difference Davidson method is a viable alternative to full hessian calculation for stationary point characterization and TS search particularly when analytical hessians are not available or require substantial computational effort.

  12. Searching for Pedagogical Adaptations by Exploring Teacher's Tacit Knowledge and Interactional Co-Regulation in the Education of Pupils with Autism

    ERIC Educational Resources Information Center

    Rama, Irene; Kontu, Elina

    2012-01-01

    The purpose of this article is to introduce a research design, which aims to find useful pedagogical adaptations for teaching pupils with autism. Autism is a behavioural syndrome characterised by disabilities and dysfunctions in interaction and communication, which is why it is interesting to explore educational processes particularly from an…

  13. Adaptation to hot environmental conditions: an exploration of the performance basis, procedures and future directions to optimise opportunities for elite athletes.

    PubMed

    Guy, Joshua H; Deakin, Glen B; Edwards, Andrew M; Miller, Catherine M; Pyne, David B

    2015-03-01

    Extreme environmental conditions present athletes with diverse challenges; however, not all sporting events are limited by thermoregulatory parameters. The purpose of this leading article is to identify specific instances where hot environmental conditions either compromise or augment performance and, where heat acclimation appears justified, evaluate the effectiveness of pre-event acclimation processes. To identify events likely to be receptive to pre-competition heat adaptation protocols, we clustered and quantified the magnitude of difference in performance of elite athletes competing in International Association of Athletics Federations (IAAF) World Championships (1999-2011) in hot environments (>25 °C) with those in cooler temperate conditions (<25 °C). Athletes in endurance events performed worse in hot conditions (~3 % reduction in performance, Cohen's d > 0.8; large impairment), while in contrast, performance in short-duration sprint events was augmented in the heat compared with temperate conditions (~1 % improvement, Cohen's d > 0.8; large performance gain). As endurance events were identified as compromised by the heat, we evaluated common short-term heat acclimation (≤7 days, STHA) and medium-term heat acclimation (8-14 days, MTHA) protocols. This process identified beneficial effects of heat acclimation on performance using both STHA (2.4 ± 3.5 %) and MTHA protocols (10.2 ± 14.0 %). These effects were differentially greater for MTHA, which also demonstrated larger reductions in both endpoint exercise heart rate (STHA: -3.5 ± 1.8 % vs MTHA: -7.0 ± 1.9 %) and endpoint core temperature (STHA: -0.7 ± 0.7 % vs -0.8 ± 0.3 %). It appears that worthwhile acclimation is achievable for endurance athletes via both short-and medium-length protocols but more is gained using MTHA. Conversely, it is also conceivable that heat acclimation may be counterproductive for sprinters. As high-performance athletes are often time-poor, shorter duration protocols may

  14. Analytical Methods for Online Searching.

    ERIC Educational Resources Information Center

    Vigil, Peter J.

    1983-01-01

    Analytical methods for facilitating comparison of multiple sets during online searching are illustrated by description of specific searching methods that eliminate duplicate citations and a factoring procedure based on syntactic relationships that establishes ranked sets. Searches executed in National Center for Mental Health database on…

  15. Bomb Threats and Bomb Search Techniques.

    ERIC Educational Resources Information Center

    Department of the Treasury, Washington, DC.

    This pamphlet explains how to be prepared and plan for bomb threats and describes procedures to follow once a call has been received. The content covers (1) preparation for bomb threats, (2) evacuation procedures, (3) room search methods, (4) procedures to follow once a bomb has been located, and (5) typical problems that search teams will…

  16. A parallel algorithm for random searches

    NASA Astrophysics Data System (ADS)

    Wosniack, M. E.; Raposo, E. P.; Viswanathan, G. M.; da Luz, M. G. E.

    2015-11-01

    We discuss a parallelization procedure for a two-dimensional random search of a single individual, a typical sequential process. To assure the same features of the sequential random search in the parallel version, we analyze the former spatial patterns of the encountered targets for different search strategies and densities of homogeneously distributed targets. We identify a lognormal tendency for the distribution of distances between consecutively detected targets. Then, by assigning the distinct mean and standard deviation of this distribution for each corresponding configuration in the parallel simulations (constituted by parallel random walkers), we are able to recover important statistical properties, e.g., the target detection efficiency, of the original problem. The proposed parallel approach presents a speedup of nearly one order of magnitude compared with the sequential implementation. This algorithm can be easily adapted to different instances, as searches in three dimensions. Its possible range of applicability covers problems in areas as diverse as automated computer searchers in high-capacity databases and animal foraging.

  17. Developing Competency in Payroll Procedures

    ERIC Educational Resources Information Center

    Jackson, Allen L.

    1975-01-01

    The author describes a sequence of units that provides for competency in payroll procedures. The units could be the basis for a four to six week minicourse and are adaptable, so that the student, upon completion, will be able to apply his learning to any payroll procedures system. (Author/AJ)

  18. Search Cloud

    MedlinePlus

    ... 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 ...

  19. Validation of a simplified field-adapted procedure for routine determinations of methyl mercury at trace levels in natural water samples using species-specific isotope dilution mass spectrometry.

    PubMed

    Lambertsson, Lars; Björn, Erik

    2004-12-01

    A field-adapted procedure based on species-specific isotope dilution (SSID) methodology for trace-level determinations of methyl mercury (CH(3)Hg(+)) in mire, fresh and sea water samples was developed, validated and applied in a field study. In the field study, mire water samples were filtered, standardised volumetrically with isotopically enriched CH(3) (200)Hg(+), and frozen on dry ice. The samples were derivatised in the laboratory without further pre-treatment using sodium tetraethyl borate (NaB(C(2)H(5))(4)) and the ethylated methyl mercury was purge-trapped on Tenax columns. The analyte was thermo-desorbed onto a GC-ICP-MS system for analysis. Investigations preceding field application of the method showed that when using SSID, for all tested matrices, identical results were obtained between samples that were freeze-preserved or analysed unpreserved. For DOC-rich samples (mire water) additional experiments showed no difference in CH(3)Hg(+) concentration between samples that were derivatised without pre-treatment or after liquid extraction. Extractions of samples for matrix-analyte separation prior to derivatisation are therefore not necessary. No formation of CH(3)Hg(+) was observed during sample storage and treatment when spiking samples with (198)Hg(2+). Total uncertainty budgets for the field application of the method showed that for analyte concentrations higher than 1.5 pg g(-1) (as Hg) the relative expanded uncertainty (REU) was approximately 5% and dominated by the uncertainty in the isotope standard concentration. Below 0.5 pg g(-1) (as Hg), the REU was >10% and dominated by variations in the field blank. The uncertainty of the method is sufficiently low to accurately determine CH(3)Hg(+) concentrations at trace levels. The detection limit was determined to be 4 fg g(-1) (as Hg) based on replicate analyses of laboratory blanks. The described procedure is reliable, considerably faster and simplified compared to non-SSID methods and thereby very

  20. Procurement of Literature Searching Services.

    ERIC Educational Resources Information Center

    Burgess, Jonathan G.; McCann, Anne

    1979-01-01

    A project for the cyclic review of the safety of food additives initiated by the Food and Drug Administration's Bureau of Foods is outlined, and contractual arrangements and procedures for procuring the necessary literature searches are discussed. (CWM)

  1. Quark search at the CBA

    SciTech Connect

    Larsen, R.C.; Leipuner, L.B.; Morse, W.M.; Adair, R.K.; Kasha, H.; Schmidt, M.P.

    1983-03-13

    An experiment to search for quarks at the CBA is described. The cross sections for the production of massive quark-antiquark pairs in nucleon-nucleon interactions is estimated, and the experimental design and procedures are described. (WHK)

  2. Adapted Canoeing for the Handicapped.

    ERIC Educational Resources Information Center

    Frith, Greg H.; Warren, L. D.

    1984-01-01

    Safety as well as instructional recommendations are offered for adapting canoeing as a recreationial activity for handicapped students. Major steps of the instructional program feature orientation to the water and canoe, entry and exit techinques, and mobility procedures. (CL)

  3. Adaptive Sampling Designs.

    ERIC Educational Resources Information Center

    Flournoy, Nancy

    Designs for sequential sampling procedures that adapt to cumulative information are discussed. A familiar illustration is the play-the-winner rule in which there are two treatments; after a random start, the same treatment is continued as long as each successive subject registers a success. When a failure occurs, the other treatment is used until…

  4. Prism Adaptation in Schizophrenia

    ERIC Educational Resources Information Center

    Bigelow, Nirav O.; Turner, Beth M.; Andreasen, Nancy C.; Paulsen, Jane S.; O'Leary, Daniel S.; Ho, Beng-Choon

    2006-01-01

    The prism adaptation test examines procedural learning (PL) in which performance facilitation occurs with practice on tasks without the need for conscious awareness. Dynamic interactions between frontostriatal cortices, basal ganglia, and the cerebellum have been shown to play key roles in PL. Disruptions within these neural networks have also…

  5. Adaptive Physical Education.

    ERIC Educational Resources Information Center

    Muller, Robert M.

    GRADES OR AGES: Elementary grades. SUBJECT MATTER: Adaptive physical education. ORGANIZATION AND PHYSICAL APPEARANCE: The aims and objectives of the program and the screening procedure are described. Common postural deviations are identified and a number of congenital and other defects described. Details of the modified program are given. There is…

  6. An adaptive lidar

    NASA Astrophysics Data System (ADS)

    Oshlakov, V. G.; Andreev, M. I.; Malykh, D. D.

    2009-09-01

    Using the polarization characteristics of a target and its underlying surface one can change the target contrast range. As the target one can use the compact and discrete structures with different characteristics to reflect electromagnetic waves. An important problem, solved by the adaptive polarization lidar, is to determine the availability and identification of different targets based on their polarization characteristics against the background of underlying surface, which polarization characteristics are unknown. Another important problem of the adaptive polarization lidar is a search for the objects, which polarization characteristics are unknown, against the background of underlying surface, which polarization characteristics are known. The adaptive polarization lidar makes it possible to determine the presence of impurities in sea water. The characteristics of the adaptive polarization lidar undergo variations, i.e., polarization characteristics of a sensing signal and polarization characteristics of the receiver are varied depending on the problem to be solved. One of the versions of construction of the adaptive polarization lidar is considered. The increase of the contrast in the adaptive lidar has been demonstrated by the numerical experiment when sensing hydrosols on the background of the Rayleigh scattering, caused by clear water. The numerical experiment has also demonstrated the increase of the contrast in the adaptive lidar when sensing at two wavelengths of dry haze and dense haze on the background of the Rayleigh scattering, caused by the clear atmosphere. The most effective wavelength was chosen.

  7. Quantifying the Influence of Search Algorithm Uncertainty on the Estimated Parameters of Environmental Models

    NASA Astrophysics Data System (ADS)

    Aziz, S.; Matott, L.

    2012-12-01

    The uncertain parameters of a given environmental model are often inferred from an optimization procedure that seeks to minimize discrepancies between simulated output and observed data. However, optimization search procedures can potentially yield different results across multiple calibration trials. For example, global search procedures like the genetic algorithm and simulated annealing are driven by inherent randomness that can result in variable inter-trial behavior. Despite this potential for variability in search algorithm performance, practitioners are reluctant to run multiple trials of an algorithm because of the added computational burden. As a result, estimated parameters are subject to an unrecognized source of uncertainty that could potentially bias or contaminate subsequent predictive analyses. In this study, a series of numerical experiments were performed to explore the influence of search algorithm uncertainty on parameter estimates. The experiments applied multiple trials of the simulated annealing algorithm to a suite of calibration problems involving watershed rainfall-runoff, groundwater flow, and subsurface contaminant transport. Results suggest that linking the simulated annealing algorithm with an adaptive range-reduction technique can significantly improve algorithm effectiveness while simultaneously reducing inter-trial variability. Therefore these range-reduction procedures appear to be a suitable mechanism for minimizing algorithm variance and improving the consistency of parameter estimates.

  8. DNA profiles, computer searches, and the Fourth Amendment.

    PubMed

    Kimel, Catherine W

    2013-01-01

    Pursuant to federal statutes and to laws in all fifty states, the United States government has assembled a database containing the DNA profiles of over eleven million citizens. Without judicial authorization, the government searches each of these profiles one-hundred thousand times every day, seeking to link database subjects to crimes they are not suspected of committing. Yet, courts and scholars that have addressed DNA databasing have focused their attention almost exclusively on the constitutionality of the government's seizure of the biological samples from which the profiles are generated. This Note fills a gap in the scholarship by examining the Fourth Amendment problems that arise when the government searches its vast DNA database. This Note argues that each attempt to match two DNA profiles constitutes a Fourth Amendment search because each attempted match infringes upon database subjects' expectations of privacy in their biological relationships and physical movements. The Note further argues that database searches are unreasonable as they are currently conducted, and it suggests an adaptation of computer-search procedures to remedy the constitutional deficiency.

  9. DNA profiles, computer searches, and the Fourth Amendment.

    PubMed

    Kimel, Catherine W

    2013-01-01

    Pursuant to federal statutes and to laws in all fifty states, the United States government has assembled a database containing the DNA profiles of over eleven million citizens. Without judicial authorization, the government searches each of these profiles one-hundred thousand times every day, seeking to link database subjects to crimes they are not suspected of committing. Yet, courts and scholars that have addressed DNA databasing have focused their attention almost exclusively on the constitutionality of the government's seizure of the biological samples from which the profiles are generated. This Note fills a gap in the scholarship by examining the Fourth Amendment problems that arise when the government searches its vast DNA database. This Note argues that each attempt to match two DNA profiles constitutes a Fourth Amendment search because each attempted match infringes upon database subjects' expectations of privacy in their biological relationships and physical movements. The Note further argues that database searches are unreasonable as they are currently conducted, and it suggests an adaptation of computer-search procedures to remedy the constitutional deficiency. PMID:23461001

  10. Adaptive Management

    EPA Science Inventory

    Adaptive management is an approach to natural resource management that emphasizes learning through management where knowledge is incomplete, and when, despite inherent uncertainty, managers and policymakers must act. Unlike a traditional trial and error approach, adaptive managem...

  11. XML syntax for clinical laboratory procedure manuals.

    PubMed

    Saadawi, Gilan; Harrison, James H

    2003-01-01

    We have developed a document type description (DTD) in Extensable Markup Language (XML) for clinical laboratory procedures. Our XML syntax can adequately structure a variety of procedure types across different laboratories and is compatible with current procedure standards. The combination of this format with an XML content management system and appropriate style sheets will allow efficient procedure maintenance, distributed access, customized display and effective searching across a large body of test information.

  12. Confidential Searches.

    ERIC Educational Resources Information Center

    Kenney, Linda Chion

    2003-01-01

    Will the stealth superintendent hunt in Cincinnati become tomorrow's standard approach? Search consultants and superintendents offer their views on how far confidentiality should go. Also includes a search firm's process for shielding identities and a confidentiality pledge. (MLF)

  13. Savvy Searching.

    ERIC Educational Resources Information Center

    Jacso, Peter

    2002-01-01

    Explains desktop metasearch engines, which search the databases of several search engines simultaneously. Reviews two particular versions, the Copernic 2001 Pro and the BullsEye Pro 3, comparing costs, subject categories, display capabilities, and layout for presenting results. (LRW)

  14. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  15. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 25 Indians 1 2013-04-01 2013-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  16. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 25 Indians 1 2012-04-01 2011-04-01 true Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  17. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 25 Indians 1 2014-04-01 2014-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  18. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 25 Indians 1 2011-04-01 2011-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  19. Partition search

    SciTech Connect

    Ginsberg, M.L.

    1996-12-31

    We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as {alpha}-{beta} pruning provides over minimax.

  20. Dewey Searches!

    ERIC Educational Resources Information Center

    School Library Media Activities Monthly, 2000

    2000-01-01

    Describes an activity for young children that helps them conduct subject searches using an automated system that allows customization of access to a library's collection. Explains a timed game that makes use of subject searching and word searching on the topic of dinosaurs. (LRW)

  1. Suspicionless Searches.

    ERIC Educational Resources Information Center

    Zirkel, Perry A.

    2000-01-01

    In a federal case involving a vice-principal's pat-down search of middle-school students in a cafeteria (for a missing pizza knife), the court upheld the search, saying it was relatively unintrusive and met "TLO's" reasonable-suspicion standards. Principals need reasonable justification for searching a group. (Contains 18 references.) (MLH)

  2. Dental Procedures.

    PubMed

    Ramponi, Denise R

    2016-01-01

    Dental problems are a common complaint in emergency departments in the United States. There are a wide variety of dental issues addressed in emergency department visits such as dental caries, loose teeth, dental trauma, gingival infections, and dry socket syndrome. Review of the most common dental blocks and dental procedures will allow the practitioner the opportunity to make the patient more comfortable and reduce the amount of analgesia the patient will need upon discharge. Familiarity with the dental equipment, tooth, and mouth anatomy will help prepare the practitioner for to perform these dental procedures. PMID:27482994

  3. Application of adaptive cluster sampling to low-density populations of freshwater mussels

    USGS Publications Warehouse

    Smith, D.R.; Villella, R.F.; Lemarie, D.P.

    2003-01-01

    Freshwater mussels appear to be promising candidates for adaptive cluster sampling because they are benthic macroinvertebrates that cluster spatially and are frequently found at low densities. We applied adaptive cluster sampling to estimate density of freshwater mussels at 24 sites along the Cacapon River, WV, where a preliminary timed search indicated that mussels were present at low density. Adaptive cluster sampling increased yield of individual mussels and detection of uncommon species; however, it did not improve precision of density estimates. Because finding uncommon species, collecting individuals of those species, and estimating their densities are important conservation activities, additional research is warranted on application of adaptive cluster sampling to freshwater mussels. However, at this time we do not recommend routine application of adaptive cluster sampling to freshwater mussel populations. The ultimate, and currently unanswered, question is how to tell when adaptive cluster sampling should be used, i.e., when is a population sufficiently rare and clustered for adaptive cluster sampling to be efficient and practical? A cost-effective procedure needs to be developed to identify biological populations for which adaptive cluster sampling is appropriate.

  4. The Adaptive Analysis of Visual Cognition using Genetic Algorithms

    PubMed Central

    Cook, Robert G.; Qadri, Muhammad A. J.

    2014-01-01

    Two experiments used a novel, open-ended, and adaptive test procedure to examine visual cognition in animals. Using a genetic algorithm, a pigeon was tested repeatedly from a variety of different initial conditions for its solution to an intermediate brightness search task. On each trial, the animal had to accurately locate and peck a target element of intermediate brightness from among a variable number of surrounding darker and lighter distractor elements. Displays were generated from six parametric variables, or genes (distractor number, element size, shape, spacing, target brightness, distractor brightness). Display composition changed over time, or evolved, as a function of the bird’s differential accuracy within the population of values for each gene. Testing three randomized initial conditions and one set of controlled initial conditions, element size and number of distractors were identified as the most important factors controlling search accuracy, with distractor brightness, element shape, and spacing making secondary contributions. The resulting changes in this multidimensional stimulus space suggested the existence of a set of conditions that the bird repeatedly converged upon regardless of initial conditions. This psychological “attractor” represents the cumulative action of the cognitive operations used by the pigeon in solving and performing this search task. The results are discussed regarding their implications for visual cognition in pigeons and the usefulness of adaptive, subject-driven experimentation for investigating human and animal cognition more generally. PMID:24000905

  5. Binocular self-calibration performed via adaptive genetic algorithm based on laser line imaging

    NASA Astrophysics Data System (ADS)

    Apolinar Muñoz Rodríguez, J.; Mejía Alanís, Francisco Carlos

    2016-07-01

    An accurate technique to perform binocular self-calibration by means of an adaptive genetic algorithm based on a laser line is presented. In this calibration, the genetic algorithm computes the vision parameters through simulated binary crossover (SBX). To carry it out, the genetic algorithm constructs an objective function from the binocular geometry of the laser line projection. Then, the SBX minimizes the objective function via chromosomes recombination. In this algorithm, the adaptive procedure determines the search space via line position to obtain the minimum convergence. Thus, the chromosomes of vision parameters provide the minimization. The approach of the proposed adaptive genetic algorithm is to calibrate and recalibrate the binocular setup without references and physical measurements. This procedure leads to improve the traditional genetic algorithms, which calibrate the vision parameters by means of references and an unknown search space. It is because the proposed adaptive algorithm avoids errors produced by the missing of references. Additionally, the three-dimensional vision is carried out based on the laser line position and vision parameters. The contribution of the proposed algorithm is corroborated by an evaluation of accuracy of binocular calibration, which is performed via traditional genetic algorithms.

  6. Fireplace adapters

    SciTech Connect

    Hunt, R.L.

    1983-12-27

    An adapter is disclosed for use with a fireplace. The stove pipe of a stove standing in a room to be heated may be connected to the flue of the chimney so that products of combustion from the stove may be safely exhausted through the flue and outwardly of the chimney. The adapter may be easily installed within the fireplace by removing the damper plate and fitting the adapter to the damper frame. Each of a pair of bolts has a portion which hooks over a portion of the damper frame and a threaded end depending from the hook portion and extending through a hole in the adapter. Nuts are threaded on the bolts and are adapted to force the adapter into a tight fit with the adapter frame.

  7. Adaptive Assessment for Nonacademic Secondary Reading.

    ERIC Educational Resources Information Center

    Hittleman, Daniel R.

    Adaptive assessment procedures are a means of determining the quality of a reader's performance in a variety of reading situations and on a variety of written materials. Such procedures are consistent with the idea that there are functional competencies which change with the reading task. Adaptive assessment takes into account that a lack of…

  8. Adaptive management: Chapter 1

    USGS Publications Warehouse

    Allen, Craig R.; Garmestani, Ahjond S.; Allen, Craig R.; Garmestani, Ahjond S.

    2015-01-01

    Adaptive management is an approach to natural resource management that emphasizes learning through management where knowledge is incomplete, and when, despite inherent uncertainty, managers and policymakers must act. Unlike a traditional trial and error approach, adaptive management has explicit structure, including a careful elucidation of goals, identification of alternative management objectives and hypotheses of causation, and procedures for the collection of data followed by evaluation and reiteration. The process is iterative, and serves to reduce uncertainty, build knowledge and improve management over time in a goal-oriented and structured process.

  9. Feature Space Mapping as a universal adaptive system

    NASA Astrophysics Data System (ADS)

    Duch, Włodzisław; Diercksen, Geerd H. F.

    1995-06-01

    The most popular realizations of adaptive systems are based on the neural network type of algorithms, in particular feedforward multilayered perceptrons trained by backpropagation of error procedures. In this paper an alternative approach based on multidimensional separable localized functions centered at the data clusters is proposed. In comparison with the neural networks that use delocalized transfer functions this approach allows for full control of the basins of attractors of all stationary points. Slow learning procedures are replaced by the explicit construction of the landscape function followed by the optimization of adjustable parameters using gradient techniques or genetic algorithms. Retrieving information does not require searches in multidimensional subspaces but it is factorized into a series of one-dimensional searches. Feature Space Mapping is applicable to learning not only from facts but also from general laws and may be treated as a fuzzy expert system (neurofuzzy system). The number of nodes (fuzzy rules) is growing as the network creates new nodes for novel data but the search time is sublinear in the number of rules or data clusters stored. Such a system may work as a universal classificator, approximator and reasoning system. Examples of applications for the identification of spectra (classification), intelligent databases (association) and for the analysis of simple electrical circuits (expert system type) are given.

  10. Search and heuristics

    SciTech Connect

    Pearl, J.

    1983-01-01

    This work is comprised of articles which are representative of current research on search and heuristics. The general theme is the quest for understanding the workings of heuristic knowledge; how it is acquired, stored and used by people, how it can be represented and utilized by machines and what makes one heuristic succeed where others fail. Topics covered include the following: search and reasoning in problem solving; theory formation by heuristic search; the nature of heuristics II: background and examples; Eurisko: a program that learns new heuristics and domain concepts; the nature of heuristics III: program design and results; searching for an optimal path in a tree with random costs; search rearrangement backtracking and polynomial average time; consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics; general branch and bound formulation for understanding and synthesizing and/or tree search procedures; a minimax algorithm better than alpha-beta. yes and no; and pathology on game trees revisited, and an alternative to minimaxing.

  11. Optimal vehicle planning and the search tour problem

    NASA Astrophysics Data System (ADS)

    Wettergren, Thomas A.; Bays, Matthew J.

    2016-05-01

    We describe a problem of optimal planning for unmanned vehicles and illustrate two distinct procedures for its solution. The problem under consideration, which we refer to as the search tour problem, involves the determination of multi-stage plans for unmanned vehicles conducting search operations. These types of problems are important in situations where the searcher has varying performance in different regions throughout the domain due to environmental complexity. The ability to provide robust planning for unmanned systems under difficult environmental conditions is critical for their use in search operations. The problem we consider consists of searches with variable times for each of the stages, as well as an additional degree of freedom for each stage to select from one of a finite set of operational configurations. As each combination of configuration and stage time leads to a different performance level, there is a need to determine the optimal configuration of these stages. When the complexity of constraints on total time, as well as resources expended at each stage for a given configuration, are added, the problem becomes one of non-trivial search effort allocation and numerical methods of optimization are required. We show two solution approaches for this numerical optimization problem. The first solution technique is to use a mixed-integer linear programming formulation, for which commercially available solvers can find optimal solutions in a reasonable amount of time. We use this solution as a baseline and compare against a new inner/outer optimization formulation. This inner/outer optimization compares favorably to the baseline solution, but is also amenable to adaptation as the search operation progresses. Numerical examples illustrate the utility of the approach for unmanned vehicle search planning.

  12. Investigations in adaptive processing of multispectral data

    NASA Technical Reports Server (NTRS)

    Kriegler, F. J.; Horwitz, H. M.

    1973-01-01

    Adaptive data processing procedures are applied to the problem of classifying objects in a scene scanned by multispectral sensor. These procedures show a performance improvement over standard nonadaptive techniques. Some sources of error in classification are identified and those correctable by adaptive processing are discussed. Experiments in adaptation of signature means by decision-directed methods are described. Some of these methods assume correlation between the trajectories of different signature means; for others this assumption is not made.

  13. Adaptive SPECT

    PubMed Central

    Barrett, Harrison H.; Furenlid, Lars R.; Freed, Melanie; Hesterman, Jacob Y.; Kupinski, Matthew A.; Clarkson, Eric; Whitaker, Meredith K.

    2008-01-01

    Adaptive imaging systems alter their data-acquisition configuration or protocol in response to the image information received. An adaptive pinhole single-photon emission computed tomography (SPECT) system might acquire an initial scout image to obtain preliminary information about the radiotracer distribution and then adjust the configuration or sizes of the pinholes, the magnifications, or the projection angles in order to improve performance. This paper briefly describes two small-animal SPECT systems that allow this flexibility and then presents a framework for evaluating adaptive systems in general, and adaptive SPECT systems in particular. The evaluation is in terms of the performance of linear observers on detection or estimation tasks. Expressions are derived for the ideal linear (Hotelling) observer and the ideal linear (Wiener) estimator with adaptive imaging. Detailed expressions for the performance figures of merit are given, and possible adaptation rules are discussed. PMID:18541485

  14. Structured adaptive grid generation using algebraic methods

    NASA Technical Reports Server (NTRS)

    Yang, Jiann-Cherng; Soni, Bharat K.; Roger, R. P.; Chan, Stephen C.

    1993-01-01

    The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration

  15. Electronic Procedures for Medical Operations

    NASA Technical Reports Server (NTRS)

    2015-01-01

    Electronic procedures are replacing text-based documents for recording the steps in performing medical operations aboard the International Space Station. S&K Aerospace, LLC, has developed a content-based electronic system-based on the Extensible Markup Language (XML) standard-that separates text from formatting standards and tags items contained in procedures so they can be recognized by other electronic systems. For example, to change a standard format, electronic procedures are changed in a single batch process, and the entire body of procedures will have the new format. Procedures can be quickly searched to determine which are affected by software and hardware changes. Similarly, procedures are easily shared with other electronic systems. The system also enables real-time data capture and automatic bookmarking of current procedure steps. In Phase II of the project, S&K Aerospace developed a Procedure Representation Language (PRL) and tools to support the creation and maintenance of electronic procedures for medical operations. The goal is to develop these tools in such a way that new advances can be inserted easily, leading to an eventual medical decision support system.

  16. Adaptive Computing.

    ERIC Educational Resources Information Center

    Harrell, William

    1999-01-01

    Provides information on various adaptive technology resources available to people with disabilities. (Contains 19 references, an annotated list of 129 websites, and 12 additional print resources.) (JOW)

  17. Contour adaptation.

    PubMed

    Anstis, Stuart

    2013-01-01

    It is known that adaptation to a disk that flickers between black and white at 3-8 Hz on a gray surround renders invisible a congruent gray test disk viewed afterwards. This is contrast adaptation. We now report that adapting simply to the flickering circular outline of the disk can have the same effect. We call this "contour adaptation." This adaptation does not transfer interocularly, and apparently applies only to luminance, not color. One can adapt selectively to only some of the contours in a display, making only these contours temporarily invisible. For instance, a plaid comprises a vertical grating superimposed on a horizontal grating. If one first adapts to appropriate flickering vertical lines, the vertical components of the plaid disappears and it looks like a horizontal grating. Also, we simulated a Cornsweet (1970) edge, and we selectively adapted out the subjective and objective contours of a Kanisza (1976) subjective square. By temporarily removing edges, contour adaptation offers a new technique to study the role of visual edges, and it demonstrates how brightness information is concentrated in edges and propagates from them as it fills in surfaces.

  18. Adaptive EAGLE dynamic solution adaptation and grid quality enhancement

    NASA Technical Reports Server (NTRS)

    Luong, Phu Vinh; Thompson, J. F.; Gatlin, B.; Mastin, C. W.; Kim, H. J.

    1992-01-01

    In the effort described here, the elliptic grid generation procedure in the EAGLE grid code was separated from the main code into a subroutine, and a new subroutine which evaluates several grid quality measures at each grid point was added. The elliptic grid routine can now be called, either by a computational fluid dynamics (CFD) code to generate a new adaptive grid based on flow variables and quality measures through multiple adaptation, or by the EAGLE main code to generate a grid based on quality measure variables through static adaptation. Arrays of flow variables can be read into the EAGLE grid code for use in static adaptation as well. These major changes in the EAGLE adaptive grid system make it easier to convert any CFD code that operates on a block-structured grid (or single-block grid) into a multiple adaptive code.

  19. Foraging search: Prototypical intelligence

    NASA Astrophysics Data System (ADS)

    Mobus, George

    2000-05-01

    We think because we eat. Or as Descartes might have said, on a little more reflection, "I need to eat, therefore I think." Animals that forage for a living repeatedly face the problem of searching for a sparsely distributed resource in a vast space. Furthermore, the resource may occur sporadically and episodically under conditions of true uncertainty (nonstationary, complex and non-linear dynamics). I assert that this problem is the canonical problem solved by intelligence. It's solution is the basis for the evolution of more advanced intelligence in which the space of search includes that of concepts (objects and relations) encoded in cortical structures. In humans the conscious experience of searching through concept space we call thinking. The foraging search model is based upon a higher-order autopoeitic system (the forager) employing anticipatory processing to enhance its success at finding food while avoiding becoming food or having accidents in a hostile world. I present a semi-formal description of the general foraging search problem and an approach to its solution. The latter is a brain-like structure employing dynamically adaptive neurons. A physical robot, MAVRIC, embodies some principles of foraging. It learns cues that lead to improvements in finding targets in a dynamic and nonstationary environment. This capability is based on a unique learning mechanism that encodes causal relations in the neural-like processing element. An argument is advanced that searching for resources in the physical world, as per the foraging model, is a prototype for generalized search for conceptual resources as when we think. A problem represents a conceptual disturbance in a homeostatic sense. The finding of a solution restores the homeostatic balance. The establishment of links between conceptual cues and solutions (resources) and the later use of those cues to think through to solutions of quasi-isomorphic problems is, essentially, foraging for ideas. It is a quite

  20. Climate adaptation

    NASA Astrophysics Data System (ADS)

    Kinzig, Ann P.

    2015-03-01

    This paper is intended as a brief introduction to climate adaptation in a conference devoted otherwise to the physics of sustainable energy. Whereas mitigation involves measures to reduce the probability of a potential event, such as climate change, adaptation refers to actions that lessen the impact of climate change. Mitigation and adaptation differ in other ways as well. Adaptation does not necessarily have to be implemented immediately to be effective; it only needs to be in place before the threat arrives. Also, adaptation does not necessarily require global, coordinated action; many effective adaptation actions can be local. Some urban communities, because of land-use change and the urban heat-island effect, currently face changes similar to some expected under climate change, such as changes in water availability, heat-related morbidity, or changes in disease patterns. Concern over those impacts might motivate the implementation of measures that would also help in climate adaptation, despite skepticism among some policy makers about anthropogenic global warming. Studies of ancient civilizations in the southwestern US lends some insight into factors that may or may not be important to successful adaptation.

  1. Making a Library Catalog Adaptive.

    ERIC Educational Resources Information Center

    Buckland, Michael K.; And Others

    1992-01-01

    Describes the design of a prototype adaptive online catalog that was implemented as a transparent workstation-based front end system to MELVYL, the online catalog for the University of California libraries. Problems with searching bibliographic retrieval systems are reviewed, including irrelevant retrievals and the inexperience of most users.…

  2. Power Search.

    ERIC Educational Resources Information Center

    Haskin, David

    1997-01-01

    Compares six leading Web search engines (AltaVista, Excite, HotBot, Infoseek, Lycos, and Northern Light), looking at the breadth of their coverage, accuracy, and ease of use, and finds a clear favorite of the six. Includes tips that can improve search results. (AEF)

  3. Evolutionary pattern search algorithms

    SciTech Connect

    Hart, W.E.

    1995-09-19

    This paper defines a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties. This class of algorithms is closely related to evolutionary programming, evolutionary strategie and real-coded genetic algorithms. EPSAs are self-adapting systems that modify the step size of the mutation operator in response to the success of previous optimization steps. The rule used to adapt the step size can be used to provide a stationary point convergence theory for EPSAs on any continuous function. This convergence theory is based on an extension of the convergence theory for generalized pattern search methods. An experimental analysis of the performance of EPSAs demonstrates that these algorithms can perform a level of global search that is comparable to that of canonical EAs. We also describe a stopping rule for EPSAs, which reliably terminated near stationary points in our experiments. This is the first stopping rule for any class of EAs that can terminate at a given distance from stationary points.

  4. Procedural knowledge

    SciTech Connect

    Georgeff, M.P.; Lansky, A.L.

    1986-10-01

    Much of commonsense knowledge about the real world is in the form of procedures or sequences of actions for achieving particular goals. In this paper, a formalism is presented for representing such knowledge using the notion of process. A declarative semantics for the representation is given, which allows a user to state facts about the effects of doing things in the problem domain of interest. An operational semantics is also provided, which shows how this knowledge can be used to achieve particular goals or to form intentions regarding their achievement. Given both semantics, our formalism additionally serves as an executable specification language suitable for constructing complex systems. A system based on this formalism is described, and examples involving control of an autonomous robot and fault diagnosis for NASA's space shuttle are provided.

  5. Begin: Online Database Searching Now!

    ERIC Educational Resources Information Center

    Lodish, Erica K.

    1986-01-01

    Because of the increasing importance of online databases, school library media specialists are encouraged to introduce students to online searching. Four books that would help media specialists gain a basic background are reviewed and it is noted that although they are very technical, they can be adapted to individual needs. (EM)

  6. Application of Sequential Interval Estimation to Adaptive Mastery Testing

    ERIC Educational Resources Information Center

    Chang, Yuan-chin Ivan

    2005-01-01

    In this paper, we apply sequential one-sided confidence interval estimation procedures with beta-protection to adaptive mastery testing. The procedures of fixed-width and fixed proportional accuracy confidence interval estimation can be viewed as extensions of one-sided confidence interval procedures. It can be shown that the adaptive mastery…

  7. Toothbrush Adaptations.

    ERIC Educational Resources Information Center

    Exceptional Parent, 1987

    1987-01-01

    Suggestions are presented for helping disabled individuals learn to use or adapt toothbrushes for proper dental care. A directory lists dental health instructional materials available from various organizations. (CB)

  8. A Prototype Search Toolkit

    NASA Astrophysics Data System (ADS)

    Knepper, Margaret M.; Fox, Kevin L.; Frieder, Ophir

    Information overload is now a reality. We no longer worry about obtaining a sufficient volume of data; we now are concerned with sifting and understanding the massive volumes of data available to us. To do so, we developed an integrated information processing toolkit that provides the user with a variety of ways to view their information. The views include keyword search results, a domain specific ranking system that allows for adaptively capturing topic vocabularies to customize and focus the search results, navigation pages for browsing, and a geospatial and temporal component to visualize results in time and space, and provide “what if” scenario playing. Integrating the information from different tools and sources gives the user additional information and another way to analyze the data. An example of the integration is illustrated on reports of the avian influenza (bird flu).

  9. AN EFFICIENT AUTOMATED VALIDATION PROCEDURE FOR EXOPLANET TRANSIT CANDIDATES

    SciTech Connect

    Morton, Timothy D.

    2012-12-10

    Surveys searching for transiting exoplanets have found many more candidates than they have been able to confirm as true planets. This situation is especially acute with the Kepler survey, which has found over 2300 candidates but has to date confirmed only a small fraction of them as planets. I present here a general procedure that can quickly be applied to any planet candidate to calculate its false positive probability. This procedure takes into account the period, depth, duration, and shape of the signal; the colors of the target star; arbitrary spectroscopic or imaging follow-up observations; and informed assumptions about the populations and distributions of field stars and multiple-star properties. Applying these methods to a sample of known Kepler planets, I demonstrate that many signals can be validated with very limited follow-up observations: in most cases with only a spectrum and an adaptive optics image. Additionally, I demonstrate that this procedure can reliably identify false positive signals. Because of the computational efficiency of this analysis, it is feasible to apply it to all Kepler planet candidates in the near future, and it will streamline the follow-up efforts for Kepler and other current and future transit surveys.

  10. Adaptation of the pseudo-metal-oxide-semiconductor field effect transistor technique to ultrathin silicon-on-insulator wafers characterization: Improved set-up, measurement procedure, parameter extraction, and modeling

    NASA Astrophysics Data System (ADS)

    Van Den Daele, W.; Malaquin, C.; Baumel, N.; Kononchuk, O.; Cristoloveanu, S.

    2013-10-01

    This paper revisits and adapts of the pseudo-MOSFET (Ψ-MOSFET) characterization technique for advanced fully depleted silicon on insulator (FDSOI) wafers. We review the current challenges for standard Ψ-MOSFET set-up on ultra-thin body (12 nm) over ultra-thin buried oxide (25 nm BOX) and propose a novel set-up enabling the technique on FDSOI structures. This novel configuration embeds 4 probes with large tip radius (100-200 μm) and low pressure to avoid oxide damage. Compared with previous 4-point probe measurements, we introduce a simplified and faster methodology together with an adapted Y-function. The models for parameters extraction are revisited and calibrated through systematic measurements of SOI wafers with variable film thickness. We propose an in-depth analysis of the FDSOI structure through comparison of experimental data, TCAD (Technology Computed Aided Design) simulations, and analytical modeling. TCAD simulations are used to unify previously reported thickness-dependent analytical models by analyzing the BOX/substrate potential and the electrical field in ultrathin films. Our updated analytical models are used to explain the results and to extract correct electrical parameters such as low-field electron and hole mobility, subthreshold slope, and film/BOX interface traps density.

  11. Adaptive Development

    NASA Technical Reports Server (NTRS)

    2005-01-01

    The goal of this research is to develop and demonstrate innovative adaptive seal technologies that can lead to dramatic improvements in engine performance, life, range, and emissions, and enhance operability for next generation gas turbine engines. This work is concentrated on the development of self-adaptive clearance control systems for gas turbine engines. Researchers have targeted the high-pressure turbine (HPT) blade tip seal location for following reasons: Current active clearance control (ACC) systems (e.g., thermal case-cooling schemes) cannot respond to blade tip clearance changes due to mechanical, thermal, and aerodynamic loads. As such they are prone to wear due to the required tight running clearances during operation. Blade tip seal wear (increased clearances) reduces engine efficiency, performance, and service life. Adaptive sealing technology research has inherent impact on all envisioned 21st century propulsion systems (e.g. distributed vectored, hybrid and electric drive propulsion concepts).

  12. The SMART CLUSTER METHOD - adaptive earthquake cluster analysis and declustering

    NASA Astrophysics Data System (ADS)

    Schaefer, Andreas; Daniell, James; Wenzel, Friedemann

    2016-04-01

    Earthquake declustering is an essential part of almost any statistical analysis of spatial and temporal properties of seismic activity with usual applications comprising of probabilistic seismic hazard assessments (PSHAs) and earthquake prediction methods. The nature of earthquake clusters and subsequent declustering of earthquake catalogues plays a crucial role in determining the magnitude-dependent earthquake return period and its respective spatial variation. Various methods have been developed to address this issue from other researchers. These have differing ranges of complexity ranging from rather simple statistical window methods to complex epidemic models. This study introduces the smart cluster method (SCM), a new methodology to identify earthquake clusters, which uses an adaptive point process for spatio-temporal identification. Hereby, an adaptive search algorithm for data point clusters is adopted. It uses the earthquake density in the spatio-temporal neighbourhood of each event to adjust the search properties. The identified clusters are subsequently analysed to determine directional anisotropy, focussing on a strong correlation along the rupture plane and adjusts its search space with respect to directional properties. In the case of rapid subsequent ruptures like the 1992 Landers sequence or the 2010/2011 Darfield-Christchurch events, an adaptive classification procedure is applied to disassemble subsequent ruptures which may have been grouped into an individual cluster using near-field searches, support vector machines and temporal splitting. The steering parameters of the search behaviour are linked to local earthquake properties like magnitude of completeness, earthquake density and Gutenberg-Richter parameters. The method is capable of identifying and classifying earthquake clusters in space and time. It is tested and validated using earthquake data from California and New Zealand. As a result of the cluster identification process, each event in

  13. In Search of a Community College President.

    ERIC Educational Resources Information Center

    Libby, Patricia A.

    Designed for governing boards, search committee members, and aspiring community college presidents, this booklet examines different institutional procedures involved in the search for and selection of a community college president, and outlines relevant problems and issues that should be considered at various phases of the process. After…

  14. Organization of Distributed Adaptive Learning

    ERIC Educational Resources Information Center

    Vengerov, Alexander

    2009-01-01

    The growing sensitivity of various systems and parts of industry, society, and even everyday individual life leads to the increased volume of changes and needs for adaptation and learning. This creates a new situation where learning from being purely academic knowledge transfer procedure is becoming a ubiquitous always-on essential part of all…

  15. Adaptive Thresholds

    SciTech Connect

    Bremer, P. -T.

    2014-08-26

    ADAPT is a topological analysis code that allow to compute local threshold, in particular relevance based thresholds for features defined in scalar fields. The initial target application is vortex detection but the software is more generally applicable to all threshold based feature definitions.

  16. Superintendent Search.

    ERIC Educational Resources Information Center

    Boring, Michael R.

    This guide is intended to be a tool to help those involved in the superintendent selection process. Section titles reflect the guide's contents. "The Decision to Seek a Superintendent"; "The Case for Using a Search Consultant"; "Setting a Timeline"; "Involvement of Parents, Citizens, Students and Staff"; "Describing the Person Sought and the…

  17. Adaptive Units of Learning and Educational Videogames

    ERIC Educational Resources Information Center

    Moreno-Ger, Pablo; Thomas, Pilar Sancho; Martinez-Ortiz, Ivan; Sierra, Jose Luis; Fernandez-Manjon, Baltasar

    2007-01-01

    In this paper, we propose three different ways of using IMS Learning Design to support online adaptive learning modules that include educational videogames. The first approach relies on IMS LD to support adaptation procedures where the educational games are considered as Learning Objects. These games can be included instead of traditional content…

  18. Model Specification Searches Using Ant Colony Optimization Algorithms

    ERIC Educational Resources Information Center

    Marcoulides, George A.; Drezner, Zvi

    2003-01-01

    Ant colony optimization is a recently proposed heuristic procedure inspired by the behavior of real ants. This article applies the procedure to model specification searches in structural equation modeling and reports the results. The results demonstrate the capabilities of ant colony optimization algorithms for conducting automated searches.

  19. Connector adapter

    NASA Technical Reports Server (NTRS)

    Hacker, Scott C. (Inventor); Dean, Richard J. (Inventor); Burge, Scott W. (Inventor); Dartez, Toby W. (Inventor)

    2007-01-01

    An adapter for installing a connector to a terminal post, wherein the connector is attached to a cable, is presented. In an embodiment, the adapter is comprised of an elongated collet member having a longitudinal axis comprised of a first collet member end, a second collet member end, an outer collet member surface, and an inner collet member surface. The inner collet member surface at the first collet member end is used to engage the connector. The outer collet member surface at the first collet member end is tapered for a predetermined first length at a predetermined taper angle. The collet includes a longitudinal slot that extends along the longitudinal axis initiating at the first collet member end for a predetermined second length. The first collet member end is formed of a predetermined number of sections segregated by a predetermined number of channels and the longitudinal slot.

  20. Adaptive VFH

    NASA Astrophysics Data System (ADS)

    Odriozola, Iñigo; Lazkano, Elena; Sierra, Basi

    2011-10-01

    This paper investigates the improvement of the Vector Field Histogram (VFH) local planning algorithm for mobile robot systems. The Adaptive Vector Field Histogram (AVFH) algorithm has been developed to improve the effectiveness of the traditional VFH path planning algorithm overcoming the side effects of using static parameters. This new algorithm permits the adaptation of planning parameters for the different type of areas in an environment. Genetic Algorithms are used to fit the best VFH parameters to each type of sector and, afterwards, every section in the map is labelled with the sector-type which best represents it. The Player/Stage simulation platform has been chosen for making all sort of tests and to prove the new algorithm's adequateness. Even though there is still much work to be carried out, the developed algorithm showed good navigation properties and turned out to be softer and more effective than the traditional VFH algorithm.

  1. Adaptive sampler

    DOEpatents

    Watson, B.L.; Aeby, I.

    1980-08-26

    An adaptive data compression device for compressing data is described. The device has a frequency content, including a plurality of digital filters for analyzing the content of the data over a plurality of frequency regions, a memory, and a control logic circuit for generating a variable rate memory clock corresponding to the analyzed frequency content of the data in the frequency region and for clocking the data into the memory in response to the variable rate memory clock.

  2. Adaptive sampler

    DOEpatents

    Watson, Bobby L.; Aeby, Ian

    1982-01-01

    An adaptive data compression device for compressing data having variable frequency content, including a plurality of digital filters for analyzing the content of the data over a plurality of frequency regions, a memory, and a control logic circuit for generating a variable rate memory clock corresponding to the analyzed frequency content of the data in the frequency region and for clocking the data into the memory in response to the variable rate memory clock.

  3. Adaptive antennas

    NASA Astrophysics Data System (ADS)

    Barton, P.

    1987-04-01

    The basic principles of adaptive antennas are outlined in terms of the Wiener-Hopf expression for maximizing signal to noise ratio in an arbitrary noise environment; the analogy with generalized matched filter theory provides a useful aid to understanding. For many applications, there is insufficient information to achieve the above solution and thus non-optimum constrained null steering algorithms are also described, together with a summary of methods for preventing wanted signals being nulled by the adaptive system. The three generic approaches to adaptive weight control are discussed; correlation steepest descent, weight perturbation and direct solutions based on sample matrix conversion. The tradeoffs between hardware complexity and performance in terms of null depth and convergence rate are outlined. The sidelobe cancellor technique is described. Performance variation with jammer power and angular distribution is summarized and the key performance limitations identified. The configuration and performance characteristics of both multiple beam and phase scan array antennas are covered, with a brief discussion of performance factors.

  4. 47 CFR 80.1125 - Search and rescue coordinating communications.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Search and rescue coordinating communications...) Operating Procedures for Distress and Safety Communications § 80.1125 Search and rescue coordinating... responsible for controlling a search and rescue operation will also coordinate the distress traffic...

  5. 47 CFR 80.1125 - Search and rescue coordinating communications.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Search and rescue coordinating communications...) Operating Procedures for Distress and Safety Communications § 80.1125 Search and rescue coordinating... responsible for controlling a search and rescue operation will also coordinate the distress traffic...

  6. 25 CFR 11.306 - Search without a warrant.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 25 Indians 1 2011-04-01 2011-04-01 false Search without a warrant. 11.306 Section 11.306 Indians... ORDER CODE Criminal Procedure § 11.306 Search without a warrant. No law enforcement officer shall conduct any search without a valid warrant except: (a) Incident to making a lawful arrest; or (b) With...

  7. 25 CFR 11.306 - Search without a warrant.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Search without a warrant. 11.306 Section 11.306 Indians... ORDER CODE Criminal Procedure § 11.306 Search without a warrant. No law enforcement officer shall conduct any search without a valid warrant except: (a) Incident to making a lawful arrest; or (b) With...

  8. 25 CFR 11.306 - Search without a warrant.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 25 Indians 1 2013-04-01 2013-04-01 false Search without a warrant. 11.306 Section 11.306 Indians... ORDER CODE Criminal Procedure § 11.306 Search without a warrant. No law enforcement officer shall conduct any search without a valid warrant except: (a) Incident to making a lawful arrest; or (b) With...

  9. 47 CFR 80.1125 - Search and rescue coordinating communications.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Search and rescue coordinating communications...) Operating Procedures for Distress and Safety Communications § 80.1125 Search and rescue coordinating... responsible for controlling a search and rescue operation will also coordinate the distress traffic...

  10. 25 CFR 11.306 - Search without a warrant.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 25 Indians 1 2012-04-01 2011-04-01 true Search without a warrant. 11.306 Section 11.306 Indians... ORDER CODE Criminal Procedure § 11.306 Search without a warrant. No law enforcement officer shall conduct any search without a valid warrant except: (a) Incident to making a lawful arrest; or (b) With...

  11. 25 CFR 11.306 - Search without a warrant.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 25 Indians 1 2014-04-01 2014-04-01 false Search without a warrant. 11.306 Section 11.306 Indians... ORDER CODE Criminal Procedure § 11.306 Search without a warrant. No law enforcement officer shall conduct any search without a valid warrant except: (a) Incident to making a lawful arrest; or (b) With...

  12. [Adaptive clinical study methodologies in drug development].

    PubMed

    Antal, János

    2015-11-29

    The evolution of drug development in human, clinical phase studies triggers the overview of those technologies and procedures which are labelled as adaptive clinical trials. The most relevant procedural and operational aspects will be discussed in this overview from points of view of clinico-methodological aspect.

  13. Evaluating Content Alignment in Computerized Adaptive Testing

    ERIC Educational Resources Information Center

    Wise, Steven L.; Kingsbury, G. Gage; Webb, Norman L.

    2015-01-01

    The alignment between a test and the content domain it measures represents key evidence for the validation of test score inferences. Although procedures have been developed for evaluating the content alignment of linear tests, these procedures are not readily applicable to computerized adaptive tests (CATs), which require large item pools and do…

  14. Adaptive sequential testing for multiple comparisons.

    PubMed

    Gao, Ping; Liu, Lingyun; Mehta, Cyrus

    2014-01-01

    We propose a Markov process theory-based adaptive sequential testing procedure for multiple comparisons. The procedure can be used for confirmative trials involving multi-comparisons, including dose selection or population enrichment. Dose or subpopulation selection and sample size modification can be made at any interim analysis. Type I error control is exact. PMID:24926848

  15. Higgs Searches

    SciTech Connect

    Peters, Krisztian

    2009-11-01

    We present the status and prospects of Higgs searches at the Tevatron and the LHC. Results from the Tevatron are using up to 5 fb{sup -} of data collected with the CDF and D0 detectors. The major contributing processes include associated production (WH {yields} l{nu}bb, ZH {yields} {nu}{nu}bb, ZH {yields} llbb) and gluon fusion (gg {yields} H {yields} WW{sup (*)}). Improvements across the full mass range resulting from the larger data sets, improved analyses techniques and increased signal acceptance are discussed. Recent results exclude the SM Higgs boson in a mass range of 160 < m{sub H} < 170 GeV. Searches for the neutral MSSM Higgs boson in the region 90 < m{sub A} < 200 GeV exclude tan {beta} values down to 30 for several benchmark scenarios.

  16. Adaptive Sampling in Hierarchical Simulation

    SciTech Connect

    Knap, J; Barton, N R; Hornung, R D; Arsenlis, A; Becker, R; Jefferson, D R

    2007-07-09

    We propose an adaptive sampling methodology for hierarchical multi-scale simulation. The method utilizes a moving kriging interpolation to significantly reduce the number of evaluations of finer-scale response functions to provide essential constitutive information to a coarser-scale simulation model. The underlying interpolation scheme is unstructured and adaptive to handle the transient nature of a simulation. To handle the dynamic construction and searching of a potentially large set of finer-scale response data, we employ a dynamic metric tree database. We study the performance of our adaptive sampling methodology for a two-level multi-scale model involving a coarse-scale finite element simulation and a finer-scale crystal plasticity based constitutive law.

  17. Adaptive optics imaging of the retina.

    PubMed

    Battu, Rajani; Dabir, Supriya; Khanna, Anjani; Kumar, Anupama Kiran; Roy, Abhijit Sinha

    2014-01-01

    Adaptive optics is a relatively new tool that is available to ophthalmologists for study of cellular level details. In addition to the axial resolution provided by the spectral-domain optical coherence tomography, adaptive optics provides an excellent lateral resolution, enabling visualization of the photoreceptors, blood vessels and details of the optic nerve head. We attempt a mini review of the current role of adaptive optics in retinal imaging. PubMed search was performed with key words Adaptive optics OR Retina OR Retinal imaging. Conference abstracts were searched from the Association for Research in Vision and Ophthalmology (ARVO) and American Academy of Ophthalmology (AAO) meetings. In total, 261 relevant publications and 389 conference abstracts were identified.

  18. Adaptive optics imaging of the retina

    PubMed Central

    Battu, Rajani; Dabir, Supriya; Khanna, Anjani; Kumar, Anupama Kiran; Roy, Abhijit Sinha

    2014-01-01

    Adaptive optics is a relatively new tool that is available to ophthalmologists for study of cellular level details. In addition to the axial resolution provided by the spectral-domain optical coherence tomography, adaptive optics provides an excellent lateral resolution, enabling visualization of the photoreceptors, blood vessels and details of the optic nerve head. We attempt a mini review of the current role of adaptive optics in retinal imaging. PubMed search was performed with key words Adaptive optics OR Retina OR Retinal imaging. Conference abstracts were searched from the Association for Research in Vision and Ophthalmology (ARVO) and American Academy of Ophthalmology (AAO) meetings. In total, 261 relevant publications and 389 conference abstracts were identified. PMID:24492503

  19. 44 CFR 208.52 - Reimbursement procedures.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Reimbursement procedures. 208.52 Section 208.52 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND SECURITY DISASTER ASSISTANCE NATIONAL URBAN SEARCH AND RESCUE RESPONSE SYSTEM Reimbursement Claims and Appeals § 208.52...

  20. Adaptation of the Illness Trajectory Theory to Describe the Work of Transitional Cancer Survivorship

    PubMed Central

    Klimmek, Rachel; Wenzel, Jennifer

    2013-01-01

    Purpose/Objectives Although frameworks for understanding survivorship continue to evolve, most are abstract and do not address the complex context of survivors’ transition following treatment completion. The purpose of this theory adaptation was to examine and refine the Illness Trajectory Theory, which describes the work of managing chronic illness, to address transitional cancer survivorship. Data Sources CINAHL, PubMed, and relevant Institute of Medicine reports were searched for survivors’ experiences during the year following treatment. Data Synthesis Using an abstraction tool, sixty-eight articles were selected from the initial search (N>700). Abstracted data were placed into a priori categories refined according to recommended procedures for theory derivation, followed by expert review. Conclusions Derivation resulted in a framework describing “the work of transitional cancer survivorship” (TCS work). TCS work is defined as survivor tasks, performed alone or with others, to carry out a plan of action for managing one or more aspects of life following primary cancer treatment. Theoretically, survivors engage in 3 reciprocally-interactive lines of work: (1) illness-related; (2) biographical; and (3) everyday life work. Adaptation resulted in refinement of these domains and the addition of survivorship care planning under “illness-related work”. Implications for Nursing Understanding this process of work may allow survivors/co-survivors to better prepare for the post-treatment period. This adaptation provides a framework for future testing and development. Validity and utility of this framework within specific survivor populations should also be explored. PMID:23107863

  1. A search for radiative neutrino decay from supernovae

    NASA Technical Reports Server (NTRS)

    Miller, Richard S.; Svoboda, Robert C.

    1993-01-01

    This document presents the data analysis procedures proposed for use with the COMPTEL instrument aboard the Compton Gamma Ray Observatory (GRO) in the search for radiative neutrino decay from supernovae. The proposed analysis methodology is an extension of a standard procedure used by the COMPTEL team in searching for a variety of source types. We have applied the procedures to a set of simulated data to demonstrate the feasibility of the method to this project.

  2. Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

    NASA Technical Reports Server (NTRS)

    Biswas, Rupak; Strawn, Roger C.; Chancellor, Marisa K. (Technical Monitor)

    1997-01-01

    This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

  3. Adaptive and Adaptable Automation Design: A Critical Review of the Literature and Recommendations for Future Research

    NASA Technical Reports Server (NTRS)

    Prinzel, Lawrence J., III; Kaber, David B.

    2006-01-01

    This report presents a review of literature on approaches to adaptive and adaptable task/function allocation and adaptive interface technologies for effective human management of complex systems that are likely to be issues for the Next Generation Air Transportation System, and a focus of research under the Aviation Safety Program, Integrated Intelligent Flight Deck Project. Contemporary literature retrieved from an online database search is summarized and integrated. The major topics include the effects of delegation-type, adaptable automation on human performance, workload and situation awareness, the effectiveness of various automation invocation philosophies and strategies to function allocation in adaptive systems, and the role of user modeling in adaptive interface design and the performance implications of adaptive interface technology.

  4. Adaptive interface for personalizing information seeking.

    PubMed

    Narayanan, S; Koppaka, Lavanya; Edala, Narasimha; Loritz, Don; Daley, Raymond

    2004-12-01

    An adaptive interface autonomously adjusts its display and available actions to current goals and abilities of the user by assessing user status, system task, and the context. Knowledge content adaptability is needed for knowledge acquisition and refinement tasks. In the case of knowledge content adaptability, the requirements of interface design focus on the elicitation of information from the user and the refinement of information based on patterns of interaction. In such cases, the emphasis on adaptability is on facilitating information search and knowledge discovery. In this article, we present research on adaptive interfaces that facilitates personalized information seeking from a large data warehouse. The resulting proof-of-concept system, called source recommendation system (SRS), assists users in locating and navigating data sources in the repository. Based on the initial user query and an analysis of the content of the search results, the SRS system generates a profile of the user tailored to the individual's context during information seeking. The user profiles are refined successively and are used in progressively guiding the user to the appropriate set of sources within the knowledge base. The SRS system is implemented as an Internet browser plug-in to provide a seamless and unobtrusive, personalized experience to the users during the information search process. The rationale behind our approach, system design, empirical evaluation, and implications for research on adaptive interfaces are described in this paper.

  5. Interrupted Visual Searches Reveal Volatile Search Memory

    ERIC Educational Resources Information Center

    Shen, Y. Jeremy; Jiang, Yuhong V.

    2006-01-01

    This study investigated memory from interrupted visual searches. Participants conducted a change detection search task on polygons overlaid on scenes. Search was interrupted by various disruptions, including unfilled delay, passive viewing of other scenes, and additional search on new displays. Results showed that performance was unaffected by…

  6. Web Search Engines: Search Syntax and Features.

    ERIC Educational Resources Information Center

    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)

  7. Analyzing Hedges in Verbal Communication: An Adaptation-Based Approach

    ERIC Educational Resources Information Center

    Wang, Yuling

    2010-01-01

    Based on Adaptation Theory, the article analyzes the production process of hedges. The procedure consists of the continuous making of choices in linguistic forms and communicative strategies. These choices are made just for adaptation to the contextual correlates. Besides, the adaptation process is dynamic, intentional and bidirectional.

  8. Structured programming: Principles, notation, procedure

    NASA Technical Reports Server (NTRS)

    JOST

    1978-01-01

    Structured programs are best represented using a notation which gives a clear representation of the block encapsulation. In this report, a set of symbols which can be used until binding directives are republished is suggested. Structured programming also allows a new method of procedure for design and testing. Programs can be designed top down, that is, they can start at the highest program plane and can penetrate to the lowest plane by step-wise refinements. The testing methodology also is adapted to this procedure. First, the highest program plane is tested, and the programs which are not yet finished in the next lower plane are represented by so-called dummies. They are gradually replaced by the real programs.

  9. Design procedures for compressor blades

    NASA Technical Reports Server (NTRS)

    Starken, H.

    1983-01-01

    The conventional methods for the design of the blades in the case of axial turbomachines are considered, taking into account difficulties concerning the determination of optimal blade profiles. These difficulties have been partly overcome as a consequence of the introduction of new numerical methods during the last few years. It is pointed out that, in the case of the subsonic range, a new procedure is now available for the determination of the form of blade profile on the basis of a given velocity distribution on the profile surface. The search for a profile form with favorable characteristics is consequently transformed into a search for a favorable velocity or pressure distribution on the blade. The distribution of velocities depends to a large degree on the characteristics of the profile boundary layers. The considered concept is not new. However, its practical implementation has only recently become possible. The employment of the new design procedure is illustrated with the aid of an example involving a concrete design problem.

  10. 20 CFR 655.1293 - Special procedures.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... FOREIGN WORKERS IN THE UNITED STATES Labor Certification Process for Temporary Agricultural Employment in... sheepherders in the Western States (and adaptation of such procedures to occupations in the range production of... employers for the certification of employment of nonimmigrant workers in agricultural......

  11. 20 CFR 655.1293 - Special procedures.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... FOREIGN WORKERS IN THE UNITED STATES Labor Certification Process for Temporary Agricultural Employment in... sheepherders in the Western States (and adaptation of such procedures to occupations in the range production of... employers for the certification of employment of nonimmigrant workers in agricultural......

  12. 20 CFR 655.102 - Special procedures.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... flexibility in carrying out the Secretary's responsibilities under the Immigration and Nationality Act (INA... FOREIGN WORKERS IN THE UNITED STATES Labor Certification Process for Temporary Agricultural Employment in... Western States (and adaptation of such procedures to occupations in the range production of......

  13. 20 CFR 655.102 - Special procedures.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... flexibility in carrying out the Secretary's responsibilities under the Immigration and Nationality Act (INA... FOREIGN WORKERS IN THE UNITED STATES Labor Certification Process for Temporary Agricultural Employment in... Western States (and adaptation of such procedures to occupations in the range production of......

  14. Cognitive adaptation to nonmelanoma skin cancer.

    PubMed

    Czajkowska, Zofia; Radiotis, George; Roberts, Nicole; Körner, Annett

    2013-01-01

    Taylor's (1983) cognitive adaptation theory posits that when people go through life transitions, such as being diagnosed with a chronic disease, they adjust to their new reality. The adjustment process revolves around three themes: search for positive meaning in the experience or optimism, attempt to regain a sense of mastery in life, as well as an effort to enhance self-esteem. In the sample of 57 patients with nonmelanoma skin cancer the Cognitive Adaptation Index successfully predicted participants' distress (p < .001) accounting for 60% of the variance and lending support for the Taylor's theory of cognitive adaptation in this population.

  15. Cognitive adaptation to nonmelanoma skin cancer.

    PubMed

    Czajkowska, Zofia; Radiotis, George; Roberts, Nicole; Körner, Annett

    2013-01-01

    Taylor's (1983) cognitive adaptation theory posits that when people go through life transitions, such as being diagnosed with a chronic disease, they adjust to their new reality. The adjustment process revolves around three themes: search for positive meaning in the experience or optimism, attempt to regain a sense of mastery in life, as well as an effort to enhance self-esteem. In the sample of 57 patients with nonmelanoma skin cancer the Cognitive Adaptation Index successfully predicted participants' distress (p < .001) accounting for 60% of the variance and lending support for the Taylor's theory of cognitive adaptation in this population. PMID:23844920

  16. Perceptual adaptation helps us identify faces.

    PubMed

    Rhodes, Gillian; Watson, Tamara L; Jeffery, Linda; Clifford, Colin W G

    2010-05-12

    Adaptation is a fundamental property of perceptual processing. In low-level vision, it can calibrate perception to current inputs, increasing coding efficiency and enhancing discrimination around the adapted level. Adaptation also occurs in high-level vision, as illustrated by face aftereffects. However, the functional consequences of face adaptation remain uncertain. Here we investigated whether adaptation can enhance identification performance for faces from an adapted, relative to an unadapted, population. Five minutes of adaptation to an average Asian or Caucasian face reduced identification thresholds for faces from the adapted relative to the unadapted race. We replicated this interaction in two studies, using different participants, faces and adapting procedures. These results suggest that adaptation has a functional role in high-level, as well as low-level, visual processing. We suggest that adaptation to the average of a population may reduce responses to common properties shared by all members of the population, effectively orthogonalizing identity vectors in a multi-dimensional face space and freeing neural resources to code distinctive properties, which are useful for identification.

  17. Search-based optimization.

    PubMed

    Wheeler, Ward C

    2003-08-01

    The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. PMID:14531408

  18. Search-based optimization

    NASA Technical Reports Server (NTRS)

    Wheeler, Ward C.

    2003-01-01

    The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

  19. Calibration processes in desert ant navigation: vector courses and systematic search.

    PubMed

    Wehner, R; Gallizzi, K; Frei, C; Vesely, M

    2002-10-01

    This study investigates the ability of desert ants to adapt their path integration system to an "open-jaw" training paradigm, in which the point of arrival (from the nest) does not coincide with the point of departure (to the nest). Upon departure the ants first run off their home vector and then start a systematic search for the nest. Even if they are subjected to this training-around-a-circuit procedure for more than 50 times in succession, they never adopt straight homeward courses towards the nest. Their path integration vector gets slightly recalibrated (pointing a bit closer to the nest), and their search pattern gets asymmetric (with its search density peak shifted towards the nest), but the bipartite structure of the inbound trajectory invariably remains. These results suggest (1). that the ants cannot learn separate inbound and outbound vectors (i.e. vectors that are not 180 degrees reversals of each other), (2). that the recalibrated vector is dominated by the ant's outbound course, (3). that the recalibration of the vector and the modification of the search geometry are fast and flexible processes occurring whenever the ant experiences a mismatch between the stored and actual states of its path integrator.

  20. Linearly-Constrained Adaptive Signal Processing Methods

    NASA Astrophysics Data System (ADS)

    Griffiths, Lloyd J.

    1988-01-01

    In adaptive least-squares estimation problems, a desired signal d(n) is estimated using a linear combination of L observation values samples xi (n), x2(n), . . . , xL-1(n) and denoted by the vector X(n). The estimate is formed as the inner product of this vector with a corresponding L-dimensional weight vector W. One particular weight vector of interest is Wopt which minimizes the mean-square between d(n) and the estimate. In this context, the term `mean-square difference' is a quadratic measure such as statistical expectation or time average. The specific value of W which achieves the minimum is given by the prod-uct of the inverse data covariance matrix and the cross-correlation between the data vector and the desired signal. The latter is often referred to as the P-vector. For those cases in which time samples of both the desired and data vector signals are available, a variety of adaptive methods have been proposed which will guarantee that an iterative weight vector Wa(n) converges (in some sense) to the op-timal solution. Two which have been extensively studied are the recursive least-squares (RLS) method and the LMS gradient approximation approach. There are several problems of interest in the communication and radar environment in which the optimal least-squares weight set is of interest and in which time samples of the desired signal are not available. Examples can be found in array processing in which only the direction of arrival of the desired signal is known and in single channel filtering where the spectrum of the desired response is known a priori. One approach to these problems which has been suggested is the P-vector algorithm which is an LMS-like approximate gradient method. Although it is easy to derive the mean and variance of the weights which result with this algorithm, there has never been an identification of the corresponding underlying error surface which the procedure searches. The purpose of this paper is to suggest an alternative

  1. Hybrid and adaptive meta-model-based global optimization

    NASA Astrophysics Data System (ADS)

    Gu, J.; Li, G. Y.; Dong, Z.

    2012-01-01

    As an efficient and robust technique for global optimization, meta-model-based search methods have been increasingly used in solving complex and computation intensive design optimization problems. In this work, a hybrid and adaptive meta-model-based global optimization method that can automatically select appropriate meta-modelling techniques during the search process to improve search efficiency is introduced. The search initially applies three representative meta-models concurrently. Progress towards a better performing model is then introduced by selecting sample data points adaptively according to the calculated values of the three meta-models to improve modelling accuracy and search efficiency. To demonstrate the superior performance of the new algorithm over existing search methods, the new method is tested using various benchmark global optimization problems and applied to a real industrial design optimization example involving vehicle crash simulation. The method is particularly suitable for design problems involving computation intensive, black-box analyses and simulations.

  2. Searching the PASCAL database - A user's perspective

    NASA Technical Reports Server (NTRS)

    Jack, Robert F.

    1989-01-01

    The operation of PASCAL, a bibliographic data base covering broad subject areas in science and technology, is discussed. The data base includes information from about 1973 to the present, including topics in engineering, chemistry, physics, earth science, environmental science, biology, psychology, and medicine. Data from 1986 to the present may be searched using DIALOG. The procedures and classification codes for searching PASCAL are presented. Examples of citations retrieved from the data base are given and suggestions are made concerning when to use PASCAL.

  3. Designing Flightdeck Procedures

    NASA Technical Reports Server (NTRS)

    Barshi, Immanuel; Mauro, Robert; Degani, Asaf; Loukopoulou, Loukia

    2016-01-01

    The primary goal of this document is to provide guidance on how to design, implement, and evaluate flight deck procedures. It provides a process for developing procedures that meet clear and specific requirements. This document provides a brief overview of: 1) the requirements for procedures, 2) a process for the design of procedures, and 3) a process for the design of checklists. The brief overview is followed by amplified procedures that follow the above steps and provide details for the proper design, implementation and evaluation of good flight deck procedures and checklists.

  4. Computerized procedures system

    DOEpatents

    Lipner, Melvin H.; Mundy, Roger A.; Franusich, Michael D.

    2010-10-12

    An online data driven computerized procedures system that guides an operator through a complex process facility's operating procedures. The system monitors plant data, processes the data and then, based upon this processing, presents the status of the current procedure step and/or substep to the operator. The system supports multiple users and a single procedure definition supports several interface formats that can be tailored to the individual user. Layered security controls access privileges and revisions are version controlled. The procedures run on a server that is platform independent of the user workstations that the server interfaces with and the user interface supports diverse procedural views.

  5. Adaptive Confidence Bands for Nonparametric Regression Functions

    PubMed Central

    Cai, T. Tony; Low, Mark; Ma, Zongming

    2014-01-01

    A new formulation for the construction of adaptive confidence bands in non-parametric function estimation problems is proposed. Confidence bands are constructed which have size that adapts to the smoothness of the function while guaranteeing that both the relative excess mass of the function lying outside the band and the measure of the set of points where the function lies outside the band are small. It is shown that the bands adapt over a maximum range of Lipschitz classes. The adaptive confidence band can be easily implemented in standard statistical software with wavelet support. Numerical performance of the procedure is investigated using both simulated and real datasets. The numerical results agree well with the theoretical analysis. The procedure can be easily modified and used for other nonparametric function estimation models. PMID:26269661

  6. 'Net Search Strategies.

    ERIC Educational Resources Information Center

    Bell, Suzanne S.

    1997-01-01

    Provides strategies for effective Internet searches. Categorizes queries into four types and describes tools: subject lists; indexes/directories; keyword search engines; Usenet newsgroups; and special purpose search tools. Discusses the importance of deciphering information and adjusting to changes. (AEF)

  7. Regional adaptation of a dynamic global vegetation model using a remote sensing data derived land cover map of Russia

    NASA Astrophysics Data System (ADS)

    Khvostikov, S.; Venevsky, S.; Bartalev, S.

    2015-12-01

    The dynamic global vegetation model (DGVM) SEVER has been regionally adapted using a remote sensing data-derived land cover map in order to improve the reconstruction conformity of the distribution of vegetation functional types over Russia. The SEVER model was modified to address noticeable divergences between modelling results and the land cover map. The model modification included a light competition method elaboration and the introduction of a tundra class into the model. The rigorous optimisation of key model parameters was performed using a two-step procedure. First, an approximate global optimum was found using the efficient global optimisation (EGO) algorithm, and afterwards a local search in the vicinity of the approximate optimum was performed using the quasi-Newton algorithm BFGS. The regionally adapted model shows a significant improvement of the vegetation distribution reconstruction over Russia with better matching with the satellite-derived land cover map, which was confirmed by both a visual comparison and a formal conformity criterion.

  8. Adaptive Behavior for Mobile Robots

    NASA Technical Reports Server (NTRS)

    Huntsberger, Terrance

    2009-01-01

    The term "System for Mobility and Access to Rough Terrain" (SMART) denotes a theoretical framework, a control architecture, and an algorithm that implements the framework and architecture, for enabling a land-mobile robot to adapt to changing conditions. SMART is intended to enable the robot to recognize adverse terrain conditions beyond its optimal operational envelope, and, in response, to intelligently reconfigure itself (e.g., adjust suspension heights or baseline distances between suspension points) or adapt its driving techniques (e.g., engage in a crabbing motion as a switchback technique for ascending steep terrain). Conceived for original application aboard Mars rovers and similar autonomous or semi-autonomous mobile robots used in exploration of remote planets, SMART could also be applied to autonomous terrestrial vehicles to be used for search, rescue, and/or exploration on rough terrain.

  9. Research in digital adaptive flight controllers

    NASA Technical Reports Server (NTRS)

    Kaufman, H.

    1976-01-01

    A design study of adaptive control logic suitable for implementation in modern airborne digital flight computers was conducted. Both explicit controllers which directly utilize parameter identification and implicit controllers which do not require identification were considered. Extensive analytical and simulation efforts resulted in the recommendation of two explicit digital adaptive flight controllers. Interface weighted least squares estimation procedures with control logic were developed using either optimal regulator theory or with control logic based upon single stage performance indices.

  10. Auto-adaptive finite element meshes

    NASA Technical Reports Server (NTRS)

    Richter, Roland; Leyland, Penelope

    1995-01-01

    Accurate capturing of discontinuities within compressible flow computations is achieved by coupling a suitable solver with an automatic adaptive mesh algorithm for unstructured triangular meshes. The mesh adaptation procedures developed rely on non-hierarchical dynamical local refinement/derefinement techniques, which hence enable structural optimization as well as geometrical optimization. The methods described are applied for a number of the ICASE test cases are particularly interesting for unsteady flow simulations.

  11. ADAPTATION AND ADAPTABILITY, THE BELLEFAIRE FOLLOWUP STUDY.

    ERIC Educational Resources Information Center

    ALLERHAND, MELVIN E.; AND OTHERS

    A RESEARCH TEAM STUDIED INFLUENCES, ADAPTATION, AND ADAPTABILITY IN 50 POORLY ADAPTING BOYS AT BELLEFAIRE, A REGIONAL CHILD CARE CENTER FOR EMOTIONALLY DISTURBED CHILDREN. THE TEAM ATTEMPTED TO GAUGE THE SUCCESS OF THE RESIDENTIAL TREATMENT CENTER IN TERMS OF THE PSYCHOLOGICAL PATTERNS AND ROLE PERFORMANCES OF THE BOYS DURING INDIVIDUAL CASEWORK…

  12. Choice in a Successive-Encounters Procedure and Hyperbolic Decay of Reinforcement

    ERIC Educational Resources Information Center

    Mazur, James E.

    2007-01-01

    Pigeons responded in a successive-encounters procedure that consisted of a search state, a choice state, and a handling state. The search state was either a fixed-interval or mixed-interval schedule presented on the center key of a three-key chamber. Upon completion of the search state, the choice state was presented, in which the center key was…

  13. Public Sector Impasse Procedures.

    ERIC Educational Resources Information Center

    Vadakin, James C.

    The subject of collective bargaining negotiation impasse procedures in the public sector, which includes public school systems, is a broad one. In this speech, the author introduces the various procedures, explains how they are used, and lists their advantages and disadvantages. Procedures discussed are mediation, fact-finding, arbitration,…

  14. 49 CFR 572.142 - Head assembly and test procedure.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 49 Transportation 7 2010-10-01 2010-10-01 false Head assembly and test procedure. 572.142 Section...-year-Old Child Crash Test Dummy, Alpha Version § 572.142 Head assembly and test procedure. (a) The head assembly (refer to § 572.140(a)(1)(i)) for this test consists of the head (drawing 210-1000), adapter...

  15. 49 CFR 572.142 - Head assembly and test procedure.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 49 Transportation 7 2013-10-01 2013-10-01 false Head assembly and test procedure. 572.142 Section...-year-Old Child Crash Test Dummy, Alpha Version § 572.142 Head assembly and test procedure. (a) The head assembly (refer to § 572.140(a)(1)(i)) for this test consists of the head (drawing 210-1000), adapter...

  16. 49 CFR 572.142 - Head assembly and test procedure.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 49 Transportation 7 2011-10-01 2011-10-01 false Head assembly and test procedure. 572.142 Section...-year-Old Child Crash Test Dummy, Alpha Version § 572.142 Head assembly and test procedure. (a) The head assembly (refer to § 572.140(a)(1)(i)) for this test consists of the head (drawing 210-1000), adapter...

  17. Evaluation of the CATSIB DIF Procedure in a Pretest Setting

    ERIC Educational Resources Information Center

    Nandakumar, Ratna; Roussos, Louis

    2004-01-01

    A new procedure, CATSIB, for assessing differential item functioning (DIF) on computerized adaptive tests (CATs) is proposed. CATSIB, a modified SIBTEST procedure, matches test takers on estimated ability and controls for impact-induced Type 1 error inflation by employing a CAT version of the IBTEST "regression correction." The performance of…

  18. Developing policies and procedures.

    PubMed

    Randolph, Susan A

    2006-11-01

    The development of policies and procedures is an integral part of the occupational health nurse's role. Policies and procedures serve as the foundation for the occupational health service and are based on its vision, mission, culture, and values. The design and layout selected for the policies and procedures should be simple, consistent, and easy to use. The same format should be used for all existing and new policies and procedures. Policies and procedures should be reviewed periodically based on a specified time frame (i.e., annually). However, some policies may require a more frequent review if they involve rapidly changing external standards, ethical issues, or emerging exposures. PMID:17124968

  19. Intestinal adaptation after massive intestinal resection

    PubMed Central

    Weale, A; Edwards, A; Bailey, M; Lear, P

    2005-01-01

    Patients with short bowel syndrome require long term parenteral nutrition support. However, after massive intestinal resection the intestine undergoes adaptation and nutritional autonomy may be obtained. Given that the complications of parenteral nutrition may be life threatening or result in treatment failure and the need for intestinal transplantation, a more attractive option is to wean patients off nutrition support by optimising the adaptive process. The article examines the evidence that after extensive small bowel resection adaptation occurs in humans and focuses on the factors that influence adaptation and the strategies that have been used to optimise this process. The review is based on an English language Medline search with secondary references obtained from key articles. There is evidence that adaptation occurs in humans. Adaptation is a complex process that results in response to nutrient and non-nutrient stimuli. Successful and reproducible strategies to improve adaptation remain elusive despite an abundance of experimental data. Nevertheless given the low patient survival and quality of life associated with other treatments for irreversible intestinal failure it is imperative that clinical research continues into the optimisation of the adaptation. PMID:15749794

  20. Online Database Searching Workbook.

    ERIC Educational Resources Information Center

    Littlejohn, Alice C.; Parker, Joan M.

    Designed primarily for use by first-time searchers, this workbook provides an overview of online searching. Following a brief introduction which defines online searching, databases, and database producers, five steps in carrying out a successful search are described: (1) identifying the main concepts of the search statement; (2) selecting a…

  1. Online Search Optimization.

    ERIC Educational Resources Information Center

    Homan, Michael; Worley, Penny

    This course syllabus describes methods for optimizing online searching, using as an example searching on the National Library of Medicine (NLM) online system. Four major activities considered are the online interview, query analysis and search planning, online interaction, and post-search analysis. Within the context of these activities, concepts…

  2. Search Alternatives and Beyond

    ERIC Educational Resources Information Center

    Bell, Steven J.

    2006-01-01

    Internet search has become a routine computing activity, with regular visits to a search engine--usually Google--the norm for most people. The vast majority of searchers, as recent studies of Internet search behavior reveal, search only in the most basic of ways and fail to avail themselves of options that could easily and effortlessly improve…

  3. Multimedia Web Searching Trends.

    ERIC Educational Resources Information Center

    Ozmutlu, Seda; Spink, Amanda; Ozmutlu, H. Cenk

    2002-01-01

    Examines and compares multimedia Web searching by Excite and FAST search engine users in 2001. Highlights include audio and video queries; time spent on searches; terms per query; ranking of the most frequently used terms; and differences in Web search behaviors of U.S. and European Web users. (Author/LRW)

  4. Adaptive approximation models in optimization

    SciTech Connect

    Voronin, A.N.

    1995-05-01

    The paper proposes a method for optimization of functions of several variables that substantially reduces the number of objective function evaluations compared to traditional methods. The method is based on the property of iterative refinement of approximation models of the optimand function in approximation domains that contract to the extremum point. It does not require subjective specification of the starting point, step length, or other parameters of the search procedure. The method is designed for efficient optimization of unimodal functions of several (not more than 10-15) variables and can be applied to find the global extremum of polymodal functions and also for optimization of scalarized forms of vector objective functions.

  5. Attributional Search and Concern about the Future Following Smoking Cessation Treatment.

    ERIC Educational Resources Information Center

    Schoeneman, Thomas J.; And Others

    Some research on attribution processes has suggested that attributional search is exploratory behavior that serves adaptation and mastery motives. This study was conducted to investigate attributional search in reactions to success and failure after quitting smoking, to look for antecedents of attributional search other than expectancy and…

  6. Curating the Web: Building a Google Custom Search Engine for the Arts

    ERIC Educational Resources Information Center

    Hennesy, Cody; Bowman, John

    2008-01-01

    Google's first foray onto the web made search simple and results relevant. With its Co-op platform, Google has taken another step toward dramatically increasing the relevancy of search results, further adapting the World Wide Web to local needs. Google Custom Search Engine, a tool on the Co-op platform, puts one in control of his or her own search…

  7. Searches, Sex Discrimination, Sentences, and More.

    ERIC Educational Resources Information Center

    Daly, Joseph L.; Walz, Monte R.

    1983-01-01

    Recent Supreme Court decisions are discussed. Included are cases dealing with the powers of police to make arrests and conduct searches without first obtaining warrants, criminal law and procedure, equal rights for women, prison conditions, nuclear power plans, and the tax-exempt status of private schools. (RM)

  8. A Further Search for Social Intelligence.

    ERIC Educational Resources Information Center

    Ford, Martin E.; Tisak, Marie S.

    1983-01-01

    A behavioral effectiveness criterion was employed to conceptually and operationally define social intelligence. Using Keating's "A Search for Social Intelligence" as a methodological model, the present study examined four measures of academic intelligence and six measures of social intelligence using three different correlational procedures.…

  9. 47 CFR 80.1125 - Search and rescue coordinating communications.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... accordance with 5 U.S.C. 552(a) and 1 CFR part 51. Copies of this standard can be inspected at the Federal... 47 Telecommunication 5 2010-10-01 2010-10-01 false Search and rescue coordinating communications...) Operating Procedures for Distress and Safety Communications § 80.1125 Search and rescue...

  10. 47 CFR 80.1125 - Search and rescue coordinating communications.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... accordance with 5 U.S.C. 552(a) and 1 CFR part 51. Copies of this standard can be inspected at the Federal... 47 Telecommunication 5 2011-10-01 2011-10-01 false Search and rescue coordinating communications...) Operating Procedures for Distress and Safety Communications § 80.1125 Search and rescue...

  11. Bioinformatics: searching the Net.

    PubMed

    Kastin, S; Wexler, J

    1998-04-01

    During the past 30 years, there has been an explosion in the volume of published medical information. As this volume has increased, so has the need for efficient methods for searching the data. MEDLINE, the primary medical database, is currently limited to abstracts of the medical literature. MEDLINE searches use AND/OR/NOT logical searching for keywords that have been assigned to each article and for textwords included in article abstracts. Recently, the complete text of some scientific journals, including figures and tables, has become accessible electronically. Keyword and textword searches can provide an overwhelming number of results. Search engines that use phrase searching, or searches that limit the number of words between two finds, improve the precision of search engines. The development of the Internet as a vehicle for worldwide communication, and the emergence of the World Wide Web (WWW) as a common vehicle for communication have made instantaneous access to much of the entire body of medical information an exciting possibility. There is more than one way to search the WWW for information. At the present time, two broad strategies have emerged for cataloging the WWW: directories and search engines. These allow more efficient searching of the WWW. Directories catalog WWW information by creating categories and subcategories of information and then publishing pointers to information within the category listings. Directories are analogous to yellow pages of the phone book. Search engines make no attempt to categorize information. They automatically scour the WWW looking for words and then automatically create an index of those words. When a specific search engine is used, its index is searched for a particular word. Usually, search engines are nonspecific and produce voluminous results. Use of AND/OR/NOT and "near" and "adjacent" search refinements greatly improve the results of a search. Search engines that limit their scope to specific sites, and

  12. Second Graders Learn Animal Adaptations through Form and Function Analogy Object Boxes

    ERIC Educational Resources Information Center

    Rule, Audrey C.; Baldwin, Samantha; Schell, Robert

    2008-01-01

    This study examined the use of form and function analogy object boxes to teach second graders (n = 21) animal adaptations. The study used a pretest-posttest design to examine animal adaptation content learned through focused analogy activities as compared with reading and Internet searches for information about adaptations of animals followed by…

  13. Candidate CDTI procedures study

    NASA Technical Reports Server (NTRS)

    Ace, R. E.

    1981-01-01

    A concept with potential for increasing airspace capacity by involving the pilot in the separation control loop is discussed. Some candidate options are presented. Both enroute and terminal area procedures are considered and, in many cases, a technologically advanced Air Traffic Control structure is assumed. Minimum display characteristics recommended for each of the described procedures are presented. Recommended sequencing of the operational testing of each of the candidate procedures is presented.

  14. Adapting Aquatic Circuit Training for Special Populations.

    ERIC Educational Resources Information Center

    Thome, Kathleen

    1980-01-01

    The author discusses how land activities can be adapted to water so that individuals with handicapping conditions can participate in circuit training activities. An initial section lists such organizational procedures as providing vocal and/or visual cues for activities, having assistants accompany the performers throughout the circuit, and…

  15. Computerized Adaptive Testing with Item Cloning.

    ERIC Educational Resources Information Center

    Glas, Cees A. W.; van der Linden, Wim J.

    2003-01-01

    Developed a multilevel item response (IRT) model that allows for differences between the distributions of item parameters of families of item clones. Results from simulation studies based on an item pool from the Law School Admission Test illustrate the accuracy of the item pool calibration and adaptive testing procedures based on the model. (SLD)

  16. Procedural pediatric dermatology.

    PubMed

    Metz, Brandie J

    2013-04-01

    Due to many factors, including parental anxiety, a child's inability to understand the necessity of a procedure and a child's unwillingness to cooperate, it can be much more challenging to perform dermatologic procedures in children. This article reviews pre-procedural preparation of patients and parents, techniques for minimizing injection-related pain and optimal timing of surgical intervention. The risks and benefits of general anesthesia in the setting of pediatric dermatologic procedures are discussed. Additionally, the surgical approach to a few specific types of birthmarks is addressed.

  17. Publication search and retrieval system

    USGS Publications Warehouse

    Winget, Elizabeth A.

    1981-01-01

    The publication search and retrieval system of the Branch of Atlantic-Gulf of Mexico Geology, U.S. Geological Survey, Woods Hole, Mass., is a procedure for listing and describing branch-sponsored publications. It is designed for maintenance and retrieval by those having limited knowledge of computer languages and programs. Because this branch currently utilizes the Hewlett-Packard HP-1000 computer with RTE-IVB operating system, database entry and maintenance is performed in accordance with the TE-IVB Terminal User’s Reference Manual (Hewlett-Packard Company, 1980) and within the constraints of GRASP (Bowen and Botbol, 1975) and WOLF (Evenden, 1978).

  18. An efficient cuckoo search algorithm for numerical function optimization

    NASA Astrophysics Data System (ADS)

    Ong, Pauline; Zainuddin, Zarita

    2013-04-01

    Cuckoo search algorithm which reproduces the breeding strategy of the best known brood parasitic bird, the cuckoos has demonstrated its superiority in obtaining the global solution for numerical optimization problems. However, the involvement of fixed step approach in its exploration and exploitation behavior might slow down the search process considerably. In this regards, an improved cuckoo search algorithm with adaptive step size adjustment is introduced and its feasibility on a variety of benchmarks is validated. The obtained results show that the proposed scheme outperforms the standard cuckoo search algorithm in terms of convergence characteristic while preserving the fascinating features of the original method.

  19. Comparability of naturalistic and controlled observation assessment of adaptive behavior.

    PubMed

    Millham, J; Chilcutt, J; Atkinson, B L

    1978-07-01

    The comparability of retrospective naturalistic and controlled observation assessment of adaptive behavior was evaluated. The number, degree, and direction of discrepancies were evaluated with respect to level of retardation of the client, rater differences, behavior domain sampled, and prior observational base for the ratings. Generally poor comparability between the procedures was found and questions were raised concerning the types of generalizability that can be made from adaptive behavior assessment obtained under the two procedures.

  20. Applying Knowledge of Species-Typical Scavenging Behavior to the Search and Recovery of Mammalian Skeletal Remains.

    PubMed

    Young, Alexandria; Stillman, Richard; Smith, Martin J; Korstjens, Amanda H

    2016-03-01

    Forensic investigations involving animal scavenging of human remains require a physical search of the scene and surrounding areas. However, there is currently no standard procedure in the U.K. for physical searches of scavenged human remains. The Winthrop and grid search methods used by police specialist searchers for scavenged remains were examined through the use of mock red fox (Vulpes vulpes) scatter scenes. Forty-two police specialist searchers from two different regions within the U.K. were divided between those briefed and not briefed with fox-typical scavenging information. Briefing searchers with scavenging information significantly affected the recovery of scattered bones (χ(2) = 11.45, df = 1, p = 0.001). Searchers briefed with scavenging information were 2.05 times more likely to recover bones. Adaptions to search methods used by searchers were evident on a regional level, such that searchers more accustom to a peri-urban to rural region recovered a higher percentage of scattered bones (58.33%, n = 84). PMID:26551615

  1. Search efficiency as a function of target saliency: The transition from inefficient to efficient search and beyond.

    PubMed

    Liesefeld, Heinrich René; Moran, Rani; Usher, Marius; Müller, Hermann J; Zehetleitner, Michael

    2016-06-01

    Searching for an object among distracting objects is a common daily task. These searches differ in efficiency. Some are so difficult that each object must be inspected in turn, whereas others are so easy that the target object directly catches the observer's eye. In 4 experiments, the difficulty of searching for an orientation-defined target was parametrically manipulated between blocks of trials via the target-distractor orientation contrast. We observed a smooth transition from inefficient to efficient search with increasing orientation contrast. When contrast was high, search slopes were flat (indicating pop-out); when contrast was low, slopes were steep (indicating serial search). At the transition from inefficient to efficient search, search slopes were flat for target-present trials and steep for target-absent trials within the same orientation-contrast block-suggesting that participants adapted their behavior on target-absent trials to the most difficult, rather than the average, target-present trials of each block. Furthermore, even when search slopes were flat, indicative of pop-out, search continued to become faster with increasing contrast. These observations provide several new constraints for models of visual search and indicate that differences between search tasks that were traditionally considered qualitative in nature might actually be due to purely quantitative differences in target discriminability. (PsycINFO Database Record

  2. Search for neutral leptons

    SciTech Connect

    Perl, M.L.

    1984-12-01

    At present we know of three kinds of neutral leptons: the electron neutrino, the muon neutrino, and the tau neutrino. This paper reviews the search for additional neutral leptons. The method and significance of a search depends upon the model used for the neutral lepton being sought. Some models for the properties and decay modes of proposed neutral leptons are described. Past and present searches are reviewed. The limits obtained by some completed searches are given, and the methods of searches in progress are described. Future searches are discussed. 41 references.

  3. Rapid, generalized adaptation to asynchronous audiovisual speech.

    PubMed

    Van der Burg, Erik; Goodbourn, Patrick T

    2015-04-01

    The brain is adaptive. The speed of propagation through air, and of low-level sensory processing, differs markedly between auditory and visual stimuli; yet the brain can adapt to compensate for the resulting cross-modal delays. Studies investigating temporal recalibration to audiovisual speech have used prolonged adaptation procedures, suggesting that adaptation is sluggish. Here, we show that adaptation to asynchronous audiovisual speech occurs rapidly. Participants viewed a brief clip of an actor pronouncing a single syllable. The voice was either advanced or delayed relative to the corresponding lip movements, and participants were asked to make a synchrony judgement. Although we did not use an explicit adaptation procedure, we demonstrate rapid recalibration based on a single audiovisual event. We find that the point of subjective simultaneity on each trial is highly contingent upon the modality order of the preceding trial. We find compelling evidence that rapid recalibration generalizes across different stimuli, and different actors. Finally, we demonstrate that rapid recalibration occurs even when auditory and visual events clearly belong to different actors. These results suggest that rapid temporal recalibration to audiovisual speech is primarily mediated by basic temporal factors, rather than higher-order factors such as perceived simultaneity and source identity.

  4. Rapid, generalized adaptation to asynchronous audiovisual speech

    PubMed Central

    Van der Burg, Erik; Goodbourn, Patrick T.

    2015-01-01

    The brain is adaptive. The speed of propagation through air, and of low-level sensory processing, differs markedly between auditory and visual stimuli; yet the brain can adapt to compensate for the resulting cross-modal delays. Studies investigating temporal recalibration to audiovisual speech have used prolonged adaptation procedures, suggesting that adaptation is sluggish. Here, we show that adaptation to asynchronous audiovisual speech occurs rapidly. Participants viewed a brief clip of an actor pronouncing a single syllable. The voice was either advanced or delayed relative to the corresponding lip movements, and participants were asked to make a synchrony judgement. Although we did not use an explicit adaptation procedure, we demonstrate rapid recalibration based on a single audiovisual event. We find that the point of subjective simultaneity on each trial is highly contingent upon the modality order of the preceding trial. We find compelling evidence that rapid recalibration generalizes across different stimuli, and different actors. Finally, we demonstrate that rapid recalibration occurs even when auditory and visual events clearly belong to different actors. These results suggest that rapid temporal recalibration to audiovisual speech is primarily mediated by basic temporal factors, rather than higher-order factors such as perceived simultaneity and source identity. PMID:25716790

  5. Expressing Adaptation Strategies Using Adaptation Patterns

    ERIC Educational Resources Information Center

    Zemirline, N.; Bourda, Y.; Reynaud, C.

    2012-01-01

    Today, there is a real challenge to enable personalized access to information. Several systems have been proposed to address this challenge including Adaptive Hypermedia Systems (AHSs). However, the specification of adaptation strategies remains a difficult task for creators of such systems. In this paper, we consider the problem of the definition…

  6. Enucleation Procedure Manual.

    ERIC Educational Resources Information Center

    Davis, Kevin; Poston, George

    This manual provides information on the enucleation procedure (removal of the eyes for organ banks). An introductory section focuses on the anatomy of the eye and defines each of the parts. Diagrams of the eye are provided. A list of enucleation materials follows. Other sections present outlines of (1) a sterile procedure; (2) preparation for eye…

  7. Useful Procedures of Inquiry.

    ERIC Educational Resources Information Center

    Handy, Rollo; Harwood, E. C.

    This book discusses and analyzes the many different procedures of inquiry, both old and new, which have been used in an attempt to solve the problems men encounter. Section A examines some outmoded procedures of inquiry, describes scientific inquiry, and presents the Dewey-Bentley view of scientific method. Sections B and C, which comprise the…

  8. Adaptive Assessment of Young Children with Visual Impairment

    ERIC Educational Resources Information Center

    Ruiter, Selma; Nakken, Han; Janssen, Marleen; Van Der Meulen, Bieuwe; Looijestijn, Paul

    2011-01-01

    The aim of this study was to assess the effect of adaptations for children with low vision of the Bayley Scales, a standardized developmental instrument widely used to assess development in young children. Low vision adaptations were made to the procedures, item instructions and play material of the Dutch version of the Bayley Scales of Infant…

  9. Parallel Adaptive Multi-Mechanics Simulations using Diablo

    SciTech Connect

    Parsons, D; Solberg, J

    2004-12-03

    Coupled multi-mechanics simulations (such as thermal-stress and fluidstructure interaction problems) are of substantial interest to engineering analysts. In addition, adaptive mesh refinement techniques present an attractive alternative to current mesh generation procedures and provide quantitative error bounds that can be used for model verification. This paper discusses spatially adaptive multi-mechanics implicit simulations using the Diablo computer code. (U)

  10. Cube search, revisited.

    PubMed

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-03-16

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with "equivalent" 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target.

  11. Cube search, revisited

    PubMed Central

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-01-01

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

  12. Speeding up chemical searches using the inverted index: the convergence of chemoinformatics and text search methods.

    PubMed

    Nasr, Ramzi; Vernica, Rares; Li, Chen; Baldi, Pierre

    2012-04-23

    In ligand-based screening, retrosynthesis, and other chemoinformatics applications, one often seeks to search large databases of molecules in order to retrieve molecules that are similar to a given query. With the expanding size of molecular databases, the efficiency and scalability of data structures and algorithms for chemical searches are becoming increasingly important. Remarkably, both the chemoinformatics and information retrieval communities have converged on similar solutions whereby molecules or documents are represented by binary vectors, or fingerprints, indexing their substructures such as labeled paths for molecules and n-grams for text, with the same Jaccard-Tanimoto similarity measure. As a result, similarity search methods from one field can be adapted to the other. Here we adapt recent, state-of-the-art, inverted index methods from information retrieval to speed up similarity searches in chemoinformatics. Our results show a several-fold speed-up improvement over previous methods for both threshold searches and top-K searches. We also provide a mathematical analysis that allows one to predict the level of pruning achieved by the inverted index approach and validate the quality of these predictions through simulation experiments. All results can be replicated using data freely downloadable from http://cdb.ics.uci.edu/ . PMID:22462644

  13. Adaptive multiconfigurational wave functions

    SciTech Connect

    Evangelista, Francesco A.

    2014-03-28

    A method is suggested to build simple multiconfigurational wave functions specified uniquely by an energy cutoff Λ. These are constructed from a model space containing determinants with energy relative to that of the most stable determinant no greater than Λ. The resulting Λ-CI wave function is adaptive, being able to represent both single-reference and multireference electronic states. We also consider a more compact wave function parameterization (Λ+SD-CI), which is based on a small Λ-CI reference and adds a selection of all the singly and doubly excited determinants generated from it. We report two heuristic algorithms to build Λ-CI wave functions. The first is based on an approximate prescreening of the full configuration interaction space, while the second performs a breadth-first search coupled with pruning. The Λ-CI and Λ+SD-CI approaches are used to compute the dissociation curve of N{sub 2} and the potential energy curves for the first three singlet states of C{sub 2}. Special attention is paid to the issue of energy discontinuities caused by changes in the size of the Λ-CI wave function along the potential energy curve. This problem is shown to be solvable by smoothing the matrix elements of the Hamiltonian. Our last example, involving the Cu{sub 2}O{sub 2}{sup 2+} core, illustrates an alternative use of the Λ-CI method: as a tool to both estimate the multireference character of a wave function and to create a compact model space to be used in subsequent high-level multireference coupled cluster computations.

  14. Improved limited discrepancy search

    SciTech Connect

    Korf, R.E.

    1996-12-31

    We present an improvement to Harvey and Ginsberg`s limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from the root to the maximum search depth only once. For a complete binary tree of depth d this reduces the asymptotic complexity from O(d+2/2 2{sup d}) to O(2{sup d}). The savings is much less in a partial tree search, or in a heavily pruned tree. The overhead of the improved algorithm on a complete binary tree is only a factor of b/(b - 1) compared to depth-first search. While this constant factor is greater on a heavily pruned tree, this improvement makes limited discrepancy search a viable alternative to depth-first search, whenever the entire tree may not be searched. Finally, we present both positive and negative empirical results on the utility of limited discrepancy search, for the problem of number partitioning.

  15. Minimally invasive procedures

    PubMed Central

    Baltayiannis, Nikolaos; Michail, Chandrinos; Lazaridis, George; Anagnostopoulos, Dimitrios; Baka, Sofia; Mpoukovinas, Ioannis; Karavasilis, Vasilis; Lampaki, Sofia; Papaiwannou, Antonis; Karavergou, Anastasia; Kioumis, Ioannis; Pitsiou, Georgia; Katsikogiannis, Nikolaos; Tsakiridis, Kosmas; Rapti, Aggeliki; Trakada, Georgia; Zissimopoulos, Athanasios; Zarogoulidis, Konstantinos

    2015-01-01

    Minimally invasive procedures, which include laparoscopic surgery, use state-of-the-art technology to reduce the damage to human tissue when performing surgery. Minimally invasive procedures require small “ports” from which the surgeon inserts thin tubes called trocars. Carbon dioxide gas may be used to inflate the area, creating a space between the internal organs and the skin. Then a miniature camera (usually a laparoscope or endoscope) is placed through one of the trocars so the surgical team can view the procedure as a magnified image on video monitors in the operating room. Specialized equipment is inserted through the trocars based on the type of surgery. There are some advanced minimally invasive surgical procedures that can be performed almost exclusively through a single point of entry—meaning only one small incision, like the “uniport” video-assisted thoracoscopic surgery (VATS). Not only do these procedures usually provide equivalent outcomes to traditional “open” surgery (which sometimes require a large incision), but minimally invasive procedures (using small incisions) may offer significant benefits as well: (I) faster recovery; (II) the patient remains for less days hospitalized; (III) less scarring and (IV) less pain. In our current mini review we will present the minimally invasive procedures for thoracic surgery. PMID:25861610

  16. Response-Adaptive Allocation for Circular Data.

    PubMed

    Biswas, Atanu; Dutta, Somak; Laha, Arnab Kumar; Bakshi, Partho K

    2015-01-01

    Response-adaptive designs are used in phase III clinical trials to allocate a larger proportion of patients to the better treatment. Circular data is a natural outcome in many clinical trial setup, e.g., some measurements in opthalmologic studies, degrees of rotation of hand or waist, etc. There is no available work on response-adaptive designs for circular data. With reference to a dataset on cataract surgery we provide some response-adaptive designs where the responses are of circular nature and propose some test statistics for treatment comparison under adaptive data allocation procedure. Detailed simulation study and the analysis of the dataset, including redesigning the cataract surgery data, are carried out.

  17. An adaptive contextual quantum language model

    NASA Astrophysics Data System (ADS)

    Li, Jingfei; Zhang, Peng; Song, Dawei; Hou, Yuexian

    2016-08-01

    User interactions in search system represent a rich source of implicit knowledge about the user's cognitive state and information need that continuously evolves over time. Despite massive efforts that have been made to exploiting and incorporating this implicit knowledge in information retrieval, it is still a challenge to effectively capture the term dependencies and the user's dynamic information need (reflected by query modifications) in the context of user interaction. To tackle these issues, motivated by the recent Quantum Language Model (QLM), we develop a QLM based retrieval model for session search, which naturally incorporates the complex term dependencies occurring in user's historical queries and clicked documents with density matrices. In order to capture the dynamic information within users' search session, we propose a density matrix transformation framework and further develop an adaptive QLM ranking model. Extensive comparative experiments show the effectiveness of our session quantum language models.

  18. The Shortcut Search. Governance.

    ERIC Educational Resources Information Center

    Nyland, Larry

    1998-01-01

    Faced with a late-season superintendent search, many districts defer the formal search-and-hire process and entice a senior administrator or former superintendent to serve a one- or two-year stint. One appealing alternative is an abbreviated search. Boards should advertise immediately and efficiently, develop their own criteria, recruit…

  19. Inside a Search. Commentary

    ERIC Educational Resources Information Center

    Cooper, Rosie

    2011-01-01

    Lou Marinoff's article, "Inside a Search," discusses the issues college search committees face in the pursuit of qualified faculty members that will be a good fit for their institutions. More often than not, faculty searches are more complex and challenging than the featured article suggests. The economic downturn facing the nation has resulted in…

  20. Search and Seizure.

    ERIC Educational Resources Information Center

    Murray, Kenneth T.

    This paper examines the practice of search and seizure from a legal perspective. All issues concerning lawful or unlawful search and seizure, whether in a public school or otherwise, are predicated upon the Fourth Amendment to the United States Constitution. The terms "search,""seizure,""probable cause,""reasonable suspicion," and "exclusionary…

  1. The Information Search

    ERIC Educational Resources Information Center

    Doraiswamy, Uma

    2011-01-01

    This paper in the form of story discusses a college student's information search process. In this story we see Kuhlthau's information search process: initiation, selection, exploration, formulation, collection, and presentation. Katie is a student who goes in search of information for her class research paper. Katie's class readings, her interest…

  2. Reverb Search Tool

    Atmospheric Science Data Center

    2016-10-05

    Description:  Search and order ASDC and Earth science data from various NASA and affiliated centers. Search and order options: project, parameter, data set, geographic region and ... Reverb will soon be retired. Please query the Earthdata Search Tool for your desired products. Details:  ...

  3. Conducting a Web Search.

    ERIC Educational Resources Information Center

    Miller-Whitehead, Marie

    Keyword and text string searches of online library catalogs often provide different results according to library and database used and depending upon how books and journals are indexed. For this reason, online databases such as ERIC often provide tutorials and recommendations for searching their site, such as how to use Boolean search strategies.…

  4. AEST: Adaptive Eigenvalue Stability Code

    NASA Astrophysics Data System (ADS)

    Zheng, L.-J.; Kotschenreuther, M.; Waelbroeck, F.; van Dam, J. W.; Berk, H.

    2002-11-01

    An adaptive eigenvalue linear stability code is developed. The aim is on one hand to include the non-ideal MHD effects into the global MHD stability calculation for both low and high n modes and on the other hand to resolve the numerical difficulty involving MHD singularity on the rational surfaces at the marginal stability. Our code follows some parts of philosophy of DCON by abandoning relaxation methods based on radial finite element expansion in favor of an efficient shooting procedure with adaptive gridding. The δ W criterion is replaced by the shooting procedure and subsequent matrix eigenvalue problem. Since the technique of expanding a general solution into a summation of the independent solutions employed, the rank of the matrices involved is just a few hundreds. This makes easier to solve the eigenvalue problem with non-ideal MHD effects, such as FLR or even full kinetic effects, as well as plasma rotation effect, taken into account. To include kinetic effects, the approach of solving for the distribution function as a local eigenvalue ω problem as in the GS2 code will be employed in the future. Comparison of the ideal MHD version of the code with DCON, PEST, and GATO will be discussed. The non-ideal MHD version of the code will be employed to study as an application the transport barrier physics in tokamak discharges.

  5. Alpha-Stratified Multistage Computerized Adaptive Testing with beta Blocking.

    ERIC Educational Resources Information Center

    Chang, Hua-Hua; Qian, Jiahe; Yang, Zhiliang

    2001-01-01

    Proposed a refinement, based on the stratification of items developed by D. Weiss (1973), of the computerized adaptive testing item selection procedure of H. Chang and Z. Ying (1999). Simulation studies using an item bank from the Graduate Record Examination show the benefits of the new procedure. (SLD)

  6. Balancing Flexible Constraints and Measurement Precision in Computerized Adaptive Testing

    ERIC Educational Resources Information Center

    Moyer, Eric L.; Galindo, Jennifer L.; Dodd, Barbara G.

    2012-01-01

    Managing test specifications--both multiple nonstatistical constraints and flexibly defined constraints--has become an important part of designing item selection procedures for computerized adaptive tests (CATs) in achievement testing. This study compared the effectiveness of three procedures: constrained CAT, flexible modified constrained CAT,…

  7. "Research protocol: a synthesis of qualitative studies on the process of adaptation to dependency in elderly persons and their families"

    PubMed Central

    2010-01-01

    Background Dealing with dependency in the elderly and their families leads us to explore the life experience of those involved together with the processes of adaptation to this condition. A number of original studies have been published which, following a qualitative methodology, have dealt with both dimensions. Methods/Design Objectives: 1) To present a synthesis of the qualitative evidence available on the process of adaptation to dependency in elderly persons and their families; 2) to conduct an in-depth study into the experiences and strategies developed by both to optimise their living conditions; 3) to enable standards of action/intervention to be developed in the caregiving environment. A synthesis of qualitative studies is projected with an extensive and inclusive bibliography search strategy. The primary search will focus on the major databases (CINAHL, MEDLINE, EMBASE, PsycInfo, PSICODOC, Cochrane Library, JBI, EMBASE, LILACS, CUIDEN, CUIDEN qualitative, CUIDATGE, British Nursing Index, SSCI). The secondary search will be conducted in articles taken from the references to studies identified in the articles and reports and the manual search in congresses and foundation papers. Article quality will be assessed by the guide proposed by Sandelowski & Barroso and data extraction done using the QARI data extraction form proposed by the Joanna Briggs Institute for Evidence-Based Practice. The synthesis of the findings will be based on the principles and procedures of grounded theory: coding, identification and relationship between categories, and synthesis using constant comparison as a strategy. Discussion This synthesis of qualitative evidence will enable us to detect health needs as perceived by the receivers in their own interaction contexts. PMID:20738846

  8. Short Nuss bar procedure

    PubMed Central

    2016-01-01

    The Nuss procedure is now the preferred operation for surgical correction of pectus excavatum (PE). It is a minimally invasive technique, whereby one to three curved metal bars are inserted behind the sternum in order to push it into a normal position. The bars are left in situ for three years and then removed. This procedure significantly improves quality of life and, in most cases, also improves cardiac performance. Previously, the modified Ravitch procedure was used with resection of cartilage and the use of posterior support. This article details the new modified Nuss procedure, which requires the use of shorter bars than specified by the original technique. This technique facilitates the operation as the bar may be guided manually through the chest wall and no additional stabilizing sutures are necessary. PMID:27747185

  9. Dynamic alarm response procedures

    SciTech Connect

    Martin, J.; Gordon, P.; Fitch, K.

    2006-07-01

    The Dynamic Alarm Response Procedure (DARP) system provides a robust, Web-based alternative to existing hard-copy alarm response procedures. This paperless system improves performance by eliminating time wasted looking up paper procedures by number, looking up plant process values and equipment and component status at graphical display or panels, and maintenance of the procedures. Because it is a Web-based system, it is platform independent. DARP's can be served from any Web server that supports CGI scripting, such as Apache{sup R}, IIS{sup R}, TclHTTPD, and others. DARP pages can be viewed in any Web browser that supports Javascript and Scalable Vector Graphics (SVG), such as Netscape{sup R}, Microsoft Internet Explorer{sup R}, Mozilla Firefox{sup R}, Opera{sup R}, and others. (authors)

  10. Cardiac ablation procedures

    MedlinePlus

    ... the heart. During the procedure, small wires called electrodes are placed inside your heart to measure your ... is in place, your doctor will place small electrodes in different areas of your heart. These electrodes ...

  11. Common Interventional Radiology Procedures

    MedlinePlus

    ... of common interventional techniques is below. Common Interventional Radiology Procedures Angiography An X-ray exam of the ... into the vertebra. Copyright © 2016 Society of Interventional Radiology. All rights reserved. 3975 Fair Ridge Drive • Suite ...

  12. Costing imaging procedures.

    PubMed

    Bretland, P M

    1988-01-01

    The existing National Health Service financial system makes comprehensive costing of any service very difficult. A method of costing using modern commercial methods has been devised, classifying costs into variable, semi-variable and fixed and using the principle of overhead absorption for expenditure not readily allocated to individual procedures. It proved possible to establish a cost spectrum over the financial year 1984-85. The cheapest examinations were plain radiographs outside normal working hours, followed by plain radiographs, ultrasound, special procedures, fluoroscopy, nuclear medicine, angiography and angiographic interventional procedures in normal working hours. This differs from some published figures, particularly those in the Körner report. There was some overlap between fluoroscopic interventional and the cheaper nuclear medicine procedures, and between some of the more expensive nuclear medicine procedures and the cheaper angiographic ones. Only angiographic and the few more expensive nuclear medicine procedures exceed the cost of the inpatient day. The total cost of the imaging service to the district was about 4% of total hospital expenditure. It is shown that where more procedures are undertaken, the semi-variable and fixed (including capital) elements of the cost decrease (and vice versa) so that careful study is required to assess the value of proposed economies. The method is initially time-consuming and requires a computer system with 512 Kb of memory, but once the basic costing system is established in a department, detailed financial monitoring should become practicable. The necessity for a standard comprehensive costing procedure of this nature, based on sound cost accounting principles, appears inescapable, particularly in view of its potential application to management budgeting. PMID:3349241

  13. Safety referral procedures clarified.

    PubMed

    2014-12-01

    Two types of referrals are available for the purpose of harmonising pharmacovigilance decisions across the EU: the urgent procedure and the "normal" procedure. In both cases, the Pharmacovigilance Risk Assessment Committee (PRAC) issues a recommendation that the marketing authorisation committees concerned must take into account when formulating their opinions. If Member States disagree in their decisions, a final referral is available, although it lacks transparency. The European Commission's final decision is binding on all Member States. PMID:25629154

  14. Costing imaging procedures.

    PubMed

    Bretland, P M

    1988-01-01

    The existing National Health Service financial system makes comprehensive costing of any service very difficult. A method of costing using modern commercial methods has been devised, classifying costs into variable, semi-variable and fixed and using the principle of overhead absorption for expenditure not readily allocated to individual procedures. It proved possible to establish a cost spectrum over the financial year 1984-85. The cheapest examinations were plain radiographs outside normal working hours, followed by plain radiographs, ultrasound, special procedures, fluoroscopy, nuclear medicine, angiography and angiographic interventional procedures in normal working hours. This differs from some published figures, particularly those in the Körner report. There was some overlap between fluoroscopic interventional and the cheaper nuclear medicine procedures, and between some of the more expensive nuclear medicine procedures and the cheaper angiographic ones. Only angiographic and the few more expensive nuclear medicine procedures exceed the cost of the inpatient day. The total cost of the imaging service to the district was about 4% of total hospital expenditure. It is shown that where more procedures are undertaken, the semi-variable and fixed (including capital) elements of the cost decrease (and vice versa) so that careful study is required to assess the value of proposed economies. The method is initially time-consuming and requires a computer system with 512 Kb of memory, but once the basic costing system is established in a department, detailed financial monitoring should become practicable. The necessity for a standard comprehensive costing procedure of this nature, based on sound cost accounting principles, appears inescapable, particularly in view of its potential application to management budgeting.

  15. Adaptive Batch Mode Active Learning.

    PubMed

    Chakraborty, Shayok; Balasubramanian, Vineeth; Panchanathan, Sethuraman

    2015-08-01

    Active learning techniques have gained popularity to reduce human effort in labeling data instances for inducing a classifier. When faced with large amounts of unlabeled data, such algorithms automatically identify the exemplar and representative instances to be selected for manual annotation. More recently, there have been attempts toward a batch mode form of active learning, where a batch of data points is simultaneously selected from an unlabeled set. Real-world applications require adaptive approaches for batch selection in active learning, depending on the complexity of the data stream in question. However, the existing work in this field has primarily focused on static or heuristic batch size selection. In this paper, we propose two novel optimization-based frameworks for adaptive batch mode active learning (BMAL), where the batch size as well as the selection criteria are combined in a single formulation. We exploit gradient-descent-based optimization strategies as well as properties of submodular functions to derive the adaptive BMAL algorithms. The solution procedures have the same computational complexity as existing state-of-the-art static BMAL techniques. Our empirical results on the widely used VidTIMIT and the mobile biometric (MOBIO) data sets portray the efficacy of the proposed frameworks and also certify the potential of these approaches in being used for real-world biometric recognition applications.

  16. Visual Contrast Sensitivity Functions Obtained from Untrained Observers Using Tracking and Staircase Procedures. Final Report.

    ERIC Educational Resources Information Center

    Geri, George A.; Hubbard, David C.

    Two adaptive psychophysical procedures (tracking and "yes-no" staircase) for obtaining human visual contrast sensitivity functions (CSF) were evaluated. The procedures were chosen based on their proven validity and the desire to evaluate the practical effects of stimulus transients, since tracking procedures traditionally employ gradual stimulus…

  17. A Comparison of Exposure Control Procedures in CATs Using the 3PL Model

    ERIC Educational Resources Information Center

    Leroux, Audrey J.; Lopez, Myriam; Hembry, Ian; Dodd, Barbara G.

    2013-01-01

    This study compares the progressive-restricted standard error (PR-SE) exposure control procedure to three commonly used procedures in computerized adaptive testing, the randomesque, Sympson-Hetter (SH), and no exposure control methods. The performance of these four procedures is evaluated using the three-parameter logistic model under the…

  18. [Advanced online search techniques and dedicated search engines for physicians].

    PubMed

    Nahum, Yoav

    2008-02-01

    In recent years search engines have become an essential tool in the work of physicians. This article will review advanced search techniques from the world of information specialists, as well as some advanced search engine operators that may help physicians improve their online search capabilities, and maximize the yield of their searches. This article also reviews popular dedicated scientific and biomedical literature search engines.

  19. University Students' Online Information Searching Strategies in Different Search Contexts

    ERIC Educational Resources Information Center

    Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung

    2012-01-01

    This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…

  20. VisSearch: A Collaborative Web Searching Environment

    ERIC Educational Resources Information Center

    Lee, Young-Jin

    2005-01-01

    VisSearch is a collaborative Web searching environment intended for sharing Web search results among people with similar interests, such as college students taking the same course. It facilitates students' Web searches by visualizing various Web searching processes. It also collects the visualized Web search results and applies an association rule…

  1. Comparative evaluation of tandem MS search algorithms using a target-decoy search strategy.

    PubMed

    Balgley, Brian M; Laudeman, Tom; Yang, Li; Song, Tao; Lee, Cheng S

    2007-09-01

    Peptide identification of tandem mass spectra by a variety of available search algorithms forms the foundation for much of modern day mass spectrometry-based proteomics. Despite the critical importance of proper evaluation and interpretation of the results generated by these algorithms there is still little consistency in their application or understanding of their similarities and differences. A survey was conducted of four tandem mass spectrometry peptide identification search algorithms, including Mascot, Open Mass Spectrometry Search Algorithm, Sequest, and X! Tandem. The same input data, search parameters, and sequence library were used for the searches. Comparisons were based on commonly used scoring methodologies for each algorithm and on the results of a target-decoy approach to sequence library searching. The results indicated that there is little difference in the output of the algorithms so long as consistent scoring procedures are applied. The results showed that some commonly used scoring procedures may lead to excessive false discovery rates. Finally an alternative method for the determination of an optimal cutoff threshold is proposed.

  2. Constrained adaptation for feedback cancellation in hearing aids.

    PubMed

    Kates, J M

    1999-08-01

    In feedback cancellation in hearing aids, an adaptive filter is used to model the feedback path. The output of the adaptive filter is subtracted from the microphone signal to cancel the acoustic and mechanical feedback picked up by the microphone, thus allowing more gain in the hearing aid. In general, the feedback-cancellation filter adapts on the hearing-aid input signal, and signal cancellation and coloration artifacts can occur for a narrow-band input. In this paper, two procedures for LMS adaptation with a constraint on the magnitude of the adaptive weight vector are derived. The constraints greatly reduce the probability that the adaptive filter will cancel a narrow-band input. Simulation results are used to demonstrate the efficacy of the constrained adaptation. PMID:10462806

  3. A Novel Approach for Adaptive Signal Processing

    NASA Technical Reports Server (NTRS)

    Chen, Ya-Chin; Juang, Jer-Nan

    1998-01-01

    Adaptive linear predictors have been used extensively in practice in a wide variety of forms. In the main, their theoretical development is based upon the assumption of stationarity of the signals involved, particularly with respect to the second order statistics. On this basis, the well-known normal equations can be formulated. If high- order statistical stationarity is assumed, then the equivalent normal equations involve high-order signal moments. In either case, the cross moments (second or higher) are needed. This renders the adaptive prediction procedure non-blind. A novel procedure for blind adaptive prediction has been proposed and considerable implementation has been made in our contributions in the past year. The approach is based upon a suitable interpretation of blind equalization methods that satisfy the constant modulus property and offers significant deviations from the standard prediction methods. These blind adaptive algorithms are derived by formulating Lagrange equivalents from mechanisms of constrained optimization. In this report, other new update algorithms are derived from the fundamental concepts of advanced system identification to carry out the proposed blind adaptive prediction. The results of the work can be extended to a number of control-related problems, such as disturbance identification. The basic principles are outlined in this report and differences from other existing methods are discussed. The applications implemented are speech processing, such as coding and synthesis. Simulations are included to verify the novel modelling method.

  4. Constrained novelty search: a study on game content generation.

    PubMed

    Liapis, Antonios; Yannakakis, Georgios N; Togelius, Julian

    2015-01-01

    Novelty search is a recent algorithm geared toward exploring search spaces without regard to objectives. When the presence of constraints divides a search space into feasible space and infeasible space, interesting implications arise regarding how novelty search explores such spaces. This paper elaborates on the problem of constrained novelty search and proposes two novelty search algorithms which search within both the feasible and the infeasible space. Inspired by the FI-2pop genetic algorithm, both algorithms maintain and evolve two separate populations, one with feasible and one with infeasible individuals, while each population can use its own selection method. The proposed algorithms are applied to the problem of generating diverse but playable game levels, which is representative of the larger problem of procedural game content generation. Results show that the two-population constrained novelty search methods can create, under certain conditions, larger and more diverse sets of feasible game levels than current methods of novelty search, whether constrained or unconstrained. However, the best algorithm is contingent on the particularities of the search space and the genetic operators used. Additionally, the proposed enhancement of offspring boosting is shown to enhance performance in all cases of two-population novelty search.

  5. Automation of procedure writing for the RLWTF

    SciTech Connect

    Farnham, M. |; MacDonald, A. |

    1998-12-01

    In August of 1997, the Radioactive Liquid Waste Treatment Facility (RLWTF) at Los Alamos National Laboratory (LANL) recognized the need to re-engineer document management business process. All nuclear facilities at LANL are required to ensure that both the latest approved revision of controlled documents and any changes to those documents are available to operating personnel at all times. The Nuclear Materials Technology (NMT) Division was also re-engineering its document management business processes and searching for a solution. Both groups contacted several internal and external organizations in search of potential software solutions in use that would meet requirements. This report describes the objectives and features required by the software package, the choice of Procedure Design as the software package, and its implementation.

  6. IntentSearch: Capturing User Intention for One-Click Internet Image Search.

    PubMed

    Tang, Xiaoou; Liu, Ke; Cui, Jingyu; Wen, Fang; Wang, Xiaogang

    2012-07-01

    Web-scale image search engines (e.g., Google image search, Bing image search) mostly rely on surrounding text features. It is difficult for them to interpret users' search intention only by query keywords and this leads to ambiguous and noisy search results which are far from satisfactory. It is important to use visual information in order to solve the ambiguity in text-based image retrieval. In this paper, we propose a novel Internet image search approach. It only requires the user to click on one query image with minimum effort and images from a pool retrieved by text-based search are reranked based on both visual and textual content. Our key contribution is to capture the users' search intention from this one-click query image in four steps. 1) The query image is categorized into one of the predefined adaptive weight categories which reflect users' search intention at a coarse level. Inside each category, a specific weight schema is used to combine visual features adaptive to this kind of image to better rerank the text-based search result. 2) Based on the visual content of the query image selected by the user and through image clustering, query keywords are expanded to capture user intention. 3) Expanded keywords are used to enlarge the image pool to contain more relevant images. 4) Expanded keywords are also used to expand the query image to multiple positive visual examples from which new query specific visual and textual similarity metrics are learned to further improve content-based image reranking. All these steps are automatic, without extra effort from the user. This is critically important for any commercial web-based image search engine, where the user interface has to be extremely simple. Besides this key contribution, a set of visual features which are both effective and efficient in Internet image search are designed. Experimental evaluation shows that our approach significantly improves the precision of top-ranked images and also the user

  7. Construction of a Computerized Adaptive Testing Version of the Quebec Adaptive Behavior Scale.

    ERIC Educational Resources Information Center

    Tasse, Marc J.; And Others

    Multilog (Thissen, 1991) was used to estimate parameters of 225 items from the Quebec Adaptive Behavior Scale (QABS). A database containing actual data from 2,439 subjects was used for the parameterization procedures. The two-parameter-logistic model was used in estimating item parameters and in the testing strategy. MicroCAT (Assessment Systems…

  8. Countermeasure development to space adaptation

    NASA Technical Reports Server (NTRS)

    Larochelle, F. T.; Charles, J.; Harm, D. L.; Fortney, S. M.; Siconolfi, S.

    1992-01-01

    At the Johnson Space Center we are actively involved, with the collaboration of other NASA Centers and the scientific community at large, in the search for ways to counter the negative affects of spaceflight beginning with the improvement in our understanding of the adaptation. Heretofore this search will be broadly referred to as countermeasures development and includes not only the preservation of physiological well-being but also pyschological well-being. The psychological integrity of crews will, undoubtedly, become progressively more important as lengths, remoteness, and risks of missions increase. The character and priorities of our contermeasure development is very much dependent upon the character of the mission and requires a very close liaison between Medical Operations and the investigators. Because of the demands which countermeasure implementation imposes upon crew schedules and because of the potential weight, power, and budget impacts of the hardware and its development, a countermeasure can only become operational when it is either adequately validated or the human risk of not applying the existing technology exceeds the other negative impacts not directly related to crew health and safety.

  9. Uncertainty about nest position influences systematic search strategies in desert ants.

    PubMed

    Merkle, Tobias; Knaden, Markus; Wehner, Rüdiger

    2006-09-01

    Foraging desert ants return to their starting point, the nest, by means of path integration. If the path-integration vector has been run off but the nest has not yet been reached, the ants engage in systematic search behavior. This behavior results in a system of search loops of ever increasing size and finally leads to a search density profile peaking at the location where the path integration system has been reset to zero. In this study we investigate whether this systematic search behavior is adapted to the uncertainty resulting from the preceding foraging run. We show first that the longer the distances of the foraging excursions, the larger the errors occurring during path integration, and second that the ants adapt their systematic search strategy to their increasing uncertainty by extending their search pattern. Hence, the density of the systematic search pattern is correlated with the ants' confidence in their path integrator. This confidence decreases with increasing foraging distances.

  10. Fundamental Ethical Issues in Unnecessary Surgical Procedures

    PubMed Central

    Dalvi, Shashank D.

    2016-01-01

    In clinical practice performing any surgical procedure is inconsistent because all surgical procedures carry definitely some degree of risk. Worldwide every year millions of patients go under knife, but many of them are enduring great pain and shelling out thousands and dollars for surgeries they don’t really need. This review work was planned with an intention to focus attention towards it with reporting cited evidences of unnecessary surgical operations and discuss ethical issues concern with it. In present review the references search included standard citations Google scholar, MEDLINE and PUBMED. We also used Google search engine for screening various news concern with highlighting this topic in community and online media. For articles we go through more than 60 articles from worldwide and 12 news media views from Google search in last one year. We used following quotes for their search-unnecessary surgeries, second opinion, ethical issues in unnecessary surgeries. Geographical variations were also kept in view. Our intension was highlighting ethical issues concern with unnecessary surgical operations. Henceforth we excluded such work that does not concern with ethical issues. Unnecessary surgery is that which is medically unjustifiable when the risks and costs are more than the likely therapeutic benefits or relief to the patient based on the patient’s lifestyle requirements. To avoid or minimize such interventions basic seeding of ethics in curriculum and strict laws will definitely helpful in clinical practice. In conclusion, our aim was to highlight this major issue and underline need of competency based medical bioethics education in Indian scenario. PMID:27190833

  11. Fundamental Ethical Issues in Unnecessary Surgical Procedures.

    PubMed

    Tayade, Motilal Chandu; Dalvi, Shashank D

    2016-04-01

    In clinical practice performing any surgical procedure is inconsistent because all surgical procedures carry definitely some degree of risk. Worldwide every year millions of patients go under knife, but many of them are enduring great pain and shelling out thousands and dollars for surgeries they don't really need. This review work was planned with an intention to focus attention towards it with reporting cited evidences of unnecessary surgical operations and discuss ethical issues concern with it. In present review the references search included standard citations Google scholar, MEDLINE and PUBMED. We also used Google search engine for screening various news concern with highlighting this topic in community and online media. For articles we go through more than 60 articles from worldwide and 12 news media views from Google search in last one year. We used following quotes for their search-unnecessary surgeries, second opinion, ethical issues in unnecessary surgeries. Geographical variations were also kept in view. Our intension was highlighting ethical issues concern with unnecessary surgical operations. Henceforth we excluded such work that does not concern with ethical issues. Unnecessary surgery is that which is medically unjustifiable when the risks and costs are more than the likely therapeutic benefits or relief to the patient based on the patient's lifestyle requirements. To avoid or minimize such interventions basic seeding of ethics in curriculum and strict laws will definitely helpful in clinical practice. In conclusion, our aim was to highlight this major issue and underline need of competency based medical bioethics education in Indian scenario. PMID:27190833

  12. Mobile Energy Laboratory Procedures

    SciTech Connect

    Armstrong, P.R.; Batishko, C.R.; Dittmer, A.L.; Hadley, D.L.; Stoops, J.L.

    1993-09-01

    Pacific Northwest Laboratory (PNL) has been tasked to plan and implement a framework for measuring and analyzing the efficiency of on-site energy conversion, distribution, and end-use application on federal facilities as part of its overall technical support to the US Department of Energy (DOE) Federal Energy Management Program (FEMP). The Mobile Energy Laboratory (MEL) Procedures establish guidelines for specific activities performed by PNL staff. PNL provided sophisticated energy monitoring, auditing, and analysis equipment for on-site evaluation of energy use efficiency. Specially trained engineers and technicians were provided to conduct tests in a safe and efficient manner with the assistance of host facility staff and contractors. Reports were produced to describe test procedures, results, and suggested courses of action. These reports may be used to justify changes in operating procedures, maintenance efforts, system designs, or energy-using equipment. The MEL capabilities can subsequently be used to assess the results of energy conservation projects. These procedures recognize the need for centralized NM administration, test procedure development, operator training, and technical oversight. This need is evidenced by increasing requests fbr MEL use and the economies available by having trained, full-time MEL operators and near continuous MEL operation. DOE will assign new equipment and upgrade existing equipment as new capabilities are developed. The equipment and trained technicians will be made available to federal agencies that provide funding for the direct costs associated with MEL use.

  13. Organizational Adaptation and Higher Education.

    ERIC Educational Resources Information Center

    Cameron, Kim S.

    1984-01-01

    Organizational adaptation and types of adaptation needed in academe in the future are reviewed and major conceptual approaches to organizational adaptation are presented. The probable environment that institutions will face in the future that will require adaptation is discussed. (MLW)

  14. Human heat adaptation.

    PubMed

    Taylor, Nigel A S

    2014-01-01

    In this overview, human morphological and functional adaptations during naturally and artificially induced heat adaptation are explored. Through discussions of adaptation theory and practice, a theoretical basis is constructed for evaluating heat adaptation. It will be argued that some adaptations are specific to the treatment used, while others are generalized. Regarding ethnic differences in heat tolerance, the case is put that reported differences in heat tolerance are not due to natural selection, but can be explained on the basis of variations in adaptation opportunity. These concepts are expanded to illustrate how traditional heat adaptation and acclimatization represent forms of habituation, and thermal clamping (controlled hyperthermia) is proposed as a superior model for mechanistic research. Indeed, this technique has led to questioning the perceived wisdom of body-fluid changes, such as the expansion and subsequent decay of plasma volume, and sudomotor function, including sweat habituation and redistribution. Throughout, this contribution was aimed at taking another step toward understanding the phenomenon of heat adaptation and stimulating future research. In this regard, research questions are posed concerning the influence that variations in morphological configuration may exert upon adaptation, the determinants of postexercise plasma volume recovery, and the physiological mechanisms that modify the cholinergic sensitivity of sweat glands, and changes in basal metabolic rate and body core temperature following adaptation.

  15. Fermi LAT search for internal bremsstrahlung signatures from dark matter annihilation

    SciTech Connect

    Bringmann, Torsten; Huang, Xiaoyuan; Ibarra, Alejandro; Vogl, Stefan; Weniger, Christoph E-mail: x_huang@bao.ac.cn E-mail: stefan.vogl@tum.de

    2012-07-01

    A commonly encountered obstacle in indirect searches for galactic dark matter is how to disentangle possible signals from astrophysical backgrounds. Given that such signals are most likely subdominant, the search for pronounced spectral features plays a key role for indirect detection experiments; monochromatic gamma-ray lines or similar features related to internal bremsstrahlung, in particular, provide smoking gun signatures. We perform a dedicated search for the latter in the data taken by the Fermi gamma-ray space telescope during its first 43 months. To this end, we use a new adaptive procedure to select optimal target regions that takes into account both standard and contracted dark matter profiles. The behaviour of our statistical method is tested by a subsampling analysis of the full sky data and found to reproduce the theoretical expectations very well. The limits on the dark matter annihilation cross-section that we derive are stronger than what can be obtained from the observation of dwarf galaxies and, at least for the model considered here, collider searches. While these limits are still not quite strong enough to probe annihilation rates expected for thermally produced dark matter, future prospects to do so are very good. In fact, we already find a weak indication, with a significance of 3.1σ (4.3σ) when (not) taking into account the look-elsewhere effect, for an internal bremsstrahlung-like signal that would correspond to a dark matter mass of ∼150 GeV; the same signal is also well fitted by a gamma-ray line at around 130 GeV. Although this would be a fascinating possibility, we caution that a much more dedicated analysis and additional data will be necessary to rule out or confirm this option.

  16. Fermi LAT search for internal bremsstrahlung signatures from dark matter annihilation

    NASA Astrophysics Data System (ADS)

    Bringmann, Torsten; Huang, Xiaoyuan; Ibarra, Alejandro; Vogl, Stefan; Weniger, Christoph

    2012-07-01

    A commonly encountered obstacle in indirect searches for galactic dark matter is how to disentangle possible signals from astrophysical backgrounds. Given that such signals are most likely subdominant, the search for pronounced spectral features plays a key role for indirect detection experiments; monochromatic gamma-ray lines or similar features related to internal bremsstrahlung, in particular, provide smoking gun signatures. We perform a dedicated search for the latter in the data taken by the Fermi gamma-ray space telescope during its first 43 months. To this end, we use a new adaptive procedure to select optimal target regions that takes into account both standard and contracted dark matter profiles. The behaviour of our statistical method is tested by a subsampling analysis of the full sky data and found to reproduce the theoretical expectations very well. The limits on the dark matter annihilation cross-section that we derive are stronger than what can be obtained from the observation of dwarf galaxies and, at least for the model considered here, collider searches. While these limits are still not quite strong enough to probe annihilation rates expected for thermally produced dark matter, future prospects to do so are very good. In fact, we already find a weak indication, with a significance of 3.1σ (4.3σ) when (not) taking into account the look-elsewhere effect, for an internal bremsstrahlung-like signal that would correspond to a dark matter mass of ~150 GeV; the same signal is also well fitted by a gamma-ray line at around 130 GeV. Although this would be a fascinating possibility, we caution that a much more dedicated analysis and additional data will be necessary to rule out or confirm this option.

  17. A framework for constructing adaptive and reconfigurable systems

    SciTech Connect

    Poirot, Pierre-Etienne; Nogiec, Jerzy; Ren, Shangping; /IIT, Chicago

    2007-05-01

    This paper presents a software approach to augmenting existing real-time systems with self-adaptation capabilities. In this approach, based on the control loop paradigm commonly used in industrial control, self-adaptation is decomposed into observing system events, inferring necessary changes based on a system's functional model, and activating appropriate adaptation procedures. The solution adopts an architectural decomposition that emphasizes independence and separation of concerns. It encapsulates observation, modeling and correction into separate modules to allow for easier customization of the adaptive behavior and flexibility in selecting implementation technologies.

  18. Monte Carlo procedure for protein design

    NASA Astrophysics Data System (ADS)

    Irbäck, Anders; Peterson, Carsten; Potthast, Frank; Sandelin, Erik

    1998-11-01

    A method for sequence optimization in protein models is presented. The approach, which has inherited its basic philosophy from recent work by Deutsch and Kurosky [Phys. Rev. Lett. 76, 323 (1996)] by maximizing conditional probabilities rather than minimizing energy functions, is based upon a different and very efficient multisequence Monte Carlo scheme. By construction, the method ensures that the designed sequences represent good folders thermodynamically. A bootstrap procedure for the sequence space search is devised making very large chains feasible. The algorithm is successfully explored on the two-dimensional HP model [K. F. Lau and K. A. Dill, Macromolecules 32, 3986 (1989)] with chain lengths N=16, 18, and 32.

  19. Cognition and procedure representational requirements for predictive human performance models

    NASA Technical Reports Server (NTRS)

    Corker, K.

    1992-01-01

    including procedural backtracking with concurrent search, temporal reasoning, and constraint checking for partial ordering of procedures. Finally, the representation is being linked to models of human decision making processes that include heuristic, propositional and prescriptive judgement models that are sensitive to the procedural content in which the valuative functions are being performed.

  20. Environmental Test Screening Procedure

    NASA Technical Reports Server (NTRS)

    Zeidler, Janet

    2000-01-01

    This procedure describes the methods to be used for environmental stress screening (ESS) of the Lightning Mapper Sensor (LMS) lens assembly. Unless otherwise specified, the procedures shall be completed in the order listed, prior to performance of the Acceptance Test Procedure (ATP). The first unit, S/N 001, will be subjected to the Qualification Vibration Levels, while the remainder will be tested at the Operational Level. Prior to ESS, all units will undergo Pre-ESS Functional Testing that includes measuring the on-axis and plus or minus 0.95 full field Modulation Transfer Function and Back Focal Length. Next, all units will undergo ESS testing, and then Acceptance testing per PR 460.

  1. Robots that can adapt like animals.

    PubMed

    Cully, Antoine; Clune, Jeff; Tarapore, Danesh; Mouret, Jean-Baptiste

    2015-05-28

    Robots have transformed many industries, most notably manufacturing, and have the power to deliver tremendous benefits to society, such as in search and rescue, disaster response, health care and transportation. They are also invaluable tools for scientific exploration in environments inaccessible to humans, from distant planets to deep oceans. A major obstacle to their widespread adoption in more complex environments outside factories is their fragility. Whereas animals can quickly adapt to injuries, current robots cannot 'think outside the box' to find a compensatory behaviour when they are damaged: they are limited to their pre-specified self-sensing abilities, can diagnose only anticipated failure modes, and require a pre-programmed contingency plan for every type of potential damage, an impracticality for complex robots. A promising approach to reducing robot fragility involves having robots learn appropriate behaviours in response to damage, but current techniques are slow even with small, constrained search spaces. Here we introduce an intelligent trial-and-error algorithm that allows robots to adapt to damage in less than two minutes in large search spaces without requiring self-diagnosis or pre-specified contingency plans. Before the robot is deployed, it uses a novel technique to create a detailed map of the space of high-performing behaviours. This map represents the robot's prior knowledge about what behaviours it can perform and their value. When the robot is damaged, it uses this prior knowledge to guide a trial-and-error learning algorithm that conducts intelligent experiments to rapidly discover a behaviour that compensates for the damage. Experiments reveal successful adaptations for a legged robot injured in five different ways, including damaged, broken, and missing legs, and for a robotic arm with joints broken in 14 different ways. This new algorithm will enable more robust, effective, autonomous robots, and may shed light on the principles

  2. Robots that can adapt like animals.

    PubMed

    Cully, Antoine; Clune, Jeff; Tarapore, Danesh; Mouret, Jean-Baptiste

    2015-05-28

    Robots have transformed many industries, most notably manufacturing, and have the power to deliver tremendous benefits to society, such as in search and rescue, disaster response, health care and transportation. They are also invaluable tools for scientific exploration in environments inaccessible to humans, from distant planets to deep oceans. A major obstacle to their widespread adoption in more complex environments outside factories is their fragility. Whereas animals can quickly adapt to injuries, current robots cannot 'think outside the box' to find a compensatory behaviour when they are damaged: they are limited to their pre-specified self-sensing abilities, can diagnose only anticipated failure modes, and require a pre-programmed contingency plan for every type of potential damage, an impracticality for complex robots. A promising approach to reducing robot fragility involves having robots learn appropriate behaviours in response to damage, but current techniques are slow even with small, constrained search spaces. Here we introduce an intelligent trial-and-error algorithm that allows robots to adapt to damage in less than two minutes in large search spaces without requiring self-diagnosis or pre-specified contingency plans. Before the robot is deployed, it uses a novel technique to create a detailed map of the space of high-performing behaviours. This map represents the robot's prior knowledge about what behaviours it can perform and their value. When the robot is damaged, it uses this prior knowledge to guide a trial-and-error learning algorithm that conducts intelligent experiments to rapidly discover a behaviour that compensates for the damage. Experiments reveal successful adaptations for a legged robot injured in five different ways, including damaged, broken, and missing legs, and for a robotic arm with joints broken in 14 different ways. This new algorithm will enable more robust, effective, autonomous robots, and may shed light on the principles

  3. Robots that can adapt like animals

    NASA Astrophysics Data System (ADS)

    Cully, Antoine; Clune, Jeff; Tarapore, Danesh; Mouret, Jean-Baptiste

    2015-05-01

    Robots have transformed many industries, most notably manufacturing, and have the power to deliver tremendous benefits to society, such as in search and rescue, disaster response, health care and transportation. They are also invaluable tools for scientific exploration in environments inaccessible to humans, from distant planets to deep oceans. A major obstacle to their widespread adoption in more complex environments outside factories is their fragility. Whereas animals can quickly adapt to injuries, current robots cannot `think outside the box' to find a compensatory behaviour when they are damaged: they are limited to their pre-specified self-sensing abilities, can diagnose only anticipated failure modes, and require a pre-programmed contingency plan for every type of potential damage, an impracticality for complex robots. A promising approach to reducing robot fragility involves having robots learn appropriate behaviours in response to damage, but current techniques are slow even with small, constrained search spaces. Here we introduce an intelligent trial-and-error algorithm that allows robots to adapt to damage in less than two minutes in large search spaces without requiring self-diagnosis or pre-specified contingency plans. Before the robot is deployed, it uses a novel technique to create a detailed map of the space of high-performing behaviours. This map represents the robot's prior knowledge about what behaviours it can perform and their value. When the robot is damaged, it uses this prior knowledge to guide a trial-and-error learning algorithm that conducts intelligent experiments to rapidly discover a behaviour that compensates for the damage. Experiments reveal successful adaptations for a legged robot injured in five different ways, including damaged, broken, and missing legs, and for a robotic arm with joints broken in 14 different ways. This new algorithm will enable more robust, effective, autonomous robots, and may shed light on the principles

  4. 32 CFR 1905.4 - Procedure for production.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... procedures set forth in this section. (b) The General Counsel of CIA and Deputy Directors or Heads of... available to CIA prior to the start of any search for information responsive to the demand. CIA may, in its... non-appealable disposition of any such defenses and objections raised by CIA has been made by...

  5. Arianespace streamlines launch procedures

    NASA Astrophysics Data System (ADS)

    Lenorovitch, Jeffrey M.

    1992-06-01

    Ariane has entered a new operational phase in which launch procedures have been enhanced to reduce the length of launch campaigns, lower mission costs, and increase operational availability/flexibility of the three-stage vehicle. The V50 mission utilized the first vehicle from a 50-launcher production lot ordered by Arianespace, and was the initial flight with a stretched third stage that enhances Ariane's performance. New operational procedures were introduced gradually over more than a year, starting with the V42 launch in January 1991.

  6. Mini-Bentall procedure

    PubMed Central

    2015-01-01

    An important goal in cardiovascular and thoracic surgery is reducing surgical trauma to achieve faster recovery for our patients. Mini-Bentall procedure encompasses aortic root and ascending aortic replacement with re-implantation of coronary buttons, performed via a mini-sternotomy. The skin incision extends from the angle of Louis to the third intercostal space, usually measuring 5-7 cm in length. Through this incision, it is possible to perform isolated aortic root surgery and/or hemi-arch replacement. The present illustrated article describes the technical details on how I perform a Mini-Bentall procedure with hemi-arch replacement. PMID:25870816

  7. Technology transfer for adaptation

    NASA Astrophysics Data System (ADS)

    Biagini, Bonizella; Kuhl, Laura; Gallagher, Kelly Sims; Ortiz, Claudia

    2014-09-01

    Technology alone will not be able to solve adaptation challenges, but it is likely to play an important role. As a result of the role of technology in adaptation and the importance of international collaboration for climate change, technology transfer for adaptation is a critical but understudied issue. Through an analysis of Global Environment Facility-managed adaptation projects, we find there is significantly more technology transfer occurring in adaptation projects than might be expected given the pessimistic rhetoric surrounding technology transfer for adaptation. Most projects focused on demonstration and early deployment/niche formation for existing technologies rather than earlier stages of innovation, which is understandable considering the pilot nature of the projects. Key challenges for the transfer process, including technology selection and appropriateness under climate change, markets and access to technology, and diffusion strategies are discussed in more detail.

  8. Origins of adaptive immunity.

    PubMed

    Liongue, Clifford; John, Liza B; Ward, Alister

    2011-01-01

    Adaptive immunity, involving distinctive antibody- and cell-mediated responses to specific antigens based on "memory" of previous exposure, is a hallmark of higher vertebrates. It has been argued that adaptive immunity arose rapidly, as articulated in the "big bang theory" surrounding its origins, which stresses the importance of coincident whole-genome duplications. Through a close examination of the key molecules and molecular processes underpinning adaptive immunity, this review suggests a less-extreme model, in which adaptive immunity emerged as part of longer evolutionary journey. Clearly, whole-genome duplications provided additional raw genetic materials that were vital to the emergence of adaptive immunity, but a variety of other genetic events were also required to generate some of the key molecules, whereas others were preexisting and simply co-opted into adaptive immunity.

  9. Adaptation and visual coding

    PubMed Central

    Webster, Michael A.

    2011-01-01

    Visual coding is a highly dynamic process and continuously adapting to the current viewing context. The perceptual changes that result from adaptation to recently viewed stimuli remain a powerful and popular tool for analyzing sensory mechanisms and plasticity. Over the last decade, the footprints of this adaptation have been tracked to both higher and lower levels of the visual pathway and over a wider range of timescales, revealing that visual processing is much more adaptable than previously thought. This work has also revealed that the pattern of aftereffects is similar across many stimulus dimensions, pointing to common coding principles in which adaptation plays a central role. However, why visual coding adapts has yet to be fully answered. PMID:21602298

  10. Parallel Anisotropic Tetrahedral Adaptation

    NASA Technical Reports Server (NTRS)

    Park, Michael A.; Darmofal, David L.

    2008-01-01

    An adaptive method that robustly produces high aspect ratio tetrahedra to a general 3D metric specification without introducing hybrid semi-structured regions is presented. The elemental operators and higher-level logic is described with their respective domain-decomposed parallelizations. An anisotropic tetrahedral grid adaptation scheme is demonstrated for 1000-1 stretching for a simple cube geometry. This form of adaptation is applicable to more complex domain boundaries via a cut-cell approach as demonstrated by a parallel 3D supersonic simulation of a complex fighter aircraft. To avoid the assumptions and approximations required to form a metric to specify adaptation, an approach is introduced that directly evaluates interpolation error. The grid is adapted to reduce and equidistribute this interpolation error calculation without the use of an intervening anisotropic metric. Direct interpolation error adaptation is illustrated for 1D and 3D domains.

  11. Origins of adaptive immunity.

    PubMed

    Liongue, Clifford; John, Liza B; Ward, Alister

    2011-01-01

    Adaptive immunity, involving distinctive antibody- and cell-mediated responses to specific antigens based on "memory" of previous exposure, is a hallmark of higher vertebrates. It has been argued that adaptive immunity arose rapidly, as articulated in the "big bang theory" surrounding its origins, which stresses the importance of coincident whole-genome duplications. Through a close examination of the key molecules and molecular processes underpinning adaptive immunity, this review suggests a less-extreme model, in which adaptive immunity emerged as part of longer evolutionary journey. Clearly, whole-genome duplications provided additional raw genetic materials that were vital to the emergence of adaptive immunity, but a variety of other genetic events were also required to generate some of the key molecules, whereas others were preexisting and simply co-opted into adaptive immunity. PMID:21395512

  12. Gravitational adaptation of animals

    NASA Technical Reports Server (NTRS)

    Smith, A. H.; Burton, R. R.

    1982-01-01

    The effect of gravitational adaptation is studied in a group of five Leghorn cocks which had become physiologically adapted to 2 G after 162 days of centrifugation. After this period of adaptation, they are periodically exposed to a 2 G field, accompanied by five previously unexposed hatch-mates, and the degree of retained acceleration adaptation is estimated from the decrease in lymphocyte frequency after 24 hr at 2 G. Results show that the previously adapted birds exhibit an 84% greater lymphopenia than the unexposed birds, and that the lymphocyte frequency does not decrease to a level below that found at the end of 162 days at 2 G. In addition, the capacity for adaptation to chronic acceleration is found to be highly heritable. An acceleration tolerant strain of birds shows lesser mortality during chronic acceleration, particularly in intermediate fields, although the result of acceleration selection is largely quantitative (a greater number of survivors) rather than qualitative (behavioral or physiological changes).

  13. Toddler test or procedure preparation

    MedlinePlus

    Preparing toddler for test/procedure; Test/procedure preparation - toddler; Preparing for a medical test or procedure - toddler ... Before the test, know that your child will probably cry. Even if you prepare, your child may feel some discomfort or ...

  14. Preschooler test or procedure preparation

    MedlinePlus

    Preparing preschoolers for test/procedure; Test/procedure preparation - preschooler ... Preparing children for medical tests can reduce their distress. It can also make them less likely to cry and resist the procedure. Research shows that ...

  15. An Adaptive Motion Estimation Scheme for Video Coding

    PubMed Central

    Gao, Yuan; Jia, Kebin

    2014-01-01

    The unsymmetrical-cross multihexagon-grid search (UMHexagonS) is one of the best fast Motion Estimation (ME) algorithms in video encoding software. It achieves an excellent coding performance by using hybrid block matching search pattern and multiple initial search point predictors at the cost of the computational complexity of ME increased. Reducing time consuming of ME is one of the key factors to improve video coding efficiency. In this paper, we propose an adaptive motion estimation scheme to further reduce the calculation redundancy of UMHexagonS. Firstly, new motion estimation search patterns have been designed according to the statistical results of motion vector (MV) distribution information. Then, design a MV distribution prediction method, including prediction of the size of MV and the direction of MV. At last, according to the MV distribution prediction results, achieve self-adaptive subregional searching by the new estimation search patterns. Experimental results show that more than 50% of total search points are dramatically reduced compared to the UMHexagonS algorithm in JM 18.4 of H.264/AVC. As a result, the proposed algorithm scheme can save the ME time up to 20.86% while the rate-distortion performance is not compromised. PMID:24672313

  16. An adaptive motion estimation scheme for video coding.

    PubMed

    Liu, Pengyu; Gao, Yuan; Jia, Kebin

    2014-01-01

    The unsymmetrical-cross multihexagon-grid search (UMHexagonS) is one of the best fast Motion Estimation (ME) algorithms in video encoding software. It achieves an excellent coding performance by using hybrid block matching search pattern and multiple initial search point predictors at the cost of the computational complexity of ME increased. Reducing time consuming of ME is one of the key factors to improve video coding efficiency. In this paper, we propose an adaptive motion estimation scheme to further reduce the calculation redundancy of UMHexagonS. Firstly, new motion estimation search patterns have been designed according to the statistical results of motion vector (MV) distribution information. Then, design a MV distribution prediction method, including prediction of the size of MV and the direction of MV. At last, according to the MV distribution prediction results, achieve self-adaptive subregional searching by the new estimation search patterns. Experimental results show that more than 50% of total search points are dramatically reduced compared to the UMHexagonS algorithm in JM 18.4 of H.264/AVC. As a result, the proposed algorithm scheme can save the ME time up to 20.86% while the rate-distortion performance is not compromised.

  17. Demystifying the Search Button

    PubMed Central

    McKeever, Liam; Nguyen, Van; Peterson, Sarah J.; Gomez-Perez, Sandra

    2015-01-01

    A thorough review of the literature is the basis of all research and evidence-based practice. A gold-standard efficient and exhaustive search strategy is needed to ensure all relevant citations have been captured and that the search performed is reproducible. The PubMed database comprises both the MEDLINE and non-MEDLINE databases. MEDLINE-based search strategies are robust but capture only 89% of the total available citations in PubMed. The remaining 11% include the most recent and possibly relevant citations but are only searchable through less efficient techniques. An effective search strategy must employ both the MEDLINE and the non-MEDLINE portion of PubMed to ensure all studies have been identified. The robust MEDLINE search strategies are used for the MEDLINE portion of the search. Usage of the less robust strategies is then efficiently confined to search only the remaining 11% of PubMed citations that have not been indexed for MEDLINE. The current article offers step-by-step instructions for building such a search exploring methods for the discovery of medical subject heading (MeSH) terms to search MEDLINE, text-based methods for exploring the non-MEDLINE database, information on the limitations of convenience algorithms such as the “related citations feature,” the strengths and pitfalls associated with commonly used filters, the proper usage of Boolean operators to organize a master search strategy, and instructions for automating that search through “MyNCBI” to receive search query updates by email as new citations become available. PMID:26129895

  18. Experimental adaptive Bayesian tomography

    NASA Astrophysics Data System (ADS)

    Kravtsov, K. S.; Straupe, S. S.; Radchenko, I. V.; Houlsby, N. M. T.; Huszár, F.; Kulik, S. P.

    2013-06-01

    We report an experimental realization of an adaptive quantum state tomography protocol. Our method takes advantage of a Bayesian approach to statistical inference and is naturally tailored for adaptive strategies. For pure states, we observe close to N-1 scaling of infidelity with overall number of registered events, while the best nonadaptive protocols allow for N-1/2 scaling only. Experiments are performed for polarization qubits, but the approach is readily adapted to any dimension.

  19. Adaptive Pairing Reversible Watermarking.

    PubMed

    Dragoi, Ioan-Catalin; Coltuc, Dinu

    2016-05-01

    This letter revisits the pairwise reversible watermarking scheme of Ou et al., 2013. An adaptive pixel pairing that considers only pixels with similar prediction errors is introduced. This adaptive approach provides an increased number of pixel pairs where both pixels are embedded and decreases the number of shifted pixels. The adaptive pairwise reversible watermarking outperforms the state-of-the-art low embedding bit-rate schemes proposed so far.

  20. Adaptation as organism design

    PubMed Central

    Gardner, Andy

    2009-01-01

    The problem of adaptation is to explain the apparent design of organisms. Darwin solved this problem with the theory of natural selection. However, population geneticists, whose responsibility it is to formalize evolutionary theory, have long neglected the link between natural selection and organismal design. Here, I review the major historical developments in theory of organismal adaptation, clarifying what adaptation is and what it is not, and I point out future avenues for research. PMID:19793739

  1. Digital adaptive sampling.

    NASA Technical Reports Server (NTRS)

    Breazeale, G. J.; Jones, L. E.

    1971-01-01

    Discussion of digital adaptive sampling, which is consistently better than fixed sampling in noise-free cases. Adaptive sampling is shown to be feasible and, it is considered, should be studied further. It should be noted that adaptive sampling is a class of variable rate sampling in which the variability depends on system signals. Digital rather than analog laws should be studied, because cases can arise in which the analog signals are not even available. An extremely important problem is implementation.

  2. Quantifying the Adaptive Cycle.

    PubMed

    Angeler, David G; Allen, Craig R; Garmestani, Ahjond S; Gunderson, Lance H; Hjerne, Olle; Winder, Monika

    2015-01-01

    The adaptive cycle was proposed as a conceptual model to portray patterns of change in complex systems. Despite the model having potential for elucidating change across systems, it has been used mainly as a metaphor, describing system dynamics qualitatively. We use a quantitative approach for testing premises (reorganisation, conservatism, adaptation) in the adaptive cycle, using Baltic Sea phytoplankton communities as an example of such complex system dynamics. Phytoplankton organizes in recurring spring and summer blooms, a well-established paradigm in planktology and succession theory, with characteristic temporal trajectories during blooms that may be consistent with adaptive cycle phases. We used long-term (1994-2011) data and multivariate analysis of community structure to assess key components of the adaptive cycle. Specifically, we tested predictions about: reorganisation: spring and summer blooms comprise distinct community states; conservatism: community trajectories during individual adaptive cycles are conservative; and adaptation: phytoplankton species during blooms change in the long term. All predictions were supported by our analyses. Results suggest that traditional ecological paradigms such as phytoplankton successional models have potential for moving the adaptive cycle from a metaphor to a framework that can improve our understanding how complex systems organize and reorganize following collapse. Quantifying reorganization, conservatism and adaptation provides opportunities to cope with the intricacies and uncertainties associated with fast ecological change, driven by shifting system controls. Ultimately, combining traditional ecological paradigms with heuristics of complex system dynamics using quantitative approaches may help refine ecological theory and improve our understanding of the resilience of ecosystems. PMID:26716453

  3. Quantifying the adaptive cycle

    USGS Publications Warehouse

    Angeler, David G.; Allen, Craig R.; Garmestani, Ahjond S.; Gunderson, Lance H.; Hjerne, Olle; Winder, Monika

    2015-01-01

    The adaptive cycle was proposed as a conceptual model to portray patterns of change in complex systems. Despite the model having potential for elucidating change across systems, it has been used mainly as a metaphor, describing system dynamics qualitatively. We use a quantitative approach for testing premises (reorganisation, conservatism, adaptation) in the adaptive cycle, using Baltic Sea phytoplankton communities as an example of such complex system dynamics. Phytoplankton organizes in recurring spring and summer blooms, a well-established paradigm in planktology and succession theory, with characteristic temporal trajectories during blooms that may be consistent with adaptive cycle phases. We used long-term (1994–2011) data and multivariate analysis of community structure to assess key components of the adaptive cycle. Specifically, we tested predictions about: reorganisation: spring and summer blooms comprise distinct community states; conservatism: community trajectories during individual adaptive cycles are conservative; and adaptation: phytoplankton species during blooms change in the long term. All predictions were supported by our analyses. Results suggest that traditional ecological paradigms such as phytoplankton successional models have potential for moving the adaptive cycle from a metaphor to a framework that can improve our understanding how complex systems organize and reorganize following collapse. Quantifying reorganization, conservatism and adaptation provides opportunities to cope with the intricacies and uncertainties associated with fast ecological change, driven by shifting system controls. Ultimately, combining traditional ecological paradigms with heuristics of complex system dynamics using quantitative approaches may help refine ecological theory and improve our understanding of the resilience of ecosystems.

  4. Human adaptation to smog

    SciTech Connect

    Evans, G.W. Jacobs, S.V.; Frager, N.B.

    1982-10-01

    This study examined the health effects of human adaptation to photochemical smog. A group of recent arrivals to the Los Angeles air basin were compared to long-term residents of the basin. Evidence for adaptation included greater irritation and respiratory problems among the recent arrivals and desensitization among the long-term residents in their judgments of the severity of the smog problem to their health. There was no evidence for biochemical adaptation as measured by hemoglobin response to oxidant challenge. The results were discussed in terms of psychological adaption to chronic environmental stressors.

  5. Adaptive parallel logic networks

    NASA Technical Reports Server (NTRS)

    Martinez, Tony R.; Vidal, Jacques J.

    1988-01-01

    Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.

  6. Quantifying the Adaptive Cycle

    PubMed Central

    Angeler, David G.; Allen, Craig R.; Garmestani, Ahjond S.; Gunderson, Lance H.; Hjerne, Olle; Winder, Monika

    2015-01-01

    The adaptive cycle was proposed as a conceptual model to portray patterns of change in complex systems. Despite the model having potential for elucidating change across systems, it has been used mainly as a metaphor, describing system dynamics qualitatively. We use a quantitative approach for testing premises (reorganisation, conservatism, adaptation) in the adaptive cycle, using Baltic Sea phytoplankton communities as an example of such complex system dynamics. Phytoplankton organizes in recurring spring and summer blooms, a well-established paradigm in planktology and succession theory, with characteristic temporal trajectories during blooms that may be consistent with adaptive cycle phases. We used long-term (1994–2011) data and multivariate analysis of community structure to assess key components of the adaptive cycle. Specifically, we tested predictions about: reorganisation: spring and summer blooms comprise distinct community states; conservatism: community trajectories during individual adaptive cycles are conservative; and adaptation: phytoplankton species during blooms change in the long term. All predictions were supported by our analyses. Results suggest that traditional ecological paradigms such as phytoplankton successional models have potential for moving the adaptive cycle from a metaphor to a framework that can improve our understanding how complex systems organize and reorganize following collapse. Quantifying reorganization, conservatism and adaptation provides opportunities to cope with the intricacies and uncertainties associated with fast ecological change, driven by shifting system controls. Ultimately, combining traditional ecological paradigms with heuristics of complex system dynamics using quantitative approaches may help refine ecological theory and improve our understanding of the resilience of ecosystems. PMID:26716453

  7. Decentralized adaptive control

    NASA Technical Reports Server (NTRS)

    Oh, B. J.; Jamshidi, M.; Seraji, H.

    1988-01-01

    A decentralized adaptive control is proposed to stabilize and track the nonlinear, interconnected subsystems with unknown parameters. The adaptation of the controller gain is derived by using model reference adaptive control theory based on Lyapunov's direct method. The adaptive gains consist of sigma, proportional, and integral combination of the measured and reference values of the corresponding subsystem. The proposed control is applied to the joint control of a two-link robot manipulator, and the performance in computer simulation corresponds with what is expected in theoretical development.

  8. Impact of adaptation time on contrast sensitivity

    NASA Astrophysics Data System (ADS)

    Apelt, Dörte; Strasburger, Hans; Klein, Jan; Preim, Bernhard

    2010-02-01

    For softcopy-reading of mammograms, a room illuminance of 10 lx is recommended in standard procedures. Room illuminance affects both the maximal monitor contrast and the global luminance adaptation of the visual system. A radiologist observer has to adapt to low luminance levels, when entering the reading room. Since the observer's sensitivity to low-contrast patterns depends on adaptation state and processes, it would be expected that the contrast sensitivity is lower at the beginning of a reading session. We investigated the effect of an initial time of dark adaptation on the contrast sensitivity. A study with eight observers was conducted in the context of mammographic softcopy-reading. Using Gabor patterns with varying spatial frequency, orientation, and contrast level as stimuli in an orientation discrimination task, the intra-observer contrast sensitivity was determined for foveal vision. Before performing the discrimination task, the observers adapted for two minutes to an average illuminance of 450 lx. Thereafter, contrast thresholds were repeatedly measured at 10 lx room illuminance over a course of 15 minutes. The results show no significant variations in contrast sensitivity during the 15 minutes period. Thus, it can be concluded that taking an initial adaptation time does not affect the perception of lowcontrast objects in mammographic images presented in the typical softcopy-reading environment. Therefore, the reading performance would not be negatively influenced when the observer started immediately with reading of mammograms. The results can be used to optimize the workflow in the radiology reading room.

  9. Simulating Laboratory Procedures.

    ERIC Educational Resources Information Center

    Baker, J. E.; And Others

    1986-01-01

    Describes the use of computer assisted instruction in a medical microbiology course. Presents examples of how computer assisted instruction can present case histories in which the laboratory procedures are simulated. Discusses an authoring system used to prepare computer simulations and provides one example of a case history dealing with fractured…

  10. Numerical Boundary Condition Procedures

    NASA Technical Reports Server (NTRS)

    1981-01-01

    Topics include numerical procedures for treating inflow and outflow boundaries, steady and unsteady discontinuous surfaces, far field boundaries, and multiblock grids. In addition, the effects of numerical boundary approximations on stability, accuracy, and convergence rate of the numerical solution are discussed.

  11. Least Squares Procedures.

    ERIC Educational Resources Information Center

    Hester, Yvette

    Least squares methods are sophisticated mathematical curve fitting procedures used in all classical parametric methods. The linear least squares approximation is most often associated with finding the "line of best fit" or the regression line. Since all statistical analyses are correlational and all classical parametric methods are least square…

  12. Advanced intrarenal ureteroscopic procedures.

    PubMed

    Monga, Manoj; Beeman, William W

    2004-02-01

    The role of flexible ureteroscopy in the management of intrarenal pathology has undergone a dramatic evolution, powered by improvements in flexible ureteroscope design; deflection and image quality; diversification of small, disposable instrumentation; and the use of holmium laser lithotripsy. This article reviews the application of flexible ureteroscopy for advanced intrarenal procedures.

  13. Visual Screening: A Procedure.

    ERIC Educational Resources Information Center

    Williams, Robert T.

    Vision is a complex process involving three phases: physical (acuity), physiological (integrative), and psychological (perceptual). Although these phases cannot be considered discrete, they provide the basis for the visual screening procedure used by the Reading Services of Colorado State University and described in this document. Ten tests are…

  14. Student Loan Collection Procedures.

    ERIC Educational Resources Information Center

    National Association of College and University Business Officers, Washington, DC.

    This manual on the collection of student loans is intended for the use of business officers and loan collection personnel of colleges and universities of all sizes. The introductory chapter is an overview of sound collection practices and procedures. It discusses the making of a loan, in-school servicing of the accounts, the exit interview, the…

  15. PLATO Courseware Development Procedures.

    ERIC Educational Resources Information Center

    Mahler, William A.; And Others

    This is an exploratory study of methods for the preparation of computer curriculum materials. It deals with courseware development procedures for the PLATO IV computer-based education system, and draws on interviews with over 100 persons engaged in courseware production. The report presents a five stage model of development: (1) planning, (2)…

  16. Parliamentary Procedure Made Easy.

    ERIC Educational Resources Information Center

    Hayden, Ellen T.

    Based on the newly revised "Robert's Rules of Order," these self-contained learning activities will help students successfully and actively participate in school, social, civic, political, or professional organizations. There are 13 lessons. Topics studied include the what, why, and history of parliamentary procedure; characteristics of the ideal…

  17. Grievance Procedure Problems.

    ERIC Educational Resources Information Center

    Green, Gary J.

    This paper presents two actual problems involving grievance procedures. Both problems involve pending litigation and one of them involves pending arbitration. The first problem occurred in a wealthy Minnesota school district and involved a seniority list. Because of changes in the financial basis for supporting public schools, it became necessary…

  18. Procedures and Policies Manual

    ERIC Educational Resources Information Center

    Davis, Jane M.

    2006-01-01

    This document was developed by the Middle Tennessee State University James E. Walker Library Collection Management Department to provide policies and procedural guidelines for the cataloging and processing of bibliographic materials. This document includes policies for cataloging monographs, serials, government documents, machine-readable data…

  19. Educational Accounting Procedures.

    ERIC Educational Resources Information Center

    Tidwell, Sam B.

    This chapter of "Principles of School Business Management" reviews the functions, procedures, and reports with which school business officials must be familiar in order to interpret and make decisions regarding the school district's financial position. Among the accounting functions discussed are financial management, internal auditing, annual…

  20. Terrestrial photovoltaic measurement procedures

    NASA Technical Reports Server (NTRS)

    1977-01-01

    Procedures for obtaining cell and array current-voltage measurements both outdoors in natural sunlight and indoors in simulated sunlight are presented. A description of the necessary apparatus and equipment is given for the calibration and use of reference solar cells. Some comments relating to concentration cell measurements, and a revised terrestrial solar spectrum for use in theoretical calculations, are included.

  1. Job Search, Search Intensity, and Labor Market Transitions

    ERIC Educational Resources Information Center

    Bloemen, Hans G.

    2005-01-01

    Job searches by both the unemployed and employed jobseekers are studied through an empirical structural job search model using a choice variable of search intensity. The resulting influence of search intensity on the labor market transitions is analyzed to give the estimation results of the search and the impact of the benefit level on the search…

  2. How Users Search the Library from a Single Search Box

    ERIC Educational Resources Information Center

    Lown, Cory; Sierra, Tito; Boyer, Josh

    2013-01-01

    Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…

  3. Physiologic adaptation to space - Space adaptation syndrome

    NASA Technical Reports Server (NTRS)

    Vanderploeg, J. M.

    1985-01-01

    The adaptive changes of the neurovestibular system to microgravity, which result in space motion sickness (SMS), are studied. A list of symptoms, which range from vomiting to drowsiness, is provided. The two patterns of symptom development, rapid and gradual, and the duration of the symptoms are described. The concept of sensory conflict and rearrangements to explain SMS is being investigated.

  4. Gradient gravitational search: An efficient metaheuristic algorithm for global optimization.

    PubMed

    Dash, Tirtharaj; Sahu, Prabhat K

    2015-05-30

    The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. PMID:25779670

  5. Object tracking based on harmony search: comparative study

    NASA Astrophysics Data System (ADS)

    Gao, Ming-Liang; He, Xiao-Hai; Luo, Dai-Sheng; Yu, Yan-Mei

    2012-10-01

    Visual tracking can be treated as an optimization problem. A new meta-heuristic optimal algorithm, Harmony Search (HS), was first applied to perform visual tracking by Fourie et al. As the authors point out, many subjects are still required in ongoing research. Our work is a continuation of Fourie's study, with four prominent improved variations of HS, namely Improved Harmony Search (IHS), Global-best Harmony Search (GHS), Self-adaptive Harmony Search (SHS) and Differential Harmony Search (DHS) adopted into the tracking system. Their performances are tested and analyzed on multiple challenging video sequences. Experimental results show that IHS is best, with DHS ranking second among the four improved trackers when the iteration number is small. However, the differences between all four reduced gradually, along with the increasing number of iterations.

  6. LAHS: A novel harmony search algorithm based on learning automata

    NASA Astrophysics Data System (ADS)

    Enayatifar, Rasul; Yousefi, Moslem; Abdullah, Abdul Hanan; Darus, Amer Nordin

    2013-12-01

    This study presents a learning automata-based harmony search (LAHS) for unconstrained optimization of continuous problems. The harmony search (HS) algorithm performance strongly depends on the fine tuning of its parameters, including the harmony consideration rate (HMCR), pitch adjustment rate (PAR) and bandwidth (bw). Inspired by the spur-in-time responses in the musical improvisation process, learning capabilities are employed in the HS to select these parameters based on spontaneous reactions. An extensive numerical investigation is conducted on several well-known test functions, and the results are compared with the HS algorithm and its prominent variants, including the improved harmony search (IHS), global-best harmony search (GHS) and self-adaptive global-best harmony search (SGHS). The numerical results indicate that the LAHS is more efficient in finding optimum solutions and outperforms the existing HS algorithm variants.

  7. Neural Adaptation Effects in Conceptual Processing

    PubMed Central

    Marino, Barbara F. M.; Borghi, Anna M.; Gemmi, Luca; Cacciari, Cristina; Riggio, Lucia

    2015-01-01

    We investigated the conceptual processing of nouns referring to objects characterized by a highly typical color and orientation. We used a go/no-go task in which we asked participants to categorize each noun as referring or not to natural entities (e.g., animals) after a selective adaptation of color-edge neurons in the posterior LV4 region of the visual cortex was induced by means of a McCollough effect procedure. This manipulation affected categorization: the green-vertical adaptation led to slower responses than the green-horizontal adaptation, regardless of the specific color and orientation of the to-be-categorized noun. This result suggests that the conceptual processing of natural entities may entail the activation of modality-specific neural channels with weights proportional to the reliability of the signals produced by these channels during actual perception. This finding is discussed with reference to the debate about the grounded cognition view. PMID:26264031

  8. Dynamic Load Balancing for Adaptive Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Biswas, Rupak; Saini, Subhash (Technical Monitor)

    1998-01-01

    Dynamic mesh adaptation on unstructured grids is a powerful tool for computing unsteady three-dimensional problems that require grid modifications to efficiently resolve solution features. By locally refining and coarsening the mesh to capture phenomena of interest, such procedures make standard computational methods more cost effective. Highly refined meshes are required to accurately capture shock waves, contact discontinuities, vortices, and shear layers in fluid flow problems. Adaptive meshes have also proved to be useful in several other areas of computational science and engineering like computer vision and graphics, semiconductor device modeling, and structural mechanics. Local mesh adaptation provides the opportunity to obtain solutions that are comparable to those obtained on globally-refined grids but at a much lower cost. Additional information is contained in the original extended abstract.

  9. Combining local search and backtracking techniques for constraint satisfaction

    SciTech Connect

    Zhang, Jian; Zhang, Hantao

    1996-12-31

    Backtracking techniques are well-known traditional methods for solving many constraint satisfaction problems (CSPs) including the satisfiability (SAT) problem in the propositional logic. In recent years, it has been reported that local search techniques are very effective in solving some large-scale instances of the SAT problem. In this research, we combine the backtracking and local search techniques into a single method for solving SAT and CSPs. When setting a parameter of the method to either of its two extreme values, we obtain the ordinary backtracking procedure or the local search procedure. For some problems, if the parameter takes values in the middle of the two extremes, the new method is much more effective than either backtracking or local search. We tested the method with classical problems like the n-Queens and random SAT instances, as well as some difficult problems from finite mathematics. In particular, using the new method, we solved four open problems in design theory.

  10. [Surgical procedures for bone neoplasms in children].

    PubMed

    Woźniak, W

    1991-01-01

    The treatment of 40 patients with bone tumors have been presented. The primary tumors were located in the following sites: femur (14), tibia (8), fibula (4), humerus (4), scapula (1), clavicle (2), pelvis (5), hand (1). Investigated group were: osteosarcoma (18), Ewing's sarcoma (14), chondrosarcoma (2), fibrosarcoma (1), synovial sarcoma (1), chondroblastoma (4). In the most frequent malignant bone tumors, osteosarcoma and Ewing's sarcoma, unified management was adapted. The treatment was initiated with multidrug chemotherapy and followed by surgery or radiotherapy (Ewing's sarcoma) of the primary site. Surgery was performed in 30 cases: 19 mutilating operations because of the broad local invasion, 11 conservative surgical procedures (limb -- salvage operations). Satisfactory oncological and functional effect can be achieved after limb-salvage surgical procedures in the cases of localized, especially semimalignant bone tumors. PMID:1369876

  11. Artificial immune system based on adaptive clonal selection for feature selection and parameters optimisation of support vector machines

    NASA Astrophysics Data System (ADS)

    Sadat Hashemipour, Maryam; Soleimani, Seyed Ali

    2016-01-01

    Artificial immune system (AIS) algorithm based on clonal selection method can be defined as a soft computing method inspired by theoretical immune system in order to solve science and engineering problems. Support vector machine (SVM) is a popular pattern classification method with many diverse applications. Kernel parameter setting in the SVM training procedure along with the feature selection significantly impacts on the classification accuracy rate. In this study, AIS based on Adaptive Clonal Selection (AISACS) algorithm has been used to optimise the SVM parameters and feature subset selection without degrading the SVM classification accuracy. Several public datasets of University of California Irvine machine learning (UCI) repository are employed to calculate the classification accuracy rate in order to evaluate the AISACS approach then it was compared with grid search algorithm and Genetic Algorithm (GA) approach. The experimental results show that the feature reduction rate and running time of the AISACS approach are better than the GA approach.

  12. Coherent optical adaptive techniques.

    PubMed

    Bridges, W B; Brunner, P T; Lazzara, S P; Nussmeier, T A; O'Meara, T R; Sanguinet, J A; Brown, W P

    1974-02-01

    The theory of multidither adaptive optical radar phased arrays is briefly reviewed as an introduction to the experimental results obtained with seven-element linear and three-element triangular array systems operating at 0.6328 microm. Atmospheric turbulence compensation and adaptive tracking capabilities are demonstrated.

  13. Research, Adaptation, & Change.

    ERIC Educational Resources Information Center

    Morris, Lee A., Ed.; And Others

    Research adaptation is an endeavor that implies solid collaboration among school practitioners and university and college researchers. This volume addresses the broad issues of research as an educational endeavor, adaptation as a necessary function associated with applying research findings to school situations, and change as an inevitable…

  14. Uncertainty in adaptive capacity

    NASA Astrophysics Data System (ADS)

    Adger, W. Neil; Vincent, Katharine

    2005-03-01

    The capacity to adapt is a critical element of the process of adaptation: it is the vector of resources that represent the asset base from which adaptation actions can be made. Adaptive capacity can in theory be identified and measured at various scales, from the individual to the nation. The assessment of uncertainty within such measures comes from the contested knowledge domain and theories surrounding the nature of the determinants of adaptive capacity and the human action of adaptation. While generic adaptive capacity at the national level, for example, is often postulated as being dependent on health, governance and political rights, and literacy, and economic well-being, the determinants of these variables at national levels are not widely understood. We outline the nature of this uncertainty for the major elements of adaptive capacity and illustrate these issues with the example of a social vulnerability index for countries in Africa. To cite this article: W.N. Adger, K. Vincent, C. R. Geoscience 337 (2005).

  15. [Postvagotomy adaptation syndrome].

    PubMed

    Shapovalov, V A

    1998-01-01

    It was established in experiment, that the changes of the natural resistance of organism indexes and of the peritoneal cavity cytology has compensatory-adaptational character while the denervation-adaptational syndrome occurrence and progress, which may be assessed as eustress. Vagotomy and operative trauma cause qualitatively different reactions of an organism.

  16. Adaptive Sampling Proxy Application

    2012-10-22

    ASPA is an implementation of an adaptive sampling algorithm [1-3], which is used to reduce the computational expense of computer simulations that couple disparate physical scales. The purpose of ASPA is to encapsulate the algorithms required for adaptive sampling independently from any specific application, so that alternative algorithms and programming models for exascale computers can be investigated more easily.

  17. Water Resource Adaptation Program

    EPA Science Inventory

    The Water Resource Adaptation Program (WRAP) contributes to the U.S. Environmental Protection Agency’s (U.S. EPA) efforts to provide water resource managers and decision makers with the tools needed to adapt water resources to demographic and economic development, and future clim...

  18. Retinal Imaging: Adaptive Optics

    NASA Astrophysics Data System (ADS)

    Goncharov, A. S.; Iroshnikov, N. G.; Larichev, Andrey V.

    This chapter describes several factors influencing the performance of ophthalmic diagnostic systems with adaptive optics compensation of human eye aberration. Particular attention is paid to speckle modulation, temporal behavior of aberrations, and anisoplanatic effects. The implementation of a fundus camera with adaptive optics is considered.

  19. Adaptive management for a turbulent future.

    PubMed

    Allen, Craig R; Fontaine, Joseph J; Pope, Kevin L; Garmestani, Ahjond S

    2011-05-01

    The challenges that face humanity today differ from the past because as the scale of human influence has increased, our biggest challenges have become global in nature, and formerly local problems that could be addressed by shifting populations or switching resources, now aggregate (i.e., "scale up") limiting potential management options. Adaptive management is an approach to natural resource management that emphasizes learning through management based on the philosophy that knowledge is incomplete and much of what we think we know is actually wrong. Adaptive management has explicit structure, including careful elucidation of goals, identification of alternative management objectives and hypotheses of causation, and procedures for the collection of data followed by evaluation and reiteration. It is evident that adaptive management has matured, but it has also reached a crossroads. Practitioners and scientists have developed adaptive management and structured decision making techniques, and mathematicians have developed methods to reduce the uncertainties encountered in resource management, yet there continues to be misapplication of the method and misunderstanding of its purpose. Ironically, the confusion over the term "adaptive management" may stem from the flexibility inherent in the approach, which has resulted in multiple interpretations of "adaptive management" that fall along a continuum of complexity and a priori design. Adaptive management is not a panacea for the navigation of 'wicked problems' as it does not produce easy answers, and is only appropriate in a subset of natural resource management problems where both uncertainty and controllability are high. Nonetheless, the conceptual underpinnings of adaptive management are simple; there will always be inherent uncertainty and unpredictability in the dynamics and behavior of complex social-ecological systems, but management decisions must still be made, and whenever possible, we should incorporate

  20. Adaptive management for a turbulent future

    USGS Publications Warehouse

    Allen, C.R.; Fontaine, J.J.; Pope, K.L.; Garmestani, A.S.

    2011-01-01

    The challenges that face humanity today differ from the past because as the scale of human influence has increased, our biggest challenges have become global in nature, and formerly local problems that could be addressed by shifting populations or switching resources, now aggregate (i.e., "scale up") limiting potential management options. Adaptive management is an approach to natural resource management that emphasizes learning through management based on the philosophy that knowledge is incomplete and much of what we think we know is actually wrong. Adaptive management has explicit structure, including careful elucidation of goals, identification of alternative management objectives and hypotheses of causation, and procedures for the collection of data followed by evaluation and reiteration. It is evident that adaptive management has matured, but it has also reached a crossroads. Practitioners and scientists have developed adaptive management and structured decision making techniques, and mathematicians have developed methods to reduce the uncertainties encountered in resource management, yet there continues to be misapplication of the method and misunderstanding of its purpose. Ironically, the confusion over the term "adaptive management" may stem from the flexibility inherent in the approach, which has resulted in multiple interpretations of "adaptive management" that fall along a continuum of complexity and a priori design. Adaptive management is not a panacea for the navigation of 'wicked problems' as it does not produce easy answers, and is only appropriate in a subset of natural resource management problems where both uncertainty and controllability are high. Nonetheless, the conceptual underpinnings of adaptive management are simple; there will always be inherent uncertainty and unpredictability in the dynamics and behavior of complex social-ecological systems, but management decisions must still be made, and whenever possible, we should incorporate

  1. Adaptive Management for a Turbulent Future

    USGS Publications Warehouse

    Allen, Craig R.; Fontaine, Joseph J.; Pope, Kevin L.; Garmestani, Ahjond S.

    2011-01-01

    The challenges that face humanity today differ from the past because as the scale of human influence has increased, our biggest challenges have become global in nature, and formerly local problems that could be addressed by shifting populations or switching resources, now aggregate (i.e., "scale up") limiting potential management options. Adaptive management is an approach to natural resource management that emphasizes learning through management based on the philosophy that knowledge is incomplete and much of what we think we know is actually wrong. Adaptive management has explicit structure, including careful elucidation of goals, identification of alternative management objectives and hypotheses of causation, and procedures for the collection of data followed by evaluation and reiteration. It is evident that adaptive management has matured, but it has also reached a crossroads. Practitioners and scientists have developed adaptive management and structured decision making techniques, and mathematicians have developed methods to reduce the uncertainties encountered in resource management, yet there continues to be misapplication of the method and misunderstanding of its purpose. Ironically, the confusion over the term "adaptive management" may stem from the flexibility inherent in the approach, which has resulted in multiple interpretations of "adaptive management" that fall along a continuum of complexity and a priori design. Adaptive management is not a panacea for the navigation of 'wicked problems' as it does not produce easy answers, and is only appropriate in a subset of natural resource management problems where both uncertainty and controllability are high. Nonetheless, the conceptual underpinnings of adaptive management are simple; there will always be inherent uncertainty and unpredictability in the dynamics and behavior of complex social-ecological systems, but management decisions must still be made, and whenever possible, we should incorporate

  2. Robust adaptive control of MEMS triaxial gyroscope using fuzzy compensator.

    PubMed

    Fei, Juntao; Zhou, Jian

    2012-12-01

    In this paper, a robust adaptive control strategy using a fuzzy compensator for MEMS triaxial gyroscope, which has system nonlinearities, including model uncertainties and external disturbances, is proposed. A fuzzy logic controller that could compensate for the model uncertainties and external disturbances is incorporated into the adaptive control scheme in the Lyapunov framework. The proposed adaptive fuzzy controller can guarantee the convergence and asymptotical stability of the closed-loop system. The proposed adaptive fuzzy control strategy does not depend on accurate mathematical models, which simplifies the design procedure. The innovative development of intelligent control methods incorporated with conventional control for the MEMS gyroscope is derived with the strict theoretical proof of the Lyapunov stability. Numerical simulations are investigated to verify the effectiveness of the proposed adaptive fuzzy control scheme and demonstrate the satisfactory tracking performance and robustness against model uncertainties and external disturbances compared with conventional adaptive control method.

  3. job.search@internet.

    ERIC Educational Resources Information Center

    Allen, Claudia.

    1995-01-01

    Presents job-hunting options and career opportunities available by searching the Internet, as well as tips for consulting others in a field of interest through a listserv or usenet news group. A collection of Internet addresses providing access to information on job search strategies or job availability is provided. (JPS)

  4. With News Search Engines

    ERIC Educational Resources Information Center

    Gunn, Holly

    2005-01-01

    Although there are many news search engines on the Web, finding the news items one wants can be challenging. Choosing appropriate search terms is one of the biggest challenges. Unless one has seen the article that one is seeking, it is often difficult to select words that were used in the headline or text of the article. The limited archives of…

  5. Using Quick Search.

    ERIC Educational Resources Information Center

    Maxfield, Sandy, Ed.; Kabus, Karl, Ed.

    This document is a guide to the use of Quick Search, a library service that provides access to more than 100 databases which contain references to journal articles and other research materials through two commercial systems--BRS After/Dark and DIALOG's Knowledge Index. The guide is divided into five sections: (1) Using Quick Search; (2) The…

  6. Fixing Dataset Search

    NASA Technical Reports Server (NTRS)

    Lynnes, Chris

    2014-01-01

    Three current search engines are queried for ozone data at the GES DISC. The results range from sub-optimal to counter-intuitive. We propose a method to fix dataset search by implementing a robust relevancy ranking scheme. The relevancy ranking scheme is based on several heuristics culled from more than 20 years of helping users select datasets.

  7. OpenSearch Status

    NASA Technical Reports Server (NTRS)

    Newman, Doug; Silva, Sam; Mitchell, Andrew

    2016-01-01

    We will present an overview of our OpenSearch efforts over the past 6 months. We will discuss our Best Practices and those of CEOS concentrating on the compatibility issues between the two. We will also discuss the state of earth data OpenSearch implementations and their adherence to the standards, extensions and best practices available.

  8. Intermittent search strategies

    NASA Astrophysics Data System (ADS)

    Bénichou, Olivier; Voituriez, Raphael

    2015-10-01

    The following sections are included: * Introduction * Animals looking for food * Model of intermittent search * Minimizing the search time * Should animals really perform Lévy strategies? * How does a protein find its target sequence on DNA? * Active intermittent transport in cells * Optimizing the kinetic rate constant * Robustness of the results * Conclusion * Bibliography

  9. Database Searching by Managers.

    ERIC Educational Resources Information Center

    Arnold, Stephen E.

    Managers and executives need the easy and quick access to business and management information that online databases can provide, but many have difficulty articulating their search needs to an intermediary. One possible solution would be to encourage managers and their immediate support staff members to search textual databases directly as they now…

  10. Origins of Coordinate Searching.

    ERIC Educational Resources Information Center

    Kilgour, Frederick G.

    1997-01-01

    Reviews the origins of post-coordinate searching and emphasizes that the focal point should be on the searcher, not on the item being indexed. Highlights include the history of the term information retrieval; edge notched punch cards; the "peek-a-boo" system; the Uniterm system; and using computers to search for information. (LRW)

  11. Searching with probabilities

    SciTech Connect

    Palay, A.J.

    1985-01-01

    This book examines how probability distributions can be used as a knowledge representation technique. It presents a mechanism that can be used to guide a selective search algorithm to solve a variety of tactical chess problems. Topics covered include probabilities and searching the B algorithm and chess probabilities - in practice, examples, results, and future work.

  12. Citation Searching: Search Smarter & Find More

    ERIC Educational Resources Information Center

    Hammond, Chelsea C.; Brown, Stephanie Willen

    2008-01-01

    The staff at University of Connecticut are participating in Elsevier's Student Ambassador Program (SAmP) in which graduate students train their peers on "citation searching" research using Scopus and Web of Science, two tremendous citation databases. They are in the fourth semester of these training programs, and they are wildly successful: They…

  13. Mitigation of vibrations in adaptive optics by minimization of closed-loop residuals.

    PubMed

    Guesalaga, Andres; Neichel, Benoit; O'Neal, Jared; Guzman, Dani

    2013-05-01

    We describe a new technique to reduce tip and tilt vibrations via the design of adaptive optics controllers in a frequency framework. The method synthesizes controllers by minimizing an H2 norm of the tip and tilt residuals. In this approach, open loop slopes (pseudo-open-loop) are reconstructed from on-sky data and input into off-line simulations of the adaptive optics system. The proposed procedure executes a sequence of off-line closed-loop runs with increasing controller complexity and searches for the controller that minimizes the variance of residuals. Although the method avoids any identification of the vibration and turbulence models during the controller synthesis, the actual models are indirectly constructed as a by-product of the H2 norm minimization. The technique has been implemented on and tested with two operational instruments, namely Paranal's NACO and Gemini-South's GeMS, showing an effective rejection of the main vibrations in the loop and also improving the overall performance of the system over varying turbulence conditions. It is shown that a superior performance is obtained when compared to the standard integrator controller.

  14. Custom Search Engines: Tools & Tips

    ERIC Educational Resources Information Center

    Notess, Greg R.

    2008-01-01

    Few have the resources to build a Google or Yahoo! from scratch. Yet anyone can build a search engine based on a subset of the large search engines' databases. Use Google Custom Search Engine or Yahoo! Search Builder or any of the other similar programs to create a vertical search engine targeting sites of interest to users. The basic steps to…

  15. Task-Based Information Searching.

    ERIC Educational Resources Information Center

    Vakkari, Pertti

    2003-01-01

    Reviews studies on the relationship between task performance and information searching by end-users, focusing on information searching in electronic environments and information retrieval systems. Topics include task analysis; task characteristics; search goals; modeling information searching; modeling search goals; information seeking behavior;…

  16. Assessing Children's Implicit Attitudes Using the Affect Misattribution Procedure

    ERIC Educational Resources Information Center

    Williams, Amanda; Steele, Jennifer R.; Lipman, Corey

    2016-01-01

    In the current research, we examined whether the Affect Misattribution Procedure (AMP) could be successfully adapted as an implicit measure of children's attitudes. We tested this possibility in 3 studies with 5- to 10-year-old children. In Study 1, we found evidence that children misattribute affect elicited by attitudinally positive (e.g., cute…

  17. Needle Federated Search Engine

    SciTech Connect

    2009-12-01

    The Idaho National Laboratory (INL) has combined a number of technologies, tools, and resources to accomplish a new means of federating search results. The resulting product is a search engine called Needle, an open-source-based tool that the INL uses internally for researching across a wide variety of information repositories. Needle has a flexible search interface that allows end users to point at any available data source. A user can select multiple sources such as commercial databases (Web of Science, Engineering Index), external resources (WorldCat, Google Scholar), and internal corporate resources (email, document management system, library collections) in a single interface with one search query. In the future, INL hopes to offer this open-source engine to the public. This session will outline the development processes for making Needle™s search interface and simplifying the federation of internal and external data sources.

  18. Needle Federated Search Engine

    2009-12-01

    The Idaho National Laboratory (INL) has combined a number of technologies, tools, and resources to accomplish a new means of federating search results. The resulting product is a search engine called Needle, an open-source-based tool that the INL uses internally for researching across a wide variety of information repositories. Needle has a flexible search interface that allows end users to point at any available data source. A user can select multiple sources such as commercialmore » databases (Web of Science, Engineering Index), external resources (WorldCat, Google Scholar), and internal corporate resources (email, document management system, library collections) in a single interface with one search query. In the future, INL hopes to offer this open-source engine to the public. This session will outline the development processes for making Needle™s search interface and simplifying the federation of internal and external data sources.« less

  19. On the Adaptive Control of the False Discovery Rate in Multiple Testing with Independent Statistics.

    ERIC Educational Resources Information Center

    Benjamini, Yoav; Hochberg, Yosef

    2000-01-01

    Presents an adaptive approach to multiple significance testing based on the procedure of Y. Benjamini and Y. Hochberg (1995) that first estimates the number of true null hypotheses and then uses that estimate in the Benjamini and Hochberg procedure. Uses the new procedure in examples from educational and behavioral studies and shows its control of…

  20. Procedural Quantum Programming

    NASA Astrophysics Data System (ADS)

    Ömer, Bernhard

    2002-09-01

    While classical computing science has developed a variety of methods and programming languages around the concept of the universal computer, the typical description of quantum algorithms still uses a purely mathematical, non-constructive formalism which makes no difference between a hydrogen atom and a quantum computer. This paper investigates, how the concept of procedural programming languages, the most widely used classical formalism for describing and implementing algorithms, can be adopted to the field of quantum computing, and how non-classical features like the reversibility of unitary transformations, the non-observability of quantum states or the lack of copy and erase operations can be reflected semantically. It introduces the key concepts of procedural quantum programming (hybrid target architecture, operator hierarchy, quantum data types, memory management, etc.) and presents the experimental language QCL, which implements these principles.

  1. Standards of neurosurgical procedures.

    PubMed

    Steiger, H J

    2001-01-01

    Written specifications with regard to procedures performed, equipment used, and training of the involved personnel are widely used in the industry and aviation to guarantee constant quality. Similar systems are progressively being introduced to medicine. We have made an effort to standardize surgical procedures by introducing step-by-step guidelines and checklists. The current experience shows that a system of written standards is applicable to neurosurgery and that the use of checklists contributes to the prevention of forgetting essential details. Written standards and checklists are also a useful training tool within a university hospital and facilitate communication of essentials to the residents. Comparison with aviation suggests that standardization leads to a remarkable but nonetheless limited reduction of adverse incidents. PMID:11840739

  2. A computerized procedure for estimating nutrient intake.

    PubMed

    Williamson, M; Azen, C; Acosta, P

    1976-11-01

    A procedure was devised for computing intake in terms of calories, total protein, phenylalanine, carbohydrate, and fat. The procedure used a magnetic tape containing 3,122 numbered food items. The nutrient composition of each food was reported for 100 g of the edible portion of the food. In addition, diet diaries were prepared in which the foods eaten during the preceding 24-hr period, the code for each food corresponding to the number for the same item on the magnetic tape, and the number of units of each food eaten were recorded. A computer program then was written that calculated the amounts of intake per day for each nutrient. Application of the procedure for 42 consecutive days on the daily diet records of 43 adult carriers of the phenylalanine hydroxylase enzyme formed the data base used to determine if aspartame significantly increased levels of phenylalanine in the blood. Adaptations of the procedure permit calculations of intake for periods from 1 to 30 days and analyses of additional nutrients including calcium, phosphorous, iron, vitamin A, thiamine, riboflavin, niacin, and ascorbic acid.

  3. On the adaptive daily forecasting of seismic aftershock hazard

    NASA Astrophysics Data System (ADS)

    Ebrahimian, Hossein; Jalayer, Fatemeh; Asprone, Domenico; Lombardi, Anna Maria; Marzocchi, Warner; Prota, Andrea; Manfredi, Gaetano

    2013-04-01

    Post-earthquake ground motion hazard assessment is a fundamental initial step towards time-dependent seismic risk assessment for buildings in a post main-shock environment. Therefore, operative forecasting of seismic aftershock hazard forms a viable support basis for decision-making regarding search and rescue, inspection, repair, and re-occupation in a post main-shock environment. Arguably, an adaptive procedure for integrating the aftershock occurrence rate together with suitable ground motion prediction relations is key to Probabilistic Seismic Aftershock Hazard Assessment (PSAHA). In the short-term, the seismic hazard may vary significantly (Jordan et al., 2011), particularly after the occurrence of a high magnitude earthquake. Hence, PSAHA requires a reliable model that is able to track the time evolution of the earthquake occurrence rates together with suitable ground motion prediction relations. This work focuses on providing adaptive daily forecasts of the mean daily rate of exceeding various spectral acceleration values (the aftershock hazard). Two well-established earthquake occurrence models suitable for daily seismicity forecasts associated with the evolution of an aftershock sequence, namely, the modified Omori's aftershock model and the Epidemic Type Aftershock Sequence (ETAS) are adopted. The parameters of the modified Omori model are updated on a daily basis using Bayesian updating and based on the data provided by the ongoing aftershock sequence based on the methodology originally proposed by Jalayer et al. (2011). The Bayesian updating is used also to provide sequence-based parameter estimates for a given ground motion prediction model, i.e. the aftershock events in an ongoing sequence are exploited in order to update in an adaptive manner the parameters of an existing ground motion prediction model. As a numerical example, the mean daily rates of exceeding specific spectral acceleration values are estimated adaptively for the L'Aquila 2009

  4. Practical procedures: oxygen therapy.

    PubMed

    Olive, Sandra

    Knowing when to start patients on oxygen therapy can save lives, but ongoing assessment and evaluation must be carried out to ensure the treatment is safe and effective. This article outlines when oxygen therapy should be used and the procedures to follow. It also describes the delivery methods applicable to different patient groups, along with the appropriate target saturation ranges, and details relevant nurse competencies.

  5. The Superintendent and Grievance Procedures.

    ERIC Educational Resources Information Center

    Kleinmann, Jack H.

    Grievance adjustment between teachers and administrators is viewed as a misunderstood process. The problem is treated under four main headings: (1) Purposes and characteristics of an effective grievance procedure, (2) status of grievance procedures in education, (3) relationship of grievance procedures to professional negotiation procedures, and…

  6. Vectorizable algorithms for adaptive schemes for rapid analysis of SSME flows

    NASA Technical Reports Server (NTRS)

    Oden, J. Tinsley

    1987-01-01

    An initial study into vectorizable algorithms for use in adaptive schemes for various types of boundary value problems is described. The focus is on two key aspects of adaptive computational methods which are crucial in the use of such methods (for complex flow simulations such as those in the Space Shuttle Main Engine): the adaptive scheme itself and the applicability of element-by-element matrix computations in a vectorizable format for rapid calculations in adaptive mesh procedures.

  7. Scaling laws of marine predator search behaviour.

    PubMed

    Sims, David W; Southall, Emily J; Humphries, Nicolas E; Hays, Graeme C; Bradshaw, Corey J A; Pitchford, Jonathan W; James, Alex; Ahmed, Mohammed Z; Brierley, Andrew S; Hindell, Mark A; Morritt, David; Musyl, Michael K; Righton, David; Shepard, Emily L C; Wearmouth, Victoria J; Wilson, Rory P; Witt, Matthew J; Metcalfe, Julian D

    2008-02-28

    Many free-ranging predators have to make foraging decisions with little, if any, knowledge of present resource distribution and availability. The optimal search strategy they should use to maximize encounter rates with prey in heterogeneous natural environments remains a largely unresolved issue in ecology. Lévy walks are specialized random walks giving rise to fractal movement trajectories that may represent an optimal solution for searching complex landscapes. However, the adaptive significance of this putative strategy in response to natural prey distributions remains untested. Here we analyse over a million movement displacements recorded from animal-attached electronic tags to show that diverse marine predators-sharks, bony fishes, sea turtles and penguins-exhibit Lévy-walk-like behaviour close to a theoretical optimum. Prey density distributions also display Lévy-like fractal patterns, suggesting response movements by predators to prey distributions. Simulations show that predators have higher encounter rates when adopting Lévy-type foraging in natural-like prey fields compared with purely random landscapes. This is consistent with the hypothesis that observed search patterns are adapted to observed statistical patterns of the landscape. This may explain why Lévy-like behaviour seems to be widespread among diverse organisms, from microbes to humans, as a 'rule' that evolved in response to patchy resource distributions.

  8. Quantum searching application in search based software engineering

    NASA Astrophysics Data System (ADS)

    Wu, Nan; Song, FangMin; Li, Xiangdong

    2013-05-01

    The Search Based Software Engineering (SBSE) is widely used in software engineering for identifying optimal solutions. However, there is no polynomial-time complexity solution used in the traditional algorithms for SBSE, and that causes the cost very high. In this paper, we analyze and compare several quantum search algorithms that could be applied for SBSE: quantum adiabatic evolution searching algorithm, fixed-point quantum search (FPQS), quantum walks, and a rapid modified Grover quantum searching method. The Grover's algorithm is thought as the best choice for a large-scaled unstructured data searching and theoretically it can be applicable to any search-space structure and any type of searching problems.

  9. Searching CA Condensates, On-Line and Batch.

    ERIC Educational Resources Information Center

    Kaminecki, Ronald M.; And Others

    Batch mode processing is compared, using cost-effectiveness, with on-line processing for computer-aided searching of chemical abstracts. Consideration for time, need, coverage, and adaptability are found to be the criteria by which a searcher selects a method, and sometimes both methods are used. There is a tradeoff between batch mode's slower…

  10. Search by Fuzzy Inference in a Children's Dictionary

    ERIC Educational Resources Information Center

    St-Jacques, Claude; Barriere, Caroline

    2005-01-01

    This research aims at promoting the usage of an online children's dictionary within a context of reading comprehension and vocabulary acquisition. Inspired by document retrieval approaches developed in the area of information retrieval (IR) research, we adapt a particular IR strategy, based on fuzzy logic, to a search in the electronic dictionary.…

  11. Software Searches for Better Spacecraft-Navigation Models

    NASA Technical Reports Server (NTRS)

    Ely, Todd; Crossley, William

    2003-01-01

    ADAPT is a computer program that searches for better mathematical models for spacecraft navigation. The task of tuning trajectory-determination models for interplanetary navigation is complex, requiring an intensive search of multiple dynamical and nondynamical models that yield trajectory solutions with minimal errors. By automating the search, ADAPT eases the task of human analysts and enables them to consider wider ranges of potential solutions. ADAPT uses genetic algorithms to search a range of relevant parameters in a user-selected design space to arrive at values for those parameters that best fit the measured spacecraft-tracking data. The user s guide for ADAPT reviews the theoretical basis of the program and presents two example applications. One example is that of selecting a solar-radiation model for the Mars Pathfinder (MPF) mission using MPF tracking data and an extended Kalman filter from prior spacecraft-navigation software. The second example is of the use of tracking data from the Stardust spacecraft mission combined with a pseudo-epoch-state batch filter and an empirical small-forces model to find improved impulse models for use during Stardust attitude adjustments.

  12. Logarithmic Adaptive Quantization Projection for Audio Watermarking

    NASA Astrophysics Data System (ADS)

    Zhao, Xuemin; Guo, Yuhong; Liu, Jian; Yan, Yonghong; Fu, Qiang

    In this paper, a logarithmic adaptive quantization projection (LAQP) algorithm for digital watermarking is proposed. Conventional quantization index modulation uses a fixed quantization step in the watermarking embedding procedure, which leads to poor fidelity. Moreover, the conventional methods are sensitive to value-metric scaling attack. The LAQP method combines the quantization projection scheme with a perceptual model. In comparison to some conventional quantization methods with a perceptual model, the LAQP only needs to calculate the perceptual model in the embedding procedure, avoiding the decoding errors introduced by the difference of the perceptual model used in the embedding and decoding procedure. Experimental results show that the proposed watermarking scheme keeps a better fidelity and is robust against the common signal processing attack. More importantly, the proposed scheme is invariant to value-metric scaling attack.

  13. Teaching AI Search Algorithms in a Web-Based Educational System

    ERIC Educational Resources Information Center

    Grivokostopoulou, Foteini; Hatzilygeroudis, Ioannis

    2013-01-01

    In this paper, we present a way of teaching AI search algorithms in a web-based adaptive educational system. Teaching is based on interactive examples and exercises. Interactive examples, which use visualized animations to present AI search algorithms in a step-by-step way with explanations, are used to make learning more attractive. Practice…

  14. Search Tips: MedlinePlus

    MedlinePlus

    ... of this page: https://medlineplus.gov/searchtips.html Search Tips To use the sharing features on this page, please enable JavaScript. How do I search MedlinePlus? The search box appears at the top ...

  15. Refining spectral library searching.

    PubMed

    Rudnick, Paul A

    2013-11-01

    Spectral library searching has many advantages over sequence database searching, yet it has not been widely adopted. One possible reason for this is that users are unsure exactly how to interpret the similarity scores (e.g., "dot products" are not probability-based scores). Methods to create decoys have been proposed, but, as developers caution, may produce proxies that are not equivalent to reversed sequences. In this issue, Shao et al. (Proteomics 2013, 13, 3273-3283) report advances in spectral library searching where the focus is not on improving the performance of their search engine, SpectraST, but is instead on improving the statistical meaningfulness of its discriminant score and removing the need for decoys. The results in their paper indicate that by "standardizing" the input and library spectra, sensitivity is not lost but is, surprisingly, gained. Their tests also show that false discovery rate (FDR) estimates, derived from their new score, track better with "ground truth" than decoy searching. It is possible that their work strikes a good balance between the theory of library searching and its application. And as such, they hope to have removed a major entrance barrier for some researchers previously unwilling to try library searching.

  16. [Adaptive optics for ophthalmology].

    PubMed

    Saleh, M

    2016-04-01

    Adaptive optics is a technology enhancing the visual performance of an optical system by correcting its optical aberrations. Adaptive optics have already enabled several breakthroughs in the field of visual sciences, such as improvement of visual acuity in normal and diseased eyes beyond physiologic limits, and the correction of presbyopia. Adaptive optics technology also provides high-resolution, in vivo imaging of the retina that may eventually help to detect the onset of retinal conditions at an early stage and provide better assessment of treatment efficacy.

  17. Adaptive network countermeasures.

    SciTech Connect

    McClelland-Bane, Randy; Van Randwyk, Jamie A.; Carathimas, Anthony G.; Thomas, Eric D.

    2003-10-01

    This report describes the results of a two-year LDRD funded by the Differentiating Technologies investment area. The project investigated the use of countermeasures in protecting computer networks as well as how current countermeasures could be changed in order to adapt with both evolving networks and evolving attackers. The work involved collaboration between Sandia employees and students in the Sandia - California Center for Cyber Defenders (CCD) program. We include an explanation of the need for adaptive countermeasures, a description of the architecture we designed to provide adaptive countermeasures, and evaluations of the system.

  18. Guideline adaptation and implementation planning: a prospective observational study

    PubMed Central

    2013-01-01

    Background Adaptation of high-quality practice guidelines for local use has been advanced as an efficient means to improve acceptability and applicability of evidence-informed care. In a pan-Canadian study, we examined how cancer care groups adapted pre-existing guidelines to their unique context and began implementation planning. Methods Using a mixed-methods, case-study design, five cases were purposefully sampled from self-identified groups and followed as they used a structured method and resources for guideline adaptation. Cases received the ADAPTE Collaboration toolkit, facilitation, methodological and logistical support, resources and assistance as required. Documentary and primary data collection methods captured individual case experience, including monthly summaries of meeting and field notes, email/telephone correspondence, and project records. Site visits, process audits, interviews, and a final evaluation forum with all cases contributed to a comprehensive account of participant experience. Results Study cases took 12 to >24 months to complete guideline adaptation. Although participants appreciated the structure, most found the ADAPTE method complex and lacking practical aspects. They needed assistance establishing individual guideline mandate and infrastructure, articulating health questions, executing search strategies, appraising evidence, and achieving consensus. Facilitation was described as a multi-faceted process, a team effort, and an essential ingredient for guideline adaptation. While front-line care providers implicitly identified implementation issues during adaptation, they identified a need to add an explicit implementation planning component. Conclusions Guideline adaptation is a positive initial step toward evidence-informed care, but adaptation (vs. ‘de novo’ development) did not meet expectations for reducing time or resource commitments. Undertaking adaptation is as much about the process (engagement and capacity building) as it

  19. Bioavailability of Metal Ions and Evolutionary Adaptation

    PubMed Central

    Hong Enriquez, Rolando P.; Do, Trang N.

    2012-01-01

    The evolution of life on earth has been a long process that began nearly 3.5 × 109 years ago. In their initial moments, evolution was mainly influenced by anaerobic environments; with the rise of O2 and the corresponding change in bioavailability of metal ions, new mechanisms of survival were created. Here we review the relationships between ancient atmospheric conditions, metal ion bioavailability and adaptation of metals homeostasis during early evolution. A general picture linking geochemistry, biochemistry and homeostasis is supported by the reviewed literature and is further illustrated in this report using simple database searches. PMID:25371266

  20. Correspondence: Searching sequence space

    SciTech Connect

    Youvan, D.C.

    1995-08-01

    This correspondence debates the efficiency and application of genetic algorithms (GAs) to search protein sequence space. The important experimental point is that such sparse searches utilize physically realistic syntheses. In this regard, all GA-based technologies are very similar; they {open_quotes}learn{close_quotes} from their initial sparse search and then generate interesting new proteins within a few iterations. Which GA-based technology is best? That probably depends on the protein and the specific engineering goal. Given the fact that the field of combinatorial chemistry is still in its infancy, it is probably wise to consider all of the proven mutagenesis methods. 19 refs.

  1. The Search for Exomoons

    NASA Astrophysics Data System (ADS)

    Kipping, D. M.

    2011-12-01

    With exoplanet detections becoming routine, astronomers are now vying to characterise these alien worlds. As well as detecting the atmospheres of these exoplanets, part of the characterisation process will undoubtedly involve the search for extrasolar moons. In this work, we explore the motivations for searching for exomoons, review some of the previously proposed detection techniques and finally introduce transit duration variation (TDV) as a proposed search method. We find that these techniques could easily detect Earth-mass exomoons with current instruments and potentially down to Galilean mass moons with future space missions like Kepler.

  2. Improving Search Engine Reliability

    NASA Astrophysics Data System (ADS)

    Pruthi, Jyoti; Kumar, Ela

    2010-11-01

    Search engines on the Internet are used daily to access and find information. While these services are providing an easy way to find information globally, they are also suffering from artificially created false results. This paper describes two techniques that are being used to manipulate the search engines: spam pages (used to achieve higher rankings on the result page) and cloaking (used to feed falsified data into search engines). This paper also describes two proposed methods to fight this kind of misuse, algorithms for both of the formerly mentioned cases of spamdexing.

  3. Adaptive functional systems: Learning with chaos

    NASA Astrophysics Data System (ADS)

    Komarov, M. A.; Osipov, G. V.; Burtsev, M. S.

    2010-12-01

    We propose a new model of adaptive behavior that combines a winnerless competition principle and chaos to learn new functional systems. The model consists of a complex network of nonlinear dynamical elements producing sequences of goal-directed actions. Each element describes dynamics and activity of the functional system which is supposed to be a distributed set of interacting physiological elements such as nerve or muscle that cooperates to obtain certain goal at the level of the whole organism. During "normal" behavior, the dynamics of the system follows heteroclinic channels, but in the novel situation chaotic search is activated and a new channel leading to the target state is gradually created simulating the process of learning. The model was tested in single and multigoal environments and had demonstrated a good potential for generation of new adaptations.

  4. An adaptive data-smoothing routine

    NASA Technical Reports Server (NTRS)

    Taylor, Clayborne D.; Nicolas, David P.

    1989-01-01

    An adaptive noise reduction algorithm that can be implemented on a microcomputer is developed. Smoothing polynomials are used where the polynomial coefficients are chosen such that the mean-square-error between the noisy and smoothed data is minimized. This approach is equivalent to the implementation of a low-pass finite impulse response filter. The noise reduction depends on the order of the smoothing polynomial. A whiteness test on the error sequence is incorporated to search for the optimal smoothing. Expansion coefficients may be computed via the fast Fourier transform, and the resulting smoothing process is the equivalent of the implementation of an adaptive ideal low-pass filter. Results are obtained for an analytical signal with added white Gaussian noise. The routine may be applied to any smooth signal with additive random noise.

  5. Adaptive Strategies for Materials Design using Uncertainties.

    PubMed

    Balachandran, Prasanna V; Xue, Dezhen; Theiler, James; Hogden, John; Lookman, Turab

    2016-01-21

    We compare several adaptive design strategies using a data set of 223 M2AX family of compounds for which the elastic properties [bulk (B), shear (G), and Young's (E) modulus] have been computed using density functional theory. The design strategies are decomposed into an iterative loop with two main steps: machine learning is used to train a regressor that predicts elastic properties in terms of elementary orbital radii of the individual components of the materials; and a selector uses these predictions and their uncertainties to choose the next material to investigate. The ultimate goal is to obtain a material with desired elastic properties in as few iterations as possible. We examine how the choice of data set size, regressor and selector impact the design. We find that selectors that use information about the prediction uncertainty outperform those that don't. Our work is a step in illustrating how adaptive design tools can guide the search for new materials with desired properties.

  6. Tandem Mass Spectrum Identification via Cascaded Search

    PubMed Central

    2016-01-01

    Accurate assignment of peptide sequences to observed fragmentation spectra is hindered by the large number of hypotheses that must be considered for each observed spectrum. A high score assigned to a particular peptide–spectrum match (PSM) may not end up being statistically significant after multiple testing correction. Researchers can mitigate this problem by controlling the hypothesis space in various ways: considering only peptides resulting from enzymatic cleavages, ignoring possible post-translational modifications or single nucleotide variants, etc. However, these strategies sacrifice identifications of spectra generated by rarer types of peptides. In this work, we introduce a statistical testing framework, cascade search, that directly addresses this problem. The method requires that the user specify a priori a statistical confidence threshold as well as a series of peptide databases. For instance, such a cascade of databases could include fully tryptic, semitryptic, and nonenzymatic peptides or peptides with increasing numbers of modifications. Cascaded search then gradually expands the list of candidate peptides from more likely peptides toward rare peptides, sequestering at each stage any spectrum that is identified with a specified statistical confidence. We compare cascade search to a standard procedure that lumps all of the peptides into a single database, as well as to a previously described group FDR procedure that computes the FDR separately within each database. We demonstrate, using simulated and real data, that cascade search identifies more spectra at a fixed FDR threshold than with either the ungrouped or grouped approach. Cascade search thus provides a general method for maximizing the number of identified spectra in a statistically rigorous fashion. PMID:26084232

  7. Pipe Cleaning Operating Procedures

    SciTech Connect

    Clark, D.; Wu, J.; /Fermilab

    1991-01-24

    This cleaning procedure outlines the steps involved in cleaning the high purity argon lines associated with the DO calorimeters. The procedure is broken down into 7 cycles: system setup, initial flush, wash, first rinse, second rinse, final rinse and drying. The system setup involves preparing the pump cart, line to be cleaned, distilled water, and interconnecting hoses and fittings. The initial flush is an off-line flush of the pump cart and its plumbing in order to preclude contaminating the line. The wash cycle circulates the detergent solution (Micro) at 180 degrees Fahrenheit through the line to be cleaned. The first rinse is then intended to rid the line of the majority of detergent and only needs to run for 30 minutes and at ambient temperature. The second rinse (if necessary) should eliminate the remaining soap residue. The final rinse is then intended to be a check that there is no remaining soap or other foreign particles in the line, particularly metal 'chips.' The final rinse should be run at 180 degrees Fahrenheit for at least 90 minutes. The filters should be changed after each cycle, paying particular attention to the wash cycle and the final rinse cycle return filters. These filters, which should be bagged and labeled, prove that the pipeline is clean. Only distilled water should be used for all cycles, especially rinsing. The level in the tank need not be excessive, merely enough to cover the heater float switch. The final rinse, however, may require a full 50 gallons. Note that most of the details of the procedure are included in the initial flush description. This section should be referred to if problems arise in the wash or rinse cycles.

  8. Interventional radiology neck procedures.

    PubMed

    Zabala Landa, R M; Korta Gómez, I; Del Cura Rodríguez, J L

    2016-05-01

    Ultrasonography has become extremely useful in the evaluation of masses in the head and neck. It enables us to determine the anatomic location of the masses as well as the characteristics of the tissues that compose them, thus making it possible to orient the differential diagnosis toward inflammatory, neoplastic, congenital, traumatic, or vascular lesions, although it is necessary to use computed tomography or magnetic resonance imaging to determine the complete extension of certain lesions. The growing range of interventional procedures, mostly guided by ultrasonography, now includes biopsies, drainages, infiltrations, sclerosing treatments, and tumor ablation. PMID:27138033

  9. Common rodent procedures.

    PubMed

    Klaphake, Eric

    2006-05-01

    Rodents are commonly owned exotic animal pets that may be seen by veterinary practitioners. Although most owners presenting their animals do care about their pets, they may not be aware of the diagnostic possibilities and challenges that can be offered by rodents to the veterinarian. Understanding clinical anatomy, proper hand-ling technique, realistic management of emergency presentations,correct and feasible diagnostic sampling, anesthesia, and humane euthanasia procedures is important to enhancing the doctor-client-patient relationship, especially when financial constraints may be imposed by the owner. PMID:16759953

  10. Surface cleanliness measurement procedure

    DOEpatents

    Schroder, Mark Stewart; Woodmansee, Donald Ernest; Beadie, Douglas Frank

    2002-01-01

    A procedure and tools for quantifying surface cleanliness are described. Cleanliness of a target surface is quantified by wiping a prescribed area of the surface with a flexible, bright white cloth swatch, preferably mounted on a special tool. The cloth picks up a substantial amount of any particulate surface contamination. The amount of contamination is determined by measuring the reflectivity loss of the cloth before and after wiping on the contaminated system and comparing that loss to a previous calibration with similar contamination. In the alternative, a visual comparison of the contaminated cloth to a contamination key provides an indication of the surface cleanliness.

  11. Radiometric correction procedure study

    NASA Technical Reports Server (NTRS)

    Colby, C.; Sands, R.; Murphrey, S.

    1978-01-01

    A comparison of MSS radiometric processing techniques identified as a preferred radiometric processing technique a procedure which equalizes the mean and standard deviation of detector-specific histograms of uncalibrated scene data. Evaluation of MSS calibration data demonstrated that the relationship between detector responses is essentially linear over the range of intensities typically observed in MSS data, and that the calibration wedge data possess a high degree of temporal stability. An analysis of the preferred radiometric processing technique showed that it could be incorporated into the MDP-MSS system without a major redesign of the system, and with minimal impact on system throughput.

  12. CELT optics Alignment Procedure

    NASA Astrophysics Data System (ADS)

    Mast, Terry S.; Nelson, Jerry E.; Chanan, Gary A.; Noethe, Lothar

    2003-01-01

    The California Extremely Large Telescope (CELT) is a project to build a 30-meter diameter telescope for research in astronomy at visible and infrared wavelengths. The current optical design calls for a primary, secondary, and tertiary mirror with Ritchey-Chretién foci at two Nasmyth platforms. The primary mirror is a mosaic of 1080 actively-stabilized hexagonal segments. This paper summarizes a CELT report that describes a step-by-step procedure for aligning the many degrees of freedom of the CELT optics.

  13. Interventional radiology neck procedures.

    PubMed

    Zabala Landa, R M; Korta Gómez, I; Del Cura Rodríguez, J L

    2016-05-01

    Ultrasonography has become extremely useful in the evaluation of masses in the head and neck. It enables us to determine the anatomic location of the masses as well as the characteristics of the tissues that compose them, thus making it possible to orient the differential diagnosis toward inflammatory, neoplastic, congenital, traumatic, or vascular lesions, although it is necessary to use computed tomography or magnetic resonance imaging to determine the complete extension of certain lesions. The growing range of interventional procedures, mostly guided by ultrasonography, now includes biopsies, drainages, infiltrations, sclerosing treatments, and tumor ablation.

  14. FLASHFLOOD: a 3D field-based similarity search and alignment method for flexible molecules.

    PubMed

    Pitman, M C; Huber, W K; Horn, H; Krämer, A; Rice, J E; Swope, W C

    2001-07-01

    A three-dimensional field-based similarity search and alignment method for flexible molecules is introduced. The conformational space of a flexible molecule is represented in terms of fragments and torsional angles of allowed conformations. A user-definable property field is used to compute features of fragment pairs. Features are generalizations of CoMMA descriptors that characterize local regions of the property field by its local moments. The features are invariant under coordinate system transformations. Features taken from a query molecule are used to form alignments with fragment pairs in the database. An assembly algorithm is then used to merge the fragment pairs into full structures, aligned to the query. Key to the method is the use of a context adaptive descriptor scaling procedure as the basis for similarity. This allows the user to tune the weights of the various feature components based on examples relevant to the particular context under investigation. The property fields may range from simple, phenomenological fields, to fields derived from quantum mechanical calculations. We apply the method to the dihydrofolate/methotrexate benchmark system, and show that when one injects relevant contextual information into the descriptor scaling procedure, better results are obtained more efficiently. We also show how the method works and include computer times for a query from a database that represents approximately 23 million conformers of seventeen flexible molecules.

  15. Adaptive Heat Engine.

    PubMed

    Allahverdyan, A E; Babajanyan, S G; Martirosyan, N H; Melkikh, A V

    2016-07-15

    A major limitation of many heat engines is that their functioning demands on-line control and/or an external fitting between the environmental parameters (e.g., temperatures of thermal baths) and internal parameters of the engine. We study a model for an adaptive heat engine, where-due to feedback from the functional part-the engine's structure adapts to given thermal baths. Hence, no on-line control and no external fitting are needed. The engine can employ unknown resources; it can also adapt to results of its own functioning that make the bath temperatures closer. We determine resources of adaptation and relate them to the prior information available about the environment.

  16. Adaptive Heat Engine.

    PubMed

    Allahverdyan, A E; Babajanyan, S G; Martirosyan, N H; Melkikh, A V

    2016-07-15

    A major limitation of many heat engines is that their functioning demands on-line control and/or an external fitting between the environmental parameters (e.g., temperatures of thermal baths) and internal parameters of the engine. We study a model for an adaptive heat engine, where-due to feedback from the functional part-the engine's structure adapts to given thermal baths. Hence, no on-line control and no external fitting are needed. The engine can employ unknown resources; it can also adapt to results of its own functioning that make the bath temperatures closer. We determine resources of adaptation and relate them to the prior information available about the environment. PMID:27472104

  17. Adaptations, exaptations, and spandrels.

    PubMed

    Buss, D M; Haselton, M G; Shackelford, T K; Bleske, A L; Wakefield, J C

    1998-05-01

    Adaptation and natural selection are central concepts in the emerging science of evolutionary psychology. Natural selection is the only known causal process capable of producing complex functional organic mechanisms. These adaptations, along with their incidental by-products and a residue of noise, comprise all forms of life. Recently, S. J. Gould (1991) proposed that exaptations and spandrels may be more important than adaptations for evolutionary psychology. These refer to features that did not originally arise for their current use but rather were co-opted for new purposes. He suggested that many important phenomena--such as art, language, commerce, and war--although evolutionary in origin, are incidental spandrels of the large human brain. The authors outline the conceptual and evidentiary standards that apply to adaptations, exaptations, and spandrels and discuss the relative utility of these concepts for psychological science. PMID:9612136

  18. Rocketing into Adaptive Inquiry.

    ERIC Educational Resources Information Center

    Farenga, Stephen J.; Joyce, Beverly A.; Dowling, Thomas W.

    2002-01-01

    Defines adaptive inquiry and argues for employing this method which allows lessons to be shaped in response to student needs. Illustrates this idea by detailing an activity in which teams of students build rockets. (DDR)

  19. Adaptive Management of Ecosystems

    EPA Science Inventory

    Adaptive management is an approach to natural resource management that emphasizes learning through management. As such, management may be treated as experiment, with replication, or management may be conducted in an iterative manner. Although the concept has resonated with many...

  20. The genomics of adaptation.

    PubMed

    Radwan, Jacek; Babik, Wiesław

    2012-12-22

    The amount and nature of genetic variation available to natural selection affect the rate, course and outcome of evolution. Consequently, the study of the genetic basis of adaptive evolutionary change has occupied biologists for decades, but progress has been hampered by the lack of resolution and the absence of a genome-level perspective. Technological advances in recent years should now allow us to answer many long-standing questions about the nature of adaptation. The data gathered so far are beginning to challenge some widespread views of the way in which natural selection operates at the genomic level. Papers in this Special Feature of Proceedings of the Royal Society B illustrate various aspects of the broad field of adaptation genomics. This introductory article sets up a context and, on the basis of a few selected examples, discusses how genomic data can advance our understanding of the process of adaptation.