A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem

NASA Astrophysics Data System (ADS)

Nguyen, Viet-Phuong; Prins, Christian; Prodhon, Caroline

This paper presents a new hybrid metaheuristic between a greedy randomized adaptive search procedure (GRASP) and an evolutionary/iterated local search (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation between ELS and ILS. In this phase, each child is obtained by mutation and evaluated through a splitting procedure of giant tour followed by a local search. The tabu list, defined by two characteristics of solution (total cost and number of trips), is used to avoid searching a space already explored. The results show that our metaheuristic clearly outperforms all previously published methods on LRP-2E benchmark instances. Furthermore, it is competitive with the best meta-heuristic published for the single-echelon LRP.

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.

Center for Adaptive Optics | Search

Science.gov Websites

Center for Adaptive Optics A University of California Science and Technology Center home Search CfAO Google Search search: CfAO All of UCOLick.org Whole Web Search for recent Adaptive Optics news at GoogleNews! Last Modified: Sep 21, 2010 Center for Adaptive Optics | Search | The Center | Adaptive Optics

An adaptive approach to the physical annealing strategy for simulated annealing

NASA Astrophysics Data System (ADS)

Hasegawa, M.

2013-02-01

A new and reasonable method for adaptive implementation of simulated annealing (SA) is studied on two types of random traveling salesman problems. The idea is based on the previous finding on the search characteristics of the threshold algorithms, that is, the primary role of the relaxation dynamics in their finite-time optimization process. It is shown that the effective temperature for optimization can be predicted from the system's behavior analogous to the stabilization phenomenon occurring in the heating process starting from a quenched solution. The subsequent slow cooling near the predicted point draws out the inherent optimizing ability of finite-time SA in more straightforward manner than the conventional adaptive approach.

An effective PSO-based memetic algorithm for flow shop scheduling.

PubMed

Liu, Bo; Wang, Ling; Jin, Yi-Hui

2007-02-01

This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.

Adaptive Sniping for Volatile and Stable Continuous Double Auction Markets

NASA Astrophysics Data System (ADS)

Toft, I. E.; Bagnall, A. J.

This paper introduces a new adaptive sniping agent for the Continuous Double Auction. We begin by analysing the performance of the well known Kaplan sniper in two extremes of market conditions. We generate volatile and stable market conditions using the well known Zero Intelligence-Constrained agent and a new zero-intelligence agent Small Increment (SI). ZI-C agents submit random but profitable bids/offers and cause high volatility in prices and individual trader performance. Our new zero-intelligence agent, SI, makes small random adjustments to the outstanding bid/offer and hence is more cautious than ZI-C. We present results for SI in self-play and then analyse Kaplan in volatile and stable markets. We demonstrate that the non-adaptive Kaplan sniper can be configured to suit either market conditions, but no single configuration is performs well across both market types. We believe that in a dynamic auction environment where current or future market conditions cannot be predicted a viable sniping strategy should adapt its behaviour to suit prevailing market conditions. To this end, we propose the Adaptive Sniper (AS) agent for the CDA. AS traders classify sniping opportunities using a statistical model of market activity and adjust their classification thresholds using a Widrow-Hoff adapted search. Our AS agent requires little configuration, and outperforms the original Kaplan sniper in volatile and stable markets, and in a mixed trader type scenario that includes adaptive strategies from the literature.

[Dialectical Behavior Therapy (DBT)--developments and empirical evidence].

PubMed

Burmeister, Kerstin; Höschel, Klaus; von Auer, Anne Kristin; Reiske, Sophie; Schweiger, Ulrich; Sipos, Valerija; Philipsen, Alexandra; Priebe, Kathlen; Bohus, Martin

2014-07-01

Dialectical Behavior Therapy has been initially designed and evaluated as an outpatient-treatment program for chronic suicidal female patients. Within the last years, several adaptations of DBT for specific comorbidities, other settings or other disorders related to emotion dysregulation have been developed. This report reviews conceptual aspects and the scientific evidence of initially designed Dialectical Behavior Therapy and the adaptations. Systematic literature search and systematic review. Recently, two meta-analyses which are based on randomized controlled trials conclude robust and stabile effects of DBT Evidence from further RCTs and other studies show promise for the properties of many DBT adaptations. The current review of the literature suggests a good effectiveness of DBT, especially on complex disorders with deficits in the field of emotion regulation. © Georg Thieme Verlag KG Stuttgart · New York.

Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Benford, Andrew; Tinker, Michael L.

2004-01-01

The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

Comparison of genetic algorithms with conjugate gradient methods

NASA Technical Reports Server (NTRS)

Bosworth, J. L.; Foo, N. Y.; Zeigler, B. P.

1972-01-01

Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.

Improving Search Algorithms by Using Intelligent Coordinates

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Tumer, Kagan; Bandari, Esfandiar

2004-01-01

We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent eta is self-interested; it sets its variable to maximize its own function g (sub eta). Three factors govern such a distributed algorithm's performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit alI three factors by modifying a search algorithm's exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based player engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

Improving search algorithms by using intelligent coordinates

NASA Astrophysics Data System (ADS)

Wolpert, David; Tumer, Kagan; Bandari, Esfandiar

2004-01-01

We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent η is self-interested; it sets its variable to maximize its own function gη. Three factors govern such a distributed algorithm’s performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit all three factors by modifying a search algorithm’s exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based “player” engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

PubMed Central

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties. PMID:24741341

Cooperative search and rescue with artificial fishes based on fish-swarm algorithm for underwater wireless sensor networks.

PubMed

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties.

Adaptive photoacoustic imaging quality optimization with EMD and reconstruction

NASA Astrophysics Data System (ADS)

Guo, Chengwen; Ding, Yao; Yuan, Jie; Xu, Guan; Wang, Xueding; Carson, Paul L.

2016-10-01

Biomedical photoacoustic (PA) signal is characterized with extremely low signal to noise ratio which will yield significant artifacts in photoacoustic tomography (PAT) images. Since PA signals acquired by ultrasound transducers are non-linear and non-stationary, traditional data analysis methods such as Fourier and wavelet method cannot give useful information for further research. In this paper, we introduce an adaptive method to improve the quality of PA imaging based on empirical mode decomposition (EMD) and reconstruction. Data acquired by ultrasound transducers are adaptively decomposed into several intrinsic mode functions (IMFs) after a sifting pre-process. Since noise is randomly distributed in different IMFs, depressing IMFs with more noise while enhancing IMFs with less noise can effectively enhance the quality of reconstructed PAT images. However, searching optimal parameters by means of brute force searching algorithms will cost too much time, which prevent this method from practical use. To find parameters within reasonable time, heuristic algorithms, which are designed for finding good solutions more efficiently when traditional methods are too slow, are adopted in our method. Two of the heuristic algorithms, Simulated Annealing Algorithm, a probabilistic method to approximate the global optimal solution, and Artificial Bee Colony Algorithm, an optimization method inspired by the foraging behavior of bee swarm, are selected to search optimal parameters of IMFs in this paper. The effectiveness of our proposed method is proved both on simulated data and PA signals from real biomedical tissue, which might bear the potential for future clinical PA imaging de-noising.

Mutually beneficial relationship in optimization between search-space smoothing and stochastic search

NASA Astrophysics Data System (ADS)

Hasegawa, Manabu; Hiramatsu, Kotaro

2013-10-01

The effectiveness of the Metropolis algorithm (MA) (constant-temperature simulated annealing) in optimization by the method of search-space smoothing (SSS) (potential smoothing) is studied on two types of random traveling salesman problems. The optimization mechanism of this hybrid approach (MASSS) is investigated by analyzing the exploration dynamics observed in the rugged landscape of the cost function (energy surface). The results show that the MA can be successfully utilized as a local search algorithm in the SSS approach. It is also clarified that the optimization characteristics of these two constituent methods are improved in a mutually beneficial manner in the MASSS run. Specifically, the relaxation dynamics generated by employing the MA work effectively even in a smoothed landscape and more advantage is taken of the guiding function proposed in the idea of SSS; this mechanism operates in an adaptive manner in the de-smoothing process and therefore the MASSS method maintains its optimization function over a wider temperature range than the MA.

Center for Adaptive Optics | Publications

Science.gov Websites

Text-Only Version Adaptive Optics, Center for Home Page CfAO Logo Search The Center Adaptive Optics for Adaptive Optics | Search | Sitemap | The Center | Adaptive Optics | Research | Education/HR

Evidence of Levy walk foraging patterns in human hunter-gatherers.

PubMed

Raichlen, David A; Wood, Brian M; Gordon, Adam D; Mabulla, Audax Z P; Marlowe, Frank W; Pontzer, Herman

2014-01-14

When searching for food, many organisms adopt a superdiffusive, scale-free movement pattern called a Lévy walk, which is considered optimal when foraging for heterogeneously located resources with little prior knowledge of distribution patterns [Viswanathan GM, da Luz MGE, Raposo EP, Stanley HE (2011) The Physics of Foraging: An Introduction to Random Searches and Biological Encounters]. Although memory of food locations and higher cognition may limit the benefits of random walk strategies, no studies to date have fully explored search patterns in human foraging. Here, we show that human hunter-gatherers, the Hadza of northern Tanzania, perform Lévy walks in nearly one-half of all foraging bouts. Lévy walks occur when searching for a wide variety of foods from animal prey to underground tubers, suggesting that, even in the most cognitively complex forager on Earth, such patterns are essential to understanding elementary foraging mechanisms. This movement pattern may be fundamental to how humans experience and interact with the world across a wide range of ecological contexts, and it may be adaptive to food distribution patterns on the landscape, which previous studies suggested for organisms with more limited cognition. Additionally, Lévy walks may have become common early in our genus when hunting and gathering arose as a major foraging strategy, playing an important role in the evolution of human mobility.

Measurement uncertainty evaluation of conicity error inspected on CMM

NASA Astrophysics Data System (ADS)

Wang, Dongxia; Song, Aiguo; Wen, Xiulan; Xu, Youxiong; Qiao, Guifang

2016-01-01

The cone is widely used in mechanical design for rotation, centering and fixing. Whether the conicity error can be measured and evaluated accurately will directly influence its assembly accuracy and working performance. According to the new generation geometrical product specification(GPS), the error and its measurement uncertainty should be evaluated together. The mathematical model of the minimum zone conicity error is established and an improved immune evolutionary algorithm(IIEA) is proposed to search for the conicity error. In the IIEA, initial antibodies are firstly generated by using quasi-random sequences and two kinds of affinities are calculated. Then, each antibody clone is generated and they are self-adaptively mutated so as to maintain diversity. Similar antibody is suppressed and new random antibody is generated. Because the mathematical model of conicity error is strongly nonlinear and the input quantities are not independent, it is difficult to use Guide to the expression of uncertainty in the measurement(GUM) method to evaluate measurement uncertainty. Adaptive Monte Carlo method(AMCM) is proposed to estimate measurement uncertainty in which the number of Monte Carlo trials is selected adaptively and the quality of the numerical results is directly controlled. The cone parts was machined on lathe CK6140 and measured on Miracle NC 454 Coordinate Measuring Machine(CMM). The experiment results confirm that the proposed method not only can search for the approximate solution of the minimum zone conicity error(MZCE) rapidly and precisely, but also can evaluate measurement uncertainty and give control variables with an expected numerical tolerance. The conicity errors computed by the proposed method are 20%-40% less than those computed by NC454 CMM software and the evaluation accuracy improves significantly.

A hybrid artificial bee colony algorithm for numerical function optimization

NASA Astrophysics Data System (ADS)

Alqattan, Zakaria N.; Abdullah, Rosni

2015-02-01

Artificial Bee Colony (ABC) algorithm is one of the swarm intelligence algorithms; it has been introduced by Karaboga in 2005. It is a meta-heuristic optimization search algorithm inspired from the intelligent foraging behavior of the honey bees in nature. Its unique search process made it as one of the most competitive algorithm with some other search algorithms in the area of optimization, such as Genetic algorithm (GA) and Particle Swarm Optimization (PSO). However, the ABC performance of the local search process and the bee movement or the solution improvement equation still has some weaknesses. The ABC is good in avoiding trapping at the local optimum but it spends its time searching around unpromising random selected solutions. Inspired by the PSO, we propose a Hybrid Particle-movement ABC algorithm called HPABC, which adapts the particle movement process to improve the exploration of the original ABC algorithm. Numerical benchmark functions were used in order to experimentally test the HPABC algorithm. The results illustrate that the HPABC algorithm can outperform the ABC algorithm in most of the experiments (75% better in accuracy and over 3 times faster).

Autonomous change of behavior for environmental context: An intermittent search model with misunderstanding search pattern

NASA Astrophysics Data System (ADS)

Murakami, Hisashi; Gunji, Yukio-Pegio

2017-07-01

Although foraging patterns have long been predicted to optimally adapt to environmental conditions, empirical evidence has been found in recent years. This evidence suggests that the search strategy of animals is open to change so that animals can flexibly respond to their environment. In this study, we began with a simple computational model that possesses the principal features of an intermittent strategy, i.e., careful local searches separated by longer steps, as a mechanism for relocation, where an agent in the model follows a rule to switch between two phases, but it could misunderstand this rule, i.e., the agent follows an ambiguous switching rule. Thanks to this ambiguity, the agent's foraging strategy can continuously change. First, we demonstrate that our model can exhibit an optimal change of strategy from Brownian-type to Lévy-type depending on the prey density, and we investigate the distribution of time intervals for switching between the phases. Moreover, we show that the model can display higher search efficiency than a correlated random walk.

A design methodology for nonlinear systems containing parameter uncertainty

NASA Technical Reports Server (NTRS)

Young, G. E.; Auslander, D. M.

1983-01-01

In the present design methodology for nonlinear systems containing parameter uncertainty, a generalized sensitivity analysis is incorporated which employs parameter space sampling and statistical inference. For the case of a system with j adjustable and k nonadjustable parameters, this methodology (which includes an adaptive random search strategy) is used to determine the combination of j adjustable parameter values which maximize the probability of those performance indices which simultaneously satisfy design criteria in spite of the uncertainty due to k nonadjustable parameters.

Strategies to overcome photobleaching in algorithm-based adaptive optics for nonlinear in-vivo imaging.

PubMed

Caroline Müllenbroich, M; McGhee, Ewan J; Wright, Amanda J; Anderson, Kurt I; Mathieson, Keith

2014-01-01

We have developed a nonlinear adaptive optics microscope utilizing a deformable membrane mirror (DMM) and demonstrated its use in compensating for system- and sample-induced aberrations. The optimum shape of the DMM was determined with a random search algorithm optimizing on either two photon fluorescence or second harmonic signals as merit factors. We present here several strategies to overcome photobleaching issues associated with lengthy optimization routines by adapting the search algorithm and the experimental methodology. Optimizations were performed on extrinsic fluorescent dyes, fluorescent beads loaded into organotypic tissue cultures and the intrinsic second harmonic signal of these cultures. We validate the approach of using these preoptimized mirror shapes to compile a robust look-up table that can be applied for imaging over several days and through a variety of tissues. In this way, the photon exposure to the fluorescent cells under investigation is limited to imaging. Using our look-up table approach, we show signal intensity improvement factors ranging from 1.7 to 4.1 in organotypic tissue cultures and freshly excised mouse tissue. Imaging zebrafish in vivo, we demonstrate signal improvement by a factor of 2. This methodology is easily reproducible and could be applied to many photon starved experiments, for example fluorescent life time imaging, or when photobleaching is a concern.

Adaptation and visual salience

PubMed Central

McDermott, Kyle C.; Malkoc, Gokhan; Mulligan, Jeffrey B.; Webster, Michael A.

2011-01-01

We examined how the salience of color is affected by adaptation to different color distributions. Observers searched for a color target on a dense background of distractors varying along different directions in color space. Prior adaptation to the backgrounds enhanced search on the same background while adaptation to orthogonal background directions slowed detection. Advantages of adaptation were seen for both contrast adaptation (to different color axes) and chromatic adaptation (to different mean chromaticities). Control experiments, including analyses of eye movements during the search, suggest that these aftereffects are unlikely to reflect simple learning or changes in search strategies on familiar backgrounds, and instead result from how adaptation alters the relative salience of the target and background colors. Comparable effects were observed along different axes in the chromatic plane or for axes defined by different combinations of luminance and chromatic contrast, consistent with visual search and adaptation mediated by multiple color mechanisms. Similar effects also occurred for color distributions characteristic of natural environments with strongly selective color gamuts. Our results are consistent with the hypothesis that adaptation may play an important functional role in highlighting the salience of novel stimuli by discounting ambient properties of the visual environment. PMID:21106682

Implementation strategies for guidelines at ICUs: a systematic review.

PubMed

Jordan, Portia; Mpasa, Ferestas; Ten Ham-Baloyi, Wilma; Bowers, Candice

2017-05-08

Purpose The purpose of this paper is to critically analyze empirical studies related to the implementation strategies for clinical practice guidelines (CPGs) in intensive care units (ICUs). Design/methodology/approach A systematic review with a narrative synthesis adapted from Popay et al.'s method for a narrative synthesis was conducted. A search using CINAHL, Google Scholar, Academic search complete, Cochrane Register for Randomized Controlled Trials, MEDLINE via PUBMED and grey literature was conducted in 2014 and updated in 2016 (August). After reading the abstracts, titles and full-text articles, 11 ( n=11) research studies met the inclusion criteria. Findings After critical appraisal, using the Joanna Briggs Critical Appraisal Tools, eight randomized controlled trials conducted in adult and neonatal ICUs using implementation strategies remained. Popay et al.'s method for narrative synthesis was adapted and used to analyze and synthesize the data and formulate concluding statements. Included studies found that multi-faceted strategies appear to be more effective than single strategies. Strategies mostly used were printed educational materials, information/ sessions, audit, feedback, use of champion leaders, educational outreach visits, and computer or internet usage. Practical training, monitoring visits and grand rounds were less used. Practical implications Findings can be used by clinicians to implement the best combination of multi-faceted implementation strategies in the ICUs in order to enhance the optimal use of CPGs. Originality/value No systematic review was previously done on the implementation strategies that should be used best for optimal CPG implementation in the ICU.

Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails

PubMed Central

2012-01-01

Background Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considering the huge number of possible ways to mix multiple drugs at different concentrations, it is practically difficult to identify the optimal drug combination through exhaustive testing. Results In this paper, we propose a novel stochastic search algorithm, called the adaptive reference update (ARU) algorithm, that can provide an efficient and systematic way for optimizing multi-drug cocktails. The ARU algorithm iteratively updates the drug combination to improve its response, where the update is made by comparing the response of the current combination with that of a reference combination, based on which the beneficial update direction is predicted. The reference combination is continuously updated based on the drug response values observed in the past, thereby adapting to the underlying drug response function. To demonstrate the effectiveness of the proposed algorithm, we evaluated its performance based on various multi-dimensional drug functions and compared it with existing algorithms. Conclusions Simulation results show that the ARU algorithm significantly outperforms existing stochastic search algorithms, including the Gur Game algorithm. In fact, the ARU algorithm can more effectively identify potent drug combinations and it typically spends fewer iterations for finding effective combinations. Furthermore, the ARU algorithm is robust to random fluctuations and noise in the measured drug response, which makes the algorithm well-suited for practical drug optimization applications. PMID:23134742

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

2012-03-01

A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

Universal principles governing multiple random searchers on complex networks: The logarithmic growth pattern and the harmonic law

NASA Astrophysics Data System (ADS)

Weng, Tongfeng; Zhang, Jie; Small, Michael; Harandizadeh, Bahareh; Hui, Pan

2018-03-01

We propose a unified framework to evaluate and quantify the search time of multiple random searchers traversing independently and concurrently on complex networks. We find that the intriguing behaviors of multiple random searchers are governed by two basic principles—the logarithmic growth pattern and the harmonic law. Specifically, the logarithmic growth pattern characterizes how the search time increases with the number of targets, while the harmonic law explores how the search time of multiple random searchers varies relative to that needed by individual searchers. Numerical and theoretical results demonstrate these two universal principles established across a broad range of random search processes, including generic random walks, maximal entropy random walks, intermittent strategies, and persistent random walks. Our results reveal two fundamental principles governing the search time of multiple random searchers, which are expected to facilitate investigation of diverse dynamical processes like synchronization and spreading.

A comparison of two search methods for determining the scope of systematic reviews and health technology assessments.

PubMed

Forsetlund, Louise; Kirkehei, Ingvild; Harboe, Ingrid; Odgaard-Jensen, Jan

2012-01-01

This study aims to compare two different search methods for determining the scope of a requested systematic review or health technology assessment. The first method (called the Direct Search Method) included performing direct searches in the Cochrane Database of Systematic Reviews (CDSR), Database of Abstracts of Reviews of Effects (DARE) and the Health Technology Assessments (HTA). Using the comparison method (called the NHS Search Engine) we performed searches by means of the search engine of the British National Health Service, NHS Evidence. We used an adapted cross-over design with a random allocation of fifty-five requests for systematic reviews. The main analyses were based on repeated measurements adjusted for the order in which the searches were conducted. The Direct Search Method generated on average fewer hits (48 percent [95 percent confidence interval {CI} 6 percent to 72 percent], had a higher precision (0.22 [95 percent CI, 0.13 to 0.30]) and more unique hits than when searching by means of the NHS Search Engine (50 percent [95 percent CI, 7 percent to 110 percent]). On the other hand, the Direct Search Method took longer (14.58 minutes [95 percent CI, 7.20 to 21.97]) and was perceived as somewhat less user-friendly than the NHS Search Engine (-0.60 [95 percent CI, -1.11 to -0.09]). Although the Direct Search Method had some drawbacks such as being more time-consuming and less user-friendly, it generated more unique hits than the NHS Search Engine, retrieved on average fewer references and fewer irrelevant results.

Optimal random Lévy-loop searching: New insights into the searching behaviours of central-place foragers

NASA Astrophysics Data System (ADS)

Reynolds, A. M.

2008-04-01

A random Lévy-looping model of searching is devised and optimal random Lévy-looping searching strategies are identified for the location of a single target whose position is uncertain. An inverse-square power law distribution of loop lengths is shown to be optimal when the distance between the centre of the search and the target is much shorter than the size of the longest possible loop in the searching pattern. Optimal random Lévy-looping searching patterns have recently been observed in the flight patterns of honeybees (Apis mellifera) when attempting to locate their hive and when searching after a known food source becomes depleted. It is suggested that the searching patterns of desert ants (Cataglyphis) are consistent with the adoption of an optimal Lévy-looping searching strategy.

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

PubMed

Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

2017-01-01

Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

Multiobjective optimization approach: thermal food processing.

PubMed

Abakarov, A; Sushkov, Y; Almonacid, S; Simpson, R

2009-01-01

The objective of this study was to utilize a multiobjective optimization technique for the thermal sterilization of packaged foods. The multiobjective optimization approach used in this study is based on the optimization of well-known aggregating functions by an adaptive random search algorithm. The applicability of the proposed approach was illustrated by solving widely used multiobjective test problems taken from the literature. The numerical results obtained for the multiobjective test problems and for the thermal processing problem show that the proposed approach can be effectively used for solving multiobjective optimization problems arising in the food engineering field.

On Searching Available Channels with Asynchronous MAC-Layer Spectrum Sensing

NASA Astrophysics Data System (ADS)

Jiang, Chunxiao; Ma, Xin; Chen, Canfeng; Ma, Jian; Ren, Yong

Dynamic spectrum access has become a focal issue recently, in which identifying the available spectrum plays a rather important role. Lots of work has been done concerning secondary user (SU) synchronously accessing primary user's (PU's) network. However, on one hand, SU may have no idea about PU's communication protocols; on the other, it is possible that communications among PU are not based on synchronous scheme at all. In order to address such problems, this paper advances a strategy for SU to search available spectrums with asynchronous MAC-layer sensing. With this method, SUs need not know the communication mechanisms in PU's network when dynamically accessing. We will focus on four aspects: 1) strategy for searching available channels; 2) vacating strategy when PUs come back; 3) estimation of channel parameters; 4) impact of SUs' interference on PU's data rate. The simulations show that our search strategy not only can achieve nearly 50% less interference probability than equal allocation of total search time, but also well adapts to time-varying channels. Moreover, access by our strategies can attain 150% more access time than random access. The moment matching estimator shows good performance in estimating and tracing time-varying channels.

Now hiring! Empirically testing a three-step intervention to increase faculty gender diversity in STEM

USGS Publications Warehouse

Smith, Jessi L.; Handley, Ian M.; Zale, Alexander V.; Rushing, Sara; Potvin, Martha A.

2015-01-01

Workforce homogeneity limits creativity, discovery, and job satisfaction; nonetheless, the vast majority of university faculty in science, technology, engineering, and mathematics (STEM) fields are men. We conducted a randomized and controlled three-step faculty search intervention based in self-determination theory aimed at increasing the number of women faculty in STEM at one US university where increasing diversity had historically proved elusive. Results show that the numbers of women candidates considered for and offered tenure-track positions were significantly higher in the intervention groups compared with those in controls. Searches in the intervention were 6.3 times more likely to make an offer to a woman candidate, and women who were made an offer were 5.8 times more likely to accept the offer from an intervention search. Although the focus was on increasing women faculty within STEM, the intervention can be adapted to other scientific and academic communities to advance diversity along any dimension.

Now Hiring! Empirically Testing a Three-Step Intervention to Increase Faculty Gender Diversity in STEM

PubMed Central

Smith, Jessi L.; Handley, Ian M.; Zale, Alexander V.; Rushing, Sara; Potvin, Martha A.

2015-01-01

Workforce homogeneity limits creativity, discovery, and job satisfaction; nonetheless, the vast majority of university faculty in science, technology, engineering, and mathematics (STEM) fields are men. We conducted a randomized and controlled three-step faculty search intervention based in self-determination theory aimed at increasing the number of women faculty in STEM at one US university where increasing diversity had historically proved elusive. Results show that the numbers of women candidates considered for and offered tenure-track positions were significantly higher in the intervention groups compared with those in controls. Searches in the intervention were 6.3 times more likely to make an offer to a woman candidate, and women who were made an offer were 5.8 times more likely to accept the offer from an intervention search. Although the focus was on increasing women faculty within STEM, the intervention can be adapted to other scientific and academic communities to advance diversity along any dimension. PMID:26955075

The Use of Milrinone in Patients with Delayed Cerebral Ischemia Following Subarachnoid Hemorrhage: A Systematic Review.

PubMed

Lannes, Marcelo; Zeiler, Frederick; Guichon, Céline; Teitelbaum, Jeanne

2017-03-01

The purpose of this article is to provide a systematic review of the evidence supporting the use of milrinone for the management of delayed cerebral ischemia (DCI) following subarachnoid hemorrhage (SAH). Primary outcomes were functional neurological status and the incidence of cerebral infarction. Search strategies adapted to the different databases were developed by a professional librarian. Medline, EMBASE, the Cochrane Library database, Web of Science, SCOPUS, BIOSIS, Global Health, Health Star, Open SIGLE, Google Scholar and the New York Academy of Medicine Gray Literature were searched as well as clinical trials databases and the proceedings of several scientific meetings. Quality of the evidence for these outcomes across studies was adjudicated using the GRADE Working Group criteria. The search resulted in 284 citations after elimination of duplicates. Of those 9 conference proceedings and 15 studies met inclusion criteria and consisted of case reports, case series and two comparative studies: one non-randomized study with physiological outcomes only and a case series with historical controls. There was considerable variation in dosing and in co-interventions and no case control or randomized controlled studies were found. There is currently only very low quality evidence to support the use of milrinone to improve important outcomes in patients with delayed cerebral ischemia secondary to subarachnoid hemorrhage. Further research is needed to clarify the value and risks of this medication in patients with SAH.

Validation of automatic landmark identification for atlas-based segmentation for radiation treatment planning of the head-and-neck region

NASA Astrophysics Data System (ADS)

Leavens, Claudia; Vik, Torbjørn; Schulz, Heinrich; Allaire, Stéphane; Kim, John; Dawson, Laura; O'Sullivan, Brian; Breen, Stephen; Jaffray, David; Pekar, Vladimir

2008-03-01

Manual contouring of target volumes and organs at risk in radiation therapy is extremely time-consuming, in particular for treating the head-and-neck area, where a single patient treatment plan can take several hours to contour. As radiation treatment delivery moves towards adaptive treatment, the need for more efficient segmentation techniques will increase. We are developing a method for automatic model-based segmentation of the head and neck. This process can be broken down into three main steps: i) automatic landmark identification in the image dataset of interest, ii) automatic landmark-based initialization of deformable surface models to the patient image dataset, and iii) adaptation of the deformable models to the patient-specific anatomical boundaries of interest. In this paper, we focus on the validation of the first step of this method, quantifying the results of our automatic landmark identification method. We use an image atlas formed by applying thin-plate spline (TPS) interpolation to ten atlas datasets, using 27 manually identified landmarks in each atlas/training dataset. The principal variation modes returned by principal component analysis (PCA) of the landmark positions were used by an automatic registration algorithm, which sought the corresponding landmarks in the clinical dataset of interest using a controlled random search algorithm. Applying a run time of 60 seconds to the random search, a root mean square (rms) distance to the ground-truth landmark position of 9.5 +/- 0.6 mm was calculated for the identified landmarks. Automatic segmentation of the brain, mandible and brain stem, using the detected landmarks, is demonstrated.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sheng, Zheng, E-mail: 19994035@sina.com; Wang, Jun; Zhou, Bihua

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 tomore » 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.« less

Classification of adaptive memetic algorithms: a comparative study.

PubMed

Ong, Yew-Soon; Lim, Meng-Hiot; Zhu, Ning; Wong, Kok-Wai

2006-02-01

Adaptation of parameters and operators represents one of the recent most important and promising areas of research in evolutionary computations; it is a form of designing self-configuring algorithms that acclimatize to suit the problem in hand. Here, our interests are on a recent breed of hybrid evolutionary algorithms typically known as adaptive memetic algorithms (MAs). One unique feature of adaptive MAs is the choice of local search methods or memes and recent studies have shown that this choice significantly affects the performances of problem searches. In this paper, we present a classification of memes adaptation in adaptive MAs on the basis of the mechanism used and the level of historical knowledge on the memes employed. Then the asymptotic convergence properties of the adaptive MAs considered are analyzed according to the classification. Subsequently, empirical studies on representatives of adaptive MAs for different type-level meme adaptations using continuous benchmark problems indicate that global-level adaptive MAs exhibit better search performances. Finally we conclude with some promising research directions in the area.

SAS procedures for designing and analyzing sample surveys

USGS Publications Warehouse

Stafford, Joshua D.; Reinecke, Kenneth J.; Kaminski, Richard M.

2003-01-01

Complex surveys often are necessary to estimate occurrence (or distribution), density, and abundance of plants and animals for purposes of re-search and conservation. Most scientists are familiar with simple random sampling, where sample units are selected from a population of interest (sampling frame) with equal probability. However, the goal of ecological surveys often is to make inferences about populations over large or complex spatial areas where organisms are not homogeneously distributed or sampling frames are in-convenient or impossible to construct. Candidate sampling strategies for such complex surveys include stratified,multistage, and adaptive sampling (Thompson 1992, Buckland 1994).

Intrinsic Lévy behaviour in organisms - searching for a mechanism. Comment on "Liberating Lévy walk research from the shackles of optimal foraging" by A.M. Reynolds

NASA Astrophysics Data System (ADS)

Sims, David W.

2015-09-01

The seminal papers by Viswanathan and colleagues in the late 1990s [1,2] proposed not only that scale-free, superdiffusive Lévy walks can describe the free-ranging movement patterns observed in animals such as the albatross [1], but that the Lévy walk was optimal for searching for sparsely and randomly distributed resource targets [2]. This distinct advantage, now shown to be present over a much broader set of conditions than originally theorised [3], implied that the Lévy walk is a search strategy that should be found very widely in organisms [4]. In the years since there have been several influential empirical studies showing that Lévy walks can indeed be detected in the movement patterns of a very broad range of taxa, from jellyfish, insects, fish, reptiles, seabirds, humans [5-10], and even in the fossilised trails of extinct invertebrates [11]. The broad optimality and apparent deep evolutionary origin of movement (search) patterns that are well approximated by Lévy walks led to the development of the Lévy flight foraging (LFF) hypothesis [12], which states that "since Lévy flights and walks can optimize search efficiencies, therefore natural selection should have led to adaptations for Lévy flight foraging".

LABRADOR: a learning autonomous behavior-based robot for adaptive detection and object retrieval

NASA Astrophysics Data System (ADS)

Yamauchi, Brian; Moseley, Mark; Brookshire, Jonathan

2013-01-01

As part of the TARDEC-funded CANINE (Cooperative Autonomous Navigation in a Networked Environment) Program, iRobot developed LABRADOR (Learning Autonomous Behavior-based Robot for Adaptive Detection and Object Retrieval). LABRADOR was based on the rugged, man-portable, iRobot PackBot unmanned ground vehicle (UGV) equipped with an explosives ordnance disposal (EOD) manipulator arm and a custom gripper. For LABRADOR, we developed a vision-based object learning and recognition system that combined a TLD (track-learn-detect) filter based on object shape features with a color-histogram-based object detector. Our vision system was able to learn in real-time to recognize objects presented to the robot. We also implemented a waypoint navigation system based on fused GPS, IMU (inertial measurement unit), and odometry data. We used this navigation capability to implement autonomous behaviors capable of searching a specified area using a variety of robust coverage strategies - including outward spiral, random bounce, random waypoint, and perimeter following behaviors. While the full system was not integrated in time to compete in the CANINE competition event, we developed useful perception, navigation, and behavior capabilities that may be applied to future autonomous robot systems.

Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization.

PubMed

Chen, Ying-ping; Chen, Chao-Hong

2010-01-01

An adaptive discretization method, called split-on-demand (SoD), enables estimation of distribution algorithms (EDAs) for discrete variables to solve continuous optimization problems. SoD randomly splits a continuous interval if the number of search points within the interval exceeds a threshold, which is decreased at every iteration. After the split operation, the nonempty intervals are assigned integer codes, and the search points are discretized accordingly. As an example of using SoD with EDAs, the integration of SoD and the extended compact genetic algorithm (ECGA) is presented and numerically examined. In this integration, we adopt a local search mechanism as an optional component of our back end optimization engine. As a result, the proposed framework can be considered as a memetic algorithm, and SoD can potentially be applied to other memetic algorithms. The numerical experiments consist of two parts: (1) a set of benchmark functions on which ECGA with SoD and ECGA with two well-known discretization methods: the fixed-height histogram (FHH) and the fixed-width histogram (FWH) are compared; (2) a real-world application, the economic dispatch problem, on which ECGA with SoD is compared to other methods. The experimental results indicate that SoD is a better discretization method to work with ECGA. Moreover, ECGA with SoD works quite well on the economic dispatch problem and delivers solutions better than the best known results obtained by other methods in existence.

Design for an Adaptive Library Catalog.

ERIC Educational Resources Information Center

Buckland, Michael K.; And Others

1992-01-01

Describes OASIS, a prototype adaptive online catalog implemented as a front end to the University of California MELVYL catalog. Topics addressed include the concept of adaptive retrieval systems, strategic search commands, feedback, prototyping using a front-end, the problem of excessive retrieval, commands to limit or increase search results, and…

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem

PubMed Central

Zamli, Kamal Z.; Din, Fakhrud; Bures, Miroslav

2018-01-01

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level. PMID:29771918

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem.

PubMed

Zamli, Kamal Z; Din, Fakhrud; Ahmed, Bestoun S; Bures, Miroslav

2018-01-01

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level.

The effect of atomoxetine on random and directed exploration in humans.

PubMed

Warren, Christopher M; Wilson, Robert C; van der Wee, Nic J; Giltay, Eric J; van Noorden, Martijn S; Cohen, Jonathan D; Nieuwenhuis, Sander

2017-01-01

The adaptive regulation of the trade-off between pursuing a known reward (exploitation) and sampling lesser-known options in search of something better (exploration) is critical for optimal performance. Theory and recent empirical work suggest that humans use at least two strategies for solving this dilemma: a directed strategy in which choices are explicitly biased toward information seeking, and a random strategy in which decision noise leads to exploration by chance. Here we examined the hypothesis that random exploration is governed by the neuromodulatory locus coeruleus-norepinephrine system. We administered atomoxetine, a norepinephrine transporter blocker that increases extracellular levels of norepinephrine throughout the cortex, to 22 healthy human participants in a double-blind crossover design. We examined the effect of treatment on performance in a gambling task designed to produce distinct measures of directed exploration and random exploration. In line with our hypothesis we found an effect of atomoxetine on random, but not directed exploration. However, contrary to expectation, atomoxetine reduced rather than increased random exploration. We offer three potential explanations of our findings, involving the non-linear relationship between tonic NE and cognitive performance, the interaction of atomoxetine with other neuromodulators, and the possibility that atomoxetine affected phasic norepinephrine activity more so than tonic norepinephrine activity.

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…

Adaptive Search through Constraint Violations

DTIC Science & Technology

1990-01-01

procedural) knowledge? Different methodologies are used to investigate these questions: Psychological experiments, computer simulations, historical studies...learns control knowledge through adaptive search. Unlike most other psychological models of skill acquisition, HS is a model of analytical, or...Newzll, 1986; VanLehn, in press). Psychological models of skill acquisition employ different problem solving mechanisms (forward search, backward

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.

PubMed

Xia, Yangkun; Fu, Zhuo; Tsai, Sang-Bing; Wang, Jiangtao

2018-05-10

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

Determination of Slope Safety Factor with Analytical Solution and Searching Critical Slip Surface with Genetic-Traversal Random Method

PubMed Central

2014-01-01

In the current practice, to determine the safety factor of a slope with two-dimensional circular potential failure surface, one of the searching methods for the critical slip surface is Genetic Algorithm (GA), while the method to calculate the slope safety factor is Fellenius' slices method. However GA needs to be validated with more numeric tests, while Fellenius' slices method is just an approximate method like finite element method. This paper proposed a new method to determine the minimum slope safety factor which is the determination of slope safety factor with analytical solution and searching critical slip surface with Genetic-Traversal Random Method. The analytical solution is more accurate than Fellenius' slices method. The Genetic-Traversal Random Method uses random pick to utilize mutation. A computer automatic search program is developed for the Genetic-Traversal Random Method. After comparison with other methods like slope/w software, results indicate that the Genetic-Traversal Random Search Method can give very low safety factor which is about half of the other methods. However the obtained minimum safety factor with Genetic-Traversal Random Search Method is very close to the lower bound solutions of slope safety factor given by the Ansys software. PMID:24782679

Self-adaptive multi-objective harmony search for optimal design of water distribution networks

NASA Astrophysics Data System (ADS)

Choi, Young Hwan; Lee, Ho Min; Yoo, Do Guen; Kim, Joong Hoon

2017-11-01

In multi-objective optimization computing, it is important to assign suitable parameters to each optimization problem to obtain better solutions. In this study, a self-adaptive multi-objective harmony search (SaMOHS) algorithm is developed to apply the parameter-setting-free technique, which is an example of a self-adaptive methodology. The SaMOHS algorithm attempts to remove some of the inconvenience from parameter setting and selects the most adaptive parameters during the iterative solution search process. To verify the proposed algorithm, an optimal least cost water distribution network design problem is applied to three different target networks. The results are compared with other well-known algorithms such as multi-objective harmony search and the non-dominated sorting genetic algorithm-II. The efficiency of the proposed algorithm is quantified by suitable performance indices. The results indicate that SaMOHS can be efficiently applied to the search for Pareto-optimal solutions in a multi-objective solution space.

Emergence of Lévy Walks from Second-Order Stochastic Optimization

NASA Astrophysics Data System (ADS)

Kuśmierz, Łukasz; Toyoizumi, Taro

2017-12-01

In natural foraging, many organisms seem to perform two different types of motile search: directed search (taxis) and random search. The former is observed when the environment provides cues to guide motion towards a target. The latter involves no apparent memory or information processing and can be mathematically modeled by random walks. We show that both types of search can be generated by a common mechanism in which Lévy flights or Lévy walks emerge from a second-order gradient-based search with noisy observations. No explicit switching mechanism is required—instead, continuous transitions between the directed and random motions emerge depending on the Hessian matrix of the cost function. For a wide range of scenarios, the Lévy tail index is α =1 , consistent with previous observations in foraging organisms. These results suggest that adopting a second-order optimization method can be a useful strategy to combine efficient features of directed and random search.

Digital-only PLL with adaptive search step

NASA Astrophysics Data System (ADS)

Lin, Ming-Lang; Huang, Shu-Chuan; Liu, Jie-Cherng

2014-06-01

In this paper, an all-digital phase-locked loop (PLL) with adaptively controlled up/down counter serves as the loop filter is presented, and it is implemented on a field-programmable gate array. The detailed circuit of the adaptive up/down counter implementing the adaptive search algorithm is also given, in which the search step for frequency acquisition is adaptively scaled down in half until it is reduced to zero. The phase jitter of the proposed PLL can be lowered, yet keeping with fast lock-in time. Thus, the dilemma between the low phase jitter and fast lock-in time of the traditional PLL can be resolved. Simulation results and circuit implementation show that the locked count, phase jitter and lock-in time of the proposed PLL are consistent with the theoretical predictions.

Black-Box System Testing of Real-Time Embedded Systems Using Random and Search-Based Testing

NASA Astrophysics Data System (ADS)

Arcuri, Andrea; Iqbal, Muhammad Zohaib; Briand, Lionel

Testing real-time embedded systems (RTES) is in many ways challenging. Thousands of test cases can be potentially executed on an industrial RTES. Given the magnitude of testing at the system level, only a fully automated approach can really scale up to test industrial RTES. In this paper we take a black-box approach and model the RTES environment using the UML/MARTE international standard. Our main motivation is to provide a more practical approach to the model-based testing of RTES by allowing system testers, who are often not familiar with the system design but know the application domain well-enough, to model the environment to enable test automation. Environment models can support the automation of three tasks: the code generation of an environment simulator, the selection of test cases, and the evaluation of their expected results (oracles). In this paper, we focus on the second task (test case selection) and investigate three test automation strategies using inputs from UML/MARTE environment models: Random Testing (baseline), Adaptive Random Testing, and Search-Based Testing (using Genetic Algorithms). Based on one industrial case study and three artificial systems, we show how, in general, no technique is better than the others. Which test selection technique to use is determined by the failure rate (testing stage) and the execution time of test cases. Finally, we propose a practical process to combine the use of all three test strategies.

School Locker Searches and the Fourth Amendment.

ERIC Educational Resources Information Center

Bjorklun, Eugene C.

1995-01-01

Because school lockers are potential hiding places for weapons and drugs, some schools are eliminating them. Searching student lockers on a random basis raises legal questions. Examines the legality of random locker searches based upon the guidelines for student searches set forth by the Supreme Court in "New Jersey v. T.L.O." and lower…

On random search: Collection kinetics of Paramecia into a trap embedded in a closed domain

NASA Astrophysics Data System (ADS)

Deforet, Maxime; Duplat, Jérôme; Vandenberghe, Nicolas; Villermaux, Emmanuel

2010-06-01

We study the kinetics of a large number of organisms initially spread uniformly in a circular two-dimensional medium, at the center of which a smaller circular trap has been introduced. We take advantage of the acidophily of Paramecium caudatum, which, coming from a neutral medium, penetrates a region of moderate acidity but moves back in the opposite situation when it meets a sharp negative acidity gradient to quantify its rate of irreversible aggregation into a spot of acidified medium in water. Two regimes are distinguished: A ballistic regime characteristic of "fresh" paramecia where the organisms swim in a straight path with a well defined velocity and a Brownian regime characteristic of older paramecia where the mean free path of the organisms is smaller than the system size. Both regimes are characterized by distinct aggregation laws. They both result from a pure random trapping process that appears to have no adaptive strategy.

Hybrid Topological Lie-Hamiltonian Learning in Evolving Energy Landscapes

NASA Astrophysics Data System (ADS)

Ivancevic, Vladimir G.; Reid, Darryn J.

2015-11-01

In this Chapter, a novel bidirectional algorithm for hybrid (discrete + continuous-time) Lie-Hamiltonian evolution in adaptive energy landscape-manifold is designed and its topological representation is proposed. The algorithm is developed within a geometrically and topologically extended framework of Hopfield's neural nets and Haken's synergetics (it is currently designed in Mathematica, although with small changes it could be implemented in Symbolic C++ or any other computer algebra system). The adaptive energy manifold is determined by the Hamiltonian multivariate cost function H, based on the user-defined vehicle-fleet configuration matrix W, which represents the pseudo-Riemannian metric tensor of the energy manifold. Search for the global minimum of H is performed using random signal differential Hebbian adaptation. This stochastic gradient evolution is driven (or, pulled-down) by `gravitational forces' defined by the 2nd Lie derivatives of H. Topological changes of the fleet matrix W are observed during the evolution and its topological invariant is established. The evolution stops when the W-topology breaks down into several connectivity-components, followed by topology-breaking instability sequence (i.e., a series of phase transitions).

Adaptive firefly algorithm: parameter analysis and its application.

PubMed

Cheung, Ngaam J; Ding, Xue-Ming; Shen, Hong-Bin

2014-01-01

As a nature-inspired search algorithm, firefly algorithm (FA) has several control parameters, which may have great effects on its performance. In this study, we investigate the parameter selection and adaptation strategies in a modified firefly algorithm - adaptive firefly algorithm (AdaFa). There are three strategies in AdaFa including (1) a distance-based light absorption coefficient; (2) a gray coefficient enhancing fireflies to share difference information from attractive ones efficiently; and (3) five different dynamic strategies for the randomization parameter. Promising selections of parameters in the strategies are analyzed to guarantee the efficient performance of AdaFa. AdaFa is validated over widely used benchmark functions, and the numerical experiments and statistical tests yield useful conclusions on the strategies and the parameter selections affecting the performance of AdaFa. When applied to the real-world problem - protein tertiary structure prediction, the results demonstrated improved variants can rebuild the tertiary structure with the average root mean square deviation less than 0.4Å and 1.5Å from the native constrains with noise free and 10% Gaussian white noise.

Adaptive Firefly Algorithm: Parameter Analysis and its Application

PubMed Central

Shen, Hong-Bin

2014-01-01

As a nature-inspired search algorithm, firefly algorithm (FA) has several control parameters, which may have great effects on its performance. In this study, we investigate the parameter selection and adaptation strategies in a modified firefly algorithm — adaptive firefly algorithm (AdaFa). There are three strategies in AdaFa including (1) a distance-based light absorption coefficient; (2) a gray coefficient enhancing fireflies to share difference information from attractive ones efficiently; and (3) five different dynamic strategies for the randomization parameter. Promising selections of parameters in the strategies are analyzed to guarantee the efficient performance of AdaFa. AdaFa is validated over widely used benchmark functions, and the numerical experiments and statistical tests yield useful conclusions on the strategies and the parameter selections affecting the performance of AdaFa. When applied to the real-world problem — protein tertiary structure prediction, the results demonstrated improved variants can rebuild the tertiary structure with the average root mean square deviation less than 0.4Å and 1.5Å from the native constrains with noise free and 10% Gaussian white noise. PMID:25397812

Adaptive rood pattern search for fast block-matching motion estimation.

PubMed

Nie, Yao; Ma, Kai-Kuang

2002-01-01

In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) initial search and 2) refined local search. For each macroblock (MB), the initial search is performed only once at the beginning in order to find a good starting point for the follow-up refined local search. By doing so, unnecessary intermediate search and the risk of being trapped into local minimum matching error points could be greatly reduced in long search case. For the initial search stage, an adaptive rood pattern (ARP) is proposed, and the ARP's size is dynamically determined for each MB, based on the available motion vectors (MVs) of the neighboring MBs. In the refined local search stage, a unit-size rood pattern (URP) is exploited repeatedly, and unrestrictedly, until the final MV is found. To further speed up the search, zero-motion prejudgment (ZMP) is incorporated in our method, which is particularly beneficial to those video sequences containing small motion contents. Extensive experiments conducted based on the MPEG-4 Verification Model (VM) encoding platform show that the search speed of our proposed ARPS-ZMP is about two to three times faster than that of the diamond search (DS), and our method even achieves higher peak signal-to-noise ratio (PSNR) particularly for those video sequences containing large and/or complex motion contents.

Implementing the Army NetCentric Data Strategy in a ServiceOriented Environment

DTIC Science & Technology

2009-04-23

a Data Subscriptionc c e s s Federated Search Data Search D a t a A b s t r a c t i o n Adapter Configuration Adapter Data Service D a t a S e r...across t e enterpr se.  • Patterns • Search • Status • Receive – Services • Federated   Search • Artifact Discovery • Data Discovery 17 Data Discovery

Association between endothelial nitric oxide synthase (ENOS) G894T polymorphism and high altitude (HA) adaptation: a meta-analysis.

PubMed

Lu, Hong-xiang; Wang, Yu-xiao; Chen, Yu; Luo, Yong-jun

2015-11-01

Highland natives adapt well to the hypoxic environment at high altitude (HA). Several genes have been reported to be linked to HA adaptation. Previous studies showed that the endothelial ni- tric oxide synthase (ENOS) G894T polymorphism contributed to the physiology and pathophysiology of hu- mans at HA by regulating the production of NO. In this meta-analysis, we evaluate the association between the ENOS G894T polymorphism and HA adaptation through analyzing the published data. We searched all relevant literature about the ENOS G894T polymorphism and HA adaptation in PubMed, Med- line, and Embase before Step 2015. A random-effects model was applied (Revman 5.0), and study quality was assessed in duplicate. Six studies with 634 HA native cases and 621 low-altitude controls were included in this meta-analysis. From the results, we observed that the wild-type allele G was significantly overrepresented in the HA groups (OR = 1.85; 95% Cl, 1.47-2.33; P < 0.0001). In addition, the GG genotype was significantly associated with HA adaptation (OR = 1.99; 95% Cl, 1.54-2.57; P < 0.0001). Our results showed that in 894 G allele carriers, the GG genotype might be a beneficial factor for HA adaptation through enhancing the level of NO. However, more studies were needed to confirm our findings due to the limited sample size.

Self-correcting random number generator

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S.; Pooser, Raphael C.

2016-09-06

A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, tomore » provide a random number according to one or more performance criteria.« less

Stochastic Models of Emerging Infectious Disease Transmission on Adaptive Random Networks

PubMed Central

Pipatsart, Navavat; Triampo, Wannapong

2017-01-01

We presented adaptive random network models to describe human behavioral change during epidemics and performed stochastic simulations of SIR (susceptible-infectious-recovered) epidemic models on adaptive random networks. The interplay between infectious disease dynamics and network adaptation dynamics was investigated in regard to the disease transmission and the cumulative number of infection cases. We found that the cumulative case was reduced and associated with an increasing network adaptation probability but was increased with an increasing disease transmission probability. It was found that the topological changes of the adaptive random networks were able to reduce the cumulative number of infections and also to delay the epidemic peak. Our results also suggest the existence of a critical value for the ratio of disease transmission and adaptation probabilities below which the epidemic cannot occur. PMID:29075314

A bio-inspired swarm robot coordination algorithm for multiple target searching

NASA Astrophysics Data System (ADS)

Meng, Yan; Gan, Jing; Desai, Sachi

2008-04-01

The coordination of a multi-robot system searching for multi targets is challenging under dynamic environment since the multi-robot system demands group coherence (agents need to have the incentive to work together faithfully) and group competence (agents need to know how to work together well). In our previous proposed bio-inspired coordination method, Local Interaction through Virtual Stigmergy (LIVS), one problem is the considerable randomness of the robot movement during coordination, which may lead to more power consumption and longer searching time. To address these issues, an adaptive LIVS (ALIVS) method is proposed in this paper, which not only considers the travel cost and target weight, but also predicting the target/robot ratio and potential robot redundancy with respect to the detected targets. Furthermore, a dynamic weight adjustment is also applied to improve the searching performance. This new method a truly distributed method where each robot makes its own decision based on its local sensing information and the information from its neighbors. Basically, each robot only communicates with its neighbors through a virtual stigmergy mechanism and makes its local movement decision based on a Particle Swarm Optimization (PSO) algorithm. The proposed ALIVS algorithm has been implemented on the embodied robot simulator, Player/Stage, in a searching target. The simulation results demonstrate the efficiency and robustness in a power-efficient manner with the real-world constraints.

Optimizing random searches on three-dimensional lattices

NASA Astrophysics Data System (ADS)

Yang, Benhao; Yang, Shunkun; Zhang, Jiaquan; Li, Daqing

2018-07-01

Search is a universal behavior related to many types of intelligent individuals. While most studies have focused on search in two or infinite-dimensional space, it is still missing how search can be optimized in three-dimensional space. Here we study random searches on three-dimensional (3d) square lattices with periodic boundary conditions, and explore the optimal search strategy with a power-law step length distribution, p(l) ∼l-μ, known as Lévy flights. We find that compared to random searches on two-dimensional (2d) lattices, the optimal exponent μopt on 3d lattices is relatively smaller in non-destructive case and remains similar in destructive case. We also find μopt decreases as the lattice length in z direction increases under high target density. Our findings may help us to understand the role of spatial dimension in search behaviors.

Randomized trial for answers to clinical questions: evaluating a pre-appraised versus a MEDLINE search protocol.

PubMed

Patel, Manesh R; Schardt, Connie M; Sanders, Linda L; Keitz, Sheri A

2006-10-01

The paper compares the speed, validity, and applicability of two different protocols for searching the primary medical literature. A randomized trial involving medicine residents was performed. An inpatient general medicine rotation was used. Thirty-two internal medicine residents were block randomized into four groups of eight. Success rate of each search protocol was measured by perceived search time, number of questions answered, and proportion of articles that were applicable and valid. Residents randomized to the MEDLINE-first (protocol A) group searched 120 questions, and residents randomized to the MEDLINE-last (protocol B) searched 133 questions. In protocol A, 104 answers (86.7%) and, in protocol B, 117 answers (88%) were found to clinical questions. In protocol A, residents reported that 26 (25.2%) of the answers were obtained quickly or rated as "fast" (<5 minutes) as opposed to 55 (51.9%) in protocol B, (P = 0.0004). A subset of questions and articles (n = 79) were reviewed by faculty who found that both protocols identified similar numbers of answer articles that addressed the questions and were felt to be valid using critical appraisal criteria. For resident-generated clinical questions, both protocols produced a similarly high percentage of applicable and valid articles. The MEDLINE-last search protocol was perceived to be faster. However, in the MEDLINE-last protocol, a significant portion of questions (23%) still required searching MEDLINE to find an answer.

Integration and Analysis of Neighbor Discovery and Link Quality Estimation in Wireless Sensor Networks

PubMed Central

Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Abd Razak, Shukor

2014-01-01

Network connectivity and link quality information are the fundamental requirements of wireless sensor network protocols to perform their desired functionality. Most of the existing discovery protocols have only focused on the neighbor discovery problem, while a few number of them provide an integrated neighbor search and link estimation. As these protocols require a careful parameter adjustment before network deployment, they cannot provide scalable and accurate network initialization in large-scale dense wireless sensor networks with random topology. Furthermore, performance of these protocols has not entirely been evaluated yet. In this paper, we perform a comprehensive simulation study on the efficiency of employing adaptive protocols compared to the existing nonadaptive protocols for initializing sensor networks with random topology. In this regard, we propose adaptive network initialization protocols which integrate the initial neighbor discovery with link quality estimation process to initialize large-scale dense wireless sensor networks without requiring any parameter adjustment before network deployment. To the best of our knowledge, this work is the first attempt to provide a detailed simulation study on the performance of integrated neighbor discovery and link quality estimation protocols for initializing sensor networks. This study can help system designers to determine the most appropriate approach for different applications. PMID:24678277

Adaptive pre-specification in randomized trials with and without pair-matching.

PubMed

Balzer, Laura B; van der Laan, Mark J; Petersen, Maya L

2016-11-10

In randomized trials, adjustment for measured covariates during the analysis can reduce variance and increase power. To avoid misleading inference, the analysis plan must be pre-specified. However, it is often unclear a priori which baseline covariates (if any) should be adjusted for in the analysis. Consider, for example, the Sustainable East Africa Research in Community Health (SEARCH) trial for HIV prevention and treatment. There are 16 matched pairs of communities and many potential adjustment variables, including region, HIV prevalence, male circumcision coverage, and measures of community-level viral load. In this paper, we propose a rigorous procedure to data-adaptively select the adjustment set, which maximizes the efficiency of the analysis. Specifically, we use cross-validation to select from a pre-specified library the candidate targeted maximum likelihood estimator (TMLE) that minimizes the estimated variance. For further gains in precision, we also propose a collaborative procedure for estimating the known exposure mechanism. Our small sample simulations demonstrate the promise of the methodology to maximize study power, while maintaining nominal confidence interval coverage. We show how our procedure can be tailored to the scientific question (intervention effect for the study sample vs. for the target population) and study design (pair-matched or not). Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Adaptive infinite impulse response system identification using modified-interior search algorithm with Lèvy flight.

PubMed

Kumar, Manjeet; Rawat, Tarun Kumar; Aggarwal, Apoorva

2017-03-01

In this paper, a new meta-heuristic optimization technique, called interior search algorithm (ISA) with Lèvy flight is proposed and applied to determine the optimal parameters of an unknown infinite impulse response (IIR) system for the system identification problem. ISA is based on aesthetics, which is commonly used in interior design and decoration processes. In ISA, composition phase and mirror phase are applied for addressing the nonlinear and multimodal system identification problems. System identification using modified-ISA (M-ISA) based method involves faster convergence, single parameter tuning and does not require derivative information because it uses a stochastic random search using the concepts of Lèvy flight. A proper tuning of control parameter has been performed in order to achieve a balance between intensification and diversification phases. In order to evaluate the performance of the proposed method, mean square error (MSE), computation time and percentage improvement are considered as the performance measure. To validate the performance of M-ISA based method, simulations has been carried out for three benchmarked IIR systems using same order and reduced order system. Genetic algorithm (GA), particle swarm optimization (PSO), cat swarm optimization (CSO), cuckoo search algorithm (CSA), differential evolution using wavelet mutation (DEWM), firefly algorithm (FFA), craziness based particle swarm optimization (CRPSO), harmony search (HS) algorithm, opposition based harmony search (OHS) algorithm, hybrid particle swarm optimization-gravitational search algorithm (HPSO-GSA) and ISA are also used to model the same examples and simulation results are compared. Obtained results confirm the efficiency of the proposed method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Tadpole transport logistics in a Neotropical poison frog: indications for strategic planning and adaptive plasticity in anuran parental care.

PubMed

Ringler, Eva; Pašukonis, Andrius; Hödl, Walter; Ringler, Max

2013-11-09

Individuals should aim to adjust their parental behaviours in order to maximize the success of their offspring but minimize associated costs. Plasticity in parental care is well documented from various bird, mammal and fish species, whereas amphibians were traditionally assumed as being highly instinct-bound. Therefore, little is known about 'higher' cognitive abilities of amphibians, such as strategic planning and behavioural flexibility. Dendrobatid frogs have evolved a remarkable diversity of parental behaviours. The most noticeable of these behaviours is tadpole transport, which is obligatory in almost all species. Nonetheless, there is limited knowledge about spatial and temporal patterns of tadpole transport and the possible existence of behavioural plasticity on the individual level. In this study, we investigated correlates of tadpole transport behaviour in a natural population of the dendrobatid frog Allobates femoralis during five years. Tadpole transport was predominantly observed during morning hours. Although tadpoles were carried almost exclusively by males (N = 119), we also observed ten females performing this task. The parentage analysis revealed that in all cases females transported their own offspring. In contrast, four tadpole-carrying males were not the genetic fathers of the larvae they were transporting. The average clutch size of 20 eggs and our observation of an average of 8 tadpoles on the back of transporting individuals indicate that frogs do not carry entire clutches at once, and/or that they distribute their larvae across several water bodies. Contrary to the predictions from a hypothetical random search for deposition sites, the number of transported tadpoles was higher in males that travelled over longer distances. Our results suggest a strong selective pressure on males to shift the time invested in tadpole transport to periods of low intra-specific competition. The number of tadpoles on the back of the males significantly correlated with displacement distance from the respective home territories, indicating a strategic non-random tadpole transport rather than random search for suitable tadpole deposition sites during tadpole transport. The observation of females who occasionally transported larvae supports the prevalence of adaptive plasticity in parental behaviours even in a species with a rather low level of parental care.

Complex adaptive systems and their relevance for nursing: An evolutionary concept analysis.

PubMed

Notarnicola, Ippolito; Petrucci, Cristina; De Jesus Barbosa, Maria Rosimar; Giorgi, Fabio; Stievano, Alessandro; Rocco, Gennaro; Lancia, Loreto

2017-06-01

This study aimed to analyse the concept of "complex adaptive systems." The construct is still nebulous in the literature, and a further explanation of the idea is needed to have a shared knowledge of it. A concept analysis was conducted utilizing Rodgers evolutionary method. The inclusive years of bibliographic search started from 2005 to 2015. The search was conducted at PubMed©, CINAHL© (EBSCO host©), Scopus©, Web of Science©, and Academic Search Premier©. Retrieved papers were critically analysed to explore the attributes, antecedents, and consequences of the concept. Moreover, surrogates, related terms, and a pattern recognition scheme were identified. The concept analysis showed that complex systems are adaptive and have the ability to process information. They can adapt to the environment and consequently evolve. Nursing is a complex adaptive system, and the nursing profession in practice exhibits complex adaptive system characteristics. Complexity science through complex adaptive systems provides new ways of seeing and understanding the mechanisms that underpin the nursing profession. © 2017 John Wiley & Sons Australia, Ltd.

The "new normal": Adapting doctoral trainee career preparation for broad career paths in science.

PubMed

St Clair, Rebekah; Hutto, Tamara; MacBeth, Cora; Newstetter, Wendy; McCarty, Nael A; Melkers, Julia

2017-01-01

Doctoral recipients in the biomedical sciences and STEM fields are showing increased interest in career opportunities beyond academic positions. While recent research has addressed the interests and preferences of doctoral trainees for non-academic careers, the strategies and resources that trainees use to prepare for a broad job market (non-academic) are poorly understood. The recent adaptation of the Social Cognitive Career Theory to explicitly highlight the interplay of contextual support mechanisms, individual career search efficacy, and self-adaptation of job search processes underscores the value of attention to this explicit career phase. Our research addresses the factors that affect the career search confidence and job search strategies of doctoral trainees with non-academic career interests and is based on nearly 900 respondents from an NIH-funded survey of doctoral students and postdoctoral fellows in the biomedical sciences at two U.S. universities. Using structural equation modeling, we find that trainees pursuing non-academic careers, and/or with low perceived program support for career goals, have lower career development and search process efficacy (CDSE), and receive different levels of support from their advisors/supervisors. We also find evidence of trainee adaptation driven by their career search efficacy, and not by career interests.

The “new normal”: Adapting doctoral trainee career preparation for broad career paths in science

PubMed Central

St. Clair, Rebekah; Hutto, Tamara; MacBeth, Cora; Newstetter, Wendy; McCarty, Nael A.

2017-01-01

Doctoral recipients in the biomedical sciences and STEM fields are showing increased interest in career opportunities beyond academic positions. While recent research has addressed the interests and preferences of doctoral trainees for non-academic careers, the strategies and resources that trainees use to prepare for a broad job market (non-academic) are poorly understood. The recent adaptation of the Social Cognitive Career Theory to explicitly highlight the interplay of contextual support mechanisms, individual career search efficacy, and self-adaptation of job search processes underscores the value of attention to this explicit career phase. Our research addresses the factors that affect the career search confidence and job search strategies of doctoral trainees with non-academic career interests and is based on nearly 900 respondents from an NIH-funded survey of doctoral students and postdoctoral fellows in the biomedical sciences at two U.S. universities. Using structural equation modeling, we find that trainees pursuing non-academic careers, and/or with low perceived program support for career goals, have lower career development and search process efficacy (CDSE), and receive different levels of support from their advisors/supervisors. We also find evidence of trainee adaptation driven by their career search efficacy, and not by career interests. PMID:28542304

Enhanced oxygen vacancy diffusion in Ta2O5 resistive memory devices due to infinitely adaptive crystal structure

NASA Astrophysics Data System (ADS)

Jiang, Hao; Stewart, Derek A.

2016-04-01

Metal oxide resistive memory devices based on Ta2O5 have demonstrated high switching speed, long endurance, and low set voltage. However, the physical origin of this improved performance is still unclear. Ta2O5 is an important archetype of a class of materials that possess an adaptive crystal structure that can respond easily to the presence of defects. Using first principles nudged elastic band calculations, we show that this adaptive crystal structure leads to low energy barriers for in-plane diffusion of oxygen vacancies in λ phase Ta2O5. Identified diffusion paths are associated with collective motion of neighboring atoms. The overall vacancy diffusion is anisotropic with higher diffusion barriers found for oxygen vacancy movement between Ta-O planes. Coupled with the fact that oxygen vacancy formation energy in Ta2O5 is relatively small, our calculated low diffusion barriers can help explain the low set voltage in Ta2O5 based resistive memory devices. Our work shows that other oxides with adaptive crystal structures could serve as potential candidates for resistive random access memory devices. We also discuss some general characteristics for ideal resistive RAM oxides that could be used in future computational material searches.

Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2004-09-01

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearestmore » optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillard's algorithm can be modeled with high fidelity as a simple variant of a straightforward random walk. The random walk model accounts for nearly all of the variability in the cost required to locate both optimal and sub-optimal solutions to random JSPs, and provides an explanation for differences in the difficulty of random versus structured JSPs. Finally, we discuss and empirically substantiate two novel predictions regarding tabu search algorithm behavior. First, the method for constructing the initial solution is highly unlikely to impact the performance of tabu search. Second, tabu tenure should be selected to be as small as possible while simultaneously avoiding search stagnation; values larger than necessary lead to significant degradations in performance.« less

Validating the random search model for two targets of different difficulty.

PubMed

Chan, Alan H S; Yu, Ruifeng

2010-02-01

A random visual search model was fitted to 1,788 search times obtained from a nonidentical double-target search task. 30 Hong Kong Chinese (13 men, 17 women) ages 18 to 33 years (M = 23, SD = 6.8) took part in the experiment voluntarily. The overall adequacy and prediction accuracy of the model for various search time parameters (mean and median search times and response times) for both individual and pooled data show that search strategy may reasonably be inferred from search time distributions. The results also suggested the general applicability of the random search model for describing the search behavior of a large number of participants performing the type of search used here, as well as the practical feasibility of its application for determination of stopping policy for optimization of an inspection system design. Although the data generally conformed to the model the search for the more difficult target was faster than expected. The more difficult target was usually detected after the easier target and it is suggested that some degree of memory-guided searching may have been used for the second target. Some abnormally long search times were observed and it is possible that these might have been due to the characteristics of visual lobes, nonoptimum interfixation distances and inappropriate overlapping of lobes, as has been previously reported.

A novel ternary content addressable memory design based on resistive random access memory with high intensity and low search energy

NASA Astrophysics Data System (ADS)

Han, Runze; Shen, Wensheng; Huang, Peng; Zhou, Zheng; Liu, Lifeng; Liu, Xiaoyan; Kang, Jinfeng

2018-04-01

A novel ternary content addressable memory (TCAM) design based on resistive random access memory (RRAM) is presented. Each TCAM cell consists of two parallel RRAM to both store and search for ternary data. The cell size of the proposed design is 8F2, enable a ∼60× cell area reduction compared with the conventional static random access memory (SRAM) based implementation. Simulation results also show that the search delay and energy consumption of the proposed design at the 64-bit word search are 2 ps and 0.18 fJ/bit/search respectively at 22 nm technology node, where significant improvements are achieved compared to previous works. The desired characteristics of RRAM for implementation of the high performance TCAM search chip are also discussed.

RARtool: A MATLAB Software Package for Designing Response-Adaptive Randomized Clinical Trials with Time-to-Event Outcomes.

PubMed

Ryeznik, Yevgen; Sverdlov, Oleksandr; Wong, Weng Kee

2015-08-01

Response-adaptive randomization designs are becoming increasingly popular in clinical trial practice. In this paper, we present RARtool , a user interface software developed in MATLAB for designing response-adaptive randomized comparative clinical trials with censored time-to-event outcomes. The RARtool software can compute different types of optimal treatment allocation designs, and it can simulate response-adaptive randomization procedures targeting selected optimal allocations. Through simulations, an investigator can assess design characteristics under a variety of experimental scenarios and select the best procedure for practical implementation. We illustrate the utility of our RARtool software by redesigning a survival trial from the literature.

Quantity and quality assessment of randomized controlled trials on orthodontic practice in PubMed.

PubMed

Shimada, Tatsuo; Takayama, Hisako; Nakamura, Yoshiki

2010-07-01

To find current high-quality evidence for orthodontic practice within a reasonable time, we tested the performance of a PubMed search. PubMed was searched using publication type randomized controlled trial and medical subject heading term "orthodontics" for articles published between 2003 and 2007. The PubMed search results were compared with those from a hand search of four orthodontic journals to determine the sensitivity of PubMed search. We evaluated the precision of the PubMed search result and assessed the quality of individual randomized controlled trials using the Jadad scale. Sensitivity and precision were 97.46% and 58.12%, respectively. In PubMed, of the 277 articles retrieved, 161 (58.12%) were randomized controlled trials on orthodontic practice, and 115 of the 161 articles (71.42%) were published in four orthodontic journals: American Journal of Orthodontics and Dentofacial Orthopedics, The Angle Orthodontist, the European Journal of Orthodontics, and the Journal of Orthodontics. Assessment by the Jadad scale revealed 60 high-quality randomized controlled trials on orthodontic practice, of which 45 (75%) were published in these four journals. PubMed is a highly desirable search engine for evidence-based orthodontic practice. To stay current and get high-quality evidence, it is reasonable to look through four orthodontic journals: American Journal of Orthodontics and Dentofacial Orthopedics, The Angle Orthodontist, the European Journal of Orthodontics, and the Journal of Orthodontics.

Searches for Randomized Controlled Trials of Drugs in MEDLINE and EMBASE Using Only Generic Drug Names Compared with Searches Applied in Current Practice in Systematic Reviews

ERIC Educational Resources Information Center

Waffenschmidt, Siw; Guddat, Charlotte

2015-01-01

Background: It is unclear which terms should be included in bibliographic searches for randomized controlled trials (RCTs) of drugs, and identifying relevant drug terms can be extremely laborious. The aim of our analysis was to determine whether a bibliographic search using only the generic drug name produces sufficient results for the generation…

Robustness of optimal random searches in fragmented environments

NASA Astrophysics Data System (ADS)

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

2015-05-01

The random search problem is a challenging and interdisciplinary topic of research in statistical physics. Realistic searches usually take place in nonuniform heterogeneous distributions of targets, e.g., patchy environments and fragmented habitats in ecological systems. Here we present a comprehensive numerical study of search efficiency in arbitrarily fragmented landscapes with unlimited visits to targets that can only be found within patches. We assume a random walker selecting uniformly distributed turning angles and step lengths from an inverse power-law tailed distribution with exponent μ . Our main finding is that for a large class of fragmented environments the optimal strategy corresponds approximately to the same value μopt≈2 . Moreover, this exponent is indistinguishable from the well-known exact optimal value μopt=2 for the low-density limit of homogeneously distributed revisitable targets. Surprisingly, the best search strategies do not depend (or depend only weakly) on the specific details of the fragmentation. Finally, we discuss the mechanisms behind this observed robustness and comment on the relevance of our results to both the random search theory in general, as well as specifically to the foraging problem in the biological context.

Bayesian adaptive trials offer advantages in comparative effectiveness trials: an example in status epilepticus.

PubMed

Connor, Jason T; Elm, Jordan J; Broglio, Kristine R

2013-08-01

We present a novel Bayesian adaptive comparative effectiveness trial comparing three treatments for status epilepticus that uses adaptive randomization with potential early stopping. The trial will enroll 720 unique patients in emergency departments and uses a Bayesian adaptive design. The trial design is compared to a trial without adaptive randomization and produces an efficient trial in which a higher proportion of patients are likely to be randomized to the most effective treatment arm while generally using fewer total patients and offers higher power than an analogous trial with fixed randomization when identifying a superior treatment. When one treatment is superior to the other two, the trial design provides better patient care, higher power, and a lower expected sample size. Copyright © 2013 Elsevier Inc. All rights reserved.

Adaptive Functioning in Williams Syndrome: A Systematic Review

ERIC Educational Resources Information Center

Brawn, Gabrielle; Porter, Melanie

2018-01-01

Literature on the level of adaptive functioning and relative strengths and weaknesses in functioning of individuals with Williams syndrome (WS) was reviewed. The electronic databases PsycINFO, PubMed, Expanded Academic, Web of Science, Scopus and ProQuest were searched electronically for relevant articles and dissertations using the search terms…

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

PubMed Central

Fu, Zhuo; Wang, Jiangtao

2018-01-01

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics. PMID:29747469

Fast Human Detection for Intelligent Monitoring Using Surveillance Visible Sensors

PubMed Central

Ko, Byoung Chul; Jeong, Mira; Nam, JaeYeal

2014-01-01

Human detection using visible surveillance sensors is an important and challenging work for intruder detection and safety management. The biggest barrier of real-time human detection is the computational time required for dense image scaling and scanning windows extracted from an entire image. This paper proposes fast human detection by selecting optimal levels of image scale using each level's adaptive region-of-interest (ROI). To estimate the image-scaling level, we generate a Hough windows map (HWM) and select a few optimal image scales based on the strength of the HWM and the divide-and-conquer algorithm. Furthermore, adaptive ROIs are arranged per image scale to provide a different search area. We employ a cascade random forests classifier to separate candidate windows into human and nonhuman classes. The proposed algorithm has been successfully applied to real-world surveillance video sequences, and its detection accuracy and computational speed show a better performance than those of other related methods. PMID:25393782

A methodological survey identified eight proposed frameworks for the adaptation of health related guidelines.

PubMed

Darzi, Andrea; Abou-Jaoude, Elias A; Agarwal, Arnav; Lakis, Chantal; Wiercioch, Wojtek; Santesso, Nancy; Brax, Hneine; El-Jardali, Fadi; Schünemann, Holger J; Akl, Elie A

2017-06-01

Our objective was to identify and describe published frameworks for adaptation of clinical, public health, and health services guidelines. We included reports describing methods of adaptation of guidelines in sufficient detail to allow its reproducibility. We searched Medline and EMBASE databases. We also searched personal files, as well manuals and handbooks of organizations and professional societies that proposed methods of adaptation and adoption of guidelines. We followed standard systematic review methodology. Our search captured 12,021 citations, out of which we identified eight proposed methods of guidelines adaptation: ADAPTE, Adapted ADAPTE, Alberta Ambassador Program adaptation phase, GRADE-ADOLOPMENT, MAGIC, RAPADAPTE, Royal College of Nursing (RCN), and Systematic Guideline Review (SGR). The ADAPTE framework consists of a 24-step process to adapt guidelines to a local context taking into consideration the needs, priorities, legislation, policies, and resources. The Alexandria Center for Evidence-Based Clinical Practice Guidelines updated one of ADAPTE's tools, modified three tools, and added three new ones. In addition, they proposed optionally using three other tools. The Alberta Ambassador Program adaptation phase consists of 11 steps and focused on adapting good-quality guidelines for nonspecific low back pain into local context. GRADE-ADOLOPMENT is an eight-step process based on the GRADE Working Group's Evidence to Decision frameworks and applied in 22 guidelines in the context of national guideline development program. The MAGIC research program developed a five-step adaptation process, informed by ADAPTE and the GRADE approach in the context of adapting thrombosis guidelines. The RAPADAPTE framework consists of 12 steps based on ADAPTE and using synthesized evidence databases, retrospectively derived from the experience of producing a high-quality guideline for the treatment of breast cancer with limited resources in Costa Rica. The RCN outlines five key steps strategy for adaptation of guidelines to the local context. The SGR method consists of nine steps and takes into consideration both methodological gaps and context-specific normative issues in source guidelines. We identified through searching personal files two abandoned methods. We identified and described eight proposed frameworks for the adaptation of health-related guidelines. There is a need to evaluate these different frameworks to assess rigor, efficiency, and transparency of their proposed processes. Copyright © 2017 Elsevier Inc. All rights reserved.

A Hybrid Search Algorithm for Swarm Robots Searching in an Unknown Environment

PubMed Central

Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

2014-01-01

This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency. PMID:25386855

A hybrid search algorithm for swarm robots searching in an unknown environment.

PubMed

Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

2014-01-01

This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

Attention and apparent motion.

PubMed

Horowitz, T; Treisman, A

1994-01-01

Two dissociations between short- and long-range motion in visual search are reported. Previous research has shown parallel processing for short-range motion and apparently serial processing for long-range motion. This finding has been replicated and it has also been found that search for short-range targets can be impaired both by using bicontrast stimuli, and by prior adaptation to the target direction of motion. Neither factor impaired search in long-range motion displays. Adaptation actually facilitated search with long-range displays, which is attributed to response-level effects. A feature-integration account of apparent motion is proposed. In this theory, short-range motion depends on specialized motion feature detectors operating in parallel across the display, but subject to selective adaptation, whereas attention is needed to link successive elements when they appear at greater separations, or across opposite contrasts.

Lévy flight and Brownian search patterns of a free-ranging predator reflect different prey field characteristics.

PubMed

Sims, David W; Humphries, Nicolas E; Bradford, Russell W; Bruce, Barry D

2012-03-01

1. Search processes play an important role in physical, chemical and biological systems. In animal foraging, the search strategy predators should use to search optimally for prey is an enduring question. Some models demonstrate that when prey is sparsely distributed, an optimal search pattern is a specialised random walk known as a Lévy flight, whereas when prey is abundant, simple Brownian motion is sufficiently efficient. These predictions form part of what has been termed the Lévy flight foraging hypothesis (LFF) which states that as Lévy flights optimise random searches, movements approximated by optimal Lévy flights may have naturally evolved in organisms to enhance encounters with targets (e.g. prey) when knowledge of their locations is incomplete. 2. Whether free-ranging predators exhibit the movement patterns predicted in the LFF hypothesis in response to known prey types and distributions, however, has not been determined. We tested this using vertical and horizontal movement data from electronic tagging of an apex predator, the great white shark Carcharodon carcharias, across widely differing habitats reflecting different prey types. 3. Individual white sharks exhibited movement patterns that predicted well the prey types expected under the LFF hypothesis. Shark movements were best approximated by Brownian motion when hunting near abundant, predictable sources of prey (e.g. seal colonies, fish aggregations), whereas movements approximating truncated Lévy flights were present when searching for sparsely distributed or potentially difficult-to-detect prey in oceanic or shelf environments, respectively. 4. That movement patterns approximated by truncated Lévy flights and Brownian behaviour were present in the predicted prey fields indicates search strategies adopted by white sharks appear to be the most efficient ones for encountering prey in the habitats where such patterns are observed. This suggests that C. carcharias appears capable of exhibiting search patterns that are approximated as optimal in response to encountered changes in prey type and abundance, and across diverse marine habitats, from the surf zone to the deep ocean. 5. Our results provide some support for the LFF hypothesis. However, it is possible that the observed Lévy patterns of white sharks may not arise from an adaptive behaviour but could be an emergent property arising from simple, straight-line movements between complex (e.g. fractal) distributions of prey. Experimental studies are needed in vertebrates to test for the presence of Lévy behaviour patterns in the absence of complex prey distributions. © 2011 The Authors. Journal of Animal Ecology © 2011 British Ecological Society.

Emergence of an optimal search strategy from a simple random walk

PubMed Central

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2013-01-01

In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths. PMID:23804445

Emergence of an optimal search strategy from a simple random walk.

PubMed

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2013-09-06

In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths.

Face adaptation does not improve performance on search or discrimination tasks

PubMed Central

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

2011-01-01

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. PMID:18318604

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.

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.

Parameter identification using a creeping-random-search algorithm

NASA Technical Reports Server (NTRS)

Parrish, R. V.

1971-01-01

A creeping-random-search algorithm is applied to different types of problems in the field of parameter identification. The studies are intended to demonstrate that a random-search algorithm can be applied successfully to these various problems, which often cannot be handled by conventional deterministic methods, and, also, to introduce methods that speed convergence to an extremal of the problem under investigation. Six two-parameter identification problems with analytic solutions are solved, and two application problems are discussed in some detail. Results of the study show that a modified version of the basic creeping-random-search algorithm chosen does speed convergence in comparison with the unmodified version. The results also show that the algorithm can successfully solve problems that contain limits on state or control variables, inequality constraints (both independent and dependent, and linear and nonlinear), or stochastic models.

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.

PREFACE: The random search problem: trends and perspectives The random search problem: trends and perspectives

NASA Astrophysics Data System (ADS)

da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.

2009-10-01

`I can't find my keys!' Who hasn't gone through this experience when leaving, in a hurry, to attend to some urgent matter? The keys could be in many different places. Unless one remembers where he or she has left the keys, the only solution is to look around, more or less randomly. Random searches are common because in many cases the locations of the specific targets are not known a priori. Indeed, such problems have been discussed in diverse contexts, attracting the interest of scientists from many fields, for example: the dynamical or stochastic search for a stable minimum in a complex energy landscape, relevant to systems such as glasses, protein (folding), and others; oil recovery from mature reservoirs; proteins searching for their specific target sites on DNA; animal foraging; survival at the edge of extinction due to low availability of energetic resources; automated searches of registers in high-capacity databases, search engine (e.g., `crawlers') that explore the internet; and even pizza delivery in a jammed traffic system of a medium-size town. In this way, the subject is interesting, challenging and has recently become an important scientific area of investigation. Although the applications are diverse, the underlying physical mechanisms are the same which will become clear in this special issue. Moreover, the inherent complexity of the problem, the abundance of ideas and methods found in this growing interdisciplinary field of research is studied in many areas of physics. In particular, the concepts and methods of statistical mechanics are particularly useful to the study of random searches. On one hand, it centres on how to find the global or local maxima of search efficiency functions with incomplete information. This is, of course, related to the long tradition in physics of using different conceptual and mathematical tools, such as variational methods, to extremize relevant quantities, e.g., energy, entropy and action. Such ideas and approaches are very important to solve computationally complex problems (e.g., protein folding), which involve optimizations in very high dimensional energy landscapes. On the other hand, random searches can also be studied from the perspective of diffusion and transport properties which is an important topic in condensed matter and statistical physics. For instance, the features of light scattered in a media, where the scatterers have a power-law distribution of sizes in many aspects, may resemble the patterns generated by a searcher performing Lévy walks. There are many questions related to random searches: how the searcher moves or should move, what are the patterns generated during the locomotion, how do the encounter rates depend on parameters of the search, etc. But perhaps, the most well known issue is how to optimize the search for specific target scenarios. The optimization can be in either continuous or discrete environments, when the information available is limited. The answer to this question determines specific strategies of movement that would maximize some properly defined search efficiency measure. The relevance of the question stems from the fact that the strategy-dynamics represents one of the most important factors that modulate the rate of encounters (e.g., the encounter rate between predator and prey). In the general context, strategy choices can be essential in determining the outcome and thus the success of a given search. For instance, realistic searches—and locomotion in general—require the expenditure of energy. Thus, inefficient search could deplete energy reserves (e.g., fat) and lead to rates of encounters below a minimum acceptable threshold (resulting in extinction of a species, for example). The framework of the random search `game' distinguishes between the two interacting players in a context of pursuit and chance. They are either a `searcher' (e.g., predator, protein, radar, `crawler') or a `target' (e.g., prey, DNA sequence, a missing aircraft, a given web site). Regarding the nature of the searching drive, in certain instances, it can be guided almost entirely by external cues, either by the cognitive (memory) or detective (olfaction, vision, etc) skills of the searcher. However, in many situations the movement is non-oriented, being in essence a stochastic process. Therefore, in such cases (and even when a small deterministic component in the locomotion exists) a random search effectively defines the final rates of encounters. Hence, one reason underlying the richness of the random search problem relates just to the `ignorance' of the locations of the randomly located targets. Contrary to conventional wisdom, the lack of complete information does not necessarily lead to greater complexity. As an illustrative example, let us consider the case of complete information. If the positions of all target sites are known in advance, then the question of what sequential order to visit the sites so to reduce the energy costs of locomotion itself becomes a rather challenging problem: the famous `travelling salesman' optimization query, belonging to the NP-complete class of problems. The ignorance of the target site locations, however, considerably modifies the problem and renders it not amenable to be treated by purely deterministic computational methods. In fact, as expected, the random search problem is not particularly suited to search algorithms that do not use elements of randomness. So, only a statistical approach to the search problem can adequately deal with the element of ignorance. In other words, the incomplete information renders the search under-determined, i.e., it is not possible to find the `best' solution to the problem because all the information is not given. Instead, one must guess and probabilistic or stochastic strategies become unavoidable. Also, the random search problem bears a relation to reaction-diffusion processes, because the search involves a diffusive aspect, movement, as well as a reactive component, e.g., eating, mating, etc. From the comments above, it is clear that the subject can be treated from the perspective of different fields and subfields of physics and mathematics: statistical mechanics, stochastic processes, Lévy walks and flights, complex systems, fractal geometry, and non-linear phenomena. Some important questions in random searches, especially in the case of discrete landscapes, are also associated with graph theory, random lattices, and complex networks. The aim of this special issue is to bring together, in a single publication, all or most of the relevant theoretical concepts-ideas together with discussions of recent findings that are important for understanding the main elements of random searches. In addition, we will address the types of problems which are characteristic of random searching. Thus, we sincerely hope that this collection of works will provide a good overview for anyone interested in this field. Finally, we should thank the editors and staff of Journal of Physics A: Mathematical and Theoretical for opining that random searches are an interesting topic of research deserving a topical publication. Furthermore, we are very grateful to Rebecca Gillan for helping us at all stages of the preparation and organization of this special issue. Finally, we would like to thank the contributing authors who share with the guest editors the enthusiasm and interest for this fascinating field of research.

The fast algorithm of spark in compressive sensing

NASA Astrophysics Data System (ADS)

Xie, Meihua; Yan, Fengxia

2017-01-01

Compressed Sensing (CS) is an advanced theory on signal sampling and reconstruction. In CS theory, the reconstruction condition of signal is an important theory problem, and spark is a good index to study this problem. But the computation of spark is NP hard. In this paper, we study the problem of computing spark. For some special matrixes, for example, the Gaussian random matrix and 0-1 random matrix, we obtain some conclusions. Furthermore, for Gaussian random matrix with fewer rows than columns, we prove that its spark equals to the number of its rows plus one with probability 1. For general matrix, two methods are given to compute its spark. One is the method of directly searching and the other is the method of dual-tree searching. By simulating 24 Gaussian random matrixes and 18 0-1 random matrixes, we tested the computation time of these two methods. Numerical results showed that the dual-tree searching method had higher efficiency than directly searching, especially for those matrixes which has as much as rows and columns.

Lévy-taxis: a novel search strategy for finding odor plumes in turbulent flow-dominated environments

NASA Astrophysics Data System (ADS)

Pasternak, Zohar; Bartumeus, Frederic; Grasso, Frank W.

2009-10-01

Locating chemical plumes in aquatic or terrestrial environments is important for many economic, conservation, security and health related human activities. The localization process is composed mainly of two phases: finding the chemical plume and then tracking it to its source. Plume tracking has been the subject of considerable study whereas plume finding has received little attention. We address here the latter issue, where the searching agent must find the plume in a region often many times larger than the plume and devoid of the relevant chemical cues. The probability of detecting the plume not only depends on the movements of the searching agent but also on the fluid mechanical regime, shaping plume intermittency in space and time; this is a basic, general problem when exploring for ephemeral resources (e.g. moving and/or concealing targets). Here we present a bio-inspired search strategy named Lévy-taxis that, under certain conditions, located odor plumes significantly faster and with a better success rate than other search strategies such as Lévy walks (LW), correlated random walks (CRW) and systematic zig-zag. These results are based on computer simulations which contain, for the first time ever, digitalized real-world water flow and chemical plume instead of their theoretical model approximations. Combining elements of LW and CRW, Lévy-taxis is particularly efficient for searching in flow-dominated environments: it adaptively controls the stochastic search pattern using environmental information (i.e. flow) that is available throughout the course of the search and shows correlation with the source providing the cues. This strategy finds natural application in real-world search missions, both by humans and autonomous robots, since it accomodates the stochastic nature of chemical mixing in turbulent flows. In addition, it may prove useful in the field of behavioral ecology, explaining and predicting the movement patterns of various animals searching for food or mates.

A weighted sampling algorithm for the design of RNA sequences with targeted secondary structure and nucleotide distribution.

PubMed

Reinharz, Vladimir; Ponty, Yann; Waldispühl, Jérôme

2013-07-01

The design of RNA sequences folding into predefined secondary structures is a milestone for many synthetic biology and gene therapy studies. Most of the current software uses similar local search strategies (i.e. a random seed is progressively adapted to acquire the desired folding properties) and more importantly do not allow the user to control explicitly the nucleotide distribution such as the GC-content in their sequences. However, the latter is an important criterion for large-scale applications as it could presumably be used to design sequences with better transcription rates and/or structural plasticity. In this article, we introduce IncaRNAtion, a novel algorithm to design RNA sequences folding into target secondary structures with a predefined nucleotide distribution. IncaRNAtion uses a global sampling approach and weighted sampling techniques. We show that our approach is fast (i.e. running time comparable or better than local search methods), seedless (we remove the bias of the seed in local search heuristics) and successfully generates high-quality sequences (i.e. thermodynamically stable) for any GC-content. To complete this study, we develop a hybrid method combining our global sampling approach with local search strategies. Remarkably, our glocal methodology overcomes both local and global approaches for sampling sequences with a specific GC-content and target structure. IncaRNAtion is available at csb.cs.mcgill.ca/incarnation/. Supplementary data are available at Bioinformatics online.

Tunnel-construction methods and foraging path of a fossorial herbivore, Geomys bursarius

USGS Publications Warehouse

Andersen, Douglas C.

1988-01-01

The fossorial rodent Geomys bursarius excavates tunnels to find and gain access to belowground plant parts. This is a study of how the foraging path of this animal, as denoted by feeding-tunnel systems constructed within experimental gardens, reflects both adaptive behavior and constraints associated with the fossorial lifestyle. The principal method of tunnel construction involves the end-to-end linking of short, linear segments whose directionalities are bimodal, but symmetrically distributed about 0°. The sequence of construction of left- and right-directed segments is random, and segments tend to be equal in length. The resulting tunnel advances, zigzag-fashion, along a single heading. This linearity, and the tendency for branches to be orthogonal to the originating tunnel, are consistent with the search path predicted for a "harvesting animal" (Pyke, 1978) from optimal-foraging theory. A suite of physical and physiological constraints on the burrowing process, however, may be responsible for this geometric pattern. That is, by excavating in the most energy-efficient manner, G. bursarius automatically creates the basic components to an optimal-search path. The general search pattern was not influenced by habitat quality (plant density). Branch origins are located more often than expected at plants, demonstrating area-restricted search, a tactic commonly noted in aboveground foragers. The potential trade-offs between construction methods that minimize energy cost and those that minimize vulnerability to predators are discussed.

A global sampling approach to designing and reengineering RNA secondary structures.

PubMed

Levin, Alex; Lis, Mieszko; Ponty, Yann; O'Donnell, Charles W; Devadas, Srinivas; Berger, Bonnie; Waldispühl, Jérôme

2012-11-01

The development of algorithms for designing artificial RNA sequences that fold into specific secondary structures has many potential biomedical and synthetic biology applications. To date, this problem remains computationally difficult, and current strategies to address it resort to heuristics and stochastic search techniques. The most popular methods consist of two steps: First a random seed sequence is generated; next, this seed is progressively modified (i.e. mutated) to adopt the desired folding properties. Although computationally inexpensive, this approach raises several questions such as (i) the influence of the seed; and (ii) the efficiency of single-path directed searches that may be affected by energy barriers in the mutational landscape. In this article, we present RNA-ensign, a novel paradigm for RNA design. Instead of taking a progressive adaptive walk driven by local search criteria, we use an efficient global sampling algorithm to examine large regions of the mutational landscape under structural and thermodynamical constraints until a solution is found. When considering the influence of the seeds and the target secondary structures, our results show that, compared to single-path directed searches, our approach is more robust, succeeds more often and generates more thermodynamically stable sequences. An ensemble approach to RNA design is thus well worth pursuing as a complement to existing approaches. RNA-ensign is available at http://csb.cs.mcgill.ca/RNAensign.

A global sampling approach to designing and reengineering RNA secondary structures

PubMed Central

Levin, Alex; Lis, Mieszko; Ponty, Yann; O’Donnell, Charles W.; Devadas, Srinivas; Berger, Bonnie; Waldispühl, Jérôme

2012-01-01

The development of algorithms for designing artificial RNA sequences that fold into specific secondary structures has many potential biomedical and synthetic biology applications. To date, this problem remains computationally difficult, and current strategies to address it resort to heuristics and stochastic search techniques. The most popular methods consist of two steps: First a random seed sequence is generated; next, this seed is progressively modified (i.e. mutated) to adopt the desired folding properties. Although computationally inexpensive, this approach raises several questions such as (i) the influence of the seed; and (ii) the efficiency of single-path directed searches that may be affected by energy barriers in the mutational landscape. In this article, we present RNA-ensign, a novel paradigm for RNA design. Instead of taking a progressive adaptive walk driven by local search criteria, we use an efficient global sampling algorithm to examine large regions of the mutational landscape under structural and thermodynamical constraints until a solution is found. When considering the influence of the seeds and the target secondary structures, our results show that, compared to single-path directed searches, our approach is more robust, succeeds more often and generates more thermodynamically stable sequences. An ensemble approach to RNA design is thus well worth pursuing as a complement to existing approaches. RNA-ensign is available at http://csb.cs.mcgill.ca/RNAensign. PMID:22941632

Search efficiency of biased migration towards stationary or moving targets in heterogeneously structured environments

NASA Astrophysics Data System (ADS)

Azimzade, Youness; Mashaghi, Alireza

2017-12-01

Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously structured environment where obstacles limit migration. An open generic question is whether random or directionally biased motions or a combination of both provide an optimal search efficiency and how that depends on the motility and density of targets and obstacles. To address this question, we develop a simple model that involves a random walker searching for its targets in a heterogeneous medium of bond percolation square lattice and used mean first passage time (〈T 〉 ) as an indication of average search time. Our analysis reveals a dual effect of directional bias on the minimum value of 〈T 〉 . For a homogeneous medium, directionality always decreases 〈T 〉 and a pure directional migration (a ballistic motion) serves as the optimized strategy, while for a heterogeneous environment, we find that the optimized strategy involves a combination of directed and random migrations. The relative contribution of these modes is determined by the density of obstacles and motility of targets. Existence of randomness and motility of targets add to the efficiency of search. Our study reveals generic and simple rules that govern search efficiency. Our findings might find application in a number of areas including immunology, cell biology, ecology, and robotics.

Stochastic modelling of animal movement.

PubMed

Smouse, Peter E; Focardi, Stefano; Moorcroft, Paul R; Kie, John G; Forester, James D; Morales, Juan M

2010-07-27

Modern animal movement modelling derives from two traditions. Lagrangian models, based on random walk behaviour, are useful for multi-step trajectories of single animals. Continuous Eulerian models describe expected behaviour, averaged over stochastic realizations, and are usefully applied to ensembles of individuals. We illustrate three modern research arenas. (i) Models of home-range formation describe the process of an animal 'settling down', accomplished by including one or more focal points that attract the animal's movements. (ii) Memory-based models are used to predict how accumulated experience translates into biased movement choices, employing reinforced random walk behaviour, with previous visitation increasing or decreasing the probability of repetition. (iii) Lévy movement involves a step-length distribution that is over-dispersed, relative to standard probability distributions, and adaptive in exploring new environments or searching for rare targets. Each of these modelling arenas implies more detail in the movement pattern than general models of movement can accommodate, but realistic empiric evaluation of their predictions requires dense locational data, both in time and space, only available with modern GPS telemetry.

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

Restricted random search method based on taboo search in the multiple minima problem

NASA Astrophysics Data System (ADS)

Hong, Seung Do; Jhon, Mu Shik

1997-03-01

The restricted random search method is proposed as a simple Monte Carlo sampling method to search minima fast in the multiple minima problem. This method is based on taboo search applied recently to continuous test functions. The concept of the taboo region instead of the taboo list is used and therefore the sampling of a region near an old configuration is restricted in this method. This method is applied to 2-dimensional test functions and the argon clusters. This method is found to be a practical and efficient method to search near-global configurations of test functions and the argon clusters.

3D statistical shape models incorporating 3D random forest regression voting for robust CT liver segmentation

NASA Astrophysics Data System (ADS)

Norajitra, Tobias; Meinzer, Hans-Peter; Maier-Hein, Klaus H.

2015-03-01

During image segmentation, 3D Statistical Shape Models (SSM) usually conduct a limited search for target landmarks within one-dimensional search profiles perpendicular to the model surface. In addition, landmark appearance is modeled only locally based on linear profiles and weak learners, altogether leading to segmentation errors from landmark ambiguities and limited search coverage. We present a new method for 3D SSM segmentation based on 3D Random Forest Regression Voting. For each surface landmark, a Random Regression Forest is trained that learns a 3D spatial displacement function between the according reference landmark and a set of surrounding sample points, based on an infinite set of non-local randomized 3D Haar-like features. Landmark search is then conducted omni-directionally within 3D search spaces, where voxelwise forest predictions on landmark position contribute to a common voting map which reflects the overall position estimate. Segmentation experiments were conducted on a set of 45 CT volumes of the human liver, of which 40 images were randomly chosen for training and 5 for testing. Without parameter optimization, using a simple candidate selection and a single resolution approach, excellent results were achieved, while faster convergence and better concavity segmentation were observed, altogether underlining the potential of our approach in terms of increased robustness from distinct landmark detection and from better search coverage.

Sample size determination for bibliographic retrieval studies

PubMed Central

Yao, Xiaomei; Wilczynski, Nancy L; Walter, Stephen D; Haynes, R Brian

2008-01-01

Background Research for developing search strategies to retrieve high-quality clinical journal articles from MEDLINE is expensive and time-consuming. The objective of this study was to determine the minimal number of high-quality articles in a journal subset that would need to be hand-searched to update or create new MEDLINE search strategies for treatment, diagnosis, and prognosis studies. Methods The desired width of the 95% confidence intervals (W) for the lowest sensitivity among existing search strategies was used to calculate the number of high-quality articles needed to reliably update search strategies. New search strategies were derived in journal subsets formed by 2 approaches: random sampling of journals and top journals (having the most high-quality articles). The new strategies were tested in both the original large journal database and in a low-yielding journal (having few high-quality articles) subset. Results For treatment studies, if W was 10% or less for the lowest sensitivity among our existing search strategies, a subset of 15 randomly selected journals or 2 top journals were adequate for updating search strategies, based on each approach having at least 99 high-quality articles. The new strategies derived in 15 randomly selected journals or 2 top journals performed well in the original large journal database. Nevertheless, the new search strategies developed using the random sampling approach performed better than those developed using the top journal approach in a low-yielding journal subset. For studies of diagnosis and prognosis, no journal subset had enough high-quality articles to achieve the expected W (10%). Conclusion The approach of randomly sampling a small subset of journals that includes sufficient high-quality articles is an efficient way to update or create search strategies for high-quality articles on therapy in MEDLINE. The concentrations of diagnosis and prognosis articles are too low for this approach. PMID:18823538

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…

Adaptive cockroach swarm algorithm

NASA Astrophysics Data System (ADS)

Obagbuwa, Ibidun C.; Abidoye, Ademola P.

2017-07-01

An adaptive cockroach swarm optimization (ACSO) algorithm is proposed in this paper to strengthen the existing cockroach swarm optimization (CSO) algorithm. The ruthless component of CSO algorithm is modified by the employment of blend crossover predator-prey evolution method which helps algorithm prevent any possible population collapse, maintain population diversity and create adaptive search in each iteration. The performance of the proposed algorithm on 16 global optimization benchmark function problems was evaluated and compared with the existing CSO, cuckoo search, differential evolution, particle swarm optimization and artificial bee colony algorithms.

Adaptive coupling optimized spiking coherence and synchronization in Newman-Watts neuronal networks

NASA Astrophysics Data System (ADS)

Gong, Yubing; Xu, Bo; Wu, Ya'nan

2013-09-01

In this paper, we have numerically studied the effect of adaptive coupling on the temporal coherence and synchronization of spiking activity in Newman-Watts Hodgkin-Huxley neuronal networks. It is found that random shortcuts can enhance the spiking synchronization more rapidly when the increment speed of adaptive coupling is increased and can optimize the temporal coherence of spikes only when the increment speed of adaptive coupling is appropriate. It is also found that adaptive coupling strength can enhance the synchronization of spikes and can optimize the temporal coherence of spikes when random shortcuts are appropriate. These results show that adaptive coupling has a big influence on random shortcuts related spiking activity and can enhance and optimize the temporal coherence and synchronization of spiking activity of the network. These findings can help better understand the roles of adaptive coupling for improving the information processing and transmission in neural systems.

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…

Center for Adaptive Optics | Home

Science.gov Websites

Center for Adaptive Optics A University of California Science and Technology Center home Directions to The Center for Adaptive Optics Building Directions to the Center for Adaptive Optics Building * Seaway Inn * West Cliff Inn Last Modified: Apr 3, 2012 Center for Adaptive Optics | Search | The Center

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

NASA Technical Reports Server (NTRS)

Sen, Syamal K.; AliShaykhian, Gholam

2010-01-01

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Population differentiation in Pacific salmon: local adaptation, genetic drift, or the environment?

USGS Publications Warehouse

Adkison, Milo D.

1995-01-01

Morphological, behavioral, and life-history differences between Pacific salmon (Oncorhynchus spp.) populations are commonly thought to reflect local adaptation, and it is likewise common to assume that salmon populations separated by small distances are locally adapted. Two alternatives to local adaptation exist: random genetic differentiation owing to genetic drift and founder events, and genetic homogeneity among populations, in which differences reflect differential trait expression in differing environments. Population genetics theory and simulations suggest that both alternatives are possible. With selectively neutral alleles, genetic drift can result in random differentiation despite many strays per generation. Even weak selection can prevent genetic drift in stable populations; however, founder effects can result in random differentiation despite selective pressures. Overlapping generations reduce the potential for random differentiation. Genetic homogeneity can occur despite differences in selective regimes when straying rates are high. In sum, localized differences in selection should not always result in local adaptation. Local adaptation is favored when population sizes are large and stable, selection is consistent over large areas, selective diffeentials are large, and straying rates are neither too high nor too low. Consideration of alternatives to local adaptation would improve both biological research and salmon conservation efforts.

Sequential Multiple Assignment Randomized Trial (SMART) with Adaptive Randomization for Quality Improvement in Depression Treatment Program

PubMed Central

Chakraborty, Bibhas; Davidson, Karina W.

2015-01-01

Summary Implementation study is an important tool for deploying state-of-the-art treatments from clinical efficacy studies into a treatment program, with the dual goals of learning about effectiveness of the treatments and improving the quality of care for patients enrolled into the program. In this article, we deal with the design of a treatment program of dynamic treatment regimens (DTRs) for patients with depression post acute coronary syndrome. We introduce a novel adaptive randomization scheme for a sequential multiple assignment randomized trial of DTRs. Our approach adapts the randomization probabilities to favor treatment sequences having comparatively superior Q-functions used in Q-learning. The proposed approach addresses three main concerns of an implementation study: it allows incorporation of historical data or opinions, it includes randomization for learning purposes, and it aims to improve care via adaptation throughout the program. We demonstrate how to apply our method to design a depression treatment program using data from a previous study. By simulation, we illustrate that the inputs from historical data are important for the program performance measured by the expected outcomes of the enrollees, but also show that the adaptive randomization scheme is able to compensate poorly specified historical inputs by improving patient outcomes within a reasonable horizon. The simulation results also confirm that the proposed design allows efficient learning of the treatments by alleviating the curse of dimensionality. PMID:25354029

Genetic evolutionary taboo search for optimal marker placement in infrared patient setup

NASA Astrophysics Data System (ADS)

Riboldi, M.; Baroni, G.; Spadea, M. F.; Tagaste, B.; Garibaldi, C.; Cambria, R.; Orecchia, R.; Pedotti, A.

2007-09-01

In infrared patient setup adequate selection of the external fiducial configuration is required for compensating inner target displacements (target registration error, TRE). Genetic algorithms (GA) and taboo search (TS) were applied in a newly designed approach to optimal marker placement: the genetic evolutionary taboo search (GETS) algorithm. In the GETS paradigm, multiple solutions are simultaneously tested in a stochastic evolutionary scheme, where taboo-based decision making and adaptive memory guide the optimization process. The GETS algorithm was tested on a group of ten prostate patients, to be compared to standard optimization and to randomly selected configurations. The changes in the optimal marker configuration, when TRE is minimized for OARs, were specifically examined. Optimal GETS configurations ensured a 26.5% mean decrease in the TRE value, versus 19.4% for conventional quasi-Newton optimization. Common features in GETS marker configurations were highlighted in the dataset of ten patients, even when multiple runs of the stochastic algorithm were performed. Including OARs in TRE minimization did not considerably affect the spatial distribution of GETS marker configurations. In conclusion, the GETS algorithm proved to be highly effective in solving the optimal marker placement problem. Further work is needed to embed site-specific deformation models in the optimization process.

Enhanced Recovery after Emergency Surgery: A Systematic Review.

PubMed

Paduraru, Mihai; Ponchietti, Luca; Casas, Isidro Martinez; Svenningsen, Peter; Zago, Mauro

2017-04-01

To evaluate the current scientific evidence for the applicability, safety and effectiveness of pathways of enhanced recovery after emergency surgery (ERAS). We undertook a search using PubMed and Cochrane databases for ERAS protocols in emergency cases. The search generated 65 titles; after eliminating the papers not meeting search criteria, we selected 4 cohort studies and 1 randomized clinical trial (RCT). Data extracted for analysis consisted of: patient age, type of surgery performed, ERAS elements implemented, surgical outcomes in terms of postoperative complications, mortality, length of stay (LOS) and readmission rate. The number of ERAS items applied was good, ranging from 11 to 18 of the 20 recommended by the ERAS Society. The implementation resulted in fewer postoperative complications. LOS for ES patients was shorter when compared to conventional care. Mortality, specifically reported in three studies, was equal or lower with ERAS. Readmission rates varied widely and were generally higher for the intervention group but without statistical significance. The studies reviewed agreed that ERAS in emergency surgery (ES) was feasible and safe with generally better outcomes. Lower compliance with some of the ERAS items shows the need for the protocol to be adapted to ES patients. More evidence is clearly required as to what can improve outcomes and how this can be formulated into an effective care pathway for the heterogeneous ES patient.

Spatial Query for Planetary Data

NASA Technical Reports Server (NTRS)

Shams, Khawaja S.; Crockett, Thomas M.; Powell, Mark W.; Joswig, Joseph C.; Fox, Jason M.

2011-01-01

Science investigators need to quickly and effectively assess past observations of specific locations on a planetary surface. This innovation involves a location-based search technology that was adapted and applied to planetary science data to support a spatial query capability for mission operations software. High-performance location-based searching requires the use of spatial data structures for database organization. Spatial data structures are designed to organize datasets based on their coordinates in a way that is optimized for location-based retrieval. The particular spatial data structure that was adapted for planetary data search is the R+ tree.

The influence of an uncertain force environment on reshaping trial-to-trial motor variability.

PubMed

Izawa, Jun; Yoshioka, Toshinori; Osu, Rieko

2014-09-10

Motor memory is updated to generate ideal movements in a novel environment. When the environment changes every trial randomly, how does the brain incorporate this uncertainty into motor memory? To investigate how the brain adapts to an uncertain environment, we considered a reach adaptation protocol where individuals practiced moving in a force field where a noise was injected. After they had adapted, we measured the trial-to-trial variability in the temporal profiles of the produced hand force. We found that the motor variability was significantly magnified by the adaptation to the random force field. Temporal profiles of the motor variance were significantly dissociable between two different types of random force fields experienced. A model-based analysis suggests that the variability is generated by noise in the gains of the internal model. It further suggests that the trial-to-trial motor variability magnified by the adaptation in a random force field is generated by the uncertainty of the internal model formed in the brain as a result of the adaptation.

G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

NASA Technical Reports Server (NTRS)

Rogers, David

1991-01-01

G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

The efficacy of cognitive behavioral therapy for Chinese people: A meta-analysis.

PubMed

Ng, Ting Kin; Wong, Daniel Fu Keung

2018-07-01

Over the past decade, cognitive behavioral therapy has been applied to an increasingly wider range of disorders and problems in Chinese societies. However, no meta-analysis has been conducted to synthesize the studies on cognitive behavioral therapy for Chinese clients. The purpose of this meta-analytic study was to examine the overall efficacy of cognitive behavioral therapy for Chinese people. A literature search was conducted using electronic databases, including Web of Science, PsycINFO and PubMed. Pooled mean effect sizes were calculated using the random-effects model. The literature search identified 55 studies with 6763 Chinese participants. The overall short-term effect of cognitive behavioral therapy on the primary outcome was medium in size. Effect sizes were medium for anxiety, depression/well-being and caregiving stress and small for psychotic symptoms and addictive behaviors. The effects of cognitive behavioral therapy on process variables, dysfunctional thoughts and coping, were in the small range. The overall longer-term effect of cognitive behavioral therapy on the primary outcome was medium in size. Moderator analyses showed that the short-term effect was stronger for culturally adapted cognitive behavioral therapy than for unadapted cognitive behavioral therapy. Type of primary outcome, type of control group, recruitment method, study design, the format of delivery and region were found to moderate the efficacy of cognitive behavioral therapy. The findings of this study provide evidence for the overall efficacy of cognitive behavioral therapy for Chinese people and the benefit of cultural adaptation of cognitive behavioral therapy to Chinese culture.

An efficient hybrid approach for multiobjective optimization of water distribution systems

NASA Astrophysics Data System (ADS)

Zheng, Feifei; Simpson, Angus R.; Zecchin, Aaron C.

2014-05-01

An efficient hybrid approach for the design of water distribution systems (WDSs) with multiple objectives is described in this paper. The objectives are the minimization of the network cost and maximization of the network resilience. A self-adaptive multiobjective differential evolution (SAMODE) algorithm has been developed, in which control parameters are automatically adapted by means of evolution instead of the presetting of fine-tuned parameter values. In the proposed method, a graph algorithm is first used to decompose a looped WDS into a shortest-distance tree (T) or forest, and chords (Ω). The original two-objective optimization problem is then approximated by a series of single-objective optimization problems of the T to be solved by nonlinear programming (NLP), thereby providing an approximate Pareto optimal front for the original whole network. Finally, the solutions at the approximate front are used to seed the SAMODE algorithm to find an improved front for the original entire network. The proposed approach is compared with two other conventional full-search optimization methods (the SAMODE algorithm and the NSGA-II) that seed the initial population with purely random solutions based on three case studies: a benchmark network and two real-world networks with multiple demand loading cases. Results show that (i) the proposed NLP-SAMODE method consistently generates better-quality Pareto fronts than the full-search methods with significantly improved efficiency; and (ii) the proposed SAMODE algorithm (no parameter tuning) exhibits better performance than the NSGA-II with calibrated parameter values in efficiently offering optimal fronts.

DFT Performance Prediction in FFTW

NASA Astrophysics Data System (ADS)

Gu, Liang; Li, Xiaoming

Fastest Fourier Transform in the West (FFTW) is an adaptive FFT library that generates highly efficient Discrete Fourier Transform (DFT) implementations. It is one of the fastest FFT libraries available and it outperforms many adaptive or hand-tuned DFT libraries. Its success largely relies on the huge search space spanned by several FFT algorithms and a set of compiler generated C code (called codelets) for small size DFTs. FFTW empirically finds the best algorithm by measuring the performance of different algorithm combinations. Although the empirical search works very well for FFTW, the search process does not explain why the best plan found performs best, and the search overhead grows polynomially as the DFT size increases. The opposite of empirical search is model-driven optimization. However, it is widely believed that model-driven optimization is inferior to empirical search and is particularly powerless to solve problems as complex as the optimization of DFT.

A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds

NASA Technical Reports Server (NTRS)

Lewis, Robert Michael; Torczon, Virginia

1998-01-01

We give a pattern search adaptation of an augmented Lagrangian method due to Conn, Gould, and Toint. The algorithm proceeds by successive bound constrained minimization of an augmented Lagrangian. In the pattern search adaptation we solve this subproblem approximately using a bound constrained pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of this subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. So far as we know, this is the first provably convergent direct search method for general nonlinear programming.

Security under Uncertainty: Adaptive Attackers Are More Challenging to Human Defenders than Random Attackers

PubMed Central

Moisan, Frédéric; Gonzalez, Cleotilde

2017-01-01

Game Theory is a common approach used to understand attacker and defender motives, strategies, and allocation of limited security resources. For example, many defense algorithms are based on game-theoretic solutions that conclude that randomization of defense actions assures unpredictability, creating difficulties for a human attacker. However, many game-theoretic solutions often rely on idealized assumptions of decision making that underplay the role of human cognition and information uncertainty. The consequence is that we know little about how effective these algorithms are against human players. Using a simplified security game, we study the type of attack strategy and the uncertainty about an attacker's strategy in a laboratory experiment where participants play the role of defenders against a simulated attacker. Our goal is to compare a human defender's behavior in three levels of uncertainty (Information Level: Certain, Risky, Uncertain) and three types of attacker's strategy (Attacker's strategy: Minimax, Random, Adaptive) in a between-subjects experimental design. Best defense performance is achieved when defenders play against a minimax and a random attack strategy compared to an adaptive strategy. Furthermore, when payoffs are certain, defenders are as efficient against random attack strategy as they are against an adaptive strategy, but when payoffs are uncertain, defenders have most difficulties defending against an adaptive attacker compared to a random attacker. We conclude that given conditions of uncertainty in many security problems, defense algorithms would be more efficient if they are adaptive to the attacker actions, taking advantage of the attacker's human inefficiencies. PMID:28690557

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…

Image Re-Ranking Based on Topic Diversity.

PubMed

Qian, Xueming; Lu, Dan; Wang, Yaxiong; Zhu, Li; Tang, Yuan Yan; Wang, Meng

2017-08-01

Social media sharing Websites allow users to annotate images with free tags, which significantly contribute to the development of the web image retrieval. Tag-based image search is an important method to find images shared by users in social networks. However, how to make the top ranked result relevant and with diversity is challenging. In this paper, we propose a topic diverse ranking approach for tag-based image retrieval with the consideration of promoting the topic coverage performance. First, we construct a tag graph based on the similarity between each tag. Then, the community detection method is conducted to mine the topic community of each tag. After that, inter-community and intra-community ranking are introduced to obtain the final retrieved results. In the inter-community ranking process, an adaptive random walk model is employed to rank the community based on the multi-information of each topic community. Besides, we build an inverted index structure for images to accelerate the searching process. Experimental results on Flickr data set and NUS-Wide data sets show the effectiveness of the proposed approach.

Application of Multi-Objective Human Learning Optimization Method to Solve AC/DC Multi-Objective Optimal Power Flow Problem

NASA Astrophysics Data System (ADS)

Cao, Jia; Yan, Zheng; He, Guangyu

2016-06-01

This paper introduces an efficient algorithm, multi-objective human learning optimization method (MOHLO), to solve AC/DC multi-objective optimal power flow problem (MOPF). Firstly, the model of AC/DC MOPF including wind farms is constructed, where includes three objective functions, operating cost, power loss, and pollutant emission. Combining the non-dominated sorting technique and the crowding distance index, the MOHLO method can be derived, which involves individual learning operator, social learning operator, random exploration learning operator and adaptive strategies. Both the proposed MOHLO method and non-dominated sorting genetic algorithm II (NSGAII) are tested on an improved IEEE 30-bus AC/DC hybrid system. Simulation results show that MOHLO method has excellent search efficiency and the powerful ability of searching optimal. Above all, MOHLO method can obtain more complete pareto front than that by NSGAII method. However, how to choose the optimal solution from pareto front depends mainly on the decision makers who stand from the economic point of view or from the energy saving and emission reduction point of view.

Reducing the width of confidence intervals for the difference between two population means by inverting adaptive tests.

PubMed

O'Gorman, Thomas W

2018-05-01

In the last decade, it has been shown that an adaptive testing method could be used, along with the Robbins-Monro search procedure, to obtain confidence intervals that are often narrower than traditional confidence intervals. However, these confidence interval limits require a great deal of computation and some familiarity with stochastic search methods. We propose a method for estimating the limits of confidence intervals that uses only a few tests of significance. We compare these limits to those obtained by a lengthy Robbins-Monro stochastic search and find that the proposed method is nearly as accurate as the Robbins-Monro search. Adaptive confidence intervals that are produced by the proposed method are often narrower than traditional confidence intervals when the distributions are long-tailed, skewed, or bimodal. Moreover, the proposed method of estimating confidence interval limits is easy to understand, because it is based solely on the p-values from a few tests of significance.

Intermediate view reconstruction using adaptive disparity search algorithm for real-time 3D processing

NASA Astrophysics Data System (ADS)

Bae, Kyung-hoon; Park, Changhan; Kim, Eun-soo

2008-03-01

In this paper, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (ASDA) is for realtime 3-dimensional (3D) processing proposed. The proposed algorithm can reduce processing time of disparity estimation by selecting adaptive disparity search range. Also, the proposed algorithm can increase the quality of the 3D imaging. That is, by adaptively predicting the mutual correlation between stereo images pair using the proposed algorithm, the bandwidth of stereo input images pair can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and disparity vectors. From some experiments, stereo sequences of 'Pot Plant' and 'IVO', it is shown that the proposed algorithm improves the PSNRs of a reconstructed image to about 4.8 dB by comparing with that of conventional algorithms, and reduces the Synthesizing time of a reconstructed image to about 7.02 sec by comparing with that of conventional algorithms.

Expedite random structure searching using objects from Wyckoff positions

NASA Astrophysics Data System (ADS)

Wang, Shu-Wei; Hsing, Cheng-Rong; Wei, Ching-Ming

2018-02-01

Random structure searching has been proved to be a powerful approach to search and find the global minimum and the metastable structures. A true random sampling is in principle needed yet it would be highly time-consuming and/or practically impossible to find the global minimum for the complicated systems in their high-dimensional configuration space. Thus the implementations of reasonable constraints, such as adopting system symmetries to reduce the independent dimension in structural space and/or imposing chemical information to reach and relax into low-energy regions, are the most essential issues in the approach. In this paper, we propose the concept of "object" which is either an atom or composed of a set of atoms (such as molecules or carbonates) carrying a symmetry defined by one of the Wyckoff positions of space group and through this process it allows the searching of global minimum for a complicated system to be confined in a greatly reduced structural space and becomes accessible in practice. We examined several representative materials, including Cd3As2 crystal, solid methanol, high-pressure carbonates (FeCO3), and Si(111)-7 × 7 reconstructed surface, to demonstrate the power and the advantages of using "object" concept in random structure searching.

Fitness landscapes, heuristics and technological paradigms: A critique on random search models in evolutionary economics

NASA Astrophysics Data System (ADS)

Frenken, Koen

2001-06-01

The biological evolution of complex organisms, in which the functioning of genes is interdependent, has been analyzed as "hill-climbing" on NK fitness landscapes through random mutation and natural selection. In evolutionary economics, NK fitness landscapes have been used to simulate the evolution of complex technological systems containing elements that are interdependent in their functioning. In these models, economic agents randomly search for new technological design by trial-and-error and run the risk of ending up in sub-optimal solutions due to interdependencies between the elements in a complex system. These models of random search are legitimate for reasons of modeling simplicity, but remain limited as these models ignore the fact that agents can apply heuristics. A specific heuristic is one that sequentially optimises functions according to their ranking by users of the system. To model this heuristic, a generalized NK-model is developed. In this model, core elements that influence many functions can be distinguished from peripheral elements that affect few functions. The concept of paradigmatic search can then be analytically defined as search that leaves core elements in tact while concentrating on improving functions by mutation of peripheral elements.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jiang, Hao; Materials Science Program, University of Wisconsin, Madison, Wisconsin 53706; Stewart, Derek A., E-mail: derek.stewart@hgst.com

Metal oxide resistive memory devices based on Ta{sub 2}O{sub 5} have demonstrated high switching speed, long endurance, and low set voltage. However, the physical origin of this improved performance is still unclear. Ta{sub 2}O{sub 5} is an important archetype of a class of materials that possess an adaptive crystal structure that can respond easily to the presence of defects. Using first principles nudged elastic band calculations, we show that this adaptive crystal structure leads to low energy barriers for in-plane diffusion of oxygen vacancies in λ phase Ta{sub 2}O{sub 5}. Identified diffusion paths are associated with collective motion of neighboringmore » atoms. The overall vacancy diffusion is anisotropic with higher diffusion barriers found for oxygen vacancy movement between Ta-O planes. Coupled with the fact that oxygen vacancy formation energy in Ta{sub 2}O{sub 5} is relatively small, our calculated low diffusion barriers can help explain the low set voltage in Ta{sub 2}O{sub 5} based resistive memory devices. Our work shows that other oxides with adaptive crystal structures could serve as potential candidates for resistive random access memory devices. We also discuss some general characteristics for ideal resistive RAM oxides that could be used in future computational material searches.« less

Efficient search of multiple types of targets

NASA Astrophysics Data System (ADS)

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

2015-12-01

Random searches often take place in fragmented landscapes. Also, in many instances like animal foraging, significant benefits to the searcher arise from visits to a large diversity of patches with a well-balanced distribution of targets found. Up to date, such aspects have been widely ignored in the usual single-objective analysis of search efficiency, in which one seeks to maximize just the number of targets found per distance traversed. Here we address the problem of determining the best strategies for the random search when these multiple-objective factors play a key role in the process. We consider a figure of merit (efficiency function), which properly "scores" the mentioned tasks. By considering random walk searchers with a power-law asymptotic Lévy distribution of step lengths, p (ℓ ) ˜ℓ-μ , with 1 <μ ≤3 , we show that the standard optimal strategy with μopt≈2 no longer holds universally. Instead, optimal searches with enhanced superdiffusivity emerge, including values as low as μopt≈1.3 (i.e., tending to the ballistic limit). For the general theory of random search optimization, our findings emphasize the necessity to correctly characterize the multitude of aims in any concrete metric to compare among possible candidates to efficient strategies. In the context of animal foraging, our results might explain some empirical data pointing to stronger superdiffusion (μ <2 ) in the search behavior of different animal species, conceivably associated to multiple goals to be achieved in fragmented landscapes.

Mental health impact of social capital interventions: a systematic review.

PubMed

Flores, Elaine C; Fuhr, Daniela C; Bayer, Angela M; Lescano, Andres G; Thorogood, Nicki; Simms, Victoria

2018-02-01

Mental disorders are a major contributor to the global burden of disease and disability, and can be extremely costly at both individual and community level. Social capital, (SC) defined as an individual's social relationships and participation in community networks, may lower the risk of mental disorders while increasing resilience capacity, adaptation and recovery. SC interventions may be a cost-effective way of preventing and ameliorating these conditions. However, the impact of these SC interventions on mental health still needs research. We conducted a systematic review of SC-based interventions to investigate their effect on mental health outcomes from controlled, quasi-experimental studies or pilot trials. We searched twelve academic databases, three clinical trials registries, hand-searched references and contacted field experts. Studies' quality was assessed with the Cochrane Risk of Bias tools for randomized and non-randomized studies. Seven studies were included in the review, published between 2006 and 2016. There was substantial heterogeneity in the definitions of both SC and mental disorders among the studies, preventing us from calculating pooled effect sizes. The interventions included community engagement and educative programs, cognitive processing therapy and sociotherapy for trauma survivors, and neighbourhood projects. There are paucity of SC interventions investigating the effect on mental health outcomes. This study showed that both SC scores and mental health outcomes improved over time but there was little evidence of benefit compared to control groups in the long term. Further high-quality trials are needed, especially among adverse populations to assess sustainability of effect.

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.

A Bayesian comparative effectiveness trial in action: developing a platform for multisite study adaptive randomization.

PubMed

Brown, Alexandra R; Gajewski, Byron J; Aaronson, Lauren S; Mudaranthakam, Dinesh Pal; Hunt, Suzanne L; Berry, Scott M; Quintana, Melanie; Pasnoor, Mamatha; Dimachkie, Mazen M; Jawdat, Omar; Herbelin, Laura; Barohn, Richard J

2016-08-31

In the last few decades, the number of trials using Bayesian methods has grown rapidly. Publications prior to 1990 included only three clinical trials that used Bayesian methods, but that number quickly jumped to 19 in the 1990s and to 99 from 2000 to 2012. While this literature provides many examples of Bayesian Adaptive Designs (BAD), none of the papers that are available walks the reader through the detailed process of conducting a BAD. This paper fills that gap by describing the BAD process used for one comparative effectiveness trial (Patient Assisted Intervention for Neuropathy: Comparison of Treatment in Real Life Situations) that can be generalized for use by others. A BAD was chosen with efficiency in mind. Response-adaptive randomization allows the potential for substantially smaller sample sizes, and can provide faster conclusions about which treatment or treatments are most effective. An Internet-based electronic data capture tool, which features a randomization module, facilitated data capture across study sites and an in-house computation software program was developed to implement the response-adaptive randomization. A process for adapting randomization with minimal interruption to study sites was developed. A new randomization table can be generated quickly and can be seamlessly integrated in the data capture tool with minimal interruption to study sites. This manuscript is the first to detail the technical process used to evaluate a multisite comparative effectiveness trial using adaptive randomization. An important opportunity for the application of Bayesian trials is in comparative effectiveness trials. The specific case study presented in this paper can be used as a model for conducting future clinical trials using a combination of statistical software and a web-based application. ClinicalTrials.gov Identifier: NCT02260388 , registered on 6 October 2014.

A Balanced Approach to Adaptive Probability Density Estimation.

PubMed

Kovacs, Julio A; Helmick, Cailee; Wriggers, Willy

2017-01-01

Our development of a Fast (Mutual) Information Matching (FIM) of molecular dynamics time series data led us to the general problem of how to accurately estimate the probability density function of a random variable, especially in cases of very uneven samples. Here, we propose a novel Balanced Adaptive Density Estimation (BADE) method that effectively optimizes the amount of smoothing at each point. To do this, BADE relies on an efficient nearest-neighbor search which results in good scaling for large data sizes. Our tests on simulated data show that BADE exhibits equal or better accuracy than existing methods, and visual tests on univariate and bivariate experimental data show that the results are also aesthetically pleasing. This is due in part to the use of a visual criterion for setting the smoothing level of the density estimate. Our results suggest that BADE offers an attractive new take on the fundamental density estimation problem in statistics. We have applied it on molecular dynamics simulations of membrane pore formation. We also expect BADE to be generally useful for low-dimensional applications in other statistical application domains such as bioinformatics, signal processing and econometrics.

Enhancing access to reports of randomized trials published world-wide – the contribution of EMBASE records to the Cochrane Central Register of Controlled Trials (CENTRAL) in The Cochrane Library

PubMed Central

Lefebvre, Carol; Eisinga, Anne; McDonald, Steve; Paul, Nina

2008-01-01

Background Randomized trials are essential in assessing the effects of healthcare interventions and are a key component in systematic reviews of effectiveness. Searching for reports of randomized trials in databases is problematic due to the absence of appropriate indexing terms until the 1990s and inconsistent application of these indexing terms thereafter. Objectives The objectives of this study are to devise a search strategy for identifying reports of randomized trials in EMBASE which are not already indexed as trials in MEDLINE and to make these reports easily accessible by including them in the Cochrane Central Register of Controlled Trials (CENTRAL) in The Cochrane Library, with the permission of Elsevier, the publishers of EMBASE. Methods A highly sensitive search strategy was designed for EMBASE based on free-text and thesaurus terms which occurred frequently in the titles, abstracts, EMTREE terms (or some combination of these) of reports of trials indexed in EMBASE. This search strategy was run against EMBASE from 1980 to 2005 (1974 to 2005 for four of the terms) and records retrieved by the search, which were not already indexed as randomized trials in MEDLINE, were downloaded from EMBASE, printed and read. An analysis of the language of publication was conducted for the reports of trials published in 2005 (the most recent year completed at the time of this study). Results Twenty-two search terms were used (including nine which were later rejected due to poor cumulative precision). More than a third of a million records were downloaded and scanned and approximately 80,000 reports of trials were identified which were not already indexed as randomized trials in MEDLINE. These are now easily identifiable in CENTRAL, in The Cochrane Library. Cumulative sensitivity ranged from 0.1% to 60% and cumulative precision ranged from 8% to 61%. The truncated term 'random$' identified 60% of the total number of reports of trials but only 35% of the more than 130,000 records retrieved by this term were reports of trials. The language analysis for the sample year 2005 indicated that of the 18,427 reports indexed as randomized trials in MEDLINE, 959 (5%) were in languages other than English. The EMBASE search identified an additional 658 reports in languages other than English, of which the highest number were in Chinese (320). Conclusion The results of the search to date have greatly increased access to reports of trials in EMBASE, especially in some languages other than English. The search strategy used was subjectively derived from a small 'gold standard' set of test records and was not validated in an independent test set. We intend to design an objectively-derived validated search strategy using logistic regression based on the frequency of occurrence of terms in the approximately 80,000 reports of randomized trials identified compared with the frequency of these terms across the entire EMBASE database. PMID:18826567

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 the naive construction methods and the state-of-the-art hashing algorithms.

SPARK: Adapting Keyword Query to Semantic Search

NASA Astrophysics Data System (ADS)

Zhou, Qi; Wang, Chong; Xiong, Miao; Wang, Haofen; Yu, Yong

Semantic search promises to provide more accurate result than present-day keyword search. However, progress with semantic search has been delayed due to the complexity of its query languages. In this paper, we explore a novel approach of adapting keywords to querying the semantic web: the approach automatically translates keyword queries into formal logic queries so that end users can use familiar keywords to perform semantic search. A prototype system named 'SPARK' has been implemented in light of this approach. Given a keyword query, SPARK outputs a ranked list of SPARQL queries as the translation result. The translation in SPARK consists of three major steps: term mapping, query graph construction and query ranking. Specifically, a probabilistic query ranking model is proposed to select the most likely SPARQL query. In the experiment, SPARK achieved an encouraging translation result.

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.

Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm

NASA Astrophysics Data System (ADS)

Ramazani, Saba; Jackson, Delvin L.; Selmic, Rastko R.

2013-05-01

In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.

Sequential causal inference: Application to randomized trials of adaptive treatment strategies

PubMed Central

Dawson, Ree; Lavori, Philip W.

2009-01-01

SUMMARY Clinical trials that randomize subjects to decision algorithms, which adapt treatments over time according to individual response, have gained considerable interest as investigators seek designs that directly inform clinical decision making. We consider designs in which subjects are randomized sequentially at decision points, among adaptive treatment options under evaluation. We present a sequential method to estimate the comparative effects of the randomized adaptive treatments, which are formalized as adaptive treatment strategies. Our causal estimators are derived using Bayesian predictive inference. We use analytical and empirical calculations to compare the predictive estimators to (i) the ‘standard’ approach that allocates the sequentially obtained data to separate strategy-specific groups as would arise from randomizing subjects at baseline; (ii) the semi-parametric approach of marginal mean models that, under appropriate experimental conditions, provides the same sequential estimator of causal differences as the proposed approach. Simulation studies demonstrate that sequential causal inference offers substantial efficiency gains over the standard approach to comparing treatments, because the predictive estimators can take advantage of the monotone structure of shared data among adaptive strategies. We further demonstrate that the semi-parametric asymptotic variances, which are marginal ‘one-step’ estimators, may exhibit significant bias, in contrast to the predictive variances. We show that the conditions under which the sequential method is attractive relative to the other two approaches are those most likely to occur in real studies. PMID:17914714

Do Bayesian adaptive trials offer advantages for comparative effectiveness research? Protocol for the RE-ADAPT study

PubMed Central

Luce, Bryan R; Broglio, Kristine R; Ishak, K Jack; Mullins, C Daniel; Vanness, David J; Fleurence, Rachael; Saunders, Elijah; Davis, Barry R

2013-01-01

Background Randomized clinical trials, particularly for comparative effectiveness research (CER), are frequently criticized for being overly restrictive or untimely for health-care decision making. Purpose Our prospectively designed REsearch in ADAptive methods for Pragmatic Trials (RE-ADAPT) study is a ‘proof of concept’ to stimulate investment in Bayesian adaptive designs for future CER trials. Methods We will assess whether Bayesian adaptive designs offer potential efficiencies in CER by simulating a re-execution of the Antihypertensive and Lipid Lowering Treatment to Prevent Heart Attack Trial (ALLHAT) study using actual data from ALLHAT. Results We prospectively define seven alternate designs consisting of various combinations of arm dropping, adaptive randomization, and early stopping and describe how these designs will be compared to the original ALLHAT design. We identify the one particular design that would have been executed, which incorporates early stopping and information-based adaptive randomization. Limitations While the simulation realistically emulates patient enrollment, interim analyses, and adaptive changes to design, it cannot incorporate key features like the involvement of data monitoring committee in making decisions about adaptive changes. Conclusion This article describes our analytic approach for RE-ADAPT. The next stage of the project is to conduct the re-execution analyses using the seven prespecified designs and the original ALLHAT data. PMID:23983160

Here Today, Gone Tomorrow – Adaptation to Change in Memory-Guided Visual Search

PubMed Central

Zellin, Martina; Conci, Markus; von Mühlenen, Adrian; Müller, Hermann J.

2013-01-01

Visual search for a target object can be facilitated by the repeated presentation of an invariant configuration of nontargets (‘contextual cueing’). Here, we tested adaptation of learned contextual associations after a sudden, but permanent, relocation of the target. After an initial learning phase targets were relocated within their invariant contexts and repeatedly presented at new locations, before they returned to the initial locations. Contextual cueing for relocated targets was neither observed after numerous presentations nor after insertion of an overnight break. Further experiments investigated whether learning of additional, previously unseen context-target configurations is comparable to adaptation of existing contextual associations to change. In contrast to the lack of adaptation to changed target locations, contextual cueing developed for additional invariant configurations under identical training conditions. Moreover, across all experiments, presenting relocated targets or additional contexts did not interfere with contextual cueing of initially learned invariant configurations. Overall, the adaptation of contextual memory to changed target locations was severely constrained and unsuccessful in comparison to learning of an additional set of contexts, which suggests that contextual cueing facilitates search for only one repeated target location. PMID:23555038

Urn models for response-adaptive randomized designs: a simulation study based on a non-adaptive randomized trial.

PubMed

Ghiglietti, Andrea; Scarale, Maria Giovanna; Miceli, Rosalba; Ieva, Francesca; Mariani, Luigi; Gavazzi, Cecilia; Paganoni, Anna Maria; Edefonti, Valeria

2018-03-22

Recently, response-adaptive designs have been proposed in randomized clinical trials to achieve ethical and/or cost advantages by using sequential accrual information collected during the trial to dynamically update the probabilities of treatment assignments. In this context, urn models-where the probability to assign patients to treatments is interpreted as the proportion of balls of different colors available in a virtual urn-have been used as response-adaptive randomization rules. We propose the use of Randomly Reinforced Urn (RRU) models in a simulation study based on a published randomized clinical trial on the efficacy of home enteral nutrition in cancer patients after major gastrointestinal surgery. We compare results with the RRU design with those previously published with the non-adaptive approach. We also provide a code written with the R software to implement the RRU design in practice. In detail, we simulate 10,000 trials based on the RRU model in three set-ups of different total sample sizes. We report information on the number of patients allocated to the inferior treatment and on the empirical power of the t-test for the treatment coefficient in the ANOVA model. We carry out a sensitivity analysis to assess the effect of different urn compositions. For each sample size, in approximately 75% of the simulation runs, the number of patients allocated to the inferior treatment by the RRU design is lower, as compared to the non-adaptive design. The empirical power of the t-test for the treatment effect is similar in the two designs.

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

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.

A Bayesian sequential design with adaptive randomization for 2-sided hypothesis test.

PubMed

Yu, Qingzhao; Zhu, Lin; Zhu, Han

2017-11-01

Bayesian sequential and adaptive randomization designs are gaining popularity in clinical trials thanks to their potentials to reduce the number of required participants and save resources. We propose a Bayesian sequential design with adaptive randomization rates so as to more efficiently attribute newly recruited patients to different treatment arms. In this paper, we consider 2-arm clinical trials. Patients are allocated to the 2 arms with a randomization rate to achieve minimum variance for the test statistic. Algorithms are presented to calculate the optimal randomization rate, critical values, and power for the proposed design. Sensitivity analysis is implemented to check the influence on design by changing the prior distributions. Simulation studies are applied to compare the proposed method and traditional methods in terms of power and actual sample sizes. Simulations show that, when total sample size is fixed, the proposed design can obtain greater power and/or cost smaller actual sample size than the traditional Bayesian sequential design. Finally, we apply the proposed method to a real data set and compare the results with the Bayesian sequential design without adaptive randomization in terms of sample sizes. The proposed method can further reduce required sample size. Copyright © 2017 John Wiley & Sons, Ltd.

Patient-based radiographic exposure factor selection: a systematic review

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ching, William; Robinson, John; McEntee, Mark, E-mail: mark.mcentee@sydney.edu.au

Digital technology has wider exposure latitude and post-processing algorithms which can mask the evidence of underexposure and overexposure. Underexposure produces noisy, grainy images which can impede diagnosis and overexposure results in a greater radiation dose to the patient. These exposure errors can result from inaccurate adjustment of exposure factors in response to changes in patient thickness. This study aims to identify all published radiographic exposure adaptation systems which have been, or are being, used in general radiography and discuss their applicability to digital systems. Studies in EMBASE, MEDLINE, CINAHL and SCOPUS were systematically reviewed. Some of the search terms usedmore » were exposure adaptation, exposure selection, exposure technique, 25% rule, 15% rule, DuPont™ Bit System and radiography. A manual journal-specific search was also conducted in The Radiographer and Radiologic Technology. Studies were included if they demonstrated a system of altering exposure factors to compensate for variations in patients for general radiography. Studies were excluded if they focused on finding optimal exposures for an ‘average’ patient or focused on the relationship between exposure factors and dose. The database search uncovered 11 articles and the journal-specific search uncovered 13 articles discussing systems of exposure adaptation. They can be categorised as simple one-step guidelines, comprehensive charts and computer programs. Only two papers assessed the efficacy of exposure adjustment systems. No literature compares the efficacy of exposure adaptations system for film/screen radiography with digital radiography technology nor is there literature on a digital specific exposure adaptation system.« less

Visual Scan Adaptation During Repeated Visual Search

DTIC Science & Technology

2010-01-01

Junge, J. A. (2004). Searching for stimulus-driven shifts of attention. Psychonomic Bulletin & Review , 11, 876–881. Furst, C. J. (1971...search strategies cannot override attentional capture. Psychonomic Bulletin & Review , 11, 65–70. Wolfe, J. M. (1994). Guided search 2.0: A revised model...of visual search. Psychonomic Bulletin & Review , 1, 202–238. Wolfe, J. M. (1998a). Visual search. In H. Pashler (Ed.), Attention (pp. 13–73). East

Adaptive critic autopilot design of bank-to-turn missiles using fuzzy basis function networks.

PubMed

Lin, Chuan-Kai

2005-04-01

A new adaptive critic autopilot design for bank-to-turn missiles is presented. In this paper, the architecture of adaptive critic learning scheme contains a fuzzy-basis-function-network based associative search element (ASE), which is employed to approximate nonlinear and complex functions of bank-to-turn missiles, and an adaptive critic element (ACE) generating the reinforcement signal to tune the associative search element. In the design of the adaptive critic autopilot, the control law receives signals from a fixed gain controller, an ASE and an adaptive robust element, which can eliminate approximation errors and disturbances. Traditional adaptive critic reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment, however, the proposed tuning algorithm can significantly shorten the learning time by online tuning all parameters of fuzzy basis functions and weights of ASE and ACE. Moreover, the weight updating law derived from the Lyapunov stability theory is capable of guaranteeing both tracking performance and stability. Computer simulation results confirm the effectiveness of the proposed adaptive critic autopilot.

Optimal random search for a single hidden target.

PubMed

Snider, Joseph

2011-01-01

A single target is hidden at a location chosen from a predetermined probability distribution. Then, a searcher must find a second probability distribution from which random search points are sampled such that the target is found in the minimum number of trials. Here it will be shown that if the searcher must get very close to the target to find it, then the best search distribution is proportional to the square root of the target distribution regardless of dimension. For a Gaussian target distribution, the optimum search distribution is approximately a Gaussian with a standard deviation that varies inversely with how close the searcher must be to the target to find it. For a network where the searcher randomly samples nodes and looks for the fixed target along edges, the optimum is either to sample a node with probability proportional to the square root of the out-degree plus 1 or not to do so at all.

Signatures of active and passive optimized Lévy searching in jellyfish

PubMed Central

Reynolds, Andy M.

2014-01-01

Some of the strongest empirical support for Lévy search theory has come from telemetry data for the dive patterns of marine predators (sharks, bony fishes, sea turtles and penguins). The dive patterns of the unusually large jellyfish Rhizostoma octopus do, however, sit outside of current Lévy search theory which predicts that a single search strategy is optimal. When searching the water column, the movement patterns of these jellyfish change over time. Movement bouts can be approximated by a variety of Lévy and Brownian (exponential) walks. The adaptive value of this variation is not known. On some occasions movement pattern data are consistent with the jellyfish prospecting away from a preferred depth, not finding an improvement in conditions elsewhere and so returning to their original depth. This ‘bounce’ behaviour also sits outside of current Lévy walk search theory. Here, it is shown that the jellyfish movement patterns are consistent with their using optimized ‘fast simulated annealing’—a novel kind of Lévy walk search pattern—to locate the maximum prey concentration in the water column and/or to locate the strongest of many olfactory trails emanating from more distant prey. Fast simulated annealing is a powerful stochastic search algorithm for locating a global maximum that is hidden among many poorer local maxima in a large search space. This new finding shows that the notion of active optimized Lévy walk searching is not limited to the search for randomly and sparsely distributed resources, as previously thought, but can be extended to embrace other scenarios, including that of the jellyfish R. octopus. In the presence of convective currents, it could become energetically favourable to search the water column by riding the convective currents. Here, it is shown that these passive movements can be represented accurately by Lévy walks of the type occasionally seen in R. octopus. This result vividly illustrates that Lévy walks are not necessarily the result of selection pressures for advantageous searching behaviour but can instead arise freely and naturally from simple processes. It also shows that the family of Lévy walkers is vastly larger than previously thought and includes spores, pollens, seeds and minute wingless arthropods that on warm days disperse passively within the atmospheric boundary layer. PMID:25100323

Signatures of active and passive optimized Lévy searching in jellyfish.

PubMed

Reynolds, Andy M

2014-10-06

Some of the strongest empirical support for Lévy search theory has come from telemetry data for the dive patterns of marine predators (sharks, bony fishes, sea turtles and penguins). The dive patterns of the unusually large jellyfish Rhizostoma octopus do, however, sit outside of current Lévy search theory which predicts that a single search strategy is optimal. When searching the water column, the movement patterns of these jellyfish change over time. Movement bouts can be approximated by a variety of Lévy and Brownian (exponential) walks. The adaptive value of this variation is not known. On some occasions movement pattern data are consistent with the jellyfish prospecting away from a preferred depth, not finding an improvement in conditions elsewhere and so returning to their original depth. This 'bounce' behaviour also sits outside of current Lévy walk search theory. Here, it is shown that the jellyfish movement patterns are consistent with their using optimized 'fast simulated annealing'--a novel kind of Lévy walk search pattern--to locate the maximum prey concentration in the water column and/or to locate the strongest of many olfactory trails emanating from more distant prey. Fast simulated annealing is a powerful stochastic search algorithm for locating a global maximum that is hidden among many poorer local maxima in a large search space. This new finding shows that the notion of active optimized Lévy walk searching is not limited to the search for randomly and sparsely distributed resources, as previously thought, but can be extended to embrace other scenarios, including that of the jellyfish R. octopus. In the presence of convective currents, it could become energetically favourable to search the water column by riding the convective currents. Here, it is shown that these passive movements can be represented accurately by Lévy walks of the type occasionally seen in R. octopus. This result vividly illustrates that Lévy walks are not necessarily the result of selection pressures for advantageous searching behaviour but can instead arise freely and naturally from simple processes. It also shows that the family of Lévy walkers is vastly larger than previously thought and includes spores, pollens, seeds and minute wingless arthropods that on warm days disperse passively within the atmospheric boundary layer. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Adaptive Designs for Randomized Trials in Public Health

PubMed Central

Brown, C. Hendricks; Have, Thomas R. Ten; Jo, Booil; Dagne, Getachew; Wyman, Peter A.; Muthén, Bengt; Gibbons, Robert D.

2009-01-01

In this article, we present a discussion of two general ways in which the traditional randomized trial can be modified or adapted in response to the data being collected. We use the term adaptive design to refer to a trial in which characteristics of the study itself, such as the proportion assigned to active intervention versus control, change during the trial in response to data being collected. The term adaptive sequence of trials refers to a decision-making process that fundamentally informs the conceptualization and conduct of each new trial with the results of previous trials. Our discussion below investigates the utility of these two types of adaptations for public health evaluations. Examples are provided to illustrate how adaptation can be used in practice. From these case studies, we discuss whether such evaluations can or should be analyzed as if they were formal randomized trials, and we discuss practical as well as ethical issues arising in the conduct of these new-generation trials. PMID:19296774

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.

Binary Bees Algorithm - bioinspiration from the foraging mechanism of honeybees to optimize a multiobjective multidimensional assignment problem

NASA Astrophysics Data System (ADS)

Xu, Shuo; Ji, Ze; Truong Pham, Duc; Yu, Fan

2011-11-01

The simultaneous mission assignment and home allocation for hospital service robots studied is a Multidimensional Assignment Problem (MAP) with multiobjectives and multiconstraints. A population-based metaheuristic, the Binary Bees Algorithm (BBA), is proposed to optimize this NP-hard problem. Inspired by the foraging mechanism of honeybees, the BBA's most important feature is an explicit functional partitioning between global search and local search for exploration and exploitation, respectively. Its key parts consist of adaptive global search, three-step elitism selection (constraint handling, non-dominated solutions selection, and diversity preservation), and elites-centred local search within a Hamming neighbourhood. Two comparative experiments were conducted to investigate its single objective optimization, optimization effectiveness (indexed by the S-metric and C-metric) and optimization efficiency (indexed by computational burden and CPU time) in detail. The BBA outperformed its competitors in almost all the quantitative indices. Hence, the above overall scheme, and particularly the searching history-adapted global search strategy was validated.

A computational model of visual marking using an inter-connected network of spiking neurons: the spiking search over time & space model (sSoTS).

PubMed

Mavritsaki, Eirini; Heinke, Dietmar; Humphreys, Glyn W; Deco, Gustavo

2006-01-01

In the real world, visual information is selected over time as well as space, when we prioritise new stimuli for attention. Watson and Humphreys [Watson, D., Humphreys, G.W., 1997. Visual marking: prioritizing selection for new objects by top-down attentional inhibition of old objects. Psychological Review 104, 90-122] presented evidence that new information in search tasks is prioritised by (amongst other processes) active ignoring of old items - a process they termed visual marking. In this paper we present, for the first time, an explicit computational model of visual marking using biologically plausible activation functions. The "spiking search over time and space" model (sSoTS) incorporates different synaptic components (NMDA, AMPA, GABA) and a frequency adaptation mechanism based on [Ca(2+)] sensitive K(+) current. This frequency adaptation current can act as a mechanism that suppresses the previously attended items. We show that, when coupled with a process of active inhibition applied to old items, frequency adaptation leads to old items being de-prioritised (and new items prioritised) across time in search. Furthermore, the time course of these processes mimics the time course of the preview effect in human search. The results indicate that the sSoTS model can provide a biologically plausible account of human search over time as well as space.

Optimizing event selection with the random grid search

NASA Astrophysics Data System (ADS)

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen; Stewart, Chip

2018-07-01

The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.

An adaptive evolutionary multi-objective approach based on simulated annealing.

PubMed

Li, H; Landa-Silva, D

2011-01-01

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a population of solutions. However, the performance of MOEA/D highly depends on the initial setting and diversity of the weight vectors. In this paper, we present an improved version of MOEA/D, called EMOSA, which incorporates an advanced local search technique (simulated annealing) and adapts the search directions (weight vectors) corresponding to various subproblems. In EMOSA, the weight vector of each subproblem is adaptively modified at the lowest temperature in order to diversify the search toward the unexplored parts of the Pareto-optimal front. Our computational results show that EMOSA outperforms six other well established multi-objective metaheuristic algorithms on both the (constrained) multi-objective knapsack problem and the (unconstrained) multi-objective traveling salesman problem. Moreover, the effects of the main algorithmic components and parameter sensitivities on the search performance of EMOSA are experimentally investigated.

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

Lost in search: (Mal-)adaptation to probabilistic decision environments in children and adults.

PubMed

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

2016-02-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 adults' (age range: 21-22 years) search behaviors and decisions under different probability dispersions (.17; .33, .83 vs. .50, .67, .83) and constraint conditions (instructions to limit search: yes vs. no). All age groups limited their depth of search when instructed to do so and when probability dispersion was high (range: .17-.83). Unlike adults, children failed to use probabilities as weights for their searches, which were largely not systematic. When examining choices, however, elementary school children (unlike preschoolers) systematically used probabilities as weights in their decisions. This suggests that an intuitive understanding of probabilities and the capacity to use them as weights during integration is not a sufficient condition for applying simple selective search strategies that place one's focus on weight distributions. PsycINFO Database Record (c) 2016 APA, all rights reserved.

Sleep and memory. I: The influence of different sleep stages on memory.

PubMed

Rotenberg, V S

1992-01-01

A new approach to the sleep stages role in memory is discussed in the context of the two opposite patterns of behavior-search activity and renunciation of search. Search activity is activity designed to change the situation (or the subjects attitudes to it) in the absence of a definite forecast of the results of such activity, but with the constant consideration of these results at all stages of activity. Search activity increases general adaptability and body resistance while renunciation of search decreases adaptability and requires REM sleep for its compensation. Unprepared learning, which is often accompanied by failures on the first steps of learning, is suggested to produce renunciation of search, which decreases learning ability, suppress retention, and increase REM sleep requirement. A prolonged REM sleep deprivation before training causes learned helplessness and disturbs the learning process, while short REM sleep deprivation cause the "rebound" of the compensatory search activity that interferes with passive avoidance. REM sleep deprivation performed after a training session can increase distress caused by a training procedure, with the subsequent negative outcome on retention.

Psychotherapeutic Treatment for Anorexia Nervosa: A Systematic Review and Network Meta-Analysis

PubMed Central

Zeeck, Almut; Herpertz-Dahlmann, Beate; Friederich, Hans-Christoph; Brockmeyer, Timo; Resmark, Gaby; Hagenah, Ulrich; Ehrlich, Stefan; Cuntz, Ulrich; Zipfel, Stephan; Hartmann, Armin

2018-01-01

Background: The aim of the study was a systematic review of studies evaluating psychotherapeutic treatment approaches in anorexia nervosa and to compare their efficacy. Weight gain was chosen as the primary outcome criterion. We also aimed to compare treatment effects according to service level (inpatient vs. outpatient) and age group (adolescents vs. adults). Methods:The data bases PubMed, Cochrane Library, Web of Science, Cinahl, and PsychInfo were used for a systematic literature search (until Feb 2017). Search terms were adapted for data base, combining versions of the search terms anorexia, treat*/therap* and controlled trial. Studies were selected using pre-defined in- and exclusion criteria. Data were extracted by two independent coders using piloted forms. Network-meta-analyses were conducted on all RCTs. For a comparison of service levels and age groups, standard mean change (SMC) statistics were used and naturalistic, non-randomized studies included. Results: Eighteen RCTs (trials on adults: 622 participants; trials on adolescents: 625 participants) were included in the network meta-analysis. SMC analyses were conducted with 38 studies (1,164 participants). While family-based approaches dominate interventions for adolescents, individual psychotherapy dominates in adults. There was no superiority of a specific approach. Weight gains were more rapid in adolescents and inpatient treatment. Conclusions: Several specialized psychotherapeutic interventions have been developed and can be recommended for AN. However, adult and adolescent patients should be distinguished, as groups differ in terms of treatment approaches considered suitable as well as treatment response. Future trials should replicate previous findings and be multi-center trials with large sample sizes to allow for subgroup analyses. Patient assessment should include variables that can be considered relevant moderators of treatment outcome. It is desirable to explore adaptive treatment strategies for subgroups of patients with AN. Identifying and addressing maintaining factors in AN remains a major challenge. PMID:29765338

Enhanced Recovery after Emergency Surgery: A Systematic Review

PubMed Central

Paduraru, Mihai; Ponchietti, Luca; Casas, Isidro Martinez; Svenningsen, Peter; Zago, Mauro

2017-01-01

Objective: To evaluate the current scientific evidence for the applicability, safety and effectiveness of pathways of enhanced recovery after emergency surgery (ERAS). Methods: We undertook a search using PubMed and Cochrane databases for ERAS protocols in emergency cases. The search generated 65 titles; after eliminating the papers not meeting search criteria, we selected 4 cohort studies and 1 randomized clinical trial (RCT). Data extracted for analysis consisted of: patient age, type of surgery performed, ERAS elements implemented, surgical outcomes in terms of postoperative complications, mortality, length of stay (LOS) and readmission rate. Results: The number of ERAS items applied was good, ranging from 11 to 18 of the 20 recommended by the ERAS Society. The implementation resulted in fewer postoperative complications. LOS for ES patients was shorter when compared to conventional care. Mortality, specifically reported in three studies, was equal or lower with ERAS. Readmission rates varied widely and were generally higher for the intervention group but without statistical significance. Conclusions: The studies reviewed agreed that ERAS in emergency surgery (ES) was feasible and safe with generally better outcomes. Lower compliance with some of the ERAS items shows the need for the protocol to be adapted to ES patients. More evidence is clearly required as to what can improve outcomes and how this can be formulated into an effective care pathway for the heterogeneous ES patient. PMID:28507993

Amoeba-Inspired Heuristic Search Dynamics for Exploring Chemical Reaction Paths.

PubMed

Aono, Masashi; Wakabayashi, Masamitsu

2015-09-01

We propose a nature-inspired model for simulating chemical reactions in a computationally resource-saving manner. The model was developed by extending our previously proposed heuristic search algorithm, called "AmoebaSAT [Aono et al. 2013]," which was inspired by the spatiotemporal dynamics of a single-celled amoeboid organism that exhibits sophisticated computing capabilities in adapting to its environment efficiently [Zhu et al. 2013]. AmoebaSAT is used for solving an NP-complete combinatorial optimization problem [Garey and Johnson 1979], "the satisfiability problem," and finds a constraint-satisfying solution at a speed that is dramatically faster than one of the conventionally known fastest stochastic local search methods [Iwama and Tamaki 2004] for a class of randomly generated problem instances [ http://www.cs.ubc.ca/~hoos/5/benchm.html ]. In cases where the problem has more than one solution, AmoebaSAT exhibits dynamic transition behavior among a variety of the solutions. Inheriting these features of AmoebaSAT, we formulate "AmoebaChem," which explores a variety of metastable molecules in which several constraints determined by input atoms are satisfied and generates dynamic transition processes among the metastable molecules. AmoebaChem and its developed forms will be applied to the study of the origins of life, to discover reaction paths for which expected or unexpected organic compounds may be formed via unknown unstable intermediates and to estimate the likelihood of each of the discovered paths.

[Effects of Family Support Programs for Caregivers of People with Dementia - Caregiving Burden, Depression, and Stress: Systematic Review and Meta-analysis].

PubMed

Park, Seyeon; Park, Myonghwa

2015-10-01

The objective of this systematic review was to assess the effects of family support programs on caregiving burden, depression, and stress in family caregivers of people with dementia. A literature search was conducted of electronic databases to identify randomized controlled studies with family support programs done between 2000 and 2014. Studies published in English and/or Korean were included for the analysis with search strategies adapted from the Cochrane Dementia and Cognitive Improvement Group. Studies were rated for quality assessment by two independent reviewers using the appraisal checklist developed by Cochrane Reviews and Dissemination. Of 8,334 articles identified in the literature search, full texts of 76 articles that met the inclusion criteria were reviewed and 38 were found to include relevant outcomes. Results from selected studies were pooled in statistical meta-analysis using Review Manager Software and heterogeneity between combined studies was assessed using the Chi-square test. Meta-analysis showed that the effect sizes of family caregiver support programs were small to medium for categories of caregiving burden (Hedge's g=-0.17, 95% CI=-0.30~-0.04), depression (Hedge's g=-0.30, 95% CI=-0.40~-0.20), and stress (Hedge's g=-0.39, 95% CI=-0.52~-0.25). The review results indicate that a support programs can assist family caregivers in reducing their psycho-emotional distress.

The Impact of Random Metal Detector Searches on Contraband Possession and Feelings of Safety at School

ERIC Educational Resources Information Center

Bhatt, Rachana; Davis, Tomeka

2018-01-01

Weapons at school pose a danger to students as well as faculty. Educational administrators have attempted to reduce their prevalence by implementing random weapons searches in schools. This article examines the effectiveness of this approach using data from two geographically adjacent school districts in Florida (Miami-Dade and Broward). In the…

Using Direct Policy Search to Identify Robust Strategies in Adapting to Uncertain Sea Level Rise and Storm Surge

NASA Astrophysics Data System (ADS)

Garner, G. G.; Keller, K.

2017-12-01

Sea-level rise poses considerable risks to coastal communities, ecosystems, and infrastructure. Decision makers are faced with deeply uncertain sea-level projections when designing a strategy for coastal adaptation. The traditional methods have provided tremendous insight into this decision problem, but are often silent on tradeoffs as well as the effects of tail-area events and of potential future learning. Here we reformulate a simple sea-level rise adaptation model to address these concerns. We show that Direct Policy Search yields improved solution quality, with respect to Pareto-dominance in the objectives, over the traditional approach under uncertain sea-level rise projections and storm surge. Additionally, the new formulation produces high quality solutions with less computational demands than the traditional approach. Our results illustrate the utility of multi-objective adaptive formulations for the example of coastal adaptation, the value of information provided by observations, and point to wider-ranging application in climate change adaptation decision problems.

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…

The Lévy flight paradigm: random search patterns and mechanisms.

PubMed

Reynolds, A M; Rhodes, C J

2009-04-01

Over recent years there has been an accumulation of evidence from a variety of experimental, theoretical, and field studies that many organisms use a movement strategy approximated by Lévy flights when they are searching for resources. Lévy flights are random movements that can maximize the efficiency of resource searches in uncertain environments. This is a highly significant finding because it suggests that Lévy flights provide a rigorous mathematical basis for separating out evolved, innate behaviors from environmental influences. We discuss recent developments in random-search theory, as well as the many different experimental and data collection initiatives that have investigated search strategies. Methods for trajectory construction and robust data analysis procedures are presented. The key to prediction and understanding does, however, lie in the elucidation of mechanisms underlying the observed patterns. We discuss candidate neurological, olfactory, and learning mechanisms for the emergence of Lévy flight patterns in some organisms, and note that convergence of behaviors along such different evolutionary pathways is not surprising given the energetic efficiencies that Lévy flight movement patterns confer.

Optimizing event selection with the random grid search

DOE PAGES

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen; ...

2018-02-27

In this paper, the random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector bosonmore » fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.« less

Optimizing Event Selection with the Random Grid Search

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen

2017-06-29

The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events inmore » the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.« less

Optimizing event selection with the random grid search

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen

In this paper, the random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector bosonmore » fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.« less

Online games: a novel approach to explore how partial information influences human random searches

NASA Astrophysics Data System (ADS)

Martínez-García, Ricardo; Calabrese, Justin M.; López, Cristóbal

2017-01-01

Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.

Online games: a novel approach to explore how partial information influences human random searches.

PubMed

Martínez-García, Ricardo; Calabrese, Justin M; López, Cristóbal

2017-01-06

Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.

Massage therapy for children with autism spectrum disorders: a systematic review.

PubMed

Lee, Myeong Soo; Kim, Jong-In; Ernst, Edzard

2011-03-01

We aimed to assess the effectiveness of massage as a treatment option for autism. We searched the following electronic databases using the time of their inception through March 2010: MEDLINE, AMED, CINAHL, EMBASE, PsycINFO, Health Technology Assessment, Cochrane Central Register of Controlled Trials, Cochrane Database of Systematic Reviews, Database of Abstracts of Reviews of Effects, Psychology and Behavioral Sciences Collection, 6 Korean medical databases (KSI, DBpia, KISTEP, RISS, KoreaMed, and National Digital Library), China Academic Journal (through China National Knowledge Infrastructure), and 3 Japanese medical databases (Journal@rchive, Science Links Japan, and Japan Science & Technology link). The search phrase used was "(massage OR touch OR acupressure) AND (autistic OR autism OR Asperger's syndrome OR pervasive developmental disorder)." The references in all located articles were also searched. No language restrictions were imposed. Prospective controlled clinical studies of any type of massage therapy for autistic patients were included. Trials in which massage was part of a complex intervention were also included. Case studies, case series, qualitative studies, uncontrolled trials, studies that failed to provide detailed results, and trials that compared one type of massage with another were excluded. All articles were read by 2 independent reviewers (M.S.L. and J-I.K.), who extracted data from the articles according to predefined criteria. Risk of bias was assessed using the Cochrane classification. Of 132 articles, only 6 studies met our inclusion criteria. One randomized clinical trial found that massage plus conventional language therapy was superior to conventional language therapy alone for symptom severity (P < .05) and communication attitude (P < .01). Two randomized clinical trials reported a significant benefit of massage for sensory profile (P < .01), adaptive behavior (P < .05), and language and social abilities (P < .01) as compared with a special education program. The fourth randomized clinical trial showed beneficial effects of massage for social communication (P < .05). Two nonrandomized controlled clinical trials suggested that massage therapy is effective. However, all of the included trials have high risk of bias. The main limitations of the included studies were small sample sizes, predefined primary outcome measures, inadequate control for nonspecific effects, and a lack of power calculations or adequate follow-up. Limited evidence exists for the effectiveness of massage as a symptomatic treatment of autism. Because the risk of bias was high, firm conclusions cannot be drawn. Future, more rigorous randomized clinical trials seem to be warranted. © Copyright 2011 Physicians Postgraduate Press, Inc.

Adaptive threshold shearlet transform for surface microseismic data denoising

NASA Astrophysics Data System (ADS)

Tang, Na; Zhao, Xian; Li, Yue; Zhu, Dan

2018-06-01

Random noise suppression plays an important role in microseismic data processing. The microseismic data is often corrupted by strong random noise, which would directly influence identification and location of microseismic events. Shearlet transform is a new multiscale transform, which can effectively process the low magnitude of microseismic data. In shearlet domain, due to different distributions of valid signals and random noise, shearlet coefficients can be shrunk by threshold. Therefore, threshold is vital in suppressing random noise. The conventional threshold denoising algorithms usually use the same threshold to process all coefficients, which causes noise suppression inefficiency or valid signals loss. In order to solve above problems, we propose the adaptive threshold shearlet transform (ATST) for surface microseismic data denoising. In the new algorithm, we calculate the fundamental threshold for each direction subband firstly. In each direction subband, the adjustment factor is obtained according to each subband coefficient and its neighboring coefficients, in order to adaptively regulate the fundamental threshold for different shearlet coefficients. Finally we apply the adaptive threshold to deal with different shearlet coefficients. The experimental denoising results of synthetic records and field data illustrate that the proposed method exhibits better performance in suppressing random noise and preserving valid signal than the conventional shearlet denoising method.

RESILIENCE IN VULNERABLE POPULATIONS WITH TYPE 2 DIABETES MELLITUS AND HYPERTENSION: A SYSTEMATIC REVIEW AND META-ANALYSIS

PubMed Central

Pesantes, M. Amalia; Lazo-Porras, María; Abu Dabrh, Abd Moain; Avila-Ramirez, Jaime R.; Caycho, Maria; Villamonte, Georgina Y.; Sanchez-Perez, Grecia P.; Málaga, Germán; Bernabé-Ortiz, Antonio; Miranda, J. Jaime

2015-01-01

Background Patients with chronic conditions and limited access to healthcare experience stressful challenges due to the burden of managing both their conditions and their daily life demands. Resilience provides a mechanism of adapting to stressful experiences. We conducted a systematic review and meta-analysis to synthesize the evidence about interventions to enhance resiliency in managing hypertension or type-2 diabetes in vulnerable populations, and to assess the efficacy of these interventions on clinical outcomes. Methods We searched multiple databases from early inception through February 2015 including randomized controlled trials that enrolled patients with type-2 diabetes or hypertension. All interventions that targeted resilience in vulnerable populations were included. Data were synthesized to describe the characteristics and efficacy of resilience interventions. We pooled the total effects by calculating standardized mean difference using the random-effects model. Results The final search yielded seventeen studies. All studies were conducted in the United States and generally targeted minority participants. Resiliency interventions used diverse strategies; discussion groups or workshops were the most common approach. Conclusions Interventions aimed at enhancing the resiliency of patients from vulnerable groups are diverse. Outcomes were not fully conclusive. There was some evidence that resilience interventions had a positive effect on HbA1c levels, but not blood pressure. The incorporation of resiliency-oriented interventions into the arsenal of prevention and management of chronic conditions appears to be an opportunity that remains to be better investigated and exploited, and there is need to pursue further understanding of the core components of any intervention that claims to enhance resilience. PMID:26239007

'Dignity therapy', a promising intervention in palliative care: A comprehensive systematic literature review.

PubMed

Martínez, Marina; Arantzamendi, María; Belar, Alazne; Carrasco, José Miguel; Carvajal, Ana; Rullán, María; Centeno, Carlos

2017-06-01

Dignity therapy is psychotherapy to relieve psychological and existential distress in patients at the end of life. Little is known about its effect. To analyse the outcomes of dignity therapy in patients with advanced life-threatening diseases. Systematic review was conducted. Three authors extracted data of the articles and evaluated quality using Critical Appraisal Skills Programme. Data were synthesized, considering study objectives. PubMed, CINAHL, Cochrane Library and PsycINFO. The years searched were 2002 (year of dignity therapy development) to January 2016. 'Dignity therapy' was used as search term. Studies with patients with advanced life-threatening diseases were included. Of 121 studies, 28 were included. Quality of studies is high. Results were grouped into effectiveness, satisfaction, suitability and feasibility, and adaptability to different diseases and cultures. Two of five randomized control trials applied dignity therapy to patients with high levels of baseline psychological distress. One showed statistically significant decrease on patients' anxiety and depression scores over time. The other showed statistical decrease on anxiety scores pre-post dignity therapy, not on depression. Nonrandomized studies suggested statistically significant improvements in existential and psychosocial measurements. Patients, relatives and professionals perceived it improved end-of-life experience. Evidence suggests that dignity therapy is beneficial. One randomized controlled trial with patients with high levels of psychological distress shows DT efficacy in anxiety and depression scores. Other design studies report beneficial outcomes in terms of end-of-life experience. Further research should understand how dignity therapy functions to establish a means for measuring its impact and assessing whether high level of distress patients can benefit most from this therapy.

Benefits and Harms of Sick Leave: Lack of Randomized, Controlled Trials

ERIC Educational Resources Information Center

Axelsson, Inge; Marnetoft, Sven-Uno

2010-01-01

The aim of this study was to try to identify those randomized controlled trials that compare sick leave with no sick leave or a different duration or degree of sick leave. A comprehensive, systematic, electronic search of Clinical Evidence, the Cochrane Library and PubMed, and a manual search of the Campbell Library and a journal supplement was…

Optimal Quantum Spatial Search on Random Temporal Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

An adaptive PID like controller using mix locally recurrent neural network for robotic manipulator with variable payload.

PubMed

Sharma, Richa; Kumar, Vikas; Gaur, Prerna; Mittal, A P

2016-05-01

Being complex, non-linear and coupled system, the robotic manipulator cannot be effectively controlled using classical proportional-integral-derivative (PID) controller. To enhance the effectiveness of the conventional PID controller for the nonlinear and uncertain systems, gains of the PID controller should be conservatively tuned and should adapt to the process parameter variations. In this work, a mix locally recurrent neural network (MLRNN) architecture is investigated to mimic a conventional PID controller which consists of at most three hidden nodes which act as proportional, integral and derivative node. The gains of the mix locally recurrent neural network based PID (MLRNNPID) controller scheme are initialized with a newly developed cuckoo search algorithm (CSA) based optimization method rather than assuming randomly. A sequential learning based least square algorithm is then investigated for the on-line adaptation of the gains of MLRNNPID controller. The performance of the proposed controller scheme is tested against the plant parameters uncertainties and external disturbances for both links of the two link robotic manipulator with variable payload (TL-RMWVP). The stability of the proposed controller is analyzed using Lyapunov stability criteria. A performance comparison is carried out among MLRNNPID controller, CSA optimized NNPID (OPTNNPID) controller and CSA optimized conventional PID (OPTPID) controller in order to establish the effectiveness of the MLRNNPID controller. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

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…

CALL FOR PAPERS: Special issue on the random search problem: trends and perspectives

NASA Astrophysics Data System (ADS)

da Luz, Marcos G. E.; Grosberg, Alexander Y.; Raposo, Ernesto P.; Viswanathan, Gandhi M.

2008-11-01

This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to the subject of the random search problem. The motivation behind this special issue is to summarize in a single comprehensive publication, the main aspects (past and present), latest developments, different viewpoints and the directions being followed in this multidisciplinary field. We hope that such a special issue could become a particularly valuable reference for the broad scientific community working with the general random search problem. The Editorial Board has invited Marcos G E da Luz, Alexander Y Grosberg, Ernesto P Raposo and Gandhi M Viswanathan to serve as Guest Editors for the special issue. The general question of how to optimize the search for specific target objects in either continuous or discrete environments when the information available is limited is of significant importance in a broad range of fields. Representative examples include ecology (animal foraging, dispersion of populations), geology (oil recovery from mature reservoirs), information theory (automated researchers of registers in high-capacity database), molecular biology (proteins searching for their sites, e.g., on DNA ), etc. One reason underlying the richness of the random search problem relates to the `ignorance' of the locations of the randomly located `targets'. A statistical approach to the search problem can deal adequately with incomplete information and so stochastic strategies become advantageous. The general problem of how to search efficiently for randomly located target sites can thus be quantitatively described using the concepts and methods of statistical physics and stochastic processes. Scope Thus far, to the best of our knowledge, no recent textbook or review article in a physics journal has appeared on this topic. This makes a special issue with review and research articles attractive to those interested in acquiring a general introduction to the field. The subject can be approached from the perspective of different fields: ecology, networks, transport problems, molecular biology, etc. The study of the problem is particularly suited to the concepts and methods of statistical physics and stochastic processes; for example, fractals, random walks, anomalous diffusion. Discrete landscapes can be approached via graph theory, random lattices and complex networks. Such topics are regularly discussed in Journal of Physics A: Mathematical and Theoretical. All such aspects of the problem fall within the scope and focus of this special issue on the random search problem: trends and perspectives. Editorial policy All contributions to the special issue will be refereed in accordance with the refereeing policy of the journal. In particular, all research papers will be expected to be original work reporting substantial new results. The issue will also contain a number of review articles by invitation only. The Guest Editors reserve the right to judge whether a contribution fits the scope of the special issue. Guidelines for preparation of contributions We aim to publish the special issue in August 2009. To realize this, the DEADLINE for contributed papers is 15 January 2009. There is a page limit of 15 printed pages (approximately 9000 words) per contribution. For papers exceeding this limit, the Guest Editors reserve the right to request a reduction in length. Further advice on document preparation can be found at www.iop.org/Journals/jphysa. Contributions to the special issue should if possible be submitted electronically by web upload at www.iop.org/Journals/jphysa, or by email to jphysa@iop.org, quoting 'J. Phys. A Special Issue— Random Search Problem'. Please state whether the paper has been invited or is contributed. Submissions should ideally be in standard LaTeX form. Please see the website for further information on electronic submissions. Authors unable to submit electronically may send hard-copy contributions to: Publishing Administrators, Journal of Physics A, Institute of Physics Publishing, Dirac House, Temple Back, Bristol BS1 6BE, UK, enclosing electronic code on CD if available and quoting 'J. Phys. A Special Issue—Random Search Problem'. All contributions should be accompanied by a read-me file or covering letter giving the postal and e-mail addresses for correspondence. The Publishing Office should be notified of any subsequent change of address. This special issue will be published in the paper and online version of the journal. The corresponding author of each contribution will receive a complimentary copy of the issue.

An Application of the Rasch Model to Computerized Adaptive Testing.

ERIC Educational Resources Information Center

Wisniewski, Dennis R.

Three questions concerning the Binary Search Method (BSM) of computerized adaptive testing were studied: (1) whether it provided a reliable and valid estimation of examinee ability; (2) its effect on examinee attitudes toward computerized adaptive testing and conventional paper-and-pencil testing; and (3) the relationship between item response…

Ringed Seal Search for Global Optimization via a Sensitive Search Model.

PubMed

Saadi, Younes; Yanto, Iwan Tri Riyadi; Herawan, Tutut; Balakrishnan, Vimala; Chiroma, Haruna; Risnumawan, Anhar

2016-01-01

The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global optimization problems.

Adaptive random walks on the class of Web graphs

NASA Astrophysics Data System (ADS)

Tadić, B.

2001-09-01

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦βc≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.

Bayesian Analysis for Exponential Random Graph Models Using the Adaptive Exchange Sampler.

PubMed

Jin, Ick Hoon; Yuan, Ying; Liang, Faming

2013-10-01

Exponential random graph models have been widely used in social network analysis. However, these models are extremely difficult to handle from a statistical viewpoint, because of the intractable normalizing constant and model degeneracy. In this paper, we consider a fully Bayesian analysis for exponential random graph models using the adaptive exchange sampler, which solves the intractable normalizing constant and model degeneracy issues encountered in Markov chain Monte Carlo (MCMC) simulations. The adaptive exchange sampler can be viewed as a MCMC extension of the exchange algorithm, and it generates auxiliary networks via an importance sampling procedure from an auxiliary Markov chain running in parallel. The convergence of this algorithm is established under mild conditions. The adaptive exchange sampler is illustrated using a few social networks, including the Florentine business network, molecule synthetic network, and dolphins network. The results indicate that the adaptive exchange algorithm can produce more accurate estimates than approximate exchange algorithms, while maintaining the same computational efficiency.

Discovering weighted patterns in intron sequences using self-adaptive harmony search and back-propagation algorithms.

PubMed

Huang, Yin-Fu; Wang, Chia-Ming; Liou, Sing-Wu

2013-01-01

A hybrid self-adaptive harmony search and back-propagation mining system was proposed to discover weighted patterns in human intron sequences. By testing the weights under a lazy nearest neighbor classifier, the numerical results revealed the significance of these weighted patterns. Comparing these weighted patterns with the popular intron consensus model, it is clear that the discovered weighted patterns make originally the ambiguous 5SS and 3SS header patterns more specific and concrete.

Discovering Weighted Patterns in Intron Sequences Using Self-Adaptive Harmony Search and Back-Propagation Algorithms

PubMed Central

Wang, Chia-Ming; Liou, Sing-Wu

2013-01-01

A hybrid self-adaptive harmony search and back-propagation mining system was proposed to discover weighted patterns in human intron sequences. By testing the weights under a lazy nearest neighbor classifier, the numerical results revealed the significance of these weighted patterns. Comparing these weighted patterns with the popular intron consensus model, it is clear that the discovered weighted patterns make originally the ambiguous 5SS and 3SS header patterns more specific and concrete. PMID:23737711

Fast adaptive diamond search algorithm for block-matching motion estimation using spatial correlation

NASA Astrophysics Data System (ADS)

Park, Sang-Gon; Jeong, Dong-Seok

2000-12-01

In this paper, we propose a fast adaptive diamond search algorithm (FADS) for block matching motion estimation. Many fast motion estimation algorithms reduce the computational complexity by the UESA (Unimodal Error Surface Assumption) where the matching error monotonically increases as the search moves away from the global minimum point. Recently, many fast BMAs (Block Matching Algorithms) make use of the fact that global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the neighboring blocks. We move the search origin according to the motion vectors of the spatially neighboring blocks and their MAEs (Mean Absolute Errors). The computer simulation shows that the proposed algorithm has almost the same computational complexity with DS (Diamond Search), but enhances PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS (Full Search), even for the large motion with half the computational load.

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.

The impact of mobile phone use on where we look and how we walk when negotiating floor based obstacles.

PubMed

Timmis, Matthew A; Bijl, Herre; Turner, Kieran; Basevitch, Itay; Taylor, Matthew J D; van Paridon, Kjell N

2017-01-01

Pedestrians regularly engage with their mobile phone whilst walking. The current study investigated how mobile phone use affects where people look (visual search behaviour) and how they negotiate a floor based hazard placed along the walking path. Whilst wearing a mobile eye tracker and motion analysis sensors, participants walked up to and negotiated a surface height change whilst writing a text, reading a text, talking on the phone, or without a phone. Differences in gait and visual search behaviour were found when using a mobile phone compared to when not using a phone. Using a phone resulted in looking less frequently and for less time at the surface height change, which led to adaptations in gait by negotiating it in a manner consistent with adopting an increasingly cautious stepping strategy. When using a mobile phone, writing a text whilst walking resulted in the greatest adaptions in gait and visual search behaviour compared to reading a text and talking on a mobile phone. Findings indicate that mobile phone users were able to adapt their visual search behaviour and gait to incorporate mobile phone use in a safe manner when negotiating floor based obstacles.

The impact of mobile phone use on where we look and how we walk when negotiating floor based obstacles

PubMed Central

Bijl, Herre; Turner, Kieran; Basevitch, Itay; Taylor, Matthew J. D.; van Paridon, Kjell N.

2017-01-01

Pedestrians regularly engage with their mobile phone whilst walking. The current study investigated how mobile phone use affects where people look (visual search behaviour) and how they negotiate a floor based hazard placed along the walking path. Whilst wearing a mobile eye tracker and motion analysis sensors, participants walked up to and negotiated a surface height change whilst writing a text, reading a text, talking on the phone, or without a phone. Differences in gait and visual search behaviour were found when using a mobile phone compared to when not using a phone. Using a phone resulted in looking less frequently and for less time at the surface height change, which led to adaptations in gait by negotiating it in a manner consistent with adopting an increasingly cautious stepping strategy. When using a mobile phone, writing a text whilst walking resulted in the greatest adaptions in gait and visual search behaviour compared to reading a text and talking on a mobile phone. Findings indicate that mobile phone users were able to adapt their visual search behaviour and gait to incorporate mobile phone use in a safe manner when negotiating floor based obstacles. PMID:28665942

Age and self-relevance effects on information search during decision making.

PubMed

Hess, Thomas M; Queen, Tara L; Ennis, Gilda E

2013-09-01

We investigated how information search strategies used to support decision making were influenced by self-related implications of the task to the individual. Consistent with the notion of selective engagement, we hypothesized that increased self-relevance would result in more adaptive search behaviors and that this effect would be stronger in older adults than in younger adults. We examined search behaviors in 79 younger and 81 older adults using a process-tracing procedure with 2 different decision tasks. The impact of motivation (i.e., self-related task implications) was examined by manipulating social accountability and the age-related relevance of the task. Although age differences in search strategies were not great, older adults were more likely than younger adults to use simpler strategies in contexts with minimal self-implications. Contrary to expectations, young and old alike were more likely to use noncompensatory than compensatory strategies, even when engaged in systematic search, with education being the most important determinant of search behavior. The results support the notion that older adults are adaptive decision makers and that factors other than age may be more important determinants of performance in situations where knowledge can be used to support performance.

Toward a theory of multilevel evolution: long-term information integration shapes the mutational landscape and enhances evolvability.

PubMed

Hogeweg, Paulien

2012-01-01

Most of evolutionary theory has abstracted away from how information is coded in the genome and how this information is transformed into traits on which selection takes place. While in the earliest stages of biological evolution, in the RNA world, the mapping from the genotype into function was largely predefined by the physical-chemical properties of the evolving entities (RNA replicators, e.g. from sequence to folded structure and catalytic sites), in present-day organisms, the mapping itself is the result of evolution. I will review results of several in silico evolutionary studies which examine the consequences of evolving the genetic coding, and the ways this information is transformed, while adapting to prevailing environments. Such multilevel evolution leads to long-term information integration. Through genome, network, and dynamical structuring, the occurrence and/or effect of random mutations becomes nonrandom, and facilitates rapid adaptation. This is what does happen in the in silico experiments. Is it also what did happen in biological evolution? I will discuss some data that suggest that it did. In any case, these results provide us with novel search images to tackle the wealth of biological data.

Feed mechanism and method for feeding minute items

DOEpatents

Stringer, Timothy Kent; Yerganian, Simon Scott

2012-11-06

A feeding mechanism and method for feeding minute items, such as capacitors, resistors, or solder preforms. The mechanism is adapted to receive a plurality of the randomly-positioned and randomly-oriented extremely small or minute items, and to isolate, orient, and position the items in a specific repeatable pickup location wherefrom they may be removed for use by, for example, a computer-controlled automated assembly machine. The mechanism comprises a sliding shelf adapted to receive and support the items; a wiper arm adapted to achieve a single even layer of the items; and a pushing arm adapted to push the items into the pickup location. The mechanism can be adapted for providing the items with a more exact orientation, and can also be adapted for use in a liquid environment.

Feed mechanism and method for feeding minute items

DOEpatents

Stringer, Timothy Kent [Bucyrus, KS; Yerganian, Simon Scott [Lee's Summit, MO

2009-10-20

A feeding mechanism and method for feeding minute items, such as capacitors, resistors, or solder preforms. The mechanism is adapted to receive a plurality of the randomly-positioned and randomly-oriented extremely small or minute items, and to isolate, orient, and position one or more of the items in a specific repeatable pickup location wherefrom they may be removed for use by, for example, a computer-controlled automated assembly machine. The mechanism comprises a sliding shelf adapted to receive and support the items; a wiper arm adapted to achieve a single even layer of the items; and a pushing arm adapted to push the items into the pickup location. The mechanism can be adapted for providing the items with a more exact orientation, and can also be adapted for use in a liquid environment.

Speeding Up Chemical Searches Using the Inverted Index: the Convergence of Chemoinformatics and Text Search Methods

PubMed Central

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

2012-01-01

In ligand-based screening, retrosynthesis, and other chemoinformatics applications, one of-ten 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 thresh-old 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

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

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

PubMed

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

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

A chaos wolf optimization algorithm with self-adaptive variable step-size

NASA Astrophysics Data System (ADS)

Zhu, Yong; Jiang, Wanlu; Kong, Xiangdong; Quan, Lingxiao; Zhang, Yongshun

2017-10-01

To explore the problem of parameter optimization for complex nonlinear function, a chaos wolf optimization algorithm (CWOA) with self-adaptive variable step-size was proposed. The algorithm was based on the swarm intelligence of wolf pack, which fully simulated the predation behavior and prey distribution way of wolves. It possessed three intelligent behaviors such as migration, summons and siege. And the competition rule as "winner-take-all" and the update mechanism as "survival of the fittest" were also the characteristics of the algorithm. Moreover, it combined the strategies of self-adaptive variable step-size search and chaos optimization. The CWOA was utilized in parameter optimization of twelve typical and complex nonlinear functions. And the obtained results were compared with many existing algorithms, including the classical genetic algorithm, the particle swarm optimization algorithm and the leader wolf pack search algorithm. The investigation results indicate that CWOA possess preferable optimization ability. There are advantages in optimization accuracy and convergence rate. Furthermore, it demonstrates high robustness and global searching ability.

Surgery for post-vitrectomy cataract

PubMed Central

Do, Diana V; Gichuhi, Stephen; Vedula, Satyanarayana S; Hawkins, Barbara S

2014-01-01

Background Cataract formation or acceleration can occur after intraocular surgery, especially following vitrectomy, a surgical technique for removing the vitreous which is used in the treatment of disorders that affect the posterior segment of the eye. The underlying problem that led to vitrectomy may limit the benefit from cataract surgery. Objectives The objective of this review was to evaluate the effectiveness and safety of surgery for post-vitrectomy cataract with respect to visual acuity, quality of life, and other outcomes. Search methods We searched CENTRAL (which contains the Cochrane Eyes and Vision Group Trials Register) (The Cochrane Library 2013, Issue 4), Ovid MEDLINE, Ovid MEDLINE in-Process and Other Non-Indexed Citations, Ovid MEDLINE Daily Update, Ovid OLDMED-LINE (January 1946 to May 2013), EMBASE (January 1980 to May 2013, Latin American and Caribbean Health Sciences Literature Database (LILACS) (January 1982 to May 2013), PubMed (January 1946 to May 2013), the metaRegister of Controlled Trials (mRCT) (www.controlled-trials.com), ClinicalTrials.gov (www.clinicaltrial.gov) and the WHO International Clinical Trials Registry Platform (ICTRP) (www.who.int/ictrp/search/en). We did not use any date or language restrictions in the electronic searches for trials. We last searched the electronic databases on 22 May 2013. Selection criteria We planned to include randomized and quasi-randomized controlled trials comparing cataract surgery with no surgery in adult patients who developed cataract following vitrectomy. Data collection and analysis Two authors screened the search results independently according to the standard methodological procedures expected by The Cochrane Collaboration. Main results We found no randomized or quasi-randomized controlled trials comparing cataract surgery with no cataract surgery for patients who developed cataracts following vitrectomy surgery. Authors' conclusions There is no evidence from randomized or quasi-randomized controlled trials on which to base clinical recommendations for surgery for post-vitrectomy cataract. There is a clear need for randomized controlled trials to address this evidence gap. Such trials should stratify participants by their age, the retinal disorder leading to vitrectomy, and the status of the underlying disease process in the contralateral eye. Outcomes assessed in such trials may include gain of vision on the Early Treatment Diabetic Retinopathy Study (ETDRS) scale, quality of life, and adverse events such as posterior capsular rupture. Both short-term (six-month) and long-term (one-year or two-year) outcomes should be examined. PMID:24357418

Distributed Synchronization in Networks of Agent Systems With Nonlinearities and Random Switchings.

PubMed

Tang, Yang; Gao, Huijun; Zou, Wei; Kurths, Jürgen

2013-02-01

In this paper, the distributed synchronization problem of networks of agent systems with controllers and nonlinearities subject to Bernoulli switchings is investigated. Controllers and adaptive updating laws injected in each vertex of networks depend on the state information of its neighborhood. Three sets of Bernoulli stochastic variables are introduced to describe the occurrence probabilities of distributed adaptive controllers, updating laws and nonlinearities, respectively. By the Lyapunov functions method, we show that the distributed synchronization of networks composed of agent systems with multiple randomly occurring nonlinearities, multiple randomly occurring controllers, and multiple randomly occurring updating laws can be achieved in mean square under certain criteria. The conditions derived in this paper can be solved by semi-definite programming. Moreover, by mathematical analysis, we find that the coupling strength, the probabilities of the Bernoulli stochastic variables, and the form of nonlinearities have great impacts on the convergence speed and the terminal control strength. The synchronization criteria and the observed phenomena are demonstrated by several numerical simulation examples. In addition, the advantage of distributed adaptive controllers over conventional adaptive controllers is illustrated.

Balancing Exploration, Uncertainty Representation and Computational Time in Many-Objective Reservoir Policy Optimization

NASA Astrophysics Data System (ADS)

Zatarain-Salazar, J.; Reed, P. M.; Quinn, J.; Giuliani, M.; Castelletti, A.

2016-12-01

As we confront the challenges of managing river basin systems with a large number of reservoirs and increasingly uncertain tradeoffs impacting their operations (due to, e.g. climate change, changing energy markets, population pressures, ecosystem services, etc.), evolutionary many-objective direct policy search (EMODPS) solution strategies will need to address the computational demands associated with simulating more uncertainties and therefore optimizing over increasingly noisy objective evaluations. Diagnostic assessments of state-of-the-art many-objective evolutionary algorithms (MOEAs) to support EMODPS have highlighted that search time (or number of function evaluations) and auto-adaptive search are key features for successful optimization. Furthermore, auto-adaptive MOEA search operators are themselves sensitive to having a sufficient number of function evaluations to learn successful strategies for exploring complex spaces and for escaping from local optima when stagnation is detected. Fortunately, recent parallel developments allow coordinated runs that enhance auto-adaptive algorithmic learning and can handle scalable and reliable search with limited wall-clock time, but at the expense of the total number of function evaluations. In this study, we analyze this tradeoff between parallel coordination and depth of search using different parallelization schemes of the Multi-Master Borg on a many-objective stochastic control problem. We also consider the tradeoff between better representing uncertainty in the stochastic optimization, and simplifying this representation to shorten the function evaluation time and allow for greater search. Our analysis focuses on the Lower Susquehanna River Basin (LSRB) system where multiple competing objectives for hydropower production, urban water supply, recreation and environmental flows need to be balanced. Our results provide guidance for balancing exploration, uncertainty, and computational demands when using the EMODPS framework to discover key tradeoffs within the LSRB system.

Random search optimization based on genetic algorithm and discriminant function

NASA Technical Reports Server (NTRS)

Kiciman, M. O.; Akgul, M.; Erarslanoglu, G.

1990-01-01

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

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.

Searching the Polish Medical Bibliography (Polska Bibliografia Lekarska) for trials.

PubMed

Almerie, Muhammad Qutayba; Matar, Hosam El-Din; Jones, Vicki; Kumar, Ajit; Wright, Judith; Wlostowska, Ewa; Adams, Clive E

2007-12-01

The Polish Medical Bibliography (Polska Bibliografia Lekarska) contains 350 000 records dating from 1979. These records from the fields of medicine, nursing, dentistry, health care systems and preclinical sciences are from nearly 300 biomedical journals published in Poland. We systematically searched the Polish Medical Bibliography Part II (1996-2006) CD-ROM (July 2006) using both English and Polish phrases for randomized trials, manually checked results and, for the trials identified in this way, sought these on medline and embase. Systematic searching identified records of 680 randomized trials from all areas of health care. Nearly 40% of these were not found on either medline or embase. The Polish Medical Bibliography should be of interest to health care information specialists concerned with comprehensive searches for trials.

Adaptive box filters for removal of random noise from digital images

USGS Publications Warehouse

Eliason, E.M.; McEwen, A.S.

1990-01-01

We have developed adaptive box-filtering algorithms to (1) remove random bit errors (pixel values with no relation to the image scene) and (2) smooth noisy data (pixels related to the image scene but with an additive or multiplicative component of noise). For both procedures, we use the standard deviation (??) of those pixels within a local box surrounding each pixel, hence they are adaptive filters. This technique effectively reduces speckle in radar images without eliminating fine details. -from Authors

Comparing cluster-level dynamic treatment regimens using sequential, multiple assignment, randomized trials: Regression estimation and sample size considerations.

PubMed

NeCamp, Timothy; Kilbourne, Amy; Almirall, Daniel

2017-08-01

Cluster-level dynamic treatment regimens can be used to guide sequential treatment decision-making at the cluster level in order to improve outcomes at the individual or patient-level. In a cluster-level dynamic treatment regimen, the treatment is potentially adapted and re-adapted over time based on changes in the cluster that could be impacted by prior intervention, including aggregate measures of the individuals or patients that compose it. Cluster-randomized sequential multiple assignment randomized trials can be used to answer multiple open questions preventing scientists from developing high-quality cluster-level dynamic treatment regimens. In a cluster-randomized sequential multiple assignment randomized trial, sequential randomizations occur at the cluster level and outcomes are observed at the individual level. This manuscript makes two contributions to the design and analysis of cluster-randomized sequential multiple assignment randomized trials. First, a weighted least squares regression approach is proposed for comparing the mean of a patient-level outcome between the cluster-level dynamic treatment regimens embedded in a sequential multiple assignment randomized trial. The regression approach facilitates the use of baseline covariates which is often critical in the analysis of cluster-level trials. Second, sample size calculators are derived for two common cluster-randomized sequential multiple assignment randomized trial designs for use when the primary aim is a between-dynamic treatment regimen comparison of the mean of a continuous patient-level outcome. The methods are motivated by the Adaptive Implementation of Effective Programs Trial which is, to our knowledge, the first-ever cluster-randomized sequential multiple assignment randomized trial in psychiatry.

Basis adaptation and domain decomposition for steady partial differential equations with random coefficients

DOE PAGES

Tipireddy, R.; Stinis, P.; Tartakovsky, A. M.

2017-09-04

In this paper, we present a novel approach for solving steady-state stochastic partial differential equations (PDEs) with high-dimensional random parameter space. The proposed approach combines spatial domain decomposition with basis adaptation for each subdomain. The basis adaptation is used to address the curse of dimensionality by constructing an accurate low-dimensional representation of the stochastic PDE solution (probability density function and/or its leading statistical moments) in each subdomain. Restricting the basis adaptation to a specific subdomain affords finding a locally accurate solution. Then, the solutions from all of the subdomains are stitched together to provide a global solution. We support ourmore » construction with numerical experiments for a steady-state diffusion equation with a random spatially dependent coefficient. Lastly, our results show that highly accurate global solutions can be obtained with significantly reduced computational costs.« less

Basis adaptation and domain decomposition for steady-state partial differential equations with random coefficients

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tipireddy, R.; Stinis, P.; Tartakovsky, A. M.

We present a novel approach for solving steady-state stochastic partial differential equations (PDEs) with high-dimensional random parameter space. The proposed approach combines spatial domain decomposition with basis adaptation for each subdomain. The basis adaptation is used to address the curse of dimensionality by constructing an accurate low-dimensional representation of the stochastic PDE solution (probability density function and/or its leading statistical moments) in each subdomain. Restricting the basis adaptation to a specific subdomain affords finding a locally accurate solution. Then, the solutions from all of the subdomains are stitched together to provide a global solution. We support our construction with numericalmore » experiments for a steady-state diffusion equation with a random spatially dependent coefficient. Our results show that highly accurate global solutions can be obtained with significantly reduced computational costs.« less

Evaluating random search strategies in three mammals from distinct feeding guilds.

PubMed

Auger-Méthé, Marie; Derocher, Andrew E; DeMars, Craig A; Plank, Michael J; Codling, Edward A; Lewis, Mark A

2016-09-01

Searching allows animals to find food, mates, shelter and other resources essential for survival and reproduction and is thus among the most important activities performed by animals. Theory predicts that animals will use random search strategies in highly variable and unpredictable environments. Two prominent models have been suggested for animals searching in sparse and heterogeneous environments: (i) the Lévy walk and (ii) the composite correlated random walk (CCRW) and its associated area-restricted search behaviour. Until recently, it was difficult to differentiate between the movement patterns of these two strategies. Using a new method that assesses whether movement patterns are consistent with these two strategies and two other common random search strategies, we investigated the movement behaviour of three species inhabiting sparse northern environments: woodland caribou (Rangifer tarandus caribou), barren-ground grizzly bear (Ursus arctos) and polar bear (Ursus maritimus). These three species vary widely in their diets and thus allow us to contrast the movement patterns of animals from different feeding guilds. Our results showed that although more traditional methods would have found evidence for the Lévy walk for some individuals, a comparison of the Lévy walk to CCRWs showed stronger support for the latter. While a CCRW was the best model for most individuals, there was a range of support for its absolute fit. A CCRW was sufficient to explain the movement of nearly half of herbivorous caribou and a quarter of omnivorous grizzly bears, but was insufficient to explain the movement of all carnivorous polar bears. Strong evidence for CCRW movement patterns suggests that many individuals may use a multiphasic movement strategy rather than one-behaviour strategies such as the Lévy walk. The fact that the best model was insufficient to describe the movement paths of many individuals suggests that some animals living in sparse environments may use strategies that are more complicated than those described by the standard random search models. Thus, our results indicate a need to develop movement models that incorporate factors such as the perceptual and cognitive capacities of animals. © 2016 The Authors. Journal of Animal Ecology © 2016 British Ecological Society.

When Gravity Fails: Local Search Topology

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

1997-01-01

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

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…

Decision making in family medicine: randomized trial of the effects of the InfoClinique and Trip database search engines.

PubMed

Labrecque, Michel; Ratté, Stéphane; Frémont, Pierre; Cauchon, Michel; Ouellet, Jérôme; Hogg, William; McGowan, Jessie; Gagnon, Marie-Pierre; Njoya, Merlin; Légaré, France

2013-10-01

To compare the ability of users of 2 medical search engines, InfoClinique and the Trip database, to provide correct answers to clinical questions and to explore the perceived effects of the tools on the clinical decision-making process. Randomized trial. Three family medicine units of the family medicine program of the Faculty of Medicine at Laval University in Quebec city, Que. Fifteen second-year family medicine residents. Residents generated 30 structured questions about therapy or preventive treatment (2 questions per resident) based on clinical encounters. Using an Internet platform designed for the trial, each resident answered 20 of these questions (their own 2, plus 18 of the questions formulated by other residents, selected randomly) before and after searching for information with 1 of the 2 search engines. For each question, 5 residents were randomly assigned to begin their search with InfoClinique and 5 with the Trip database. The ability of residents to provide correct answers to clinical questions using the search engines, as determined by third-party evaluation. After answering each question, participants completed a questionnaire to assess their perception of the engine's effect on the decision-making process in clinical practice. Of 300 possible pairs of answers (1 answer before and 1 after the initial search), 254 (85%) were produced by 14 residents. Of these, 132 (52%) and 122 (48%) pairs of answers concerned questions that had been assigned an initial search with InfoClinique and the Trip database, respectively. Both engines produced an important and similar absolute increase in the proportion of correct answers after searching (26% to 62% for InfoClinique, for an increase of 36%; 24% to 63% for the Trip database, for an increase of 39%; P = .68). For all 30 clinical questions, at least 1 resident produced the correct answer after searching with either search engine. The mean (SD) time of the initial search for each question was 23.5 (7.6) minutes with InfoClinique and 22.3 (7.8) minutes with the Trip database (P = .30). Participants' perceptions of each engine's effect on the decision-making process were very positive and similar for both search engines. Family medicine residents' ability to provide correct answers to clinical questions increased dramatically and similarly with the use of both InfoClinique and the Trip database. These tools have strong potential to increase the quality of medical care.

Multivariate classification with random forests for gravitational wave searches of black hole binary coalescence

NASA Astrophysics Data System (ADS)

Baker, Paul T.; Caudill, Sarah; Hodge, Kari A.; Talukder, Dipongkar; Capano, Collin; Cornish, Neil J.

2015-03-01

Searches for gravitational waves produced by coalescing black hole binaries with total masses ≳25 M⊙ use matched filtering with templates of short duration. Non-Gaussian noise bursts in gravitational wave detector data can mimic short signals and limit the sensitivity of these searches. Previous searches have relied on empirically designed statistics incorporating signal-to-noise ratio and signal-based vetoes to separate gravitational wave candidates from noise candidates. We report on sensitivity improvements achieved using a multivariate candidate ranking statistic derived from a supervised machine learning algorithm. We apply the random forest of bagged decision trees technique to two separate searches in the high mass (≳25 M⊙ ) parameter space. For a search which is sensitive to gravitational waves from the inspiral, merger, and ringdown of binary black holes with total mass between 25 M⊙ and 100 M⊙ , we find sensitive volume improvements as high as 70±13%-109±11% when compared to the previously used ranking statistic. For a ringdown-only search which is sensitive to gravitational waves from the resultant perturbed intermediate mass black hole with mass roughly between 10 M⊙ and 600 M⊙ , we find sensitive volume improvements as high as 61±4%-241±12% when compared to the previously used ranking statistic. We also report how sensitivity improvements can differ depending on mass regime, mass ratio, and available data quality information. Finally, we describe the techniques used to tune and train the random forest classifier that can be generalized to its use in other searches for gravitational waves.

Health related quality of life measures in Arabic speaking populations: a systematic review on cross-cultural adaptation and measurement properties.

PubMed

Al Sayah, Fatima; Ishaque, Sana; Lau, Darren; Johnson, Jeffrey A

2013-02-01

This systematic review was conducted to identify generic health related quality of life (HRQL) measures translated into Arabic, and evaluate their cross-cultural adaptation and measurement properties. Six databases were searched, relevant journals were hand searched, and reference lists of included studies were reviewed. Previously established criteria were used to evaluate the cross-cultural adaptation of the identified instruments and their measurement properties. Twenty studies that reported the Arabic translations and adaptations of HRQL measures and/or their measurement properties were included in this review. The identified instruments were SF-36, RAND-36, WHOQOL-Bref, COOP/WONCA charts, EQ-5D, and QLI. Cross-cultural adaptations of all measures were of moderate to good quality, and evaluation of measurement properties was limited due to insufficiency of evidence. Based on cross-cultural adaptation evaluation, each instrument is more applicable to the population for whom it was adapted, and to other Arabic populations of similar culture and language specific idioms. This review facilitates the selection among existing Arabic versions of generic HRQL for use in particular Arabic countries. However, each of the translated versions requires further investigation of measurement properties before more concrete recommendations could be made.

Searching for Survivors through Random Human-Body Movement Outdoors by Continuous-Wave Radar Array

PubMed Central

Liu, Miao; Li, Zhao; Liang, Fulai; Jing, Xijing; Lu, Guohua; Wang, Jianqi

2016-01-01

It is a major challenge to search for survivors after chemical or nuclear leakage or explosions. At present, biological radar can be used to achieve this goal by detecting the survivor’s respiration signal. However, owing to the random posture of an injured person at a rescue site, the radar wave may directly irradiate the person’s head or feet, in which it is difficult to detect the respiration signal. This paper describes a multichannel-based antenna array technology, which forms an omnidirectional detection system via 24-GHz Doppler biological radar, to address the random positioning relative to the antenna of an object to be detected. Furthermore, since the survivors often have random body movement such as struggling and twitching, the slight movements of the body caused by breathing are obscured by these movements. Therefore, a method is proposed to identify random human-body movement by utilizing multichannel information to calculate the background variance of the environment in combination with a constant-false-alarm-rate detector. The conducted outdoor experiments indicate that the system can realize the omnidirectional detection of random human-body movement and distinguish body movement from environmental interference such as movement of leaves and grass. The methods proposed in this paper will be a promising way to search for survivors outdoors. PMID:27073860

Searching for Survivors through Random Human-Body Movement Outdoors by Continuous-Wave Radar Array.

PubMed

Li, Chuantao; Chen, Fuming; Qi, Fugui; Liu, Miao; Li, Zhao; Liang, Fulai; Jing, Xijing; Lu, Guohua; Wang, Jianqi

2016-01-01

It is a major challenge to search for survivors after chemical or nuclear leakage or explosions. At present, biological radar can be used to achieve this goal by detecting the survivor's respiration signal. However, owing to the random posture of an injured person at a rescue site, the radar wave may directly irradiate the person's head or feet, in which it is difficult to detect the respiration signal. This paper describes a multichannel-based antenna array technology, which forms an omnidirectional detection system via 24-GHz Doppler biological radar, to address the random positioning relative to the antenna of an object to be detected. Furthermore, since the survivors often have random body movement such as struggling and twitching, the slight movements of the body caused by breathing are obscured by these movements. Therefore, a method is proposed to identify random human-body movement by utilizing multichannel information to calculate the background variance of the environment in combination with a constant-false-alarm-rate detector. The conducted outdoor experiments indicate that the system can realize the omnidirectional detection of random human-body movement and distinguish body movement from environmental interference such as movement of leaves and grass. The methods proposed in this paper will be a promising way to search for survivors outdoors.

Adaptive adjustment of the randomization ratio using historical control data

PubMed Central

Hobbs, Brian P.; Carlin, Bradley P.; Sargent, Daniel J.

2013-01-01

Background Prospective trial design often occurs in the presence of “acceptable” [1] historical control data. Typically this data is only utilized for treatment comparison in a posteriori retrospective analysis to estimate population-averaged effects in a random-effects meta-analysis. Purpose We propose and investigate an adaptive trial design in the context of an actual randomized controlled colorectal cancer trial. This trial, originally reported by Goldberg et al. [2], succeeded a similar trial reported by Saltz et al. [3], and used a control therapy identical to that tested (and found beneficial) in the Saltz trial. Methods The proposed trial implements an adaptive randomization procedure for allocating patients aimed at balancing total information (concurrent and historical) among the study arms. This is accomplished by assigning more patients to receive the novel therapy in the absence of strong evidence for heterogeneity among the concurrent and historical controls. Allocation probabilities adapt as a function of the effective historical sample size (EHSS) characterizing relative informativeness defined in the context of a piecewise exponential model for evaluating time to disease progression. Commensurate priors [4] are utilized to assess historical and concurrent heterogeneity at interim analyses and to borrow strength from the historical data in the final analysis. The adaptive trial’s frequentist properties are simulated using the actual patient-level historical control data from the Saltz trial and the actual enrollment dates for patients enrolled into the Goldberg trial. Results Assessing concurrent and historical heterogeneity at interim analyses and balancing total information with the adaptive randomization procedure leads to trials that on average assign more new patients to the novel treatment when the historical controls are unbiased or slightly biased compared to the concurrent controls. Large magnitudes of bias lead to approximately equal allocation of patients among the treatment arms. Using the proposed commensurate prior model to borrow strength from the historical data, after balancing total information with the adaptive randomization procedure, provides admissible estimators of the novel treatment effect with desirable bias-variance trade-offs. Limitations Adaptive randomization methods in general are sensitive to population drift and more suitable for trials that initiate with gradual enrollment. Balancing information among study arms in time-to-event analyses is difficult in the presence of informative right-censoring. Conclusions The proposed design could prove important in trials that follow recent evaluations of a control therapy. Efficient use of the historical controls is especially important in contexts where reliance on pre-existing information is unavoidable because the control therapy is exceptionally hazardous, expensive, or the disease is rare. PMID:23690095

Adaptive adjustment of the randomization ratio using historical control data.

PubMed

Hobbs, Brian P; Carlin, Bradley P; Sargent, Daniel J

2013-01-01

Prospective trial design often occurs in the presence of 'acceptable' historical control data. Typically, these data are only utilized for treatment comparison in a posteriori retrospective analysis to estimate population-averaged effects in a random-effects meta-analysis. We propose and investigate an adaptive trial design in the context of an actual randomized controlled colorectal cancer trial. This trial, originally reported by Goldberg et al., succeeded a similar trial reported by Saltz et al., and used a control therapy identical to that tested (and found beneficial) in the Saltz trial. The proposed trial implements an adaptive randomization procedure for allocating patients aimed at balancing total information (concurrent and historical) among the study arms. This is accomplished by assigning more patients to receive the novel therapy in the absence of strong evidence for heterogeneity among the concurrent and historical controls. Allocation probabilities adapt as a function of the effective historical sample size (EHSS), characterizing relative informativeness defined in the context of a piecewise exponential model for evaluating time to disease progression. Commensurate priors are utilized to assess historical and concurrent heterogeneity at interim analyses and to borrow strength from the historical data in the final analysis. The adaptive trial's frequentist properties are simulated using the actual patient-level historical control data from the Saltz trial and the actual enrollment dates for patients enrolled into the Goldberg trial. Assessing concurrent and historical heterogeneity at interim analyses and balancing total information with the adaptive randomization procedure lead to trials that on average assign more new patients to the novel treatment when the historical controls are unbiased or slightly biased compared to the concurrent controls. Large magnitudes of bias lead to approximately equal allocation of patients among the treatment arms. Using the proposed commensurate prior model to borrow strength from the historical data, after balancing total information with the adaptive randomization procedure, provides admissible estimators of the novel treatment effect with desirable bias-variance trade-offs. Adaptive randomization methods in general are sensitive to population drift and more suitable for trials that initiate with gradual enrollment. Balancing information among study arms in time-to-event analyses is difficult in the presence of informative right-censoring. The proposed design could prove important in trials that follow recent evaluations of a control therapy. Efficient use of the historical controls is especially important in contexts where reliance on preexisting information is unavoidable because the control therapy is exceptionally hazardous, expensive, or the disease is rare.

Parameter learning for performance adaptation

NASA Technical Reports Server (NTRS)

Peek, Mark D.; Antsaklis, Panos J.

1990-01-01

A parameter learning method is introduced and used to broaden the region of operability of the adaptive control system of a flexible space antenna. The learning system guides the selection of control parameters in a process leading to optimal system performance. A grid search procedure is used to estimate an initial set of parameter values. The optimization search procedure uses a variation of the Hooke and Jeeves multidimensional search algorithm. The method is applicable to any system where performance depends on a number of adjustable parameters. A mathematical model is not necessary, as the learning system can be used whenever the performance can be measured via simulation or experiment. The results of two experiments, the transient regulation and the command following experiment, are presented.

Method and System for Object Recognition Search

NASA Technical Reports Server (NTRS)

Duong, Tuan A. (Inventor); Duong, Vu A. (Inventor); Stubberud, Allen R. (Inventor)

2012-01-01

A method for object recognition using shape and color features of the object to be recognized. An adaptive architecture is used to recognize and adapt the shape and color features for moving objects to enable object recognition.

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.

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.

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.

A random forest learning assisted "divide and conquer" approach for peptide conformation search.

PubMed

Chen, Xin; Yang, Bing; Lin, Zijing

2018-06-11

Computational determination of peptide conformations is challenging as it is a problem of finding minima in a high-dimensional space. The "divide and conquer" approach is promising for reliably reducing the search space size. A random forest learning model is proposed here to expand the scope of applicability of the "divide and conquer" approach. A random forest classification algorithm is used to characterize the distributions of the backbone φ-ψ units ("words"). A random forest supervised learning model is developed to analyze the combinations of the φ-ψ units ("grammar"). It is found that amino acid residues may be grouped as equivalent "words", while the φ-ψ combinations in low-energy peptide conformations follow a distinct "grammar". The finding of equivalent words empowers the "divide and conquer" method with the flexibility of fragment substitution. The learnt grammar is used to improve the efficiency of the "divide and conquer" method by removing unfavorable φ-ψ combinations without the need of dedicated human effort. The machine learning assisted search method is illustrated by efficiently searching the conformations of GGG/AAA/GGGG/AAAA/GGGGG through assembling the structures of GFG/GFGG. Moreover, the computational cost of the new method is shown to increase rather slowly with the peptide length.

Attributing intentions to random motion engages the posterior superior temporal sulcus.

PubMed

Lee, Su Mei; Gao, Tao; McCarthy, Gregory

2014-01-01

The right posterior superior temporal sulcus (pSTS) is a neural region involved in assessing the goals and intentions underlying the motion of social agents. Recent research has identified visual cues, such as chasing, that trigger animacy detection and intention attribution. When readily available in a visual display, these cues reliably activate the pSTS. Here, using functional magnetic resonance imaging, we examined if attributing intentions to random motion would likewise engage the pSTS. Participants viewed displays of four moving circles and were instructed to search for chasing or mirror-correlated motion. On chasing trials, one circle chased another circle, invoking the percept of an intentional agent; while on correlated motion trials, one circle's motion was mirror reflected by another. On the remaining trials, all circles moved randomly. As expected, pSTS activation was greater when participants searched for chasing vs correlated motion when these cues were present in the displays. Of critical importance, pSTS activation was also greater when participants searched for chasing compared to mirror-correlated motion when the displays in both search conditions were statistically identical random motion. We conclude that pSTS activity associated with intention attribution can be invoked by top-down processes in the absence of reliable visual cues for intentionality.

Application of multivariable search techniques to the optimization of airfoils in a low speed nonlinear inviscid flow field

NASA Technical Reports Server (NTRS)

Hague, D. S.; Merz, A. W.

1975-01-01

Multivariable search techniques are applied to a particular class of airfoil optimization problems. These are the maximization of lift and the minimization of disturbance pressure magnitude in an inviscid nonlinear flow field. A variety of multivariable search techniques contained in an existing nonlinear optimization code, AESOP, are applied to this design problem. These techniques include elementary single parameter perturbation methods, organized search such as steepest-descent, quadratic, and Davidon methods, randomized procedures, and a generalized search acceleration technique. Airfoil design variables are seven in number and define perturbations to the profile of an existing NACA airfoil. The relative efficiency of the techniques are compared. It is shown that elementary one parameter at a time and random techniques compare favorably with organized searches in the class of problems considered. It is also shown that significant reductions in disturbance pressure magnitude can be made while retaining reasonable lift coefficient values at low free stream Mach numbers.

Parallel coding of conjunctions in visual search.

PubMed

Found, A

1998-10-01

Two experiments investigated whether the conjunctive nature of nontarget items influenced search for a conjunction target. Each experiment consisted of two conditions. In both conditions, the target item was a red bar tilted to the right, among white tilted bars and vertical red bars. As well as color and orientation, display items also differed in terms of size. Size was irrelevant to search in that the size of the target varied randomly from trial to trial. In one condition, the size of items correlated with the other attributes of display items (e.g., all red items were big and all white items were small). In the other condition, the size of items varied randomly (i.e., some red items were small and some were big, and some white items were big and some were small). Search was more efficient in the size-correlated condition, consistent with the parallel coding of conjunctions in visual search.

Inclusion of the fitness sharing technique in an evolutionary algorithm to analyze the fitness landscape of the genetic code adaptability.

PubMed

Santos, José; Monteagudo, Ángel

2017-03-27

The canonical code, although prevailing in complex genomes, is not universal. It was shown the canonical genetic code superior robustness compared to random codes, but it is not clearly determined how it evolved towards its current form. The error minimization theory considers the minimization of point mutation adverse effect as the main selection factor in the evolution of the code. We have used simulated evolution in a computer to search for optimized codes, which helps to obtain information about the optimization level of the canonical code in its evolution. A genetic algorithm searches for efficient codes in a fitness landscape that corresponds with the adaptability of possible hypothetical genetic codes. The lower the effects of errors or mutations in the codon bases of a hypothetical code, the more efficient or optimal is that code. The inclusion of the fitness sharing technique in the evolutionary algorithm allows the extent to which the canonical genetic code is in an area corresponding to a deep local minimum to be easily determined, even in the high dimensional spaces considered. The analyses show that the canonical code is not in a deep local minimum and that the fitness landscape is not a multimodal fitness landscape with deep and separated peaks. Moreover, the canonical code is clearly far away from the areas of higher fitness in the landscape. Given the non-presence of deep local minima in the landscape, although the code could evolve and different forces could shape its structure, the fitness landscape nature considered in the error minimization theory does not explain why the canonical code ended its evolution in a location which is not an area of a localized deep minimum of the huge fitness landscape.

Impact of Violation of the Missing-at-Random Assumption on Full-Information Maximum Likelihood Method in Multidimensional Adaptive Testing

ERIC Educational Resources Information Center

Han, Kyung T.; Guo, Fanmin

2014-01-01

The full-information maximum likelihood (FIML) method makes it possible to estimate and analyze structural equation models (SEM) even when data are partially missing, enabling incomplete data to contribute to model estimation. The cornerstone of FIML is the missing-at-random (MAR) assumption. In (unidimensional) computerized adaptive testing…

Objective assessment of image quality. IV. Application to adaptive optics

PubMed Central

Barrett, Harrison H.; Myers, Kyle J.; Devaney, Nicholas; Dainty, Christopher

2008-01-01

The methodology of objective assessment, which defines image quality in terms of the performance of specific observers on specific tasks of interest, is extended to temporal sequences of images with random point spread functions and applied to adaptive imaging in astronomy. The tasks considered include both detection and estimation, and the observers are the optimal linear discriminant (Hotelling observer) and the optimal linear estimator (Wiener). A general theory of first- and second-order spatiotemporal statistics in adaptive optics is developed. It is shown that the covariance matrix can be rigorously decomposed into three terms representing the effect of measurement noise, random point spread function, and random nature of the astronomical scene. Figures of merit are developed, and computational methods are discussed. PMID:17106464

77 FR 37713 - Comment Request for Information Collection for ETA 9162, Random Audit of EUC 2008 Claimants...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-22

... Collection for ETA 9162, Random Audit of EUC 2008 Claimants, Comment Request for Extension Without Change... assessed. Currently, ETA is soliciting comments concerning the collection of data about Random Audit of... describing random audits of the work search provision of Public Law 112-96 (see Section 2141(b)). Random...

Reverse Nearest Neighbor Search on a Protein-Protein Interaction Network to Infer Protein-Disease Associations.

PubMed

Suratanee, Apichat; Plaimas, Kitiporn

2017-01-01

The associations between proteins and diseases are crucial information for investigating pathological mechanisms. However, the number of known and reliable protein-disease associations is quite small. In this study, an analysis framework to infer associations between proteins and diseases was developed based on a large data set of a human protein-protein interaction network integrating an effective network search, namely, the reverse k -nearest neighbor (R k NN) search. The R k NN search was used to identify an impact of a protein on other proteins. Then, associations between proteins and diseases were inferred statistically. The method using the R k NN search yielded a much higher precision than a random selection, standard nearest neighbor search, or when applying the method to a random protein-protein interaction network. All protein-disease pair candidates were verified by a literature search. Supporting evidence for 596 pairs was identified. In addition, cluster analysis of these candidates revealed 10 promising groups of diseases to be further investigated experimentally. This method can be used to identify novel associations to better understand complex relationships between proteins and diseases.

Escalated convergent artificial bee colony

NASA Astrophysics Data System (ADS)

Jadon, Shimpi Singh; Bansal, Jagdish Chand; Tiwari, Ritu

2016-03-01

Artificial bee colony (ABC) optimisation algorithm is a recent, fast and easy-to-implement population-based meta heuristic for optimisation. ABC has been proved a rival algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. The solution search equation of ABC is influenced by a random quantity which helps its search process in exploration at the cost of exploitation. In order to find a fast convergent behaviour of ABC while exploitation capability is maintained, in this paper basic ABC is modified in two ways. First, to improve exploitation capability, two local search strategies, namely classical unidimensional local search and levy flight random walk-based local search are incorporated with ABC. Furthermore, a new solution search strategy, namely stochastic diffusion scout search is proposed and incorporated into the scout bee phase to provide more chance to abandon solution to improve itself. Efficiency of the proposed algorithm is tested on 20 benchmark test functions of different complexities and characteristics. Results are very promising and they prove it to be a competitive algorithm in the field of swarm intelligence-based algorithms.

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

PubMed Central

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments. PMID:24701158

An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints.

PubMed

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.

Perceptions of randomized security schedules.

PubMed

Scurich, Nicholas; John, Richard S

2014-04-01

Security of infrastructure is a major concern. Traditional security schedules are unable to provide omnipresent coverage; consequently, adversaries can exploit predictable vulnerabilities to their advantage. Randomized security schedules, which randomly deploy security measures, overcome these limitations, but public perceptions of such schedules have not been examined. In this experiment, participants were asked to make a choice between attending a venue that employed a traditional (i.e., search everyone) or a random (i.e., a probability of being searched) security schedule. The absolute probability of detecting contraband was manipulated (i.e., 1/10, 1/4, 1/2) but equivalent between the two schedule types. In general, participants were indifferent to either security schedule, regardless of the probability of detection. The randomized schedule was deemed more convenient, but the traditional schedule was considered fairer and safer. There were no differences between traditional and random schedule in terms of perceived effectiveness or deterrence. Policy implications for the implementation and utilization of randomized schedules are discussed. © 2013 Society for Risk Analysis.

A principle of organization which facilitates broad Lamarckian-like adaptations by improvisation.

PubMed

Soen, Yoav; Knafo, Maor; Elgart, Michael

2015-12-02

During the lifetime of an organism, every individual encounters many combinations of diverse changes in the somatic genome, epigenome and microbiome. This gives rise to many novel combinations of internal failures which are unique to each individual. How any individual can tolerate this high load of new, individual-specific scenarios of failure is not clear. While stress-induced plasticity and hidden variation have been proposed as potential mechanisms of tolerance, the main conceptual problem remains unaddressed, namely: how largely non-beneficial random variation can be rapidly and safely organized into net benefits to every individual. We propose an organizational principle which explains how every individual can alleviate a high load of novel stressful scenarios using many random variations in flexible and inherently less harmful traits. Random changes which happen to reduce stress, benefit the organism and decrease the drive for additional changes. This adaptation (termed 'Adaptive Improvisation') can be further enhanced, propagated, stabilized and memorized when beneficial changes reinforce themselves by auto-regulatory mechanisms. This principle implicates stress not only in driving diverse variations in cells tissues and organs, but also in organizing these variations into adaptive outcomes. Specific (but not exclusive) examples include stress reduction by rapid exchange of mobile genetic elements (or exosomes) in unicellular, and rapid changes in the symbiotic microorganisms of animals. In all cases, adaptive changes can be transmitted across generations, allowing rapid improvement and assimilation in a few generations. We provide testable predictions derived from the hypothesis. The hypothesis raises a critical, but thus far overlooked adaptation problem and explains how random variation can self-organize to confer a wide range of individual-specific adaptations beyond the existing outcomes of natural selection. It portrays gene regulation as an inseparable synergy between natural selection and adaptation by improvisation. The latter provides a basis for Lamarckian adaptation that is not limited to a specific mechanism and readily accounts for the remarkable resistance of tumors to treatment.

Climate Change: Resilience and Adaptation in New England (RAINE)

EPA Pesticide Factsheets

This database catalogs vulnerability, resilience and adaptation reports, plans and webpages at the state, regional and community level. It provides links, maps and reports for basic and advanced searches. It includes a comment box for more information.

Adding statistical regularity results in a global slowdown in visual search.

PubMed

Vaskevich, Anna; Luria, Roy

2018-05-01

Current statistical learning theories predict that embedding implicit regularities within a task should further improve online performance, beyond general practice. We challenged this assumption by contrasting performance in a visual search task containing either a consistent-mapping (regularity) condition, a random-mapping condition, or both conditions, mixed. Surprisingly, performance in a random visual search, without any regularity, was better than performance in a mixed design search that contained a beneficial regularity. This result was replicated using different stimuli and different regularities, suggesting that mixing consistent and random conditions leads to an overall slowing down of performance. Relying on the predictive-processing framework, we suggest that this global detrimental effect depends on the validity of the regularity: when its predictive value is low, as it is in the case of a mixed design, reliance on all prior information is reduced, resulting in a general slowdown. Our results suggest that our cognitive system does not maximize speed, but rather continues to gather and implement statistical information at the expense of a possible slowdown in performance. Copyright © 2018 Elsevier B.V. All rights reserved.

Ringed Seal Search for Global Optimization via a Sensitive Search Model

PubMed Central

Saadi, Younes; Yanto, Iwan Tri Riyadi; Herawan, Tutut; Balakrishnan, Vimala; Chiroma, Haruna; Risnumawan, Anhar

2016-01-01

The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global optimization problems. PMID:26790131

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

Assessing Performance Tradeoffs in Undersea Distributed Sensor Networks

DTIC Science & Technology

2006-09-01

time. We refer to this process as track - before - detect (see [5] for a description), since the final determination of a target presence is not made until...expressions for probability of successful search and probability of false search for modeling the track - before - detect process. We then describe a numerical...random manner (randomly sampled from a uniform distribution). II. SENSOR NETWORK PERFORMANCE MODELS We model the process of track - before - detect by

Directional Bias and Pheromone for Discovery and Coverage on Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fink, Glenn A.; Berenhaut, Kenneth S.; Oehmen, Christopher S.

2012-09-11

Natural multi-agent systems often rely on “correlated random walks” (random walks that are biased toward a current heading) to distribute their agents over a space (e.g., for foraging, search, etc.). Our contribution involves creation of a new movement and pheromone model that applies the concept of heading bias in random walks to a multi-agent, digital-ants system designed for cyber-security monitoring. We examine the relative performance effects of both pheromone and heading bias on speed of discovery of a target and search-area coverage in a two-dimensional network layout. We found that heading bias was unexpectedly helpful in reducing search time andmore » that it was more influential than pheromone for improving coverage. We conclude that while pheromone is very important for rapid discovery, heading bias can also greatly improve both performance metrics.« less

Google matrix analysis of directed networks

NASA Astrophysics Data System (ADS)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2015-10-01

In the past decade modern societies have developed enormous communication and social networks. Their classification and information retrieval processing has become a formidable task for the society. Because of the rapid growth of the World Wide Web, and social and communication networks, new mathematical methods have been invented to characterize the properties of these networks in a more detailed and precise way. Various search engines extensively use such methods. It is highly important to develop new tools to classify and rank a massive amount of network information in a way that is adapted to internal network structures and characteristics. This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency using various examples including the World Wide Web, Wikipedia, software architectures, world trade, social and citation networks, brain neural networks, DNA sequences, and Ulam networks. The analytical and numerical matrix methods used in this analysis originate from the fields of Markov chains, quantum chaos, and random matrix theory.

Evolutionary engineering for industrial microbiology.

PubMed

Vanee, Niti; Fisher, Adam B; Fong, Stephen S

2012-01-01

Superficially, evolutionary engineering is a paradoxical field that balances competing interests. In natural settings, evolution iteratively selects and enriches subpopulations that are best adapted to a particular ecological niche using random processes such as genetic mutation. In engineering desired approaches utilize rational prospective design to address targeted problems. When considering details of evolutionary and engineering processes, more commonality can be found. Engineering relies on detailed knowledge of the problem parameters and design properties in order to predict design outcomes that would be an optimized solution. When detailed knowledge of a system is lacking, engineers often employ algorithmic search strategies to identify empirical solutions. Evolution epitomizes this iterative optimization by continuously diversifying design options from a parental design, and then selecting the progeny designs that represent satisfactory solutions. In this chapter, the technique of applying the natural principles of evolution to engineer microbes for industrial applications is discussed to highlight the challenges and principles of evolutionary engineering.

An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

NASA Astrophysics Data System (ADS)

Lin, Geng; Guan, Jian; Feng, Huibin

2018-06-01

The positive influence dominating set problem is a variant of the minimum dominating set problem, and has lots of applications in social networks. It is NP-hard, and receives more and more attention. Various methods have been proposed to solve the positive influence dominating set problem. However, most of the existing work focused on greedy algorithms, and the solution quality needs to be improved. In this paper, we formulate the minimum positive influence dominating set problem as an integer linear programming (ILP), and propose an ILP based memetic algorithm (ILPMA) for solving the problem. The ILPMA integrates a greedy randomized adaptive construction procedure, a crossover operator, a repair operator, and a tabu search procedure. The performance of ILPMA is validated on nine real-world social networks with nodes up to 36,692. The results show that ILPMA significantly improves the solution quality, and is robust.

Combinatorial Methodology for Screening Selectivity in Polymeric Pervaporation Membranes.

PubMed

Godbole, Rutvik V; Ma, Lan; Doerfert, Michael D; Williams, Porsche; Hedden, Ronald C

2015-11-09

Combinatorial methodology is described for rapid screening of selectivity in polymeric pervaporation membrane materials for alcohol-water separations. The screening technique is demonstrated for ethanol-water separation using a model polyacrylate system. The materials studied are cross-linked random copolymers of a hydrophobic comonomer (n-butyl acrylate, B) and a hydrophilic comonomer (2-hydroxyethyl acrylate, H). A matrix of materials is prepared that has orthogonal variations in two key variables, H:B ratio and cross-linker concentration. For mixtures of ethanol and water, equilibrium selectivities and distribution coefficients are obtained by combining swelling measurements with high-throughput HPLC analysis. Based on the screening results, two copolymers are selected for further study as pervaporation membranes to quantify permeability selectivity and the flux of ethanol. The screening methodology described has good potential to accelerate the search for new membrane materials, as it is adaptable to a broad range of polymer chemistries.

An Adaptive Cultural Algorithm with Improved Quantum-behaved Particle Swarm Optimization for Sonar Image Detection.

PubMed

Wang, Xingmei; Hao, Wenqian; Li, Qiming

2017-12-18

This paper proposes an adaptive cultural algorithm with improved quantum-behaved particle swarm optimization (ACA-IQPSO) to detect the underwater sonar image. In the population space, to improve searching ability of particles, iterative times and the fitness value of particles are regarded as factors to adaptively adjust the contraction-expansion coefficient of the quantum-behaved particle swarm optimization algorithm (QPSO). The improved quantum-behaved particle swarm optimization algorithm (IQPSO) can make particles adjust their behaviours according to their quality. In the belief space, a new update strategy is adopted to update cultural individuals according to the idea of the update strategy in shuffled frog leaping algorithm (SFLA). Moreover, to enhance the utilization of information in the population space and belief space, accept function and influence function are redesigned in the new communication protocol. The experimental results show that ACA-IQPSO can obtain good clustering centres according to the grey distribution information of underwater sonar images, and accurately complete underwater objects detection. Compared with other algorithms, the proposed ACA-IQPSO has good effectiveness, excellent adaptability, a powerful searching ability and high convergence efficiency. Meanwhile, the experimental results of the benchmark functions can further demonstrate that the proposed ACA-IQPSO has better searching ability, convergence efficiency and stability.

Multi-INT Complex Event Processing using Approximate, Incremental Graph Pattern Search

DTIC Science & Technology

2012-06-01

graph pattern search and SPARQL queries . Total execution time for 10 executions each of 5 random pattern searches in synthetic data sets...01/11 1000 10000 100000 RDF triples Time (secs) 10 20 Graph pattern algorithm SPARQL queries Initial Performance Comparisons 09/18/11 2011 Thrust Area

Search and Seizure in the Schools

ERIC Educational Resources Information Center

Staros, Kari; Williams, Charles F.

2007-01-01

The Fourth Amendment to the U.S. Constitution protects the people of the United States from unreasonable searches and seizures. On first reading, these protections seem clearly defined. The amendment was meant to protect Americans from the kinds of random searches and seizures that the colonists experienced under British colonial rule. Under…

The effect of chlorogenic acid on blood pressure: a systematic review and meta-analysis of randomized clinical trials.

PubMed

Onakpoya, I J; Spencer, E A; Thompson, M J; Heneghan, C J

2015-02-01

Several dietary supplements are currently marketed for management of hypertension, but the evidence for effectiveness is conflicting. Our objective was to critically appraise and evaluate the evidence for the effectiveness of chlorogenic acids (CGAs) on blood pressure, using data from published randomized clinical trials (RCTs). Electronic searches were conducted in Medline, Embase, Amed, Cinahl and The Cochrane Library. We also hand-searched the bibliographies of all retrieved articles. Two reviewers independently determined the eligibility of studies and extracted the data. The reporting quality of all included studies was assessed by the use of a quality assessment checklist adapted from the Consolidated Standard of Reporting Trials Statement. Disagreements were resolved through discussion. Seven eligible studies were identified, and five including 364 participants were included. There were variations in the reporting quality of the included RCTs. Meta-analysis revealed a statistically significant reduction in systolic blood pressure in favour of CGA (mean difference (MD): -4.31 mm Hg; 95% confidence interval (CI): -5.60 to -3.01; I(2)=65%; P<0.00001). Meta-analysis also showed a significant reduction in diastolic blood pressure favouring CGA (MD: -3.68 mm Hg; 95% CI: -3.91 to -3.45; I(2)=97%; P<0.00001). All studies reported no adverse events. In conclusion, the evidence from published RCTs suggests that CGA intake causes statistically significant reductions in systolic and diastolic blood pressures. The size of the effect is moderate. Few clinical trials have been conducted; they vary in design and methodology and are confined to Asian populations and funded by CGA manufacturers. Large independent trials evaluating the effects of CGA on blood pressure are warranted.

Resilience in Vulnerable Populations With Type 2 Diabetes Mellitus and Hypertension: A Systematic Review and Meta-analysis.

PubMed

Pesantes, M Amalia; Lazo-Porras, María; Abu Dabrh, Abd Moain; Ávila-Ramírez, Jaime R; Caycho, María; Villamonte, Georgina Y; Sánchez-Pérez, Grecia P; Málaga, Germán; Bernabé-Ortiz, Antonio; Miranda, J Jaime

2015-09-01

Patients with chronic conditions and limited access to health care experience stressful challenges resulting from the burden of managing both their conditions and their daily life demands. Resilience provides a mechanism of adapting to stressful experiences. We conducted a systematic review and meta-analysis to synthesize the evidence about interventions to enhance resiliency in managing hypertension or type 2 diabetes in vulnerable populations and to assess the efficacy of these interventions on clinical outcomes. We searched multiple databases from early inception through February 2015 including randomized controlled trials that enrolled patients with type 2 diabetes or hypertension. All interventions that targeted resilience in vulnerable populations were included. Data were synthesized to describe the characteristics and efficacy of resiliency interventions. We pooled the total effects by calculating standardized mean difference using the random-effects model. The final search yielded 17 studies. All studies were conducted in the United States and generally targeted minority participants. Resiliency interventions used diverse strategies; discussion groups or workshops were the most common approach. Interventions aimed at enhancing the resiliency of patients from vulnerable groups are diverse. Outcomes were not fully conclusive. There was some evidence that resiliency interventions had a positive effect on hemoglobin A1C levels but not blood pressure. The incorporation of resiliency-oriented interventions into the arsenal of preventing and managing chronic conditions appears to be an opportunity that remains to be better investigated and exploited, and there is need to pursue further understanding of the core components of any intervention that claims to enhance resilience. Copyright © 2015 Canadian Cardiovascular Society. Published by Elsevier Inc. All rights reserved.

‘Dignity therapy’, a promising intervention in palliative care: A comprehensive systematic literature review

PubMed Central

Martínez, Marina; Arantzamendi, María; Belar, Alazne; Carrasco, José Miguel; Carvajal, Ana; Rullán, María; Centeno, Carlos

2016-01-01

Background: Dignity therapy is psychotherapy to relieve psychological and existential distress in patients at the end of life. Little is known about its effect. Aim: To analyse the outcomes of dignity therapy in patients with advanced life-threatening diseases. Design: Systematic review was conducted. Three authors extracted data of the articles and evaluated quality using Critical Appraisal Skills Programme. Data were synthesized, considering study objectives. Data sources: PubMed, CINAHL, Cochrane Library and PsycINFO. The years searched were 2002 (year of dignity therapy development) to January 2016. ‘Dignity therapy’ was used as search term. Studies with patients with advanced life-threatening diseases were included. Results: Of 121 studies, 28 were included. Quality of studies is high. Results were grouped into effectiveness, satisfaction, suitability and feasibility, and adaptability to different diseases and cultures. Two of five randomized control trials applied dignity therapy to patients with high levels of baseline psychological distress. One showed statistically significant decrease on patients’ anxiety and depression scores over time. The other showed statistical decrease on anxiety scores pre–post dignity therapy, not on depression. Nonrandomized studies suggested statistically significant improvements in existential and psychosocial measurements. Patients, relatives and professionals perceived it improved end-of-life experience. Conclusion: Evidence suggests that dignity therapy is beneficial. One randomized controlled trial with patients with high levels of psychological distress shows DT efficacy in anxiety and depression scores. Other design studies report beneficial outcomes in terms of end-of-life experience. Further research should understand how dignity therapy functions to establish a means for measuring its impact and assessing whether high level of distress patients can benefit most from this therapy. PMID:27566756

Effects of physical randomness training on virtual and laboratory golf putting performance in novices.

PubMed

Pataky, T C; Lamb, P F

2018-06-01

External randomness exists in all sports but is perhaps most obvious in golf putting where robotic putters sink only 80% of 5 m putts due to unpredictable ball-green dynamics. The purpose of this study was to test whether physical randomness training can improve putting performance in novices. A virtual random-physics golf-putting game was developed based on controlled ball-roll data. Thirty-two subjects were assigned a unique randomness gain (RG) ranging from 0.1 to 2.0-times real-world randomness. Putter face kinematics were measured in 5 m laboratory putts before and after five days of virtual training. Performance was quantified using putt success rate and "miss-adjustment correlation" (MAC), the correlation between left-right miss magnitude and subsequent right-left kinematic adjustments. Results showed no RG-success correlation (r = -0.066, p = 0.719) but mildly stronger correlations with MAC for face angle (r = -0.168, p = 0.358) and clubhead path (r = -0.302, p = 0.093). The strongest RG-MAC correlation was observed during virtual training (r = -0.692, p < 0.001). These results suggest that subjects quickly adapt to physical randomness in virtual training, and also that this learning may weakly transfer to real golf putting kinematics. Adaptation to external physical randomness during virtual training may therefore help golfers adapt to external randomness in real-world environments.

Search Algorithms as a Framework for the Optimization of Drug Combinations

PubMed Central

Coquin, Laurence; Schofield, Jennifer; Feala, Jacob D.; Reed, John C.; McCulloch, Andrew D.; Paternostro, Giovanni

2008-01-01

Combination therapies are often needed for effective clinical outcomes in the management of complex diseases, but presently they are generally based on empirical clinical experience. Here we suggest a novel application of search algorithms—originally developed for digital communication—modified to optimize combinations of therapeutic interventions. In biological experiments measuring the restoration of the decline with age in heart function and exercise capacity in Drosophila melanogaster, we found that search algorithms correctly identified optimal combinations of four drugs using only one-third of the tests performed in a fully factorial search. In experiments identifying combinations of three doses of up to six drugs for selective killing of human cancer cells, search algorithms resulted in a highly significant enrichment of selective combinations compared with random searches. In simulations using a network model of cell death, we found that the search algorithms identified the optimal combinations of 6–9 interventions in 80–90% of tests, compared with 15–30% for an equivalent random search. These findings suggest that modified search algorithms from information theory have the potential to enhance the discovery of novel therapeutic drug combinations. This report also helps to frame a biomedical problem that will benefit from an interdisciplinary effort and suggests a general strategy for its solution. PMID:19112483

Study of genetic direct search algorithms for function optimization

NASA Technical Reports Server (NTRS)

Zeigler, B. P.

1974-01-01

The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.

Metallic VS2 Monolayer Polytypes as Potential Sodium-Ion Battery Anode via ab Initio Random Structure Searching.

PubMed

Putungan, Darwin Barayang; Lin, Shi-Hsin; Kuo, Jer-Lai

2016-07-27

We systematically investigated the potential of single-layer VS2 polytypes as Na-battery anode materials via density functional theory calculations. We found that sodiation tends to inhibit the 1H-to-1T structural phase transition, in contrast to lithiation-induced transition on monolayer MoS2. Thus, VS2 can have better structural stability in the cycles of charging and discharging. Diffussion of Na atom was found to be very fast on both polytypes, with very small diffusion barriers of 0.085 eV (1H) and 0.088 eV (1T). Ab initio random structure searching was performed in order to explore stable configurations of Na on VS2. Our search found that both the V top and the hexagonal center sites are preferred adsorption sites for Na, with the 1H phase showing a relatively stronger binding. Notably, our random structures search revealed that Na clusters can form as a stacked second layer at full Na concentration, which is not reported in earlier works wherein uniform, single-layer Na adsorption phases were assumed. With reasonably high specific energy capacity (232.91 and 116.45 mAh/g for 1H and 1T phases, respectively) and open-circuit voltage (1.30 and 1.42 V for 1H and 1T phases, respectively), VS2 is a promising alternative material for Na-ion battery anodes with great structural sturdiness. Finally, we have shown the capability of the ab initio random structure searching in the assessment of potential materials for energy storage applications.

Hyper-heuristics with low level parameter adaptation.

PubMed

Ren, Zhilei; Jiang, He; Xuan, Jifeng; Luo, Zhongxuan

2012-01-01

Recent years have witnessed the great success of hyper-heuristics applying to numerous real-world applications. Hyper-heuristics raise the generality of search methodologies by manipulating a set of low level heuristics (LLHs) to solve problems, and aim to automate the algorithm design process. However, those LLHs are usually parameterized, which may contradict the domain independent motivation of hyper-heuristics. In this paper, we show how to automatically maintain low level parameters (LLPs) using a hyper-heuristic with LLP adaptation (AD-HH), and exemplify the feasibility of AD-HH by adaptively maintaining the LLPs for two hyper-heuristic models. Furthermore, aiming at tackling the search space expansion due to the LLP adaptation, we apply a heuristic space reduction (SAR) mechanism to improve the AD-HH framework. The integration of the LLP adaptation and the SAR mechanism is able to explore the heuristic space more effectively and efficiently. To evaluate the performance of the proposed algorithms, we choose the p-median problem as a case study. The empirical results show that with the adaptation of the LLPs and the SAR mechanism, the proposed algorithms are able to achieve competitive results over the three heterogeneous classes of benchmark instances.

Systematic Review of Psychosocial Interventions for People With Spinal Cord Injury During Inpatient Rehabilitation: Implications for Evidence-Based Practice.

PubMed

Li, Yan; Bressington, Daniel; Chien, Wai Tong

2017-12-01

The bio-psychosocial model of spinal cord injury (SCI) highlights that psychosocial care is of equal importance as physical rehabilitation, and should be offered in the earlier stages of inpatient rehabilitation. This systematic review aimed to identify interventional research regarding psychosocial care for people with SCI during inpatient rehabilitation and synthesize the evidence of the effects and characteristics of these studies. A systematic search of relevant literature published between 1985 to July 2016 was conducted with six databases (Scopus, MEDLINE, CINAHL, Science Citation Index Expanded, PsycINFO, and the China Academic Journal Full-text Database). Reference lists of the identified articles were reviewed to find additional relevant articles. A total of four randomized controlled trials and seven non-randomized controlled trials were included in this review. The interventions focused on specialized types of SCI population with relatively high levels of psychological distress, pain or pressure ulcers. Studies reported some varied or inconsistent improvements in participants' cognitive appraisal, psychosocial adaptation or mental health but there were no significant effects on their coping ability. Due to the heterogeneity of the studies, findings were synthesized narratively without conducting meta-analysis. This review found promising evidence that approaches to psychosocial care for people with SCI can improve their cognitive appraisal and psychosocial adaptation. Significant methodological limitations weakened study findings. Additionally, because studies were conducted in only a few developed countries with subgroups of patients having specific illness characteristics or severity, their generalizability to the wider SCI population is uncertain. Therefore, future research should adopt more robust study designs to test psychosocial interventions for SCI patients with different socio-cultural backgrounds and psychological adjustment conditions in the early stages of rehabilitation. © 2017 Sigma Theta Tau International.

SearchGUI: A Highly Adaptable Common Interface for Proteomics Search and de Novo Engines.

PubMed

Barsnes, Harald; Vaudel, Marc

2018-05-25

Mass-spectrometry-based proteomics has become the standard approach for identifying and quantifying proteins. A vital step consists of analyzing experimentally generated mass spectra to identify the underlying peptide sequences for later mapping to the originating proteins. We here present the latest developments in SearchGUI, a common open-source interface for the most frequently used freely available proteomics search and de novo engines that has evolved into a central component in numerous bioinformatics workflows.

Comparison of genetic algorithm methods for fuel management optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

DeChaine, M.D.; Feltus, M.A.

1995-12-31

The CIGARO system was developed for genetic algorithm fuel management optimization. Tests are performed to find the best fuel location swap mutation operator probability and to compare genetic algorithm to a truly random search method. Tests showed the fuel swap probability should be between 0% and 10%, and a 50% definitely hampered the optimization. The genetic algorithm performed significantly better than the random search method, which did not even satisfy the peak normalized power constraint.

Model Checking with Multi-Threaded IC3 Portfolios

DTIC Science & Technology

2015-01-15

different runs varies randomly depending on the thread interleaving. The use of a portfolio of solvers to maximize the likelihood of a quick solution is...empirically show (cf. Sec. 5.2) that the predictions based on this formula have high accuracy. Note that each solver in the portfolio potentially searches...speedup of over 300. We also show that widening the proof search of ic3 by randomizing its SAT solver is not as effective as paral- lelization

Adrenaline auto-injectors for the treatment of anaphylaxis with and without cardiovascular collapse in the community.

PubMed

Sheikh, Aziz; Simons, F Estelle R; Barbour, Victoria; Worth, Allison

2012-08-15

Anaphylaxis is a serious hypersensitivity reaction that is rapid in onset and may cause death. Adrenaline (epinephrine) auto-injectors are recommended as the initial, potentially life-saving treatment of choice for anaphylaxis in the community, but they are not universally available and have limitations in their use. To assess the effectiveness of adrenaline (epinephrine) auto-injectors in relieving respiratory, cardiovascular, and other symptoms during episodes of anaphylaxis that occur in the community. We searched the Cochrane Central Register of Controlled Trials (CENTRAL) (The Cochrane Library 2012, Issue 1), MEDLINE (Ovid SP) (1950 to January 2012), EMBASE (Ovid SP) (1980 to January 2012 ), CINAHL (EBSCO host) (1982 to January 2012 ), AMED (EBSCO host) (1985 to January 2012 ), LILACS, (BIREME) (1980 to January 2012 ), ISI Web of Science (1950 to January 2012 ). We adapted our search terms for other databases. We also searched websites listing on-going trials: the World Health Organization International Clinical Trials Registry Platform, the UK Clinical Research Network Study Portfolio, and the meta Register of Controlled Trials; and contacted pharmaceutical companies who manufacture adrenaline auto-injectors in an attempt to locate unpublished material. Randomized and quasi-randomized controlled trials comparing auto-injector administration of adrenaline with any control including no intervention, placebo, or other adrenergic agonists were eligible for inclusion. Two authors independently assessed articles for inclusion. None of the 1328 studies that were identified satisfied the inclusion criteria. Based on this review, we cannot make any new recommendations on the effectiveness of adrenaline auto-injectors for the treatment of anaphylaxis. Although randomized, double-blind, placebo-controlled clinical trials of high methodological quality are necessary to define the true extent of benefits from the administration of adrenaline in anaphylaxis via an auto-injector, such trials are unlikely to be performed in individuals experiencing anaphylaxis because of ethical concerns associated with randomization to placebo. There is, however, a need to consider trials in which, for example, auto-injectors of different doses of adrenaline and differing devices are compared in order to provide greater clarity on the dose and device of choice. Such trials would be practically challenging to conduct. In the absence of appropriate trials, we recommend that adrenaline administration by auto-injector should still be regarded as the most effective first-line treatment for the management of anaphylaxis in the community. In countries where auto-injectors are not commonly used, it may be possible to conduct trials to compare administration of adrenaline via auto-injector with adrenaline administered by syringe and ampoule, or comparing the effectiveness of two different types of auto-injector.

Reconfiguration and Search of Social Networks

PubMed Central

Zhang, Lianming; Peng, Aoyuan

2013-01-01

Social networks tend to exhibit some topological characteristics different from regular networks and random networks, such as shorter average path length and higher clustering coefficient, and the node degree of the majority of social networks obeys exponential distribution. Based on the topological characteristics of the real social networks, a new network model which suits to portray the structure of social networks was proposed, and the characteristic parameters of the model were calculated. To find out the relationship between two people in the social network, and using the local information of the social network and the parallel mechanism, a hybrid search strategy based on k-walker random and a high degree was proposed. Simulation results show that the strategy can significantly reduce the average number of search steps, so as to effectively improve the search speed and efficiency. PMID:24574861

Evolutionary pattern search algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

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 experimentalmore » 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.« less

[A magnetic therapy apparatus with an adaptable electromagnetic spectrum for the treatment of prostatitis and gynecopathies].

PubMed

Kuz'min, A A; Meshkovskiĭ, D V; Filist, S A

2008-01-01

Problems of engineering and algorithm development of magnetic therapy apparatuses with pseudo-random radiation spectrum within the audio range for treatment of prostatitis and gynecopathies are considered. A typical design based on a PIC 16F microcontroller is suggested. It includes a keyboard, LCD indicator, audio amplifier, inducer, and software units. The problem of pseudo-random signal generation within the audio range is considered. A series of rectangular pulses is generated on a random-length interval on the basis of a three-component random vector. This series provides the required spectral characteristics of the therapeutic magnetic field and their adaptation to the therapeutic conditions and individual features of the patient.

A literature review of applied adaptive design methodology within the field of oncology in randomised controlled trials and a proposed extension to the CONSORT guidelines.

PubMed

Mistry, Pankaj; Dunn, Janet A; Marshall, Andrea

2017-07-18

The application of adaptive design methodology within a clinical trial setting is becoming increasingly popular. However the application of these methods within trials is not being reported as adaptive designs hence making it more difficult to capture the emerging use of these designs. Within this review, we aim to understand how adaptive design methodology is being reported, whether these methods are explicitly stated as an 'adaptive design' or if it has to be inferred and to identify whether these methods are applied prospectively or concurrently. Three databases; Embase, Ovid and PubMed were chosen to conduct the literature search. The inclusion criteria for the review were phase II, phase III and phase II/III randomised controlled trials within the field of Oncology that published trial results in 2015. A variety of search terms related to adaptive designs were used. A total of 734 results were identified, after screening 54 were eligible. Adaptive designs were more commonly applied in phase III confirmatory trials. The majority of the papers performed an interim analysis, which included some sort of stopping criteria. Additionally only two papers explicitly stated the term 'adaptive design' and therefore for most of the papers, it had to be inferred that adaptive methods was applied. Sixty-five applications of adaptive design methods were applied, from which the most common method was an adaptation using group sequential methods. This review indicated that the reporting of adaptive design methodology within clinical trials needs improving. The proposed extension to the current CONSORT 2010 guidelines could help capture adaptive design methods. Furthermore provide an essential aid to those involved with clinical trials.

Immediate and Short-Term Effects of the 5th Grade Version of the "keepin' it REAL" Substance Use Prevention Intervention

ERIC Educational Resources Information Center

Hecht, Michael L.; Elek, Elvira; Wagstaff, David A.; Kam, Jennifer A.; Marsiglia, Flavio; Dustman, Patricia; Reeves, Leslie; Harthun, Mary

2009-01-01

This study assessed the immediate and short-term outcomes of adapting a culturally-grounded middle school program, "keepin' it REAL", for elementary school students. After curriculum adaptation, 10 schools were randomly assigned to the intervention in 5th grade with follow-up boosters in 6th grade; 13 schools were randomly assigned to the control…

A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints

NASA Astrophysics Data System (ADS)

Guo, Peng; Cheng, Wenming; Wang, Yi

2014-10-01

The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel's service time is minimized. A number of heuristics or meta-heuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimization (GEO) is adapted to solve the QCSP with respect to various interference constraints. The resulting GEO is termed the modified GEO. A randomized searching method for neighbouring task-to-QC assignments to an incumbent task-to-QC assignment is developed in executing the modified GEO. In addition, a unidirectional search decoding scheme is employed to transform a task-to-QC assignment to an active quay crane schedule. The effectiveness of the developed GEO is tested on a suite of benchmark problems introduced by K.H. Kim and Y.M. Park in 2004 (European Journal of Operational Research, Vol. 156, No. 3). Compared with other well-known existing approaches, the experiment results show that the proposed modified GEO is capable of obtaining the optimal or near-optimal solution in a reasonable time, especially for large-sized problems.

Contextual Cueing in Multiconjunction Visual Search Is Dependent on Color- and Configuration-Based Intertrial Contingencies

ERIC Educational Resources Information Center

Geyer, Thomas; Shi, Zhuanghua; Muller, Hermann J.

2010-01-01

Three experiments examined memory-based guidance of visual search using a modified version of the contextual-cueing paradigm (Jiang & Chun, 2001). The target, if present, was a conjunction of color and orientation, with target (and distractor) features randomly varying across trials (multiconjunction search). Under these conditions, reaction times…

Central and Peripheral Vision Loss Differentially Affects Contextual Cueing in Visual Search

ERIC Educational Resources Information Center

Geringswald, Franziska; Pollmann, Stefan

2015-01-01

Visual search for targets in repeated displays is more efficient than search for the same targets in random distractor layouts. Previous work has shown that this contextual cueing is severely impaired under central vision loss. Here, we investigated whether central vision loss, simulated with gaze-contingent displays, prevents the incidental…

An Adaptive Cross-Architecture Combination Method for Graph Traversal

DOE Office of Scientific and Technical Information (OSTI.GOV)

You, Yang; Song, Shuaiwen; Kerbyson, Darren J.

2014-06-18

Breadth-First Search (BFS) is widely used in many real-world applications including computational biology, social networks, and electronic design automation. The combination method, using both top-down and bottom-up techniques, is the most effective BFS approach. However, current combination methods rely on trial-and-error and exhaustive search to locate the optimal switching point, which may cause significant runtime overhead. To solve this problem, we design an adaptive method based on regression analysis to predict an optimal switching point for the combination method at runtime within less than 0.1% of the BFS execution time.

D Semantic Labeling of ALS Data Based on Domain Adaption by Transferring and Fusing Random Forest Models

NASA Astrophysics Data System (ADS)

Wu, J.; Yao, W.; Zhang, J.; Li, Y.

2018-04-01

Labeling 3D point cloud data with traditional supervised learning methods requires considerable labelled samples, the collection of which is cost and time expensive. This work focuses on adopting domain adaption concept to transfer existing trained random forest classifiers (based on source domain) to new data scenes (target domain), which aims at reducing the dependence of accurate 3D semantic labeling in point clouds on training samples from the new data scene. Firstly, two random forest classifiers were firstly trained with existing samples previously collected for other data. They were different from each other by using two different decision tree construction algorithms: C4.5 with information gain ratio and CART with Gini index. Secondly, four random forest classifiers adapted to the target domain are derived through transferring each tree in the source random forest models with two types of operations: structure expansion and reduction-SER and structure transfer-STRUT. Finally, points in target domain are labelled by fusing the four newly derived random forest classifiers using weights of evidence based fusion model. To validate our method, experimental analysis was conducted using 3 datasets: one is used as the source domain data (Vaihingen data for 3D Semantic Labelling); another two are used as the target domain data from two cities in China (Jinmen city and Dunhuang city). Overall accuracies of 85.5 % and 83.3 % for 3D labelling were achieved for Jinmen city and Dunhuang city data respectively, with only 1/3 newly labelled samples compared to the cases without domain adaption.

Inference-Based Similarity Search in Randomized Montgomery Domains for Privacy-Preserving Biometric Identification.

PubMed

Wang, Yi; Wan, Jianwu; Guo, Jun; Cheung, Yiu-Ming; Yuen, Pong C; Yi Wang; Jianwu Wan; Jun Guo; Yiu-Ming Cheung; Yuen, Pong C; Cheung, Yiu-Ming; Guo, Jun; Yuen, Pong C; Wan, Jianwu; Wang, Yi

2018-07-01

Similarity search is essential to many important applications and often involves searching at scale on high-dimensional data based on their similarity to a query. In biometric applications, recent vulnerability studies have shown that adversarial machine learning can compromise biometric recognition systems by exploiting the biometric similarity information. Existing methods for biometric privacy protection are in general based on pairwise matching of secured biometric templates and have inherent limitations in search efficiency and scalability. In this paper, we propose an inference-based framework for privacy-preserving similarity search in Hamming space. Our approach builds on an obfuscated distance measure that can conceal Hamming distance in a dynamic interval. Such a mechanism enables us to systematically design statistically reliable methods for retrieving most likely candidates without knowing the exact distance values. We further propose to apply Montgomery multiplication for generating search indexes that can withstand adversarial similarity analysis, and show that information leakage in randomized Montgomery domains can be made negligibly small. Our experiments on public biometric datasets demonstrate that the inference-based approach can achieve a search accuracy close to the best performance possible with secure computation methods, but the associated cost is reduced by orders of magnitude compared to cryptographic primitives.

Hybrid foraging search: Searching for multiple instances of multiple types of target.

PubMed

Wolfe, Jeremy M; Aizenman, Avigael M; Boettcher, Sage E P; Cain, Matthew S

2016-02-01

This paper introduces the "hybrid foraging" paradigm. In typical visual search tasks, observers search for one instance of one target among distractors. In hybrid search, observers search through visual displays for one instance of any of several types of target held in memory. In foraging search, observers collect multiple instances of a single target type from visual displays. Combining these paradigms, in hybrid foraging tasks observers search visual displays for multiple instances of any of several types of target (as might be the case in searching the kitchen for dinner ingredients or an X-ray for different pathologies). In the present experiment, observers held 8-64 target objects in memory. They viewed displays of 60-105 randomly moving photographs of objects and used the computer mouse to collect multiple targets before choosing to move to the next display. Rather than selecting at random among available targets, observers tended to collect items in runs of one target type. Reaction time (RT) data indicate searching again for the same item is more efficient than searching for any other targets, held in memory. Observers were trying to maximize collection rate. As a result, and consistent with optimal foraging theory, they tended to leave 25-33% of targets uncollected when moving to the next screen/patch. The pattern of RTs shows that while observers were collecting a target item, they had already begun searching memory and the visual display for additional targets, making the hybrid foraging task a useful way to investigate the interaction of visual and memory search. Copyright © 2015 Elsevier Ltd. All rights reserved.

Hybrid foraging search: Searching for multiple instances of multiple types of target

PubMed Central

Wolfe, Jeremy M.; Aizenman, Avigael M.; Boettcher, Sage E.P.; Cain, Matthew S.

2016-01-01

This paper introduces the “hybrid foraging” paradigm. In typical visual search tasks, observers search for one instance of one target among distractors. In hybrid search, observers search through visual displays for one instance of any of several types of target held in memory. In foraging search, observers collect multiple instances of a single target type from visual displays. Combining these paradigms, in hybrid foraging tasks observers search visual displays for multiple instances of any of several types of target (as might be the case in searching the kitchen for dinner ingredients or an X-ray for different pathologies). In the present experiment, observers held 8–64 targets objects in memory. They viewed displays of 60–105 randomly moving photographs of objects and used the computer mouse to collect multiple targets before choosing to move to the next display. Rather than selecting at random among available targets, observers tended to collect items in runs of one target type. Reaction time (RT) data indicate searching again for the same item is more efficient than searching for any other targets, held in memory. Observers were trying to maximize collection rate. As a result, and consistent with optimal foraging theory, they tended to leave 25–33% of targets uncollected when moving to the next screen/patch. The pattern of RTs shows that while observers were collecting a target item, they had already begun searching memory and the visual display for additional targets, making the hybrid foraging task a useful way to investigate the interaction of visual and memory search. PMID:26731644

Corticosteroids for ocular toxoplasmosis

PubMed Central

Jasper, Smitha; Vedula, Satyanarayana S; John, Sheeja S; Horo, Saban; Sepah, Yasir J; Nguyen, Quan Dong

2014-01-01

Background Ocular infestation with Toxoplasma gondii, a parasite, may result in inflammation in the retina, choroid, and uvea and consequently lead to complications such as glaucoma, cataract, and posterior synechiae. Objectives The objective of this systematic review was to assess the effects of adjunctive use of corticosteroids for ocular toxoplasmosis. Search methods We searched CENTRAL (which contains the Cochrane Eyes and Vision Group Trials Register) (The Cochrane Library 2012, Issue 9), Ovid MEDLINE, Ovid MEDLINE In-Process and Other Non-Indexed Citations, Ovid MEDLINE Daily, Ovid OLDMEDLINE, (January 1950 to October 2012), EMBASE (January 1980 to October 2012), Latin American and Caribbean Literature on Health Sciences (LILACS) (January 1982 to October 2012), the metaRegister of Controlled Trials (mRCT) (www.controlled-trials.com), ClinicalTrials.gov (www.clinicaltrials.gov) and the WHO International Clinical Trials Registry Platform (ICTRP) (www.who.int/ictrp/search/en). We searched the reference lists of included studies for any additional studies not identified by the electronic searches. We did not use any date or language restrictions in the electronic searches for trials. We last searched the electronic databases on 11 October 2012. Selection criteria We planned to include randomized and quasi-randomized controlled trials. Eligible trials would have enrolled participants of any age who were immunocompetent and were diagnosed with active ocular toxoplasmosis. Included trials would have compared anti-parasitic therapy plus corticosteroids versus anti-parasitic therapy alone, or different doses or times of initiation of corticosteroids. Data collection and analysis Two authors independently screened titles and abstracts retrieved from the electronic searches. We retrieved full-text articles of studies categorized as ‘unsure’ or ‘include’ after review of the abstracts. Two authors independently reviewed each full-text article. Discrepancies were resolved through discussion. Main results The electronic searches retrieved 368 titles and abstracts. We reviewed 20 full-text articles. We identified no trials eligible for inclusion in this systematic review. Authors' conclusions Although research has identified wide variation in practices regarding use of corticosteroids, our systematic review did not identify evidence from randomized controlled trials for the role of corticosteroids in the management of ocular toxoplasmosis. Several questions remain unanswered by well-conducted randomized trials in this context, including whether use of corticosteroids is more effective than use of anti-parasitic therapy alone, when corticosteroids should be initiated in the treatment regimen (early versus late course of treatment), and which dosage and duration of steroid use is best. These questions are easily amenable to research using a randomized controlled design and they are ethical due to the absence of evidence to support or discourage use of corticosteroids for this condition. The question of foremost importance, however, is whether they should be used as adjunct therapy (that is, additional) to anti-parasitic agents. PMID:23633342

Visual search for arbitrary objects in real scenes

PubMed Central

Alvarez, George A.; Rosenholtz, Ruth; Kuzmova, Yoana I.; Sherman, Ashley M.

2011-01-01

How efficient is visual search in real scenes? In searches for targets among arrays of randomly placed distractors, efficiency is often indexed by the slope of the reaction time (RT) × Set Size function. However, it may be impossible to define set size for real scenes. As an approximation, we hand-labeled 100 indoor scenes and used the number of labeled regions as a surrogate for set size. In Experiment 1, observers searched for named objects (a chair, bowl, etc.). With set size defined as the number of labeled regions, search was very efficient (~5 ms/item). When we controlled for a possible guessing strategy in Experiment 2, slopes increased somewhat (~15 ms/item), but they were much shallower than search for a random object among other distinctive objects outside of a scene setting (Exp. 3: ~40 ms/item). In Experiments 4–6, observers searched repeatedly through the same scene for different objects. Increased familiarity with scenes had modest effects on RTs, while repetition of target items had large effects (>500 ms). We propose that visual search in scenes is efficient because scene-specific forms of attentional guidance can eliminate most regions from the “functional set size” of items that could possibly be the target. PMID:21671156

Visual search for arbitrary objects in real scenes.

PubMed

Wolfe, Jeremy M; Alvarez, George A; Rosenholtz, Ruth; Kuzmova, Yoana I; Sherman, Ashley M

2011-08-01

How efficient is visual search in real scenes? In searches for targets among arrays of randomly placed distractors, efficiency is often indexed by the slope of the reaction time (RT) × Set Size function. However, it may be impossible to define set size for real scenes. As an approximation, we hand-labeled 100 indoor scenes and used the number of labeled regions as a surrogate for set size. In Experiment 1, observers searched for named objects (a chair, bowl, etc.). With set size defined as the number of labeled regions, search was very efficient (~5 ms/item). When we controlled for a possible guessing strategy in Experiment 2, slopes increased somewhat (~15 ms/item), but they were much shallower than search for a random object among other distinctive objects outside of a scene setting (Exp. 3: ~40 ms/item). In Experiments 4-6, observers searched repeatedly through the same scene for different objects. Increased familiarity with scenes had modest effects on RTs, while repetition of target items had large effects (>500 ms). We propose that visual search in scenes is efficient because scene-specific forms of attentional guidance can eliminate most regions from the "functional set size" of items that could possibly be the target.

Folksonomical P2P File Sharing Networks Using Vectorized KANSEI Information as Search Tags

NASA Astrophysics Data System (ADS)

Ohnishi, Kei; Yoshida, Kaori; Oie, Yuji

We present the concept of folksonomical peer-to-peer (P2P) file sharing networks that allow participants (peers) to freely assign structured search tags to files. These networks are similar to folksonomies in the present Web from the point of view that users assign search tags to information distributed over a network. As a concrete example, we consider an unstructured P2P network using vectorized Kansei (human sensitivity) information as structured search tags for file search. Vectorized Kansei information as search tags indicates what participants feel about their files and is assigned by the participant to each of their files. A search query also has the same form of search tags and indicates what participants want to feel about files that they will eventually obtain. A method that enables file search using vectorized Kansei information is the Kansei query-forwarding method, which probabilistically propagates a search query to peers that are likely to hold more files having search tags that are similar to the query. The similarity between the search query and the search tags is measured in terms of their dot product. The simulation experiments examine if the Kansei query-forwarding method can provide equal search performance for all peers in a network in which only the Kansei information and the tendency with respect to file collection are different among all of the peers. The simulation results show that the Kansei query forwarding method and a random-walk-based query forwarding method, for comparison, work effectively in different situations and are complementary. Furthermore, the Kansei query forwarding method is shown, through simulations, to be superior to or equal to the random-walk based one in terms of search speed.

Gradient-free MCMC methods for dynamic causal modelling

DOE PAGES

Sengupta, Biswa; Friston, Karl J.; Penny, Will D.

2015-03-14

Here, we compare the performance of four gradient-free MCMC samplers (random walk Metropolis sampling, slice-sampling, adaptive MCMC sampling and population-based MCMC sampling with tempering) in terms of the number of independent samples they can produce per unit computational time. For the Bayesian inversion of a single-node neural mass model, both adaptive and population-based samplers are more efficient compared with random walk Metropolis sampler or slice-sampling; yet adaptive MCMC sampling is more promising in terms of compute time. Slice-sampling yields the highest number of independent samples from the target density -- albeit at almost 1000% increase in computational time, in comparisonmore » to the most efficient algorithm (i.e., the adaptive MCMC sampler).« less

Coordinated Search for a Random Walk Target Motion

NASA Astrophysics Data System (ADS)

El-Hadidy, Mohamed Abd Allah; Abou-Gabal, Hamdy M.

This paper presents the cooperation between two searchers at the origin to find a Random Walk moving target on the real line. No information is not available about the target’s position all the time. Rather than finding the conditions that make the expected value of the first meeting time between one of the searchers and the target is finite, we show the existence of the optimal search strategy which minimizes this first meeting time. The effectiveness of this model is illustrated using a numerical example.

Finding paths in tree graphs with a quantum walk

NASA Astrophysics Data System (ADS)

Koch, Daniel; Hillery, Mark

2018-01-01

We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

Clinical effectiveness of garlic (Allium sativum).

PubMed

Pittler, Max H; Ernst, Edzard

2007-11-01

The objective of this review is to update and assess the clinical evidence based on rigorous trials of the effectiveness of garlic (A. sativum). Systematic searches were carried out in Medline, Embase, Amed, the Cochrane Database of Systematic Reviews, Natural Standard, and the Natural Medicines Comprehensive Database (search date December 2006). Our own files, the bibliographies of relevant papers and the contents pages of all issues of the review journal FACT were searched for further studies. No language restrictions were imposed. To be included, trials were required to state that they were randomized and double blind. Systematic reviews and meta-analyses of garlic were included if based on the results of randomized, double-blind trials. The literature searches identified six relevant systematic reviews and meta-analysis and double-blind randomized trials (RCT) that were published subsequently. These relate to cancer, common cold, hypercholesterolemia, hypertension, peripheral arterial disease and pre-eclampsia. The evidence based on rigorous clinical trials of garlic is not convincing. For hypercholesterolemia, the reported effects are small and may therefore not be of clinical relevance. For reducing blood pressure, few studies are available and the reported effects are too small to be clinically meaningful. For all other conditions not enough data are available for clinical recommendations.

Color Vision in Color Display Night Vision Goggles.

PubMed

Liggins, Eric P; Serle, William P

2017-05-01

Aircrew viewing eyepiece-injected symbology on color display night vision goggles (CDNVGs) are performing a visual task involving color under highly unnatural viewing conditions. Their performance in discriminating different colors and responding to color cues is unknown. Experimental laboratory measurements of 1) color discrimination and 2) visual search performance are reported under adaptation conditions representative of a CDNVG. Color discrimination was measured using a two-alternative forced choice (2AFC) paradigm that probes color space uniformly around a white point. Search times in the presence of different degrees of clutter (distractors in the scene) are measured for different potential symbology colors. The discrimination data support previous data suggesting that discrimination is best for colors close to the adapting point in color space (P43 phosphor in this case). There were highly significant effects of background adaptation (white or green) and test color. The search time data show that saturated colors with the greatest chromatic contrast with respect to the background lead to the shortest search times, associated with the greatest saliency. Search times for the green background were around 150 ms longer than for the white. Desaturated colors, along with those close to a typical CDNVG display phosphor in color space, should be avoided by CDNVG designers if the greatest conspicuity of symbology is desired. The results can be used by CDNVG symbology designers to optimize aircrew performance subject to wider constraints arising from the way color is used in the existing conventional cockpit instruments and displays.Liggins EP, Serle WP. Color vision in color display night vision goggles. Aerosp Med Hum Perform. 2017; 88(5):448-456.

Working memory training in older adults: Bayesian evidence supporting the absence of transfer.

PubMed

Guye, Sabrina; von Bastian, Claudia C

2017-12-01

The question of whether working memory training leads to generalized improvements in untrained cognitive abilities is a longstanding and heatedly debated one. Previous research provides mostly ambiguous evidence regarding the presence or absence of transfer effects in older adults. Thus, to draw decisive conclusions regarding the effectiveness of working memory training interventions, methodologically sound studies with larger sample sizes are needed. In this study, we investigated whether or not a computer-based working memory training intervention induced near and far transfer in a large sample of 142 healthy older adults (65 to 80 years). Therefore, we randomly assigned participants to either the experimental group, which completed 25 sessions of adaptive, process-based working memory training, or to the active, adaptive visual search control group. Bayesian linear mixed-effects models were used to estimate performance improvements on the level of abilities, using multiple indicator tasks for near (working memory) and far transfer (fluid intelligence, shifting, and inhibition). Our data provided consistent evidence supporting the absence of near transfer to untrained working memory tasks and the absence of far transfer effects to all of the assessed abilities. Our results suggest that working memory training is not an effective way to improve general cognitive functioning in old age. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

The effect of adaptive servo ventilation (ASV) on objective and subjective outcomes in Cheyne-Stokes respiration (CSR) with central sleep apnea (CSA) in heart failure (HF): A systematic review.

PubMed

Yang, Hyunju; Sawyer, Amy M

2016-01-01

To summarize the current evidence for adaptive servo ventilation (ASV) in Cheyne-Stokes respiration (CSR) with central sleep apnea (CSA) in heart failure (HF) and advance a research agenda and clinical considerations for ASV-treated CSR-CSA in HF. CSR-CSA in HF is associated with higher overall mortality, worse outcomes and lower quality of life (QOL) than HF without CSR-CSA. Five databases were searched using key words (n = 234). Randomized controlled trials assessed objective sleep quality, cardiac, and self-reported outcomes in adults (≥18 years) with HF (n = 10). ASV has a beneficial effect on the reduction of central sleep apnea in adult patients with CSR-CSA in HF, but it is not be superior to CPAP, bilevel PPV, or supplemental oxygen in terms of sleep quality defined by polysomnography, cardiovascular outcomes, subjective daytime sleepiness, and quality of life. ASV is not recommended for CSR-CSA in HF. It is important to continue to refer HF patients for sleep evaluation to clearly discern OSA from CSR-CSA. Symptom management research, inclusive of objective and subjective outcomes, in CSR-CSA in HF adults is needed. Copyright © 2016 Elsevier Inc. All rights reserved.

Adaptive feature selection using v-shaped binary particle swarm optimization.

PubMed

Teng, Xuyang; Dong, Hongbin; Zhou, Xiurong

2017-01-01

Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers.

Adaptive feature selection using v-shaped binary particle swarm optimization

PubMed Central

Dong, Hongbin; Zhou, Xiurong

2017-01-01

Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers. PMID:28358850

In-office dental bleaching with light vs. without light: A systematic review and meta-analysis.

PubMed

Maran, Bianca Medeiros; Burey, Adrieli; de Paris Matos, Thalita; Loguercio, Alessandro D; Reis, Alessandra

2018-03-01

A systematic review and meta-analysis were performed to answer the following research question: Does light-activated in-office vital bleaching have a greater whitening efficacy and higher tooth sensitivity (TS) in comparison with in-office vital bleaching without light when used in adults? Only randomized clinical trials (RCTs) involving adults who had in-office bleaching with and without light activation were included. Controlled vocabulary and keywords were used in a comprehensive search for titles and abstracts in PubMed, and this search was adapted for Scopus, Web of Science, LILACS, BBO, Cochrane Library, and SIGLE without restrictions in May 2016 and was updated in August 2017. IADR abstracts (1990-2016), unpublished- and ongoing-trial registries, dissertations, and theses were also searched. The risk-of-bias tool of the Cochrane Collaboration was used for quality assessment. The quality of the evidence was rated using the Grading of Recommendations: Assessment, Development, and Evaluation approach. Through the use of the random effects model, a meta-analysis with a subgroup analysis (low and high hydrogen peroxide concentration) was conducted for color change (ΔE*, ΔSGU) as well as the risk and intensity of TS. We retrieved 6663 articles, but after removing duplicates and non-relevant articles, only 21 RCTs remained. No significant difference in ΔE*, ΔSGU, and risk and intensity of TS was observed (p > .05). For ΔE and risk of TS, the quality of the evidence was graded as moderate whereas the evidence for ΔSGU and intensity of TS was graded as very low and low, respectively. Without considering variations in the protocols, the activation of in-office bleaching gel with light does not seem to improve color change or affect tooth sensitivity, regardless of the hydrogen peroxide concentration. (PROSPERO - CRD42016037630). Although it is commercially claimed that in-office bleaching associated with light improves and accelerates color change, this study did not confirm this belief for in-office bleaching gels with either high or low levels of hydrogen peroxide. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

Intra-amniotic inflammation and child neurodevelopment: a systematic review protocol.

PubMed

Soucy-Giguère, Laurence; Gasse, Cédric; Giguère, Yves; Demers, Suzanne; Bujold, Emmanuel; Boutin, Amélie

2018-01-22

Intra-amniotic inflammation is associated with adverse pregnancy and neonatal outcomes. However, the impact on child neurodevelopment remains unclear. We aim to assess the effect of intra-amniotic inflammation on neurodevelopmental outcomes in children. The databases MEDLINE, Embase, CINAHL, and Cochrane will be searched from their inception until November 2017. Randomized trials and cohort studies in which inflammatory markers were measured in amniotic fluid collected by amniocentesis and in which infant's neurodevelopment was assessed will be eligible. Two reviewers will independently select eligible studies, assess their risk of bias, and extract data. Results will be compared and a third party will be consulted in case of disagreement. Our primary outcome of interest is child neurodevelopment, assessed with either a validated tool or by revision of medical records for specific diagnosis. Secondary outcomes will include abnormal brain imaging. Relative risks will be pooled and sensitivity analyses will be performed for the indication of amniocentesis, gestational age at amniocentesis, gestational age at delivery, and fetal sex. Risk of bias will be assessed using the Cochrane Collaboration's tool for assessing the risk of bias in randomized trials or an adapted version of the ROBINS-1 for the risk of bias in non-randomized studies. This systematic review will report the current evidence regarding the association between amniotic inflammation and child neurodevelopment, and the modifiers of this association. The review will generate new hypotheses on pathological pathways and will guide future research. PROSPERO 2017 65065.

Interocular velocity difference contributes to stereomotion speed perception

NASA Technical Reports Server (NTRS)

Brooks, Kevin R.

2002-01-01

Two experiments are presented assessing the contributions of the rate of change of disparity (CD) and interocular velocity difference (IOVD) cues to stereomotion speed perception. Using a two-interval forced-choice paradigm, the perceived speed of directly approaching and receding stereomotion and of monocular lateral motion in random dot stereogram (RDS) targets was measured. Prior adaptation using dysjunctively moving random dot stimuli induced a velocity aftereffect (VAE). The degree of interocular correlation in the adapting images was manipulated to assess the effectiveness of each cue. While correlated adaptation involved a conventional RDS stimulus, containing both IOVD and CD cues, uncorrelated adaptation featured an independent dot array in each monocular half-image, and hence lacked a coherent disparity signal. Adaptation produced a larger VAE for stereomotion than for monocular lateral motion, implying effects at neural sites beyond that of binocular combination. For motion passing through the horopter, correlated and uncorrelated adaptation stimuli produced equivalent stereomotion VAEs. The possibility that these results were due to the adaptation of a CD mechanism through random matches in the uncorrelated stimulus was discounted in a control experiment. Here both simultaneous and sequential adaptation of left and right eyes produced similar stereomotion VAEs. Motion at uncrossed disparities was also affected by both correlated and uncorrelated adaptation stimuli, but showed a significantly greater VAE in response to the former. These results show that (1) there are two separate, specialised mechanisms for encoding stereomotion: one through IOVD, the other through CD; (2) the IOVD cue dominates the perception of stereomotion speed for stimuli passing through the horopter; and (3) at a disparity pedestal both the IOVD and the CD cues have a significant influence.

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

Affect-Aware Adaptive Tutoring Based on Human-Automation Etiquette Strategies.

PubMed

Yang, Euijung; Dorneich, Michael C

2018-06-01

We investigated adapting the interaction style of intelligent tutoring system (ITS) feedback based on human-automation etiquette strategies. Most ITSs adapt the content difficulty level, adapt the feedback timing, or provide extra content when they detect cognitive or affective decrements. Our previous work demonstrated that changing the interaction style via different feedback etiquette strategies has differential effects on students' motivation, confidence, satisfaction, and performance. The best etiquette strategy was also determined by user frustration. Based on these findings, a rule set was developed that systemically selected the proper etiquette strategy to address one of four learning factors (motivation, confidence, satisfaction, and performance) under two different levels of user frustration. We explored whether etiquette strategy selection based on this rule set (systematic) or random changes in etiquette strategy for a given level of frustration affected the four learning factors. Participants solved mathematics problems under different frustration conditions with feedback that adapted dynamic changes in etiquette strategies either systematically or randomly. The results demonstrated that feedback with etiquette strategies chosen systematically via the rule set could selectively target and improve motivation, confidence, satisfaction, and performance more than changing etiquette strategies randomly. The systematic adaptation was effective no matter the level of frustration for the participant. If computer tutors can vary the interaction style to effectively mitigate negative emotions, then ITS designers would have one more mechanism in which to design affect-aware adaptations that provide the proper responses in situations where human emotions affect the ability to learn.

Effect of Delay on Search Decisions in a Task-Oriented Reading Environment

ERIC Educational Resources Information Center

Mañá, Amelia; Vidal-Abarca, Eduardo; Salmerón, Ladislao

2017-01-01

The goal of this study was to determine the effect of setting a delay between reading a text and answering comprehension questions on "when"-to-search and "what"-to-search decisions in a task-oriented reading environment. Fifty-five eighth-grade students were randomly divided into two groups. One group read one text, answered…

The Validity of Warrantless Searches under the Occupational Safety and Health Act of 1970

ERIC Educational Resources Information Center

Shanks, Michael D.

1975-01-01

One of the most controversial federal acts providing for random administrative searches is the Occupational Safety and Health Act of 1970 (OSHA). The author reviews the search and seizure law and concludes that abandonment of Fourth Amendment rights should not be predicated on the mere convenience of even a justifiable regulatory scheme. (JT)

Boosting association rule mining in large datasets via Gibbs sampling.

PubMed

Qian, Guoqi; Rao, Calyampudi Radhakrishna; Sun, Xiaoying; Wu, Yuehua

2016-05-03

Current algorithms for association rule mining from transaction data are mostly deterministic and enumerative. They can be computationally intractable even for mining a dataset containing just a few hundred transaction items, if no action is taken to constrain the search space. In this paper, we develop a Gibbs-sampling-induced stochastic search procedure to randomly sample association rules from the itemset space, and perform rule mining from the reduced transaction dataset generated by the sample. Also a general rule importance measure is proposed to direct the stochastic search so that, as a result of the randomly generated association rules constituting an ergodic Markov chain, the overall most important rules in the itemset space can be uncovered from the reduced dataset with probability 1 in the limit. In the simulation study and a real genomic data example, we show how to boost association rule mining by an integrated use of the stochastic search and the Apriori algorithm.

Threat captures attention but does not affect learning of contextual regularities.

PubMed

Yamaguchi, Motonori; Harwood, Sarah L

2017-04-01

Some of the stimulus features that guide visual attention are abstract properties of objects such as potential threat to one's survival, whereas others are complex configurations such as visual contexts that are learned through past experiences. The present study investigated the two functions that guide visual attention, threat detection and learning of contextual regularities, in visual search. Search arrays contained images of threat and non-threat objects, and their locations were fixed on some trials but random on other trials. Although they were irrelevant to the visual search task, threat objects facilitated attention capture and impaired attention disengagement. Search time improved for fixed configurations more than for random configurations, reflecting learning of visual contexts. Nevertheless, threat detection had little influence on learning of the contextual regularities. The results suggest that factors guiding visual attention are different from factors that influence learning to guide visual attention.

Efficiency improvement by navigated safety inspection involving visual clutter based on the random search model.

PubMed

Sun, Xinlu; Chong, Heap-Yih; Liao, Pin-Chao

2018-06-25

Navigated inspection seeks to improve hazard identification (HI) accuracy. With tight inspection schedule, HI also requires efficiency. However, lacking quantification of HI efficiency, navigated inspection strategies cannot be comprehensively assessed. This work aims to determine inspection efficiency in navigated safety inspection, controlling for the HI accuracy. Based on a cognitive method of the random search model (RSM), an experiment was conducted to observe the HI efficiency in navigation, for a variety of visual clutter (VC) scenarios, while using eye-tracking devices to record the search process and analyze the search performance. The results show that the RSM is an appropriate instrument, and VC serves as a hazard classifier for navigation inspection in improving inspection efficiency. This suggests a new and effective solution for addressing the low accuracy and efficiency of manual inspection through navigated inspection involving VC and the RSM. It also provides insights into the inspectors' safety inspection ability.

Towards Motivation-Based Adaptation of Difficulty in E-Learning Programs

ERIC Educational Resources Information Center

Endler, Anke; Rey, Gunter Daniel; Butz, Martin V.

2012-01-01

The objective of this study was to investigate if an e-learning environment may use measurements of the user's current motivation to adapt the level of task difficulty for more effective learning. In the reported study, motivation-based adaptation was applied randomly to collect a wide range of data for different adaptations in a variety of…

Interactive effects of body-size structure and adaptive foraging on food-web stability.

PubMed

Heckmann, Lotta; Drossel, Barbara; Brose, Ulrich; Guill, Christian

2012-03-01

Body-size structure of food webs and adaptive foraging of consumers are two of the dominant concepts of our understanding how natural ecosystems maintain their stability and diversity. The interplay of these two processes, however, is a critically important yet unresolved issue. To fill this gap in our knowledge of ecosystem stability, we investigate dynamic random and niche model food webs to evaluate the proportion of persistent species. We show that stronger body-size structures and faster adaptation stabilise these food webs. Body-size structures yield stabilising configurations of interaction strength distributions across food webs, and adaptive foraging emphasises links to resources closer to the base. Moreover, both mechanisms combined have a cumulative effect. Most importantly, unstructured random webs evolve via adaptive foraging into stable size-structured food webs. This offers a mechanistic explanation of how size structure adaptively emerges in complex food webs, thus building a novel bridge between these two important stabilising mechanisms. © 2012 Blackwell Publishing Ltd/CNRS.

Predicting adaptive phenotypes from multilocus genotypes in Sitka spruce (Picea sitchensis) using random forest.

PubMed

Holliday, Jason A; Wang, Tongli; Aitken, Sally

2012-09-01

Climate is the primary driver of the distribution of tree species worldwide, and the potential for adaptive evolution will be an important factor determining the response of forests to anthropogenic climate change. Although association mapping has the potential to improve our understanding of the genomic underpinnings of climatically relevant traits, the utility of adaptive polymorphisms uncovered by such studies would be greatly enhanced by the development of integrated models that account for the phenotypic effects of multiple single-nucleotide polymorphisms (SNPs) and their interactions simultaneously. We previously reported the results of association mapping in the widespread conifer Sitka spruce (Picea sitchensis). In the current study we used the recursive partitioning algorithm 'Random Forest' to identify optimized combinations of SNPs to predict adaptive phenotypes. After adjusting for population structure, we were able to explain 37% and 30% of the phenotypic variation, respectively, in two locally adaptive traits--autumn budset timing and cold hardiness. For each trait, the leading five SNPs captured much of the phenotypic variation. To determine the role of epistasis in shaping these phenotypes, we also used a novel approach to quantify the strength and direction of pairwise interactions between SNPs and found such interactions to be common. Our results demonstrate the power of Random Forest to identify subsets of markers that are most important to climatic adaptation, and suggest that interactions among these loci may be widespread.

[Information about electroconvulsive therapy on the internet].

PubMed

Degraeve, G; Van Heeringen, C; Audenaert, K

2006-01-01

This article aims to provide a quantitative and qualitative assessment of the information about electroconvulsive therapy that is currently available on the internet. We carried out a quantitative assessment by entering five search terms into eight (meta)search engines. We achieved our qualitative assessment by visiting the first twenty websites generated by each search on one of the search engines, in particular Google (www.google.com), and by scoring these websites with an adapted Sandvik-score. We conclude that the scored websites are technically sound but are incomplete as far as content is concerned.

Adapting the coping in deliberation (CODE) framework: a multi-method approach in the context of familial ovarian cancer risk management.

PubMed

Witt, Jana; Elwyn, Glyn; Wood, Fiona; Rogers, Mark T; Menon, Usha; Brain, Kate

2014-11-01

To test whether the coping in deliberation (CODE) framework can be adapted to a specific preference-sensitive medical decision: risk-reducing bilateral salpingo-oophorectomy (RRSO) in women at increased risk of ovarian cancer. We performed a systematic literature search to identify issues important to women during deliberations about RRSO. Three focus groups with patients (most were pre-menopausal and untested for genetic mutations) and 11 interviews with health professionals were conducted to determine which issues mattered in the UK context. Data were used to adapt the generic CODE framework. The literature search yielded 49 relevant studies, which highlighted various issues and coping options important during deliberations, including mutation status, risks of surgery, family obligations, physician recommendation, peer support and reliable information sources. Consultations with UK stakeholders confirmed most of these factors as pertinent influences on deliberations. Questions in the generic framework were adapted to reflect the issues and coping options identified. The generic CODE framework was readily adapted to a specific preference-sensitive medical decision, showing that deliberations and coping are linked during deliberations about RRSO. Adapted versions of the CODE framework may be used to develop tailored decision support methods and materials in order to improve patient-centred care. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

Mindfulness Training for Health Profession Students-The Effect of Mindfulness Training on Psychological Well-Being, Learning and Clinical Performance of Health Professional Students: A Systematic Review of Randomized and Non-randomized Controlled Trials.

PubMed

McConville, Janet; McAleer, Rachael; Hahne, Andrew

High levels of stress have been identified in medical students and increasingly in other health profession student population groups. As stress can affect psychological well-being and interfere with learning and clinical performance, there is a clear argument for universities to include health professional student well-being as an outcome in core curriculum. Mindfulness training is a potential construct to manage stress and enhance academic success. The aims of this systematic review were to assess the effectiveness of mindfulness training in medical and other health professional student population groups and to compare the effectiveness of the different mindfulness-based programs. A literature search was completed using The Cochrane library, Medline, Cinahl, Embase, Psychinfo, and ERIC (proquest) electronic databases from inception to June 2016. Randomized and non-randomized controlled trials were included. Of the potential 5355 articles, 19 met the inclusion criteria. Studies focused on medical (n = 10), nursing (n = 4), social work (n = 1), psychology (n = 1), and medical plus other health (n = 3) students. Interventions were based on mindfulness. The 19 studies included 1815 participants. Meta-analysis was performed evaluating the effect of mindfulness training on mindfulness, anxiety, depression, stress, mood, self-efficacy, and empathy. The effect of mindfulness on academic performance was discussed. Mindfulness-based interventions decrease stress, anxiety, and depression and improve mindfulness, mood, self-efficacy, and empathy in health profession students. Due to the range of presentation options, mindfulness training can be relatively easily adapted and integrated into health professional training programs. Copyright © 2017 Elsevier Inc. All rights reserved.

EPR paradox, quantum nonlocality and physical reality

NASA Astrophysics Data System (ADS)

Kupczynski, M.

2016-03-01

Eighty years ago Einstein, Podolsky and Rosen demonstrated that instantaneous reduction of wave function, believed to describe completely a pair of entangled physical systems, led to EPR paradox. The paradox disappears in statistical interpretation of quantum mechanics (QM) according to which a wave function describes only an ensemble of identically prepared physical systems. QM predicts strong correlations between outcomes of measurements performed on different members of EPR pairs in far-away locations. Searching for an intuitive explanation of these correlations John Bell analysed so called local realistic hidden variable models and proved that correlations consistent with these models satisfy Bell inequalities which are violated by some predictions of QM and by experimental data. Several different local models were constructed and inequalities proven. Some eminent physicists concluded that Nature is definitely nonlocal and that it is acting according to a law of nonlocal randomness. According to these law perfectly random, but strongly correlated events, can be produced at the same time in far away locations and a local and causal explanation of their occurrence cannot be given. We strongly disagree with this conclusion and we prove the contrary by analysing in detail some influential finite sample proofs of Bell and CHSH inequalities and so called Quantum Randi Challenges. We also show how one can win so called Bell's game without violating locality of Nature. Nonlocal randomness is inconsistent with local quantum field theory, with standard model in elementary particle physics and with causal laws and adaptive dynamics prevailing in the surrounding us world. The experimental violation of Bell-type inequalities does not prove the nonlocality of Nature but it only confirms a contextual character of quantum observables and gives a strong argument against counterfactual definiteness and against a point of view according to which experimental outcomes are produced in irreducible random way.

Controllability of social networks and the strategic use of random information.

PubMed

Cremonini, Marco; Casamassima, Francesca

2017-01-01

This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a time-varying adaptive network and considers two well-known strategies for influencing social contexts: One is the selection of few influencers for manipulating their actions in order to drive the whole network to a certain behavior; the other, instead, drives the network behavior acting on the state of a large subset of ordinary, scarcely influencing users. The two approaches have been studied in terms of network and diffusion effects. The network effect is analyzed through the changes induced on network average degree and clustering coefficient, while the diffusion effect is based on two ad hoc metrics which are defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of agent interests. The results, obtained through simulations on synthetic networks, show a rich dynamics and strong effects on the communication structure and on the distribution of knowledge and skills. These findings support our hypothesis that the strategic use of random information could represent a realistic approach to social network controllability, and that with both strategies, in principle, the control effect could be remarkable.

Evolutionary Strategies for Protein Folding

NASA Astrophysics Data System (ADS)

Murthy Gopal, Srinivasa; Wenzel, Wolfgang

2006-03-01

The free energy approach for predicting the protein tertiary structure describes the native state of a protein as the global minimum of an appropriate free-energy forcefield. The low-energy region of the free-energy landscape of a protein is extremely rugged. Efficient optimization methods must therefore speed up the search for the global optimum by avoiding high energy transition states, adapt large scale moves or accept unphysical intermediates. Here we investigate an evolutionary strategies(ES) for optimizing a protein conformation in our all-atom free-energy force field([1],[2]). A set of random conformations is evolved using an ES to get a diverse population containing low energy structure. The ES is shown to balance energy improvement and yet maintain diversity in structures. The ES is implemented as a master-client model for distributed computing. Starting from random structures and by using this optimization technique, we were able to fold a 20 amino-acid helical protein and 16 amino-acid beta hairpin[3]. We compare ES to basin hopping method. [1]T. Herges and W. Wenzel,Biophys.J. 87,3100(2004) [2] A. Verma and W. Wenzel Stabilization and folding of beta-sheet and alpha-helical proteins in an all-atom free energy model(submitted)(2005) [3] S. M. Gopal and W. Wenzel Evolutionary Strategies for Protein Folding (in preparation)

Target Engageability Improvement Through Adaptive Data Fusion and Sensor Management: An Approach Based on the Fire Control Radar Search to Lock-On Time

DTIC Science & Technology

2008-05-01

ch based on the fire control radar search to l o ck - o n t i m e F. Rhéaume A. Benaskeur DRDC Valcartier Defence R& D Canada...recherche visant à développer et démontrer des concepts avancés de fusion de données adaptative et de gestion de res- sources. Les systèmes C2 navals...militaires sont en grande partie appuyés par des techno- logies de fusion de données et de gestion de ressources. Le C2 naval militaire doit

Implications of movement-related cortical potential for understanding neural adaptations in muscle strength tasks

PubMed Central

2014-01-01

This systematic review aims to provide information about the implications of the movement-related cortical potential (MRCP) in acute and chronic responses to the counter resistance training. The structuring of the methods of this study followed the proposals of the PRISMA (Preferred Reporting Items for Systematic reviews and Meta-Analyses). It was performed an electronically search in Pubmed/Medline and ISI Web of Knowledge data bases, from 1987 to 2013, besides the manual search in the selected references. The following terms were used: Bereitschaftspotential, MRCP, strength and force. The logical operator “AND” was used to combine descriptors and terms used to search publications. At the end, 11 studies attended all the eligibility criteria and the results demonstrated that the behavior of MRCP is altered because of different factors such as: force level, rate of force development, fatigue induced by exercise, and the specific phase of muscular action, leading to an increase in the amplitude in eccentric actions compared to concentric actions, in acute effects. The long-term adaptations demonstrated that the counter resistance training provokes an attenuation in the amplitude in areas related to the movement, which may be caused by neural adaptation occurred in the motor cortex. PMID:24602228

A Pilot Randomized Controlled Trial of the ACCESS Program: A Group Intervention to Improve Social, Adaptive Functioning, Stress Coping, and Self-Determination Outcomes in Young Adults with Autism Spectrum Disorder.

PubMed

Oswald, Tasha M; Winder-Patel, Breanna; Ruder, Steven; Xing, Guibo; Stahmer, Aubyn; Solomon, Marjorie

2018-05-01

The purpose of this pilot randomized controlled trial was to investigate the acceptability and efficacy of the Acquiring Career, Coping, Executive control, Social Skills (ACCESS) Program, a group intervention tailored for young adults with autism spectrum disorder (ASD) to enhance critical skills and beliefs that promote adult functioning, including social and adaptive skills, self-determination skills, and coping self-efficacy. Forty-four adults with ASD (ages 18-38; 13 females) and their caregivers were randomly assigned to treatment or waitlist control. Compared to controls, adults in treatment significantly improved in adaptive and self-determination skills, per caregiver report, and self-reported greater belief in their ability to access social support to cope with stressors. Results provide evidence for the acceptability and efficacy of the ACCESS Program.

Gradient-free MCMC methods for dynamic causal modelling.

PubMed

Sengupta, Biswa; Friston, Karl J; Penny, Will D

2015-05-15

In this technical note we compare the performance of four gradient-free MCMC samplers (random walk Metropolis sampling, slice-sampling, adaptive MCMC sampling and population-based MCMC sampling with tempering) in terms of the number of independent samples they can produce per unit computational time. For the Bayesian inversion of a single-node neural mass model, both adaptive and population-based samplers are more efficient compared with random walk Metropolis sampler or slice-sampling; yet adaptive MCMC sampling is more promising in terms of compute time. Slice-sampling yields the highest number of independent samples from the target density - albeit at almost 1000% increase in computational time, in comparison to the most efficient algorithm (i.e., the adaptive MCMC sampler). Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

Metal-backed versus all-polyethylene tibial components in primary total knee arthroplasty

PubMed Central

2011-01-01

Background and purpose The choice of either all-polyethylene (AP) tibial components or metal-backed (MB) tibial components in total knee arthroplasty (TKA) remains controversial. We therefore performed a meta-analysis and systematic review of randomized controlled trials that have evaluated MB and AP tibial components in primary TKA. Methods The search strategy included a computerized literature search (Medline, EMBASE, Scopus, and the Cochrane Central Register of Controlled Trials) and a manual search of major orthopedic journals. A meta-analysis and systematic review of randomized or quasi-randomized trials that compared the performance of tibial components in primary TKA was performed using a fixed or random effects model. We assessed the methodological quality of studies using Detsky quality scale. Results 9 randomized controlled trials (RCTs) published between 2000 and 2009 met the inclusion quality standards for the systematic review. The mean standardized Detsky score was 14 (SD 3). We found that the frequency of radiolucent lines in the MB group was significantly higher than that in the AP group. There were no statistically significant differences between the MB and AP tibial components regarding component positioning, knee score, knee range of motion, quality of life, and postoperative complications. Interpretation Based on evidence obtained from this study, the AP tibial component was comparable with or better than the MB tibial component in TKA. However, high-quality RCTs are required to validate the results. PMID:21895503

Tuning Monotonic Basin Hopping: Improving the Efficiency of Stochastic Search as Applied to Low-Thrust Trajectory Optimization

NASA Technical Reports Server (NTRS)

Englander, Jacob A.; Englander, Arnold C.

2014-01-01

Trajectory optimization methods using monotonic basin hopping (MBH) have become well developed during the past decade [1, 2, 3, 4, 5, 6]. An essential component of MBH is a controlled random search through the multi-dimensional space of possible solutions. Historically, the randomness has been generated by drawing random variable (RV)s from a uniform probability distribution. Here, we investigate the generating the randomness by drawing the RVs from Cauchy and Pareto distributions, chosen because of their characteristic long tails. We demonstrate that using Cauchy distributions (as first suggested by J. Englander [3, 6]) significantly improves monotonic basin hopping (MBH) performance, and that Pareto distributions provide even greater improvements. Improved performance is defined in terms of efficiency and robustness. Efficiency is finding better solutions in less time. Robustness is efficiency that is undiminished by (a) the boundary conditions and internal constraints of the optimization problem being solved, and (b) by variations in the parameters of the probability distribution. Robustness is important for achieving performance improvements that are not problem specific. In this work we show that the performance improvements are the result of how these long-tailed distributions enable MBH to search the solution space faster and more thoroughly. In developing this explanation, we use the concepts of sub-diffusive, normally-diffusive, and super-diffusive random walks (RWs) originally developed in the field of statistical physics.

Children's sequential information search is sensitive to environmental probabilities.

PubMed

Nelson, Jonathan D; Divjak, Bojana; Gudmundsdottir, Gudny; Martignon, Laura F; Meder, Björn

2014-01-01

We investigated 4th-grade children's search strategies on sequential search tasks in which the goal is to identify an unknown target object by asking yes-no questions about its features. We used exhaustive search to identify the most efficient question strategies and evaluated the usefulness of children's questions accordingly. Results show that children have good intuitions regarding questions' usefulness and search adaptively, relative to the statistical structure of the task environment. Search was especially efficient in a task environment that was representative of real-world experiences. This suggests that children may use their knowledge of real-world environmental statistics to guide their search behavior. We also compared different related search tasks. We found positive transfer effects from first doing a number search task on a later person search task. Copyright © 2013 The Authors. Published by Elsevier B.V. All rights reserved.

FOG Random Drift Signal Denoising Based on the Improved AR Model and Modified Sage-Husa Adaptive Kalman Filter.

PubMed

Sun, Jin; Xu, Xiaosu; Liu, Yiting; Zhang, Tao; Li, Yao

2016-07-12

In order to reduce the influence of fiber optic gyroscope (FOG) random drift error on inertial navigation systems, an improved auto regressive (AR) model is put forward in this paper. First, based on real-time observations at each restart of the gyroscope, the model of FOG random drift can be established online. In the improved AR model, the FOG measured signal is employed instead of the zero mean signals. Then, the modified Sage-Husa adaptive Kalman filter (SHAKF) is introduced, which can directly carry out real-time filtering on the FOG signals. Finally, static and dynamic experiments are done to verify the effectiveness. The filtering results are analyzed with Allan variance. The analysis results show that the improved AR model has high fitting accuracy and strong adaptability, and the minimum fitting accuracy of single noise is 93.2%. Based on the improved AR(3) model, the denoising method of SHAKF is more effective than traditional methods, and its effect is better than 30%. The random drift error of FOG is reduced effectively, and the precision of the FOG is improved.

Non-tables look-up search algorithm for efficient H.264/AVC context-based adaptive variable length coding decoding

NASA Astrophysics Data System (ADS)

Han, Yishi; Luo, Zhixiao; Wang, Jianhua; Min, Zhixuan; Qin, Xinyu; Sun, Yunlong

2014-09-01

In general, context-based adaptive variable length coding (CAVLC) decoding in H.264/AVC standard requires frequent access to the unstructured variable length coding tables (VLCTs) and significant memory accesses are consumed. Heavy memory accesses will cause high power consumption and time delays, which are serious problems for applications in portable multimedia devices. We propose a method for high-efficiency CAVLC decoding by using a program instead of all the VLCTs. The decoded codeword from VLCTs can be obtained without any table look-up and memory access. The experimental results show that the proposed algorithm achieves 100% memory access saving and 40% decoding time saving without degrading video quality. Additionally, the proposed algorithm shows a better performance compared with conventional CAVLC decoding, such as table look-up by sequential search, table look-up by binary search, Moon's method, and Kim's method.

Sundanese ancient manuscripts search engine using probability approach

NASA Astrophysics Data System (ADS)

Suryani, Mira; Hadi, Setiawan; Paulus, Erick; Nurma Yulita, Intan; Supriatna, Asep K.

2017-10-01

Today, Information and Communication Technology (ICT) has become a regular thing for every aspect of live include cultural and heritage aspect. Sundanese ancient manuscripts as Sundanese heritage are in damage condition and also the information that containing on it. So in order to preserve the information in Sundanese ancient manuscripts and make them easier to search, a search engine has been developed. The search engine must has good computing ability. In order to get the best computation in developed search engine, three types of probabilistic approaches: Bayesian Networks Model, Divergence from Randomness with PL2 distribution, and DFR-PL2F as derivative form DFR-PL2 have been compared in this study. The three probabilistic approaches supported by index of documents and three different weighting methods: term occurrence, term frequency, and TF-IDF. The experiment involved 12 Sundanese ancient manuscripts. From 12 manuscripts there are 474 distinct terms. The developed search engine tested by 50 random queries for three types of query. The experiment results showed that for the single query and multiple query, the best searching performance given by the combination of PL2F approach and TF-IDF weighting method. The performance has been evaluated using average time responds with value about 0.08 second and Mean Average Precision (MAP) about 0.33.

Technology and Teaching: Searching under Cups for Clues about Memory--An Online Demonstration

ERIC Educational Resources Information Center

Kahan, Todd A.; Mathis, Katherine M.

2007-01-01

An online demonstration, designed to enhance comprehension of Sternberg's (1966) short-term memory scanning task, involved rapidly searching under virtual cups for a ball. We randomly assigned students to 1 of 3 groups, all of whom read the same textbook description of Sternberg's work: A demonstration group used 3 search methods to look for balls…

Fundamental resource-allocating model in colleges and universities based on Immune Clone Algorithms

NASA Astrophysics Data System (ADS)

Ye, Mengdie

2017-05-01

In this thesis we will seek the combination of antibodies and antigens converted from the optimal course arrangement and make an analogy with Immune Clone Algorithms. According to the character of the Algorithms, we apply clone, clone gene and clone selection to arrange courses. Clone operator can combine evolutionary search and random search, global search and local search. By cloning and clone mutating candidate solutions, we can find the global optimal solution quickly.

Effects of practice schedule and task specificity on the adaptive process of motor learning.

PubMed

Barros, João Augusto de Camargo; Tani, Go; Corrêa, Umberto Cesar

2017-10-01

This study investigated the effects of practice schedule and task specificity based on the perspective of adaptive process of motor learning. For this purpose, tasks with temporal and force control learning requirements were manipulated in experiments 1 and 2, respectively. Specifically, the task consisted of touching with the dominant hand the three sequential targets with specific movement time or force for each touch. Participants were children (N=120), both boys and girls, with an average age of 11.2years (SD=1.0). The design in both experiments involved four practice groups (constant, random, constant-random, and random-constant) and two phases (stabilisation and adaptation). The dependent variables included measures related to the task goal (accuracy and variability of error of the overall movement and force patterns) and movement pattern (macro- and microstructures). Results revealed a similar error of the overall patterns for all groups in both experiments and that they adapted themselves differently in terms of the macro- and microstructures of movement patterns. The study concludes that the effects of practice schedules on the adaptive process of motor learning were both general and specific to the task. That is, they were general to the task goal performance and specific regarding the movement pattern. Copyright © 2017 Elsevier B.V. All rights reserved.

Corticosteroids as adjuvant therapy for ocular toxoplasmosis.

PubMed

Jasper, Smitha; Vedula, Satyanarayana S; John, Sheeja S; Horo, Saban; Sepah, Yasir J; Nguyen, Quan Dong

2013-04-30

Ocular infestation with Toxoplasma gondii, a parasite, may result in inflammation in the retina, choroid, and uvea and consequently lead to complications such as glaucoma, cataract, and posterior synechiae. The objective of this systematic review was to assess the effects of adjunctive use of corticosteroids for ocular toxoplasmosis. We searched CENTRAL (which contains the Cochrane Eyes and Vision Group Trials Register) (The Cochrane Library 2012, Issue 9), Ovid MEDLINE, Ovid MEDLINE In-Process and Other Non-Indexed Citations, Ovid MEDLINE Daily, Ovid OLDMEDLINE, (January 1950 to October 2012), EMBASE (January 1980 to October 2012), Latin American and Caribbean Literature on Health Sciences (LILACS) (January 1982 to October 2012), the metaRegister of Controlled Trials (mRCT) (www.controlled-trials.com), ClinicalTrials.gov (www.clinicaltrials.gov) and the WHO International Clinical Trials Registry Platform (ICTRP) (www.who.int/ictrp/search/en). We searched the reference lists of included studies for any additional studies not identified by the electronic searches. We did not use any date or language restrictions in the electronic searches for trials. We last searched the electronic databases on 11 October 2012. We planned to include randomized and quasi-randomized controlled trials. Eligible trials would have enrolled participants of any age who were immunocompetent and were diagnosed with active ocular toxoplasmosis. Included trials would have compared anti-parasitic therapy plus corticosteroids versus anti-parasitic therapy alone, or different doses or times of initiation of corticosteroids. Two authors independently screened titles and abstracts retrieved from the electronic searches. We retrieved full-text articles of studies categorized as 'unsure' or 'include' after review of the abstracts. Two authors independently reviewed each full-text article. Discrepancies were resolved through discussion. The electronic searches retrieved 368 titles and abstracts. We reviewed 20 full-text articles. We identified no trials eligible for inclusion in this systematic review. Although research has identified wide variation in practices regarding use of corticosteroids, our systematic review did not identify evidence from randomized controlled trials for the role of corticosteroids in the management of ocular toxoplasmosis. Several questions remain unanswered by well-conducted randomized trials in this context, including whether use of corticosteroids is more effective than use of anti-parasitic therapy alone, when corticosteroids should be initiated in the treatment regimen (early versus late course of treatment), and which dosage and duration of steroid use is best. These questions are easily amenable to research using a randomized controlled design and they are ethical due to the absence of evidence to support or discourage use of corticosteroids for this condition. The question of foremost importance, however, is whether they should be used as adjunct therapy (that is, additional) to anti-parasitic agents.

Music education for improving reading skills in children and adolescents with dyslexia.

PubMed

Cogo-Moreira, Hugo; Andriolo, Régis B; Yazigi, Latife; Ploubidis, George B; Brandão de Ávila, Clara Regina; Mari, Jair J

2012-08-15

Dyslexia (or developmental dyslexia or specific reading disability) is a specific learning disorder that has a neurobiological origin. It is marked by difficulties with accurate or fluent recognition of words and poor spelling in people who have average or above average intelligence and these difficulties cannot be attributed to another cause, for example, poor vision, hearing difficulty, or lack of socio-environmental opportunities, motivation, or adequate instruction. Studies have correlated reading skills with musical abilities. It has been hypothesized that musical training may be able to remediate timing difficulties, improve pitch perception, or increase spatial awareness, thereby having a positive effect on skills needed in the development of language and literacy. To study the effectiveness of music education on reading skills (that is, oral reading skills, reading comprehension, reading fluency, phonological awareness, and spelling) in children and adolescents with dyslexia. We searched the following electronic databases in June 2012: CENTRAL (2012, Issue 5), MEDLINE (1948 to May Week 4 2012 ), EMBASE (1980 to 2012 Week 22), CINAHL (searched 7 June 2012), LILACS (searched 7 June 2012), PsycINFO (1887 to May Week 5 2012), ERIC (searched 7 June 2012), Arts and Humanities Citation Index (1970 to 6 June 2012), Conference Proceedings Citation Index - Social Sciences and Humanities (1990 to 6 June 2012), and WorldCat (searched 7 June 2012). We also searched the WHO International Clinical Trials Registry Platform (ICTRP) and reference lists of studies. We did not apply any date or language limits. We planned to include randomized controlled trials. We looked for studies that included at least one of our primary outcomes. The primary outcomes were related to the main domain of the reading: oral reading skills, reading comprehension, reading fluency, phonological awareness, and spelling, measured through validated instruments. The secondary outcomes were self esteem and academic achievement. Two authors (HCM and RBA) independently screened all titles and abstracts identified through the search strategy to determine their eligibility. For our analysis we had planned to use mean difference for continuous data, with 95% confidence intervals, and to use the random-effects statistical model when the effect estimates of two or more studies could be combined in a meta-analysis. We retrieved 851 references via the search strategy. No randomized controlled trials testing music education for the improvement of reading skills in children with dyslexia could be included in this review. There is no evidence available from randomized controlled trials on which to base a judgment about the effectiveness of music education for the improvement of reading skills in children and adolescents with dyslexia. This uncertainty warrants further research via randomized controlled trials, involving a interdisciplinary team: musicians, hearing and speech therapists, psychologists, and physicians.

Computer Software for Forestry Technology Curricula. Final Report.

ERIC Educational Resources Information Center

Watson, Roy C.; Scobie, Walter R.

Since microcomputers are being used more and more frequently in the forest products industry in the Pacific Northwest, Green River Community College conducted a project to search for BASIC language computer programs pertaining to forestry, and when possible, to adapt such software for use in teaching forestry technology. The search for applicable…

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…

In Search of the Unifying Principles of Psychotherapy: Conceptual, Empirical, and Clinical Convergence

ERIC Educational Resources Information Center

Magnavita, Jeffrey J.

2006-01-01

The search for the principles of unified psychotherapy is an important stage in the advancement of the field. Converging evidence from various streams of clinical science allows the identification of some of the major domains of human functioning, adaptation, and dysfunction. These principles, supported by animal modeling, neuroscience, and…

Effect of randomness on multi-frequency aeroelastic responses resolved by Unsteady Adaptive Stochastic Finite Elements

NASA Astrophysics Data System (ADS)

Witteveen, Jeroen A. S.; Bijl, Hester

2009-10-01

The Unsteady Adaptive Stochastic Finite Elements (UASFE) method resolves the effect of randomness in numerical simulations of single-mode aeroelastic responses with a constant accuracy in time for a constant number of samples. In this paper, the UASFE framework is extended to multi-frequency responses and continuous structures by employing a wavelet decomposition pre-processing step to decompose the sampled multi-frequency signals into single-frequency components. The effect of the randomness on the multi-frequency response is then obtained by summing the results of the UASFE interpolation at constant phase for the different frequency components. Results for multi-frequency responses and continuous structures show a three orders of magnitude reduction of computational costs compared to crude Monte Carlo simulations in a harmonically forced oscillator, a flutter panel problem, and the three-dimensional transonic AGARD 445.6 wing aeroelastic benchmark subject to random fields and random parameters with various probability distributions.

Performance of Point and Range Queries for In-memory Databases using Radix Trees on GPUs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alam, Maksudul; Yoginath, Srikanth B; Perumalla, Kalyan S

In in-memory database systems augmented by hardware accelerators, accelerating the index searching operations can greatly increase the runtime performance of database queries. Recently, adaptive radix trees (ART) have been shown to provide very fast index search implementation on the CPU. Here, we focus on an accelerator-based implementation of ART. We present a detailed performance study of our GPU-based adaptive radix tree (GRT) implementation over a variety of key distributions, synthetic benchmarks, and actual keys from music and book data sets. The performance is also compared with other index-searching schemes on the GPU. GRT on modern GPUs achieves some of themore » highest rates of index searches reported in the literature. For point queries, a throughput of up to 106 million and 130 million lookups per second is achieved for sparse and dense keys, respectively. For range queries, GRT yields 600 million and 1000 million lookups per second for sparse and dense keys, respectively, on a large dataset of 64 million 32-bit keys.« less

Selection on male size, leg length and condition during mate search in a sexually highly dimorphic orb-weaving spider.

PubMed

Foellmer, Matthias W; Fairbairn, Daphne J

2005-02-01

Mate search plays a central role in hypotheses for the adaptive significance of extreme female-biased sexual size dimorphism (SSD) in animals. Spiders (Araneae) are the only free-living terrestrial taxon where extreme SSD is common. The "gravity hypothesis" states that small body size in males is favoured during mate search in species where males have to climb to reach females, because body length is inversely proportional to achievable speed on vertical structures. However, locomotive performance of males may also depend on relative leg length. Here we examine selection on male body size and leg length during mate search in the highly dimorphic orb-weaving spider Argiope aurantia, using a multivariate approach to distinguish selection targeted at different components of size. Further, we investigate the scaling relationships between male size and energy reserves, and the differential loss of reserves. Adult males do not feed while roving, and a size-dependent differential energy storage capacity may thus affect male performance during mate search. Contrary to predictions, large body size was favoured in one of two populations, and this was due to selection for longer legs. Male size was not under selection in the second population, but we detected direct selection for longer third legs. Males lost energy reserves during mate search, but this was independent of male size and storage capacity scaled isometrically with size. Thus, mate search is unlikely to lead to selection for small male size, but the hypothesis that relatively longer legs in male spiders reflect a search-adapted morphology is supported.

A novel clinical decision support system using improved adaptive genetic algorithm for the assessment of fetal well-being.

PubMed

Ravindran, Sindhu; Jambek, Asral Bahari; Muthusamy, Hariharan; Neoh, Siew-Chin

2015-01-01

A novel clinical decision support system is proposed in this paper for evaluating the fetal well-being from the cardiotocogram (CTG) dataset through an Improved Adaptive Genetic Algorithm (IAGA) and Extreme Learning Machine (ELM). IAGA employs a new scaling technique (called sigma scaling) to avoid premature convergence and applies adaptive crossover and mutation techniques with masking concepts to enhance population diversity. Also, this search algorithm utilizes three different fitness functions (two single objective fitness functions and multi-objective fitness function) to assess its performance. The classification results unfold that promising classification accuracy of 94% is obtained with an optimal feature subset using IAGA. Also, the classification results are compared with those of other Feature Reduction techniques to substantiate its exhaustive search towards the global optimum. Besides, five other benchmark datasets are used to gauge the strength of the proposed IAGA algorithm.

Exploring neutral and adaptive processes in expanding populations of gilthead sea bream, Sparus aurata L., in the North-East Atlantic.

PubMed

Coscia, I; Vogiatzi, E; Kotoulas, G; Tsigenopoulos, C S; Mariani, S

2012-05-01

Recent studies in empirical population genetics have highlighted the importance of taking into account both neutral and adaptive genetic variation in characterizing microevolutionary dynamics. Here, we explore the genetic population structure and the footprints of selection in four populations of the warm-temperate coastal fish, the gilthead sea bream (Sparus aurata), whose recent northward expansion has been linked to climate change. Samples were collected at four Atlantic locations, including Spain, Portugal, France and the South of Ireland, and genetically assayed using a suite of species-specific markers, including 15 putatively neutral microsatellites and 23 expressed sequence tag-linked markers, as well as a portion of the mitochondrial DNA (mtDNA) control region. Two of the putatively neutral markers, Bld-10 and Ad-10, bore signatures of strong directional selection, particularly in the newly established Irish population, although the potential 'surfing effect' of rare alleles at the edge of the expansion front was also considered. Analyses after the removal of these loci suggest low but significant population structure likely affected by some degree of gene flow counteracting random genetic drift. No signal of historic divergence was detected at mtDNA. BLAST searches conducted with all 38 markers used failed to identify specific genomic regions associated to adaptive functions. However, the availability of genomic resources for this commercially valuable species is rapidly increasing, bringing us closer to the understanding of the interplay between selective and neutral evolutionary forces, shaping population divergence of an expanding species in a heterogeneous milieu.

Enhancing Student Motivation and Learning within Adaptive Tutors

ERIC Educational Resources Information Center

Ostrow, Korinn S.

2015-01-01

My research is rooted in improving K-12 educational practice using motivational facets made possible through adaptive tutoring systems. In an attempt to isolate best practices within the science of learning, I conduct randomized controlled trials within ASSISTments, an online adaptive tutoring system that provides assistance and assessment to…

A pilot randomized controlled trial to decrease adaptation difficulties in chinese new immigrants to Hong Kong.

PubMed

Yu, Xiaonan; Stewart, Sunita M; Chui, Jolian P L; Ho, Joy L Y; Li, Anthony C H; Lam, Tai Hing

2014-01-01

Immigration occurs globally, and immigrants are vulnerable to the development of adaptation difficulties. Little evidence is available for effective programs to enhance immigrant adaptation outside of the West. This pilot randomized controlled trial tested the effectiveness of two interventions used to decrease adaptation difficulties by (a) providing knowledge of resources that are relevant to the Hong Kong context or (b) enhancing personal resilience in immigrants to Hong Kong from Mainland China. A total of 220 participants were randomly assigned to three conditions: information, resilience, or control arms. They completed measures on adaptation difficulties, knowledge, and personal resilience at baseline, immediately after the intervention (postintervention), and at a 3-month follow-up. The information intervention resulted in higher increases postintervention in knowledge than did the other two arms. The resilience intervention reported greater increases in personal resilience than did the control arm at both postintervention and 3 months later; it also reported greater increases than the information arm did at the 3-month follow-up. Although both interventions reported greater decreases in adaptation difficulties than the control arm did at postintervention and 3 months later, no significant differences were found when they were compared with each other at both time points. Both programs had high acceptability and were feasible to implement in the community. Change in knowledge had no significant mediation effect on adaption difficulties, but change in personal resilience from baseline to postintervention mediated the effect of the intervention on the outcome of adaptation difficulties at the 3-month follow-up. These findings indicate evidence for benefits of the information and resilience interventions, and they inform further development of our programs. Copyright © 2013. Published by Elsevier Ltd.

Time-optimal trajectory planning for underactuated spacecraft using a hybrid particle swarm optimization algorithm

NASA Astrophysics Data System (ADS)

Zhuang, Yufei; Huang, Haibin

2014-02-01

A hybrid algorithm combining particle swarm optimization (PSO) algorithm with the Legendre pseudospectral method (LPM) is proposed for solving time-optimal trajectory planning problem of underactuated spacecrafts. At the beginning phase of the searching process, an initialization generator is constructed by the PSO algorithm due to its strong global searching ability and robustness to random initial values, however, PSO algorithm has a disadvantage that its convergence rate around the global optimum is slow. Then, when the change in fitness function is smaller than a predefined value, the searching algorithm is switched to the LPM to accelerate the searching process. Thus, with the obtained solutions by the PSO algorithm as a set of proper initial guesses, the hybrid algorithm can find a global optimum more quickly and accurately. 200 Monte Carlo simulations results demonstrate that the proposed hybrid PSO-LPM algorithm has greater advantages in terms of global searching capability and convergence rate than both single PSO algorithm and LPM algorithm. Moreover, the PSO-LPM algorithm is also robust to random initial values.

Multi-fidelity and multi-disciplinary design optimization of supersonic business jets

NASA Astrophysics Data System (ADS)

Choi, Seongim

Supersonic jets have been drawing great attention after the end of service for the Concorde was announced on April of 2003. It is believed, however, that civilian supersonic aircraft may make a viable return in the business jet market. This thesis focuses on the design optimization of feasible supersonic business jet configurations. Preliminary design techniques for mitigation of ground sonic boom are investigated while ensuring that all relevant disciplinary constraints are satisfied (including aerodynamic performance, propulsion, stability & control and structures.) In order to achieve reasonable confidence in the resulting designs, high-fidelity simulations are required, making the entire design process both expensive and complex. In order to minimize the computational cost, surrogate/approximate models are constructed using a hierarchy of different fidelity analysis tools including PASS, A502/Panair and Euler/NS codes. Direct search methods such as Genetic Algorithms (GAs) and a nonlinear SIMPLEX are employed to designs in searches of large and noisy design spaces. A local gradient-based search method can be combined with these global search methods for small modifications of candidate optimum designs. The Mesh Adaptive Direct Search (MADS) method can also be used to explore the design space using a solution-adaptive grid refinement approach. These hybrid approaches, both in search methodology and surrogate model construction, are shown to result in designs with reductions in sonic boom and improved aerodynamic performance.

Adaptation to Temporally Fluctuating Environments by the Evolution of Maternal Effects.

PubMed

Dey, Snigdhadip; Proulx, Stephen R; Teotónio, Henrique

2016-02-01

All organisms live in temporally fluctuating environments. Theory predicts that the evolution of deterministic maternal effects (i.e., anticipatory maternal effects or transgenerational phenotypic plasticity) underlies adaptation to environments that fluctuate in a predictably alternating fashion over maternal-offspring generations. In contrast, randomizing maternal effects (i.e., diversifying and conservative bet-hedging), are expected to evolve in response to unpredictably fluctuating environments. Although maternal effects are common, evidence for their adaptive significance is equivocal since they can easily evolve as a correlated response to maternal selection and may or may not increase the future fitness of offspring. Using the hermaphroditic nematode Caenorhabditis elegans, we here show that the experimental evolution of maternal glycogen provisioning underlies adaptation to a fluctuating normoxia-anoxia hatching environment by increasing embryo survival under anoxia. In strictly alternating environments, we found that hermaphrodites evolved the ability to increase embryo glycogen provisioning when they experienced normoxia and to decrease embryo glycogen provisioning when they experienced anoxia. At odds with existing theory, however, populations facing irregularly fluctuating normoxia-anoxia hatching environments failed to evolve randomizing maternal effects. Instead, adaptation in these populations may have occurred through the evolution of fitness effects that percolate over multiple generations, as they maintained considerably high expected growth rates during experimental evolution despite evolving reduced fecundity and reduced embryo survival under one or two generations of anoxia. We develop theoretical models that explain why adaptation to a wide range of patterns of environmental fluctuations hinges on the existence of deterministic maternal effects, and that such deterministic maternal effects are more likely to contribute to adaptation than randomizing maternal effects.

Adaptation to Temporally Fluctuating Environments by the Evolution of Maternal Effects

PubMed Central

Dey, Snigdhadip; Proulx, Stephen R.; Teotónio, Henrique

2016-01-01

All organisms live in temporally fluctuating environments. Theory predicts that the evolution of deterministic maternal effects (i.e., anticipatory maternal effects or transgenerational phenotypic plasticity) underlies adaptation to environments that fluctuate in a predictably alternating fashion over maternal-offspring generations. In contrast, randomizing maternal effects (i.e., diversifying and conservative bet-hedging), are expected to evolve in response to unpredictably fluctuating environments. Although maternal effects are common, evidence for their adaptive significance is equivocal since they can easily evolve as a correlated response to maternal selection and may or may not increase the future fitness of offspring. Using the hermaphroditic nematode Caenorhabditis elegans, we here show that the experimental evolution of maternal glycogen provisioning underlies adaptation to a fluctuating normoxia–anoxia hatching environment by increasing embryo survival under anoxia. In strictly alternating environments, we found that hermaphrodites evolved the ability to increase embryo glycogen provisioning when they experienced normoxia and to decrease embryo glycogen provisioning when they experienced anoxia. At odds with existing theory, however, populations facing irregularly fluctuating normoxia–anoxia hatching environments failed to evolve randomizing maternal effects. Instead, adaptation in these populations may have occurred through the evolution of fitness effects that percolate over multiple generations, as they maintained considerably high expected growth rates during experimental evolution despite evolving reduced fecundity and reduced embryo survival under one or two generations of anoxia. We develop theoretical models that explain why adaptation to a wide range of patterns of environmental fluctuations hinges on the existence of deterministic maternal effects, and that such deterministic maternal effects are more likely to contribute to adaptation than randomizing maternal effects. PMID:26910440

Rivals in the dark: how competition influences search in decisions under uncertainty.

PubMed

Phillips, Nathaniel D; Hertwig, Ralph; Kareev, Yaakov; Avrahami, Judith

2014-10-01

In choices between uncertain options, information search can increase the chances of distinguishing good from bad options. However, many choices are made in the presence of other choosers who may seize the better option while one is still engaged in search. How long do (and should) people search before choosing between uncertain options in the presence of such competition? To address this question, we introduce a new experimental paradigm called the competitive sampling game. We use both simulation and empirical data to compare search and choice between competitive and solitary environments. Simulation results show that minimal search is adaptive when one expects competitors to choose quickly or is uncertain about how long competitors will search. Descriptively, we observe that competition drastically reduces information search prior to choice. Copyright © 2014 Elsevier B.V. All rights reserved.

Using Bayesian Adaptive Trial Designs for Comparative Effectiveness Research: A Virtual Trial Execution.

PubMed

Luce, Bryan R; Connor, Jason T; Broglio, Kristine R; Mullins, C Daniel; Ishak, K Jack; Saunders, Elijah; Davis, Barry R

2016-09-20

Bayesian and adaptive clinical trial designs offer the potential for more efficient processes that result in lower sample sizes and shorter trial durations than traditional designs. To explore the use and potential benefits of Bayesian adaptive clinical trial designs in comparative effectiveness research. Virtual execution of ALLHAT (Antihypertensive and Lipid-Lowering Treatment to Prevent Heart Attack Trial) as if it had been done according to a Bayesian adaptive trial design. Comparative effectiveness trial of antihypertensive medications. Patient data sampled from the more than 42 000 patients enrolled in ALLHAT with publicly available data. Number of patients randomly assigned between groups, trial duration, observed numbers of events, and overall trial results and conclusions. The Bayesian adaptive approach and original design yielded similar overall trial conclusions. The Bayesian adaptive trial randomly assigned more patients to the better-performing group and would probably have ended slightly earlier. This virtual trial execution required limited resampling of ALLHAT patients for inclusion in RE-ADAPT (REsearch in ADAptive methods for Pragmatic Trials). Involvement of a data monitoring committee and other trial logistics were not considered. In a comparative effectiveness research trial, Bayesian adaptive trial designs are a feasible approach and potentially generate earlier results and allocate more patients to better-performing groups. National Heart, Lung, and Blood Institute.

Randomly iterated search and statistical competency as powerful inversion tools for deformation source modeling: Application to volcano interferometric synthetic aperture radar data

NASA Astrophysics Data System (ADS)

Shirzaei, M.; Walter, T. R.

2009-10-01

Modern geodetic techniques provide valuable and near real-time observations of volcanic activity. Characterizing the source of deformation based on these observations has become of major importance in related monitoring efforts. We investigate two random search approaches, simulated annealing (SA) and genetic algorithm (GA), and utilize them in an iterated manner. The iterated approach helps to prevent GA in general and SA in particular from getting trapped in local minima, and it also increases redundancy for exploring the search space. We apply a statistical competency test for estimating the confidence interval of the inversion source parameters, considering their internal interaction through the model, the effect of the model deficiency, and the observational error. Here, we present and test this new randomly iterated search and statistical competency (RISC) optimization method together with GA and SA for the modeling of data associated with volcanic deformations. Following synthetic and sensitivity tests, we apply the improved inversion techniques to two episodes of activity in the Campi Flegrei volcanic region in Italy, observed by the interferometric synthetic aperture radar technique. Inversion of these data allows derivation of deformation source parameters and their associated quality so that we can compare the two inversion methods. The RISC approach was found to be an efficient method in terms of computation time and search results and may be applied to other optimization problems in volcanic and tectonic environments.

Why Are There Different Languages? The Role of Adaptation in Linguistic Diversity.

PubMed

Lupyan, Gary; Dale, Rick

2016-09-01

Why are there different languages? A common explanation is that different languages arise from the gradual accumulation of random changes. Here, we argue that, beyond these random factors, linguistic differences, from sounds to grammars, may also reflect adaptations to different environments in which the languages are learned and used. The aspects of the environment that could shape language include the social, the physical, and the technological. Copyright © 2016 Elsevier Ltd. All rights reserved.

Characteristics of Social-Psychological Adaptation and Self-Regulation in Patients with Diabetes Mellitus

ERIC Educational Resources Information Center

Tsv?tkova, Nadezhda A.; Aleksandrova, Marina I.; Rybakova, Anna Igorevna; Starovoitova, Larisa I.; Kononova, Tatiana B.

2016-01-01

The article presents the results of searching for answers to the following questions: Which are the characteristics of socio-psychological adaptation and self-regulation behavior in patients with diabetes mellitus type II? What is the nature of the relationship between these personal characteristics? In particular, it contains results of…

Effects of fasted vs fed-state exercise on performance and post-exercise metabolism: A systematic review and meta-analysis.

PubMed

Aird, T P; Davies, R W; Carson, B P

2018-05-01

The effects of nutrition on exercise metabolism and performance remain an important topic among sports scientists, clinical, and athletic populations. Recently, fasted exercise has garnered interest as a beneficial stimulus which induces superior metabolic adaptations to fed exercise in key peripheral tissues. Conversely, pre-exercise feeding augments exercise performance compared with fasting conditions. Given these seemingly divergent effects on performance and metabolism, an appraisal of the literature is warranted. This review determined the effects of fasting vs pre-exercise feeding on continuous aerobic and anaerobic or intermittent exercise performance, and post-exercise metabolic adaptations. A search was performed using the MEDLINE and PubMed search engines. The literature search identified 46 studies meeting the relevant inclusion criteria. The Delphi list was used to assess study quality. A meta-analysis and meta-regression were performed where appropriate. Findings indicated that pre-exercise feeding enhanced prolonged (P = .012), but not shorter duration aerobic exercise performance (P = .687). Fasted exercise increased post-exercise circulating FFAs (P = .023) compared to fed exercise. It is evidenced that pre-exercise feeding blunted signaling in skeletal muscle and adipose tissue implicated in regulating components of metabolism, including mitochondrial adaptation and substrate utilization. This review's findings support the hypothesis that the fasted and fed conditions can divergently influence exercise metabolism and performance. Pre-exercise feeding bolsters prolonged aerobic performance, while seminal evidence highlights potential beneficial metabolic adaptations that fasted exercise may induce in peripheral tissues. However, further research is required to fully elucidate the acute and chronic physiological adaptations to fasted vs fed exercise. © 2018 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Adaptive building skin structures

NASA Astrophysics Data System (ADS)

Del Grosso, A. E.; Basso, P.

2010-12-01

The concept of adaptive and morphing structures has gained considerable attention in the recent years in many fields of engineering. In civil engineering very few practical applications are reported to date however. Non-conventional structural concepts like deployable, inflatable and morphing structures may indeed provide innovative solutions to some of the problems that the construction industry is being called to face. To give some examples, searches for low-energy consumption or even energy-harvesting green buildings are amongst such problems. This paper first presents a review of the above problems and technologies, which shows how the solution to these problems requires a multidisciplinary approach, involving the integration of architectural and engineering disciplines. The discussion continues with the presentation of a possible application of two adaptive and dynamically morphing structures which are proposed for the realization of an acoustic envelope. The core of the two applications is the use of a novel optimization process which leads the search for optimal solutions by means of an evolutionary technique while the compatibility of the resulting configurations of the adaptive envelope is ensured by the virtual force density method.

Shape and Color Features for Object Recognition Search

NASA Technical Reports Server (NTRS)

Duong, Tuan A.; Duong, Vu A.; Stubberud, Allen R.

2012-01-01

A bio-inspired shape feature of an object of interest emulates the integration of the saccadic eye movement and horizontal layer in vertebrate retina for object recognition search where a single object can be used one at a time. The optimal computational model for shape-extraction-based principal component analysis (PCA) was also developed to reduce processing time and enable the real-time adaptive system capability. A color feature of the object is employed as color segmentation to empower the shape feature recognition to solve the object recognition in the heterogeneous environment where a single technique - shape or color - may expose its difficulties. To enable the effective system, an adaptive architecture and autonomous mechanism were developed to recognize and adapt the shape and color feature of the moving object. The bio-inspired object recognition based on bio-inspired shape and color can be effective to recognize a person of interest in the heterogeneous environment where the single technique exposed its difficulties to perform effective recognition. Moreover, this work also demonstrates the mechanism and architecture of the autonomous adaptive system to enable the realistic system for the practical use in the future.

Micro-Randomized Trials: An Experimental Design for Developing Just-in-Time Adaptive Interventions

PubMed Central

Klasnja, Predrag; Hekler, Eric B.; Shiffman, Saul; Boruvka, Audrey; Almirall, Daniel; Tewari, Ambuj; Murphy, Susan A.

2015-01-01

Objective This paper presents an experimental design, the micro-randomized trial, developed to support optimization of just-in-time adaptive interventions (JITAIs). JITAIs are mHealth technologies that aim to deliver the right intervention components at the right times and locations to optimally support individuals’ health behaviors. Micro-randomized trials offer a way to optimize such interventions by enabling modeling of causal effects and time-varying effect moderation for individual intervention components within a JITAI. Methods The paper describes the micro-randomized trial design, enumerates research questions that this experimental design can help answer, and provides an overview of the data analyses that can be used to assess the causal effects of studied intervention components and investigate time-varying moderation of those effects. Results Micro-randomized trials enable causal modeling of proximal effects of the randomized intervention components and assessment of time-varying moderation of those effects. Conclusions Micro-randomized trials can help researchers understand whether their interventions are having intended effects, when and for whom they are effective, and what factors moderate the interventions’ effects, enabling creation of more effective JITAIs. PMID:26651463

Uncoordinated MAC for Adaptive Multi Beam Directional Networks: Analysis and Evaluation

DTIC Science & Technology

2016-08-01

control (MAC) policies for emerging systems that are equipped with fully digital antenna arrays which are capable of adaptive multi-beam directional...Adaptive Beam- forming, Multibeam, Directional Networking, Random Access, Smart Antennas I. INTRODUCTION Fully digital beamforming antenna arrays that...are capable of adaptive multi-beam communications are quickly becoming a reality. These antenna arrays allow users to form multiple simultaneous

Iterative repair for scheduling and rescheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte; Davis, Eugene; Deale, Michael

1991-01-01

An iterative repair search method is described called constraint based simulated annealing. Simulated annealing is a hill climbing search technique capable of escaping local minima. The utility of the constraint based framework is shown by comparing search performance with and without the constraint framework on a suite of randomly generated problems. Results are also shown of applying the technique to the NASA Space Shuttle ground processing problem. These experiments show that the search methods scales to complex, real world problems and reflects interesting anytime behavior.

Urineschool: A Study of the Impact of the Earls Decision on High School Random Drug Testing Policies.

ERIC Educational Resources Information Center

Conlon, Cynthia Kelly

2003-01-01

Examines impact of Supreme Court's 2002 decision in "Board of Education v. Earls" on high school random drug-testing policies and practices. Court held that random drug-testing policy at Tecumseh, Oklahoma, school district did not violate students' Fourth Amendment right against unreasonable searches. (Contains 46 references.) (PKP)

Dynamic pattern matcher using incomplete data

NASA Technical Reports Server (NTRS)

Johnson, Gordon G. (Inventor); Wang, Lui (Inventor)

1993-01-01

This invention relates generally to pattern matching systems, and more particularly to a method for dynamically adapting the system to enhance the effectiveness of a pattern match. Apparatus and methods for calculating the similarity between patterns are known. There is considerable interest, however, in the storage and retrieval of data, particularly, when the search is called or initiated by incomplete information. For many search algorithms, a query initiating a data search requires exact information, and the data file is searched for an exact match. Inability to find an exact match thus results in a failure of the system or method.

Memory-efficient table look-up optimized algorithm for context-based adaptive variable length decoding in H.264/advanced video coding

NASA Astrophysics Data System (ADS)

Wang, Jianhua; Cheng, Lianglun; Wang, Tao; Peng, Xiaodong

2016-03-01

Table look-up operation plays a very important role during the decoding processing of context-based adaptive variable length decoding (CAVLD) in H.264/advanced video coding (AVC). However, frequent table look-up operation can result in big table memory access, and then lead to high table power consumption. Aiming to solve the problem of big table memory access of current methods, and then reduce high power consumption, a memory-efficient table look-up optimized algorithm is presented for CAVLD. The contribution of this paper lies that index search technology is introduced to reduce big memory access for table look-up, and then reduce high table power consumption. Specifically, in our schemes, we use index search technology to reduce memory access by reducing the searching and matching operations for code_word on the basis of taking advantage of the internal relationship among length of zero in code_prefix, value of code_suffix and code_lengh, thus saving the power consumption of table look-up. The experimental results show that our proposed table look-up algorithm based on index search can lower about 60% memory access consumption compared with table look-up by sequential search scheme, and then save much power consumption for CAVLD in H.264/AVC.

Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

PubMed

Smith, J E

2012-01-01

Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes outperform global reward schemes in combinatorial spaces, unlike in continuous spaces. An analysis of evolving meme behaviour is used to explain these findings.

The effects of aquatic therapy on mobility of individuals with neurological diseases: a systematic review.

PubMed

Marinho-Buzelli, Andresa R; Bonnyman, Alison M; Verrier, Mary C

2015-08-01

To summarize evidence on the effects of aquatic therapy on mobility in individuals with neurological diseases. MEDLINE, EMBASE, PsycInfo, CENTRAL, CINAHL, SPORTDiscus, PEDro, PsycBITE and OT Seeker were searched from inception to 15 September 2014. Hand-searching of reference lists was performed in the selected studies. The search included randomized controlled trials and quasi-experimental studies that investigated the use of aquatic therapy and its effect on mobility of adults with neurological diseases. One reviewer screened titles and abstracts of retrieved studies from the search strategy. Two reviewers independently examined the full texts and conducted the study selection, data extraction and quality assessment. A narrative synthesis of data was applied to summarize information from included studies. The Downs and Black Scale was used to assess methodological quality. A total of 116 articles were obtained for full text eligibility. Twenty studies met the specified inclusion criteria: four Randomized Controlled Trials (RCTs), four non-randomized studies and 12 before-and-after tests. Two RCTs (30 patients with stroke in the aquatic therapy groups), three non-randomized studies and three before-and-after studies showed "fair" evidence that aquatic therapy increases dynamic balance in participants with some neurological disorders. One RCT (seven patients with stroke in the aquatic therapy group) and two before-and-after tests (20 patients with multiple sclerosis) demonstrated "fair" evidence on improvement of gait speed after aquatic therapy. Our synthesis showed "fair" evidence supporting the use of aquatic therapy to improve dynamic balance and gait speed in adults with certain neurological conditions. © The Author(s) 2014.

Prism adaptation enhances activity of intact fronto-parietal areas in both hemispheres in neglect patients.

PubMed

Saj, Arnaud; Cojan, Yann; Vocat, Roland; Luauté, Jacques; Vuilleumier, Patrik

2013-01-01

Unilateral spatial neglect involves a failure to report or orient to stimuli in the contralesional (left) space due to right brain damage, with severe handicap in everyday activities and poor rehabilitation outcome. Because behavioral studies suggest that prism adaptation may reduce spatial neglect, we investigated the neural mechanisms underlying prism effects on visuo-spatial processing in neglect patients. We used functional magnetic resonance imaging (fMRI) to examine the effect of (right-deviating) prisms on seven patients with left neglect, by comparing brain activity while they performed three different spatial tasks on the same visual stimuli (bisection, search, and memory), before and after a single prism-adaptation session. Following prism adaptation, fMRI data showed increased activation in bilateral parietal, frontal, and occipital cortex during bisection and visual search, but not during the memory task. These increases were associated with significant behavioral improvement in the same two tasks. Changes in neural activity and behavior were seen only after prism adaptation, but not attributable to mere task repetition. These results show for the first time the neural substrates underlying the therapeutic benefits of prism adaptation, and demonstrate that visuo-motor adaptation induced by prism exposure can restore activation in bilateral brain networks controlling spatial attention and awareness. This bilateral recruitment of fronto-parietal networks may counteract the pathological biases produced by unilateral right hemisphere damage, consistent with recent proposals that neglect may reflect lateralized deficits induced by bilateral hemispheric dysfunction. Copyright © 2011 Elsevier Ltd. All rights reserved.

Studying the Effectiveness of an Online Language Learning Platform in China

ERIC Educational Resources Information Center

Baker, Ryan; Wang, Feng; Ma, Zhenjun; Ma, Wei; Zheng, Shiyue

2018-01-01

In this paper we evaluate the effectiveness of an adaptive online learning platform, designed to support Chinese students in learning the English language. The adaptive platform is studied in three studies, where the experimental platform is compared to an alternate, non-adaptive platform, with random assignment to conditions (the adaptive…

Adaptive neuro-heuristic hybrid model for fruit peel defects detection.

PubMed

Woźniak, Marcin; Połap, Dawid

2018-02-01

Fusion of machine learning methods benefits in decision support systems. A composition of approaches gives a possibility to use the most efficient features composed into one solution. In this article we would like to present an approach to the development of adaptive method based on fusion of proposed novel neural architecture and heuristic search into one co-working solution. We propose a developed neural network architecture that adapts to processed input co-working with heuristic method used to precisely detect areas of interest. Input images are first decomposed into segments. This is to make processing easier, since in smaller images (decomposed segments) developed Adaptive Artificial Neural Network (AANN) processes less information what makes numerical calculations more precise. For each segment a descriptor vector is composed to be presented to the proposed AANN architecture. Evaluation is run adaptively, where the developed AANN adapts to inputs and their features by composed architecture. After evaluation, selected segments are forwarded to heuristic search, which detects areas of interest. As a result the system returns the image with pixels located over peel damages. Presented experimental research results on the developed solution are discussed and compared with other commonly used methods to validate the efficacy and the impact of the proposed fusion in the system structure and training process on classification results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Multipath search coding of stationary signals with applications to speech

NASA Astrophysics Data System (ADS)

Fehn, H. G.; Noll, P.

1982-04-01

This paper deals with the application of multipath search coding (MSC) concepts to the coding of stationary memoryless and correlated sources, and of speech signals, at a rate of one bit per sample. Use is made of three MSC classes: (1) codebook coding, or vector quantization, (2) tree coding, and (3) trellis coding. This paper explains the performances of these coders and compares them both with those of conventional coders and with rate-distortion bounds. The potentials of MSC coding strategies are demonstrated by illustrations. The paper reports also on results of MSC coding of speech, where both the strategy of adaptive quantization and of adaptive prediction were included in coder design.

Orthodontic treatment in periodontitis‐susceptible subjects: a systematic literature review

PubMed Central

Lindsten, Rune; Slotte, Christer; Bjerklin, Krister

2016-01-01

Abstract The aim is to evaluate the literature for clinical scientific data on possible effects of orthodontic treatment on periodontal status in periodontitis‐susceptible subjects. A systematic literature review was performed on studies in English using PubMed, MEDLINE, and Cochrane Library central databases (1965‐2014). By manually searching reference lists of selected studies, we identified additional articles; then we searched these publications: Journal of Periodontology, Periodontology 2000, Journal of Clinical Periodontology, American Journal of Orthodontics and Dentofacial Orthopedics, Angle Orthodontist, International Journal of Periodontics & Restorative Dentistry, and European Journal of Orthodontics. Search terms included randomized clinical trials, controlled clinical trials, prospective and retrospective clinical studies, case series >5 patients, periodontitis, orthodontics, alveolar bone loss, tooth migration, tooth movement, orthodontic extrusion, and orthodontic intrusion. Only studies on orthodontic treatment in periodontally compromised dentitions were included. One randomized controlled clinical trial, one controlled clinical trial, and 12 clinical studies were included. No evidence currently exists from controlled studies and randomized controlled clinical trials, which shows that orthodontic treatment improves or aggravates the status of periodontally compromised dentitions. PMID:29744163

Adaptive mechanism-based congestion control for networked systems

NASA Astrophysics Data System (ADS)

Liu, Zhi; Zhang, Yun; Chen, C. L. Philip

2013-03-01

In order to assure the communication quality in network systems with heavy traffic and limited bandwidth, a new ATRED (adaptive thresholds random early detection) congestion control algorithm is proposed for the congestion avoidance and resource management of network systems. Different to the traditional AQM (active queue management) algorithms, the control parameters of ATRED are not configured statically, but dynamically adjusted by the adaptive mechanism. By integrating with the adaptive strategy, ATRED alleviates the tuning difficulty of RED (random early detection) and shows a better control on the queue management, and achieve a more robust performance than RED under varying network conditions. Furthermore, a dynamic transmission control protocol-AQM control system using ATRED controller is introduced for the systematic analysis. It is proved that the stability of the network system can be guaranteed when the adaptive mechanism is finely designed. Simulation studies show the proposed ATRED algorithm achieves a good performance in varying network environments, which is superior to the RED and Gentle-RED algorithm, and providing more reliable service under varying network conditions.

Multidimensional Perfectionism and Burnout: A Meta-Analysis.

PubMed

Hill, Andrew P; Curran, Thomas

2016-08-01

A meta-analysis of research examining the relationships between multidimensional perfectionism and burnout is provided. In doing so, relationships before and after controlling for the relationship between dimensions of perfectionism were examined along with whether relationships were moderated by domain (work, sport, or education). A literature search yielded 43 studies (N = 9,838) and 663 effect sizes. Meta-analysis using random-effects models revealed that perfectionistic strivings had small negative or non-significant relationships with overall burnout and symptoms of burnout. By contrast, perfectionistic concerns displayed medium-to-large and medium positive relationships with overall burnout and symptoms of burnout. After controlling for the relationship between dimensions of perfectionism, "pure" perfectionistic strivings displayed notably larger negative relationships. In terms of moderation, in some cases, perfectionistic strivings were less adaptive and perfectionistic concerns more maladaptive in the work domain. Future research should examine explanatory mechanisms, adopt longitudinal designs, and develop interventions to reduce perfectionistic concerns fueled burnout. © 2015 by the Society for Personality and Social Psychology, Inc.

Isolation and characterization of lymphocyte-like cells from a lamprey

PubMed Central

Mayer, Werner E.; Uinuk-ool, Tatiana; Tichy, Herbert; Gartland, Lanier A.; Klein, Jan; Cooper, Max D.

2002-01-01

Lymphocyte-like cells in the intestine of the sea lamprey, Petromyzon marinus, were isolated by flow cytometry under light-scatter conditions used for the purification of mouse intestinal lymphocytes. The purified lamprey cells were morphologically indistinguishable from mammalian lymphocytes. A cDNA library was prepared from the lamprey lymphocyte-like cells, and more than 8,000 randomly selected clones were sequenced. Homology searches comparing these ESTs with sequences deposited in the databases led to the identification of numerous genes homologous to those predominantly or characteristically expressed in mammalian lymphocytes, which included genes controlling lymphopoiesis, intracellular signaling, proliferation, migration, and involvement of lymphocytes in innate immune responses. Genes closely related to those that in gnathostomes control antigen processing and transport of antigenic peptides could be ascertained, although no sequences with significant similarity to MHC, T cell receptor, or Ig genes were found. The data suggest that the evolution of lymphocytes in the lamprey has reached a stage poised for the emergence of adaptive immunity. PMID:12388781

Evidence for the Implementation of the Early Start Denver Model for Young Children With Autism Spectrum Disorder.

PubMed

Ryberg, Kayce H

2015-01-01

The Early Start Denver Model (ESDM) is a manualized comprehensive therapy for toddlers with autism spectrum disorder. It emphasizes interpersonal engagement through synchrony, rhythms, and reciprocity to decrease symptom severity and accelerate cognitive, social-emotional, and language development. To systematically review evidence regarding the use of the ESDM as an intervention for young children with autism spectrum disorder. PubMed, Scopus, Web of Science, Embase, and CINAHL were searched from 2010-2015 using predetermined inclusion criteria. Study methodology, participant characteristics, and outcomes were evaluated and quality of evidence was assigned. Eight articles met inclusion criteria and consisted of two randomized controlled trials, four controlled trials, and two observational cohort studies. Evidence quality ranged from low to high. The ESDM is an effective intervention that improves cognition, language, and adaptive behavior. ESDM strategies delivered in community group settings and in the home by parents have potential to be efficacious and feasible. © The Author(s) 2015.

Navigation of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments

NASA Astrophysics Data System (ADS)

Jin, Xin; Ray, Asok

2014-04-01

In the context of oil spill cleaning by autonomous vehicles in dynamic and uncertain environments, this paper presents a multi-resolution algorithm that seamlessly integrates the concepts of local navigation and global navigation based on the sensory information; the objective here is to enable adaptive decision making and online replanning of vehicle paths. The proposed algorithm provides a complete coverage of the search area for clean-up of the oil spills and does not suffer from the problem of having local minima, which is commonly encountered in potential-field-based methods. The efficacy of the algorithm is tested on a high-fidelity player/stage simulator for oil spill cleaning in a harbour, where the underlying oil weathering process is modelled as 2D random-walk particle tracking. A preliminary version of this paper was presented by X. Jin and A. Ray as 'Coverage Control of Autonomous Vehicles for Oil Spill Cleaning in Dynamic and Uncertain Environments', Proceedings of the American Control Conference, Washington, DC, June 2013, pp. 2600-2605.

Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH.

PubMed

Volk, Jochen; Herrmann, Torsten; Wüthrich, Kurt

2008-07-01

MATCH (Memetic Algorithm and Combinatorial Optimization Heuristics) is a new memetic algorithm for automated sequence-specific polypeptide backbone NMR assignment of proteins. MATCH employs local optimization for tracing partial sequence-specific assignments within a global, population-based search environment, where the simultaneous application of local and global optimization heuristics guarantees high efficiency and robustness. MATCH thus makes combined use of the two predominant concepts in use for automated NMR assignment of proteins. Dynamic transition and inherent mutation are new techniques that enable automatic adaptation to variable quality of the experimental input data. The concept of dynamic transition is incorporated in all major building blocks of the algorithm, where it enables switching between local and global optimization heuristics at any time during the assignment process. Inherent mutation restricts the intrinsically required randomness of the evolutionary algorithm to those regions of the conformation space that are compatible with the experimental input data. Using intact and artificially deteriorated APSY-NMR input data of proteins, MATCH performed sequence-specific resonance assignment with high efficiency and robustness.

A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm.

PubMed

Amoshahy, Mohammad Javad; Shamsi, Mousa; Sedaaghi, Mohammad Hossein

2016-01-01

Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO's parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate.

A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm

PubMed Central

Shamsi, Mousa; Sedaaghi, Mohammad Hossein

2016-01-01

Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO’s parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate. PMID:27560945

Effectiveness of Reablement: A Systematic Review.

PubMed

Tessier, Annie; Beaulieu, Marie-Dominique; Mcginn, Carrie Anna; Latulippe, Renée

2016-05-01

The ageing of the population and the increasing need for long-term care services are global issues. Some countries have adapted homecare programs by introducing an intervention called reablement, which is aimed at optimizing independence. The effectiveness of reablement, as well as its different service models, was examined. A systematic literature review was conducted using MEDLINE, CINAHL, PsycINFO and EBM Reviews to search from 2001 to 2014. Core characteristics and facilitators of reablement implementation were identified from international experiences. Ten studies comprising a total of 14,742 participants (including four randomized trials, most of excellent or good quality) showed a positive impact of reablement, especially on health-related quality of life and service utilization. The implementation of reablement was studied in three regions, and all observed a reduction in healthcare service utilization. Considering its effectiveness and positive impact observed in several countries, the implementation of reablement is a promising avenue to be pursued by policy makers. Copyright © 2016 Longwoods Publishing.

Reporting of the translation and cultural adaptation procedures of the Addenbrooke's Cognitive Examination version III (ACE-III) and its predecessors: a systematic review.

PubMed

Mirza, Nadine; Panagioti, Maria; Waheed, Muhammad Wali; Waheed, Waquas

2017-09-13

The ACE-III, a gold standard for screening cognitive impairment, is restricted by language and culture, with no uniform set of guidelines for its adaptation. To develop guidelines a compilation of all the adaptation procedures undertaken by adapters of the ACE-III and its predecessors is needed. We searched EMBASE, Medline and PsychINFO and screened publications from a previous review. We included publications on adapted versions of the ACE-III and its predecessors, extracting translation and cultural adaptation procedures and assessing their quality. We deemed 32 papers suitable for analysis. 7 translation steps were identified and we determined which items of the ACE-III are culturally dependent. This review lists all adaptations of the ACE, ACE-R and ACE-III, rates the reporting of their adaptation procedures and summarises adaptation procedures into steps that can be undertaken by adapters.

Intervention randomized controlled trials involving wrist and shoulder arthroscopy: a systematic review

PubMed Central

2014-01-01

Background Although arthroscopy of upper extremity joints was initially a diagnostic tool, it is increasingly used for therapeutic interventions. Randomized controlled trials (RCTs) are considered the gold standard for assessing treatment efficacy. We aimed to review the literature for intervention RCTs involving wrist and shoulder arthroscopy. Methods We performed a systematic review for RCTs in which at least one arm was an intervention performed through wrist arthroscopy or shoulder arthroscopy. PubMed and Cochrane Library databases were searched up to December 2012. Two researchers reviewed each article and recorded the condition treated, randomization method, number of randomized participants, time of randomization, outcomes measures, blinding, and description of dropouts and withdrawals. We used the modified Jadad scale that considers the randomization method, blinding, and dropouts/withdrawals; score 0 (lowest quality) to 5 (highest quality). The scores for the wrist and shoulder RCTs were compared with the Mann–Whitney test. Results The first references to both wrist and shoulder arthroscopy appeared in the late 1970s. The search found 4 wrist arthroscopy intervention RCTs (Kienböck’s disease, dorsal wrist ganglia, volar wrist ganglia, and distal radius fracture; first 3 compared arthroscopic with open surgery). The median number of participants was 45. The search found 50 shoulder arthroscopy intervention RCTs (rotator cuff tears 22, instability 14, impingement 9, and other conditions 5). Of these, 31 compared different arthroscopic treatments, 12 compared arthroscopic with open treatment, and 7 compared arthroscopic with nonoperative treatment. The median number of participants was 60. The median modified Jadad score for the wrist RCTs was 0.5 (range 0–1) and for the shoulder RCTs 3.0 (range 0–5) (p = 0.012). Conclusion Despite the increasing use of wrist arthroscopy in the treatment of various wrist disorders the efficacy of arthroscopically performed wrist interventions has been studied in only 4 randomized studies compared to 50 randomized studies of significantly higher quality assessing interventions performed through shoulder arthroscopy. PMID:25059881

Hide and vanish: data sets where the most parsimonious tree is known but hard to find, and their implications for tree search methods.

PubMed

Goloboff, Pablo A

2014-10-01

Three different types of data sets, for which the uniquely most parsimonious tree can be known exactly but is hard to find with heuristic tree search methods, are studied. Tree searches are complicated more by the shape of the tree landscape (i.e. the distribution of homoplasy on different trees) than by the sheer abundance of homoplasy or character conflict. Data sets of Type 1 are those constructed by Radel et al. (2013). Data sets of Type 2 present a very rugged landscape, with narrow peaks and valleys, but relatively low amounts of homoplasy. For such a tree landscape, subjecting the trees to TBR and saving suboptimal trees produces much better results when the sequence of clipping for the tree branches is randomized instead of fixed. An unexpected finding for data sets of Types 1 and 2 is that starting a search from a random tree instead of a random addition sequence Wagner tree may increase the probability that the search finds the most parsimonious tree; a small artificial example where these probabilities can be calculated exactly is presented. Data sets of Type 3, the most difficult data sets studied here, comprise only congruent characters, and a single island with only one most parsimonious tree. Even if there is a single island, missing entries create a very flat landscape which is difficult to traverse with tree search algorithms because the number of equally parsimonious trees that need to be saved and swapped to effectively move around the plateaus is too large. Minor modifications of the parameters of tree drifting, ratchet, and sectorial searches allow travelling around these plateaus much more efficiently than saving and swapping large numbers of equally parsimonious trees with TBR. For these data sets, two new related criteria for selecting taxon addition sequences in Wagner trees (the "selected" and "informative" addition sequences) produce much better results than the standard random or closest addition sequences. These new methods for Wagner trees and for moving around plateaus can be useful when analyzing phylogenomic data sets formed by concatenation of genes with uneven taxon representation ("sparse" supermatrices), which are likely to present a tree landscape with extensive plateaus. Copyright © 2014 Elsevier Inc. All rights reserved.

Corticosteroids as adjuvant therapy for ocular toxoplasmosis

PubMed Central

Jasper, Smitha; Vedula, Satyanarayana S; John, Sheeja S; Horo, Saban; Sepah, Yasir J; Nguyen, Quan Dong

2017-01-01

Background Ocular infection caused by Toxoplasma gondii, a parasite, may result in inflammation in the retina, choroid, and uvea, and consequently lead to complications such as glaucoma, cataract, and posterior synechiae. Objectives The objective of this systematic review was to assess the effects of adjunctive use of corticosteroids to anti-parasitic therapy versus anti-parasitic therapy alone for ocular toxoplasmosis. Search methods We searched CENTRAL (which contains the Cochrane Eyes and Vision Trials Register (2016; Issue 11)), MEDLINE Ovid, Epub Ahead of Print, In-Process & Other Non-Indexed Citations, MEDLINE Ovid Daily (January 1946 to December 2016), Embase (January 1980 to December 2016), Latin American and Caribbean Literature on Health Sciences (LILACS (January 1982 to December 2016)), the ISRCTN registry (www.isrctn.com/editAdvancedSearch), ClinicalTrials.gov (www.clinicaltrials.gov), and the World Health Organization (WHO) International Clinical Trials Registry Platform (ICTRP; www.who.int/ictrp/search/en). We used no date or language restrictions in the electronic searches for trials. We last searched the electronic databases on 7 December 2016. Selection criteria We had planned to include randomized and quasi-randomized controlled trials. Eligible trials would have enrolled participants of any age who were immunocompetent and were diagnosed with acute ocular toxoplasmosis. Included trials would have compared anti-parasitic therapy plus corticosteroids versus anti-parasitic therapy alone, different doses or times of initiation of corticosteroids. Data collection and analysis Two authors independently screened titles and abstracts retrieved through the electronic searches. We retrieved full-text reports of studies categorized as ’unsure’ or ’include’ after we reviewed the abstracts. Two authors independently reviewed each full-text report for eligibility. Discrepancies were resolved through discussion. Main results We identified no completed or ongoing trial that was eligible for this Cochrane review. Authors’ conclusions Although research has identified a wide variation in practice regarding the use of corticosteroids, our review did not identify any evidence from randomized controlled trials for or against the role of corticosteroids in the management of ocular toxoplasmosis. Several questions remain unanswered by well-conducted randomized trials in this context, including whether the use of corticosteroids as an adjunctive agent is more effective than the use of anti-parasitic therapy alone; if so, when corticosteroids should be initiated in the treatment regimen (early versus late course of treatment), and what would be the best dose and duration of steroid use. PMID:28125765

Validation of a Computerized Adaptive Version of the Schedule for Nonadaptive and Adaptive Personality (SNAP)

ERIC Educational Resources Information Center

Simms, Leonard J.; Clark, Lee Anna

2005-01-01

This is a validation study of a computerized adaptive (CAT) version of the Schedule for Nonadaptive and Adaptive Personality (SNAP) conducted with 413 undergraduates who completed the SNAP twice, 1 week apart. Participants were assigned randomly to 1 of 4 retest groups: (a) paper-and-pencil (P&P) SNAP, (b) CAT, (c) P&P/CAT, and (d) CAT/P&P. With…

Individual analyses of Lévy walk in semi-free ranging Tonkean macaques (Macaca tonkeana).

PubMed

Sueur, Cédric; Briard, Léa; Petit, Odile

2011-01-01

Animals adapt their movement patterns to their environment in order to maximize their efficiency when searching for food. The Lévy walk and the Brownian walk are two types of random movement found in different species. Studies have shown that these random movements can switch from a Brownian to a Lévy walk according to the size distribution of food patches. However no study to date has analysed how characteristics such as sex, age, dominance or body mass affect the movement patterns of an individual. In this study we used the maximum likelihood method to examine the nature of the distribution of step lengths and waiting times and assessed how these distributions are influenced by the age and the sex of group members in a semi free-ranging group of ten Tonkean macaques. Individuals highly differed in their activity budget and in their movement patterns. We found an effect of age and sex of individuals on the power distribution of their step lengths and of their waiting times. The males and old individuals displayed a higher proportion of longer trajectories than females and young ones. As regards waiting times, females and old individuals displayed higher rates of long stationary periods than males and young individuals. These movement patterns resembling random walks can probably be explained by the animals moving from one location to other known locations. The power distribution of step lengths might be due to a power distribution of food patches in the enclosure while the power distribution of waiting times might be due to the power distribution of the patch sizes.

A pilot randomized controlled trial of the Occupational Goal Intervention method for the improvement of executive functioning in patients with treatment-resistant schizophrenia.

PubMed

Vizzotto, Adriana D B; Celestino, Diego L; Buchain, Patricia C; Oliveira, Alexandra M; Oliveira, Graça M R; Di Sarno, Elaine S; Napolitano, Isabel C; Elkis, Helio

2016-11-30

Schizophrenia is a chronic disabling mental disorder that involves impairments in several cognitive domains, especially in executive functions (EF), as well as impairments in functional performance. This is particularly true in patients with Treatment-Resistant Schizophrenia (TRS). The aim of this study was to test the efficacy of the Occupational Goal Intervention (OGI) method for the improvement of EF in patients with TRS. In this randomized, controlled, single-blind pilot study, 25 TRS patients were randomly assigned to attend 30 sessions of either OGI or craft activities (control) over a 15-week period and evaluated by the Behavioural Assessment of the Dysexecutive Syndrome (BADS) as the primary outcome and the Direct Assessment of Functional Status (DAFS-BR) as well as the Independent Living Skills Survey (ILSS-BR) as secondary outcomes, all adapted for the Brazilian population. The Positive and Negative Syndrome Scale (PANSS) was used for monitoring symptom severity. Results showed significant statistical differences, favoring the OGI group in terms of improvement on the BADS, both in subtests (Action Program and Key Search) and the total score. Improvements in EFs were observed by families in various dimensions as measured by different subtests of the ILSS-BR inventory. The OGI group showed no significant results in secondary outcomes (DAFS-BR) except in terms of improvement of communication skills. Although preliminary, our results indicate that the OGI method is efficacious and effective for patients with TRS. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

The effect of creative problem solving on students’ mathematical adaptive reasoning

NASA Astrophysics Data System (ADS)

Muin, A.; Hanifah, S. H.; Diwidian, F.

2018-01-01

This research was conducted to analyse the effect of creative problem solving (CPS) learning model on the students’ mathematical adaptive reasoning. The method used in this study was a quasi-experimental with randomized post-test only control group design. Samples were taken as many as two classes by cluster random sampling technique consisting of experimental class (CPS) as many as 40 students and control class (conventional) as many as 40 students. Based on the result of hypothesis testing with the t-test at the significance level of 5%, it was obtained that significance level of 0.0000 is less than α = 0.05. This shows that the students’ mathematical adaptive reasoning skills who were taught by CPS model were higher than the students’ mathematical adaptive reasoning skills of those who were taught by conventional model. The result of this research showed that the most prominent aspect of adaptive reasoning that could be developed through a CPS was inductive intuitive. Two aspects of adaptive reasoning, which were inductive intuitive and deductive intuitive, were mostly balanced. The different between inductive intuitive and deductive intuitive aspect was not too big. CPS model can develop student mathematical adaptive reasoning skills. CPS model can facilitate development of mathematical adaptive reasoning skills thoroughly.

Effects of Shift and Night Work in the Offshore Petroleum Industry: A Systematic Review

PubMed Central

FOSSUM, Ingrid Nesdal; BJORVATN, Bjørn; WAAGE, Siri; PALLESEN, Ståle

2013-01-01

Shift and night work are associated with several negative outcomes. The aim of this study was to make a systematic review of all studies which examine effects of shift and night work in the offshore petroleum industry, to synthesize the knowledge of how shift work offshore may affect the workers. Searches for studies concerning effects on health, sleep, adaptation, safety, working conditions, family- and social life and turnover were conducted via the databases Web of Knowledge, PsycINFO and PubMed. Search was also conducted through inspection of reference lists of relevant literature. We identified studies describing effects of shift work in terms of sleep, adaptation and re-adaptation of circadian rhythms, health outcomes, safety and accidents, family and social life, and work perceptions. Twenty-nine studies were included. In conclusion, the longitudinal studies were generally consistent in showing that adaptation to night work was complete within one to two weeks of work, while re-adaptation to a daytime schedule was slower. Shift workers reported more sleep problems than day workers. The data regarding mental and physical health, family and social life, and accidents yielded inconsistent results, and were insufficient as a base for drawing general conclusions. More research in the field is warranted. PMID:23803497

Locally adaptive methods for KDE-based random walk models of reactive transport in porous media

NASA Astrophysics Data System (ADS)

Sole-Mari, G.; Fernandez-Garcia, D.

2017-12-01

Random Walk Particle Tracking (RWPT) coupled with Kernel Density Estimation (KDE) has been recently proposed to simulate reactive transport in porous media. KDE provides an optimal estimation of the area of influence of particles which is a key element to simulate nonlinear chemical reactions. However, several important drawbacks can be identified: (1) the optimal KDE method is computationally intensive and thereby cannot be used at each time step of the simulation; (2) it does not take advantage of the prior information about the physical system and the previous history of the solute plume; (3) even if the kernel is optimal, the relative error in RWPT simulations typically increases over time as the particle density diminishes by dilution. To overcome these problems, we propose an adaptive branching random walk methodology that incorporates the physics, the particle history and maintains accuracy with time. The method allows particles to efficiently split and merge when necessary as well as to optimally adapt their local kernel shape without having to recalculate the kernel size. We illustrate the advantage of the method by simulating complex reactive transport problems in randomly heterogeneous porous media.

Spatial Search by Quantum Walk is Optimal for Almost all Graphs.

PubMed

Chakraborty, Shantanav; Novo, Leonardo; Ambainis, Andris; Omar, Yasser

2016-03-11

The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erdös-Renyi random graphs, i.e., graphs of n vertices where each edge exists with probability p, search by CTQW is almost surely optimal as long as p≥log^{3/2}(n)/n. Consequently, we show that quantum spatial search is in fact optimal for almost all graphs, meaning that the fraction of graphs of n vertices for which this optimality holds tends to one in the asymptotic limit. We obtain this result by proving that search is optimal on graphs where the ratio between the second largest and the largest eigenvalue is bounded by a constant smaller than 1. Finally, we show that we can extend our results on search to establish high fidelity quantum communication between two arbitrary nodes of a random network of interacting qubits, namely, to perform quantum state transfer, as well as entanglement generation. Our work shows that quantum information tasks typically designed for structured systems retain performance in very disordered structures.

Adding Statistical Machine Translation Adaptation to Computer-Assisted Translation

DTIC Science & Technology

2013-09-01

are automatically searched and used to suggest possible translations; (2) spell-checkers; (3) glossaries; (4) dictionaries ; (5) alignment and...matching against TMs to propose translations; spell-checking, glossary, and dictionary look-up; support for multiple file formats; regular expressions...on Telecommunications. Tehran, 2012, 822–826. Bertoldi, N.; Federico, M. Domain Adaptation for Statistical Machine Translation with Monolingual

Applying systematic review search methods to the grey literature: a case study examining guidelines for school-based breakfast programs in Canada.

PubMed

Godin, Katelyn; Stapleton, Jackie; Kirkpatrick, Sharon I; Hanning, Rhona M; Leatherdale, Scott T

2015-10-22

Grey literature is an important source of information for large-scale review syntheses. However, there are many characteristics of grey literature that make it difficult to search systematically. Further, there is no 'gold standard' for rigorous systematic grey literature search methods and few resources on how to conduct this type of search. This paper describes systematic review search methods that were developed and applied to complete a case study systematic review of grey literature that examined guidelines for school-based breakfast programs in Canada. A grey literature search plan was developed to incorporate four different searching strategies: (1) grey literature databases, (2) customized Google search engines, (3) targeted websites, and (4) consultation with contact experts. These complementary strategies were used to minimize the risk of omitting relevant sources. Since abstracts are often unavailable in grey literature documents, items' abstracts, executive summaries, or table of contents (whichever was available) were screened. Screening of publications' full-text followed. Data were extracted on the organization, year published, who they were developed by, intended audience, goal/objectives of document, sources of evidence/resources cited, meals mentioned in the guidelines, and recommendations for program delivery. The search strategies for identifying and screening publications for inclusion in the case study review was found to be manageable, comprehensive, and intuitive when applied in practice. The four search strategies of the grey literature search plan yielded 302 potentially relevant items for screening. Following the screening process, 15 publications that met all eligibility criteria remained and were included in the case study systematic review. The high-level findings of the case study systematic review are briefly described. This article demonstrated a feasible and seemingly robust method for applying systematic search strategies to identify web-based resources in the grey literature. The search strategy we developed and tested is amenable to adaptation to identify other types of grey literature from other disciplines and answering a wide range of research questions. This method should be further adapted and tested in future research syntheses.

Path integration mediated systematic search: a Bayesian model.

PubMed

Vickerstaff, Robert J; Merkle, Tobias

2012-08-21

The systematic search behaviour is a backup system that increases the chances of desert ants finding their nest entrance after foraging when the path integrator has failed to guide them home accurately enough. Here we present a mathematical model of the systematic search that is based on extensive behavioural studies in North African desert ants Cataglyphis fortis. First, a simple search heuristic utilising Bayesian inference and a probability density function is developed. This model, which optimises the short-term nest detection probability, is then compared to three simpler search heuristics and to recorded search patterns of Cataglyphis ants. To compare the different searches a method to quantify search efficiency is established as well as an estimate of the error rate in the ants' path integrator. We demonstrate that the Bayesian search heuristic is able to automatically adapt to increasing levels of positional uncertainty to produce broader search patterns, just as desert ants do, and that it outperforms the three other search heuristics tested. The searches produced by it are also arguably the most similar in appearance to the ant's searches. Copyright © 2012 Elsevier Ltd. All rights reserved.

Decision making in family medicine

PubMed Central

Labrecque, Michel; Ratté, Stéphane; Frémont, Pierre; Cauchon, Michel; Ouellet, Jérôme; Hogg, William; McGowan, Jessie; Gagnon, Marie-Pierre; Njoya, Merlin; Légaré, France

2013-01-01

Abstract Objective To compare the ability of users of 2 medical search engines, InfoClinique and the Trip database, to provide correct answers to clinical questions and to explore the perceived effects of the tools on the clinical decision-making process. Design Randomized trial. Setting Three family medicine units of the family medicine program of the Faculty of Medicine at Laval University in Quebec city, Que. Participants Fifteen second-year family medicine residents. Intervention Residents generated 30 structured questions about therapy or preventive treatment (2 questions per resident) based on clinical encounters. Using an Internet platform designed for the trial, each resident answered 20 of these questions (their own 2, plus 18 of the questions formulated by other residents, selected randomly) before and after searching for information with 1 of the 2 search engines. For each question, 5 residents were randomly assigned to begin their search with InfoClinique and 5 with the Trip database. Main outcome measures The ability of residents to provide correct answers to clinical questions using the search engines, as determined by third-party evaluation. After answering each question, participants completed a questionnaire to assess their perception of the engine’s effect on the decision-making process in clinical practice. Results Of 300 possible pairs of answers (1 answer before and 1 after the initial search), 254 (85%) were produced by 14 residents. Of these, 132 (52%) and 122 (48%) pairs of answers concerned questions that had been assigned an initial search with InfoClinique and the Trip database, respectively. Both engines produced an important and similar absolute increase in the proportion of correct answers after searching (26% to 62% for InfoClinique, for an increase of 36%; 24% to 63% for the Trip database, for an increase of 39%; P = .68). For all 30 clinical questions, at least 1 resident produced the correct answer after searching with either search engine. The mean (SD) time of the initial search for each question was 23.5 (7.6) minutes with InfoClinique and 22.3 (7.8) minutes with the Trip database (P = .30). Participants’ perceptions of each engine’s effect on the decision-making process were very positive and similar for both search engines. Conclusion Family medicine residents’ ability to provide correct answers to clinical questions increased dramatically and similarly with the use of both InfoClinique and the Trip database. These tools have strong potential to increase the quality of medical care. PMID:24130286

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.

How breast cancer patients want to search for and retrieve information from stories of other patients on the internet: an online randomized controlled experiment.

PubMed

Overberg, Regina; Otten, Wilma; de Man, Andries; Toussaint, Pieter; Westenbrink, Judith; Zwetsloot-Schonk, Bertie

2010-03-09

Other patients' stories on the Internet can give patients information, support, reassurance, and practical advice. We examined which search facility for online stories resulted in patients' satisfaction and search success. This study was a randomized controlled experiment with a 2x2 factorial design conducted online. We facilitated access to 170 stories of breast cancer patients in four ways based on two factors: (1) no versus yes search by story topic, and (2) no versus yes search by writer profile. Dutch speaking women with breast cancer were recruited. Women who gave informed consent were randomly assigned to one of four groups. After searching for stories, women were offered a questionnaire relating to satisfaction with the search facility, the stories retrieved, and impact of the stories on coping with breast cancer. Of 353 enrolled women, 182 (51.6%) completed the questionnaire: control group (n = 37), story topics group (n = 49), writer profile group (n = 51), and combination group (n = 45). Questionnaire completers were evenly distributed over the four groups (chi(2) (3) = 3.7, P = .30). Women who had access to the story topics search facility (yes vs no): were more positive about (mean scores 4.0 vs 3.6, P = .001) and more satisfied with the search facility (mean scores 7.3 vs 6.3, P < .001); were more positive about the number of search options (mean scores 2.3 vs 2.1, P = .04); were better enabled to find desired information (mean scores 3.3 vs 2.8, P = .001); were more likely to recommend the search facility to others or intend to use it themselves (mean scores 4.1 vs 3.5, P < .001); were more positive about how retrieved stories were displayed (mean scores 3.6 vs 3.2, P = .001); retrieved stories that better covered their information needs (mean scores 3.0 vs 2.6, P = .02); were more satisfied with the stories retrieved (mean scores 7.1 vs 6.4, P = .002); and were more likely to report an impact of the stories on coping with breast cancer (mean scores 3.2 vs 2.9, P =. 02). Three main effects were associated with use of the writer profile search (yes vs no): being more positive about (mean scores 3.9 vs 3.6, P = .005) and more satisfied with the search facility (mean scores 7.1 vs 6.5, P =. 01), and being more positive about how retrieved stories were displayed (mean scores 3.8 vs 2.9, P < .001). For satisfaction with the search facility, an interaction effect was found (P = .03): at least one of the two search facilities was needed for satisfaction. Having access to the story topics search facility clearly had the most positive effect on patient satisfaction and search success.

Unifying Complexity and Information

NASA Astrophysics Data System (ADS)

Ke, Da-Guan

2013-04-01

Complex systems, arising in many contexts in the computer, life, social, and physical sciences, have not shared a generally-accepted complexity measure playing a fundamental role as the Shannon entropy H in statistical mechanics. Superficially-conflicting criteria of complexity measurement, i.e. complexity-randomness (C-R) relations, have given rise to a special measure intrinsically adaptable to more than one criterion. However, deep causes of the conflict and the adaptability are not much clear. Here I trace the root of each representative or adaptable measure to its particular universal data-generating or -regenerating model (UDGM or UDRM). A representative measure for deterministic dynamical systems is found as a counterpart of the H for random process, clearly redefining the boundary of different criteria. And a specific UDRM achieving the intrinsic adaptability enables a general information measure that ultimately solves all major disputes. This work encourages a single framework coving deterministic systems, statistical mechanics and real-world living organisms.

A randomized controlled trial of culturally adapted motivational interviewing for Hispanic heavy drinkers: Theory of Adaptation and Study Protocol

PubMed Central

Lee, Christina S.; Colby, Suzanne M.; Magill, Molly; Almeida, Joanna; Tavares, Tonya; Rohsenow, Damaris J.

2016-01-01

Background The NIH Strategic Plan prioritizes health disparities research for socially disadvantaged Hispanics, to reduce the disproportionate burden of alcohol-related negative consequences compared to other racial/ethnic groups. Cultural adaptation of evidence-based treatments, such as motivational interviewing (MI), can improve access and response to alcohol treatment. However, the lack of rigorous clinical trials designed to test the efficacy and theoretical underpinnings of cultural adaptation has made proof of concept difficult. Objective The CAMI2 (Culturally Adapted Motivational Interviewing) study design and its theoretical model, is described to illustrate how MI adapted to social and cultural factors (CAMI) can be discriminated against non-adapted MI. Methods and Design CAMI2, a large, 12 month randomized prospective trial, examines the efficacy of CAMI and MI among heavy drinking Hispanics recruited from the community (n=257). Outcomes are reductions in heavy drinking days (Time Line Follow-Back) and negative consequences of drinking among Hispanics (Drinkers Inventory of Consequences). A second aim examines perceived acculturation stress as a moderator of treatment outcomes in the CAMI condition. Summary The CAMI2 study design protocol is presented and the theory of adaptation is presented. Findings from the trial described may yield important recommendations on the science of cultural adaptation and improve MI dissemination to Hispanics with alcohol risk. PMID:27565832

Visual search in scenes involves selective and non-selective pathways

PubMed Central

Wolfe, Jeremy M; Vo, Melissa L-H; Evans, Karla K; Greene, Michelle R

2010-01-01

How do we find objects in scenes? For decades, visual search models have been built on experiments in which observers search for targets, presented among distractor items, isolated and randomly arranged on blank backgrounds. Are these models relevant to search in continuous scenes? This paper argues that the mechanisms that govern artificial, laboratory search tasks do play a role in visual search in scenes. However, scene-based information is used to guide search in ways that had no place in earlier models. Search in scenes may be best explained by a dual-path model: A “selective” path in which candidate objects must be individually selected for recognition and a “non-selective” path in which information can be extracted from global / statistical information. PMID:21227734

A Rapid Item-Search Procedure for Bayesian Adaptive Testing.

DTIC Science & Technology

1977-05-01

properties of the • procedure , they migh t well introduce undesirable psychological effects on test scores (e.g., Betz & Weiss , 1976r.’ , 1976b...ge of results and adaptive ability test .~~~~ (Research Rep . 76—4). Minneapolis: University of Minnesota , Departmen t of Psychology , Psychometric...t~~[AH ~~~ ~~~~ r _ _ _ _ A RAPID ITEM -SEARC H PROCEDURE FOR BAYESIAN ADAPTIVE TESTING C. David Vale d D D Can David J . Weiss RESEARCH REPORT 77-n

Multicriteria adaptation principle on example of groups of mobile robots

NASA Astrophysics Data System (ADS)

Nelyubin, A. P.; Misyurin, S. Yu

2017-12-01

The article presents a multicriteria approach to the adaptation of groups of search, explore or research robots to unknown and volatile environment conditions. The basis of this approach is the application of multicriteria analysis both at the design stage of a group of mobile robots and at the stage of its adaptation in real-time conditions. It is proposed to maintain a variety of robots by properties and by optimality criteria in order to take into account the preferred mode of operation.

The Effect of Teaching Search Strategies on Perceptual Performance.

PubMed

van der Gijp, Anouk; Vincken, Koen L; Boscardin, Christy; Webb, Emily M; Ten Cate, Olle Th J; Naeger, David M

2017-06-01

Radiology expertise is dependent on the use of efficient search strategies. The aim of this study is to investigate the effect of teaching search strategies on trainee's accuracy in detecting lung nodules at computed tomography. Two search strategies, "scanning" and "drilling," were tested with a randomized crossover design. Nineteen junior radiology residents were randomized into two groups. Both groups first completed a baseline lung nodule detection test allowing a free search strategy, followed by a test after scanning instruction and drilling instruction or vice versa. True positive (TP) and false positive (FP) scores and scroll behavior were registered. A mixed-design analysis of variance was applied to compare the three search conditions. Search strategy instruction had a significant effect on scroll behavior, F(1.3) = 54.2, P < 0.001; TP score, F(2) = 16.1, P < 0.001; and FP score, F(1.3) = 15.3, P < 0.001. Scanning instruction resulted in significantly lower TP scores than drilling instruction (M = 10.7, SD = 5.0 versus M = 16.3, SD = 5.3), t(18) = 4.78, P < 0.001; or free search (M = 15.3, SD = 4.6), t(18) = 4.44, P < 0.001. TP scores for drilling did not significantly differ from free search. FP scores for drilling (M = 7.3, SD = 5.6) were significantly lower than for free search (M = 12.5, SD = 7.8), t(18) = 4.86, P < 0.001. Teaching a drilling strategy is preferable to teaching a scanning strategy for finding lung nodules. Copyright © 2017 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.

The relation between visualization size, grouping, and user performance.

PubMed

Gramazio, Connor C; Schloss, Karen B; Laidlaw, David H

2014-12-01

In this paper we make the following contributions: (1) we describe how the grouping, quantity, and size of visual marks affects search time based on the results from two experiments; (2) we report how search performance relates to self-reported difficulty in finding the target for different display types; and (3) we present design guidelines based on our findings to facilitate the design of effective visualizations. Both Experiment 1 and 2 asked participants to search for a unique target in colored visualizations to test how the grouping, quantity, and size of marks affects user performance. In Experiment 1, the target square was embedded in a grid of squares and in Experiment 2 the target was a point in a scatterplot. Search performance was faster when colors were spatially grouped than when they were randomly arranged. The quantity of marks had little effect on search time for grouped displays ("pop-out"), but increasing the quantity of marks slowed reaction time for random displays. Regardless of color layout (grouped vs. random), response times were slowest for the smallest mark size and decreased as mark size increased to a point, after which response times plateaued. In addition to these two experiments we also include potential application areas, as well as results from a small case study where we report preliminary findings that size may affect how users infer how visualizations should be used. We conclude with a list of design guidelines that focus on how to best create visualizations based on grouping, quantity, and size of visual marks.

Respiratory syncytial virus tracking using internet search engine data.

PubMed

Oren, Eyal; Frere, Justin; Yom-Tov, Eran; Yom-Tov, Elad

2018-04-03

Respiratory Syncytial Virus (RSV) is the leading cause of hospitalization in children less than 1 year of age in the United States. Internet search engine queries may provide high resolution temporal and spatial data to estimate and predict disease activity. After filtering an initial list of 613 symptoms using high-resolution Bing search logs, we used Google Trends data between 2004 and 2016 for a smaller list of 50 terms to build predictive models of RSV incidence for five states where long-term surveillance data was available. We then used domain adaptation to model RSV incidence for the 45 remaining US states. Surveillance data sources (hospitalization and laboratory reports) were highly correlated, as were laboratory reports with search engine data. The four terms which were most often statistically significantly correlated as time series with the surveillance data in the five state models were RSV, flu, pneumonia, and bronchiolitis. Using our models, we tracked the spread of RSV by observing the time of peak use of the search term in different states. In general, the RSV peak moved from south-east (Florida) to the north-west US. Our study represents the first time that RSV has been tracked using Internet data results and highlights successful use of search filters and domain adaptation techniques, using data at multiple resolutions. Our approach may assist in identifying spread of both local and more widespread RSV transmission and may be applicable to other seasonal conditions where comprehensive epidemiological data is difficult to collect or obtain.

Protocol: Adaptive Implementation of Effective Programs Trial (ADEPT): cluster randomized SMART trial comparing a standard versus enhanced implementation strategy to improve outcomes of a mood disorders program.

PubMed

Kilbourne, Amy M; Almirall, Daniel; Eisenberg, Daniel; Waxmonsky, Jeanette; Goodrich, David E; Fortney, John C; Kirchner, JoAnn E; Solberg, Leif I; Main, Deborah; Bauer, Mark S; Kyle, Julia; Murphy, Susan A; Nord, Kristina M; Thomas, Marshall R

2014-09-30

Despite the availability of psychosocial evidence-based practices (EBPs), treatment and outcomes for persons with mental disorders remain suboptimal. Replicating Effective Programs (REP), an effective implementation strategy, still resulted in less than half of sites using an EBP. The primary aim of this cluster randomized trial is to determine, among sites not initially responding to REP, the effect of adaptive implementation strategies that begin with an External Facilitator (EF) or with an External Facilitator plus an Internal Facilitator (IF) on improved EBP use and patient outcomes in 12 months. This study employs a sequential multiple assignment randomized trial (SMART) design to build an adaptive implementation strategy. The EBP to be implemented is life goals (LG) for patients with mood disorders across 80 community-based outpatient clinics (N = 1,600 patients) from different U.S. regions. Sites not initially responding to REP (defined as < 50% patients receiving ≥ 3 EBP sessions) will be randomized to receive additional support from an EF or both EF/IF. Additionally, sites randomized to EF and still not responsive will be randomized to continue with EF alone or to receive EF/IF. The EF provides technical expertise in adapting LG in routine practice, whereas the on-site IF has direct reporting relationships to site leadership to support LG use in routine practice. The primary outcome is mental health-related quality of life; secondary outcomes include receipt of LG sessions, mood symptoms, implementation costs, and organizational change. This study design will determine whether an off-site EF alone versus the addition of an on-site IF improves EBP uptake and patient outcomes among sites that do not respond initially to REP. It will also examine the value of delaying the provision of EF/IF for sites that continue to not respond despite EF. ClinicalTrials.gov identifier: NCT02151331.

CENTRAL, PEDro, PubMed, and EMBASE are the most comprehensive databases indexing randomized controlled trials of physical therapy interventions.

PubMed

Michaleff, Zoe A; Costa, Leonardo O P; Moseley, Anne M; Maher, Christopher G; Elkins, Mark R; Herbert, Robert D; Sherrington, Catherine

2011-02-01

Many bibliographic databases index research studies evaluating the effects of health care interventions. One study has concluded that the Physiotherapy Evidence Database (PEDro) has the most complete indexing of reports of randomized controlled trials of physical therapy interventions, but the design of that study may have exaggerated estimates of the completeness of indexing by PEDro. The purpose of this study was to compare the completeness of indexing of reports of randomized controlled trials of physical therapy interventions by 8 bibliographic databases. This study was an audit of bibliographic databases. Prespecified criteria were used to identify 400 reports of randomized controlled trials from the reference lists of systematic reviews published in 2008 that evaluated physical therapy interventions. Eight databases (AMED, CENTRAL, CINAHL, EMBASE, Hooked on Evidence, PEDro, PsycINFO, and PubMed) were searched for each trial report. The proportion of the 400 trial reports indexed by each database was calculated. The proportions of the 400 trial reports indexed by the databases were as follows: CENTRAL, 95%; PEDro, 92%; PubMed, 89%; EMBASE, 88%; CINAHL, 53%; AMED, 50%; Hooked on Evidence, 45%; and PsycINFO, 6%. Almost all of the trial reports (99%) were found in at least 1 database, and 88% were indexed by 4 or more databases. Four trial reports were uniquely indexed by a single database only (2 in CENTRAL and 1 each in PEDro and PubMed). The results are only applicable to searching for English-language published reports of randomized controlled trials evaluating physical therapy interventions. The 4 most comprehensive databases of trial reports evaluating physical therapy interventions were CENTRAL, PEDro, PubMed, and EMBASE. Clinicians seeking quick answers to clinical questions could search any of these databases knowing that all are reasonably comprehensive. PEDro, unlike the other 3 most complete databases, is specific to physical therapy, so studies not relevant to physical therapy are less likely to be retrieved. Researchers could use CENTRAL, PEDro, PubMed, and EMBASE in combination to conduct exhaustive searches for randomized trials in physical therapy.

Intelligent Control of a Sensor-Actuator System via Kernelized Least-Squares Policy Iteration

PubMed Central

Liu, Bo; Chen, Sanfeng; Li, Shuai; Liang, Yongsheng

2012-01-01

In this paper a new framework, called Compressive Kernelized Reinforcement Learning (CKRL), for computing near-optimal policies in sequential decision making with uncertainty is proposed via incorporating the non-adaptive data-independent Random Projections and nonparametric Kernelized Least-squares Policy Iteration (KLSPI). Random Projections are a fast, non-adaptive dimensionality reduction framework in which high-dimensionality data is projected onto a random lower-dimension subspace via spherically random rotation and coordination sampling. KLSPI introduce kernel trick into the LSPI framework for Reinforcement Learning, often achieving faster convergence and providing automatic feature selection via various kernel sparsification approaches. In this approach, policies are computed in a low-dimensional subspace generated by projecting the high-dimensional features onto a set of random basis. We first show how Random Projections constitute an efficient sparsification technique and how our method often converges faster than regular LSPI, while at lower computational costs. Theoretical foundation underlying this approach is a fast approximation of Singular Value Decomposition (SVD). Finally, simulation results are exhibited on benchmark MDP domains, which confirm gains both in computation time and in performance in large feature spaces. PMID:22736969

Search of exploration opportunity for near earth objects based on analytical gradients

NASA Astrophysics Data System (ADS)

Ren, Y.; Cui, P. Y.; Luan, E. J.

2008-01-01

The problem of searching for exploration opportunity of near Earth objects is investigated. For rendezvous missions, the analytical gradients of performance index with respect to free parameters are derived by combining the calculus of variation with the theory of state-transition matrix. Then, some initial guesses are generated random in the search space, and the performance index is optimized with the guidance of analytical gradients from these initial guesses. This method not only keeps the property of global search in traditional method, but also avoids the blindness in the traditional exploration opportunity search; hence, the computing speed could be increased greatly. Furthermore, by using this method, the search precision could be controlled effectively.

Helping Students Make Decisions with the Help of Egan's Model.

ERIC Educational Resources Information Center

Stephens, Ginny Lee; Reynolds, JoLynne

1992-01-01

Discusses using Gerald Egan's model for creative decision making as a career counseling tool. Explains why to use this model and how it was adapted to meet career counseling issues. Describes its successful use in three case studies with a college sophomore in search of a major, a new graduate in search of a first job, and a homemaker. (Author/ABL)

Robust Mokken Scale Analysis by Means of the Forward Search Algorithm for Outlier Detection

ERIC Educational Resources Information Center

Zijlstra, Wobbe P.; van der Ark, L. Andries; Sijtsma, Klaas

2011-01-01

Exploratory Mokken scale analysis (MSA) is a popular method for identifying scales from larger sets of items. As with any statistical method, in MSA the presence of outliers in the data may result in biased results and wrong conclusions. The forward search algorithm is a robust diagnostic method for outlier detection, which we adapt here to…

Systematic Review of Integrative Health Care Research: Randomized Control Trials, Clinical Controlled Trials, and Meta-Analysis

PubMed Central

Khorsan, Raheleh; Coulter, Ian D.; Crawford, Cindy; Hsiao, An-Fu

2011-01-01

A systematic review was conducted to assess the level of evidence for integrative health care research. We searched PubMed, Allied and Complementary Medicine (AMED), BIOSIS Previews, EMBASE, the entire Cochrane Library, MANTIS, Social SciSearch, SciSearch Cited Ref Sci, PsychInfo, CINAHL, and NCCAM grantee publications listings, from database inception to May 2009, as well as searches of the “gray literature.” Available studies published in English language were included. Three independent reviewers rated each article and assessed the methodological quality of studies using the Scottish Intercollegiate Guidelines Network (SIGN 50). Our search yielded 11,891 total citations but 6 clinical studies, including 4 randomized, met our inclusion criteria. There are no available systematic reviews/meta-analyses published that met our inclusion criteria. The methodological quality of the included studies was assessed independently using quality checklists of the SIGN 50. Only a small number of RCTs and CCTs with a limited number of patients and lack of adequate control groups assessing integrative health care research are available. These studies provide limited evidence of effective integrative health care on some modalities. However, integrative health care regimen appears to be generally safe. PMID:20953383

Learning where to look: electrophysiological and behavioral indices of visual search in young and old subjects.

PubMed

Looren de Jong, H; Kok, A; Woestenburg, J C; Logman, C J; Van Rooy, J C

1988-06-01

The present investigation explores the way young and elderly subjects use regularities in target location in a visual display to guide search for targets. Although both young and old subjects show efficient use of search strategies, slight but reliable differences in reaction times suggest decreased ability in the elderly to use complex cues. Event-related potentials were very different for the young and the old. In the young, P3 amplitudes were larger on trials where the rule that governed the location of the target became evident; this was interpreted as an effect of memory updating. Enhanced positive Slow Wave amplitude indicated uncertainty in random search conditions. Elderly subjects' P3 and SW, however, seemed unrelated to behavioral performance, and they showed a large negative Slow Wave at central and parietal sites to randomly located targets. The latter finding was tentatively interpreted as a sign of increased effort in the elderly to allocate attention in visual space. This pattern of behavioral and ERP results suggests that age-related differences in search tasks can be understood in terms of changes in the strategy of allocating visual attention.

How happy is your web browsing? A model to quantify satisfaction of an Internet user searching for desired information

NASA Astrophysics Data System (ADS)

Banerji, Anirban; Magarkar, Aniket

2012-09-01

We feel happy when web browsing operations provide us with necessary information; otherwise, we feel bitter. How to measure this happiness (or bitterness)? How does the profile of happiness grow and decay during the course of web browsing? We propose a probabilistic framework that models the evolution of user satisfaction, on top of his/her continuous frustration at not finding the required information. It is found that the cumulative satisfaction profile of a web-searching individual can be modeled effectively as the sum of a random number of random terms, where each term is a mutually independent random variable, originating from ‘memoryless’ Poisson flow. Evolution of satisfaction over the entire time interval of a user’s browsing was modeled using auto-correlation analysis. A utilitarian marker, a magnitude of greater than unity of which describes happy web-searching operations, and an empirical limit that connects user’s satisfaction with his frustration level-are proposed too. The presence of pertinent information in the very first page of a website and magnitude of the decay parameter of user satisfaction (frustration, irritation etc.) are found to be two key aspects that dominate the web user’s psychology. The proposed model employed different combinations of decay parameter, searching time and number of helpful websites. The obtained results are found to match the results from three real-life case studies.

Mandibular single-implant overdentures: a review with surgical and prosthodontic perspectives of a novel approach.

PubMed

Alsabeeha, Nabeel; Payne, Alan G T; De Silva, Rohana K; Swain, Michael V

2009-04-01

To review the literature on mandibular single-implant overdentures (opposing complete maxillary dentures), and present surgical and prosthodontic perspectives of a novel approach for this treatment option. An electronic search through the databases of Pubmed, Embase and Medline using the linked key words 'mandibular single implant overdentures' was performed. The search was limited to English language articles published up to August 2008. Hand searches through articles retrieved from the electronic search, peer-reviewed journals and recent conference proceedings were also conducted. A limited number of reports were identified on mandibular single-implant overdentures (opposing maxillary complete dentures). They comprised of case-series reports, short-term prospective trials and current randomized-controlled clinical trials. Different loading protocols with different implant systems have been used, but always with regular diameter implants. Specific anatomical and vascular dangers of the mandibular midline symphysis are identified including a novel surgical approach using a currently available short, wide diameter tapered implant. In addition, the prosthodontic rationale for using a larger attachment system (incorporating a platform switch) for mandibular single-implant overdentures is described. The review reveals that there is a lack of published randomized clinical trials using mandibular single-implant overdentures, opposing maxillary complete dentures. Without the evidence from randomized clinical trials, routine use of this novel approach cannot be recommended, compared with using regular diameter implants and matching attachment systems.

Information Search and Decision Making: The Effects of Age and Complexity on Strategy Use

PubMed Central

Queen, Tara L.; Hess, Thomas M.; Ennis, Gilda E.; Dowd, Keith; Grühn, Daniel

2012-01-01

The impact of task complexity on information search strategy and decision quality was examined in a sample of 135 young, middle-aged, and older adults. We were particularly interested in the competing roles of fluid cognitive ability and domain knowledge and experience, with the former being a negative influence and the latter being a positive influence on older adults’ performance. Participants utilized two decision matrices, which varied in complexity, regarding a consumer purchase. Using process tracing software and an algorithm developed to assess decision strategy, we recorded search behavior, strategy selection, and final decision. Contrary to expectations, older adults were not more likely than the younger age groups to engage in information-minimizing search behaviors in response to increases in task complexity. Similarly, adults of all ages used comparable decision strategies and adapted their strategies to the demands of the task. We also examined decision outcomes in relation to participants’ preferences. Overall, it seems that older adults utilize simpler sets of information primarily reflecting the most valued attributes in making their choice. The results of this study suggest that older adults are adaptive in their approach to decision making and this ability may benefit from accrued knowledge and experience. PMID:22663157

Reconsidering the Rhizome: A Textual Analysis of Web Search Engines as Gatekeepers of the Internet

NASA Astrophysics Data System (ADS)

Hess, A.

Critical theorists have often drawn from Deleuze and Guattari's notion of the rhizome when discussing the potential of the Internet. While the Internet may structurally appear as a rhizome, its day-to-day usage by millions via search engines precludes experiencing the random interconnectedness and potential democratizing function. Through a textual analysis of four search engines, I argue that Web searching has grown hierarchies, or "trees," that organize data in tracts of knowledge and place users in marketing niches rather than assist in the development of new knowledge.

A Telescopic Binary Learning Machine for Training Neural Networks.

PubMed

Brunato, Mauro; Battiti, Roberto

2017-03-01

This paper proposes a new algorithm based on multiscale stochastic local search with binary representation for training neural networks [binary learning machine (BLM)]. We study the effects of neighborhood evaluation strategies, the effect of the number of bits per weight and that of the maximum weight range used for mapping binary strings to real values. Following this preliminary investigation, we propose a telescopic multiscale version of local search, where the number of bits is increased in an adaptive manner, leading to a faster search and to local minima of better quality. An analysis related to adapting the number of bits in a dynamic way is presented. The control on the number of bits, which happens in a natural manner in the proposed method, is effective to increase the generalization performance. The learning dynamics are discussed and validated on a highly nonlinear artificial problem and on real-world tasks in many application domains; BLM is finally applied to a problem requiring either feedforward or recurrent architectures for feedback control.

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

A sub-sampled approach to extremely low-dose STEM

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stevens, A.; Luzi, L.; Yang, H.

The inpainting of randomly sub-sampled images acquired by scanning transmission electron microscopy (STEM) is an attractive method for imaging under low-dose conditions (≤ 1 e -Å 2) without changing either the operation of the microscope or the physics of the imaging process. We show that 1) adaptive sub-sampling increases acquisition speed, resolution, and sensitivity; and 2) random (non-adaptive) sub-sampling is equivalent, but faster than, traditional low-dose techniques. Adaptive sub-sampling opens numerous possibilities for the analysis of beam sensitive materials and in-situ dynamic processes at the resolution limit of the aberration corrected microscope and is demonstrated here for the analysis ofmore » the node distribution in metal-organic frameworks (MOFs).« less

Effect of Treatment Education Based on the Roy Adaptation Model on Adjustment of Hemodialysis Patients.

PubMed

Kacaroglu Vicdan, Ayse; Gulseven Karabacak, Bilgi

2016-01-01

The Roy Adaptation Model examines the individual in 4 fields: physiological mode, self-concept mode, role function mode, and interdependence mode. Hemodialysis treatment is associated with the Roy Adaptation Model as it involves fields that might be needed by the individual with chronic renal disease. This research was conducted as randomized controlled experiment with the aim of determining the effect of the education given in accordance with the Roy Adaptation Model on physiological, psychological, and social adaptation of individuals undergoing hemodialysis treatment. This was a random controlled experimental study. The study was conducted at a dialysis center in Konya-Aksehir in Turkey between July 1 and December 31, 2012. The sample was composed of 82 individuals-41 experimental and 41 control. In the second interview, there was a decrease in the systolic blood pressures and body weights of the experimental group, an increase in the scores of functional performance and self-respect, and a decrease in the scores of psychosocial adaptation. In the control group, on the other hand, there was a decrease in the scores of self-respect and an increase in the scores of psychosocial adaptation. The 2 groups were compared in terms of adaptation variables and a difference was determined on behalf of the experimental group. The training that was provided and evaluated for individuals receiving hemodialysis according to 4 modes of the Roy Adaptation Model increased physical, psychological, and social adaptation.

Meta-analysis of laparoscopic versus open repair of perforated peptic ulcer.

PubMed

Antoniou, Stavros A; Antoniou, George A; Koch, Oliver O; Pointner, Rudolph; Granderath, Frank A

2013-01-01

Laparoscopic treatment of perforated peptic ulcer (PPU) has been introduced as an alternative procedure to open surgery. It has been postulated that the minimally invasive approach involves less operative stress and results in decreased morbidity and mortality. We conducted a meta-analysis of randomized trials to test this hypothesis. Medline, EMBASE, and the Cochrane Central Register of Randomized Trials databases were searched, with no date or language restrictions. Our literature search identified 4 randomized trials, with a cumulative number of 289 patients, that compared the laparoscopic approach with open sutured repair of perforated ulcer. Analysis of outcomes did not favor either approach in terms of morbidity, mortality, and reoperation rate, although odds ratios seemed to consistently support the laparoscopic approach. Results did not determine the comparative efficiency and safety of laparoscopic or open approach for PPU. In view of an increased interest in the laparoscopic approach, further randomized trials are considered essential to determine the relative effectiveness of laparoscopic and open repair of PPU.

Meta-analysis of Laparoscopic Versus Open Repair of Perforated Peptic Ulcer

PubMed Central

Antoniou, George A.; Koch, Oliver O.; Pointner, Rudolph; Granderath, Frank A.

2013-01-01

Background and Objectives: Laparoscopic treatment of perforated peptic ulcer (PPU) has been introduced as an alternative procedure to open surgery. It has been postulated that the minimally invasive approach involves less operative stress and results in decreased morbidity and mortality. Methods: We conducted a meta-analysis of randomized trials to test this hypothesis. Medline, EMBASE, and the Cochrane Central Register of Randomized Trials databases were searched, with no date or language restrictions. Results: Our literature search identified 4 randomized trials, with a cumulative number of 289 patients, that compared the laparoscopic approach with open sutured repair of perforated ulcer. Analysis of outcomes did not favor either approach in terms of morbidity, mortality, and reoperation rate, although odds ratios seemed to consistently support the laparoscopic approach. Results did not determine the comparative efficiency and safety of laparoscopic or open approach for PPU. Conclusion: In view of an increased interest in the laparoscopic approach, further randomized trials are considered essential to determine the relative effectiveness of laparoscopic and open repair of PPU. PMID:23743368

A fast image matching algorithm based on key points

NASA Astrophysics Data System (ADS)

Wang, Huilin; Wang, Ying; An, Ru; Yan, Peng

2014-05-01

Image matching is a very important technique in image processing. It has been widely used for object recognition and tracking, image retrieval, three-dimensional vision, change detection, aircraft position estimation, and multi-image registration. Based on the requirements of matching algorithm for craft navigation, such as speed, accuracy and adaptability, a fast key point image matching method is investigated and developed. The main research tasks includes: (1) Developing an improved celerity key point detection approach using self-adapting threshold of Features from Accelerated Segment Test (FAST). A method of calculating self-adapting threshold was introduced for images with different contrast. Hessian matrix was adopted to eliminate insecure edge points in order to obtain key points with higher stability. This approach in detecting key points has characteristics of small amount of computation, high positioning accuracy and strong anti-noise ability; (2) PCA-SIFT is utilized to describe key point. 128 dimensional vector are formed based on the SIFT method for the key points extracted. A low dimensional feature space was established by eigenvectors of all the key points, and each eigenvector was projected onto the feature space to form a low dimensional eigenvector. These key points were re-described by dimension-reduced eigenvectors. After reducing the dimension by the PCA, the descriptor was reduced to 20 dimensions from the original 128. This method can reduce dimensions of searching approximately near neighbors thereby increasing overall speed; (3) Distance ratio between the nearest neighbour and second nearest neighbour searching is regarded as the measurement criterion for initial matching points from which the original point pairs matched are obtained. Based on the analysis of the common methods (e.g. RANSAC (random sample consensus) and Hough transform cluster) used for elimination false matching point pairs, a heuristic local geometric restriction strategy is adopted to discard false matched point pairs further; and (4) Affine transformation model is introduced to correct coordinate difference between real-time image and reference image. This resulted in the matching of the two images. SPOT5 Remote sensing images captured at different date and airborne images captured with different flight attitude were used to test the performance of the method from matching accuracy, operation time and ability to overcome rotation. Results show the effectiveness of the approach.

Searching for evidence or approval? A commentary on database search in systematic reviews and alternative information retrieval methodologies.

PubMed

Delaney, Aogán; Tamás, Peter A

2018-03-01

Despite recognition that database search alone is inadequate even within the health sciences, it appears that reviewers in fields that have adopted systematic review are choosing to rely primarily, or only, on database search for information retrieval. This commentary reminds readers of factors that call into question the appropriateness of default reliance on database searches particularly as systematic review is adapted for use in new and lower consensus fields. It then discusses alternative methods for information retrieval that require development, formalisation, and evaluation. Our goals are to encourage reviewers to reflect critically and transparently on their choice of information retrieval methods and to encourage investment in research on alternatives. Copyright © 2017 John Wiley & Sons, Ltd.

Computer-aided diagnosis of lung nodule using gradient tree boosting and Bayesian optimization.

PubMed

Nishio, Mizuho; Nishizawa, Mitsuo; Sugiyama, Osamu; Kojima, Ryosuke; Yakami, Masahiro; Kuroda, Tomohiro; Togashi, Kaori

2018-01-01

We aimed to evaluate a computer-aided diagnosis (CADx) system for lung nodule classification focussing on (i) usefulness of the conventional CADx system (hand-crafted imaging feature + machine learning algorithm), (ii) comparison between support vector machine (SVM) and gradient tree boosting (XGBoost) as machine learning algorithms, and (iii) effectiveness of parameter optimization using Bayesian optimization and random search. Data on 99 lung nodules (62 lung cancers and 37 benign lung nodules) were included from public databases of CT images. A variant of the local binary pattern was used for calculating a feature vector. SVM or XGBoost was trained using the feature vector and its corresponding label. Tree Parzen Estimator (TPE) was used as Bayesian optimization for parameters of SVM and XGBoost. Random search was done for comparison with TPE. Leave-one-out cross-validation was used for optimizing and evaluating the performance of our CADx system. Performance was evaluated using area under the curve (AUC) of receiver operating characteristic analysis. AUC was calculated 10 times, and its average was obtained. The best averaged AUC of SVM and XGBoost was 0.850 and 0.896, respectively; both were obtained using TPE. XGBoost was generally superior to SVM. Optimal parameters for achieving high AUC were obtained with fewer numbers of trials when using TPE, compared with random search. Bayesian optimization of SVM and XGBoost parameters was more efficient than random search. Based on observer study, AUC values of two board-certified radiologists were 0.898 and 0.822. The results show that diagnostic accuracy of our CADx system was comparable to that of radiologists with respect to classifying lung nodules.

Reduced Mortality With Partial-Breast Irradiation for Early Breast Cancer: A Meta-Analysis of Randomized Trials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vaidya, Jayant S., E-mail: jayant.vaidya@ucl.ac.uk; Department of Surgery, Royal Free Hospital, London; Department of Surgery, Whittington Health, London

Purpose: With earlier detection and more effective treatment, mortality from breast cancer continues to fall and it has become increasingly important to reduce the toxicity of treatments. Partial-breast radiation therapy, which focuses radiation to the tumor bed, may achieve this aim. We analyzed mortality differences in randomized trials of partial-breast irradiation (PBI). Methods and Materials: We included data from published randomized trials of PBI (alone or as part of a risk-adapted approach) versus whole-breast irradiation (WBI) for invasive breast cancer suitable for breast-conserving therapy. We identified trials using PubMed and Google searches with the terms “partial breast irradiation” OR “intraoperativemore » radiotherapy” OR “IMRT” OR (“accelerated” AND “radiation”) AND “randomised/randomized,” as well as through discussion with colleagues in the field. We calculated the proportion of patients who had events in each randomized arm at 5 years' follow-up and created a forest plot using Stata, version 14.1. Results: We identified 9 randomized trials of PBI versus WBI in invasive breast cancer; 5-year outcomes were available for non–breast cancer mortality in 5 trials (n=4489) and for breast cancer mortality in 4 trials (n=4231). The overall mortality was 4.9%. There was no detectable heterogeneity between the trials for any of the outcomes. There was no difference in the proportion of patients dying of breast cancer (difference, 0.000% [95% confidence interval (CI), −0.7 to +0.7]; P=.999). Non–breast cancer mortality with PBI was lower than with WBI (difference, 1.1% [95% CI, −2.1% to −0.2%]; P=.023). Total mortality with PBI was also lower than with WBI (difference, 1.3% [95% CI, −2.5% to 0.0%]; P=.05). Conclusions: Use of PBI instead of WBI in selected patients results in a lower 5-year non–breast cancer and overall mortality, amounting to a 25% reduction in relative terms. This information should be included when breast-conserving therapy is proposed to a patient.« less

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

Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces

NASA Astrophysics Data System (ADS)

Jin, Wenliang

2016-01-01

We discuss at length the dynamical behavior of Grover's search algorithm for which all the Walsh-Hadamard transformations contained in this algorithm are exposed to their respective random perturbations inducing the augmentation of the dimension of the search space. We give the concise and general mathematical formulations for approximately characterizing the maximum success probabilities of finding a unique desired state in a large unsorted database and their corresponding numbers of Grover iterations, which are applicable to the search spaces of arbitrary dimension and are used to answer a salient open problem posed by Grover (Phys Rev Lett 80:4329-4332, 1998).

Demeter, persephone, and the search for emergence in agent-based models.

DOE Office of Scientific and Technical Information (OSTI.GOV)

North, M. J.; Howe, T. R.; Collier, N. T.

2006-01-01

In Greek mythology, the earth goddess Demeter was unable to find her daughter Persephone after Persephone was abducted by Hades, the god of the underworld. Demeter is said to have embarked on a long and frustrating, but ultimately successful, search to find her daughter. Unfortunately, long and frustrating searches are not confined to Greek mythology. In modern times, agent-based modelers often face similar troubles when searching for agents that are to be to be connected to one another and when seeking appropriate target agents while defining agent behaviors. The result is a 'search for emergence' in that many emergent ormore » potentially emergent behaviors in agent-based models of complex adaptive systems either implicitly or explicitly require search functions. This paper considers a new nested querying approach to simplifying such agent-based modeling and multi-agent simulation search problems.« less

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.

Adaptive consensus of scale-free multi-agent system by randomly selecting links

NASA Astrophysics Data System (ADS)

Mou, Jinping; Ge, Huafeng

2016-06-01

This paper investigates an adaptive consensus problem for distributed scale-free multi-agent systems (SFMASs) by randomly selecting links, where the degree of each node follows a power-law distribution. The randomly selecting links are based on the assumption that every agent decides to select links among its neighbours according to the received data with a certain probability. Accordingly, a novel consensus protocol with the range of the received data is developed, and each node updates its state according to the protocol. By the iterative method and Cauchy inequality, the theoretical analysis shows that all errors among agents converge to zero, and in the meanwhile, several criteria of consensus are obtained. One numerical example shows the reliability of the proposed methods.

Effectiveness of Azadirachta indica (neem) mouthrinse in plaque and gingivitis control: a systematic review.

PubMed

Dhingra, K; Vandana, K L

2017-02-01

The aim of this systematic review was to evaluate the effectiveness of Azadirachta indica (neem)-based herbal mouthrinse in improving plaque control and gingival health. Literature search was accomplished using electronic databases (PubMed, Cochrane Central Register of Controlled Trials and EMBASE) and manual searching, up to February 2015, for randomized controlled trials (RCTs) presenting clinical data for efficacy of neem mouthrinses when used alone or as an adjunct to mechanical oral hygiene as compared to chlorhexidine mouthrinses for controlling plaque and gingival inflammation in patients with gingivitis. Of the total 206 articles searched, three randomized controlled trials evaluating neem-based herbal mouthrinses were included. Due to marked heterogeneity observed in study characteristics, meta-analysis was not performed. These studies reported that neem mouthrinse was as effective as chlorhexidine mouthrinse when used as an adjunct to toothbrushing in reducing plaque and gingival inflammation in gingivitis patients. However, the quality of reporting and evidence along with methods of studies was generally flawed with unclear risk of bias. Despite the promising results shown in existing randomized controlled trials, the evidence concerning the clinical use of neem mouthrinses is lacking and needs further reinforcement with high-quality randomized controlled trials based on the reporting guidelines of herbal CONSORT statement. © 2016 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

In search of an adaptive social-ecological approach to understanding a tropical city

Treesearch

A.E. Lugo; C.M. Concepcion; L.E. Santiago-Acevedo; T.A. Munoz-Erickson; J.C. Verdejo Ortiz; R. Santiago-Bartolomei; J. Forero-Montana; C.J. Nytch; H. Manrique; W. Colon-Cortes

2012-01-01

This essay describes our effort to develop a practical approach to the integration of the social and ecological sciences in the context of a Latin-American city such as San Juan, Puerto Rico. We describe our adaptive social-ecological approach in the historical context of the developing paradigms of the Anthropocene, new integrative social and ecological sciences, and...

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…

A Search for a General Phenomenon of Adaptive Mutability

PubMed Central

Galitski, T.; Roth, J. R.

1996-01-01

The most prominent systems for the study of adaptive mutability depend on the specialized activities of genetic elements like bacteriophage Mu and the F plasmid. Searching for general adaptive mutability, we have investigated the behavior of Salmonella typhimurium strains with chromosomal lacZ mutations. We have studied 30 revertible nonsense, missense, frameshift, and insertion alleles. One-third of the mutants produced >=10 late revertant colonies (appearing three to seven days after plating on selective medium). For the prolific mutants, the number of late revertants showed rank correlation with the residual β-galactosidase activity; for the same mutants, revertant number showed no correlation with the nonselective reversion rate (from fluctuation tests). Leaky mutants, which grew slowly on selective medium, produced late revertants whereas tight nongrowing mutants generally did not produce late revertants. However, the number of late revertants was not proportional to residual growth. Using total residual growth and the nonselective reversion rate, the expected number of late revertants was calculated. For several leaky mutants, the observed revertant number exceeded the expected number. We suggest that excess late revertants from these mutants arise from general adaptive mutability available to any chromosomal gene. PMID:8725216

Supplementary searches of PubMed to improve currency of MEDLINE and MEDLINE In-Process searches via Ovid.

PubMed

Duffy, Steven; de Kock, Shelley; Misso, Kate; Noake, Caro; Ross, Janine; Stirk, Lisa

2016-10-01

The research investigated whether conducting a supplementary search of PubMed in addition to the main MEDLINE (Ovid) search for a systematic review is worthwhile and to ascertain whether this PubMed search can be conducted quickly and if it retrieves unique, recently published, and ahead-of-print studies that are subsequently considered for inclusion in the final systematic review. Searches of PubMed were conducted after MEDLINE (Ovid) and MEDLINE In-Process (Ovid) searches had been completed for seven recent reviews. The searches were limited to records not in MEDLINE or MEDLINE In-Process (Ovid). Additional unique records were identified for all of the investigated reviews. Search strategies were adapted quickly to run in PubMed, and reviewer screening of the results was not time consuming. For each of the investigated reviews, studies were ordered for full screening; in six cases, studies retrieved from the supplementary PubMed searches were included in the final systematic review. Supplementary searching of PubMed for studies unavailable elsewhere is worthwhile and improves the currency of the systematic reviews.

Supplementary searches of PubMed to improve currency of MEDLINE and MEDLINE In-Process searches via Ovid

PubMed Central

Duffy, Steven; de Kock, Shelley; Misso, Kate; Noake, Caro; Ross, Janine; Stirk, Lisa

2016-01-01

Objective The research investigated whether conducting a supplementary search of PubMed in addition to the main MEDLINE (Ovid) search for a systematic review is worthwhile and to ascertain whether this PubMed search can be conducted quickly and if it retrieves unique, recently published, and ahead-of-print studies that are subsequently considered for inclusion in the final systematic review. Methods Searches of PubMed were conducted after MEDLINE (Ovid) and MEDLINE In-Process (Ovid) searches had been completed for seven recent reviews. The searches were limited to records not in MEDLINE or MEDLINE In-Process (Ovid). Results Additional unique records were identified for all of the investigated reviews. Search strategies were adapted quickly to run in PubMed, and reviewer screening of the results was not time consuming. For each of the investigated reviews, studies were ordered for full screening; in six cases, studies retrieved from the supplementary PubMed searches were included in the final systematic review. Conclusion Supplementary searching of PubMed for studies unavailable elsewhere is worthwhile and improves the currency of the systematic reviews. PMID:27822154

Adaptive Optics Photometry and Astrometry of Binary Stars. III. A Faint Companion Search of O-Star Systems

DTIC Science & Technology

2008-08-01

Mason et al. (1998) survey. 3.3. 2MASS Data Mining Confirmations Searches were made for Two Micron All Sky Survey ( 2MASS ) (Cutri et al. 2003...the separation/m limits of 2MASS , the point-source catalog was searched for sources in the magnitude range 5.5 J 8.0, corresponding to the...approximate 2MASS J -magnitude range for the AO targets in this project. This yielded 99,656 sources. All sources within 10′′ of these “primaries” were then

A case study of evolutionary computation of biochemical adaptation

NASA Astrophysics Data System (ADS)

François, Paul; Siggia, Eric D.

2008-06-01

Simulations of evolution have a long history, but their relation to biology is questioned because of the perceived contingency of evolution. Here we provide an example of a biological process, adaptation, where simulations are argued to approach closer to biology. Adaptation is a common feature of sensory systems, and a plausible component of other biochemical networks because it rescales upstream signals to facilitate downstream processing. We create random gene networks numerically, by linking genes with interactions that model transcription, phosphorylation and protein-protein association. We define a fitness function for adaptation in terms of two functional metrics, and show that any reasonable combination of them will yield the same adaptive networks after repeated rounds of mutation and selection. Convergence to these networks is driven by positive selection and thus fast. There is always a path in parameter space of continuously improving fitness that leads to perfect adaptation, implying that the actual mutation rates we use in the simulation do not bias the results. Our results imply a kinetic view of evolution, i.e., it favors gene networks that can be learned quickly from the random examples supplied by mutation. This formulation allows for deductive predictions of the networks realized in nature.

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. © 2015 Wiley Periodicals, Inc.

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.

The Random-Threshold Generalized Unfolding Model and Its Application of Computerized Adaptive Testing

ERIC Educational Resources Information Center

Wang, Wen-Chung; Liu, Chen-Wei; Wu, Shiu-Lien

2013-01-01

The random-threshold generalized unfolding model (RTGUM) was developed by treating the thresholds in the generalized unfolding model as random effects rather than fixed effects to account for the subjective nature of the selection of categories in Likert items. The parameters of the new model can be estimated with the JAGS (Just Another Gibbs…

Use of prism adaptation in children with unilateral brain lesion: Is it feasible?

PubMed

Riquelme, Inmaculada; Henne, Camille; Flament, Benoit; Legrain, Valéry; Bleyenheuft, Yannick; Hatem, Samar M

2015-01-01

Unilateral visuospatial deficits have been observed in children with brain damage. While the effectiveness of prism adaptation for treating unilateral neglect in adult stroke patients has been demonstrated previously, the usefulness of prism adaptation in a pediatric population is still unknown. The present study aims at evaluating the feasibility of prism adaptation in children with unilateral brain lesion and comparing the validity of a game procedure designed for child-friendly paediatric intervention, with the ecological task used for prism adaptation in adult patients. Twenty-one children with unilateral brain lesion randomly were assigned to a prism group wearing prismatic glasses, or a control group wearing neutral glasses during a bimanual task intervention. All children performed two different bimanual tasks on randomly assigned consecutive days: ecological tasks or game tasks. The efficacy of prism adaptation was measured by assessing its after-effects with visual open loop pointing (visuoproprioceptive test) and subjective straight-ahead pointing (proprioceptive test). Game tasks and ecological tasks produced similar after-effects. Prismatic glasses elicited a significant shift of visuospatial coordinates which was not observed in the control group. Prism adaptation performed with game tasks seems an effective procedure to obtain after-effects in children with unilateral brain lesion. The usefulness of repetitive prism adaptation sessions as a therapeutic intervention in children with visuospatial deficits and/or neglect, should be investigated in future studies. Copyright © 2015 Elsevier Ltd. All rights reserved.

Energy Efficiency Maximization of Practical Wireless Communication Systems

NASA Astrophysics Data System (ADS)

Eraslan, Eren

Energy consumption of the modern wireless communication systems is rapidly growing due to the ever-increasing data demand and the advanced solutions employed in order to address this demand, such as multiple-input multiple-output (MIMO) and orthogonal frequency division multiplexing (OFDM) techniques. These MIMO systems are power hungry, however, they are capable of changing the transmission parameters, such as number of spatial streams, number of transmitter/receiver antennas, modulation, code rate, and transmit power. They can thus choose the best mode out of possibly thousands of modes in order to optimize an objective function. This problem is referred to as the link adaptation problem. In this work, we focus on the link adaptation for energy efficiency maximization problem, which is defined as choosing the optimal transmission mode to maximize the number of successfully transmitted bits per unit energy consumed by the link. We model the energy consumption and throughput performances of a MIMO-OFDM link and develop a practical link adaptation protocol, which senses the channel conditions and changes its transmission mode in real-time. It turns out that the brute force search, which is usually assumed in previous works, is prohibitively complex, especially when there are large numbers of transmit power levels to choose from. We analyze the relationship between the energy efficiency and transmit power, and prove that energy efficiency of a link is a single-peaked quasiconcave function of transmit power. This leads us to develop a low-complexity algorithm that finds a near-optimal transmit power and take this dimension out of the search space. We further prune the search space by analyzing the singular value decomposition of the channel and excluding the modes that use higher number of spatial streams than the channel can support. These algorithms and our novel formulations provide simpler computations and limit the search space into a much smaller set; hence reducing the computational complexity by orders of magnitude without sacrificing the performance. The result of this work is a highly practical link adaptation protocol for maximizing the energy efficiency of modern wireless communication systems. Simulation results show orders of magnitude gain in the energy efficiency of the link. We also implemented the link adaptation protocol on real-time MIMO-OFDM radios and we report on the experimental results. To the best of our knowledge, this is the first reported testbed that is capable of performing energy-efficient fast link adaptation using PHY layer information.

Adaptive Highlighting of Links to Assist Surfing on the Internet

DTIC Science & Technology

2002-01-01

search engines do not offer a satisfactory solution, their indexing cycle is long and creates a time lag of about one month. Moreover, sometimes search engines offer a huge amount of documents, which is hard to constrain and to increase the ratio of relevant information. A novel AI-assisted surfing method, which highlights links during surfing is studied here. The method makes use

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.

Modification Site Localization in Peptides.

PubMed

Chalkley, Robert J

2016-01-01

There are a large number of search engines designed to take mass spectrometry fragmentation spectra and match them to peptides from proteins in a database. These peptides could be unmodified, but they could also bear modifications that were added biologically or during sample preparation. As a measure of reliability for the peptide identification, software normally calculates how likely a given quality of match could have been achieved at random, most commonly through the use of target-decoy database searching (Elias and Gygi, Nat Methods 4(3): 207-214, 2007). Matching the correct peptide but with the wrong modification localization is not a random match, so results with this error will normally still be assessed as reliable identifications by the search engine. Hence, an extra step is required to determine site localization reliability, and the software approaches to measure this are the subject of this part of the chapter.

Encounter times of chromatin loci influenced by polymer decondensation

NASA Astrophysics Data System (ADS)

Amitai, A.; Holcman, D.

2018-03-01

The time for a DNA sequence to find its homologous counterpart depends on a long random search inside the cell nucleus. Using polymer models, we compute here the mean first encounter time (MFET) between two sites located on two different polymer chains and confined locally by potential wells. We find that reducing tethering forces acting on the polymers results in local decondensation, and numerical simulations of the polymer model show that these changes are associated with a reduction of the MFET by several orders of magnitude. We derive here new asymptotic formula for the MFET, confirmed by Brownian simulations. We conclude from the present modeling approach that the fast search for homology is mediated by a local chromatin decondensation due to the release of multiple chromatin tethering forces. The present scenario could explain how the homologous recombination pathway for double-stranded DNA repair is controlled by its random search step.

Notes on Search, Detection and Localization Modeling. Revision 4

DTIC Science & Technology

1990-10-01

2, --- , k where the subregions are relabeled so that the following order relation holds: pi/6 1 > p 2!6 2 > ... > pr65 and where k is chosen so... Interfaces ," Operations Research, Vol. 19, No.3, pp 559-586, 1971. 15. Coggins, P.B., "Detection Probability Computations for Random Search of an

Transtheoretical Model-Based Dietary Interventions in Primary Care: A Review of the Evidence in Diabetes

ERIC Educational Resources Information Center

Salmela, Sanna; Poskiparta, Marita; Kasila, Kirsti; Vahasarja, Kati; Vanhala, Mauno

2009-01-01

The objective of this study was to review the evidence concerning stage-based dietary interventions in primary care among persons with diabetes or an elevated diabetes risk. Search strategies were electronic databases and manual search. Selection criteria were randomized controlled studies with stage-based dietary intervention, conducted in…

Statistical signatures of a targeted search by bacteria

NASA Astrophysics Data System (ADS)

Jashnsaz, Hossein; Anderson, Gregory G.; Pressé, Steve

2017-12-01

Chemoattractant gradients are rarely well-controlled in nature and recent attention has turned to bacterial chemotaxis toward typical bacterial food sources such as food patches or even bacterial prey. In environments with localized food sources reminiscent of a bacterium’s natural habitat, striking phenomena—such as the volcano effect or banding—have been predicted or expected to emerge from chemotactic models. However, in practice, from limited bacterial trajectory data it is difficult to distinguish targeted searches from an untargeted search strategy for food sources. Here we use a theoretical model to identify statistical signatures of a targeted search toward point food sources, such as prey. Our model is constructed on the basis that bacteria use temporal comparisons to bias their random walk, exhibit finite memory and are subject to random (Brownian) motion as well as signaling noise. The advantage with using a stochastic model-based approach is that a stochastic model may be parametrized from individual stochastic bacterial trajectories but may then be used to generate a very large number of simulated trajectories to explore average behaviors obtained from stochastic search strategies. For example, our model predicts that a bacterium’s diffusion coefficient increases as it approaches the point source and that, in the presence of multiple sources, bacteria may take substantially longer to locate their first source giving the impression of an untargeted search strategy.

Identification of the ideal clutter metric to predict time dependence of human visual search

NASA Astrophysics Data System (ADS)

Cartier, Joan F.; Hsu, David H.

1995-05-01

The Army Night Vision and Electronic Sensors Directorate (NVESD) has recently performed a human perception experiment in which eye tracker measurements were made on trained military observers searching for targets in infrared images. This data offered an important opportunity to evaluate a new technique for search modeling. Following the approach taken by Jeff Nicoll, this model treats search as a random walk in which the observers are in one of two states until they quit: they are either searching, or they are wandering around looking for a point of interest. When wandering they skip rapidly from point to point. When examining they move more slowly, reflecting the fact that target discrimination requires additional thought processes. In this paper we simulate the random walk, using a clutter metric to assign relative attractiveness to points of interest within the image which are competing for the observer's attention. The NVESD data indicates that a number of standard clutter metrics are good estimators of the apportionment of observer's time between wandering and examining. Conversely, the apportionment of observer time spent wandering and examining could be used to reverse engineer the ideal clutter metric which would most perfectly describe the behavior of the group of observers. It may be possible to use this technique to design the optimal clutter metric to predict performance of visual search.

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 is about the product (adapted guideline). To adequately address local concerns, cases found it necessary to also search and appraise primary studies, resulting in hybrid (adaptation plus de novo) guideline development strategies that required advanced methodological skills. Adaptation was found to be an action element in the knowledge translation continuum that required integration of an implementation perspective. Accordingly, the adaptation methodology and resources were reformulated and substantially augmented to provide practical assistance to groups not supported by a dedicated guideline panel and to provide more implementation planning support. The resulting framework is called CAN-IMPLEMENT. PMID:23656884

A qualitative review of immigrant women's experiences of maternal adaptation in South Korea.

PubMed

Song, Ju-Eun; Ahn, Jeong-Ah; Kim, Tiffany; Roh, Eun Ha

2016-08-01

to synthesise the evidence of immigrant women's experiences of maternal adaptation in Korea. eligible studies were identified by searching MEDLINE, CINAHL, and the Korean electronic databases. Qualitative research studies, published in English and Korean addressing maternal adaptation experiences of immigrant women by marriage in Korea, were considered in the review. The suitability of the quality of articles was evaluated using the Joanna Briggs Institute's Critical Appraisal Checklist. Fifteen studies met the inclusion criteria for data analysis. Authors, purpose of the study, study design, theoretical framework, population (nationality and sample size), data collection (setting and method), and main study findings were extracted and summarised in a data extraction form for further narrative analysis and synthesis. A qualitative systematic review was performed by means of thematic synthesis. the literature search identified 7,628 articles, of which 15 studies, published between 2009 and 2014, were evaluated in the systematic review. Two overarching categories including five themes were identified in the qualitative studies related to maternal adaptation experiences; 'Experiences of motherhood transition' and 'Experiences of child-rearing'. these findings demonstrate the importance of understanding and improving maternal adaptation of immigrant women living in Korea. This can be achieved by enhancing social support, providing culturally sensitive maternal healthcare services, and expanding opportunities for immigrant women in education, job training, and economic independence. Copyright © 2016 Elsevier Ltd. All rights reserved.

A Systematic Review of the Literature on Parenting of Young Children with Visual Impairments and the Adaptions for Video-Feedback Intervention to Promote Positive Parenting (VIPP).

PubMed

van den Broek, Ellen G C; van Eijden, Ans J P M; Overbeek, Mathilde M; Kef, Sabina; Sterkenburg, Paula S; Schuengel, Carlo

2017-01-01

Secure parent-child attachment may help children to overcome the challenges of growing up with a visual or visual-and-intellectual impairment. A large literature exists that provides a blueprint for interventions that promote parental sensitivity and secure attachment. The Video-feedback Intervention to promote Positive Parenting (VIPP) is based on that blueprint. While it has been adapted to several specific at risk populations, children with visual impairment may require additional adjustments. This study aimed to identify the themes that should be addressed in adapting VIPP and similar interventions. A Delphi-consultation was conducted with 13 professionals in the field of visual impairment to select the themes for relationship-focused intervention. These themes informed a systematic literature search. Interaction, intersubjectivity, joint attention, exploration, play and specific behavior were the themes mentioned in the Delphi-group. Paired with visual impairment or vision disorders, infants or young children (and their parents) the search yielded 74 articles, making the six themes for intervention adaptation more specific and concrete. The rich literature on six visual impairment specific themes was dominated by the themes interaction, intersubjectivity, and joint attention. These themes need to be addressed in adapting intervention programs developed for other populations, such as VIPP which currently focuses on higher order constructs of sensitivity and attachment.

Educational and Skills-Based Interventions to Prevent Relationship Violence in Young People

ERIC Educational Resources Information Center

Fellmeth, Gracia; Heffernan, Catherine; Nurse, Joanna; Habibula, Shakiba; Sethi, Dinesh

2015-01-01

Objectives: To assess the efficacy of educational and skills-based interventions to prevent relationship and dating violence in adolescents and young adults. Methods: We searched Cochrane Central Register of Controlled Trials (CENTRAL), MEDLINE, EMBASE, CINAHL, PsycINFO, and other databases for randomized, cluster-randomized, and quasi-randomized…

Randomization Methods in Emergency Setting Trials: A Descriptive Review

ERIC Educational Resources Information Center

Corbett, Mark Stephen; Moe-Byrne, Thirimon; Oddie, Sam; McGuire, William

2016-01-01

Background: Quasi-randomization might expedite recruitment into trials in emergency care settings but may also introduce selection bias. Methods: We searched the Cochrane Library and other databases for systematic reviews of interventions in emergency medicine or urgent care settings. We assessed selection bias (baseline imbalances) in prognostic…

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tipireddy, R.; Stinis, P.; Tartakovsky, A. M.

In this paper, we present a novel approach for solving steady-state stochastic partial differential equations (PDEs) with high-dimensional random parameter space. The proposed approach combines spatial domain decomposition with basis adaptation for each subdomain. The basis adaptation is used to address the curse of dimensionality by constructing an accurate low-dimensional representation of the stochastic PDE solution (probability density function and/or its leading statistical moments) in each subdomain. Restricting the basis adaptation to a specific subdomain affords finding a locally accurate solution. Then, the solutions from all of the subdomains are stitched together to provide a global solution. We support ourmore » construction with numerical experiments for a steady-state diffusion equation with a random spatially dependent coefficient. Lastly, our results show that highly accurate global solutions can be obtained with significantly reduced computational costs.« less

Randomized, controlled trial of an intervention for toddlers with autism: the Early Start Denver Model.

PubMed

Dawson, Geraldine; Rogers, Sally; Munson, Jeffrey; Smith, Milani; Winter, Jamie; Greenson, Jessica; Donaldson, Amy; Varley, Jennifer

2010-01-01

To conduct a randomized, controlled trial to evaluate the efficacy of the Early Start Denver Model (ESDM), a comprehensive developmental behavioral intervention, for improving outcomes of toddlers diagnosed with autism spectrum disorder (ASD). Forty-eight children diagnosed with ASD between 18 and 30 months of age were randomly assigned to 1 of 2 groups: (1) ESDM intervention, which is based on developmental and applied behavioral analytic principles and delivered by trained therapists and parents for 2 years; or (2) referral to community providers for intervention commonly available in the community. Compared with children who received community-intervention, children who received ESDM showed significant improvements in IQ, adaptive behavior, and autism diagnosis. Two years after entering intervention, the ESDM group on average improved 17.6 standard score points (1 SD: 15 points) compared with 7.0 points in the comparison group relative to baseline scores. The ESDM group maintained its rate of growth in adaptive behavior compared with a normative sample of typically developing children. In contrast, over the 2-year span, the comparison group showed greater delays in adaptive behavior. Children who received ESDM also were more likely to experience a change in diagnosis from autism to pervasive developmental disorder, not otherwise specified, than the comparison group. This is the first randomized, controlled trial to demonstrate the efficacy of a comprehensive developmental behavioral intervention for toddlers with ASD for improving cognitive and adaptive behavior and reducing severity of ASD diagnosis. Results of this study underscore the importance of early detection of and intervention in autism.

Successful adaption of a forensic toxicological screening workflow employing nontargeted liquid chromatography-tandem mass spectrometry to water analysis.

PubMed

Steger, Julia; Arnhard, Kathrin; Haslacher, Sandra; Geiger, Klemens; Singer, Klaus; Schlapp, Michael; Pitterl, Florian; Oberacher, Herbert

2016-04-01

Forensic toxicology and environmental water analysis share the common interest and responsibility in ensuring comprehensive and reliable confirmation of drugs and pharmaceutical compounds in samples analyzed. Dealing with similar analytes, detection and identification techniques should be exchangeable between scientific disciplines. Herein, we demonstrate the successful adaption of a forensic toxicological screening workflow employing nontargeted LC/MS/MS under data-dependent acquisition control and subsequent database search to water analysis. The main modification involved processing of an increased sample volume with SPE (500 mL vs. 1-10 mL) to reach LODs in the low ng/L range. Tandem mass spectra acquired with a qTOF instrument were submitted to database search. The targeted data mining strategy was found to be sensitive and specific; automated search produced hardly any false results. To demonstrate the applicability of the adapted workflow to complex samples, 14 wastewater effluent samples collected on seven consecutive days at the local wastewater-treatment plant were analyzed. Of the 88,970 fragment ion mass spectra produced, 8.8% of spectra were successfully assigned to one of the 1040 reference compounds included in the database, and this enabled the identification of 51 compounds representing important illegal drugs, members of various pharmaceutical compound classes, and metabolites thereof. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

The Yak genome database: an integrative database for studying yak biology and high-altitude adaption

PubMed Central

2012-01-01

Background The yak (Bos grunniens) is a long-haired bovine that lives at high altitudes and is an important source of milk, meat, fiber and fuel. The recent sequencing, assembly and annotation of its genome are expected to further our understanding of the means by which it has adapted to life at high altitudes and its ecologically important traits. Description The Yak Genome Database (YGD) is an internet-based resource that provides access to genomic sequence data and predicted functional information concerning the genes and proteins of Bos grunniens. The curated data stored in the YGD includes genome sequences, predicted genes and associated annotations, non-coding RNA sequences, transposable elements, single nucleotide variants, and three-way whole-genome alignments between human, cattle and yak. YGD offers useful searching and data mining tools, including the ability to search for genes by name or using function keywords as well as GBrowse genome browsers and/or BLAST servers, which can be used to visualize genome regions and identify similar sequences. Sequence data from the YGD can also be downloaded to perform local searches. Conclusions A new yak genome database (YGD) has been developed to facilitate studies on high-altitude adaption and bovine genomics. The database will be continuously updated to incorporate new information such as transcriptome data and population resequencing data. The YGD can be accessed at http://me.lzu.edu.cn/yak. PMID:23134687

A study to enhance clinical end-user MEDLINE search skills: design and baseline findings.

PubMed

McKibbon, K A; Haynes, R B; Johnston, M E; Walker, C J

1991-01-01

To determine if a preceptor and timely, individualized feedback improves the performance of physicians in searching MEDLINE using GRATEFUL MED in clinical settings. Randomized controlled trial. A 300 bed primary to tertiary care teaching hospital. Computers were installed in wards and clinics of 6 major clinical services, and the emergency room, intensive care and neonatal intensive care units. All physicians and physicians-in-training from the departments of Medicine, Family Medicine, Surgery, Psychiatry, Pediatrics, and Obstetrics and Gynecology were included if they made patient care decisions for at least 8 weeks during the study period. All participants were given a 1-hour training class and 1 hour of individualized searching with 1 of the 2 study librarians. After training, participants were randomized to a control group who received no further intervention or to an intervention group in which each person chose a clinical preceptor experienced in MEDLINE searching and received individualized feedback by a study librarian on their first 10 searches, indicating search quality and providing suggestions for improvement. Feedback was mailed the first week day after the search was done. Baseline characteristics by study group, department and level of training, study participation rates, and searching rates. 308 of 392 eligible physicians joined the study. Participation was almost 80% with some variation by department and level of training. Excellent balance in the baseline characteristics was achieved for the 2 groups, as well as for the number who did first searches. Intervention group participants searched MEDLINE more often than did controls (3.5 searches per month vs 2.5 per month for controls, P = 0.046). The recall and precision for first searches for both groups was significantly less than that of librarians. The analysis of study data will be completed by September 1991. Clinicians are willing to do self-service searching of MEDLINE in clinical settings but their precision and recall are less than a trained librarian at baseline. Search skills enhancements are needed and the effect of feedback and preceptors is being tested. U.S. National Library of Medicine and Ontario Ministry of Health.

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 that animals use to adapt to injury.

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 that animals use to adapt to injury.

Mitral Valve Clip for Treatment of Mitral Regurgitation: An Evidence-Based Analysis

PubMed Central

Ansari, Mohammed T.; Ahmadzai, Nadera; Coyle, Kathryn; Coyle, Doug; Moher, David

2015-01-01

Background Many of the 500,000 North American patients with chronic mitral regurgitation may be poor candidates for mitral valve surgery. Objective The objective of this study was to investigate the comparative effectiveness, harms, and cost-effectiveness of percutaneous mitral valve repair using mitral valve clips in candidates at prohibitive risk for surgery. Data Sources We searched articles in MEDLINE, Embase, and the Cochrane Library published from 1994 to February 2014 for evidence of effectiveness and harms; for economic literature we also searched NHS EED and Tufts CEA registry. Grey literature was also searched. Review Methods Primary studies were sought from existing systematic reviews that had employed reliable search and screening methods. Newer studies were sought by searching the period subsequent to the last search date of the review. Two reviewers screened records and assessed study validity. We used the Cochrane risk of bias tool for randomized, generic assessment for non-randomized studies, and the Phillips checklist for economic studies. Results Ten studies including 1 randomized trial were included. The majority of the direct comparative evidence compared the mitral valve clip repair with surgery in patients not particularly at prohibitive surgical risk. Irrespective of degenerative or functional chronic mitral regurgitation etiology, evidence of effectiveness and harms is inconclusive and of very low quality. Very-low-quality evidence indicates that percutaneous mitral valve clip repair may provide a survival advantage, at least during the first 1 to 2 years, particularly in medically managed chronic functional mitral regurgitation. Because of limitations in the design of studies, the cost-effectiveness of mitral valve clips in patients at prohibitive risk for surgery also could not be established. Limitations Because of serious concerns of risk of bias, indirectness, and imprecision, evidence is of very low quality. Conclusions No meaningful conclusions can be drawn about the comparative effectiveness, harms, and cost-effectiveness of mitral valve clips in the population with chronic mitral regurgitation who are at prohibitive risk for surgery. PMID:26379810

Not just a light fingertip touch: A facilitation of functional integration between body sway and visual search in older adults.

PubMed

Chen, Fu-Chen; Chu, Chia-Hua; Pan, Chien-Yu; Tsai, Chia-Liang

2018-05-01

Prior studies demonstrated that, compared to no fingertip touch (NT), a reduction in body sway resulting from the effects of light fingertip touch (LT) facilitates the performance of visual search, buttressing the concept of functional integration. However, previous findings may be confounded by different arm postures required between the NT and LT conditions. Furthermore, in older adults, how LT influences the interactions between body sway and visual search has not been established. (1) Are LT effects valid after excluding the influences of different upper limb configurations? (2) Is functional integration is feasible for older adults? Twenty-two young (age = 21.3 ± 2.0) and 22 older adults (age = 71.8 ± 4.1) were recruited. Participants performed visual inspection and visual searches under NT and LT conditions. The older group significantly reduced AP sway (p < 0.05) in LT compared to NT conditions, of which the LT effects on postural adaptation were more remarkable in older than young adults (p < 0.05). In addition, the older group significantly improved search accuracy (p < 0.05) from the LT to the NT condition, and these effects were equivalent between groups. After controlling for postural configurations, the results demonstrate that light fingertip touch reduces body sway and concurrently enhances visual search performance in older adults. These findings confirmed the effects of LT on postural adaptation as well as supported functional integration in older adults. Copyright © 2018 Elsevier B.V. All rights reserved.

1993 Annual report on scientific programs: A broad research program on the sciences of complexity

DOE Office of Scientific and Technical Information (OSTI.GOV)

NONE

1993-12-31

This report provides a summary of many of the research projects completed by the Santa Fe Institute (SFI) during 1993. These research efforts continue to focus on two general areas: the study of, and search for, underlying scientific principles governing complex adaptive systems, and the exploration of new theories of computation that incorporate natural mechanisms of adaptation (mutation, genetics, evolution).

Closed-Loop Optimal Control Implementations for Space Applications

DTIC Science & Technology

2016-12-01

analyses of a series of optimal control problems, several real- time optimal control algorithms are developed that continuously adapt to feedback on the...through the analyses of a series of optimal control problems, several real- time optimal control algorithms are developed that continuously adapt to...information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering

Non-random dispersal in the butterfly Maniola jurtina: implications for metapopulation models.

PubMed Central

Conradt, L; Bodsworth, E J; Roper, T J; Thomas, C D

2000-01-01

The dispersal patterns of animals are important in metapopulation ecology because they affect the dynamics and survival of populations. Theoretical models assume random dispersal but little is known in practice about the dispersal behaviour of individual animals or the strategy by which dispersers locate distant habitat patches. In the present study, we released individual meadow brown butterflies (Maniola jurtina) in a non-habitat and investigated their ability to return to a suitable habitat. The results provided three reasons for supposing that meadow brown butterflies do not seek habitat by means of random flight. First, when released within the range of their normal dispersal distances, the butterflies orientated towards suitable habitat at a higher rate than expected at random. Second, when released at larger distances from their habitat, they used a non-random, systematic, search strategy in which they flew in loops around the release point and returned periodically to it. Third, butterflies returned to a familiar habitat patch rather than a non-familiar one when given a choice. If dispersers actively orientate towards or search systematically for distant habitat, this may be problematic for existing metapopulation models, including models of the evolution of dispersal rates in metapopulations. PMID:11007325

Intelligent control of non-linear dynamical system based on the adaptive neurocontroller

NASA Astrophysics Data System (ADS)

Engel, E.; Kovalev, I. V.; Kobezhicov, V.

2015-10-01

This paper presents an adaptive neuro-controller for intelligent control of non-linear dynamical system. The formed as the fuzzy selective neural net the adaptive neuro-controller on the base of system's state, creates the effective control signal under random perturbations. The validity and advantages of the proposed adaptive neuro-controller are demonstrated by numerical simulations. The simulation results show that the proposed controller scheme achieves real-time control speed and the competitive performance, as compared to PID, fuzzy logic controllers.

An adapted mindfulness-based stress reduction program for elders in a continuing care retirement community: quantitative and qualitative results from a pilot randomized controlled trial.

PubMed

Moss, Aleezé S; Reibel, Diane K; Greeson, Jeffrey M; Thapar, Anjali; Bubb, Rebecca; Salmon, Jacqueline; Newberg, Andrew B

2015-06-01

The purpose of this study was to test the feasibility and effectiveness of an adapted 8-week Mindfulness-Based Stress Reduction (MBSR) program for elders in a continuing care community. This mixed-methods study used both quantitative and qualitative measures. A randomized waitlist control design was used for the quantitative aspect of the study. Thirty-nine elderly were randomized to MBSR (n = 20) or a waitlist control group (n = 19), mean age was 82 years. Both groups completed pre-post measures of health-related quality of life, acceptance and psychological flexibility, facets of mindfulness, self-compassion, and psychological distress. A subset of MBSR participants completed qualitative interviews. MBSR participants showed significantly greater improvement in acceptance and psychological flexibility and in role limitations due to physical health. In the qualitative interviews, MBSR participants reported increased awareness, less judgment, and greater self-compassion. Study results demonstrate the feasibility and potential effectiveness of an adapted MBSR program in promoting mind-body health for elders. © The Author(s) 2014.

Corticosteroids as adjuvant therapy for ocular toxoplasmosis.

PubMed

Jasper, Smitha; Vedula, Satyanarayana S; John, Sheeja S; Horo, Saban; Sepah, Yasir J; Nguyen, Quan Dong

2017-01-26

Ocular infection caused by Toxoplasma gondii, a parasite, may result in inflammation in the retina, choroid, and uvea, and consequently lead to complications such as glaucoma, cataract, and posterior synechiae. The objective of this systematic review was to assess the effects of adjunctive use of corticosteroids to anti-parasitic therapy versus anti-parasitic therapy alone for ocular toxoplasmosis. We searched CENTRAL (which contains the Cochrane Eyes and Vision Trials Register (2016; Issue 11)), MEDLINE Ovid, Epub Ahead of Print, In-Process & Other Non-Indexed Citations, MEDLINE Ovid Daily (January 1946 to December 2016), Embase (January 1980 to December 2016), Latin American and Caribbean Literature on Health Sciences (LILACS (January 1982 to December 2016)), the ISRCTN registry (www.isrctn.com/editAdvancedSearch), ClinicalTrials.gov (www.clinicaltrials.gov), and the World Health Organization (WHO) International Clinical Trials Registry Platform (ICTRP; www.who.int/ictrp/search/en). We used no date or language restrictions in the electronic searches for trials. We last searched the electronic databases on 7 December 2016. We had planned to include randomized and quasi-randomized controlled trials. Eligible trials would have enrolled participants of any age who were immunocompetent and were diagnosed with acute ocular toxoplasmosis. Included trials would have compared anti-parasitic therapy plus corticosteroids versus anti-parasitic therapy alone, different doses or times of initiation of corticosteroids. Two authors independently screened titles and abstracts retrieved through the electronic searches. We retrieved full-text reports of studies categorized as 'unsure' or 'include' after we reviewed the abstracts. Two authors independently reviewed each full-text report for eligibility. Discrepancies were resolved through discussion. We identified no completed or ongoing trial that was eligible for this Cochrane review. Although research has identified a wide variation in practice regarding the use of corticosteroids, our review did not identify any evidence from randomized controlled trials for or against the role of corticosteroids in the management of ocular toxoplasmosis. Several questions remain unanswered by well-conducted randomized trials in this context, including whether the use of corticosteroids as an adjunctive agent is more effective than the use of anti-parasitic therapy alone; if so, when corticosteroids should be initiated in the treatment regimen (early versus late course of treatment), and what would be the best dose and duration of steroid use.

"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

Study on Multi-stage Logistics System Design Problem with Inventory Considering Demand Change by Hybrid Genetic Algorithm

NASA Astrophysics Data System (ADS)

Inoue, Hisaki; Gen, Mitsuo

The logistics model used in this study is 3-stage model employed by an automobile company, which aims to solve traffic problems at a total minimum cost. Recently, research on the metaheuristics method has advanced as an approximate means for solving optimization problems like this model. These problems can be solved using various methods such as the genetic algorithm (GA), simulated annealing, and tabu search. GA is superior in robustness and adjustability toward a change in the structure of these problems. However, GA has a disadvantage in that it has a slightly inefficient search performance because it carries out a multi-point search. A hybrid GA that combines another method is attracting considerable attention since it can compensate for a fault to a partial solution that early convergence gives a bad influence on a result. In this study, we propose a novel hybrid random key-based GA(h-rkGA) that combines local search and parameter tuning of crossover rate and mutation rate; h-rkGA is an improved version of the random key-based GA (rk-GA). We attempted comparative experiments with spanning tree-based GA, priority based GA and random key-based GA. Further, we attempted comparative experiments with “h-GA by only local search” and “h-GA by only parameter tuning”. We reported the effectiveness of the proposed method on the basis of the results of these experiments.

Enhanced Recovery After Surgery (ERAS®) in Individuals with Diabetes: A Systematic Review.

PubMed

Albalawi, Zaina; Laffin, Michael; Gramlich, Leah; Senior, Peter; McAlister, Finlay A

2017-08-01

Prevalence of diabetes in surgical patients is 10-40%. It is well recognized that they have higher rates of complications, and longer stays in hospital compared to patients without diabetes. Enhanced recovery after surgery (ERAS) is an evidence-based multimodal surgical care pathway that improves postoperative complications and length of stay in patients without diabetes. This review evaluates the evidence on whether individuals with diabetes would benefit from ERAS implementation. MEDLINE, Cochrane Central Register of Controlled Trials (CENTRAL) and EMBASE searched with no language restrictions applied. Conference proceedings and bibliographies were reviewed. Experts in the field were contacted, and www.clinicaltrials.gov searched for ongoing trials. Randomized controlled trials (RCT) looking at individuals with diabetes undergoing surgery randomized to ERAS ® or conventional care. Non-randomized controlled trials, controlled before-after studies, interrupted time series, and cohort studies with concurrent controls were also considered. Two authors independently screened studies. The electronic search yielded 437 references. After removing duplicates, 376 were screened for eligibility. Conference proceedings and bibliographies identified additional references. Searching www.clinicaltrials.gov yielded 59 references. Contacting experts in the field identified no further studies. Fourteen full articles were assessed and subsequently excluded for the following reasons: used an intervention other than ERAS ® , did not include patients with diabetes, or used an uncontrolled observational design. To date, the effects of ERAS ® on patients with diabetes have not been rigorously evaluated. This review highlights the lack of evidence in this area and provides guidance on design for future studies.

Optimization and universality of Brownian search in a basic model of quenched heterogeneous media

NASA Astrophysics Data System (ADS)

Godec, Aljaž; Metzler, Ralf

2015-05-01

The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so-called mean first-passage time (MFPT) problem. The occurrence of occasional large jumps or intermittent patterns combining various types of motion are known to outperform the standard random walk with respect to the MFPT, by reducing oversampling of space. Here we show that a regular but spatially heterogeneous random walk can significantly and universally enhance the search in any spatial dimension. In a generic minimal model we consider a spherically symmetric system comprising two concentric regions with piecewise constant diffusivity. The MFPT is analyzed under the constraint of conserved average dynamics, that is, the spatially averaged diffusivity is kept constant. Our analytical calculations and extensive numerical simulations demonstrate the existence of an optimal heterogeneity minimizing the MFPT to the target. We prove that the MFPT for a random walk is completely dominated by what we term direct trajectories towards the target and reveal a remarkable universality of the spatially heterogeneous search with respect to target size and system dimensionality. In contrast to intermittent strategies, which are most profitable in low spatial dimensions, the spatially inhomogeneous search performs best in higher dimensions. Discussing our results alongside recent experiments on single-particle tracking in living cells, we argue that the observed spatial heterogeneity may be beneficial for cellular signaling processes.

Exploration Opportunity Search of Near-earth Objects Based on Analytical Gradients

NASA Astrophysics Data System (ADS)

Ren, Yuan; Cui, Ping-Yuan; Luan, En-Jie

2008-07-01

The problem of search of opportunity for the exploration of near-earth minor objects is investigated. For rendezvous missions, the analytical gradients of the performance index with respect to the free parameters are derived using the variational calculus and the theory of state-transition matrix. After generating randomly some initial guesses in the search space, the performance index is optimized, guided by the analytical gradients, leading to the local minimum points representing the potential launch opportunities. This method not only keeps the global-search property of the traditional method, but also avoids the blindness in the latter, thereby increasing greatly the computing speed. Furthermore, with this method, the searching precision could be controlled effectively.

Mechanistic analysis of the search behaviour of Caenorhabditis elegans

PubMed Central

Salvador, Liliana C. M.; Bartumeus, Frederic; Levin, Simon A.; Ryu, William S.

2014-01-01

A central question in movement research is how animals use information and movement to promote encounter success. Current random search theory identifies reorientation patterns as key to the compromise between optimizing encounters for both nearby and faraway targets, but how the balance between intrinsic motor programmes and previous environmental experience determines the occurrence of these reorientation behaviours remains unknown. We used high-resolution tracking and imaging data to describe the complete motor behaviour of Caenorhabditis elegans when placed in a novel environment (one in which food is absent). Movement in C. elegans is structured around different reorientation behaviours, and we measured how these contributed to changing search strategies as worms became familiar with their new environment. This behavioural transition shows that different reorientation behaviours are governed by two processes: (i) an environmentally informed ‘extrinsic’ strategy that is influenced by recent experience and that controls for area-restricted search behaviour, and (ii) a time-independent, ‘intrinsic’ strategy that reduces spatial oversampling and improves random encounter success. Our results show how movement strategies arise from a balance between intrinsic and extrinsic mechanisms, that search behaviour in C. elegans is initially determined by expectations developed from previous environmental experiences, and which reorientation behaviours are modified as information is acquired from new environments. PMID:24430127

The Role of Search Speed in the Contextual Cueing of Children's Attention.

PubMed

Darby, Kevin; Burling, Joseph; Yoshida, Hanako

2014-01-01

The contextual cueing effect is a robust phenomenon in which repeated exposure to the same arrangement of random elements guides attention to relevant information by constraining search. The effect is measured using an object search task in which a target (e.g., the letter T) is located within repeated or nonrepeated visual contexts (e.g., configurations of the letter L). Decreasing response times for the repeated configurations indicates that contextual information has facilitated search. Although the effect is robust among adult participants, recent attempts to document the effect in children have yielded mixed results. We examined the effect of search speed on contextual cueing with school-aged children, comparing three types of stimuli that promote different search times in order to observe how speed modulates this effect. Reliable effects of search time were found, suggesting that visual search speed uniquely constrains the role of attention toward contextually cued information.

The Role of Search Speed in the Contextual Cueing of Children’s Attention

PubMed Central

Darby, Kevin; Burling, Joseph; Yoshida, Hanako

2013-01-01

The contextual cueing effect is a robust phenomenon in which repeated exposure to the same arrangement of random elements guides attention to relevant information by constraining search. The effect is measured using an object search task in which a target (e.g., the letter T) is located within repeated or nonrepeated visual contexts (e.g., configurations of the letter L). Decreasing response times for the repeated configurations indicates that contextual information has facilitated search. Although the effect is robust among adult participants, recent attempts to document the effect in children have yielded mixed results. We examined the effect of search speed on contextual cueing with school-aged children, comparing three types of stimuli that promote different search times in order to observe how speed modulates this effect. Reliable effects of search time were found, suggesting that visual search speed uniquely constrains the role of attention toward contextually cued information. PMID:24505167