Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery

Science.gov (United States)

Kim, Daeun; Haldar, Justin P.

2016-01-01

This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to existing greedy algorithms that impose less signal structure. PMID:26973368

An efficient community detection algorithm using greedy surprise maximization

International Nuclear Information System (INIS)

Jiang, Yawen; Jia, Caiyan; Yu, Jian

2014-01-01

Community detection is an important and crucial problem in complex network analysis. Although classical modularity function optimization approaches are widely used for identifying communities, the modularity function (Q) suffers from its resolution limit. Recently, the surprise function (S) was experimentally proved to be better than the Q function. However, up until now, there has been no algorithm available to perform searches to directly determine the maximal surprise values. In this paper, considering the superiority of the S function over the Q function, we propose an efficient community detection algorithm called AGSO (algorithm based on greedy surprise optimization) and its improved version FAGSO (fast-AGSO), which are based on greedy surprise optimization and do not suffer from the resolution limit. In addition, (F)AGSO does not need the number of communities K to be specified in advance. Tests on experimental networks show that (F)AGSO is able to detect optimal partitions in both simple and even more complex networks. Moreover, algorithms based on surprise maximization perform better than those algorithms based on modularity maximization, including Blondel–Guillaume–Lambiotte–Lefebvre (BGLL), Clauset–Newman–Moore (CNM) and the other state-of-the-art algorithms such as Infomap, order statistics local optimization method (OSLOM) and label propagation algorithm (LPA). (paper)

Greedy Algorithms for Reduced Bases in Banach Spaces

KAUST Repository

DeVore, Ronald

2013-02-26

Given a Banach space X and one of its compact sets F, we consider the problem of finding a good n-dimensional space X n⊂X which can be used to approximate the elements of F. The best possible error we can achieve for such an approximation is given by the Kolmogorov width dn(F)X. However, finding the space which gives this performance is typically numerically intractable. Recently, a new greedy strategy for obtaining good spaces was given in the context of the reduced basis method for solving a parametric family of PDEs. The performance of this greedy algorithm was initially analyzed in Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) in the case X=H is a Hilbert space. The results of Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) were significantly improved upon in Binev et al. (SIAM J. Math. Anal. 43:1457-1472, 2011). The purpose of the present paper is to give a new analysis of the performance of such greedy algorithms. Our analysis not only gives improved results for the Hilbert space case but can also be applied to the same greedy procedure in general Banach spaces. © 2013 Springer Science+Business Media New York.

Formal Modeling of Greedy Nodes in 802.15.4 WSN

Directory of Open Access Journals (Sweden)

Youcef Hammal

2015-06-01

Full Text Available This paper deals with formal specification of the non-slotted CSMA/CA protocol in wireless sensor networks(WSN whose some nodes own a greedy behavior. This protocol requires sensor nodes to wait some time before initiating a transmission, whereas greedy nodes may try to reduce their waiting duration, which may penalize other nodes. To analyze their impact on WSN mode in operation, we use timed automata of the model-checker UPPAAL to capture the abstract behavior of communication medium, sane, and greedy nodes in WSN. This enables the use of analysis tools to check whether these models satisfy intended properties.

Greedy algorithms withweights for construction of partial association rules

KAUST Repository

Moshkov, Mikhail; Piliszczu, Marcin; Zielosko, Beata Marta

2009-01-01

This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

Greedy algorithms withweights for construction of partial association rules

KAUST Repository

Moshkov, Mikhail

2009-09-10

This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

Directory of Open Access Journals (Sweden)

Leilei Cao

2016-01-01

Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Su Xia

2014-05-01

Full Text Available With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.

Two-pass greedy regular expression parsing

DEFF Research Database (Denmark)

Grathwohl, Niels Bjørn Bugge; Henglein, Fritz; Nielsen, Lasse

2013-01-01

We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree representation. It improves on previous algorithms...... by: operating in only 2 passes; using only O(m) words of random-access memory (independent of n); requiring only kn bits of sequentially written and read log storage, where k ... and not requiring it to be stored at all. Previous RE parsing algorithms do not scale linearly with input size, or require substantially more log storage and employ 3 passes where the first consists of reversing the input, or do not or are not known to produce a greedy parse. The performance of our unoptimized C...

Greedy Deep Dictionary Learning

OpenAIRE

Tariyal, Snigdha; Majumdar, Angshul; Singh, Richa; Vatsa, Mayank

2016-01-01

In this work we propose a new deep learning tool called deep dictionary learning. Multi-level dictionaries are learnt in a greedy fashion, one layer at a time. This requires solving a simple (shallow) dictionary learning problem, the solution to this is well known. We apply the proposed technique on some benchmark deep learning datasets. We compare our results with other deep learning tools like stacked autoencoder and deep belief network; and state of the art supervised dictionary learning t...

Comparison of greedy algorithms for α-decision tree construction

KAUST Repository

Alkhalid, Abdulaziz; Chikalov, Igor; Moshkov, Mikhail

2011-01-01

A comparison among different heuristics that are used by greedy algorithms which constructs approximate decision trees (α-decision trees) is presented. The comparison is conducted using decision tables based on 24 data sets from UCI Machine Learning Repository [2]. Complexity of decision trees is estimated relative to several cost functions: depth, average depth, number of nodes, number of nonterminal nodes, and number of terminal nodes. Costs of trees built by greedy algorithms are compared with minimum costs calculated by an algorithm based on dynamic programming. The results of experiments assign to each cost function a set of potentially good heuristics that minimize it. © 2011 Springer-Verlag.

Comparison of Greedy Algorithms for Decision Tree Optimization

KAUST Repository

Alkhalid, Abdulaziz; Chikalov, Igor; Moshkov, Mikhail

2013-01-01

This chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values

Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing

OpenAIRE

Le, Minh; Fokkens, Antske

2017-01-01

Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforcement learning to greedy dependency parsing which is known to suffer from error propagation. Reinforcement learning improves accuracy of both labeled and unlabeled dependencies of the Stanford Neural Dependency Parser, a high performance greedy parser, while maintaining its eff...

Improving multivariate Horner schemes with Monte Carlo tree search

Science.gov (United States)

Kuipers, J.; Plaat, A.; Vermaseren, J. A. M.; van den Herik, H. J.

2013-11-01

Optimizing the cost of evaluating a polynomial is a classic problem in computer science. For polynomials in one variable, Horner's method provides a scheme for producing a computationally efficient form. For multivariate polynomials it is possible to generalize Horner's method, but this leaves freedom in the order of the variables. Traditionally, greedy schemes like most-occurring variable first are used. This simple textbook algorithm has given remarkably efficient results. Finding better algorithms has proved difficult. In trying to improve upon the greedy scheme we have implemented Monte Carlo tree search, a recent search method from the field of artificial intelligence. This results in better Horner schemes and reduces the cost of evaluating polynomials, sometimes by factors up to two.

Contemporary Greedy Institutions: An Essay on Lewis Coser’s Concept in Times of the ‘Hive Mind’

OpenAIRE

de Campo, Marianne Egger

2013-01-01

Lewis Coser perennially discussed various forms and facets of ‘greedy institutions’ with their total grasp on the individual. Coser’s ‘greedy institutions’ demand undivided time and loyalty from the individual who will voluntarily devote him/herself for exclusive benefits only granted to loyal followers. Although the ancient authorities have vanished—princes with their court Jews, masters with their servants, or religious and political missionaries— one can argue that the idea of the greedy i...

Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem

DEFF Research Database (Denmark)

Görtz, Simon; Klose, Andreas

2009-01-01

-charge transportation problem. Nevertheless, just a few methods for solving this problem have been proposed in the literature. In this paper, some greedy heuristic solutions methods for the SSFCTP are investigated. It is shown that two greedy approaches for the SSFCTP known from the literature can be arbitrarily bad......, whereas an approximation algorithm proposed in the literature for the binary min-knapsack problem has a guaranteed worst case bound if adapted accordingly to the case of the SSFCTP....

Treatment planning for prostate brachytherapy using region of interest adjoint functions and a greedy heuristic

International Nuclear Information System (INIS)

Yoo, Sua; Kowalok, Michael E; Thomadsen, Bruce R; Henderson, Douglass L

2003-01-01

We have developed an efficient treatment-planning algorithm for prostate implants that is based on region of interest (ROI) adjoint functions and a greedy heuristic. For this work, we define the adjoint function for an ROI as the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. This ratio is computed once for each seed position prior to the optimization process. Optimization is performed by a greedy heuristic that selects seed positions according to their ratio values. With this method, clinically acceptable treatment plans are obtained in less than 2 s. For comparison, a branch-and-bound method to solve a mixed integer-programming model took more than 50 min to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 1500. This attribute makes this algorithm suitable for intra-operative real-time treatment planning

Greedy Algorithms for Reduced Bases in Banach Spaces

KAUST Repository

DeVore, Ronald; Petrova, Guergana; Wojtaszczyk, Przemyslaw

2013-01-01

family of PDEs. The performance of this greedy algorithm was initially analyzed in Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) in the case X=H is a Hilbert space. The results of Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) were

An Accelerated Greedy Missing Point Estimation Procedure

DEFF Research Database (Denmark)

Zimmermann, Ralf; Willcox, Karen

2016-01-01

, without requiring solution of the modified eigenvalue problem. Based on theoretical insights into symmetric rank-one eigenvalue modifications, we derive a variation of the greedy method that is faster than the standard approach and yields better results for the cases studied. The proposed approach...... is illustrated by numerical experiments, where we observe a speed-up by two orders of magnitude when c Read More: http://epubs.siam.org/doi/abs/10.1137/15M1042899...

Application of a greedy algorithm to military aircraft fleet retirements

NARCIS (Netherlands)

Newcamp, J.M.; Verhagen, W.J.C.; Udluft, H.; Curran, Ricky

2017-01-01

This article presents a retirement analysis model for aircraft fleets. By employing a greedy algorithm, the presented solution is capable of identifying individually weak assets in a fleet of aircraft with inhomogeneous historical utilization. The model forecasts future retirement scenarios

Sensitivity analysis of a greedy heuristic for knapsack problems

NARCIS (Netherlands)

Ghosh, D; Chakravarti, N; Sierksma, G

2006-01-01

In this paper, we carry out parametric analysis as well as a tolerance limit based sensitivity analysis of a greedy heuristic for two knapsack problems-the 0-1 knapsack problem and the subset sum problem. We carry out the parametric analysis based on all problem parameters. In the tolerance limit

Reducing a congestion with introduce the greedy algorithm on traffic light control

Science.gov (United States)

Catur Siswipraptini, Puji; Hendro Martono, Wisnu; Hartanti, Dian

2018-03-01

The density of vehicles causes congestion seen at every junction in the city of jakarta due to the static or manual traffic timing lamp system consequently the length of the queue at the junction is uncertain. The research has been aimed at designing a sensor based traffic system based on the queue length detection of the vehicle to optimize the duration of the green light. In detecting the length of the queue of vehicles using infrared sensor assistance placed in each intersection path, then apply Greedy algorithm to help accelerate the movement of green light duration for the path that requires, while to apply the traffic lights regulation program based on greedy algorithm which is then stored on microcontroller with Arduino Mega 2560 type. Where a developed system implements the greedy algorithm with the help of the infrared sensor it will extend the duration of the green light on the long vehicle queue and accelerate the duration of the green light at the intersection that has the queue not too dense. Furthermore, the design is made to form an artificial form of the actual situation of the scale model or simple simulator (next we just called as scale model of simulator) of the intersection then tested. Sensors used are infrared sensors, where the placement of sensors in each intersection on the scale model is placed within 10 cm of each sensor and serves as a queue detector. From the results of the test process on the scale model with a longer queue obtained longer green light time so it will fix the problem of long queue of vehicles. Using greedy algorithms can add long green lights for 2 seconds on tracks that have long queues at least three sensor levels and accelerate time at other intersections that have longer queue sensor levels less than level three.

'Misclassification error' greedy heuristic to construct decision trees for inconsistent decision tables

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2014-01-01

A greedy algorithm has been presented in this paper to construct decision trees for three different approaches (many-valued decision, most common decision, and generalized decision) in order to handle the inconsistency of multiple decisions in a decision table. In this algorithm, a greedy heuristic ‘misclassification error’ is used which performs faster, and for some cost function, results are better than ‘number of boundary subtables’ heuristic in literature. Therefore, it can be used in the case of larger data sets and does not require huge amount of memory. Experimental results of depth, average depth and number of nodes of decision trees constructed by this algorithm are compared in the framework of each of the three approaches.

A note on the Greedy [beta-]transformation with arbitrary digits

NARCIS (Netherlands)

Dajani, K.; Kalle, C.C.C.J.

2011-01-01

We consider a generalization of the greedy and lazy [beta]expansions with digit set A = fa0

Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

Directory of Open Access Journals (Sweden)

Amber Israr

2016-04-01

Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

Suboptimal Partial Transmit Sequence-Active Interference Cancellation with Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Tarasak Poramate

2010-01-01

Full Text Available Active interference cancellation (AIC is an effective technique to provide interference avoidance feature for an ultrawideband (UWB OFDM transmitter. Partial transmit sequence-AIC (PTS-AIC, which was recently proposed as an improvement of AIC, requires high computational complexity by doing the exhaustive search of all possible weighting factors whose number grows exponentially with the number of subblocks used. To reduce the complexity of PTS-AIC, this paper proposes a suboptimal way, called particle swarm optimization (PSO, to choose the weighting factors suboptimally without much performance degradation. Both continuous and discrete versions of PSO have been evaluated, and it has been shown that the discrete PSO is able to reduce the complexity significantly without sacrificing the performance of PTS-AIC in many cases.

TH-CD-209-01: A Greedy Reassignment Algorithm for the PBS Minimum Monitor Unit Constraint

Energy Technology Data Exchange (ETDEWEB)

Lin, Y; Kooy, H; Craft, D; Depauw, N; Flanz, J; Clasie, B [Massachusetts General Hospital and Harvard Medical School, Boston, MA (United States)

2016-06-15

Purpose: To investigate a Greedy Reassignment algorithm in order to mitigate the effects of low weight spots in proton pencil beam scanning (PBS) treatment plans. Methods: To convert a plan from the treatment planning system’s (TPS) to a deliverable plan, post processing methods can be used to adjust the spot maps to meets the minimum MU constraint. Existing methods include: deleting low weight spots (Cut method), or rounding spots with weight above/below half the limit up/down to the limit/zero (Round method). An alternative method called Greedy Reassignment was developed in this work in which the lowest weight spot in the field was removed and its weight reassigned equally among its nearest neighbors. The process was repeated with the next lowest weight spot until all spots in the field were above the MU constraint. The algorithm performance was evaluated using plans collected from 190 patients (496 fields) treated at our facility. The evaluation criteria were the γ-index pass rate comparing the pre-processed and post-processed dose distributions. A planning metric was further developed to predict the impact of post-processing on treatment plans for various treatment planning, machine, and dose tolerance parameters. Results: For fields with a gamma pass rate of 90±1%, the metric has a standard deviation equal to 18% of the centroid value. This showed that the metric and γ-index pass rate are correlated for the Greedy Reassignment algorithm. Using a 3rd order polynomial fit to the data, the Greedy Reassignment method had 1.8 times better metric at 90% pass rate compared to other post-processing methods. Conclusion: We showed that the Greedy Reassignment method yields deliverable plans that are closest to the optimized-without-MU-constraint plan from the TPS. The metric developed in this work could help design the minimum MU threshold with the goal of keeping the γ-index pass rate above an acceptable value.

Causal gene identification using combinatorial V-structure search.

Science.gov (United States)

Cai, Ruichu; Zhang, Zhenjie; Hao, Zhifeng

2013-07-01

With the advances of biomedical techniques in the last decade, the costs of human genomic sequencing and genomic activity monitoring are coming down rapidly. To support the huge genome-based business in the near future, researchers are eager to find killer applications based on human genome information. Causal gene identification is one of the most promising applications, which may help the potential patients to estimate the risk of certain genetic diseases and locate the target gene for further genetic therapy. Unfortunately, existing pattern recognition techniques, such as Bayesian networks, cannot be directly applied to find the accurate causal relationship between genes and diseases. This is mainly due to the insufficient number of samples and the extremely high dimensionality of the gene space. In this paper, we present the first practical solution to causal gene identification, utilizing a new combinatorial formulation over V-Structures commonly used in conventional Bayesian networks, by exploring the combinations of significant V-Structures. We prove the NP-hardness of the combinatorial search problem under a general settings on the significance measure on the V-Structures, and present a greedy algorithm to find sub-optimal results. Extensive experiments show that our proposal is both scalable and effective, particularly with interesting findings on the causal genes over real human genome data. Copyright © 2013 Elsevier Ltd. All rights reserved.

Suboptimal choice, reward-predictive signals, and temporal information.

Science.gov (United States)

Cunningham, Paul J; Shahan, Timothy A

2018-01-01

Suboptimal choice refers to preference for an alternative offering a low probability of food (suboptimal alternative) over an alternative offering a higher probability of food (optimal alternative). Numerous studies have found that stimuli signaling probabilistic food play a critical role in the development and maintenance of suboptimal choice. However, there is still much debate about how to characterize how these stimuli influence suboptimal choice. There is substantial evidence that the temporal information conveyed by a food-predictive signal governs its function as both a Pavlovian conditioned stimulus and as an instrumental conditioned reinforcer. Thus, we explore the possibility that food-predictive signals influence suboptimal choice via the temporal information they convey. Application of this temporal information-theoretic approach to suboptimal choice provides a formal, quantitative framework that describes how food-predictive signals influence suboptimal choice in a manner consistent with related phenomena in Pavlovian conditioning and conditioned reinforcement. Our reanalysis of previous data on suboptimal choice suggests that, generally speaking, preference in the suboptimal choice procedure tracks relative temporal information conveyed by food-predictive signals for the suboptimal and optimal alternatives. The model suggests that suboptimal choice develops when the food-predictive signal for the suboptimal alternative conveys more temporal information than that for the optimal alternative. Finally, incorporating a role for competition between temporal information provided by food-predictive signals and relative primary reinforcement rate provides a reasonable account of existing data on suboptimal choice. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Resolving the paradox of suboptimal choice.

Science.gov (United States)

Zentall, Thomas R

2016-01-01

When humans engage in commercial (totally probabilistic) gambling they are making suboptimal choices because the return is generally less than the investment. This review (a) examines the literature on pigeon suboptimal choice, (b) describes the conditions under which it occurs, (c) identifies the mechanisms that appear to be responsible for the effect, and (d) suggests that similar processes may be able to account for analogous suboptimal choice when humans engage in commercial gambling. Pigeons show suboptimal choice when they choose between 1 alternative that 20% of the time provides them with a signal that they will always get fed or 80% of the time with a signal that they will not get fed (overall 20% reinforcement) and a second alternative that 100% of the time provides them with a signal that they will get fed 50% of the time (overall 50% reinforcement). The pigeons' strong preference for the suboptimal choice was investigated in a series of experiments that found the preference for the suboptimal alternative was determined by the value of the signal that predicted reinforcement, rather its frequency and that the frequency of the signal that predicted nonreinforcement had little effect on the suboptimal choice. Paradoxically, this account makes the prediction that pigeons will be indifferent between an alternative that 50% of the time provides a fully predictive stimulus for reinforcement and an alternative that 100% of the time provides a fully predictive stimulus for reinforcement. The similarities and differences of this suboptimal choice task to human gambling are discussed. (c) 2016 APA, all rights reserved).

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

Science.gov (United States)

Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

2010-01-01

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Detecting highly overlapping community structure by greedy clique expansion

OpenAIRE

Lee, Conrad; Reid, Fergal; McDaid, Aaron; Hurley, Neil

2010-01-01

In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure. Recent advances in benchmarking indicate that existing community assignment algorithms that are capable of detecting overlapping communities perform well only when the extent of community overlap is kept to modest levels. To overcome this limitation, we introduce a new community assignment algorithm called Greedy Clique Expansion (GCE). The algorithm identifies d...

Comparative Performance Analysis of G-RAKE Receivers with Suboptimal Finger Placement

Directory of Open Access Journals (Sweden)

K. B. Baltzis

2014-07-01

Full Text Available Generalized RAKE (G-RAKE reception reduces the total amount of interference and provides enhanced diversity by comprising extra fingers to collect information about interference and further using channel and impairment correlation estimates for fingers allocation. However, the hardware complexity and the excessive computational requirements of GRAKE receivers may restrict their application in real systems; thus, suboptimal solutions are commonly used. In this paper, we propose and evaluate three maximum likelihood G-RAKE structures for colored noise with suboptimal finger placement. In all implementations, the fingers are optimally distributed within a time window that spans from several chip periods before the first arriving multipath to several chip periods after the latest one. The first receiver has its fingers at integer multiples of the chip period while in the rest two structures the search window is segmented in halves and tenths of the chip duration. This work also extends earlier studies by thoroughly investigating the impact of fractionally spaced finger placement on system performance. Our analysis shows that a suboptimal finger allocation reduces hardware complexity with negligible performance loss. The impact of channel delay spread and processing gain on system performance is also investigated and gives interesting results.

A Greedy Approach for Placement of Subsurface Aquifer Wells in an Ensemble Filtering Framework

KAUST Repository

El Gharamti, Mohamad; Marzouk, Youssef M.; Huan, Xun; Hoteit, Ibrahim

2015-01-01

Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain.

A Greedy Approach for Placement of Subsurface Aquifer Wells in an Ensemble Filtering Framework

KAUST Repository

El Gharamti, Mohamad

2015-11-26

Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain.

Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing

NARCIS (Netherlands)

Le, M.N.; Fokkens, A.S.

Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforcement learning to greedy dependency parsing which is known to suffer from error

A Statistical Model for Uplink Intercell Interference with Power Adaptation and Greedy Scheduling

KAUST Repository

Tabassum, Hina

2012-10-03

This paper deals with the statistical modeling of uplink inter-cell interference (ICI) considering greedy scheduling with power adaptation based on channel conditions. The derived model is implicitly generalized for any kind of shadowing and fading environments. More precisely, we develop a generic model for the distribution of ICI based on the locations of the allocated users and their transmit powers. The derived model is utilized to evaluate important network performance metrics such as ergodic capacity, average fairness and average power preservation numerically. Monte-Carlo simulation details are included to support the analysis and show the accuracy of the derived expressions. In parallel to the literature, we show that greedy scheduling with power adaptation reduces the ICI, average power consumption of users, and enhances the average fairness among users, compared to the case without power adaptation. © 2012 IEEE.

A Statistical Model for Uplink Intercell Interference with Power Adaptation and Greedy Scheduling

KAUST Repository

Tabassum, Hina; Yilmaz, Ferkan; Dawy, Zaher; Alouini, Mohamed-Slim

2012-01-01

This paper deals with the statistical modeling of uplink inter-cell interference (ICI) considering greedy scheduling with power adaptation based on channel conditions. The derived model is implicitly generalized for any kind of shadowing and fading environments. More precisely, we develop a generic model for the distribution of ICI based on the locations of the allocated users and their transmit powers. The derived model is utilized to evaluate important network performance metrics such as ergodic capacity, average fairness and average power preservation numerically. Monte-Carlo simulation details are included to support the analysis and show the accuracy of the derived expressions. In parallel to the literature, we show that greedy scheduling with power adaptation reduces the ICI, average power consumption of users, and enhances the average fairness among users, compared to the case without power adaptation. © 2012 IEEE.

Evaluation of a Didactic Method for the Active Learning of Greedy Algorithms

Science.gov (United States)

Esteban-Sánchez, Natalia; Pizarro, Celeste; Velázquez-Iturbide, J. Ángel

2014-01-01

An evaluation of the educational effectiveness of a didactic method for the active learning of greedy algorithms is presented. The didactic method sets students structured-inquiry challenges to be addressed with a specific experimental method, supported by the interactive system GreedEx. This didactic method has been refined over several years of…

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Science.gov (United States)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

KAUST Repository

Azad, Mohammad; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2012-01-01

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions For a given

Comparing imagery in The Greedy Hippo and Crouching Tiger, Hidden Dragon

Directory of Open Access Journals (Sweden)

John R. Botha

2012-11-01

Full Text Available This article used as point of departure the Ngano song-story entitled The Greedy Hippo as developed by Christiaan van der Westhuizen and based on the Tambani embroidery project. This animated interpretation of The Greedy Hippo is used to further the aims of interdisciplinary research as stated by the original project by comparing its fantasy imagery with that of the Chinese film Crouching Tiger, Hidden Dragon by director Ang Lee. The analysis of the images in both works of art has been based on Jungian archetypes, with specific reference to the need for an esoteric and imaginative reading of fantasy in the chosen works of art. Reference was made to the dominant role of realism as style in Western art as opposed to the more esoteric, symbolic, and fantasy imagery of the art of other cultures, with emphasis on China. Chinese landscape painting and even poetry has been briefly contextualised with regards to the chosen works of art. Finally, the different characters of both works of art were analysed within the contexts of their symbolic meanings as based on Jungian archetypes, with particular reference to the scenes where the characters are depicted as flying through the air, which were explained within the contexts of Wu Xia martial arts style films.s.

Greedy algorithms for diffuse optical tomography reconstruction

Science.gov (United States)

Dileep, B. P. V.; Das, Tapan; Dutta, Pranab K.

2018-03-01

Diffuse optical tomography (DOT) is a noninvasive imaging modality that reconstructs the optical parameters of a highly scattering medium. However, the inverse problem of DOT is ill-posed and highly nonlinear due to the zig-zag propagation of photons that diffuses through the cross section of tissue. The conventional DOT imaging methods iteratively compute the solution of forward diffusion equation solver which makes the problem computationally expensive. Also, these methods fail when the geometry is complex. Recently, the theory of compressive sensing (CS) has received considerable attention because of its efficient use in biomedical imaging applications. The objective of this paper is to solve a given DOT inverse problem by using compressive sensing framework and various Greedy algorithms such as orthogonal matching pursuit (OMP), compressive sampling matching pursuit (CoSaMP), and stagewise orthogonal matching pursuit (StOMP), regularized orthogonal matching pursuit (ROMP) and simultaneous orthogonal matching pursuit (S-OMP) have been studied to reconstruct the change in the absorption parameter i.e, Δα from the boundary data. Also, the Greedy algorithms have been validated experimentally on a paraffin wax rectangular phantom through a well designed experimental set up. We also have studied the conventional DOT methods like least square method and truncated singular value decomposition (TSVD) for comparison. One of the main features of this work is the usage of less number of source-detector pairs, which can facilitate the use of DOT in routine applications of screening. The performance metrics such as mean square error (MSE), normalized mean square error (NMSE), structural similarity index (SSIM), and peak signal to noise ratio (PSNR) have been used to evaluate the performance of the algorithms mentioned in this paper. Extensive simulation results confirm that CS based DOT reconstruction outperforms the conventional DOT imaging methods in terms of

A PROCEDURE FOR DETERMINING OPTIMAL FACILITY LOCATION AND SUB-OPTIMAL POSITIONS

Directory of Open Access Journals (Sweden)

P.K. Dan

2012-01-01

Full Text Available

ENGLISH ABSTRACT: This research presents a methodology for determining the optimal location of a new facility, having physical flow interaction of various degrees with other existing facilities in the presence of barriers impeding the shortest flow-path as well as the sub-optimal iso-cost positions. It also determines sub-optimal iso-cost positions with additional cost or penalty for not being able to site it at the computed optimal point. The proposed methodology considers all types of quadrilateral barrier or forbidden region configurations to generalize and by-pass such impenetrable obstacles, and adopts a scheme of searching through the vertices of the quadrilaterals to determine the alternative shortest flow-path. This procedure of obstacle avoidance is novel. Software has been developed to facilitate computations for the search algorithm to determine the optimal and iso-cost co-ordinates. The test results are presented.

AFRIKAANSE OPSOMMING: Die navorsing behandel ‘n procedure vir die bepaling van optimum stigtingsposisie vir ‘n onderneming met vloei vanaf ander bestaande fasiliteite in die teenwoordigheid van ‘n verskeidenheid van randvoorwaardes. Die prodedure lewer as resultaat suboptimale isokoste-stigtingsplekke met bekendmaking van die koste wat onstaan a.g.v. afwyking van die randvoorwaardlose optimum oplossingskoste, die prosedure maak gebruik van ‘n vindingryke soekmetode wat toegepas word op niersydige meerkundige voorstellings vir die bepaling van korste roetes wat versperring omseil. Die prosedure word onderskei deur programmatuur. Toetsresultate word voorgehou.

Greedy and metaheuristics for the offline scheduling problem in grid computing

DEFF Research Database (Denmark)

Gamst, Mette

In grid computing a number of geographically distributed resources connected through a wide area network, are utilized as one computations unit. The NP-hard offline scheduling problem in grid computing consists of assigning jobs to resources in advance. In this paper, five greedy heuristics and two....... All heuristics solve instances with up to 2000 jobs and 1000 resources, thus the results are useful both with respect to running times and to solution values....

BILGO: Bilateral greedy optimization for large scale semidefinite programming

KAUST Repository

Hao, Zhifeng; Yuan, Ganzhao; Ghanem, Bernard

2013-01-01

Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.

BILGO: Bilateral greedy optimization for large scale semidefinite programming

KAUST Repository

Hao, Zhifeng

2013-10-03

Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.

AHP 47: THE GREEDY KING AND TRICKY MAN

Directory of Open Access Journals (Sweden)

Lcags so lhun 'grub ལྕགས་སོ་ལྷུན་འགྲུབ། (Klu sgrub ཀླུ་སྒྲུབ།

2017-04-01

Full Text Available Rgya mo skyid (b. 1992 of Mdo ba Town, Reb gong (Thun rin, Tongren County, Rma lho (Huangnan Tibetan Autonomous Prefecture, Mtsho sngon (Qinghai Province, China told me this story in an apartment in Xi'an City, Shaanxi Province on 21 August, 2016. She said, "When I was about five years old, my grandfather (Kun bzang, b. 1939 told me many stories such as this before we went to bed every night. I forgot many stories, but this story is still very clear." There was once a greedy local king who collected taxes monthly. There was also a very poor man known as Tricky Tsag thul. The local king came to Tricky's home to punish him for not paying his taxes for several months. ...

Greedy heuristics for minimization of number of terminal nodes in decision trees

KAUST Repository

Hussain, Shahid

2014-10-01

This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

Greedy heuristics for minimization of number of terminal nodes in decision trees

KAUST Repository

Hussain, Shahid

2014-01-01

This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

Comparison of Greedy Algorithms for Decision Tree Optimization

KAUST Repository

Alkhalid, Abdulaziz

2013-01-01

This chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values of average depth, depth, number of nodes, number of terminal nodes, and number of nonterminal nodes of decision trees. We compare average depth, depth, number of nodes, number of terminal nodes and number of nonterminal nodes of constructed trees with minimum values of the considered parameters obtained based on a dynamic programming approach. We report experiments performed on data sets from UCI ML Repository and randomly generated binary decision tables. As a result, for depth, average depth, and number of nodes we propose a number of good heuristics. © Springer-Verlag Berlin Heidelberg 2013.

On local optima in learning bayesian networks

DEFF Research Database (Denmark)

Dalgaard, Jens; Kocka, Tomas; Pena, Jose

2003-01-01

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness...... is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported...

A Suboptimal PTS Algorithm Based on Particle Swarm Optimization Technique for PAPR Reduction in OFDM Systems

Directory of Open Access Journals (Sweden)

Ho-Lung Hung

2008-08-01

Full Text Available A suboptimal partial transmit sequence (PTS based on particle swarm optimization (PSO algorithm is presented for the low computation complexity and the reduction of the peak-to-average power ratio (PAPR of an orthogonal frequency division multiplexing (OFDM system. In general, PTS technique can improve the PAPR statistics of an OFDM system. However, it will come with an exhaustive search over all combinations of allowed phase weighting factors and the search complexity increasing exponentially with the number of subblocks. In this paper, we work around potentially computational intractability; the proposed PSO scheme exploits heuristics to search the optimal combination of phase factors with low complexity. Simulation results show that the new technique can effectively reduce the computation complexity and PAPR reduction.

A Suboptimal PTS Algorithm Based on Particle Swarm Optimization Technique for PAPR Reduction in OFDM Systems

Directory of Open Access Journals (Sweden)

Lee Shu-Hong

2008-01-01

Full Text Available Abstract A suboptimal partial transmit sequence (PTS based on particle swarm optimization (PSO algorithm is presented for the low computation complexity and the reduction of the peak-to-average power ratio (PAPR of an orthogonal frequency division multiplexing (OFDM system. In general, PTS technique can improve the PAPR statistics of an OFDM system. However, it will come with an exhaustive search over all combinations of allowed phase weighting factors and the search complexity increasing exponentially with the number of subblocks. In this paper, we work around potentially computational intractability; the proposed PSO scheme exploits heuristics to search the optimal combination of phase factors with low complexity. Simulation results show that the new technique can effectively reduce the computation complexity and PAPR reduction.

Design considerations for a suboptimal Kalman filter

Science.gov (United States)

Difilippo, D. J.

1995-06-01

In designing a suboptimal Kalman filter, the designer must decide how to simplify the system error model without causing the filter estimation errors to increase to unacceptable levels. Deletion of certain error states and decoupling of error state dynamics are the two principal model simplifications that are commonly used in suboptimal filter design. For the most part, the decisions as to which error states can be deleted or decoupled are based on the designer's understanding of the physics of the particular system. Consequently, the details of a suboptimal design are usually unique to the specific application. In this paper, the process of designing a suboptimal Kalman filter is illustrated for the case of an airborne transfer-of-alignment (TOA) system used for synthetic aperture radar (SAR) motion compensation. In this application, the filter must continuously transfer the alignment of an onboard Doppler-damped master inertial navigation system (INS) to a strapdown navigator that processes information from a less accurate inertial measurement unit (IMU) mounted on the radar antenna. The IMU is used to measure spurious antenna motion during the SAR imaging interval, so that compensating phase corrections can be computed and applied to the radar returns, thereby presenting image degradation that would otherwise result from such motions. The principles of SAR are described in many references, for instance. The primary function of the TOA Kalman filter in a SAR motion compensation system is to control strapdown navigator attitude errors, and to a less degree, velocity and heading errors. Unlike a classical navigation application, absolute positional accuracy is not important. The motion compensation requirements for SAR imaging are discussed in some detail. This TOA application is particularly appropriate as a vehicle for discussing suboptimal filter design, because the system contains features that can be exploited to allow both deletion and decoupling of error

Suboptimal palliative sedation in primary care: an exploration.

Science.gov (United States)

Pype, Peter; Teuwen, Inge; Mertens, Fien; Sercu, Marij; De Sutter, An

2018-02-01

Palliative sedation is a therapeutic option to control refractory symptoms in terminal palliative patients. This study aims at describing the occurrence and characteristics of suboptimal palliative sedations in primary care and at exploring the way general practitioners (GPs) experience suboptimal palliative sedation in their practice. We conducted a mixed methods study with a quantitative prospective survey in primary care and qualitative semi-structured interviews with GPs. The research team defined suboptimal palliative sedation as a time interval until deep sleep >1.5 h and/ or >2 awakenings after the start of the unconsciousness. Descriptive statistics were calculated on the quantitative data. Thematic analysis was used to analyse interview transcripts. We registered 63 palliative sedations in 1181 home deaths, 27 forms were completed. Eleven palliative sedations were suboptimal: eight due to the long time span until deep sleep; three due the number of unintended awakenings. GPs' interview analysis revealed two major themes: the shifting perception of failure and the burden of responsibility. Suboptimal palliative sedation occurs frequently in primary palliative care. Efficient communication towards family members is needed to prevent them from having unrealistic expectations and to prevent putting pressure on the GP to hasten the procedure. Sharing the burden of decision-making during the procedure with other health care professionals might diminish the heavy responsibility as perceived by GPs.

How suboptimal are linear sharing rules?

DEFF Research Database (Denmark)

Jensen, Bjarne Astrup; Nielsen, Jørgen Aase

2016-01-01

that significant losses can arise when investors are diverse in their risk attitude. We also show that an investor with a low degree of risk aversion, like the logarithmic or the square root investor, often applied in portfolio choice models, can either inflict or be subject to severe losses when being forced...... two sources of suboptimal investment decisions as seen from each of the two investors individually. One is the suboptimal choice of portfolio, the other is the forced linear sharing rule. We measure the combined consequence for each investor by their respective loss in wealth equivalent. We show...

On the Origins of Suboptimality in Human Probabilistic Inference

Science.gov (United States)

Acerbi, Luigi; Vijayakumar, Sethu; Wolpert, Daniel M.

2014-01-01

Humans have been shown to combine noisy sensory information with previous experience (priors), in qualitative and sometimes quantitative agreement with the statistically-optimal predictions of Bayesian integration. However, when the prior distribution becomes more complex than a simple Gaussian, such as skewed or bimodal, training takes much longer and performance appears suboptimal. It is unclear whether such suboptimality arises from an imprecise internal representation of the complex prior, or from additional constraints in performing probabilistic computations on complex distributions, even when accurately represented. Here we probe the sources of suboptimality in probabilistic inference using a novel estimation task in which subjects are exposed to an explicitly provided distribution, thereby removing the need to remember the prior. Subjects had to estimate the location of a target given a noisy cue and a visual representation of the prior probability density over locations, which changed on each trial. Different classes of priors were examined (Gaussian, unimodal, bimodal). Subjects' performance was in qualitative agreement with the predictions of Bayesian Decision Theory although generally suboptimal. The degree of suboptimality was modulated by statistical features of the priors but was largely independent of the class of the prior and level of noise in the cue, suggesting that suboptimality in dealing with complex statistical features, such as bimodality, may be due to a problem of acquiring the priors rather than computing with them. We performed a factorial model comparison across a large set of Bayesian observer models to identify additional sources of noise and suboptimality. Our analysis rejects several models of stochastic behavior, including probability matching and sample-averaging strategies. Instead we show that subjects' response variability was mainly driven by a combination of a noisy estimation of the parameters of the priors, and by

On the origins of suboptimality in human probabilistic inference.

Directory of Open Access Journals (Sweden)

Luigi Acerbi

2014-06-01

Full Text Available Humans have been shown to combine noisy sensory information with previous experience (priors, in qualitative and sometimes quantitative agreement with the statistically-optimal predictions of Bayesian integration. However, when the prior distribution becomes more complex than a simple Gaussian, such as skewed or bimodal, training takes much longer and performance appears suboptimal. It is unclear whether such suboptimality arises from an imprecise internal representation of the complex prior, or from additional constraints in performing probabilistic computations on complex distributions, even when accurately represented. Here we probe the sources of suboptimality in probabilistic inference using a novel estimation task in which subjects are exposed to an explicitly provided distribution, thereby removing the need to remember the prior. Subjects had to estimate the location of a target given a noisy cue and a visual representation of the prior probability density over locations, which changed on each trial. Different classes of priors were examined (Gaussian, unimodal, bimodal. Subjects' performance was in qualitative agreement with the predictions of Bayesian Decision Theory although generally suboptimal. The degree of suboptimality was modulated by statistical features of the priors but was largely independent of the class of the prior and level of noise in the cue, suggesting that suboptimality in dealing with complex statistical features, such as bimodality, may be due to a problem of acquiring the priors rather than computing with them. We performed a factorial model comparison across a large set of Bayesian observer models to identify additional sources of noise and suboptimality. Our analysis rejects several models of stochastic behavior, including probability matching and sample-averaging strategies. Instead we show that subjects' response variability was mainly driven by a combination of a noisy estimation of the parameters of the

Design of ACM system based on non-greedy punctured LDPC codes

Science.gov (United States)

Lu, Zijun; Jiang, Zihong; Zhou, Lin; He, Yucheng

2017-08-01

In this paper, an adaptive coded modulation (ACM) scheme based on rate-compatible LDPC (RC-LDPC) codes was designed. The RC-LDPC codes were constructed by a non-greedy puncturing method which showed good performance in high code rate region. Moreover, the incremental redundancy scheme of LDPC-based ACM system over AWGN channel was proposed. By this scheme, code rates vary from 2/3 to 5/6 and the complication of the ACM system is lowered. Simulations show that more and more obvious coding gain can be obtained by the proposed ACM system with higher throughput.

Optimization of wind farm micro-siting for complex terrain using greedy algorithm

International Nuclear Information System (INIS)

Song, M.X.; Chen, K.; He, Z.Y.; Zhang, X.

2014-01-01

An optimization approach based on greedy algorithm for optimization of wind farm micro-siting is presented. The key of optimizing wind farm micro-siting is the fast and accurate evaluation of the wake flow interactions of wind turbines. The virtual particle model is employed for wake flow simulation of wind turbines, which makes the present method applicable for non-uniform flow fields on complex terrains. In previous bionic optimization method, within each step of the optimization process, only the power output of the turbine that is being located or relocated is considered. To aim at the overall power output of the wind farm comprehensively, a dependent region technique is introduced to improve the estimation of power output during the optimization procedure. With the technique, the wake flow influences can be reduced more efficiently during the optimization procedure. During the optimization process, the turbine that is being added will avoid being affected other turbines, and avoid affecting other turbine in the meantime. The results from the numerical calculations demonstrate that the present method is effective for wind farm micro-siting on complex terrain, and it produces better solutions in less time than the previous bionic method. - Highlights: • Greedy algorithm is applied to wind farm micro-siting problem. • The present method is effective for optimization on complex terrains. • Dependent region is suggested to improve the evaluation of wake influences. • The present method has better performance than the bionic method

A simple greedy algorithm for dynamic graph orientation

DEFF Research Database (Denmark)

Berglin, Edvin; Brodal, Gerth Stølting

2017-01-01

Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure....... With an immensely simple greedy algorithm, we get parametrized trade-off bounds between out-degree and worst case number of flips, which previously only existed for amortized number of flips. We match the previous best worst-case algorithm (in O(log n) flips) for general arboricity and beat it for either constant...... or super-logarithmic arboricity. We also match a previous best amortized result for at least logarithmic arboricity, and give the first results with worst-case O(1) and O(sqrt(log n)) flips nearly matching degree bounds to their respective amortized solutions....

Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

KAUST Repository

Azad, Mohammad

2012-12-14

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions For a given row, we should find a decision from the set attached to this row We consider bounds on the precision of this algorithm relative to the cardinality of tests.

Multiobjective Variable Neighborhood Search algorithm for scheduling independent jobs on computational grid

Directory of Open Access Journals (Sweden)

S. Selvi

2015-07-01

Full Text Available Grid computing solves high performance and high-throughput computing problems through sharing resources ranging from personal computers to super computers distributed around the world. As the grid environments facilitate distributed computation, the scheduling of grid jobs has become an important issue. In this paper, an investigation on implementing Multiobjective Variable Neighborhood Search (MVNS algorithm for scheduling independent jobs on computational grid is carried out. The performance of the proposed algorithm has been evaluated with Min–Min algorithm, Simulated Annealing (SA and Greedy Randomized Adaptive Search Procedure (GRASP algorithm. Simulation results show that MVNS algorithm generally performs better than other metaheuristics methods.

A greedy double swap heuristic for nurse scheduling

Directory of Open Access Journals (Sweden)

Murphy Choy

2012-10-01

Full Text Available One of the key challenges of nurse scheduling problem (NSP is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.

Starvation dynamics of a greedy forager

Science.gov (United States)

Bhat, U.; Redner, S.; Bénichou, O.

2017-07-01

We investigate the dynamics of a greedy forager that moves by random walking in an environment where each site initially contains one unit of food. Upon encountering a food-containing site, the forager eats all the food there and can subsequently hop an additional S steps without food before starving to death. Upon encountering an empty site, the forager goes hungry and comes one time unit closer to starvation. We investigate the new feature of forager greed; if the forager has a choice between hopping to an empty site or to a food-containing site in its nearest neighborhood, it hops preferentially towards food. If the neighboring sites all contain food or are all empty, the forager hops equiprobably to one of these neighbors. Paradoxically, the lifetime of the forager can depend non-monotonically on greed, and the sense of the non-monotonicity is opposite in one and two dimensions. Even more unexpectedly, the forager lifetime in one dimension is substantially enhanced when the greed is negative; here the forager tends to avoid food in its local neighborhood. We also determine the average amount of food consumed at the instant when the forager starves. We present analytic, heuristic, and numerical results to elucidate these intriguing phenomena.

Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

Science.gov (United States)

Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho

2017-10-01

This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

Ultimate explanations and suboptimal choice.

Science.gov (United States)

Vasconcelos, Marco; Machado, Armando; Pandeirada, Josefa N S

2018-07-01

Researchers have unraveled multiple cases in which behavior deviates from rationality principles. We propose that such deviations are valuable tools to understand the adaptive significance of the underpinning mechanisms. To illustrate, we discuss in detail an experimental protocol in which animals systematically incur substantial foraging losses by preferring a lean but informative option over a rich but non-informative one. To understand how adaptive mechanisms may fail to maximize food intake, we review a model inspired by optimal foraging principles that reconciles sub-optimal choice with the view that current behavioral mechanisms were pruned by the optimizing action of natural selection. To move beyond retrospective speculation, we then review critical tests of the model, regarding both its assumptions and its (sometimes counterintuitive) predictions, all of which have been upheld. The overall contention is that (a) known mechanisms can be used to develop better ultimate accounts and that (b) to understand why mechanisms that generate suboptimal behavior evolved, we need to consider their adaptive value in the animal's characteristic ecology. Copyright © 2018 Elsevier B.V. All rights reserved.

Suboptimal control for drag reduction in turbulent pipe flow

International Nuclear Information System (INIS)

Choi, Jung Il; Sung, Hyung Jin; Xu, Chun Xiao

2001-01-01

A suboptimal control law in turbulent pipe flow is derived and tested. Two sensing variables ∂ρ/∂θ / w and ∂ν θ /∂r / w are applied with two actuations φ θ and φ γ . To test the suboptimal control law, direct numerical simulations of turbulent pipe flow at Re τ =150 are performed. When the control law is applied, a 13∼23% drag reduction is achieved. The most effective drag reduction is made at the pair of ∂υ θ /∂r / w and φ γ . An impenetrable virtual wall concept is useful for analyzing the near-wall suction and blowing. The virtual wall concept is useful for analyzing the near-wall behavior of the controlled flow. Comparison of the present suboptimal control with that of turbulent channel flow reveals that the curvature effect is insignificant

Suboptimal maternal and paternal mental health are associated with child bullying perpetration.

Science.gov (United States)

Shetgiri, Rashmi; Lin, Hua; Flores, Glenn

2015-06-01

This study examines associations between maternal and paternal mental health and child bullying perpetration among school-age children, and whether having one or both parents with suboptimal mental health is associated with bullying. The 2007 National Survey of Children's Health, a nationally-representative, random-digit-dial survey, was analyzed, using a parent-reported bullying measure. Suboptimal mental health was defined as fair/poor (vs. good/very good/excellent) parental self-reported mental and emotional health. Of the 61,613 parents surveyed, more than half were parents of boys and were white, 20% were Latino, 15% African American, and 7% other race/ethnicity. Suboptimal maternal (OR 1.4; 95% CI 1.1-1.8) and paternal (OR 1.5; 95% CI 1.1-2.2) mental health are associated with bullying. Compared with children with no parents with suboptimal mental health, children with only one or both parents with suboptimal mental health have higher bullying odds. Addressing the mental health of both parents may prove beneficial in preventing bullying.

Common experiences of patients following suboptimal treatment outcomes: implications for epilepsy surgery.

Science.gov (United States)

Fernando, Dinusha K; McIntosh, Anne M; Bladin, Peter F; Wilson, Sarah J

2014-04-01

Few studies have investigated the patient experience of unsuccessful medical interventions, particularly in the epilepsy surgery field. The present review aimed to gain insight into the patient experience of seizure recurrence after epilepsy surgery by examining the broader literature dealing with suboptimal results after medical interventions (including epilepsy surgery). To capture the patient experience, the literature search focused on qualitative research of patients who had undergone medically unsuccessful interventions, published in English in scholarly journals. Twenty-two studies were found of patients experiencing a range of suboptimal outcomes, including seizure recurrence, cancer recurrence and progression, unsuccessful joint replacement, unsuccessful infertility treatment, organ transplant rejection, coronary bypass graft surgery, and unsuccessful weight-loss surgery. In order of frequency, the most common patient experiences included the following: altered social dynamics and stigma, unmet expectations, negative emotions, use of coping strategies, hope and optimism, perceived failure of the treating team, psychiatric symptoms, and control issues. There is support in the epilepsy surgery literature that unmet expectations and psychiatric symptoms are key issues for patients with seizure recurrence, while other common patient experiences have been implied but not systematically examined. Several epilepsy surgery specific factors influence patient perceptions of seizure recurrence, including the nature of postoperative seizures, the presence of postoperative complications, and the need for increased postoperative medications. Knowledge of common patient experiences can assist in the delivery of patient follow-up and rehabilitation services tailored to differing outcomes after epilepsy surgery. Copyright © 2014 Elsevier Inc. All rights reserved.

GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

Energy Technology Data Exchange (ETDEWEB)

Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

2008-07-01

Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)

Consumer behaviour towards price-reduced suboptimal foods in the supermarket and the relation to food waste in households.

Science.gov (United States)

Aschemann-Witzel, Jessica; Jensen, Jacob Haagen; Jensen, Mette Hyldetoft; Kulikovskaja, Viktorija

2017-09-01

To combat food waste, supermarkets offer food items at a reduced price in-store when they are close to the expiration date or perceived as suboptimal. It is yet unknown, however, which considerations consumers engage in when deciding about the offer, and whether focusing particularly on the price during food purchase might be related to greater food waste at home. Knowledge about both the consumers' food purchase process for these price-reduced foods and the potential wastage of price-focused consumers can contribute to the assessment of whether or not offering suboptimal food at reduced prices in-store actually reduces food waste across the supply chain. We explore these questions in a mixed-method study including 16 qualitative accompanied shopping interviews and a quantitative online experimental survey with 848 consumers in Denmark. The interviews reveal that the consumers interviewed assess their ability to consume the price-reduced suboptimal food at home already while in the store. Consumers consider the relation between product-related factors of package unit, expiration date, and product quality, in interaction with household-related factors of freezing/storing, household size/demand, and possible meal/cooking. The survey shows that consumers who are more price-focused report lower food waste levels and lower tendency to choose the optimal food item first at home, than those who are not emphasizing the price-quality relation or do not search for price offers to the same extent. Higher age and high education also played a role, and the price-focus is lower in high-income groups and among single households. The findings allow deriving recommendations for retailers and policy makers to support both the marketability and the subsequent actual consumption of price-reduced suboptimal food, but they also raise questions for further research of this underexplored area. Copyright © 2017 Elsevier Ltd. All rights reserved.

Suboptimal performance on neuropsychological tests in patients with suspected chronic toxic encephalopathy

NARCIS (Netherlands)

van Hout, Moniek S. E.; Schmand, Ben; Wekking, Ellie M.; Hageman, Gerard; Deelman, Betto G.

2003-01-01

Suboptimal performance during neuropsychological testing can seriously complicate assessment in behavioral neurotoxicology. We present data on the prevalence of suboptimal performance in a group of Dutch patients with suspected chronic toxic encephalopathy (CTE) after long-term occupational exposure

Suboptimal performance on neuropsychological tests in patients with suspected chronic toxic encephalopathy

NARCIS (Netherlands)

van Hout, MSE; Schmand, B; Wekking, EM; Hageman, G; Deelman, BG

Suboptimal performance during neuropsychological testing can seriously complicate assessment in behavioral neurotoxicology. We present data on the prevalence of suboptimal performance in a group of Dutch patients with suspected chronic toxic encephalopathy (CTE) after long-term occupational exposure

A Particle Swarm Optimization-Based Approach with Local Search for Predicting Protein Folding.

Science.gov (United States)

Yang, Cheng-Hong; Lin, Yu-Shiun; Chuang, Li-Yeh; Chang, Hsueh-Wei

2017-10-01

The hydrophobic-polar (HP) model is commonly used for predicting protein folding structures and hydrophobic interactions. This study developed a particle swarm optimization (PSO)-based algorithm combined with local search algorithms; specifically, the high exploration PSO (HEPSO) algorithm (which can execute global search processes) was combined with three local search algorithms (hill-climbing algorithm, greedy algorithm, and Tabu table), yielding the proposed HE-L-PSO algorithm. By using 20 known protein structures, we evaluated the performance of the HE-L-PSO algorithm in predicting protein folding in the HP model. The proposed HE-L-PSO algorithm exhibited favorable performance in predicting both short and long amino acid sequences with high reproducibility and stability, compared with seven reported algorithms. The HE-L-PSO algorithm yielded optimal solutions for all predicted protein folding structures. All HE-L-PSO-predicted protein folding structures possessed a hydrophobic core that is similar to normal protein folding.

Frequency and predictors of suboptimal glycemic control in an African diabetic population

Directory of Open Access Journals (Sweden)

Kibirige D

2017-02-01

Full Text Available Davis Kibirige,1 George Patrick Akabwai,2 Leaticia Kampiire,3 Daniel Ssekikubo Kiggundu,4 William Lumu5 1Department of Medicine/Diabetic and Hypertension Clinics, Our Lady of Consolota Hospital, Kisubi, 2Baylor College of Medicine, Children’s Foundation, 3Infectious Diseases Research Collaboration, Kampala, 4Nephrology Unit, Mulago National Referral and Teaching Hospital, Kampala, 5Department of Medicine and Diabetes/Endocrine Unit, Mengo Hospital, Mengo, Uganda Background: Persistent suboptimal glycemic control is invariably associated with onset and progression of acute and chronic diabetic complications in diabetic patients. In Uganda, studies documenting the magnitude and predictors of suboptimal glycemic control in adult ambulatory diabetic patients are limited. This study aimed at determining the frequency and predictors of suboptimal glycemic control in adult diabetic patients attending three urban outpatient diabetic clinics in Uganda. Methods: In this hospital-based cross-sectional study, eligible ambulatory adult diabetic patients attending outpatient diabetic clinics of three urban hospitals were consecutively enrolled over 11 months. Suboptimal glycemic control was defined as glycated hemoglobin (HbA1c level ≥7%. Multivariable analysis was applied to determine the predictors. Results: The mean age of the study participants was 52.2±14.4 years, and the majority of them were females (283, 66.9%. The median (interquartile range HbA1c level was 9% (6.8%–12.4%. Suboptimal glycemic control was noted in 311 study participants, accounting for 73.52% of the participants. HbA1c levels of 7%–8%, 8.1%–9.9%, and ≥10% were noted in 56 (13.24%, 76 (17.97%, and 179 (42.32% study participants, respectively. The documented predictors of suboptimal glycemic control were metformin monotherapy (odds ratio: 0.36, 95% confidence interval: 0.21–0.63, p<0.005 and insulin therapy (odds ratio: 2.41, 95% confidence interval: 1.41–4.12, p=0

Optimal Quantum Spatial Search on Random Temporal Networks

Science.gov (United States)

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.

Optimal Quantum Spatial Search on Random Temporal Networks.

Science.gov (United States)

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(sqrt[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.

Adaptive Greedy Dictionary Selection for Web Media Summarization.

Science.gov (United States)

Cong, Yang; Liu, Ji; Sun, Gan; You, Quanzeng; Li, Yuncheng; Luo, Jiebo

2017-01-01

Initializing an effective dictionary is an indispensable step for sparse representation. In this paper, we focus on the dictionary selection problem with the objective to select a compact subset of basis from original training data instead of learning a new dictionary matrix as dictionary learning models do. We first design a new dictionary selection model via l 2,0 norm. For model optimization, we propose two methods: one is the standard forward-backward greedy algorithm, which is not suitable for large-scale problems; the other is based on the gradient cues at each forward iteration and speeds up the process dramatically. In comparison with the state-of-the-art dictionary selection models, our model is not only more effective and efficient, but also can control the sparsity. To evaluate the performance of our new model, we select two practical web media summarization problems: 1) we build a new data set consisting of around 500 users, 3000 albums, and 1 million images, and achieve effective assisted albuming based on our model and 2) by formulating the video summarization problem as a dictionary selection issue, we employ our model to extract keyframes from a video sequence in a more flexible way. Generally, our model outperforms the state-of-the-art methods in both these two tasks.

Prevalence and Determinants of Suboptimal Vitamin D Levels in a Multiethnic Asian Population.

Science.gov (United States)

Man, Ryan Eyn Kidd; Li, Ling-Jun; Cheng, Ching-Yu; Wong, Tien Yin; Lamoureux, Ecosse; Sabanayagam, Charumathi

2017-03-22

This population-based cross-sectional study examined the prevalence and risk factors of suboptimal vitamin D levels (assessed using circulating 25-hydroxycholecalciferol (25(OH)D)) in a multi-ethnic sample of Asian adults. Plasma 25(OH)D concentration of 1139 Chinese, Malay and Indians (40-80 years) were stratified into normal (≥30 ng/mL), and suboptimal (including insufficiency and deficiency, 65 years), Malay and Indian ethnicities (compared to Chinese ethnicity), and higher body mass index, HbA1c, education and income levels were associated with suboptimal 25(OH)D concentration ( p < 0.05). In a population-based sample of Asian adults, approximately 75% had suboptimal 25(OH)D concentration. Targeted interventions and stricter reinforcements of existing guidelines for vitamin D supplementation are needed for groups at risk of vitamin D insufficiency/deficiency.

Tabu search approaches for the multi-level warehouse layout problem with adjacency constraints

Science.gov (United States)

Zhang, G. Q.; Lai, K. K.

2010-08-01

A new multi-level warehouse layout problem, the multi-level warehouse layout problem with adjacency constraints (MLWLPAC), is investigated. The same item type is required to be located in adjacent cells, and horizontal and vertical unit travel costs are product dependent. An integer programming model is proposed to formulate the problem, which is NP hard. Along with a cube-per-order index policy based heuristic, the standard tabu search (TS), greedy TS, and dynamic neighbourhood based TS are presented to solve the problem. The computational results show that the proposed approaches can reduce the transportation cost significantly.

Action-Dependent Photobiomodulation on Health, Suboptimal Health, and Disease

Directory of Open Access Journals (Sweden)

Timon Cheng-Yi Liu

2014-01-01

Full Text Available The global photobiomodulation (PBM on an organism was studied in terms of function-specific homeostasis (FSH and scale-free functional network in this paper. A function can be classified into a normal function in its FSH and a dysfunctional function far from its FSH. An FSH-specific stress (FSS disrupting an FSH can also be classified into a successful stress in its FSS-specific homeostasis (FSSH and a chronic stress far from its FSSH. The internal functions of an organism can be divided into essential, special nonessential, and general nonessential functions. Health may be defined as a state of an organism in which all the essential and special nonessential functions are normal or their stresses are successful. Suboptimal health may be defined as a state of a disease-free organism in which only some special nonessential functions are dysfunctional in comparison with its healthy state. Disease may be defined as a state of an organism which is not in both health and suboptimal health. The global PBM of health, suboptimal health, or disease suggested that the PBM may depend on the organism action.

A Greedy Algorithm for Neighborhood Overlap-Based Community Detection

Directory of Open Access Journals (Sweden)

Natarajan Meghanathan

2016-01-01

Full Text Available The neighborhood overlap (NOVER of an edge u-v is defined as the ratio of the number of nodes who are neighbors for both u and v to that of the number of nodes who are neighbors of at least u or v. In this paper, we hypothesize that an edge u-v with a lower NOVER score bridges two or more sets of vertices, with very few edges (other than u-v connecting vertices from one set to another set. Accordingly, we propose a greedy algorithm of iteratively removing the edges of a network in the increasing order of their neighborhood overlap and calculating the modularity score of the resulting network component(s after the removal of each edge. The network component(s that have the largest cumulative modularity score are identified as the different communities of the network. We evaluate the performance of the proposed NOVER-based community detection algorithm on nine real-world network graphs and compare the performance against the multi-level aggregation-based Louvain algorithm, as well as the original and time-efficient versions of the edge betweenness-based Girvan-Newman (GN community detection algorithm.

Exogenous recombinant human growth hormone effects during suboptimal energy and zinc intake

Directory of Open Access Journals (Sweden)

Duro Debora

2005-04-01

Full Text Available Abstract Background Energy and Zinc (Zn deficiencies have been associated with nutritional related growth retardation as well as growth hormone (GH resistance. In this study, the relationship between suboptimal energy and/or Zn intake and growth in rats and their response to immunoreactive exogenous recombinant human GH (GHi, was determined. Results Rats treated with GHi and fed ad-libitum energy and Zn (100/100 had increased IGFBP-3 (p Conclusion These results suggest that GHi enhances weight gain in rats with suboptimal energy and Zn intake but does not modify energy expenditure or physical activity index. Suboptimal Zn intake did not exacerbate the reduced growth or decrease in energy expenditure observed with energy restriction.

Tag-Based Social Image Search: Toward Relevant and Diverse Results

Science.gov (United States)

Yang, Kuiyuan; Wang, Meng; Hua, Xian-Sheng; Zhang, Hong-Jiang

Recent years have witnessed a great success of social media websites. Tag-based image search is an important approach to access the image content of interest on these websites. However, the existing ranking methods for tag-based image search frequently return results that are irrelevant or lack of diversity. This chapter presents a diverse relevance ranking scheme which simultaneously takes relevance and diversity into account by exploring the content of images and their associated tags. First, it estimates the relevance scores of images with respect to the query term based on both visual information of images and semantic information of associated tags. Then semantic similarities of social images are estimated based on their tags. Based on the relevance scores and the similarities, the ranking list is generated by a greedy ordering algorithm which optimizes Average Diverse Precision (ADP), a novel measure that is extended from the conventional Average Precision (AP). Comprehensive experiments and user studies demonstrate the effectiveness of the approach.

Sacral Nerve Stimulation for Constipation: Suboptimal Outcome and Adverse Events

DEFF Research Database (Denmark)

Maeda, Yasuko; Lundby, Lilli; Buntzen, Steen

2010-01-01

Sacral nerve stimulation is an emerging treatment for patients with severe constipation. There has been no substantial report to date on suboptimal outcomes and complications. We report our experience of more than 6 years by focusing on incidents and the management of reportable events.......Sacral nerve stimulation is an emerging treatment for patients with severe constipation. There has been no substantial report to date on suboptimal outcomes and complications. We report our experience of more than 6 years by focusing on incidents and the management of reportable events....

Heuristic Optimization for the Discrete Virtual Power Plant Dispatch Problem

DEFF Research Database (Denmark)

Petersen, Mette Kirschmeyer; Hansen, Lars Henrik; Bendtsen, Jan Dimon

2014-01-01

We consider a Virtual Power Plant, which is given the task of dispatching a fluctuating power supply to a portfolio of flexible consumers. The flexible consumers are modeled as discrete batch processes, and the associated optimization problem is denoted the Discrete Virtual Power Plant Dispatch...... Problem. First NP-completeness of the Discrete Virtual Power Plant Dispatch Problem is proved formally. We then proceed to develop tailored versions of the meta-heuristic algorithms Hill Climber and Greedy Randomized Adaptive Search Procedure (GRASP). The algorithms are tuned and tested on portfolios...... of varying sizes. We find that all the tailored algorithms perform satisfactorily in the sense that they are able to find sub-optimal, but usable, solutions to very large problems (on the order of 10 5 units) at computation times on the scale of just 10 seconds, which is far beyond the capabilities...

Gibberellin Is Involved in Inhibition of Cucumber Growth and Nitrogen Uptake at Suboptimal Root-Zone Temperatures.

Directory of Open Access Journals (Sweden)

Longqiang Bai

Full Text Available Suboptimal temperature stress often causes heavy yield losses of vegetables by suppressing plant growth during winter and early spring. Gibberellin acid (GA has been reported to be involved in plant growth and acquisition of mineral nutrients. However, no studies have evaluated the role of GA in the regulation of growth and nutrient acquisition by vegetables under conditions of suboptimal temperatures in greenhouse. Here, we investigated the roles of GA in the regulation of growth and nitrate acquisition of cucumber (Cucumis sativus L. plants under conditions of short-term suboptimal root-zone temperatures (Tr. Exposure of cucumber seedlings to a Tr of 16°C led to a significant reduction in root growth, and this inhibitory effect was reversed by exogenous application of GA. Expression patterns of several genes encoding key enzymes in GA metabolism were altered by suboptimal Tr treatment, and endogenous GA concentrations in cucumber roots were significantly reduced by exposure of cucumber plants to 16°C Tr, suggesting that inhibition of root growth by suboptimal Tr may result from disruption of endogenous GA homeostasis. To further explore the mechanism underlying the GA-dependent cucumber growth under suboptimal Tr, we studied the effect of suboptimal Tr and GA on nitrate uptake, and found that exposure of cucumber seedlings to 16°C Tr led to a significant reduction in nitrate uptake rate, and exogenous application GA can alleviate the down-regulation by up regulating the expression of genes associated with nitrate uptake. Finally, we demonstrated that N accumulation in cucumber seedlings under suboptimal Tr conditions was improved by exogenous application of GA due probably to both enhanced root growth and nitrate absorption activity. These results indicate that a reduction in endogenous GA concentrations in roots due to down-regulation of GA biosynthesis at transcriptional level may be a key event to underpin the suboptimal Tr

Sub-optimal birth weight in newborns of a high socioeconomic status population

Directory of Open Access Journals (Sweden)

Conceição Aparecida de Mattos Segre

2008-09-01

Full Text Available Objective: To compare sub-optimal birth weight (2,500 to 2,999 g term newborns to appropriate for gestational age (birth weight ≥ 3,000 g term newborns, regarding maternal data and newborn morbidity and mortality. Methods: Single term newborns, appropriate for gestational age from a high socioeconomic population (n = 1,242 with birth weight ranging from 2,500 to 2,999 g (Group I were compared to 4,907 newborns with birth weight ≥ than 3,000 g (Group II. Maternal and newborn characteristics were compared between the groups. The Mann-Whitney test, χ2 test and multivariate analysis were used. The significance level adopted was p < 0.05. Rresults: The frequency of sub-optimal birth weight newborns in the population studied was 20.2%. There was a significant association between sub-optimal birth weight and maternal weight before pregnancy and body mass index, maternal weight gain, height, smoking habit and hypertension. Newborns’ 1-minute Apgar score, neonatal hypoglycemia, jaundice, transient tachypnea, congenital pneumonia and hospital stay were significantly different between the groups (p < 0.05. A significant relationship could not be established with the 5-minute Apgar score and pulmonary hypertension in both groups. Neonatal mortality did not differ between the groups. Cconclusions: Socioeconomic status was not a risk factor for sub-optimal birth weight in the studied population. Genetic and environmental factors were associated to sub-optimal weight and neonatal diseases. According to these data, this group of newborns should receive special attention from the health team.

Nomogram for suboptimal cytoreduction at primary surgery for advanced stage ovarian cancer.

Science.gov (United States)

Gerestein, Cornelis G; Eijkemans, Marinus J; Bakker, Jeanette; Elgersma, Otto E; van der Burg, Maria E L; Kooi, Geertruida S; Burger, Curt W

2011-11-01

Maximal cytoreduction to minimal residual tumor is the most important determinant of prognosis in patients with advanced stage epithelial ovarian cancer (EOC). Preoperative prediction of suboptimal cytoreduction, defined as residual tumor >1 cm, could guide treatment decisions and improve counseling. The objective of this study was to identify predictive computed tomographic (CT) scan and clinical parameters for suboptimal cytoreduction at primary cytoreductive surgery for advanced stage EOC and to generate a nomogram with the identified parameters, which would be easy to use in daily clinical practice. Between October 2005 and December 2008, all patients with primary surgery for suspected advanced stage EOC at six participating teaching hospitals in the South Western part of the Netherlands entered the study protocol. To investigate independent predictors of suboptimal cytoreduction, a Cox proportional hazard model with backward stepwise elimination was utilized. One hundred and fifteen patients with FIGO stage III/IV EOC entered the study protocol. Optimal cytoreduction was achieved in 52 (45%) patients. A suboptimal cytoreduction was predicted by preoperative blood platelet count (p=0.1990; odds ratio (OR)=1.002), diffuse peritoneal thickening (DPT) (p=0.0074; OR=3.021), and presence of ascites on at least two thirds of CT scan slices (p=0.0385; OR=2.294) with a for-optimism corrected c-statistic of 0.67. Suboptimal cytoreduction was predicted by preoperative platelet count, DPT and presence of ascites. The generated nomogram can, after external validation, be used to estimate surgical outcome and to identify those patients, who might benefit from alternative treatment approaches.

Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions

KAUST Repository

Azad, Mohammad

2016-10-20

The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To illustrate proposed approach we study a problem of recognition of labels of points in the plain. This paper contains also results of experiments with modified decision tables from UCI Machine Learning Repository.

Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail; Zielosko, Beata

2016-01-01

The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To illustrate proposed approach we study a problem of recognition of labels of points in the plain. This paper contains also results of experiments with modified decision tables from UCI Machine Learning Repository.

PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem.

Science.gov (United States)

Schmidhuber, Jürgen

2013-01-01

Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. Given a general problem-solving architecture, at any given time, the novel algorithmic framework PowerPlay (Schmidhuber, 2011) searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Newly invented tasks may require to achieve a wow-effect by making previously learned skills more efficient such that they require less time and space. New skills may (partially) re-use previously learned skills. The greedy search of typical PowerPlay variants uses time-optimal program search to order candidate pairs of tasks and solver modifications by their conditional computational (time and space) complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. This biases the search toward pairs that can be described compactly and validated quickly. The computational costs of validating new tasks need not grow with task repertoire size. Standard problem solver architectures of personal computers or neural networks tend to generalize by solving numerous tasks outside the self-invented training set; PowerPlay's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Gödel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing

Ship Block Transportation Scheduling Problem Based on Greedy Algorithm

Directory of Open Access Journals (Sweden)

Chong Wang

2016-05-01

Full Text Available Ship block transportation problems are crucial issues to address in reducing the construction cost and improving the productivity of shipyards. Shipyards aim to maximize the workload balance of transporters with time constraint such that all blocks should be transported during the planning horizon. This process leads to three types of penalty time: empty transporter travel time, delay time, and tardy time. This study aims to minimize the sum of the penalty time. First, this study presents the problem of ship block transportation with the generalization of the block transportation restriction on the multi-type transporter. Second, the problem is transformed into the classical traveling salesman problem and assignment problem through a reasonable model simplification and by adding a virtual node to the proposed directed graph. Then, a heuristic algorithm based on greedy algorithm is proposed to assign blocks to available transporters and sequencing blocks for each transporter simultaneously. Finally, the numerical experiment method is used to validate the model, and its result shows that the proposed algorithm is effective in realizing the efficient use of the transporters in shipyards. Numerical simulation results demonstrate the promising application of the proposed method to efficiently improve the utilization of transporters and to reduce the cost of ship block logistics for shipyards.

Suboptimal investments and M&A deals in emerging capital markets

Directory of Open Access Journals (Sweden)

Cherkasova Victoria

2016-01-01

Full Text Available This paper focuses on the efficiency of target-company investment decisions before and after Merger & Acquisition deals. We study whether M&A deals help to solve the problem of suboptimal investment after the acquisition. Using a sample of 145 target companies from BRICS countries that were acquired during the period 2004-2014, we outline those that had over- or underinvested before the deal and show that more than half the companies managed to optimize the investment level after the deal. We determine the key factors that improve the inefficiency of investment decisions and demonstrate that the industry and country have an impact on the degree of suboptimal investment.

Suboptimal treatment adherence in bipolar disorder: impact on clinical outcomes and functioning

Directory of Open Access Journals (Sweden)

Montes JM

2013-01-01

Full Text Available Jose Manuel Montes1, Jorge Maurino2, Consuelo de Dios3, Esteban Medina21Department of Psychiatry, Hospital Universitario del Sureste, 2AstraZeneca Medical Department, 3Department of Psychiatry, Hospital Universitario La Paz, Madrid, SpainBackground: The primary aim of this study was to assess drug treatment adherence in patients with bipolar disorder and to identify factors associated with adherence. The secondary aim was to analyze the impact of suboptimal adherence on clinical and functional outcomes.Methods: A cross-sectional study was conducted in a sample of outpatients receiving an oral antipsychotic drug. Medication adherence was assessed combining the 10-item Drug Attitude Inventory, the Morisky Green Adherence Questionnaire, and the Compliance Rating Scale. Logistic regression was used to determine significant variables associated with suboptimal adherence to medication.Results: Three hundred and three patients were enrolled into the study. The mean age was 45.9 ± 12.8 years, and 59.7% were females. Sixty-nine percent of patients showed suboptimal adherence. Disease severity and functioning were significantly worse in the suboptimal group than in the adherent group. Multivariate analysis showed depressive polarity of the last acute episode, presence of subsyndromal symptoms, and substance abuse/dependence to be significantly associated with suboptimal treatment adherence (odds ratios 3.41, 2.13, and 1.95, respectively.Conclusion: A high prevalence of nonadherence was found in an outpatient sample with bipolar disorder. Identification of factors related to treatment adherence would give clinicians the opportunity to select more adequately patients who are eligible for potential adherence-focused interventions.Keywords: bipolar disorder, treatment adherence, functioning, polarity, subsyndromal symptoms

Suboptimal care and maternal mortality among foreign-born women in Sweden

DEFF Research Database (Denmark)

Esscher, Annika; Binder-Finnema, Pauline; Bødker, Birgit

2014-01-01

that occurred in Sweden from 1988-2010. METHODS: A subset of maternal death records (n = 75) among foreign-born women from low- and middle-income countries and Swedish-born women were audited using structured implicit review. One case of foreign-born maternal death was matched with two native born Swedish cases...... language and suboptimal interpreter system or usage. Inadequate care occurred more often among the foreign-born (p = 0.04), whereas delays in consultation/referral and miscommunication between health care providers where equally common between the two groups. CONCLUSIONS: Suboptimal care factors, major...

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Directory of Open Access Journals (Sweden)

Dongshuang Li

2018-05-01

Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

Visually suboptimal bananas: How ripeness affects consumer expectation and perception.

Science.gov (United States)

Symmank, Claudia; Zahn, Susann; Rohm, Harald

2018-01-01

One reason for the significant amount of food that is wasted in developed countries is that consumers often expect visually suboptimal food as being less palatable. Using bananas as example, the objective of this study was to determine how appearance affects consumer overall liking, the rating of sensory attributes, purchase intention, and the intended use of bananas. The ripeness degree (RD) of the samples was adjusted to RD 5 (control) and RD 7 (more ripened, visually suboptimal). After preliminary experiments, a total of 233 participants were asked to judge their satisfaction with the intensity of sensory attributes that referred to flavor, taste, and texture using just-about-right scales. Subjects who received peeled samples were asked after tasting, whereas subjects who received unpeeled bananas judged expectation and, after peeling and tasting, perception. Expected overall liking and purchase intention were significantly lower for RD 7 bananas. Purchase intention was still significantly different between RD 5 and RD 7 after tasting, whereas no difference in overall liking was observed. Significant differences between RD 5 and RD 7 were observed when asking participants for their intended use of the bananas. Concerning the sensory attributes, penalty analysis revealed that only the firmness of the RD 7 bananas was still not just-about-right after tasting. The importance that consumers attribute to the shelf-life of food had a pronounced impact on purchase intention of bananas with different ripeness degree. In the case of suboptimal bananas, the results demonstrate a positive relationship between the sensory perception and overall liking and purchase intention. Convincing consumers that visually suboptimal food is still tasty is of high relevance for recommending different ways of communication. Copyright © 2017 Elsevier Ltd. All rights reserved.

Prediction based Greedy Perimeter Stateless Routing Protocol for Vehicular Self-organizing Network

Science.gov (United States)

Wang, Chunlin; Fan, Quanrun; Chen, Xiaolin; Xu, Wanjin

2018-03-01

PGPSR (Prediction based Greedy Perimeter Stateless Routing) is based on and extended the GPSR protocol to adapt to the high speed mobility of the vehicle auto organization network (VANET) and the changes in the network topology. GPSR is used in the VANET network environment, the network loss rate and throughput are not ideal, even cannot work. Aiming at the problems of the GPSR, the proposed PGPSR routing protocol, it redefines the hello and query packet structure, in the structure of the new node speed and direction information, which received the next update before you can take advantage of its speed and direction to predict the position of node and new network topology, select the right the next hop routing and path. Secondly, the update of the outdated node information of the neighbor’s table is deleted in time. The simulation experiment shows the performance of PGPSR is better than that of GPSR.

Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data

Directory of Open Access Journals (Sweden)

Arpita Nagpal

2017-01-01

Full Text Available Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension of data sets further helps in improving the computational efficiency of the learning model. In this paper, we propose a modified algorithm based on the tabu search as local search procedures to a Greedy Randomized Adaptive Search Procedure (GRASP for high dimensional microarray data sets. The proposed Tabu based Greedy Randomized Adaptive Search Procedure algorithm is named as TGRASP. In TGRASP, a new parameter has been introduced named as Tabu Tenure and the existing parameters, NumIter and size have been modified. We observed that different parameter settings affect the quality of the optimum. The second proposed algorithm known as FFGRASP (Firefly Greedy Randomized Adaptive Search Procedure uses a firefly optimization algorithm in the local search optimzation phase of the greedy randomized adaptive search procedure (GRASP. Firefly algorithm is one of the powerful algorithms for optimization of multimodal applications. Experimental results show that the proposed TGRASP and FFGRASP algorithms are much better than existing algorithm with respect to three performance parameters viz. accuracy, run time, number of a selected subset of features. We have also compared both the approaches with a unified metric (Extended Adjusted Ratio of Ratios which has shown that TGRASP approach outperforms existing approach for six out of nine cancer microarray datasets and FFGRASP performs better on seven out of nine datasets.

Optimization of approximate decision rules relative to number of misclassifications: Comparison of greedy and dynamic programming approaches

KAUST Repository

Amin, Talha

2013-01-01

In the paper, we present a comparison of dynamic programming and greedy approaches for construction and optimization of approximate decision rules relative to the number of misclassifications. We use an uncertainty measure that is a difference between the number of rows in a decision table T and the number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules that localize rows in subtables of T with uncertainty at most γ. Experimental results with decision tables from the UCI Machine Learning Repository are also presented. © 2013 Springer-Verlag.

Inverse problems for ODEs using contraction maps and suboptimality of the 'collage method'

Science.gov (United States)

Kunze, H. E.; Hicken, J. E.; Vrscay, E. R.

2004-06-01

Broad classes of inverse problems in differential and integral equations can be cast in the following framework: the optimal approximation of a target x of a suitable metric space X by the fixed point \\bar x of a contraction map T on X. The 'collage method' attempts to solve such inverse problems by finding an operator Tc that maps the target x as close as possible to itself. In the case of ODEs, the appropriate contraction maps are integral Picard operators. In practice, the target solutions possibly arise from an interpolation of experimental data points. In this paper, we investigate the suboptimality of the collage method. A simple inequality that provides upper bounds on the improvement over collage coding is presented and some examples are studied. We conclude that, at worst, the collage method provides an excellent starting point for further optimization, in contrast to more traditional searching methods that must first select a good starting point.

Hungry pigeons make suboptimal choices, less hungry pigeons do not.

Science.gov (United States)

Laude, Jennifer R; Pattison, Kristina F; Zentall, Thomas R

2012-10-01

Hungry animals will often choose suboptimally by being attracted to reliable signals for food that occur infrequently (they gamble) over less reliable signals for food that occur more often. That is, pigeons prefer an option that 50 % of the time provides them with a reliable signal for the appearance of food but 50 % of the time provides them with a reliable signal for the absence of food (overall 50 % reinforcement) over an alternative that always provides them with a signal for the appearance of food 75 % of the time (overall 75 % reinforcement). The pigeons appear to choose impulsively for the possibility of obtaining the reliable signal for reinforcement. There is evidence that greater hunger is associated with greater impulsivity. We tested the hypothesis that if the pigeons were less hungry, they would be less impulsive and, thus, would choose more optimally (i.e., on the basis of the overall probability of reinforcement). We found that hungry pigeons choose the 50 % reinforcement alternative suboptimally but less hungry pigeons prefer the more optimal 75 % reinforcement. Paradoxically, pigeons that needed the food more received less of it. These findings have implications for how level of motivation may also affect human suboptimal choice (e.g., purchase of lottery tickets and playing slot machines).

Performance improvement of multi-class detection using greedy algorithm for Viola-Jones cascade selection

Science.gov (United States)

Tereshin, Alexander A.; Usilin, Sergey A.; Arlazarov, Vladimir V.

2018-04-01

This paper aims to study the problem of multi-class object detection in video stream with Viola-Jones cascades. An adaptive algorithm for selecting Viola-Jones cascade based on greedy choice strategy in solution of the N-armed bandit problem is proposed. The efficiency of the algorithm on the problem of detection and recognition of the bank card logos in the video stream is shown. The proposed algorithm can be effectively used in documents localization and identification, recognition of road scene elements, localization and tracking of the lengthy objects , and for solving other problems of rigid object detection in a heterogeneous data flows. The computational efficiency of the algorithm makes it possible to use it both on personal computers and on mobile devices based on processors with low power consumption.

Sub-optimal breastfeeding and its associated factors in rural ...

African Journals Online (AJOL)

Similarly, not attending formal education, low birth order and lack of knowledge about exclusive breastfeeding were also negatively associated with exclusive breastfeeding practice. Conclusion: In this study, sub-optimal breast feeding was found to be high. Delayed initiation and non-exclusive breastfeeding practices were ...

Reducing suboptimal employee decisions can build the business case for employee benefits.

Science.gov (United States)

Goldsmith, Christopher; Cyboran, Steven F

2013-01-01

Suboptimal employee decisions are prevalent in employee benefit plans. Poor decisions have significant consequences for employees and employers. Improving participant decisions produces beneficial outcomes such as lower labor costs, higher productivity and better workforce management. The business case for employee benefits can be strengthened by applying lessons learned from the field of behavioral economics to employee benefit plan design and to workforce communication. This article explains the types of behavioral biases that influence suboptimal decisions and explores how enlightened employee benefit plan choice architecture and vivid behavioral messaging contribute to human and better organizational outcomes.

Learning Type Extension Trees for Metal Bonding State Prediction

DEFF Research Database (Denmark)

Frasconi, Paolo; Jaeger, Manfred; Passerini, Andrea

2008-01-01

Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain and a discr......Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain...

Two-agent cooperative search using game models with endurance-time constraints

Science.gov (United States)

Sujit, P. B.; Ghose, Debasish

2010-07-01

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Suboptimality of Sales Promotions and Improvement Through Channel Coordination

NARCIS (Netherlands)

B. Wierenga (Berend); H. Soethoudt (Han)

2002-01-01

textabstractThis paper deals with sales promotions in the form of consumer price discounts in fast-moving consumer goods. First, we show analytically that suboptimality is to be expected with respect to the size of the consumer price discount. This is due to the separate decision making of the

The fate of suboptimal anastomosis after colon resection: An experimental study.

Science.gov (United States)

Yıldız, Mehmet Kamil; Okan, İsmail; Nazik, Hasan; Bas, Gurhan; Alimoglu, Orhan; İlktac, Mehmet; Daldal, Emin; Sahin, Mustafa; Kuvat, Nuray; Ongen, Betugul

2014-11-01

The fate of suboptimal anastomosis is unknown and early detection of anastomotic leakage after colon resection is crucial for the proper management of patients. Twenty-six rats were assigned to "Control", "Leakage" and "Suboptimal anastomosis" groups where they underwent either sham laparotomy, cecal ligation, and puncture or anastomosis with four sutures following colon resection, respectively. At the fifth hour and on the third and ninth days; peripheral blood and peritoneal washing samples through relaparotomy were obtained. The abdomen was inspected macroscopically for anastomotic healing. Polymerase chain reaction (PCR) with 16s rRNA and E.coli-specific primers were run on all samples along with aerobic and anaerobic cultures. The sensitivity and specificity of PCR on different bodily fluids with 16s rRNA and E.coli-specific primers were 100% and 78%, respectively. All samples of peritoneal washing fluids on the third and ninth days showed presence of bacteria in both PCR and culture. The inspection of the abdomen revealed signs of anastomotic leakage in eight rats (80%), whereas mortality related with anastomosis was detected in two (20%). Anastomotic leakage with suboptimal anastomosis after colon resection is high and the early detection is possible by running PCR on peritoneal samples as early as 72 hours.

NEWordS A News Search Engine for English Vocabulary Learning

Directory of Open Access Journals (Sweden)

Xuejing Huang

2015-08-01

Full Text Available Vocabulary is the first hurdle for English learners to over- come. Instead of simply showing a word again and again we come up with an idea to develop an English news article search engine based on users word-reciting record on Shanbay.com. It is designed for advanced English learners to find suitable reading materials. The search engine consists of Crawling Module Document Normalizing module Indexing Module Querying Module and Interface Module. We propose three sorting amp ranking algorithms for Querying Module. For the basic algorithm five crucial principles are taken into consideration. Term frequency inverse document frequency familiarity degree and article freshness degree are factors in this algorithm. Then we think of a improved algorithm for the scene in which a user read multiple articles in the searching result list. Here we adopt a iterative amp greedy method. The essential idea is to select English news articles one by one according to the query meanwhile dynamically update the unfamiliarity of the words during each iterative step. Moreover we develop an advanced algorithm to take article difficulty in to account. Interface Module is designed as a website meanwhile some data visualization technologies e.g. word cloud are applied here. Furthermore we conduct both applicability check and performance evaluation. Metrics such as searching time word-covering ratio and minimum number of articles that completely cover all the queried vocabulary are randomly sampled and profoundly analyzed. The result shows that our search engine works very well with satisfying performance.

Reoperation for suboptimal outcomes after deep brain stimulation surgery.

Science.gov (United States)

Ellis, Tina-Marie; Foote, Kelly D; Fernandez, Hubert H; Sudhyadhom, Atchar; Rodriguez, Ramon L; Zeilman, Pamela; Jacobson, Charles E; Okun, Michael S

2008-10-01

To examine a case series of reoperations for deep brain stimulation (DBS) leads in which clinical scenarios revealed suboptimal outcome from a previous operation. Suboptimally placed DBS leads are one potential reason for unsatisfactory results after surgery for Parkinson's disease (PD), essential tremor (ET), or dystonia. In a previous study of patients who experienced suboptimal results, 19 of 41 patients had misplaced leads. Similarly, another report commented that lead placement beyond a 2- to 3-mm window resulted in inadequate clinical benefit, and, in 1 patient, revision improved outcome. The goal of the current study was to perform an unblinded retrospective chart review of DBS patients with unsatisfactory outcomes who presented for reoperation. Patients who had DBS lead replacements after reoperation were assessed with the use of a retrospective review of an institutional review board-approved movement disorders database. Cases of reoperation for suboptimal clinical benefit were included, and cases of replacement of DBS leads caused by infection or hardware malfunction were excluded. Data points studied included age, disease duration, diagnosis, motor outcomes (the Unified Parkinson Disease Rating Scale III in PD, the Tremor Rating Scale in ET, and the Unified Dystonia Rating Scale in dystonia), quality of life (Parkinson's Disease Questionnaire-39 in PD), and the Clinician Global Impression scale. The data from before and after reoperation were examined to determine the estimated impact of repeat surgery. There were 11 patients with PD, 7 with ET, and 4 with dystonia. The average age of the PD group was 52 years, the disease duration was 10 years, and the average vector distance of the location of the active DBS contact was adjusted 5.5 mm. Six patients (54%) with PD had preoperative off medication on DBS Unified Parkinson Disease Rating Scale scores that could be compared with postoperative off medication on DBS scores. The average improvement across this

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Science.gov (United States)

2014-01-01

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Directory of Open Access Journals (Sweden)

Shih-Wei Lin

2014-01-01

Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network

International Nuclear Information System (INIS)

Janssens, Jochen; Talarico, Luca; Sörensen, Kenneth

2016-01-01

We propose a decision model aimed at increasing security in a utility network (e.g., electricity, gas, water or communication network). The network is modelled as a graph, the edges of which are unreliable. We assume that all edges (e.g., pipes, cables) have a certain, not necessarily equal, probability of failure, which can be reduced by selecting edge-specific security strategies. We develop a mathematical programming model and a metaheuristic approach that uses a greedy random adaptive search procedure to find an initial solution and uses tabu search hybridised with iterated local search and a variable neighbourhood descend heuristic to improve this solution. The main goal is to reduce the risk of service failure between an origin and a destination node by selecting the right combination of security measures for each network edge given a limited security budget. - Highlights: • A decision model aimed at increasing security in a utility network is proposed. • The goal is to reduce the risk of service failure given a limited security budget. • An exact approach and a variable neighbourhood tabu search heuristic are developed. • A generator for realistic networks is built and used to test the solution methods. • The hybridised heuristic reduces the total risk on average with 32%.

A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

KAUST Repository

Azad, Mohammad

2013-11-25

In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.

A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

KAUST Repository

Azad, Mohammad; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2013-01-01

In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.

Indicators of suboptimal performance embedded in the Wechsler Memory Scale-Fourth Edition (WMS-IV)

OpenAIRE

Bouman, Zita; Hendriks, Marc PH; Schmand, Ben A; Kessels, Roy PC; Aldenkamp, Albert

2016-01-01

Introduction. Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the identification of suboptimal performance using an analogue study design. Method. The patient group consisted of 59 mixed-etiology patients; the experimental malingerers were 50 healthy individuals...

Indicators of suboptimal performance embedded in the Wechsler Memory Scale-Fourth Edition (WMS-IV)

OpenAIRE

Bouman, Zita; Hendriks, Marc P.H.; Schmand, Ben A.; Kessels, Roy P.C.; Aldenkamp, Albert P.

2016-01-01

Introduction. Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the identification of suboptimal performance using an analogue study design.Method. The patient group consisted of 59 mixed-etiology patients; the experimental malingerers were 50 healthy individuals who ...

A non-destructive selection method for faster growth at suboptimal temperature in common bean (Phaseolus vulgaris)

NARCIS (Netherlands)

Drijfhout, E.; Oeveren, J.C. van; Jansen, R.C.

1991-01-01

A non-destructive method has been developed to select common bean (Phaseolus vulgaris L.) plants whose growth is less effected at a suboptimal temperature. Shoot weight was determined at a suboptimal (14°C) and optimal temperature (20°C), 38 days after sowing and accessions identified with a

A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph

Directory of Open Access Journals (Sweden)

F. Liberatore

2016-01-01

Full Text Available In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use. The Multicriteria Police Districting Problem (MC-PDP on a graph concerns the definition of sound patrolling sectors in a police district. The objective of this problem is to partition a graph into convex and continuous subsets, while ensuring efficiency and workload balance among the subsets. The model was originally formulated in collaboration with the Spanish National Police Corps. We propose for its solution three local search algorithms: a Simple Hill Climbing, a Steepest Descent Hill Climbing, and a Tabu Search. To improve their diversification capabilities, all the algorithms implement a multistart procedure, initialized by randomized greedy solutions. The algorithms are empirically tested on a case study on the Central District of Madrid. Our experiments show that the solutions identified by the novel Tabu Search outperform the other algorithms. Finally, research guidelines for future developments on the MC-PDP are given.

Information search with situation-specific reward functions

Directory of Open Access Journals (Sweden)

Bjorn Meder

2012-03-01

Full Text Available can strongly conflict with the goal of obtaining information for improving payoffs. Two environments with such a conflict were identified through computer optimization. Three subsequent experiments investigated people's search behavior in these environments. Experiments 1 and 2 used a multiple-cue probabilistic category-learning task to convey environmental probabilities. In a subsequent search task subjects could query only a single feature before making a classification decision. The crucial manipulation concerned the search-task reward structure. The payoffs corresponded either to accuracy, with equal rewards associated with the two categories, or to an asymmetric payoff function, with different rewards associated with each category. In Experiment 1, in which learning-task feedback corresponded to the true category, people later preferentially searched the accuracy-maximizing feature, whether or not this would improve monetary rewards. In Experiment 2, an asymmetric reward structure was used during learning. Subjects searched the reward-maximizing feature when asymmetric payoffs were preserved in the search task. However, if search-task payoffs corresponded to accuracy, subjects preferentially searched a feature that was suboptimal for reward and accuracy alike. Importantly, this feature would have been most useful, under the learning-task payoff structure. Experiment 3 found that, if words and numbers are used to convey environmental probabilities, neither reward nor accuracy consistently predicts search. These findings emphasize the necessity of taking into account people's goals and search-and-decision processes during learning, thereby challenging current models of information search.

Suboptimal bonding impairs hormonal, epigenetic and neuronal development in preterm infants, but these impairments can be reversed

NARCIS (Netherlands)

Kommers, D.R.; Oei, S.G.; Chen, W.; Feijs, L.M.G.; Bambang Oetomo, S.

This review aimed to raise awareness of the consequences of suboptimal bonding caused by prematurity. In addition to hypoxia–ischaemia, infection and malnutrition, suboptimal bonding is one of the many unnatural stimuli that preterm infants are exposed to, compromising their physiological

Statin therapy reduces the likelihood of suboptimal blood pressure control among Ugandan adult diabetic patients

Directory of Open Access Journals (Sweden)

Lumu W

2017-02-01

Full Text Available William Lumu,1 Leaticia Kampiire,2 George Patrick Akabwai,3 Daniel Ssekikubo Kiggundu,4 Davis Kibirige5 1Department of Medicine and Diabetes/Endocrine Unit, Mengo Hospital, 2Infectious Disease Research Collaboration, 3Baylor College of Medicine Children’s Foundation, 4Nephrology Unit, Mulago National Referral and Teaching Hospital, 5Department of Medicine, Uganda Martyrs Hospital Lubaga, Kampala, Uganda Background: Hypertension is one of the recognized risk factors of cardiovascular diseases in adult diabetic patients. High prevalence of suboptimal blood pressure (BP control has been well documented in the majority of studies assessing BP control in diabetic patients in sub-Saharan Africa. In Uganda, there is a dearth of similar studies. This study evaluated the prevalence and correlates of suboptimal BP control in an adult diabetic population in Uganda.Patients and methods: This was a cross-sectional study that enrolled 425 eligible ambulatory adult diabetic patients attending three urban diabetic outpatient clinics over 11 months. Data about their sociodemographic characteristics and clinical history were collected using pre-tested questionnaires. Suboptimal BP control was defined according to the 2015 American Diabetes Association standards of diabetes care guideline as BP levels ≥140/90 mmHg.Results: The mean age of the study participants was 52.2±14.4 years, with the majority being females (283, 66.9%. Suboptimal BP control was documented in 192 (45.3% study participants and was independently associated with the study site (private hospitals; odds ratio 2.01, 95% confidence interval 1.18–3.43, P=0.01 and use of statin therapy (odds ratio 0.5, 95% confidence interval 0.26–0.96, P=0.037.Conclusion: Suboptimal BP control was highly prevalent in this study population. Strategies to improve optimal BP control, especially in the private hospitals, and the use of statin therapy should be encouraged in adult diabetic patients

Suboptimal control of pressurized water reactor power plant using approximate model-following method

International Nuclear Information System (INIS)

Tsuji, Masashi; Ogawa, Yuichi

1987-01-01

We attempted to develop an effective control system that can successfully manage the nuclear steam supply (NSS) system of a PWR power plant in an operational mode requiring relatively small variations of power. A procedure is proposed for synthesizing control system that is a simple, yet practiced, suboptimal control system. The suboptimal control system is designed in two steps; application of the optimal control theory, based on the linear state-feedback control and the use of an approximate model-following method. This procedure can appreciably reduce the complexity of the structure of the controller by accepting a slight deviation from the optimality and by the use of the output-feedback control. This eliminates the engineering difficulty caused by an incompletely state-feedback that is sometimes encountered in practical applications of the optimal state-feedback control theory to complex large-scale dynamical systems. Digital simulations and graphical studies based on the Bode-diagram demonstrate the effectiveness of the suboptimal control, and the applicability of the proposed design method as well. (author)

Burnout and self-reported suboptimal patient care amongst health care workers providing HIV care in Malawi

Science.gov (United States)

Mazenga, Alick C.; Simon, Katie; Yu, Xiaoying; Ahmed, Saeed; Nyasulu, Phoebe; Kazembe, Peter N.; Ngoma, Stanley; Abrams, Elaine J.

2018-01-01

Background The well-documented shortages of health care workers (HCWs) in sub-Saharan Africa are further intensified by the increased human resource needs of expanding HIV treatment programs. Burnout is a syndrome of emotional exhaustion (EE), depersonalization (DP), and a sense of low personal accomplishment (PA). HCWs’ burnout can negatively impact the delivery of health services. Our main objective was to examine the prevalence of burnout amongst HCWs in Malawi and explore its relationship to self-reported suboptimal patient care. Methods A cross-sectional study among HCWs providing HIV care in 89 facilities, across eight districts in Malawi was conducted. Burnout was measured using the Maslach Burnout Inventory defined as scores in the mid-high range on the EE or DP subscales. Nine questions adapted for this study assessed self-reported suboptimal patient care. Surveys were administered anonymously and included socio-demographic and work-related questions. Validated questionnaires assessed depression and at-risk alcohol use. Chi-square test or two-sample t-test was used to explore associations between variables and self-reported suboptimal patient care. Bivariate analyses identified candidate variables (p burnout. In the three dimensions of burnout, 55% reported moderate-high EE, 31% moderate-high DP, and 46% low-moderate PA. The majority (89%) reported engaging in suboptimal patient care/attitudes including making mistakes in treatment not due to lack of knowledge/experience (52%), shouting at patients (45%), and not performing diagnostic tests due to a desire to finish quickly (35%). In multivariate analysis, only burnout remained associated with self-reported suboptimal patient care (OR 3.22, [CI 2.11 to 4.90]; pBurnout was common among HCWs providing HIV care and was associated with self-reported suboptimal patient care practices/attitudes. Research is needed to understand factors that contribute to and protect against burnout and that inform the

Relationship between stress-related psychosocial work factors and suboptimal health among Chinese medical staff: a cross-sectional study.

Science.gov (United States)

Liang, Ying-Zhi; Chu, Xi; Meng, Shi-Jiao; Zhang, Jie; Wu, Li-Juan; Yan, Yu-Xiang

2018-03-06

The study aimed to develop and validate a model to measure psychosocial factors at work among medical staff in China based on confirmatory factor analysis (CFA). The second aim of the current study was to clarify the association between stress-related psychosocial work factors and suboptimal health status. The cross-sectional study was conducted using clustered sampling method. Xuanwu Hospital, a 3A grade hospital in Beijing. Nine hundred and fourteen medical staff aged over 40 years were sampled. Seven hundred and ninety-seven valid questionnaires were collected and used for further analyses. The sample included 94% of the Han population. The Copenhagen Psychosocial Questionnaire (COPSOQ) and the Suboptimal Health Status Questionnaires-25 were used to assess the psychosocial factors at work and suboptimal health status, respectively. CFA was conducted to establish the evaluating method of COPSOQ. A multivariate logistic regression model was used to estimate the relationship between suboptimal health status and stress-related psychosocial work factors among Chinese medical staff. There was a strong correlation among the five dimensions of COPSOQ based on the first-order factor model. Then, we established two second-order factors including negative and positive psychosocial work stress factors to evaluate psychosocial factors at work, and the second-order factor model fit well. The high score in negative (OR (95% CI)=1.47 (1.34 to 1.62), Pwork factors increased and decreased the risk of suboptimal health, respectively. This relationship remained statistically significant after adjusting for confounders and when using different cut-offs of suboptimal health status. Among medical staff, the second-order factor model was a suitable method to evaluate the COPSOQ. The negative and positive psychosocial work stress factors might be the risk and protective factors of suboptimal health, respectively. Moreover, negative psychosocial work stress was the most associated

Sub-optimal control of fuzzy linear dynamical systems under granular differentiability concept.

Science.gov (United States)

Mazandarani, Mehran; Pariz, Naser

2018-05-01

This paper deals with sub-optimal control of a fuzzy linear dynamical system. The aim is to keep the state variables of the fuzzy linear dynamical system close to zero in an optimal manner. In the fuzzy dynamical system, the fuzzy derivative is considered as the granular derivative; and all the coefficients and initial conditions can be uncertain. The criterion for assessing the optimality is regarded as a granular integral whose integrand is a quadratic function of the state variables and control inputs. Using the relative-distance-measure (RDM) fuzzy interval arithmetic and calculus of variations, the optimal control law is presented as the fuzzy state variables feedback. Since the optimal feedback gains are obtained as fuzzy functions, they need to be defuzzified. This will result in the sub-optimal control law. This paper also sheds light on the restrictions imposed by the approaches which are based on fuzzy standard interval arithmetic (FSIA), and use strongly generalized Hukuhara and generalized Hukuhara differentiability concepts for obtaining the optimal control law. The granular eigenvalues notion is also defined. Using an RLC circuit mathematical model, it is shown that, due to their unnatural behavior in the modeling phenomenon, the FSIA-based approaches may obtain some eigenvalues sets that might be different from the inherent eigenvalues set of the fuzzy dynamical system. This is, however, not the case with the approach proposed in this study. The notions of granular controllability and granular stabilizability of the fuzzy linear dynamical system are also presented in this paper. Moreover, a sub-optimal control for regulating a Boeing 747 in longitudinal direction with uncertain initial conditions and parameters is gained. In addition, an uncertain suspension system of one of the four wheels of a bus is regulated using the sub-optimal control introduced in this paper. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Robotic fish tracking method based on suboptimal interval Kalman filter

Science.gov (United States)

Tong, Xiaohong; Tang, Chao

2017-11-01

Autonomous Underwater Vehicle (AUV) research focused on tracking and positioning, precise guidance and return to dock and other fields. The robotic fish of AUV has become a hot application in intelligent education, civil and military etc. In nonlinear tracking analysis of robotic fish, which was found that the interval Kalman filter algorithm contains all possible filter results, but the range is wide, relatively conservative, and the interval data vector is uncertain before implementation. This paper proposes a ptimization algorithm of suboptimal interval Kalman filter. Suboptimal interval Kalman filter scheme used the interval inverse matrix with its worst inverse instead, is more approximate nonlinear state equation and measurement equation than the standard interval Kalman filter, increases the accuracy of the nominal dynamic system model, improves the speed and precision of tracking system. Monte-Carlo simulation results show that the optimal trajectory of sub optimal interval Kalman filter algorithm is better than that of the interval Kalman filter method and the standard method of the filter.

Nearest greedy for solving the waste collection vehicle routing problem: A case study

Science.gov (United States)

Mat, Nur Azriati; Benjamin, Aida Mauziah; Abdul-Rahman, Syariza; Wibowo, Antoni

2017-11-01

This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.

Design Of Real-Time Implementable Distributed Suboptimal Control: An LQR Perspective

KAUST Repository

Jaleel, Hassan; Shamma, Jeff S.

2017-01-01

of establishing a communication link between two base stations with minimum energy consumption. We show through simulations that the performance under the proposed framework is close to the optimal performance and the suboptimal policy can be efficiently

An improved exploratory search technique for pure integer linear programming problems

Science.gov (United States)

Fogle, F. R.

1990-01-01

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

A trust-based sensor allocation algorithm in cooperative space search problems

Science.gov (United States)

Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

2011-06-01

Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

Indicators of suboptimal performance embedded in the Wechsler Memory Scale-Fourth Edition (WMS-IV).

Science.gov (United States)

Bouman, Zita; Hendriks, Marc P H; Schmand, Ben A; Kessels, Roy P C; Aldenkamp, Albert P

2016-01-01

Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the identification of suboptimal performance using an analogue study design. The patient group consisted of 59 mixed-etiology patients; the experimental malingerers were 50 healthy individuals who were asked to simulate cognitive impairment as a result of a traumatic brain injury; the last group consisted of 50 healthy controls who were instructed to put forth full effort. Experimental malingerers performed significantly lower on all WMS-IV-NL tasks than did the patients and healthy controls. A binary logistic regression analysis was performed on the experimental malingerers and the patients. The first model contained the visual working memory subtests (Spatial Addition and Symbol Span) and the recognition tasks of the following subtests: Logical Memory, Verbal Paired Associates, Designs, Visual Reproduction. The results showed an overall classification rate of 78.4%, and only Spatial Addition explained a significant amount of variation (p < .001). Subsequent logistic regression analysis and receiver operating characteristic (ROC) analysis supported the discriminatory power of the subtest Spatial Addition. A scaled score cutoff of <4 produced 93% specificity and 52% sensitivity for detection of suboptimal performance. The WMS-IV-NL Spatial Addition subtest may provide clinically useful information for the detection of suboptimal performance.

Detection of suboptimal effort with symbol span: development of a new embedded index.

Science.gov (United States)

Young, J Christopher; Caron, Joshua E; Baughman, Brandon C; Sawyer, R John

2012-03-01

Developing embedded indicators of suboptimal effort on objective neurocognitive testing is essential for detecting increasingly sophisticated forms of symptom feigning. The current study explored whether Symbol Span, a novel Wechsler Memory Scale-fourth edition measure of supraspan visual attention, could be used to discriminate adequate effort from suboptimal effort. Archival data were collected from 136 veterans classified into Poor Effort (n = 42) and Good Effort (n = 94) groups based on symptom validity test (SVT) performance. The Poor Effort group had significantly lower raw scores (p Span test. A raw score cutoff of Span can effectively differentiate veterans with multiple failures on established free-standing and embedded SVTs.

Patterns of marijuana and tobacco use associated with suboptimal self-rated health among US adult ever users of marijuana

Directory of Open Access Journals (Sweden)

James Tsai

2017-06-01

In conclusion, among adult ever users of marijuana, current tobacco use is high and strongly associated with suboptimal SRH; regular marijuana smoking with or without current tobacco use is significantly associated with suboptimal SRH.

Sub-Optimal Management of Type 2 Diabetes Mellitus – A Local Audit

African Journals Online (AJOL)

Original Research: Sub-Optimal Management of Type 2 Diabetes Mellitus – A Local Audit ... despite clinical trial data documenting improved outcomes associated not ... were used to define the Metabolic Syndrome.9 Central obesity was.

Genetic search for an optimal power flow solution from a high density cluster

Energy Technology Data Exchange (ETDEWEB)

Amarnath, R.V. [Hi-Tech College of Engineering and Technology, Hyderabad (India); Ramana, N.V. [JNTU College of Engineering, Jagityala (India)

2008-07-01

This paper proposed a novel method to solve optimal power flow (OPF) problems. The method is based on a genetic algorithm (GA) search from a High Density Cluster (GAHDC). The algorithm of the proposed method includes 3 stages, notably (1) a suboptimal solution is obtained via a conventional analytical method, (2) a high density cluster, which consists of other suboptimal data points from the first stage, is formed using a density-based cluster algorithm, and (3) a genetic algorithm based search is carried out for the exact optimal solution from a low population sized, high density cluster. The final optimal solution thoroughly satisfies the well defined fitness function. A standard IEEE 30-bus test system was considered for the simulation study. Numerical results were presented and compared with the results of other approaches. It was concluded that although there is not much difference in numerical values, the proposed method has the advantage of minimal computational effort and reduced CPU time. As such, the method would be suitable for online applications such as the present Optimal Power Flow problem. 24 refs., 2 tabs., 4 figs.

On the statistics of uplink inter-cell interference with greedy resource allocation

KAUST Repository

Tabassum, Hina

2012-10-03

In this paper, we introduce a new methodology to model the uplink inter-cell interference (ICI) in wireless cellular networks. The model takes into account both the effect of channel statistics (i.e., path loss, shadowing, fading) and the resource allocation scheme in the interfering cells. Firstly, we derive a semi-analytical expression for the distribution of the locations of the allocated user in a given cell considering greedy resource allocation with maximum signal-to-noise ratio (SNR) criterion. Based on this, we derive the distribution of the uplink ICI from one neighboring cell. Next, we compute the moment generating function (MGF) of the cumulative ICI observed from all neighboring cells and discuss some examples. Finally, we utilize the derived expressions to evaluate the outage probability in the network. In order to validate the accuracy of the developed semi-analytical expressions, we present comparison results with Monte Carlo simulations. The major benefit of the proposed mechanism is that it helps in estimating the distribution of ICI without the knowledge of instantaneous resource allocations in the neighbor cells. The proposed methodology applies to any shadowing and fading distributions. Moreover, it can be used to evaluate important network performance metrics numerically without the need for time-consuming Monte Carlo simulations. © 2011 IEEE.

On the statistics of uplink inter-cell interference with greedy resource allocation

KAUST Repository

Tabassum, Hina; Yilmaz, Ferkan; Dawy, Zaher; Alouini, Mohamed-Slim

2012-01-01

In this paper, we introduce a new methodology to model the uplink inter-cell interference (ICI) in wireless cellular networks. The model takes into account both the effect of channel statistics (i.e., path loss, shadowing, fading) and the resource allocation scheme in the interfering cells. Firstly, we derive a semi-analytical expression for the distribution of the locations of the allocated user in a given cell considering greedy resource allocation with maximum signal-to-noise ratio (SNR) criterion. Based on this, we derive the distribution of the uplink ICI from one neighboring cell. Next, we compute the moment generating function (MGF) of the cumulative ICI observed from all neighboring cells and discuss some examples. Finally, we utilize the derived expressions to evaluate the outage probability in the network. In order to validate the accuracy of the developed semi-analytical expressions, we present comparison results with Monte Carlo simulations. The major benefit of the proposed mechanism is that it helps in estimating the distribution of ICI without the knowledge of instantaneous resource allocations in the neighbor cells. The proposed methodology applies to any shadowing and fading distributions. Moreover, it can be used to evaluate important network performance metrics numerically without the need for time-consuming Monte Carlo simulations. © 2011 IEEE.

Exploration of Stellarator Configuration Space with Global Search Methods

International Nuclear Information System (INIS)

Mynick, H.E.; Pomphrey, N.; Ethier, S.

2001-01-01

An exploration of stellarator configuration space z for quasi-axisymmetric stellarator (QAS) designs is discussed, using methods which provide a more global view of that space. To this end, we have implemented a ''differential evolution'' (DE) search algorithm in an existing stellarator optimizer, which is much less prone to become trapped in local, suboptimal minima of the cost function chi than the local search methods used previously. This search algorithm is complemented by mapping studies of chi over z aimed at gaining insight into the results of the automated searches. We find that a wide range of the attractive QAS configurations previously found fall into a small number of classes, with each class corresponding to a basin of chi(z). We develop maps on which these earlier stellarators can be placed, the relations among them seen, and understanding gained into the physics differences between them. It is also found that, while still large, the region of z space containing practically realizable QAS configurations is much smaller than earlier supposed

Level of suboptimal adherence to first line antiretroviral treatment & its determinants among HIV positive people in India.

Science.gov (United States)

Joshi, Beena; Chauhan, Sanjay; Pasi, Achhelal; Kulkarni, Ragini; Sunil, Nithya; Bachani, Damodar; Mankeshwar, Ranjit

2014-07-01

National Anti-retroviral treatment (ART) programme in India was launched in 2004. Since then, there has been no published country representative estimate of suboptimal adherence among people living with HIV (PLHIV) on first line ART in public settings. Hence a multicentric study was undertaken in 15 States of India to assess the level of suboptimal adherence and its determinants among PLHIV. Using a prospective observational study design, 3285 PLHIV were enrolled and followed up to six months across 30 ART centres in India. Adherence was assessed using pill count and self-reported recall method and determinants of suboptimal adherence were explored based on the responses to various issues as perceived by them. Suboptimal adherence was found in 24.5 per cent PLHIV. Determinants of suboptimal adherence were illiteracy (OR--1.341, CI--1.080-1.665), on ART for less than 6 months (OR--1.540, CI--1.280-1.853), male gender (OR for females--0.807, CI--0.662-0.982), tribals (OR--2.246, CI--1.134-4.447), on efavirenz (EFA) regimen (OR--1.479, CI--1.190-1.837), presence of anxiety (OR--1.375, CI--1.117-1.692), non-disclosure of HIV status to family (OR--1.549, CI--1.176-2.039), not motivated for treatment (OR--1.389, CI--1.093-1.756), neglect from friends (OR--1.368, CI--1.069-1.751), frequent change of residence (OR--3.373, CI--2.659-4.278), travel expenses (OR--1.364, CI--1.138-1.649), not meeting the PLHIV volunteer/community care coordinator at the ART center (OR--1.639, CI--1.330-2.019). To enhance identification of PLHIV vulnerable to suboptimal adherence, the existing checklist to identify the barriers to adherence in the National ART Guidelines needs to be updated based on the study findings. Quality of comprehensive adherence support services needs to be improved coupled with vigilant monitoring of adherence measurement.

Level of suboptimal adherence to first line antiretroviral treatment & its determinants among HIV positive people in India

Directory of Open Access Journals (Sweden)

Beena Joshi

2014-01-01

Full Text Available Background & objectives: National Anti-retroviral treatment (ART programme in India was launched in 2004. Since then, there has been no published country representative estimate of suboptimal adherence among people living with HIV (PLHIV on first line ART in public settings. Hence a multicentric study was undertaken in 15 States of India to assess the level of suboptimal adherence and its determinants among PLHIV. Methods: Using a prospective observational study design, 3285 PLHIV were enrolled and followed up to six months across 30 ART centres in India. Adherence was assessed using pill count and self-reported recall method and determinants of suboptimal adherence were explored based on the responses to various issues as perceived by them. Results: Suboptimal adherence was found in 24.5 per cent PLHIV. Determinants of suboptimal adherence were illiteracy (OR-1.341, CI-1.080-1.665 , on ART for less than 6 months (OR-1.540, CI- 1.280-1.853, male gender (OR for females -0.807, CI- 0.662-0.982, tribals (OR-2.246, CI-1.134-4.447, on efavirenz (EFA regimen (OR- 1.479, CI - 1.190 - 1.837, presence of anxiety (OR- 1.375, CI - 1.117 - 1.692, non-disclosure of HIV status to family (OR- 1.549, CI - 1.176 - 2.039, not motivated for treatment (OR- 1.389, CI - 1.093 - 1.756, neglect from friends (OR-1.368, CI-1.069-1.751, frequent change of residence (OR- 3.373, CI - 2.659 - 4.278, travel expenses (OR- 1.364, CI - 1.138-1.649, not meeting the PLHIV volunteer/community care coordinator at the ART center (OR-1.639, CI-1.330-2.019. Interpretation & conclusions: To enhance identification of PLHIV vulnerable to suboptimal adherence, the existing checklist to identify the barriers to adherence in the National ART Guidelines needs to be updated based on the study findings. Quality of comprehensive adherence support services needs to be improved coupled with vigilant monitoring of adherence measurement.

Approximation algorithms for a genetic diagnostics problem.

Science.gov (United States)

Kosaraju, S R; Schäffer, A A; Biesecker, L G

1998-01-01

We define and study a combinatorial problem called WEIGHTED DIAGNOSTIC COVER (WDC) that models the use of a laboratory technique called genotyping in the diagnosis of an important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making use of the well-known problem SET COVER for which the greedy heuristic has been extensively studied. We prove worst-case performance bounds on the greedy heuristic for WDC and for another heuristic we call directional greedy. We implemented both heuristics. We also implemented a local search heuristic that takes the solutions obtained by greedy and dir-greedy and applies swaps until they are locally optimal. We report their performance on a real data set that is representative of the options that a clinical geneticist faces for the real diagnostic problem. Many open problems related to WDC remain, both of theoretical interest and practical importance.

State-set branching

DEFF Research Database (Denmark)

Jensen, Rune Møller; Veloso, Manuela M.; Bryant, Randal E.

2008-01-01

In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a sing...

Greedy solution of ill-posed problems: error bounds and exact inversion

International Nuclear Information System (INIS)

Denis, L; Lorenz, D A; Trede, D

2009-01-01

The orthogonal matching pursuit (OMP) is a greedy algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the solution of ill-posed inverse problems in general, and in particular for two deconvolution examples from mass spectrometry and digital holography, respectively. In sparse approximation problems one often has to deal with the problem of redundancy of a dictionary, i.e. the atoms are not linearly independent. However, one expects them to be approximatively orthogonal and this is quantified by the so-called incoherence. This idea cannot be transferred to ill-posed inverse problems since here the atoms are typically far from orthogonal. The ill-posedness of the operator probably causes the correlation of two distinct atoms to become huge, i.e. that two atoms look much alike. Therefore, one needs conditions which take the structure of the problem into account and work without the concept of coherence. In this paper we develop results for the exact recovery of the support of noisy signals. In the two examples, mass spectrometry and digital holography, we show that our results lead to practically relevant estimates such that one may check a priori if the experimental setup guarantees exact deconvolution with OMP. Especially in the example from digital holography, our analysis may be regarded as a first step to calculate the resolution power of droplet holography

Applications of sub-optimality in dynamic programming to location and construction of nuclear fuel processing plant

International Nuclear Information System (INIS)

Thiriet, L.; Deledicq, A.

1968-09-01

First, the point of applying Dynamic Programming to optimization and Operational Research problems in chemical industries are recalled, as well as the conditions in which a dynamic program is illustrated by a sequential graph. A new algorithm for the determination of sub-optimal politics in a sequential graph is then developed. Finally, the applications of sub-optimality concept is shown when taking into account the indirect effects related to possible strategies, or in the case of stochastic choices and of problems of the siting of plants... application examples are given. (authors) [fr

Sub-optimal vitamin B-12 levels among ART-naive HIV-positive individuals in an urban cohort in Uganda.

Directory of Open Access Journals (Sweden)

Aggrey S Semeere

Full Text Available Malnutrition is common among HIV-infected individuals and is often accompanied by low serum levels of micronutrients. Vitamin B-12 deficiency has been associated with various factors including faster HIV disease progression and CD4 depletion in resource-rich settings. To describe prevalence and factors associated with sub-optimal vitamin B-12 levels among HIV-infected antiretroviral therapy (ART naïve adults in a resource-poor setting, we performed a cross-sectional study with a retrospective chart review among individuals attending either the Mulago-Mbarara teaching hospitals' Joint AIDS Program (MJAP or the Infectious Diseases Institute (IDI clinics, in Kampala, Uganda. Logistic regression was used to determine factors associated with sub-optimal vitamin B-12. The mean vitamin B-12 level was 384 pg/ml, normal range (200-900. Sub-optimal vitamin B-12 levels (<300 pg/ml were found in 75/204 (36.8%. Twenty-one of 204 (10.3% had vitamin B-12 deficiency (<200 pg/ml while 54/204 (26.5% had marginal depletion (200-300 pg/ml. Irritable mood was observed more among individuals with sub-optimal vitamin B-12 levels (OR 2.5, 95% CI; 1.1-5.6, P=0.03. Increasing MCV was associated with decreasing serum B-12 category; 86.9 fl (± 5.1 vs. 83 fl (± 8.4 vs. 82 fl (± 8.4 for B-12 deficiency, marginal and normal B-12 categories respectively (test for trend, P=0.017. Compared to normal B-12, individuals with vitamin B-12 deficiency had a longer known duration of HIV infection: 42.2 months (± 27.1 vs. 29.4 months (± 23.8; P=0.02. Participants eligible for ART (CD4<350 cells/µl with sub-optimal B-12 had a higher mean rate of CD4 decline compared to counterparts with normal B-12; 118 (± 145 vs. 22 (± 115 cells/µl/year, P=0.01 respectively. The prevalence of a sub-optimal vitamin B-12 was high in this HIV-infected, ART-naïve adult clinic population in urban Uganda. We recommend prospective studies to further clarify the causal relationships of sub-optimal

Optimal inference with suboptimal models: Addiction and active Bayesian inference

Science.gov (United States)

Schwartenbeck, Philipp; FitzGerald, Thomas H.B.; Mathys, Christoph; Dolan, Ray; Wurst, Friedrich; Kronbichler, Martin; Friston, Karl

2015-01-01

When casting behaviour as active (Bayesian) inference, optimal inference is defined with respect to an agent’s beliefs – based on its generative model of the world. This contrasts with normative accounts of choice behaviour, in which optimal actions are considered in relation to the true structure of the environment – as opposed to the agent’s beliefs about worldly states (or the task). This distinction shifts an understanding of suboptimal or pathological behaviour away from aberrant inference as such, to understanding the prior beliefs of a subject that cause them to behave less ‘optimally’ than our prior beliefs suggest they should behave. Put simply, suboptimal or pathological behaviour does not speak against understanding behaviour in terms of (Bayes optimal) inference, but rather calls for a more refined understanding of the subject’s generative model upon which their (optimal) Bayesian inference is based. Here, we discuss this fundamental distinction and its implications for understanding optimality, bounded rationality and pathological (choice) behaviour. We illustrate our argument using addictive choice behaviour in a recently described ‘limited offer’ task. Our simulations of pathological choices and addictive behaviour also generate some clear hypotheses, which we hope to pursue in ongoing empirical work. PMID:25561321

Suboptimal Choice in Pigeons: Stimulus Value Predicts Choice over Frequencies.

Directory of Open Access Journals (Sweden)

Aaron P Smith

Full Text Available Pigeons have shown suboptimal gambling-like behavior when preferring a stimulus that infrequently signals reliable reinforcement over alternatives that provide greater reinforcement overall. As a mechanism for this behavior, recent research proposed that the stimulus value of alternatives with more reliable signals for reinforcement will be preferred relatively independently of their frequencies. The present study tested this hypothesis using a simplified design of a Discriminative alternative that, 50% of the time, led to either a signal for 100% reinforcement or a blackout period indicative of 0% reinforcement against a Nondiscriminative alternative that always led to a signal that predicted 50% reinforcement. Pigeons showed a strong preference for the Discriminative alternative that remained despite reducing the frequency of the signal for reinforcement in subsequent phases to 25% and then 12.5%. In Experiment 2, using the original design of Experiment 1, the stimulus following choice of the Nondiscriminative alternative was increased to 75% and then to 100%. Results showed that preference for the Discriminative alternative decreased only when the signals for reinforcement for the two alternatives predicted the same probability of reinforcement. The ability of several models to predict this behavior are discussed, but the terminal link stimulus value offers the most parsimonious account of this suboptimal behavior.

Self-care practices of Malaysian adults with diabetes and sub-optimal glycaemic control.

Science.gov (United States)

Tan, Ming Yeong; Magarey, Judy

2008-08-01

To investigate the self-care practices of Malaysian adults with diabetes and sub-optimal glycaemic control. Using a one-to-one interviewing approach, data were collected from 126 diabetic adults from four settings. A 75-item questionnaire was used to assess diabetes-related knowledge and self-care practices regarding, diet, medication, physical activity and self-monitoring of blood glucose (SMBG). Most subjects had received advice on the importance of self-care in the management of their diabetes and recognised its importance. Sixty-seven subjects (53%) scored below 50% in their diabetes-related knowledge. Subjects who consumed more meals per day (80%), or who did not include their regular sweetened food intakes in their daily meal plan (80%), or who were inactive in daily life (54%), had higher mean fasting blood glucose levels (p=0.04). Subjects with medication non-adherence (46%) also tended to have higher fasting blood glucose levels. Only 15% of the subjects practiced SMBG. Predictors of knowledge deficit and poor self-care were low level of education (p = <0.01), older subjects (p=0.04) and Type 2 diabetes subjects on oral anti-hyperglycaemic medication (p = <0.01). There were diabetes-related knowledge deficits and inadequate self-care practices among the majority of diabetic patients with sub-optimal glycaemic control. This study should contribute to the development of effective education strategies to promote health for adults with sub-optimal diabetes control.

Suboptimal Criterion Learning in Static and Dynamic Environments.

Directory of Open Access Journals (Sweden)

Elyse H Norton

2017-01-01

Full Text Available Humans often make decisions based on uncertain sensory information. Signal detection theory (SDT describes detection and discrimination decisions as a comparison of stimulus "strength" to a fixed decision criterion. However, recent research suggests that current responses depend on the recent history of stimuli and previous responses, suggesting that the decision criterion is updated trial-by-trial. The mechanisms underpinning criterion setting remain unknown. Here, we examine how observers learn to set a decision criterion in an orientation-discrimination task under both static and dynamic conditions. To investigate mechanisms underlying trial-by-trial criterion placement, we introduce a novel task in which participants explicitly set the criterion, and compare it to a more traditional discrimination task, allowing us to model this explicit indication of criterion dynamics. In each task, stimuli were ellipses with principal orientations drawn from two categories: Gaussian distributions with different means and equal variance. In the covert-criterion task, observers categorized a displayed ellipse. In the overt-criterion task, observers adjusted the orientation of a line that served as the discrimination criterion for a subsequently presented ellipse. We compared performance to the ideal Bayesian learner and several suboptimal models that varied in both computational and memory demands. Under static and dynamic conditions, we found that, in both tasks, observers used suboptimal learning rules. In most conditions, a model in which the recent history of past samples determines a belief about category means fit the data best for most observers and on average. Our results reveal dynamic adjustment of discrimination criterion, even after prolonged training, and indicate how decision criteria are updated over time.

Risk of suboptimal iodine intake in pregnant Norwegian women.

Science.gov (United States)

Brantsæter, Anne Lise; Abel, Marianne Hope; Haugen, Margaretha; Meltzer, Helle Margrete

2013-02-06

Pregnant women and infants are exceptionally vulnerable to iodine deficiency. The aims of the present study were to estimate iodine intake, to investigate sources of iodine, to identify predictors of low or suboptimal iodine intake (defined as intakes below 100 μg/day and 150 μg/day) in a large population of pregnant Norwegian women and to evaluate iodine status in a sub-population. Iodine intake was calculated based on a validated Food Frequency Questionnaire in the Norwegian Mother and Child Cohort. The median iodine intake was 141 μg/day from food and 166 μg/day from food and supplements. Use of iodine-containing supplements was reported by 31.6%. The main source of iodine from food was dairy products, contributing 67% and 43% in non-supplement and iodine-supplement users, respectively. Of 61,904 women, 16.1% had iodine intake below 100 μg/day, 42.0% had iodine intake below 150 μg/day and only 21.7% reached the WHO/UNICEF/ICCIDD recommendation of 250 μg/day. Dietary behaviors associated with increased risk of low and suboptimal iodine intake were: no use of iodine-containing supplements and low intake of milk/yogurt, seafood and eggs. The median urinary iodine concentration measured in 119 participants (69 μg/L) confirmed insufficient iodine intake. Public health strategies are needed to improve and secure the iodine status of pregnant women in Norway.

Suboptimal processor for anomaly detection for system surveillance and diagnosis

Energy Technology Data Exchange (ETDEWEB)

Ciftcioglu, Oe.; Hoogenboom, J.E.; Dam, H. van

1989-06-01

Anomaly detection for nuclear reactor surveillance and diagnosis is described. The residual noise obtained as a result of autoregressive (AR) modelling is essential to obtain high sensitivity for anomaly detection. By means of the method of hypothesis testing a suboptimal anomaly detection processor is devised for system surveillance and diagnosis. Experiments are carried out to investigate the performance of the processor, which is in particular of interest for on-line and real-time applications.

Unsupervised quantification of abdominal fat from CT images using Greedy Snakes

Science.gov (United States)

Agarwal, Chirag; Dallal, Ahmed H.; Arbabshirani, Mohammad R.; Patel, Aalpen; Moore, Gregory

2017-02-01

Adipose tissue has been associated with adverse consequences of obesity. Total adipose tissue (TAT) is divided into subcutaneous adipose tissue (SAT) and visceral adipose tissue (VAT). Intra-abdominal fat (VAT), located inside the abdominal cavity, is a major factor for the classic obesity related pathologies. Since direct measurement of visceral and subcutaneous fat is not trivial, substitute metrics like waist circumference (WC) and body mass index (BMI) are used in clinical settings to quantify obesity. Abdominal fat can be assessed effectively using CT or MRI, but manual fat segmentation is rather subjective and time-consuming. Hence, an automatic and accurate quantification tool for abdominal fat is needed. The goal of this study is to extract TAT, VAT and SAT fat from abdominal CT in a fully automated unsupervised fashion using energy minimization techniques. We applied a four step framework consisting of 1) initial body contour estimation, 2) approximation of the body contour, 3) estimation of inner abdominal contour using Greedy Snakes algorithm, and 4) voting, to segment the subcutaneous and visceral fat. We validated our algorithm on 952 clinical abdominal CT images (from 476 patients with a very wide BMI range) collected from various radiology departments of Geisinger Health System. To our knowledge, this is the first study of its kind on such a large and diverse clinical dataset. Our algorithm obtained a 3.4% error for VAT segmentation compared to manual segmentation. These personalized and accurate measurements of fat can complement traditional population health driven obesity metrics such as BMI and WC.

Induction Motor Parameter Identification Using a Gravitational Search Algorithm

Directory of Open Access Journals (Sweden)

Omar Avalos

2016-04-01

Full Text Available The efficient use of electrical energy is a topic that has attracted attention for its environmental consequences. On the other hand, induction motors represent the main component in most industries. They consume the highest energy percentages in industrial facilities. This energy consumption depends on the operation conditions of the induction motor imposed by its internal parameters. Since the internal parameters of an induction motor are not directly measurable, an identification process must be conducted to obtain them. In the identification process, the parameter estimation is transformed into a multidimensional optimization problem where the internal parameters of the induction motor are considered as decision variables. Under this approach, the complexity of the optimization problem tends to produce multimodal error surfaces for which their cost functions are significantly difficult to minimize. Several algorithms based on evolutionary computation principles have been successfully applied to identify the optimal parameters of induction motors. However, most of them maintain an important limitation: They frequently obtain sub-optimal solutions as a result of an improper equilibrium between exploitation and exploration in their search strategies. This paper presents an algorithm for the optimal parameter identification of induction motors. To determine the parameters, the proposed method uses a recent evolutionary method called the gravitational search algorithm (GSA. Different from most of the existent evolutionary algorithms, the GSA presents a better performance in multimodal problems, avoiding critical flaws such as the premature convergence to sub-optimal solutions. Numerical simulations have been conducted on several models to show the effectiveness of the proposed scheme.

Sub-optimal vitamin B-12 levels among ART-naïve HIV-positive individuals in an urban cohort in Uganda.

Science.gov (United States)

Semeere, Aggrey S; Nakanjako, Damalie; Ddungu, Henry; Kambugu, Andrew; Manabe, Yukari C; Colebunders, Robert

2012-01-01

Malnutrition is common among HIV-infected individuals and is often accompanied by low serum levels of micronutrients. Vitamin B-12 deficiency has been associated with various factors including faster HIV disease progression and CD4 depletion in resource-rich settings. To describe prevalence and factors associated with sub-optimal vitamin B-12 levels among HIV-infected antiretroviral therapy (ART) naïve adults in a resource-poor setting, we performed a cross-sectional study with a retrospective chart review among individuals attending either the Mulago-Mbarara teaching hospitals' Joint AIDS Program (MJAP) or the Infectious Diseases Institute (IDI) clinics, in Kampala, Uganda. Logistic regression was used to determine factors associated with sub-optimal vitamin B-12. The mean vitamin B-12 level was 384 pg/ml, normal range (200-900). Sub-optimal vitamin B-12 levels (ART (CD4ART-naïve adult clinic population in urban Uganda. We recommend prospective studies to further clarify the causal relationships of sub-optimal vitamin B-12, and explore the role of vitamin B-12 supplementation in immune recovery.

TECHNOLOGICAL INNOVATION AND BUSINESS DIVERSIFICATION: SUSTAINABILITY LIVELIHOODS IMPROVEMENT SCENARIO OF RICE FARMER HOUSEHOLD IN SUB-OPTIMAL LAND

Directory of Open Access Journals (Sweden)

Adriani D.

2017-09-01

Full Text Available The increased role of the sub-optimal land to support food security continue to be encouraged in Indonesia, given the more limited expansion for potential land. But until recently, development of sub-optimal land becomes not an easy thing. Ecological and technical barriers became the main issue. A series of these issues resulted in a high number of underemproleymeny and poverty in agriculture region. Technological inovation of agriculture and the business diversification can be seen be the solution to those issues. This research aims to analyze the impact of the technological innovation and business diversification on underemployment, working time, household income and also sustainable livelihoods of farmers on the sub-optimal land. The research was carried out in Pemulutan District, Ogan Ilir Regency, South Sumatra Province, Indonesia. The objects of research are farmers which adopter and non adopter technological innovation, and also work outside of paddy farming (business diversification. The research method is the survey. Method of sampling is stratified random sampling. Data obtained in the field analyses using descriptive statistics and inferesia. The results showed there are positive impact of technological innovation on the allocation of working time farmer households, the numbers underemployment, household income and livelihood sustainability. Determinant factors for farmers in applying technology and business diversification are paddy farming income, off-farm income, and age. The use of technology and business diversification proves to be one of the positive scenarios for sustainable livelihood of farmers in sub-optimal land.

Characteristics influencing therapy switch behavior after suboptimal response to first-line treatment in patients with multiple sclerosis.

Science.gov (United States)

Teter, Barbara; Agashivala, Neetu; Kavak, Katelyn; Chouhfeh, Lynn; Hashmonay, Ron; Weinstock-Guttman, Bianca

2014-06-01

Factors driving disease-modifying therapy (DMT) switch behavior are not well understood. The objective of this paper is to identify patient characteristics and clinical events predictive of therapy switching in patients with suboptimal response to DMT. This retrospective study analyzed patients with relapsing-remitting multiple sclerosis (MS) and a suboptimal response to initial therapy with either interferon β or glatiramer acetate. Suboptimal responders were defined as patients with ≥1 MS event (clinical relapse, worsening disability, or MRI worsening) while on DMT. Switchers were defined as those who changed DMT within six to 12 months after the MS event. Of 606 suboptimal responders, 214 (35.3%) switched therapy. Switchers were younger at symptom onset (p = 0.012), MS diagnosis (p = 0.004), DMT initiation (p < 0.001), and first MS event (p = 0.011) compared with nonswitchers. Compared with one relapse alone, MRI worsening alone most strongly predicted switch behavior (odds ratio 6.3; 95% CI, 3.1-12.9; p < 0.001), followed by ≥2 relapses (2.8; 95% CI, 1.1-7.3; p = 0.040), EDSS plus MRI worsening (2.5; 95% CI, 1.1-5.9; p = 0.031) and EDSS worsening alone (2.2; 95% CI, 1.2-4.1; p = 0.009). Younger patients with disease activity, especially MRI changes, are more likely to have their therapy switched sooner than patients who are older at the time of MS diagnosis and DMT initiation. © The Author(s) 2013.

A Greedy Scanning Data Collection Strategy for Large-Scale Wireless Sensor Networks with a Mobile Sink.

Science.gov (United States)

Zhu, Chuan; Zhang, Sai; Han, Guangjie; Jiang, Jinfang; Rodrigues, Joel J P C

2016-09-06

Mobile sink is widely used for data collection in wireless sensor networks. It can avoid 'hot spot' problems but energy consumption caused by multihop transmission is still inefficient in real-time application scenarios. In this paper, a greedy scanning data collection strategy (GSDCS) is proposed, and we focus on how to reduce routing energy consumption by shortening total length of routing paths. We propose that the mobile sink adjusts its trajectory dynamically according to the changes of network, instead of predetermined trajectory or random walk. Next, the mobile sink determines which area has more source nodes, then it moves toward this area. The benefit of GSDCS is that most source nodes are no longer needed to upload sensory data for long distances. Especially in event-driven application scenarios, when event area changes, the mobile sink could arrive at the new event area where most source nodes are located currently. Hence energy can be saved. Analytical and simulation results show that compared with existing work, our GSDCS has a better performance in specific application scenarios.

High Prevalence of Suboptimal Vitamin D Status and Bone Loss in Adult Short Bowel Syndrome Even After Weaning Off Parenteral Nutrition.

Science.gov (United States)

Fan, Shengxian; Ni, Xiaodong; Wang, Jian; Zhang, Yongliang; Tao, Shen; Kong, Wencheng; Li, Yousheng; Li, Jieshou

2017-04-01

Previous studies have noticed the high incidence of suboptimal vitamin D (VtD) status and bone loss in short bowel syndrome (SBS) with parenteral nutrition (PN) dependence. However, limited data have focused on adult SBS without PN dependence. Therefore, our objective was to investigate the incidence and risk factors of suboptimal VtD status and bone loss in adult SBS even after weaning off PN. We performed a prospective study of 60 adult patients with SBS. Serum 25-hydroxyvitamin D (25-OHD) was measured by radioimmunoassay. Bone mineral density (BMD) was measured using dual-energy x-ray absorptiometry (DEXA). Medical records and various laboratory parameters were collected in all participants. Suboptimal VtD status was identified in all individuals, including 3 (5.0%) with VtD insufficiency and 57 (95.0%) with VtD deficiency. Residual small bowel length (B, 0.072, P = .001) and duration of SBS (B, -0.066, P = .020) were both significantly correlated with suboptimal VtD levels. Overall, only 2 patients presented a normal BMD; osteopenia and osteoporosis were noted in 41 (68.3%) and 17 (28.3%) individuals, respectively. Low 25-OHD concentration was associated with a decreased BMD (B, 0.065, P = .029). There were no other demographic characteristics or clinical examinations associated with suboptimal VtD levels and bone loss. Suboptimal VtD status and bone loss were common in adult SBS even after weaning off PN. Despite routine oral VtD supplementation, most patients did not achieve satisfactory status. This emphasizes the critical importance of routine surveillance of 25-OHD and BMD, as well as consideration of alternative methods of supplementation after weaning off PN.

Prevalence and correlates of suboptimal vitamin D status in people living with psychotic disorders: Data from the Australian Survey of High Impact Psychosis.

Science.gov (United States)

Suetani, Shuichi; Saha, Sukanta; Eyles, Darryl W; Scott, James G; McGrath, John J

2017-09-01

Having sufficient sera concentrations of 25-hydroxyvitamin D is important for a range of health outcomes including cardiometabolic diseases. Clinical studies in people with psychotic disorders suggest that a sizable proportion has suboptimal vitamin D status (i.e. vitamin D deficiency or insufficiency). Individuals with psychosis also have many of the risk factors associated with suboptimal vitamin D status such as smoking, obesity, and reduced physical activity. The aim of this study was to examine the prevalence and socio-demographic and clinical correlates of vitamin D status using a large, population-based sample of adults with psychotic disorders. Data were collected as part of the Survey of High Impact Psychosis, a population-based survey of Australians aged 18-64 years with a psychotic disorder. 25-Hydroxyvitamin D concentration was measured in 463 participants. 25-Hydroxyvitamin D concentration was dichotomised into optimal (above 50 nmol/L) and suboptimal (below 50 nmol/L). The influence of a range of socio-demographic and clinical variables on vitamin D status was examined using logistic regression. Nearly half (43.6%) of the participants had suboptimal vitamin D status. Those with (a) increased physical activity or (b) positive symptoms had significantly reduced odds of having suboptimal vitamin D status. However, there were no significant associations between suboptimal vitamin D status and other psychiatric symptom measures or cardiometabolic risk factors. Many people with psychotic disorders have suboptimal vitamin D status. As part of the routine assessment of physical health status, clinicians should remain mindful of vitamin D status in this vulnerable population and encourage the use of appropriate vitamin D supplements.

Partial Transmit Sequence Optimization Using Improved Harmony Search Algorithm for PAPR Reduction in OFDM

Directory of Open Access Journals (Sweden)

Mangal Singh

2017-12-01

Full Text Available This paper considers the use of the Partial Transmit Sequence (PTS technique to reduce the Peak‐to‐Average Power Ratio (PAPR of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search‐based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.

Indications for suboptimal low-dose direct oral anticoagulants for non-valvular atrial fibrillation patients

Directory of Open Access Journals (Sweden)

Masahiko Umei, MD

2017-10-01

Conclusions: With good adherence, the clinical course associated with DOACs is comparatively good. In the future, suboptimal low-dose DOAC therapy may serve as an appropriate choice for some patients with a high risk of stroke and bleeding.

Design Of Real-Time Implementable Distributed Suboptimal Control: An LQR Perspective

KAUST Repository

Jaleel, Hassan

2017-09-29

We propose a framework for multiagent systems in which the agents compute their control actions in real time, based on local information only. The novelty of the proposed framework is that the process of computing a suboptimal control action is divided into two phases: an offline phase and an online phase. In the offline phase, an approximate problem is formulated with a cost function that is close to the optimal cost in some sense and is distributed, i.e., the costs of non-neighboring nodes are not coupled. This phase is centralized and is completed before the deployment of the system. In the online phase, the approximate problem is solved in real time by implementing any efficient distributed optimization algorithm. To quantify the performance loss, we derive upper bounds for the maximum error between the optimal performance and the performance under the proposed framework. Finally, the proposed framework is applied to an example setup in which a team of mobile nodes is assigned the task of establishing a communication link between two base stations with minimum energy consumption. We show through simulations that the performance under the proposed framework is close to the optimal performance and the suboptimal policy can be efficiently implemented online.

Influence of Suboptimally and Optimally Presented Affective Pictures and Words on Consumption-Related Behavior

Science.gov (United States)

Winkielman, Piotr; Gogolushko, Yekaterina

2018-01-01

Affective stimuli can influence immediate reactions as well as spontaneous behaviors. Much evidence for such influence comes from studies of facial expressions. However, it is unclear whether these effects hold for other affective stimuli, and how the amount of stimulus processing changes the nature of the influence. This paper addresses these issues by comparing the influence on consumption behaviors of emotional pictures and valence-matched words presented at suboptimal and supraliminal durations. In Experiment 1, both suboptimal and supraliminal emotional facial expressions influenced consumption in an affect-congruent, assimilative way. In Experiment 2, pictures of both high- and low-frequency emotional objects congruently influenced consumption. In comparison, words tended to produce incongruent effects. We discuss these findings in light of privileged access theories, which hold that pictures better convey affective meaning than words, and embodiment theories, which hold that pictures better elicit somatosensory and motor responses. PMID:29434556

Investigating the prevalence, predictors, and prognosis of suboptimal statin use early after a non-ST elevation acute coronary syndrome.

Science.gov (United States)

Turner, Richard M; Yin, Peng; Hanson, Anita; FitzGerald, Richard; Morris, Andrew P; Stables, Rod H; Jorgensen, Andrea L; Pirmohamed, Munir

High-potency statin therapy is recommended in the secondary prevention of cardiovascular disease but discontinuation, dose reduction, statin switching, and/or nonadherence occur in practice. To determine the prevalence and predictors of deviation from high-potency statin use early after a non-ST elevation acute coronary syndrome (NSTE-ACS) and its association with subsequent major adverse cardiovascular events (MACE) and all-cause mortality (ACM). A total of 1005 patients from a UK-based prospective NSTE-ACS cohort study discharged on high-potency statin therapy (atorvastatin 80 mg, rosuvastatin 20 mg, or 40 mg daily) were included. At 1 month, patients were divided into constant high-potency statin users, and suboptimal users incorporating statin discontinuation, dose reduction, switching statin to a lower equivalent potency, and/or statin nonadherence. Follow-up was a median of 16 months. There were 156 suboptimal (∼15.5%) and 849 constant statin users. Factors associated in multivariable analysis with suboptimal statin occurrence included female sex (odds ratio 1.75, 95% confidence interval [CI] 1.14-2.68) and muscular symptoms (odds ratio 4.28, 95% CI 1.30-14.08). Suboptimal statin use was associated with increased adjusted risks of time to MACE (hazard ratio 2.10, 95% CI 1.25-3.53, P = .005) and ACM (hazard ratio 2.46, 95% CI 1.38-4.39, P = .003). Subgroup analysis confirmed that the increased MACE/ACM risks were principally attributable to statin discontinuation or nonadherence. Conversion to suboptimal statin use is common early after NSTE-ACS and is partly related to muscular symptoms. Statin discontinuation or non-adherence carries an adverse prognosis. Interventions that preserve and enhance statin utilization could improve post NSTE-ACS outcomes. Copyright © 2017 National Lipid Association. Published by Elsevier Inc. All rights reserved.

Point prevalence of suboptimal footwear features among ambulant older hospital patients: implications for fall prevention.

Science.gov (United States)

Chari, Satyan R; McRae, Prue; Stewart, Matthew J; Webster, Joan; Fenn, Mary; Haines, Terry P

2016-09-01

Objective The aim of the present study was to establish the point prevalence of 'suboptimal' features in footwear reported to have been used by older hospital patients when ambulating, and to explore underpinning factors for their choice of footwear. Method A cross-sectional investigation was undertaken on 95 of 149 eligible in-patients across 22 high fall-risk wards in a large metropolitan hospital in Brisbane, Australia. Results Over 70% of participants experienced an unplanned admission. Although most participants had access to some form of footwear in hospital (92%), nearly all reported ambulating in footwear with 'suboptimal' features (99%). Examples included slippers (27%), backless slippers (16%) or bare feet (27%). For patients who ambulated in bare feet, only one-third reported 'lack of access to footwear' as the primary cause, with others citing foot wounds, pain, oedema and personal choice as the main reason for bare foot ambulation. Conclusions Admitted patients frequently use footwear with 'suboptimal' features for ambulation in hospital. While some footwear options (for example well-fitting slippers) could be suited for limited in-hospital ambulation, others are clearly hazardous and might cause falls. Since footwear choices are influenced by multiple factors in this population, footwear education strategies alone may be insufficient to address the problem of hazardous footwear in at-risk patients. Footwear requirements may be more effectively addressed within a multidisciplinary team approach encompassing foot health, mobility and safety. What is known about the topic? Accidental falls while ambulating are an important health and safety concern for older people. Because certain footwear characteristics have been negatively linked to posture and balance, and specific footwear types linked to falls among seniors, the use of footwear with fewer suboptimal characteristics is generally recommended as a means of reducing the risk of falling. While footwear

Greedy algorithms for high-dimensional non-symmetric linear problems***

Directory of Open Access Journals (Sweden)

Cancès E.

2013-12-01

Full Text Available In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor product functions, each term of which is iteratively computed via a greedy algorithm ? . There exists a good theoretical framework for these methods in the case of (linear and nonlinear symmetric elliptic problems. However, the convergence results are not valid any more as soon as the problems under consideration are not symmetric. We present here a review of the main algorithms proposed in the literature to circumvent this difficulty, together with some new approaches. The theoretical convergence results and the practical implementation of these algorithms are discussed. Their behaviors are illustrated through some numerical examples. Dans cet article, nous présentons une famille de méthodes numériques pour résoudre des problèmes linéaires non symétriques en grande dimension. Le principe de ces approches est de représenter une fonction dépendant d’un grand nombre de variables sous la forme d’une somme de fonctions produit tensoriel, dont chaque terme est calculé itérativement via un algorithme glouton ? . Ces méthodes possèdent de bonnes propriétés théoriques dans le cas de problèmes elliptiques symétriques (linéaires ou non linéaires, mais celles-ci ne sont plus valables dès lors que les problèmes considérés ne sont plus symétriques. Nous présentons une revue des principaux algorithmes proposés dans la littérature pour contourner cette difficulté ainsi que de nouvelles approches que nous proposons. Les résultats de convergence théoriques et la mise en oeuvre pratique de ces algorithmes sont détaillés et leur comportement est illustré au travers d’exemples numériques.

Indicators of suboptimal performance embedded in the Wechsler Memory Scale-Fourth Edition (WMS-IV)

NARCIS (Netherlands)

Bouman, Z.; Hendriks, M.P.H.; Schmand, B.A.; Kessels, R.P.C.; Aldenkamp, A.P.

2016-01-01

INTRODUCTION: Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the

Indicators of suboptimal performance embedded in the Wechsler Memory Scale-Fourth Edition (WMS-IV)

NARCIS (Netherlands)

Bouman, Zita; Hendriks, Marc P. H.; Schmand, Ben A.; Kessels, Roy P. C.; Aldenkamp, Albert P.

2016-01-01

Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the identification of

Indicators of suboptimal performance embedded in the Wechsler Memory Scale : Fourth Edition (WMS-IV)

NARCIS (Netherlands)

Bouman, Z.; Hendriks, M.P.H.; Schmand, B.A.; Kessels, R.P.C.; Aldenkamp, A.P.

2016-01-01

INTRODUCTION: Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the

Indicators of suboptimal performance embedded in the Wechsler Memory Scale-Fourth Edition (WMS-IV)

NARCIS (Netherlands)

Bouman, Zita; Hendriks, Marc P.H.; Schmand, Ben A.; Kessels, Roy P.C.; Aldenkamp, Albert P.

2016-01-01

Introduction. Recognition and visual working memory tasks from the Wechsler Memory Scale-Fourth Edition (WMS-IV) have previously been documented as useful indicators for suboptimal performance. The present study examined the clinical utility of the Dutch version of the WMS-IV (WMS-IV-NL) for the

Risk-Based Maintenance Assessment in the Manufacturing Industry: Minimisation of Suboptimal Prioritisation

Directory of Open Access Journals (Sweden)

Ratnayake R.M. Chandima

2017-03-01

Full Text Available Manufacturing firms continuously strive to increase the efficiency and effectiveness in the maintenance management processes. Focus is placed on eliminating the unexpected failures which cause unnecessary costs and the production losses. Risk-based maintenance (RBM strategies enable to address the above through the identification of probability and consequences of potential failures whilst providing a way for prioritisation of maintenance actions based on the risk of possible failures. Such prioritisations enable to identify the optimal maintenance strategy, intervals of maintenance tasks, and optimal level of spare parts inventory. However, the risk assessment activities are performed with the support of a risk matrix. Suboptimal classifications and/or prioritisations arise due to the inherent nature of the risk matrix. This is caused by the fact that there are no means to incorporate actual circumstances at the boundary of the input ranges or at the levels of linguistic data and risk categories. In this paper, a risk matrix is first developed in collaboration with one of the manufacturing firms in Poland. Then, it illustrates the use of fuzzy logic for minimisation of suboptimal prioritisation and/or classifications using a fuzzy inference system (FIS together with illustrative membership functions and a rule base. Finally, an illustrative risk assessment is also demonstrated to illustrate the methodology.

High T-cell immune activation and immune exhaustion among individuals with suboptimal CD4 recovery after 4 years of antiretroviral therapy in an African cohort

Directory of Open Access Journals (Sweden)

Colebunders Robert

2011-02-01

Full Text Available Abstract Background Antiretroviral therapy (ART partially corrects immune dysfunction associated with HIV infection. The levels of T-cell immune activation and exhaustion after long-term, suppressive ART and their correlation with CD4 T-cell count reconstitution among ART-treated patients in African cohorts have not been extensively evaluated. Methods T-cell activation (CD38+HLA-DR+ and immune exhaustion (PD-1+ were measured in a prospective cohort of patients initiated on ART; 128 patient samples were evaluated and subcategorized by CD4 reconstitution after long-term suppressive treatment: Suboptimal [median CD4 count increase 129 (-43-199 cells/μl], N = 34 ], optimal [282 (200-415 cells/μl, N = 64] and super-optimal [528 (416-878 cells/μl, N = 30]. Results Both CD4+ and CD8 T-cell activation was significantly higher among suboptimal CD4 T-cell responders compared to super-optimal responders. In a multivariate model, CD4+CD38+HLADR+ T-cells were associated with suboptimal CD4 reconstitution [AOR, 5.7 (95% CI, 1.4-23, P = 0.014]. T-cell exhaustion (CD4+PD1+ and CD8+PD1+ was higher among suboptimal relative to optimal (P P = 0.022]. Conclusion T-cell activation and exhaustion persist among HIV-infected patients despite long-term, sustained HIV-RNA viral suppression. These immune abnormalities were associated with suboptimal CD4 reconstitution and their regulation may modify immune recovery among suboptimal responders to ART.

A Suboptimal Scheme for Multi-User Scheduling in Gaussian Broadcast Channels

KAUST Repository

Zafar, Ammar; Alouini, Mohamed-Slim; Shaqfeh, Mohammad

2014-01-01

This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

A Suboptimal Scheme for Multi-User Scheduling in Gaussian Broadcast Channels

KAUST Repository

Zafar, Ammar

2014-05-28

This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

Suboptimal and optimal order policies for fixed and varying replenishment interval with declining market

Science.gov (United States)

Yu, Jonas C. P.; Wee, H. M.; Yang, P. C.; Wu, Simon

2016-06-01

One of the supply chain risks for hi-tech products is the result of rapid technological innovation; it results in a significant decline in the selling price and demand after the initial launch period. Hi-tech products include computers and communication consumer's products. From a practical standpoint, a more realistic replenishment policy is needed to consider the impact of risks; especially when some portions of shortages are lost. In this paper, suboptimal and optimal order policies with partial backordering are developed for a buyer when the component cost, the selling price, and the demand rate decline at a continuous rate. Two mathematical models are derived and discussed: one model has the suboptimal solution with the fixed replenishment interval and a simpler computational process; the other one has the optimal solution with the varying replenishment interval and a more complicated computational process. The second model results in more profit. Numerical examples are provided to illustrate the two replenishment models. Sensitivity analysis is carried out to investigate the relationship between the parameters and the net profit.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

Science.gov (United States)

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

Suboptimal care and maternal mortality among foreign-born women in Sweden: maternal death audit with application of the 'migration three delays' model.

Science.gov (United States)

Esscher, Annika; Binder-Finnema, Pauline; Bødker, Birgit; Högberg, Ulf; Mulic-Lutvica, Ajlana; Essén, Birgitta

2014-04-12

Several European countries report differences in risk of maternal mortality between immigrants from low- and middle-income countries and host country women. The present study identified suboptimal factors related to care-seeking, accessibility, and quality of care for maternal deaths that occurred in Sweden from 1988-2010. A subset of maternal death records (n = 75) among foreign-born women from low- and middle-income countries and Swedish-born women were audited using structured implicit review. One case of foreign-born maternal death was matched with two native born Swedish cases of maternal death. An assessment protocol was developed that applied both the 'migration three delays' framework and a modified version of the Confidential Enquiry from the United Kingdom. The main outcomes were major and minor suboptimal factors associated with maternal death in this high-income, low-maternal mortality context. Major and minor suboptimal factors were associated with a majority of maternal deaths and significantly more often to foreign-born women (p = 0.01). The main delays to care-seeking were non-compliance among foreign-born women and communication barriers, such as incongruent language and suboptimal interpreter system or usage. Inadequate care occurred more often among the foreign-born (p = 0.04), whereas delays in consultation/referral and miscommunication between health care providers where equally common between the two groups. Suboptimal care factors, major and minor, were present in more than 2/3 of maternal deaths in this high-income setting. Those related to migration were associated to miscommunication, lack of professional interpreters, and limited knowledge about rare diseases and pregnancy complications. Increased insight into a migration perspective is advocated for maternity clinicians who provide care to foreign-born women.

Cost-effectiveness of extended-release methylphenidate in children and adolescents with attention-deficit/hyperactivity disorder sub-optimally treated with immediate release methylphenidate.

Directory of Open Access Journals (Sweden)

Jurjen van der Schans

Full Text Available Attention-Deficit/Hyperactivity Disorder (ADHD is a common psychiatric disorder in children and adolescents. Immediate-release methylphenidate (IR-MPH is the medical treatment of first choice. The necessity to use several IR-MPH tablets per day and associated potential social stigma at school often leads to reduced compliance, sub-optimal treatment, and therefore economic loss. Replacement of IR-MPH with a single-dose extended release (ER-MPH formulation may improve drug response and economic efficiency.To evaluate the cost-effectiveness from a societal perspective of a switch from IR-MPH to ER-MPH in patients who are sub-optimally treated.A daily Markov-cycle model covering a time-span of 10 years was developed including four different health states: (1 optimal response, (2 sub-optimal response, (3 discontinued treatment, and (4 natural remission. ER-MPH options included methylphenidate osmotic release oral system (MPH-OROS and Equasym XL/Medikinet CR. Both direct costs and indirect costs were included in the analysis, and effects were expressed as quality-adjusted life years (QALYs. Univariate, multivariate as well as probabilistic sensitivity analysis were conducted and the main outcomes were incremental cost-effectiveness ratios.Switching sub-optimally treated patients from IR-MPH to MPH-OROS or Equasym XL/Medikinet CR led to per-patient cost-savings of €4200 and €5400, respectively, over a 10-year treatment span. Sensitivity analysis with plausible variations of input parameters resulted in cost-savings in the vast majority of estimations.This study lends economic support to switching patients with ADHD with suboptimal response to short-acting IR-MPH to long-acting ER-MPH regimens.

Exogenous recombinant human growth hormone effects during suboptimal energy and zinc intake

OpenAIRE

Rising, Russell; Scaglia, Julio F; Cole, Conrad; Tverskaya, Rozalia; Duro, Debora; Lifshitz, Fima

2005-01-01

Abstract Background Energy and Zinc (Zn) deficiencies have been associated with nutritional related growth retardation as well as growth hormone (GH) resistance. In this study, the relationship between suboptimal energy and/or Zn intake and growth in rats and their response to immunoreactive exogenous recombinant human GH (GHi), was determined. Results Rats treated with GHi and fed ad-libitum energy and Zn (100/100) had increased IGFBP-3 (p < 0.05) as compared with NSS (215 ± 23 vs. 185 ± 17 ...

SIMULATION AND ANALYSIS OF GREEDY ROUTING PROTOCOL IN VIEW OF ENERGY CONSUMPTION AND NETWORK LIFETIME IN THREE DIMENSIONAL UNDERWATER WIRELESS SENSOR NETWORK

Directory of Open Access Journals (Sweden)

SHEENA KOHLI

2017-11-01

Full Text Available Underwater Wireless Sensor Network (UWSN comprises of a number of miniature sized sensing devices deployed in the sea or ocean, connected by dint of acoustic links to each other. The sensors trap the ambient conditions and transmit the data from one end to another. For transmission of data in any medium, routing protocols play a crucial role. Moreover, being battery limited, an unavoidable parameter to be considered in operation and analysis of protocols is the network energy and the network lifetime. The paper discusses the greedy routing protocol for underwater wireless sensor networks. The simulation of this routing protocol also takes into consideration the characteristics of acoustic communication like attenuation, transmission loss, signal to noise ratio, noise, propagation delay. The results from these observations may be used to construct an accurate underwater communication model.

Socioeconomic factors explain suboptimal adherence to antiretroviral therapy among HIV-infected Australian adults with viral suppression

NARCIS (Netherlands)

Siefried, Krista J; Mao, Limin; Kerr, Stephen; Cysique, Lucette A; Gates, Thomas M; McAllister, John; Maynard, Anthony; de Wit, John; Carr, Andrew

2017-01-01

BACKGROUND: Missing more than one tablet of contemporary antiretroviral therapy (ART) per month increases the risk of virological failure. Recent studies evaluating a comprehensive range of potential risk factors for suboptimal adherence are not available for high-income settings. METHODS: Adults on

Sub-optimal parenting is associated with schizotypic and anxiety personality traits in adulthood.

Science.gov (United States)

Giakoumaki, S G; Roussos, P; Zouraraki, C; Spanoudakis, E; Mavrikaki, M; Tsapakis, E M; Bitsios, P

2013-05-01

Part of the variation in personality characteristics has been attributed to the child-parent interaction and sub-optimal parenting has been associated with psychiatric morbidity. In the present study, an extensive battery of personality scales (Trait Anxiety Inventory, Behavioural Inhibition/Activation System questionnaire, Eysenck Personality Questionnaire-Revised, Temperament and Character Inventory, Schizotypal Traits Questionnaire, Toronto Alexithymia Scale) and the Parental Bonding Instrument (PBI) were administered in 324 adult healthy males to elucidate the effects of parenting on personality configuration. Personality variables were analysed using Principal Component Analysis (PCA) and the factors "Schizotypy", "Anxiety", "Behavioural activation", "Novelty seeking" and "Reward dependence" were extracted. Associations between personality factors with PBI "care" and "overprotection" scores were examined with regression analyses. Subjects were divided into "parental style" groups and personality factors were subjected to categorical analyses. "Schizotypy" and "Anxiety" were significantly predicted by high maternal overprotection and low paternal care. In addition, the Affectionless control group (low care/high overprotection) had higher "Schizotypy" and "Anxiety" compared with the Optimal Parenting group (high care/low overprotection). These results further validate sub-optimal parenting as an important environmental exposure and extend our understanding on the mechanisms by which it increases risk for psychiatric morbidity. Copyright © 2012 Elsevier Masson SAS. All rights reserved.

Effect of different seed treatments on maize seed germination parameters under optimal and suboptimal temperature conditions

Directory of Open Access Journals (Sweden)

Vujošević Bojana

2017-01-01

Full Text Available The aim of this study was to determine the effect of different seed treatments on germination parameters of three maize genotypes under optimal and suboptimal temperature conditions. Seed was treated with recommended doses of three commercial pesticide formulations: metalaxyl-m 10 g/L + fludioxonil 25 g/L, metalaxyl 20 g/kg + prothioconazole 100 g/kg and thiacloprid 400 g/L. Testing was conducted at 25°C and 15°C. Results of the study indicate that there are differences in response of maize genotypes to applied seed treatments, as well as to a specific treatment at optimal and suboptimal temperatures. Some treatments, depending on the mixing partner and temperature conditions, can affect final germination. In other cases, germination rate can be accelerated or prolonged, but with no effect on final germination. In order to provide fast and uniform emergence under different temperature conditions, further examination of the response of maize genotypes to specific seed treatments would be beneficial.

Association of Suboptimal Antiretroviral Therapy Adherence With Inflammation in Virologically Suppressed Individuals Enrolled in the SMART Study

DEFF Research Database (Denmark)

Castillo-Mancilla, Jose R; Phillips, Andrew N; Neaton, James D

2018-01-01

Suboptimal (ie, <100%) antiretroviral therapy (ART) adherence has been associated with heightened inflammation in cohort studies, even among people with virologic suppression. We aimed to evaluate this association among participants in the Strategies for Management of Antiretroviral Therapy (SMAR...

POWERPLAY: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem

Directory of Open Access Journals (Sweden)

Jürgen eSchmidhuber

2013-06-01

Full Text Available Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. The novel algorithmic framework POWERPLAY (2011 continually searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Wow-effects are achieved by continually making previously learned skills more efficient such that they require less time and space. New skills may (partially re-use previously learned skills. POWERPLAY's search orders candidate pairs of tasks and solver modifications by their conditional computational (time & space complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. The computational costs of validating new tasks need not grow with task repertoire size. POWERPLAY's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Goedel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing repertoire of problem solving procedures can be exploited by a parallel search for solutions to additional externally posed tasks. POWERPLAY may be viewed as a greedy but practical implementation of basic principles of creativity. A first experimental analysis can be found in separate papers [58, 56, 57].

Consumer perception and preference for suboptimal food under the emerging practice of expiration date based pricing in supermarkets

DEFF Research Database (Denmark)

Aschemann-Witzel, Jessica

2017-01-01

, it is unclear which contextual, individual, and product-related factors impact consumer likelihood of choice and thus acceptance of the practice in the long run. The study aimed at exploring the effect of communicating different motives for purchase, the product being organic, familiarity with the practice...... and the interaction with gender is observed for milk in particular. Overall, perceived quality and estimated likelihood of consumption at home majorly determine likelihood of choice. Consumer acceptance of expiration date based pricing of suboptimal food can be increased through furthering consumer familiarity......Consumers have been found to majorly prefer ‘optimal’ food over ‘suboptimal’ when purchasing food. To provide an incentive for consumers to select suboptimal food and thus decrease food waste in the supply chain, expiration date based pricing is suggested and increasingly applied. However...

Methanol degradation in granular sludge reactors at sub-optimal metal concentrations: role of iron, nickel and cobalt

NARCIS (Netherlands)

Zandvoort, M.H.; Geerts, R.; Lettinga, G.; Lens, P.N.L.

2003-01-01

The effect of sub-optimal trace metal concentrations on the conversion of methanol in an upflow anaerobic sludge bed (UASB) reactor was investigated by studying the effect of decreased influent trace metal concentrations on the reactor efficiency, methanol conversion route and sludge

Magmatically Greedy Reararc Volcanoes of the N. Tofua Segment of the Tonga Arc

Science.gov (United States)

Rubin, K. H.; Embley, R. W.; Arculus, R. J.; Lupton, J. E.

2013-12-01

Volcanism along the northernmost Tofua Arc is enigmatic because edifices of the arc's volcanic front are mostly, magmatically relatively anemic, despite the very high convergence rate of the Pacific Plate with this section of Tonga Arc. However, just westward of the arc front, in terrain generally thought of as part of the adjacent NE Lau Backarc Basin, lie a series of very active volcanoes and volcanic features, including the large submarine caldera Niuatahi (aka volcano 'O'), a large composite dacite lava flow terrain not obviously associated with any particular volcanic edifice, and the Mata volcano group, a series of 9 small elongate volcanoes in an extensional basin at the extreme NE corner of the Lau Basin. These three volcanic terrains do not sit on arc-perpendicular cross chains. Collectively, these volcanic features appear to be receiving a large proportion of the magma flux from the sub-Tonga/Lau mantle wedge, in effect 'stealing' this magma flux from the arc front. A second occurrence of such magma 'capture' from the arc front occurs in an area just to the south, on southernmost portion of the Fonualei Spreading Center. Erupted compositions at these 'magmatically greedy' volcanoes are consistent with high slab-derived fluid input into the wedge (particularly trace element abundances and volatile contents, e.g., see Lupton abstract this session). It is unclear how long-lived a feature this is, but the very presence of such hyperactive and areally-dispersed volcanism behind the arc front implies these volcanoes are not in fact part of any focused spreading/rifting in the Lau Backarc Basin, and should be thought of as 'reararc volcanoes'. Possible tectonic factors contributing to this unusually productive reararc environment are the high rate of convergence, the cold slab, the highly disorganized extension in the adjacent backarc, and the tear in the subducting plate just north of the Tofua Arc.

Quantum annealing for combinatorial clustering

Science.gov (United States)

Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph

2018-02-01

Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.

Segmentation precedes face categorization under suboptimal conditions

Directory of Open Access Journals (Sweden)

Carlijn eVan Den Boomen

2015-05-01

Full Text Available Both categorization and segmentation processes play a crucial role in face perception. However, the functional relation between these subprocesses is currently unclear. The present study investigates the temporal relation between segmentation-related and category-selective responses in the brain, using electroencephalography (EEG. Surface segmentation and category content were both manipulated using texture-defined objects, including faces. This allowed us to study brain activity related to segmentation and to categorization. In the main experiment, participants viewed texture-defined objects for a duration of 800 ms. EEG results revealed that segmentation-related responses precede category-selective responses. Three additional experiments revealed that the presence and timing of categorization depends on stimulus properties and presentation duration. Photographic objects were presented for a long and short (92 ms duration and evoked fast category-selective responses in both cases. On the other hand, presentation of texture-defined objects for a short duration only evoked segmentation-related but no category-selective responses. Category-selective responses were much slower when evoked by texture-defined than by photographic objects. We suggest that in case of categorization of objects under suboptimal conditions, such as when low-level stimulus properties are not sufficient for fast object categorization, segmentation facilitates the slower categorization process.

Segmentation precedes face categorization under suboptimal conditions.

Science.gov (United States)

Van Den Boomen, Carlijn; Fahrenfort, Johannes J; Snijders, Tineke M; Kemner, Chantal

2015-01-01

Both categorization and segmentation processes play a crucial role in face perception. However, the functional relation between these subprocesses is currently unclear. The present study investigates the temporal relation between segmentation-related and category-selective responses in the brain, using electroencephalography (EEG). Surface segmentation and category content were both manipulated using texture-defined objects, including faces. This allowed us to study brain activity related to segmentation and to categorization. In the main experiment, participants viewed texture-defined objects for a duration of 800 ms. EEG results revealed that segmentation-related responses precede category-selective responses. Three additional experiments revealed that the presence and timing of categorization depends on stimulus properties and presentation duration. Photographic objects were presented for a long and short (92 ms) duration and evoked fast category-selective responses in both cases. On the other hand, presentation of texture-defined objects for a short duration only evoked segmentation-related but no category-selective responses. Category-selective responses were much slower when evoked by texture-defined than by photographic objects. We suggest that in case of categorization of objects under suboptimal conditions, such as when low-level stimulus properties are not sufficient for fast object categorization, segmentation facilitates the slower categorization process.

Real-time discrete suboptimal control for systems with input and state delays: Experimental tests on a dehydration process.

Science.gov (United States)

Rodríguez-Guerrero, Liliam; Santos-Sánchez, Omar-Jacobo; Cervantes-Escorcia, Nicolás; Romero, Hugo

2017-11-01

This article presents a suboptimal control strategy with finite horizon for affine nonlinear discrete systems with both state and input delays. The Dynamic Programming Approach is used to obtain the suboptimal control sequence, but in order to avoid the computation of the Bellman functional, a numerical approximation of this function is proposed in every step. The feasibility of our proposal is demonstrated via an experimental test on a dehydration process and the obtained results show a good performance and behavior of this process. Then in order to demonstrate the benefits of using this kind of control strategy, the results are compared with a non optimal control strategy, particularly with respect to results produced by an industrial Proportional Integral Derivative (PID) Honeywell controller, which is tuned using the Ziegler-Nichols method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Architecture Synthesis for Cost-Constrained Fault-Tolerant Flow-based Biochips

DEFF Research Database (Denmark)

Eskesen, Morten Chabert; Pop, Paul; Potluri, Seetal

2016-01-01

. This increase in fabrication complexity has led to an increase in defect rates during the manufacturing, thereby motivating the need to improve the yield, by designing these biochips such that they are fault tolerant. We propose an approach based on a Greedy Randomized Adaptive Search Procedure (GRASP...

Lévy Walks Suboptimal under Predation Risk.

Directory of Open Access Journals (Sweden)

Masato S Abe

2015-11-01

Full Text Available A key challenge in movement ecology is to understand how animals move in nature. Previous studies have predicted that animals should perform a special class of random walks, called Lévy walk, to obtain more targets. However, some empirical studies did not support this hypothesis, and the relationship between search strategy and ecological factors is still unclear. We focused on ecological factors, such as predation risk, and analyzed whether Lévy walk may not be favored. It was remarkable that the ecological factors often altered an optimal search strategy from Lévy walk to Brownian walk, depending on the speed of the predator's movement, density of predators, etc. This occurred because higher target encounter rates simultaneously led searchers to higher predation risks. Our findings indicate that animals may not perform Lévy walks often, and we suggest that it is crucial to consider the ecological context for evaluating the search strategy performed by animals in the field.

Lévy Walks Suboptimal under Predation Risk

Science.gov (United States)

Abe, Masato S.; Shimada, Masakazu

2015-01-01

A key challenge in movement ecology is to understand how animals move in nature. Previous studies have predicted that animals should perform a special class of random walks, called Lévy walk, to obtain more targets. However, some empirical studies did not support this hypothesis, and the relationship between search strategy and ecological factors is still unclear. We focused on ecological factors, such as predation risk, and analyzed whether Lévy walk may not be favored. It was remarkable that the ecological factors often altered an optimal search strategy from Lévy walk to Brownian walk, depending on the speed of the predator’s movement, density of predators, etc. This occurred because higher target encounter rates simultaneously led searchers to higher predation risks. Our findings indicate that animals may not perform Lévy walks often, and we suggest that it is crucial to consider the ecological context for evaluating the search strategy performed by animals in the field. PMID:26544687

Do pigeons (Columba livia) use information about the absence of food appropriately? A further look into suboptimal choice.

Science.gov (United States)

Fortes, Inês; Machado, Armando; Vasconcelos, Marco

2017-11-01

In the natural environment, when an animal encounters a stimulus that signals the absence of food-a 'bad-news' stimulus-it will most likely redirect its search to another patch or prey. Because the animal does not pay the opportunity cost of waiting in the presence of a bad-news stimulus, the properties of the stimulus (e.g., its duration and probability) may have little impact in the evolution of the decision processes deployed in these circumstances. Hence, in the laboratory, when animals are forced to experience a bad-news stimulus they seem to ignore its duration, even though they pay the cost of waiting. Under certain circumstances, this insensitivity to the opportunity cost can lead to suboptimal preferences, such as a preference for an option yielding a low rather than a high rate of reinforcement. In 2 experiments, we tested Vasconcelos, Monteiro, and Kacelnik's (2015) assumption that, if given the opportunity, animals will escape the bad-news stimulus. To predict when an escape response should occur, we incorporated ideas from the prey choice model into Vasconcelos et al. (2015) model and made 2 novel predictions. Namely, both longer intertrial intervals and longer durations of signals predicting food or no food should lead to higher proportions of escape responses. The results of 2 experiments with pigeons supported these predictions. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

GSNFS: Gene subnetwork biomarker identification of lung cancer expression data.

Science.gov (United States)

Doungpan, Narumol; Engchuan, Worrawat; Chan, Jonathan H; Meechai, Asawin

2016-12-05

Gene expression has been used to identify disease gene biomarkers, but there are ongoing challenges. Single gene or gene-set biomarkers are inadequate to provide sufficient understanding of complex disease mechanisms and the relationship among those genes. Network-based methods have thus been considered for inferring the interaction within a group of genes to further study the disease mechanism. Recently, the Gene-Network-based Feature Set (GNFS), which is capable of handling case-control and multiclass expression for gene biomarker identification, has been proposed, partly taking into account of network topology. However, its performance relies on a greedy search for building subnetworks and thus requires further improvement. In this work, we establish a new approach named Gene Sub-Network-based Feature Selection (GSNFS) by implementing the GNFS framework with two proposed searching and scoring algorithms, namely gene-set-based (GS) search and parent-node-based (PN) search, to identify subnetworks. An additional dataset is used to validate the results. The two proposed searching algorithms of the GSNFS method for subnetwork expansion are concerned with the degree of connectivity and the scoring scheme for building subnetworks and their topology. For each iteration of expansion, the neighbour genes of a current subnetwork, whose expression data improved the overall subnetwork score, is recruited. While the GS search calculated the subnetwork score using an activity score of a current subnetwork and the gene expression values of its neighbours, the PN search uses the expression value of the corresponding parent of each neighbour gene. Four lung cancer expression datasets were used for subnetwork identification. In addition, using pathway data and protein-protein interaction as network data in order to consider the interaction among significant genes were discussed. Classification was performed to compare the performance of the identified gene subnetworks with three

System network planning expansion using mathematical programming, genetic algorithms and tabu search

International Nuclear Information System (INIS)

Sadegheih, A.; Drake, P.R.

2008-01-01

In this paper, system network planning expansion is formulated for mixed integer programming, a genetic algorithm (GA) and tabu search (TS). Compared with other optimization methods, GAs are suitable for traversing large search spaces, since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterized by gathering knowledge during the search and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus bar system to 18 bus bars. Finally, a steady-state genetic algorithm is employed rather than generational replacement, also uniform crossover is used

Sequential search leads to faster, more efficient fragment-based de novo protein structure prediction.

Science.gov (United States)

de Oliveira, Saulo H P; Law, Eleanor C; Shi, Jiye; Deane, Charlotte M

2018-04-01

Most current de novo structure prediction methods randomly sample protein conformations and thus require large amounts of computational resource. Here, we consider a sequential sampling strategy, building on ideas from recent experimental work which shows that many proteins fold cotranslationally. We have investigated whether a pseudo-greedy search approach, which begins sequentially from one of the termini, can improve the performance and accuracy of de novo protein structure prediction. We observed that our sequential approach converges when fewer than 20 000 decoys have been produced, fewer than commonly expected. Using our software, SAINT2, we also compared the run time and quality of models produced in a sequential fashion against a standard, non-sequential approach. Sequential prediction produces an individual decoy 1.5-2.5 times faster than non-sequential prediction. When considering the quality of the best model, sequential prediction led to a better model being produced for 31 out of 41 soluble protein validation cases and for 18 out of 24 transmembrane protein cases. Correct models (TM-Score > 0.5) were produced for 29 of these cases by the sequential mode and for only 22 by the non-sequential mode. Our comparison reveals that a sequential search strategy can be used to drastically reduce computational time of de novo protein structure prediction and improve accuracy. Data are available for download from: http://opig.stats.ox.ac.uk/resources. SAINT2 is available for download from: https://github.com/sauloho/SAINT2. saulo.deoliveira@dtc.ox.ac.uk. Supplementary data are available at Bioinformatics online.

Levy Foraging in a Dynamic Environment – Extending the Levy Search

Directory of Open Access Journals (Sweden)

Vincenzo Fioriti

2015-07-01

Full Text Available A common task for robots is the patrolling of an unknown area with inadequate information about target locations. Under these circumstances it has been suggested that animal foraging could provide an optimal or at least sub-optimal search methodology, namely the Levy flight search. Although still in debate, it seems that predators somehow follow this search pattern when foraging, because it avoids being trapped in a local search if the food is beyond the sensory range. A Levy flight is a particular case of the random walk. Its displacements on a 2-D surface are drawn from the Pareto-Levy probability distribution, characterized by power law tails. The Levy flight search has many applications in optical material, ladars, optics, large database search, earthquake data analysis, location of DNA sites, human mobility, stock return analysis, online auctions, astronomy, ecology and biology. Almost all studies and simulations concerning the Levy flight foraging examine static or slowly moving (with respect to the forager uniformly distributed resources. Moreover, in recent works a small swarm of underwater autonomous vehicles has been used to test the standard Levy search in the underwater environment, with good results. In this paper we extend the classical Levy foraging framework taking into consideration a moving target allocated on a 2-D surface according to a radial probability distribution and comparing its performance with the random walk search. The metric used in the numerical simulations is the detection rate. Simulations include the sensor resolution, intended as the maximum detection distance of the forager from the target. Furthermore, contrarily to the usual Levy foraging framework, we use only one target. Results show that Levy flight outperforms the random walk if the sensor detection radius is not too small or too large. We also find the Levy flight in the velocity of the center of mass model of a fish school according the Kuramoto

Sub-optimal breastfeeding of infants during the first six months and associated factors in rural communities of Jimma Arjo Woreda, Southwest Ethiopia

Directory of Open Access Journals (Sweden)

Tamiru Dessalegn

2012-05-01

Full Text Available Abstract Background Studies have shown that sub-optimal breastfeeding is major contributor to infant and young child mortality in Ethiopia. To address this problem, infant and young child feeding guideline was developed in 2004 and interventions have been going on based on the guidelines. There is no study that assessed whether the infant and child feeding practices are according the guideline or not. This study was carried out to assess sub-optimal breastfeeding practices and associated factors among infants from birth to six months in rural communities of Jimma Arjo Woreda in the Southwest Ethiopia. Methods A cross-sectional study was carried out from December to January 2009. Quantitative data were collected from a sample of 382 respondents supplemented by qualitative data generated using in-depth interviews of 15 index mothers. Multivariable logistic regression model was used to identify predictors of timely initiation of breast feeding and non-exclusive breast feeding among mother-infant pairs. Results More than three fourth of mothers breastfeed their infants sub-optimally. Thirty-seven percent of mothers initiated breastfeeding later than one hour after delivery, which was significantly associated with not attending formal education (AOR = 1.05[95%CI: 1.03, 1.94] and painful breastfeeding experiences (AOR = 5.02[95%CI: 1.01, 10.08]. The majority (67.02% of mothers had no knowledge about exclusive breastfeeding. Non-exclusive breastfeeding was negatively associated with child’s age of 0-2 months (AOR: 0.27[95%CI: 0.16, 0.47 and 3-4 months (AOR = 0.43 [95%CI: 0.25, 0.73 and ownership of radio (AOR = 0.56[95%CI: 0.37, 0.88], but positively associated with the practice of discarding colostrums (AOR = 1.78[95%CI: 1.09, 4.94]. Conclusion The findings showed that the majority of mothers sub-optimally breastfeed their children in the study area. As most of the mothers do not have knowledge on the exclusive breast feeding. Enhancing community

Mad scientists, compassionate healers, and greedy egotists: the portrayal of physicians in the movies.

Science.gov (United States)

Flores, Glenn

2002-07-01

Cinematic depictions of physicians potentially can affect public expectations and the patient-physician relationship, but little attention has been devoted to portrayals of physicians in movies. The objective of the study was the analysis of cinematic depictions of physicians to determine common demographic attributes of movie physicians, major themes, and whether portrayals have changed over time. All movies released on videotape with physicians as main characters and readily available to the public were viewed in their entirety. Data were collected on physician characteristics, diagnoses, and medical accuracy, and dialogue concerning physicians was transcribed. The results showed that in the 131 films, movie physicians were significantly more likely to be male (p film physicians has declined steadily in recent decades. Movie physicians are most commonly surgeons (33%), psychiatrists (26%), and family practitioners (18%). Physicians were portrayed negatively in 44% of movies, and since the 1960s positive portrayals declined while negative portrayals increased. Physicians frequently are depicted as greedy, egotistical, uncaring, and unethical, especially in recent films. Medical inaccuracies occurred in 27% of films. Compassion and idealism were common in early physician movies but are increasingly scarce in recent decades. A recurrent theme is the "mad scientist," the physician-researcher that values research more than patients' welfare. Portrayals of physicians as egotistical and materialistic have increased, whereas sexism and racism have waned. Movies from the past two decades have explored critical issues surrounding medical ethics and managed care. We conclude that negative cinematic portrayals of physicians are on the rise, which may adversely affect patient expectations and the patient-physician relationship. Nevertheless, films about physicians can serve as useful gauges of public opinion about the medical profession, as tools for medical education, and as

Embryo transcriptome response to environmental factors: implication for its survival under suboptimal conditions.

Science.gov (United States)

Salilew-Wondim, Dessie; Tesfaye, Dawit; Hoelker, Michael; Schellander, Karl

2014-09-01

After its formation, the mammalian zygote undergoes a series of morphological, physiological and biochemical alterations prior to undergoing cell differentiation. The zygote is then transformed into a complex multicellular organism in a defined time window which may differ between species. These orderly embryonic developmental events are tightly regulated by temporal and spatial activation and/or deactivation of genes and gene products. This phenomenon may in turn be dependent on the intrinsic characteristics of the embryo itself, the physiological and biochemical composition of the maternal environment or by in vitro culture condition. In fact, when embryos are subjected to suboptimal culture condition, some of the embryos may escape the environmental stress by activating certain transcripts and some others which are unable to activate anti-stress agents may die or exhibit abnormal development. This phenomenon may partly depend on transcripts and proteins stored during oogenesis. Indeed after embryonic genome activation, the embryo destiny is governed by its own transcripts and protein synthesized over time. Therefore, this review begins by highlighting the type and quality of transcripts accumulated or degraded during oogenesis and its impact on the embryo survival. Thereafter, emphasis is given to the transcriptome response of preimplantation embryos to suboptimal culture conditions. In addition, the long term effect of preimplantation culture environment on the transcriptome response embryos/fetus during peri and post implantation has been addressed. Finally, a brief summary of the epigenetic control of culture induced genetic variation of the embryos has been highlighted. Copyright © 2014 Elsevier B.V. All rights reserved.

Suboptimal etravirine activity is common during failure of nevirapine-based combination antiretroviral therapy in a cohort infected with non-B subtype HIV-1.

Science.gov (United States)

Taiwo, Babafemi; Chaplin, Beth; Penugonda, Sudhir; Meloni, Seema; Akanmu, Sulaimon; Gashau, Wadzani; Idoko, John; Adewole, Isaac; Murphy, Robert; Kanki, Phyllis

2010-04-01

The primary objective of this study was to estimate etravirine activity in a cohort of patients infected with non-B subtype HIV-1 and failing nevirapine-based therapy. Genotypic resistance testing was performed if viral load was >OR= 1,000 copies/ml after receiving at least six months of therapy. Suboptimal response to etravirine was predicted by a score >OR= 2.5 on the Tibotec weighting schema, >OR= 4 in the Monogram schema, or classification as high to low-level resistant by a modification of the Stanford HIVdb algorithm (Version 5.1.2). Bivariate and multivariate analyses were conducted to determine the risk factors for suboptimal etravirine activity. The patients (n=91) were receiving nevirapine and lamivudine plus stavudine (57.1%) or zidovudine (42.9%). Median duration of nevirapine exposure was 53 weeks (IQR 46-101 weeks). The most common etravirine resistance associated mutations were Y181C (42.9%), G190A (25.3%), H221Y (19.8%), A98G (18.7%), K101E (16.5%), and V90I (12.1%). Suboptimal etravirine activity was predicted in 47.3 to 56.0%. There were disparities in mutations listed in Tibotec versus Monogram Schemas. Predicted suboptimal activity was not associated with nucleoside reverse transcriptase inhibitor (NRTI) used, gender, pretreatment or current CD4 cell count or viral load, subtype or NRTI mutations. Etravirine has compromised activity in approximately half of the patients failing nevirapine-based first-line treatment in this cohort, which supports guidelines that caution against using it with NRTIs alone in such patients.

Energy expenditures & physical activity in rats with chronic suboptimal nutrition

Directory of Open Access Journals (Sweden)

Lifshitz Fima

2006-01-01

Full Text Available Abstract Background Sub-optimally nourished rats show reduced growth, biochemical and physiological changes. However, no one has assessed metabolic rate adaptations in rats subjected to chronic suboptimal nutrition (CSN. In this study energy expenditure (EE; kcal/100 g body weight and physical activity (PA; oscillations in weight/min/kg body weight were assessed in rats subjected to three levels of CSN. Results Body weight gain was diminished (76.7 ± 12.0 and 61.6 ± 11.0 g in rats fed 70 and 60% of the ad-libitum fed controls which gained more weight (148.5 ± 32.3 g. The rats fed 80% gained weight similarly to controls (136.3 ± 10.5 g. Percent Fat-free body mass was reduced (143.8 ± 8.7 and 142.0 ± 7.6 g in rats fed 70 and 60% of ad-libitum, but not in those fed 80% (200.8 ± 17.5 g as compared with controls (201.6 ± 33.4 g. Body fat (g decreased in rats fed 80% (19.7 ± 5.3, 70% (15.3 ± 3.5 and 60% (9.6 ± 2.7 of ad-libitum in comparison to controls (26.0 ± 6.7. EE and PA were also altered by CSN. The control rats increased their EE and PA during the dark periods by 1.4 ± 0.8 and 1.7 ± 1.1 respectively, as compared with light the period; whereas CSN rats fed 80 and 70% of ad-libitum energy intake had reduced EE and PA during the dark periods as compared with the light period EE(7.5 ± 1.4 and 7.8 ± 0.6 vs. 9.0 ± 1.2 and 9.7 ± 0.8; p Conclusion CSN rats adapt to mild energy restriction by reducing body fat, EE and PA mainly during the dark period while growth proceeds and lean body mass is preserved. At higher levels of energy restrictions there is decreased growth, body fat and lean mass. Moreover EE and PA are also reduced during both light and dark periods.

Using a Card Trick to Teach Discrete Mathematics

Science.gov (United States)

Simonson, Shai; Holm, Tara S.

2003-01-01

We present a card trick that can be used to review or teach a variety of topics in discrete mathematics. We address many subjects, including permutations, combinations, functions, graphs, depth first search, the pigeonhole principle, greedy algorithms, and concepts from number theory. Moreover, the trick motivates the use of computers in…

Sensor-augmented pump therapy lowers HbA(1c) in suboptimally controlled Type 1 diabetes; a randomized controlled trial

NARCIS (Netherlands)

Hermanides, J.; Nørgaard, K.; Bruttomesso, D.; Mathieu, C.; Frid, A.; Dayan, C. M.; Diem, P.; Fermon, C.; Wentholt, I. M. E.; Hoekstra, J. B. L.; DeVries, J. H.

2011-01-01

To investigate the efficacy of sensor-augmented pump therapy vs. multiple daily injection therapy in patients with suboptimally controlled Type 1 diabetes. In this investigator-initiated multi-centre trial (the Eurythmics Trial) in eight outpatient centres in Europe, we randomized 83 patients with

Online evolution for multi-action adversarial games

DEFF Research Database (Denmark)

Justesen, Niels Orsleff; Mahlmann, Tobias; Togelius, Julian

2016-01-01

the combination of atomic actions that make up a single move, with a state evaluation function used for fitness. We implement Online Evolution for the turn-based multi-action game Hero Academy and compare it with a standard Monte Carlo Tree Search implementation as well as two types of greedy algorithms. Online...

High frequency of sub-optimal semen quality in an unselected population of young men

DEFF Research Database (Denmark)

Andersen, A G; Jensen, T K; Carlsen, E

2000-01-01

for military service, this provided a unique opportunity to study the reproductive function in an unbiased population. Altogether 891 young men delivered a blood sample in which reproductive hormones were measured. From 708 of these men data were also obtained on semen quality and testis size. The median sperm...... immotile spermatozoa and follicle stimulating hormone. Possible causes for this high frequency of young men with suboptimal semen quality are obscure and need to be explored. Whether these findings apply for young male populations of comparable countries remains to be seen....

Bad news: The influence of news coverage and Google searches on Gardasil adverse event reporting.

Science.gov (United States)

Faasse, Kate; Porsius, Jarry T; Faasse, Jonathan; Martin, Leslie R

2017-12-14

Human papilloma virus vaccines are a safe and effective tool for reducing HPV infections that can cause cervical cancer. However, uptake of these vaccines has been suboptimal, with many people holding negative beliefs and misconceptions. Such beliefs have been linked with the experience of unpleasant side effects following medical treatment, and media coverage may heighten such concerns. The present study sought to assess the influence of news coverage (number of news articles per month) on adverse event reporting in response to Gardasil vaccination in New Zealand over a 7.5-year period, and whether the influence of news coverage was mediated by internet search activity (Google search volumes). Multiple linear regression analyses and simple mediation analyses were used, controlling for year and number of vaccinations delivered. News coverage in the previous month, and Google search volumes in the same month, were significant predictors of adverse event reporting, after accounting for vaccination rates and year. Concurrent Google search volumes partially mediated the effect of prior news coverage. The results suggest that some of the adverse events reported were not related to the vaccination itself, but to news coverage and internet search volumes, which may have contributed to public concerns about potentially unpleasant or harmful outcomes. These findings have implications for the importance of psychological and social factors in adverse event reporting, and the role of the news media in disseminating health information. Copyright © 2017 Elsevier Ltd. All rights reserved.

Optimal and Suboptimal Finger Selection Algorithms for MMSE Rake Receivers in Impulse Radio Ultra-Wideband Systems

Directory of Open Access Journals (Sweden)

Chiang Mung

2006-01-01

Full Text Available The problem of choosing the optimal multipath components to be employed at a minimum mean square error (MMSE selective Rake receiver is considered for an impulse radio ultra-wideband system. First, the optimal finger selection problem is formulated as an integer programming problem with a nonconvex objective function. Then, the objective function is approximated by a convex function and the integer programming problem is solved by means of constraint relaxation techniques. The proposed algorithms are suboptimal due to the approximate objective function and the constraint relaxation steps. However, they perform better than the conventional finger selection algorithm, which is suboptimal since it ignores the correlation between multipath components, and they can get quite close to the optimal scheme that cannot be implemented in practice due to its complexity. In addition to the convex relaxation techniques, a genetic-algorithm- (GA- based approach is proposed, which does not need any approximations or integer relaxations. This iterative algorithm is based on the direct evaluation of the objective function, and can achieve near-optimal performance with a reasonable number of iterations. Simulation results are presented to compare the performance of the proposed finger selection algorithms with that of the conventional and the optimal schemes.

A Suboptimal Power-Saving Transmission Scheme in Multiple Component Carrier Networks

Science.gov (United States)

Chung, Yao-Liang; Tsai, Zsehong

Power consumption due to transmissions in base stations (BSs) has been a major contributor to communication-related CO2 emissions. A power optimization model is developed in this study with respect to radio resource allocation and activation in a multiple Component Carrier (CC) environment. We formulate and solve the power-minimization problem of the BS transceivers for multiple-CC networks with carrier aggregation, while maintaining the overall system and respective users' utilities above minimum levels. The optimized power consumption based on this model can be viewed as a lower bound of that of other algorithms employed in practice. A suboptimal scheme with low computation complexity is proposed. Numerical results show that the power consumption of our scheme is much better than that of the conventional one in which all CCs are always active, if both schemes maintain the same required utilities.

IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

Science.gov (United States)

Fogle, F. R.

1994-01-01

IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

Risk factors for suboptimal antiretroviral therapy adherence in HIV-infected adolescents in Gaborone, Botswana: a pilot cross-sectional study

Directory of Open Access Journals (Sweden)

Ndiaye M

2013-09-01

Full Text Available Maimouna Ndiaye,1,2 Peter Nyasulu,1 Hoang Nguyen,6,7 Elizabeth D Lowenthal,8,9 Robert Gross,10 Edward J Mills,3 Jean B Nachega4–6 1School of Public Health, Faculty of Health Sciences, University of the Witwatersrand, Johannesburg, South Africa; 2Central Medical Stores, Ministry of Health, Gaborone, Botswana; 3Faculty of Health Sciences, University of Ottawa, Ottawa, Canada; 4Department of Medicine and Centre for Infectious Diseases, Faculty of Medicine and Health Sciences, Stellenbosch University, Cape Town, South Africa; 5Department of Epidemiology, Infectious Disease Epidemiology Research Program, Pittsburgh University Graduate School of Public Health, Pittsburgh, PA, USA; 6Departments of Epidemiology and International Health, Johns Hopkins Bloomberg School of Public Health, Baltimore, MD, USA; 7Tay Ho Clinics, Department of Medicine, Hanoi Health Services, Hanoi, Vietnam; 8Departments of Pediatrics and Biostatistics and Epidemiology, University of Pennsylvania Perelman School of Medicine, Philadelphia, PA, USA; 9Center for Pediatric Clinical Effectiveness, Children’s Hospital of Philadelphia, Philadelphia, PA, USA; 10Departments of Medicine and Biostatistics and Epidemiology, University of Pennsylvania Perelman School of Medicine, Philadelphia, PA, USA Objective: Little is known about factors associated with suboptimal antiretroviral treatment (ART adherence among adolescents in Sub-Saharan Africa. Our objective was to determine the level of ART adherence and predictors of non-adherence among human immunodeficiency virus (HIV-infected adolescents at the Botswana-Baylor Children's Clinical Centre of Excellence in Gaborone, Botswana. Methods: In a cross-sectional study, 82 HIV-infected adolescents receiving ART and their caregivers were administered a structured questionnaire. The patient's clinical information was retrieved from medical records. Outcome measures included excellent pill count ART adherence (>95% and virologic suppression

High prevalence of suboptimal vitamin B12 status in young adult women of South Asian and European ethnicity.

Science.gov (United States)

Quay, Teo A W; Schroder, Theresa H; Jeruszka-Bielak, Marta; Li, Wangyang; Devlin, Angela M; Barr, Susan I; Lamers, Yvonne

2015-12-01

Suboptimal vitamin B12 (B12) status has been associated with an increased risk of congenital anomalies, preterm birth, and childhood insulin resistance. South Asians - Canada's largest minority group - and women of reproductive age are vulnerable to B12 deficiency. This study aimed to assess the prevalence of and factors associated with B12 deficiency and suboptimal B12 status in a convenience sample of young adult women of South Asian and European descent in Metro Vancouver. We measured serum B12, holotranscobalamin, plasma methylmalonic acid, red blood cell and plasma folate, and hematologic parameters in 206 nonpregnant, healthy women aged 19-35 years. Categorization for B12 status adhered to serum B12 cutoffs for deficiency (women is higher than in the general Canadian population. In light of maternal and fetal health risks associated with B12 inadequacy in early-pregnancy, practitioners should consider monitoring B12 status before and during early pregnancy, especially in immigrants and women with low dietary B12 intakes including non-users of vitamin supplements.

Energy expenditures & physical activity in rats with chronic suboptimal nutrition.

Science.gov (United States)

Rising, Russell; Lifshitz, Fima

2006-01-31

Sub-optimally nourished rats show reduced growth, biochemical and physiological changes. However, no one has assessed metabolic rate adaptations in rats subjected to chronic suboptimal nutrition (CSN). In this study energy expenditure (EE; kcal/100 g body weight) and physical activity (PA; oscillations in weight/min/kg body weight) were assessed in rats subjected to three levels of CSN. Body weight gain was diminished (76.7 +/- 12.0 and 61.6 +/- 11.0 g) in rats fed 70 and 60% of the ad-libitum fed controls which gained more weight (148.5 +/- 32.3 g). The rats fed 80% gained weight similarly to controls (136.3 +/- 10.5 g). Percent Fat-free body mass was reduced (143.8 +/- 8.7 and 142.0 +/- 7.6 g) in rats fed 70 and 60% of ad-libitum, but not in those fed 80% (200.8 +/- 17.5 g) as compared with controls (201.6 +/- 33.4 g). Body fat (g) decreased in rats fed 80% (19.7 +/- 5.3), 70% (15.3 +/- 3.5) and 60% (9.6 +/- 2.7) of ad-libitum in comparison to controls (26.0 +/- 6.7). EE and PA were also altered by CSN. The control rats increased their EE and PA during the dark periods by 1.4 +/- 0.8 and 1.7 +/- 1.1 respectively, as compared with light the period; whereas CSN rats fed 80 and 70% of ad-libitum energy intake had reduced EE and PA during the dark periods as compared with the light period EE(7.5 +/- 1.4 and 7.8 +/- 0.6 vs. 9.0 +/- 1.2 and 9.7 +/- 0.8; p vs. 4.1 +/- 0.9 and 2.4 +/- 0.4; p vs. 0.95 +/- 0.03 and 0.91 +/- 0.05 p light (7.1 +/- 1.4) and dark period (6.2 +/- 1.0) EE and PA (3.4 +/- 0.9 and 2.5 +/- 0.5 respectively) were reduced in rats fed 60% of ad-libitum energy intake. CSN rats adapt to mild energy restriction by reducing body fat, EE and PA mainly during the dark period while growth proceeds and lean body mass is preserved. At higher levels of energy restrictions there is decreased growth, body fat and lean mass. Moreover EE and PA are also reduced during both light and dark periods.

Greedy Sampling and Incremental Surrogate Model-Based Tailoring of Aeroservoelastic Model Database for Flexible Aircraft

Science.gov (United States)

Wang, Yi; Pant, Kapil; Brenner, Martin J.; Ouellette, Jeffrey A.

2018-01-01

This paper presents a data analysis and modeling framework to tailor and develop linear parameter-varying (LPV) aeroservoelastic (ASE) model database for flexible aircrafts in broad 2D flight parameter space. The Kriging surrogate model is constructed using ASE models at a fraction of grid points within the original model database, and then the ASE model at any flight condition can be obtained simply through surrogate model interpolation. The greedy sampling algorithm is developed to select the next sample point that carries the worst relative error between the surrogate model prediction and the benchmark model in the frequency domain among all input-output channels. The process is iterated to incrementally improve surrogate model accuracy till a pre-determined tolerance or iteration budget is met. The methodology is applied to the ASE model database of a flexible aircraft currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that the proposed method can reduce the number of models in the original database by 67%. Even so the ASE models obtained through Kriging interpolation match the model in the original database constructed directly from the physics-based tool with the worst relative error far below 1%. The interpolated ASE model exhibits continuously-varying gains along a set of prescribed flight conditions. More importantly, the selected grid points are distributed non-uniformly in the parameter space, a) capturing the distinctly different dynamic behavior and its dependence on flight parameters, and b) reiterating the need and utility for adaptive space sampling techniques for ASE model database compaction. The present framework is directly extendible to high-dimensional flight parameter space, and can be used to guide the ASE model development, model order reduction, robust control synthesis and novel vehicle design of flexible aircraft.

Design of a study on suboptimal cognitive acts in the diagnostic process, the effect on patient outcomes and the influence of workload, fatigue and experience of physician

Directory of Open Access Journals (Sweden)

van der Wal Gerrit

2009-04-01

Full Text Available Abstract Background Diagnostic error is an important error type since diagnostic adverse events are regularly judged as being preventable and the consequences are considered to be severe. Existing research often focuses on either diagnostic adverse events or on the errors in diagnostic reasoning. Whether and when an incorrect diagnostic process results in adverse outcomes has not been studied extensively. The present paper describes the design of a study that aims to study the relationship between a suboptimal diagnostic process and patient outcomes. In addition, the role of personal and circumstantial factors on the quality of the diagnostic process will be examined. Methods/Design The research questions were addressed using several data sources. First, the differential diagnosis was assessed concurrently to the diagnostic process. Second, the patient records of 248 patients suffering from shortness of breath were reviewed by expert internists in order to reveal suboptimal cognitive acts and (potential consequences for the patient. The suboptimal cognitive acts were discussed with the treating physicians and classified with the taxonomy of unsafe acts. Third, workload, fatigue and work experience were measured during the physicians work. Workload and fatigue were measured during the physicians shift using the NASA tlx questionnaire on a handheld computer. Physicians participating in the study also answered questions about their work experience. Discussion The design used in this study provides insight into the relationship between suboptimal cognitive acts in the diagnostic process and possible consequences for the patient. Suboptimal cognitive acts in the diagnostic process and its causes can be revealed. Additional measurements of workload, fatigue and experience allow examining the influence of these factors on the diagnostic process. In conclusion, the present design provides a method with which insights in weaknesses of the diagnostic

The suboptimal structures find the optimal RNAs: homology search for bacterial non-coding RNAsusing suboptimal RNA structures

Czech Academy of Sciences Publication Activity Database

Pánek, Josef; Krásný, Libor; Bobek, Jan; Ježková, E.; Korelusová, Jana; Vohradský, Jiří

-, - (2010), s. 1-9 ISSN 1362-4962 R&D Projects: GA MŠk 2B06065; GA ČR GA303/09/0475; GA ČR GA310/07/1009 Institutional research plan: CEZ:AV0Z50200510 Keywords : ncRNAs * RNA structures Subject RIV: EE - Microbiology, Virology

Effect of stress induced by suboptimal growth factors on survival of Escherichia coli O157:H7.

Science.gov (United States)

Uyttendaele, M; Taverniers, I; Debevere, J

2001-05-21

This study investigated the growth and survival of E. coli O157:H7 exposed to a combination of suboptimal factors (22 degrees C, 7 degrees C, -18 degrees C/0.5% NaCl, 5.0% NaCl/pH 7.0, pH 5.4, pH 4.5/addition of lactic acid) in a simulation medium for red meat (beef gravy). Prolonged survival was noted as the imposed stress was more severe, and as multiple growth factors became suboptimal. At a defined temperature (7 degrees C or -18 degrees C), survival was prolonged at the more acid, more suboptimal pH (pH 4.5 > pH 5.4 > pH 7.0) while at a defined pH (pH 4.5), better survival was observed at 7 degrees C than at 22 degrees C. This suggests that application of the hurdle concept for preservation of food may inhibit outgrowth but induce prolonged survival of E. coli O157:H7 in minimal processed foods. At both 22 degrees C and 7 degrees C, the addition of lactic acid instead of HCl to reduce pH (to pH 4.5) resulted in a more rapid decrease of E. coli O157:H7. High survival was observed in beef gravy, pH 5.4 at -18 degrees C (simulation of frozen meat)-reduction of log 3.0 to log 1.9 after 43 days--and in beef gravy, pH 4.5 and 5% NaCl at 7 degrees C (simulation of a fermented dried meat product kept in refrigeration)--less than 1 log reduction in 43 days. In these circumstances, however, a high degree of sublethal damage of the bacterial cells was noted. The degree of sublethal damage can be estimated from the difference in recovery of the pathogen on the non-selective TSA medium and the selective SMAC medium.

Socioeconomic factors explain suboptimal adherence to antiretroviral therapy among HIV-infected Australian adults with viral suppression.

Directory of Open Access Journals (Sweden)

Krista J Siefried

Full Text Available Missing more than one tablet of contemporary antiretroviral therapy (ART per month increases the risk of virological failure. Recent studies evaluating a comprehensive range of potential risk factors for suboptimal adherence are not available for high-income settings.Adults on ART with undetectable viral load (UDVL were recruited into a national, multi-centre cohort, completing a comprehensive survey assessing demographics, socio-economic indicators, physical health, well-being, life stressors, social supports, HIV disclosure, HIV-related stigma and discrimination, healthcare access, ART regimen, adherence, side effects, costs and treatment beliefs. Baseline data were assessed, and suboptimal adherence was defined as self-reported missing ≥1 ART dose/month over the previous 3-months; associated factors were identified using bivariate and multivariate binary logistic regression.We assessed 522 participants (494 [94.5%] men, mean age = 50.8 years, median duration UDVL = 3.3 years [IQR = 1.2-6.8] at 17 sexual health, hospital, and general practice clinics across Australia. Seventy-eight participants (14.9% reported missing ≥1 dose/month over the previous three months, which was independently associated with: being Australian-born (AOR [adjusted odds ratio] = 2.4 [95%CI = 1.2-4.9], p = 0.014, not being in a relationship (AOR = 3.3 [95%CI = 1.5-7.3], p = 0.004, reaching the "Medicare safety net" (capping annual medical/pharmaceutical costs (AOR = 2.2 [95%CI = 1.1-4.5], p = 0.024, living in subsidised housing (AOR = 2.5 [95%CI = 1.0-6.2], p = 0.045, receiving home-care services (AOR = 4.4 [95%CI = 1.0-18.8], p = 0.046, HIV community/outreach services linkage (AOR = 2.4 [95%CI = 1.1-5.4], p = 0.033, and starting ART following self-request (AOR = 3.0 [95%CI = 1.3-7.0], p = 0.012.In this population, 15% reported recent suboptimal ART adherence at levels associated in prospective studies with subsequent virological failure, despite all having an

Continuous grasp algorithm applied to economic dispatch problem of thermal units

Energy Technology Data Exchange (ETDEWEB)

Vianna Neto, Julio Xavier [Pontifical Catholic University of Parana - PUCPR, Curitiba, PR (Brazil). Undergraduate Program at Mechatronics Engineering; Bernert, Diego Luis de Andrade; Coelho, Leandro dos Santos [Pontifical Catholic University of Parana - PUCPR, Curitiba, PR (Brazil). Industrial and Systems Engineering Graduate Program, LAS/PPGEPS], e-mail: leandro.coelho@pucpr.br

2010-07-01

The economic dispatch problem (EDP) is one of the fundamental issues in power systems to obtain benefits with the stability, reliability and security. Its objective is to allocate the power demand among committed generators in the most economical manner, while all physical and operational constraints are satisfied. The cost of power generation, particularly in fossil fuel plants, is very high and economic dispatch helps in saving a significant amount of revenue. Recently, as an alternative to the conventional mathematical approaches, modern heuristic optimization techniques such as simulated annealing, evolutionary algorithms, neural networks, ant colony, and tabu search have been given much attention by many researchers due to their ability to find an almost global optimal solution in EDPs. On other hand, continuous GRASP (C-GRASP) is a stochastic local search meta-heuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints. Like a greedy randomized adaptive search procedure (GRASP), a C-GRASP is a multi-start procedure where a starting solution for local improvement is constructed in a greedy randomized fashion. The C-GRASP algorithm is validated for a test system consisting of fifteen units, test system that takes into account spinning reserve and prohibited operating zones constrains. (author)

Simplifying a hydrological ensemble prediction system with a backward greedy selection of members – Part 1: Optimization criteria

Directory of Open Access Journals (Sweden)

D. Brochero

2011-11-01

Full Text Available Hydrological Ensemble Prediction Systems (HEPS, obtained by forcing rainfall-runoff models with Meteorological Ensemble Prediction Systems (MEPS, have been recognized as useful approaches to quantify uncertainties of hydrological forecasting systems. This task is complex both in terms of the coupling of information and computational time, which may create an operational barrier. The main objective of the current work is to assess the degree of simplification (reduction of the number of hydrological members that can be achieved with a HEPS configured using 16 lumped hydrological models driven by the 50 weather ensemble forecasts from the European Centre for Medium-range Weather Forecasts (ECMWF. Here, Backward Greedy Selection (BGS is proposed to assess the weight that each model must represent within a subset that offers similar or better performance than a reference set of 800 hydrological members. These hydrological models' weights represent the participation of each hydrological model within a simplified HEPS which would issue real-time forecasts in a relatively short computational time. The methodology uses a variation of the k-fold cross-validation, allowing an optimal use of the information, and employs a multi-criterion framework that represents the combination of resolution, reliability, consistency, and diversity. Results show that the degree of reduction of members can be established in terms of maximum number of members required (complexity of the HEPS or the maximization of the relationship between the different scores (performance.

Suboptimal decision making by children with ADHD in the face of risk

DEFF Research Database (Denmark)

Sørensen, Lin; Sonuga-Barke, Edmund; Eichele, Heike

2017-01-01

Objective: Suboptimal decision making in the face of risk (DMR) in children with attention-deficit hyperactivity disorder (ADHD) may be mediated by deficits in a number of different neuropsychological processes. We investigated DMR in children with ADHD using the Cambridge Gambling Task (CGT......-matched group of typically developing children (n = 34) performed the CGT. Results: As predicted, children with ADHD were not more prone to making risky choices (i.e., risk proneness). However, they had difficulty adjusting to changing risk levels and were more delay aversive-with these 2 effects being...... correlated. Conclusions: Our findings add to the growing body of evidence that children with ADHD do not favor risk taking per se when performing gambling tasks, but rather may lack the cognitive skills or motivational style to appraise changing patterns of risk effectively....

Comparative Study on Feature Selection and Fusion Schemes for Emotion Recognition from Speech

Directory of Open Access Journals (Sweden)

Santiago Planet

2012-09-01

Full Text Available The automatic analysis of speech to detect affective states may improve the way users interact with electronic devices. However, the analysis only at the acoustic level could be not enough to determine the emotion of a user in a realistic scenario. In this paper we analyzed the spontaneous speech recordings of the FAU Aibo Corpus at the acoustic and linguistic levels to extract two sets of features. The acoustic set was reduced by a greedy procedure selecting the most relevant features to optimize the learning stage. We compared two versions of this greedy selection algorithm by performing the search of the relevant features forwards and backwards. We experimented with three classification approaches: Naïve-Bayes, a support vector machine and a logistic model tree, and two fusion schemes: decision-level fusion, merging the hard-decisions of the acoustic and linguistic classifiers by means of a decision tree; and feature-level fusion, concatenating both sets of features before the learning stage. Despite the low performance achieved by the linguistic data, a dramatic improvement was achieved after its combination with the acoustic information, improving the results achieved by this second modality on its own. The results achieved by the classifiers using the parameters merged at feature level outperformed the classification results of the decision-level fusion scheme, despite the simplicity of the scheme. Moreover, the extremely reduced set of acoustic features obtained by the greedy forward search selection algorithm improved the results provided by the full set.

Comparison of heuristic optimization techniques for the enrichment and gadolinia distribution in BWR fuel lattices and decision analysis

International Nuclear Information System (INIS)

Castillo, Alejandro; Martín-del-Campo, Cecilia; Montes-Tadeo, José-Luis; François, Juan-Luis; Ortiz-Servin, Juan-José; Perusquía-del-Cueto, Raúl

2014-01-01

Highlights: • Different metaheuristic optimization techniques were compared. • The optimal enrichment and gadolinia distribution in a BWR fuel lattice was studied. • A decision making tool based on the Position Vector of Minimum Regret was applied. • Similar results were found for the different optimization techniques. - Abstract: In the present study a comparison of the performance of five heuristic techniques for optimization of combinatorial problems is shown. The techniques are: Ant Colony System, Artificial Neural Networks, Genetic Algorithms, Greedy Search and a hybrid of Path Relinking and Scatter Search. They were applied to obtain an “optimal” enrichment and gadolinia distribution in a fuel lattice of a boiling water reactor. All techniques used the same objective function for qualifying the different distributions created during the optimization process as well as the same initial conditions and restrictions. The parameters included in the objective function are the k-infinite multiplication factor, the maximum local power peaking factor, the average enrichment and the average gadolinia concentration of the lattice. The CASMO-4 code was used to obtain the neutronic parameters. The criteria for qualifying the optimization techniques include also the evaluation of the best lattice with burnup and the number of evaluations of the objective function needed to obtain the best solution. In conclusion all techniques obtain similar results, but there are methods that found better solutions faster than others. A decision analysis tool based on the Position Vector of Minimum Regret was applied to aggregate the criteria in order to rank the solutions according to three functions: neutronic grade at 0 burnup, neutronic grade with burnup and global cost which aggregates the computing time in the decision. According to the results Greedy Search found the best lattice in terms of the neutronic grade at 0 burnup and also with burnup. However, Greedy Search is

Robust Adaptive LCMV Beamformer Based On An Iterative Suboptimal Solution

Directory of Open Access Journals (Sweden)

Xiansheng Guo

2015-06-01

Full Text Available The main drawback of closed-form solution of linearly constrained minimum variance (CF-LCMV beamformer is the dilemma of acquiring long observation time for stable covariance matrix estimates and short observation time to track dynamic behavior of targets, leading to poor performance including low signal-noise-ratio (SNR, low jammer-to-noise ratios (JNRs and small number of snapshots. Additionally, CF-LCMV suffers from heavy computational burden which mainly comes from two matrix inverse operations for computing the optimal weight vector. In this paper, we derive a low-complexity Robust Adaptive LCMV beamformer based on an Iterative Suboptimal solution (RAIS-LCMV using conjugate gradient (CG optimization method. The merit of our proposed method is threefold. Firstly, RAIS-LCMV beamformer can reduce the complexity of CF-LCMV remarkably. Secondly, RAIS-LCMV beamformer can adjust output adaptively based on measurement and its convergence speed is comparable. Finally, RAIS-LCMV algorithm has robust performance against low SNR, JNRs, and small number of snapshots. Simulation results demonstrate the superiority of our proposed algorithms.

Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem

Directory of Open Access Journals (Sweden)

J.D. Quintana

2016-12-01

Full Text Available Over the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every simple action that we can think about involves the connection among two or more devices. It is desirable to have a high quality connection among devices, by using electronic or optical signals. Therefore, it is really important to have a reliable connection among terminals in the network. However, the transmission of the signal deteriorates when increasing the distance among devices. There exists a special piece of equipment that we can deploy in a network, called regenerator, which is able to restore the signal transmitted through it, in order to maintain its quality. Deploying a regenerator in a network is generally expensive, so it is important to minimize the number of regenerators used. In this paper we focus on the Generalized Regenerator Location Problem (GRLP, which tries to innd the minimum number of regenerators that must be deployed in a network in order to have a reliable communication without loss of quality. We present a GRASP metaheuristic in order to innd good solutions for the GRLP. The results obtained by the proposal are compared with the best previous methods for this problem. We conduct an extensive computational experience with 60 large and challenging instances, emerging the proposed method as the best performing one. This fact is innally supported by non-parametric statistical tests.

Coadministration of Hedera helix L. Extract Enabled Mice to Overcome Insufficient Protection against Influenza A/PR/8 Virus Infection under Suboptimal Treatment with Oseltamivir.

Science.gov (United States)

Hong, Eun-Hye; Song, Jae-Hyoung; Shim, Aeri; Lee, Bo-Ra; Kwon, Bo-Eun; Song, Hyuk-Hwan; Kim, Yeon-Jeong; Chang, Sun-Young; Jeong, Hyeon Gun; Kim, Jong Geal; Seo, Sang-Uk; Kim, HyunPyo; Kwon, YongSoo; Ko, Hyun-Jeong

2015-01-01

Several anti-influenza drugs that reduce disease manifestation exist, and although these drugs provide clinical benefits in infected patients, their efficacy is limited by the emergence of drug-resistant influenza viruses. In the current study, we assessed the therapeutic strategy of enhancing the antiviral efficacy of an existing neuraminidase inhibitor, oseltamivir, by coadministering with the leaf extract from Hedera helix L, commonly known as ivy. Ivy extract has anti-inflammatory, antibacterial, antifungal, and antihelminthic properties. In the present study, we investigated its potential antiviral properties against influenza A/PR/8 (PR8) virus in a mouse model with suboptimal oseltamivir that mimics a poor clinical response to antiviral drug treatment. Suboptimal oseltamivir resulted in insufficient protection against PR8 infection. Oral administration of ivy extract with suboptimal oseltamivir increased the antiviral activity of oseltamivir. Ivy extract and its compounds, particularly hedrasaponin F, significantly reduced the cytopathic effect in PR8-infected A549 cells in the presence of oseltamivir. Compared with oseltamivir treatment alone, coadministration of the fraction of ivy extract that contained the highest proportion of hedrasaponin F with oseltamivir decreased pulmonary inflammation in PR8-infected mice. Inflammatory cytokines and chemokines, including tumor necrosis factor-alpha and chemokine (C-C motif) ligand 2, were reduced by treatment with oseltamivir and the fraction of ivy extract. Analysis of inflammatory cell infiltration in the bronchial alveolar of PR8-infected mice revealed that CD11b+Ly6G+ and CD11b+Ly6Cint cells were recruited after virus infection; coadministration of the ivy extract fraction with oseltamivir reduced infiltration of these inflammatory cells. In a model of suboptimal oseltamivir treatment, coadministration of ivy extract fraction that includes hedrasaponin F increased protection against PR8 infection that could be

Coadministration of Hedera helix L. Extract Enabled Mice to Overcome Insufficient Protection against Influenza A/PR/8 Virus Infection under Suboptimal Treatment with Oseltamivir.

Directory of Open Access Journals (Sweden)

Eun-Hye Hong

Full Text Available Several anti-influenza drugs that reduce disease manifestation exist, and although these drugs provide clinical benefits in infected patients, their efficacy is limited by the emergence of drug-resistant influenza viruses. In the current study, we assessed the therapeutic strategy of enhancing the antiviral efficacy of an existing neuraminidase inhibitor, oseltamivir, by coadministering with the leaf extract from Hedera helix L, commonly known as ivy. Ivy extract has anti-inflammatory, antibacterial, antifungal, and antihelminthic properties. In the present study, we investigated its potential antiviral properties against influenza A/PR/8 (PR8 virus in a mouse model with suboptimal oseltamivir that mimics a poor clinical response to antiviral drug treatment. Suboptimal oseltamivir resulted in insufficient protection against PR8 infection. Oral administration of ivy extract with suboptimal oseltamivir increased the antiviral activity of oseltamivir. Ivy extract and its compounds, particularly hedrasaponin F, significantly reduced the cytopathic effect in PR8-infected A549 cells in the presence of oseltamivir. Compared with oseltamivir treatment alone, coadministration of the fraction of ivy extract that contained the highest proportion of hedrasaponin F with oseltamivir decreased pulmonary inflammation in PR8-infected mice. Inflammatory cytokines and chemokines, including tumor necrosis factor-alpha and chemokine (C-C motif ligand 2, were reduced by treatment with oseltamivir and the fraction of ivy extract. Analysis of inflammatory cell infiltration in the bronchial alveolar of PR8-infected mice revealed that CD11b+Ly6G+ and CD11b+Ly6Cint cells were recruited after virus infection; coadministration of the ivy extract fraction with oseltamivir reduced infiltration of these inflammatory cells. In a model of suboptimal oseltamivir treatment, coadministration of ivy extract fraction that includes hedrasaponin F increased protection against PR8

[Effects of different NO3--N/NH4+-N ratios on cucumber seedlings growth, nitrogen absorption and metabolism under suboptimal temperature and light intensity].

Science.gov (United States)

Zhang, Xiao Cui; Liu, Yu Mei; Bai, Long Qiang; He, Chao Xing; Yu, Xian Chang; Li, Yan Su

2016-08-01

Cucumber (cv. Zhongnong 26) was used as material, the effects of NO 3 - -N/NH 4 + -N ratios on growth and physiological characteristics of cucumber seedlings under suboptimal temperature and light intensity (18 ℃/10 ℃,180 ± 20 μmol·m -2 ·s -1 ) were studied. Total nitrogen in the nutrient solution was equal and three NO 3 - -N/NH 4 + -N ratios, 26:2, 21:7 and 14:14, were applied as treatments. The results showed that cucumber treated by NO 3 - -N/NH 4 + -N=21:7 had the longest total root length, the biggest root volume and root surface area, and the maximum number of root tips. H + -ATPase activity and relative expression of genes encoding nitrate transporter (NRT) and ammonium transporter (AMT) in cucumber roots were increased significantly by the treatment of NO 3 - -N/NH 4 + -N=21:7. In addition, nitrate reductase (NR), glutamine synthetase (GS) and glutamate synthase (GOGAT) in cucumber leaves under the treatment of NO 3 - -N/NH 4 + -N=21:7 were higher. As a result, the nitrogen content and biomass of cucumber were significantly increased. Compared with the plants under the treatment of NO 3 - -N/NH 4 + -N=26:2 or 14:14, cucumber seedlings under the treatment of NO 3 - -N/NH 4 + -N=21:7 had the highest biomass and total dry mass (DM) which were increased by 14.0% and 19.3% respectively under suboptimal temperature and light intensity. In conclusion, under suboptimal environmental conditions, NO 3 - -N/NH 4 + -N ratio could be adjusted to increase nitrogen absorption and metabolism of cucumber and alleviate the de-trimental effects caused by suboptimal conditions and promoted the cucumber growth.

Pilot study on the additive effects of berberine and oral type 2 diabetes agents for patients with suboptimal glycemic control

Directory of Open Access Journals (Sweden)

Di Pierro F

2012-07-01

Full Text Available Francesco Di Pierro,1 Nicola Villanova,2 Federica Agostini,2 Rebecca Marzocchi,2 Valentina Soverini,2 Giulio Marchesini21Scientific Department, Velleja Research, Milano, 2Diseases of Metabolism, S Orsola Malpighi Hospital, Bologna, ItalyBackground: Suboptimal glycemic control is a common situation in diabetes, regardless of the wide range of drugs available to reach glycemic targets. Basic research in diabetes is endeavoring to identify new actives working as insulin savers, use of which could delay the introduction of injectable insulin or reduce the insulin dose needed. Commonly available as a nutraceutical, berberine is a potential candidate.Methods and results: Because its low oral bioavailability can be overcome by P-glycoprotein inhibitors like herbal polyphenols, we have tested the nutraceutical combination of Berberis aristata extract and Silybum marianum extract (Berberol® in type 2 diabetes in terms of its additive effect when combined with a conventional oral regimen for patients with suboptimal glycemic control. After 90 days of treatment, the nutraceutical association had a positive effect on glycemic and lipid parameters, significantly reducing glycosylated hemoglobin, basal insulin, homeostatic model assessment of insulin resistance, total and low-density lipoprotein cholesterol, and triglycerides. A relevant effect was also observed in terms of liver function by measuring aspartate transaminase and alanine transaminase. The product had a good safety profile, with distinctive gastrointestinal side effects likely due to its acarbose-like action.Conclusion: Although further studies should be carried out to confirm our data, Berberol could be considered a good candidate as an adjunctive treatment option in diabetes, especially in patients with suboptimal glycemic control.Keywords: berberine, silymarin, glycosylated hemoglobin, diabetes

Sustainable Scheduling of Cloth Production Processes by Multi-Objective Genetic Algorithm with Tabu-Enhanced Local Search

Directory of Open Access Journals (Sweden)

Rui Zhang

2017-09-01

Full Text Available The dyeing of textile materials is the most critical process in cloth production because of the strict technological requirements. In addition to the technical aspect, there have been increasing concerns over how to minimize the negative environmental impact of the dyeing industry. The emissions of pollutants are mainly caused by frequent cleaning operations which are necessary for initializing the dyeing equipment, as well as idled production capacity which leads to discharge of unconsumed chemicals. Motivated by these facts, we propose a methodology to reduce the pollutant emissions by means of systematic production scheduling. Firstly, we build a three-objective scheduling model that incorporates both the traditional tardiness objective and the environmentally-related objectives. A mixed-integer programming formulation is also provided to accurately define the problem. Then, we present a novel solution method for the sustainable scheduling problem, namely, a multi-objective genetic algorithm with tabu-enhanced iterated greedy local search strategy (MOGA-TIG. Finally, we conduct extensive computational experiments to investigate the actual performance of the MOGA-TIG. Based on a fair comparison with two state-of-the-art multi-objective optimizers, it is concluded that the MOGA-TIG is able to achieve satisfactory solution quality within tight computational time budget for the studied scheduling problem.

Optimization of Transformation Coefficients Using Direct Search and Swarm Intelligence

Directory of Open Access Journals (Sweden)

Manusov V.Z.

2017-04-01

Full Text Available This research considers optimization of tap position of transformers in power systems to reduce power losses. Now, methods based on heuristic rules and fuzzy logic, or methods that optimize parts of the whole system separately, are applied to this problem. The first approach requires expert knowledge about processes in the network. The second methods are not able to consider all the interrelations of system’s parts, while changes in segment affect the entire system. Both approaches are tough to implement and require adjustment to the tasks solved. It needs to implement algorithms that can take into account complex interrelations of optimized variables and self-adapt to optimization task. It is advisable to use algorithms given complex interrelations of optimized variables and independently adapting from optimization tasks. Such algorithms include Swarm Intelligence algorithms. Their main features are self-organization, which allows them to automatically adapt to conditions of tasks, and the ability to efficiently exit from local extremes. Thus, they do not require specialized knowledge of the system, in contrast to fuzzy logic. In addition, they can efficiently find quasi-optimal solutions converging to the global optimum. This research applies Particle Swarm Optimization algorithm (PSO. The model of Tajik power system used in experiments. It was found out that PSO is much more efficient than greedy heuristics and more flexible and easier to use than fuzzy logic. PSO allows reducing active power losses from 48.01 to 45.83 MW (4.5%. With al, the effect of using greedy heuristics or fuzzy logic is two times smaller (2.3%.

Work-Recreation Balance, Health-Promoting Lifestyles and Suboptimal Health Status in Southern China: A Cross-Sectional Study

OpenAIRE

Wu, Shengwei; Xuan, Zhengzheng; Li, Fei; Xiao, Wei; Fu, Xiuqiong; Jiang, Pingping; Chen, Jieyu; Xiang, Lei; Liu, Yanyan; Nie, Xiaoli; Luo, Ren; Sun, Xiaomin; Kwan, Hiuyee; Zhao, Xiaoshan

2016-01-01

Suboptimal health status (SHS)—an intermediate state between health and illness—refers to functional somatic symptoms that are medically undiagnosed. Although SHS has become a great challenge for global public health, very little about its etiology and mechanisms are known. Work-recreation balance is a part of work−life balance, and is related to stress which greatly influences health status. We therefore carried out a cross-sectional investigation between 2012 and 2013 within a clustered sam...

Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks.

Science.gov (United States)

Han, Yongkoo; Park, Kisung; Hong, Jihye; Ulamin, Noor; Lee, Young-Koo

2015-07-27

The κ-Nearest Neighbors ( κNN) query is an important spatial query in mobile sensor networks. In this work we extend κNN to include a distance constraint, calling it a l-distant κ-nearest-neighbors (l-κNN) query, which finds the κ sensor nodes nearest to a query point that are also at or greater distance from each other. The query results indicate the objects nearest to the area of interest that are scattered from each other by at least distance l. The l-κNN query can be used in most κNN applications for the case of well distributed query results. To process an l-κNN query, we must discover all sets of κNN sensor nodes and then find all pairs of sensor nodes in each set that are separated by at least a distance l. Given the limited battery and computing power of sensor nodes, this l-κNN query processing is problematically expensive in terms of energy consumption. In this paper, we propose a greedy approach for l-κNN query processing in mobile sensor networks. The key idea of the proposed approach is to divide the search space into subspaces whose all sides are l. By selecting κ sensor nodes from the other subspaces near the query point, we guarantee accurate query results for l-κNN. In our experiments, we show that the proposed method exhibits superior performance compared with a post-processing based method using the κNN query in terms of energy efficiency, query latency, and accuracy.

Differences in the association between sickness absence and long-term sub-optimal health by occupational position: a 14-year follow-up in the GAZEL cohort.

Science.gov (United States)

Ferrie, Jane E; Kivimäki, Mika; Westerlund, Hugo; Head, Jenny; Melchior, Maria; Singh-Manoux, Archana; Zins, Marie; Goldberg, Marcel; Alexanderson, Kristina; Vahtera, Jussi

2011-10-01

Although sickness absence is a strong predictor of health, whether this association varies by occupational position has rarely been examined. The aim of this study was to investigate overall and diagnosis-specific sickness absence as a predictor of future long-term sub-optimal health by occupational position. This was a prospective occupational cohort study of 15 320 employees (73% men) aged 37-51. Sickness absences (1990-1992), included in 13 diagnostic categories, were examined by occupational position in relation to self-rated health measured annually during 1993-2006. 60% of employees in higher occupational positions and 22% in lower positions had no sickness absence. Conversely, 9.5% of employees in higher positions and 40% in lower positions had over 30 sick-leave days. Repeated-measures logistic regression analyses adjusted for age, sex and chronic disease showed employees with over 30 days absence, compared to those with no absence, had approximately double the risk of sub-optimal health over the 14-year follow-up in all occupational positions. 1-30 days sick-leave was associated with greater odds of sub-optimal health in the high (OR 1.48; 95% CI 1.27 to 1.72) and intermediate (1.29; 1.15 to 1.45) but not lower occupational positions (1.06; 0.82 to 1.38). Differences by occupational position in the association between sickness absence in 13 specific diagnostic categories and sub-optimal health over the ensuing 14 years were limited to stronger associations observed with cancer and mental disorders in the higher occupational positions. The association between sickness absence of more than 30 days over 3 years and future long-term self-rated health appears to differ little by occupational position.

The design and content of orthodontic practise websites in the UK is suboptimal and does not correlate with search ranking.

Science.gov (United States)

Patel, Annika; Cobourne, Martyn T

2015-08-01

This study investigated standards of ethical advertising; design and content; and information quality associated with UK dental practice websites offering orthodontic treatment. The World Wide Web was searched from a UK-based computer using the Google search engine combined with the term 'orthodontic braces'. The first 100 UK-based dental practice websites were pooled and saved following duplicate removal. Websites were evaluated for compliance with current General Dental Council ethical advertising guidelines; accessibility, usability, and reliability using the LIDA instrument (a validated outcome tool for healthcare website design and content evaluation); and quality of information using the DISCERN toolkit (a validated method of quality assessment for online written patient information). Nine per cent of websites demonstrated full compliance with current guidelines on ethical advertising. Mean total LIDA score was 110/144 (76%) [range: 51-135; 35-94%]. Eleven websites reached a gold standard of 90% or more for total LIDA score. Mean total DISCERN score was 48/75 (64%) [range: 19-73; 25-97%]. Five websites achieved a total DISCERN score above 90%. Spearman's rank correlation coefficients demonstrated no significant correlations between LIDA (0.1669; P = 0.4252, confidence interval [CI]: -0.2560 to 0.5362) or DISCERN (0.3572; P = 0.0796, CI: -0.0565 to 0.663) score and ranking amongst the 25 highest ranked websites. Most UK websites offering orthodontic services are not fully compliant with national guidelines relating to ethical advertising. Validated measures of website design (LIDA) and information quality (DISCERN) showed wide variation amongst sites. No correlation existed between ranking amongst the highest 25 sites and either of these measures. This investigation was limited to a subsample of UK-only websites; and whilst not representative of European-wide sites, it does suggest that in the UK at least website quality can be improved. © The Author 2014

The effect of plant-based diet and suboptimal environmental conditions on digestive function and diet-induced enteropathy in rainbow trout (Oncorhynchus mykiss)

NARCIS (Netherlands)

Mosberian-Tanha, P.; Schrama, J.W.; Landsverk, T.; Mydland, L.T.; Øverland, M.

2018-01-01

This experiment investigated intestinal enteropathy and digestive function of rainbow trout challenged with soybean meal-based diet (SBM) at optimal or suboptimal environments created by normal or reduced water flow, respectively. Oxygen level remained above 7 mg L-1 for optimal environment and

Application of the tuning algorithm with the least squares approximation to the suboptimal control algorithm for integrating objects

Science.gov (United States)

Kuzishchin, V. F.; Merzlikina, E. I.; Van Va, Hoang

2017-11-01

The problem of PID and PI-algorithms tuning by means of the approximation by the least square method of the frequency response of a linear algorithm to the sub-optimal algorithm is considered. The advantage of the method is that the parameter values are obtained through one cycle of calculation. Recommendations how to choose the parameters of the least square method taking into consideration the plant dynamics are given. The parameters mentioned are the time constant of the filter, the approximation frequency range and the correction coefficient for the time delay parameter. The problem is considered for integrating plants for some practical cases (the level control system in a boiler drum). The transfer function of the suboptimal algorithm is determined relating to the disturbance that acts in the point of the control impact input, it is typical for thermal plants. In the recommendations it is taken into consideration that the overregulation for the transient process when the setpoint is changed is also limited. In order to compare the results the systems under consideration are also calculated by the classical method with the limited frequency oscillation index. The results given in the paper can be used by specialists dealing with tuning systems with the integrating plants.

A low-volume polyethylene glycol solution was associated with an increased suboptimal bowel preparation rate but had similar recommendations for an early repeat colonoscopy, procedure times, and adenoma detection rates.

Directory of Open Access Journals (Sweden)

Sam C Hankins

Full Text Available Low-volume polyethylene glycol (PEG bowel preparations are better tolerated by patients than high-volume preparations and may achieve similar preparation quality. However, there is little data comparing their effects on a recommendation for an early repeat colonoscopy (because of a suboptimal preparation, procedure times, adenoma detection rate (ADR, and advanced adenoma detection rate (AADR.This is a retrospective cohort study of outpatient colonoscopies performed during a one-year period at a single academic medical center in which low-volume MoviPrep® (n = 1841 or high-volume Colyte® (n = 1337 was used. All preparations were split-dosed. Appropriate covariates were included in regression models assessing suboptimal preparation quality (fair, poor, or inadequate, procedure times, recommendation for an early repeat colonoscopy, ADR, and AADR.MoviPrep® was associated with an increase in having a suboptimal bowel preparation (OR 1.36; 95% CI: 1.06-1.76, but it was not associated with differences in insertion (p = 0.43, withdrawal (p = 0.22, or total procedure times (p = 0.10. The adjusted percentage with a suboptimal preparation was 11.7% for patients using MoviPrep® and 8.8% for patients using Colyte®. MoviPrep® was not associated with a significant difference in overall ADR (OR 0.93; 95% CI: 0.78-1.11, AADR (OR 1.18; 95% CI: 0.87-1.62, or recommendation for early repeat colonoscopy (OR 1.16; 95% CI: 0.72-1.88.MoviPrep® was associated with a small absolute increase in having a suboptimal preparation, but did not affect recommendations for an early repeat colonoscopy, procedure times, or adenoma detection rates. Mechanisms to reduce financial barriers limiting low-volume preparations should be considered because of their favorable tolerability profile.

[Associations between health-promoting lifestyle and suboptimal health status in Guangdong: a cross sectional study].

Science.gov (United States)

Chen, Jie-Yu; Yang, Le-Bin; Jiang, Ping-Ping; Sun, Xiao-Min; Yu, Ke-Qiang; Li, Fei; Wu, Sheng-Wei; Ji, Yan-Zhao; Zhao, Xiao-Shan; Luo, Ren

2016-04-01

To investigate associations between health-promoting lifestyle and suboptimal health status (SHS) in the population of Guangdong province. A cross-sectional survey was conducted in a clustered sample of 24 159 individuals aged 12-80 years from 2012 to 2013. Health-promoting lifestyle was assessed via the Health-Promoting Lifestyle Profile (HPLP-II), and SHS was evaluated using the medical examination report and Sub-health Measurement Scale V1.0 (SHMS V1.0). Of the 24159 participants, subjects with SHS (46.0%) and disease status (35.2%) accounted for a much higher percentage than healthy subjects (18.8%). Regression analyses revealed a significant association between health status and healthy lifestyle (PUnhealthy lifestyle was an important risk factor for SHS and disease, especially the former. Compared with the participants with a healthy lifestyle (minimal exposure), after demographic adjustment, subjects with a 'poor' lifestyle (maximal exposure) were at a 43 times higher risk of developing SHS (OR: 42.825, 95% CI: 30.567-59.997), those with a general lifestyle were at a 21 times higher risk of SHS (OR: 21.072, 95%CI: 17.258-25.729), and those with a suboptimal lifestyle had a 4 times higher risk (OR: 4.085, 95%CI: 3.352-4.979). In the general population, the major risk factors for SHS included poor stress management, poor self-actualization, inactive exercise and poor interpersonal relationship. s Unhealthy lifestyles are significantly related to an increased risk of SHS. Intervention of unhealthy lifestyles, controlling the risk factors of SHS, and rigorous management of the time window of SHS are necessary to promote the heath status.

Adaptive suboptimal second-order sliding mode control for microgrids

Science.gov (United States)

Incremona, Gian Paolo; Cucuzzella, Michele; Ferrara, Antonella

2016-09-01

This paper deals with the design of adaptive suboptimal second-order sliding mode (ASSOSM) control laws for grid-connected microgrids. Due to the presence of the inverter, of unpredicted load changes, of switching among different renewable energy sources, and of electrical parameters variations, the microgrid model is usually affected by uncertain terms which are bounded, but with unknown upper bounds. To theoretically frame the control problem, the class of second-order systems in Brunovsky canonical form, characterised by the presence of matched uncertain terms with unknown bounds, is first considered. Four adaptive strategies are designed, analysed and compared to select the most effective ones to be applied to the microgrid case study. In the first two strategies, the control amplitude is continuously adjusted, so as to arrive at dominating the effect of the uncertainty on the controlled system. When a suitable control amplitude is attained, the origin of the state space of the auxiliary system becomes attractive. In the other two strategies, a suitable blend between two components, one mainly working during the reaching phase, the other being the predominant one in a vicinity of the sliding manifold, is generated, so as to reduce the control amplitude in steady state. The microgrid system in a grid-connected operation mode, controlled via the selected ASSOSM control strategies, exhibits appreciable stability properties, as proved theoretically and shown in simulation.

A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case

Directory of Open Access Journals (Sweden)

Sami Faiz

2014-06-01

Full Text Available The Capacitated Vehicle Routing Problem (CVRP is a well known optimization problem applied in numerous applications. It consists of delivering items to some geographically dispersed customers using a set of vehicles operating from a single depot. As the CVRP is known to be NP-hard, approximate methods perform well when generating promising sub-optimal solutions in a reasonable computation time. In this paper, we develop a Decision Support System (DSS for solving the CVRP that integrates a Geographical Information System (GIS enriched by a Tabu search (TS module. In order to demonstrate the performance of the proposed DSS in terms of CPU runtime and minimized traveled distance, we apply it on a large-sized real case. The results are then highlighted in a cartographic format using Google Maps.

Mejoras de las Heurísticas Greedy empleadas en el secuenciamiento de los Sistemas de Producción Multi-modelo y Multi-nivel

Directory of Open Access Journals (Sweden)

Juan José Areal Alonso

2013-04-01

Full Text Available Resumen: El problema de secuenciamiento de los sistemas de producción multi-modelo y multi-nivel reside en el alisado de las tasas de producción de los productos finales y también de las tasas de consumo de los diversos subconjuntos y elementos empleados en las etapas previas de producción. Las secuencias deben construirse de acuerdo a las opciones de cada producto, que requieren diferentes recursos y tiempo de producción, siendo el objetivo evitar sobrepasar el potencial de la instalación y de los medios humanos. Este artículo se desarrolla a partir del método Goal-chasing, que es una heurística Greedy desarrollada por Toyota para resolver este problema y que es ampliamente utilizado en la industria del automóvil. El artículo propone una mejora de dicho método con la introducción de pesos diferentes para cada opción con el fin de mejorar el ordenamiento de la secuencia. Profundizando en esta vía, se aplica el método Nelder-Mead de optimización no lineal para obtener los pesos de opciones que minimizan el coste de la secuencia resultante. Los resultados obtenidos aplicando los algoritmos a sistemas de producción multi-modelo y multi-nivel se concretan en el mundo del automóvil para una secuencia inicial, se generalizan a un conjunto de 30 secuencias representativas del entorno industrial del automóvil y se contrastan con referencias clásicas de la literatura. Abstract: The Car Sequencing Problem consists in maintaining a certain order in the vehicles as they pass through the assembly line. Sequences have to be built according to each vehicle's options, each one requiring different resources and production time, with the objective of avoiding to exceed the maximum human and facility potential. In this paper, we use a Greedy heuristic, the Goal-chasing method developed by Toyota, to solve the Car Sequencing Problem. The concept of different weights for each option is introduced to improve the ordering of the sequence. Nelder

Effects of feeding frequency on apparent energy and nutrient digestibility/availability of channel catfish, Ictalurus punctatus, reared at optimal and suboptimal temperatures

Science.gov (United States)

This study examined the effects of feeding frequency (daily versus every other day [EOD]) on nutrient digestibility/availability of channel catfish, Ictalurus punctatus, reared at optimal (30 C) and suboptimal (24 C) temperatures. A 28% protein practical diet was used as the test diet, and chromic o...

Optimal Achievable Encoding for Brain Machine Interface

Science.gov (United States)

2017-12-22

dictionary-based encoding approach to translate a visual image into sequential patterns of electrical stimulation in real time , in a manner that...including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and...networks, and by applying linear decoding to complete recorded populations of retinal ganglion cells for the first time . Third, we developed a greedy

Quasi-Maximum-Likelihood Detector Based on Geometrical Diversification Greedy Intensification

OpenAIRE

Nafkha , Amor; Boutillon , Emmanuel; Roland , Christian

2009-01-01

IEEE Transactions On Communications, vol. 57, n°4, pp. 926-929, April 2009.; International audience; The ML detection used in many communication applications reduces down to solving an integer least-squares problem, which minimizes an objective function. If the matrix is not orthogonal, this problem is NP-hard. An exhaustive search over all feasible solutions is thus only applicable when the dimension of the problem is low. In the literature, there are two main available classes of methods. T...

Suboptimal vitamin D status in a population-based study of Asian children: prevalence and relation to allergic diseases and atopy.

Directory of Open Access Journals (Sweden)

Tsung-Chieh Yao

Full Text Available BACKGROUND: New evidence shows high prevalence of vitamin D deficiency in many countries and some studies suggest a possible link between vitamin D status and allergic diseases. The objectives of this study were to determine the prevalence of suboptimal vitamin D status in a population sample of Asian children and to investigate the relationship of vitamin D status with allergic diseases and atopy. METHODS: Children aged 5-18 years (N = 1315 in the Prediction of Allergies in Taiwanese CHildren (PATCH study were evaluated using questionnaires, anthropometric measurements, and serum levels of 25-hydroxyvitamin D [25(OHD] and total and specific immunoglobulin E (IgE. RESULTS: The mean concentration of serum 25(OHD was 20.4 ng/mL (SD: 7.1 ng/mL. Vitamin D deficiency (defined as serum 25(OHD0.05. CONCLUSIONS: Low serum 25(OHD levels are remarkably common in this population sample of Asian children, suggesting that millions of children living in Taiwan may have suboptimal levels of vitamin D, which should be a matter of public health concern. Our results provides epidemiological evidence against the association of vitamin D status with various allergic diseases and atopy in Asian children.

Fast Solution in Sparse LDA for Binary Classification

Science.gov (United States)

Moghaddam, Baback

2010-01-01

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic

Dynamic Request Routing for Online Video-on-Demand Service: A Markov Decision Process Approach

Directory of Open Access Journals (Sweden)

Jianxiong Wan

2014-01-01

Full Text Available We investigate the request routing problem in the CDN-based Video-on-Demand system. We model the system as a controlled queueing system including a dispatcher and several edge servers. The system is formulated as a Markov decision process (MDP. Since the MDP formulation suffers from the so-called “the curse of dimensionality” problem, we then develop a greedy heuristic algorithm, which is simple and can be implemented online, to approximately solve the MDP model. However, we do not know how far it deviates from the optimal solution. To address this problem, we further aggregate the state space of the original MDP model and use the bounded-parameter MDP (BMDP to reformulate the system. This allows us to obtain a suboptimal solution with a known performance bound. The effectiveness of two approaches is evaluated in a simulation study.

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel.

Science.gov (United States)

Sakin, Sayef Azad; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Alamri, Atif; Tran, Nguyen H; Fortino, Giancarlo

2017-12-07

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

A novel structured dictionary for fast processing of 3D medical images, with application to computed tomography restoration and denoising

Science.gov (United States)

Karimi, Davood; Ward, Rabab K.

2016-03-01

Sparse representation of signals in learned overcomplete dictionaries has proven to be a powerful tool with applications in denoising, restoration, compression, reconstruction, and more. Recent research has shown that learned overcomplete dictionaries can lead to better results than analytical dictionaries such as wavelets in almost all image processing applications. However, a major disadvantage of these dictionaries is that their learning and usage is very computationally intensive. In particular, finding the sparse representation of a signal in these dictionaries requires solving an optimization problem that leads to very long computational times, especially in 3D image processing. Moreover, the sparse representation found by greedy algorithms is usually sub-optimal. In this paper, we propose a novel two-level dictionary structure that improves the performance and the speed of standard greedy sparse coding methods. The first (i.e., the top) level in our dictionary is a fixed orthonormal basis, whereas the second level includes the atoms that are learned from the training data. We explain how such a dictionary can be learned from the training data and how the sparse representation of a new signal in this dictionary can be computed. As an application, we use the proposed dictionary structure for removing the noise and artifacts in 3D computed tomography (CT) images. Our experiments with real CT images show that the proposed method achieves results that are comparable with standard dictionary-based methods while substantially reducing the computational time.

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel

Directory of Open Access Journals (Sweden)

Sayef Azad Sakin

2017-12-01

Full Text Available Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

Lack of supportive leadership behavior predicts suboptimal self-rated health independent of job strain after 10 years of follow-up: findings from the population-based MONICA/KORA study.

Science.gov (United States)

Schmidt, Burkhard; Herr, Raphael M; Jarczok, Marc N; Baumert, Jens; Lukaschek, Karoline; Emeny, Rebecca T; Ladwig, Karl-Heinz

2018-04-23

Emerging cross-sectional research has identified lack of supportive leadership behavior (SLB) as a risk factor for workforce health. However, prospective evidence is hitherto lacking. SLB denotes support in difficult situations, recognition and feedback on work tasks. This study aims to determine the effect of SLB on suboptimal self-rated health (SRH) after 10 years considering potential moderators such as ages, sex, occupation and job strain. The sample included 884 employed participants drawn from the population-based prospective MONICA/KORA Study. SLB, SRH, as well as job strain were assessed by questionnaire. Logistic regressions estimated odds ratios (ORs) and corresponding 95% confidence intervals (CIs) for the effect of SLB at baseline on suboptimal SRH at follow-up. Analyses were adjusted for age, gender, lifestyle (alcohol, smoking, physical activity), socioeconomic status as well as for SRH and job strain at baseline. Lack of SLB was associated with suboptimal SRH at baseline [OR 2.00, (95% CI 1.19-3.46)] and at follow-up [OR 2.33, (95% CI 1.40-3.89)]. Additional adjustment for job strain did not substantially alter this association [OR 2.06, (95% CI 1.20-3.52)]. However, interactions between SLB and job strain as well as gender became evident, indicating moderating influences on the association between SLB and SRH. Lack of supportive leadership was associated with suboptimal SRH at 10 years' follow-up in men, even if SRH at baseline and other risk factors were taken into account. This effect is likely to be moderated by job strain.

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

Science.gov (United States)

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.

Bone marrow concentrate promotes bone regeneration with a suboptimal-dose of rhBMP-2.

Science.gov (United States)

Egashira, Kazuhiro; Sumita, Yoshinori; Zhong, Weijian; I, Takashi; Ohba, Seigo; Nagai, Kazuhiro; Asahina, Izumi

2018-01-01

Bone marrow concentrate (BMC), which is enriched in mononuclear cells (MNCs) and platelets, has recently attracted the attention of clinicians as a new optional means for bone engineering. We previously reported that the osteoinductive effect of bone morphogenetic protein-2 (BMP-2) could be enhanced synergistically by co-transplantation of peripheral blood (PB)-derived platelet-rich plasma (PRP). This study aims to investigate whether BMC can effectively promote bone formation induced by low-dose BMP-2, thereby reducing the undesirable side-effects of BMP-2, compared to PRP. Human BMC was obtained from bone marrow aspirates using an automated blood separator. The BMC was then seeded onto β-TCP granules pre-adsorbed with a suboptimal-dose (minimum concentration to induce bone formation at 2 weeks in mice) of recombinant human (rh) BMP-2. These specimens were transplanted subcutaneously to the dorsal skin of immunodeficient-mice and the induction of ectopic bone formation was assessed 2 and 4 weeks post-transplantation. Transplantations of five other groups [PB, PRP, platelet-poor plasma (PPP), bone marrow aspirate (BM), and BM-PPP] were employed as experimental controls. Then, to clarify the effects on vertical bone augmentation, specimens from the six groups were transplanted for on-lay placement on the craniums of mice. The results indicated that BMC, which contained an approximately 2.5-fold increase in the number of MNCs compared to PRP, could accelerate ectopic bone formation until 2 weeks post-transplantation. On the cranium, the BMC group promoted bone augmentation with a suboptimal-dose of rhBMP-2 compared to other groups. Particularly in the BMC specimens harvested at 4 weeks, we observed newly formed bone surrounding the TCP granules at sites far from the calvarial bone. In conclusion, the addition of BMC could reduce the amount of rhBMP-2 by one-half via its synergistic effect on early-phase osteoinduction. We propose here that BMC transplantation

Smart Images Search based on Visual Features Fusion

International Nuclear Information System (INIS)

Saad, M.H.

2013-01-01

Image search engines attempt to give fast and accurate access to the wide range of the huge amount images available on the Internet. There have been a number of efforts to build search engines based on the image content to enhance search results. Content-Based Image Retrieval (CBIR) systems have achieved a great interest since multimedia files, such as images and videos, have dramatically entered our lives throughout the last decade. CBIR allows automatically extracting target images according to objective visual contents of the image itself, for example its shapes, colors and textures to provide more accurate ranking of the results. The recent approaches of CBIR differ in terms of which image features are extracted to be used as image descriptors for matching process. This thesis proposes improvements of the efficiency and accuracy of CBIR systems by integrating different types of image features. This framework addresses efficient retrieval of images in large image collections. A comparative study between recent CBIR techniques is provided. According to this study; image features need to be integrated to provide more accurate description of image content and better image retrieval accuracy. In this context, this thesis presents new image retrieval approaches that provide more accurate retrieval accuracy than previous approaches. The first proposed image retrieval system uses color, texture and shape descriptors to form the global features vector. This approach integrates the yc b c r color histogram as a color descriptor, the modified Fourier descriptor as a shape descriptor and modified Edge Histogram as a texture descriptor in order to enhance the retrieval results. The second proposed approach integrates the global features vector, which is used in the first approach, with the SURF salient point technique as local feature. The nearest neighbor matching algorithm with a proposed similarity measure is applied to determine the final image rank. The second approach

Lansoprazole induces sensitivity to suboptimal doses of paclitaxel in human melanoma.

Science.gov (United States)

Azzarito, Tommaso; Venturi, Giulietta; Cesolini, Albino; Fais, Stefano

2015-01-28

Tumor acidity is now considered an important determinant of drug-resistance and tumor progression, and anti-acidic approaches, such as Proton Pump inhibitors (PPIs), have demonstrated promising antitumor and chemo-sensitizing efficacy. The main purpose of the present study was to evaluate the possible PPI-induced sensitization of human melanoma cells to Paclitaxel (PTX). Our results show that PTX and the PPI Lansoprazole (LAN) combination was extremely efficient against metastatic melanoma cells, as compared to the single treatments, both in vitro and in vivo. We also showed that acidity plays an important role on the anti-tumor activity of these drugs, being detrimental for PTX activity, while crucial for the synergistic effect of PTX following pretreatment with LAN, due to its nature of pro-drug needing protonation for a full activation. We obtained straightforward results in a human melanoma xenograft model combining well tolerated LAN doses with suboptimal and poorly toxic doses of PTX. With this study we provide a clear evidence that the PPI LAN may be included in new combined therapy of human melanoma together with low doses of PTX. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

Traditional Chinese medicine and new concepts of predictive, preventive and personalized medicine in diagnosis and treatment of suboptimal health.

Science.gov (United States)

Wang, Wei; Russell, Alyce; Yan, Yuxiang

2014-02-13

The premise of disease-related phenotypes is the definition of the counterpart normality in medical sciences. Contrary to clinical practices that can be carefully planned according to clinical needs, heterogeneity and uncontrollability is the essence of humans in carrying out health studies. Full characterization of consistent phenotypes that define the general population is the basis to individual difference normalization in personalized medicine. Self-claimed normal status may not represent health because asymptomatic subjects may carry chronic diseases at their early stage, such as cancer, diabetes mellitus and atherosclerosis. Currently, treatments for non-communicable chronic diseases (NCD) are implemented after disease onset, which is a very much delayed approach from the perspective of predictive, preventive and personalized medicine (PPPM). A NCD pandemic will develop and be accompanied by increased global economic burden for healthcare systems throughout both developed and developing countries. This paper examples the characterization of the suboptimal health status (SHS) which represents a new PPPM challenge in a population with ambiguous health complaints such as general weakness, unexplained medical syndrome (UMS), chronic fatigue syndrome (CFS), myalgic encephalomyelitis (ME), post-viral fatigue syndrome (PVFS) and chronic fatigue immune dysfunction syndrome (CFIDS). We applied clinical informatic approaches and developed a questionnaire-suboptimal health status questionnaire-25 (SHSQ-25) for measuring SHS. The validity and reliability of this approach were evaluated in a small pilot study and then in a cross-sectional study of 3,405 participants in China. We found a correlation between SHS and systolic blood pressure, diastolic blood pressure, plasma glucose, total cholesterol and high-density lipoprotein (HDL) cholesterol among men, and a correlation between SHS and systolic blood pressure, diastolic blood pressure, total cholesterol, triglycerides

Suboptimal Weight Loss and Weight Regain after Gastric Bypass Surgery?Postoperative Status of Energy Intake, Eating Behavior, Physical Activity, and Psychometrics

OpenAIRE

Amundsen, Tina; Str?mmen, Magnus; Martins, Catia

2016-01-01

BACKGROUND: Suboptimal weight loss (SWL) and weight regain (WR) after gastric bypass surgery (GB) remains poorly understood. OBJECTIVES: This study aims to compare GB patients experiencing SWL or significant WR (SigWR) with successful controls, regarding postoperative food intake, eating behavior, physical activity (PA), and psychometrics. METHODS: Forty-nine patients with >1 year post-surgery were classified as either experiencing SWL (excess body weight loss, EWL,

Patterns of marijuana and tobacco use associated with suboptimal self-rated health among US adult ever users of marijuana

OpenAIRE

Tsai, James; Rolle, Italia V.; Singh, Tushar; Boulet, Sheree L.; McAfee, Timothy A.; Grant, Althea M.

2017-01-01

The purpose of this study was to examine the patterns of marijuana and tobacco use and their associations with suboptimal self-rated health (SRH) among US adults who reported ?ever, even once, using marijuana or hashish.? Data came from the 2009?2012 National Health and Nutrition Examination Survey, restricting to respondents aged 20 years and older who reported using marijuana at least once in their lifetime (n?=?3,210). We assessed the age-adjusted prevalence of mutually exclusive groups of...

Pilot study on the additive effects of berberine and oral type 2 diabetes agents for patients with suboptimal glycemic control

OpenAIRE

Di Pierro, Francesco; Villanova,Nicola; Agostini,Federica; Soverini,Valentina; Marchesini,Giulio; Marzocchi,Rebecca

2012-01-01

Francesco Di Pierro,1 Nicola Villanova,2 Federica Agostini,2 Rebecca Marzocchi,2 Valentina Soverini,2 Giulio Marchesini21Scientific Department, Velleja Research, Milano, 2Diseases of Metabolism, S Orsola Malpighi Hospital, Bologna, ItalyBackground: Suboptimal glycemic control is a common situation in diabetes, regardless of the wide range of drugs available to reach glycemic targets. Basic research in diabetes is endeavoring to identify new actives working as insulin savers, use of which coul...

Puzzles, paradoxes, and problem solving an introduction to mathematical thinking

CERN Document Server

Reba, Marilyn A

2014-01-01

Graphs: Puzzles and Optimization Graphical Representation and Search Greedy Algorithms and Dynamic Programming Shortest Paths, DNA Sequences, and GPS Systems Routing Problems and Optimal Circuits Traveling Salesmen and Optimal Orderings Vertex Colorings and Edge Matchings Logic: Rational Inference and Computer Circuits Inductive and Deductive Arguments Deductive Arguments and Truth-Tables Deductive Arguments and Derivations Deductive Logic and Equivalence Modeling Using Deductive Logic Probability: Predictions and Expectations Probability and Counting Counting and Unordered Outcomes Independen

A hybrid heuristic algorithm for the open-pit-mining operational planning problem.

OpenAIRE

Souza, Marcone Jamilson Freitas; Coelho, Igor Machado; Ribas, Sabir; Santos, Haroldo Gambini; Merschmann, Luiz Henrique de Campos

2010-01-01

This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NPhard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Varia...

Heuristics for NP-hard optimization problems - simpler is better!?

Directory of Open Access Journals (Sweden)

Žerovnik Janez

2015-11-01

Full Text Available We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

Use of recommended search strategies in systematic reviews and the impact of librarian involvement: a cross-sectional survey of recent authors.

Science.gov (United States)

Koffel, Jonathan B

2015-01-01

Previous research looking at published systematic reviews has shown that their search strategies are often suboptimal and that librarian involvement, though recommended, is low. Confidence in the results, however, is limited due to poor reporting of search strategies the published articles. To more accurately measure the use of recommended search methods in systematic reviews, the levels of librarian involvement, and whether librarian involvement predicts the use of recommended methods. A survey was sent to all authors of English-language systematic reviews indexed in the Database of Abstracts of Reviews of Effects (DARE) from January 2012 through January 2014. The survey asked about their use of search methods recommended by the Institute of Medicine, Cochrane Collaboration, and the Agency for Healthcare Research and Quality and if and how a librarian was involved in the systematic review. Rates of use of recommended methods and librarian involvement were summarized. The impact of librarian involvement on use of recommended methods was examined using a multivariate logistic regression. 1560 authors completed the survey. Use of recommended search methods ranged widely from 98% for use of keywords to 9% for registration in PROSPERO and were generally higher than in previous studies. 51% of studies involved a librarian, but only 64% acknowledge their assistance. Librarian involvement was significantly associated with the use of 65% of recommended search methods after controlling for other potential predictors. Odds ratios ranged from 1.36 (95% CI 1.06 to 1.75) for including multiple languages to 3.07 (95% CI 2.06 to 4.58) for using controlled vocabulary. Use of recommended search strategies is higher than previously reported, but many methods are still under-utilized. Librarian involvement predicts the use of most methods, but their involvement is under-reported within the published article.

The Effect of Testosterone Topical Solution in Hypogonadal Men With Suboptimal Response to a Topical Testosterone Gel.

Science.gov (United States)

Burns, Patrick R; Kim, Edward D; Ruff, Dustin D; Seftel, Allen D

2018-05-01

This study evaluated the effect of axillary administration of a 2% testosterone solution (Axiron ® ) in hypogonadal (HGN) men who had had a suboptimal response to treatment with a commercially available topical testosterone gel. HGN men averaging 57 years old, with a mean body mass index of 31.9 kg/m 2 and median baseline testosterone level (T-level) of 185.2 ng/dL, who had failed to reach normal T-levels with a topical testosterone gel (Androgel 1.62%, Androgel, Testim, or Fortesta) were treated with a 2% testosterone solution until T-levels reached a normal range (from ≥300 to ≤1,050 ng/dL) or for up to 9 weeks. Outcomes included the cumulative percentage of men with a serum T-level in the normal range during treatment with Axiron and improvement in symptoms of low energy level and low sexual drive. During the study, 95% of HGN men (72/78) attained a T-level in the normal range. The median T-level at endpoint was 495.7 ng/dL, a threefold increase over baseline, p levels within the first 2 weeks of treatment. In a post hoc analysis, all subjects with baseline body mass indexes >35 kg/m 2 ( n = 19) achieved T-levels in the normal range. Prior to treatment, over 61% of subjects (48/78) reported impairment in either energy level or sexual drive. After treatment (or testosterone normalization), energy level improved in 75% of subjects and sexual drive improved in 70%. Topical 2% testosterone solution is a safe and effective treatment for HGN men who have had a suboptimal response to previous treatment with topical testosterone gels.

Suboptimal Regulation of a Class of Bilinear Interconnected Systems with Finite-Time Sliding Planning Horizons

Directory of Open Access Journals (Sweden)

M. de la Sen

2008-01-01

Full Text Available This paper focuses on the suboptimization of a class of multivariable discrete-time bilinear systems consisting of interconnected bilinear subsystems with respect to a linear quadratic optimal regulation criterion which involves the use of state weighting terms only. Conditions which ensure the controllability of the overall system are given as a previous requirement for optimization. Three transformations of variables are made on the system equations in order to implement the scheme on an equivalent linear system. This leads to an equivalent representation of the used quadratic performance index that involves the appearance of quadratic weighting terms related to both transformed input and state variables. In this way, a Riccati-matrix sequence, allowing the synthesis of a standard feedback control law, is obtained. Finally, the proposed control scheme is tested on realistic examples.

AMT1;1 transgenic rice plants with enhanced NH4(+) permeability show superior growth and higher yield under optimal and suboptimal NH4(+) conditions.

Science.gov (United States)

Ranathunge, Kosala; El-Kereamy, Ashraf; Gidda, Satinder; Bi, Yong-Mei; Rothstein, Steven J

2014-03-01

The major source of nitrogen for rice (Oryza sativa L.) is ammonium (NH4(+)). The NH4(+) uptake of roots is mainly governed by membrane transporters, with OsAMT1;1 being a prominent member of the OsAMT1 gene family that is known to be involved in NH4(+) transport in rice plants. However, little is known about its involvement in NH4(+) uptake in rice roots and subsequent effects on NH4(+) assimilation. This study shows that OsAMT1;1 is a constitutively expressed, nitrogen-responsive gene, and its protein product is localized in the plasma membrane. Its expression level is under the control of circadian rhythm. Transgenic rice lines (L-2 and L-3) overexpressing the OsAMT1;1 gene had the same root structure as the wild type (WT). However, they had 2-fold greater NH4(+) permeability than the WT, whereas OsAMT1;1 gene expression was 20-fold higher than in the WT. Analogous to the expression, transgenic lines had a higher NH4(+) content in the shoots and roots than the WT. Direct NH4(+) fluxes in the xylem showed that the transgenic lines had significantly greater uptake rates than the WT. Higher NH4(+) contents also promoted higher expression levels of genes in the nitrogen assimilation pathway, resulting in greater nitrogen assimilates, chlorophyll, starch, sugars, and grain yield in transgenic lines than in the WT under suboptimal and optimal nitrogen conditions. OsAMT1;1 also enhanced overall plant growth, especially under suboptimal NH4(+) levels. These results suggest that OsAMT1;1 has the potential for improving nitrogen use efficiency, plant growth, and grain yield under both suboptimal and optimal nitrogen fertilizer conditions.

AMT1;1 transgenic rice plants with enhanced NH4 + permeability show superior growth and higher yield under optimal and suboptimal NH4 + conditions

Science.gov (United States)

Rothstein, Steven J.

2014-01-01

The major source of nitrogen for rice (Oryza sativa L.) is ammonium (NH4 +). The NH4 + uptake of roots is mainly governed by membrane transporters, with OsAMT1;1 being a prominent member of the OsAMT1 gene family that is known to be involved in NH4 + transport in rice plants. However, little is known about its involvement in NH4 + uptake in rice roots and subsequent effects on NH4 + assimilation. This study shows that OsAMT1;1 is a constitutively expressed, nitrogen-responsive gene, and its protein product is localized in the plasma membrane. Its expression level is under the control of circadian rhythm. Transgenic rice lines (L-2 and L-3) overexpressing the OsAMT1;1 gene had the same root structure as the wild type (WT). However, they had 2-fold greater NH4 + permeability than the WT, whereas OsAMT1;1 gene expression was 20-fold higher than in the WT. Analogous to the expression, transgenic lines had a higher NH4 + content in the shoots and roots than the WT. Direct NH4 + fluxes in the xylem showed that the transgenic lines had significantly greater uptake rates than the WT. Higher NH4 + contents also promoted higher expression levels of genes in the nitrogen assimilation pathway, resulting in greater nitrogen assimilates, chlorophyll, starch, sugars, and grain yield in transgenic lines than in the WT under suboptimal and optimal nitrogen conditions. OsAMT1;1 also enhanced overall plant growth, especially under suboptimal NH4 + levels. These results suggest that OsAMT1;1 has the potential for improving nitrogen use efficiency, plant growth, and grain yield under both suboptimal and optimal nitrogen fertilizer conditions. PMID:24420570

A greedy method for reconstructing polycrystals from three-dimensional X-ray diffraction data

DEFF Research Database (Denmark)

Kulshreshth, Arun Kumar; Alpers, Andreas; Herman, Gabor T.

2009-01-01

An iterative search method is proposed for obtaining orientation maps inside polycrystals from three-dimensional X-ray diffraction (3DXRD) data. In each step, detector pixel intensities are calculated by a forward model based on the current estimate of the orientation map. The pixel at which...

Effects of Suboptimally Presented Erotic Pictures on Moral Judgments: A Cross-Cultural Comparison.

Directory of Open Access Journals (Sweden)

Antonio Olivera-La Rosa

Full Text Available Previous research has identified a set of core factors that influence moral judgments. The present study addresses the interplay between moral judgments and four factors: (a incidental affects, (b sociocultural context, (c type of dilemma, and (d participant's sex. We asked participants in two different countries (Colombia and Spain to judge the acceptability of actions in response to personal and impersonal moral dilemmas. Before each dilemma an affective prime (erotic, pleasant or neutral pictures was presented suboptimally. Our results show that: a relative to neutral priming, erotic primes increase the acceptance of harm for a greater good (i.e., more utilitarian judgments, b relative to Colombians, Spanish participants rated causing harm as less acceptable, c relative to impersonal dilemmas, personal dilemmas reduced the acceptance of harm, and d relative to men, women were less likely to consider harm acceptable. Our results are congruent with findings showing that sex is a crucial factor in moral cognition, and they extend previous research by showing the interaction between culture and incidental factors in the making of moral judgments.

Effects of Suboptimally Presented Erotic Pictures on Moral Judgments: A Cross-Cultural Comparison.

Science.gov (United States)

Olivera-La Rosa, Antonio; Corradi, Guido; Villacampa, Javier; Martí-Vilar, Manuel; Arango, Olber Eduardo; Rosselló, Jaume

2016-01-01

Previous research has identified a set of core factors that influence moral judgments. The present study addresses the interplay between moral judgments and four factors: (a) incidental affects, (b) sociocultural context, (c) type of dilemma, and (d) participant's sex. We asked participants in two different countries (Colombia and Spain) to judge the acceptability of actions in response to personal and impersonal moral dilemmas. Before each dilemma an affective prime (erotic, pleasant or neutral pictures) was presented suboptimally. Our results show that: a) relative to neutral priming, erotic primes increase the acceptance of harm for a greater good (i.e., more utilitarian judgments), b) relative to Colombians, Spanish participants rated causing harm as less acceptable, c) relative to impersonal dilemmas, personal dilemmas reduced the acceptance of harm, and d) relative to men, women were less likely to consider harm acceptable. Our results are congruent with findings showing that sex is a crucial factor in moral cognition, and they extend previous research by showing the interaction between culture and incidental factors in the making of moral judgments.

An Aircraft Service Staff Rostering using a Hybrid GRASP Algorithm

OpenAIRE

Cho, Vincent; Wu, Gene Pak Kit; Ip, W.H.

2009-01-01

The aircraft ground service company is responsible for carrying out the regular tasks to aircraft maintenace between their arrival at and departure from the airport. This paper presents the application of a hybrid approach based upon greedy randomized adaptive search procedure (GRASP) for rostering technical staff such that they are assigned predefined shift patterns. The rostering of staff is posed as an optimization problem with an aim of minimizing the violations of hard and soft constrain...

The Search Performance Evaluation and Prediction in Exploratory Search

OpenAIRE

LIU, FEI

2016-01-01

The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...

One visual search, many memory searches: An eye-tracking investigation of hybrid search.

Science.gov (United States)

Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M

2017-09-01

Suppose you go to the supermarket with a shopping list of 10 items held in memory. Your shopping expedition can be seen as a combination of visual search and memory search. This is known as "hybrid search." There is a growing interest in understanding how hybrid search tasks are accomplished. We used eye tracking to examine how manipulating the number of possible targets (the memory set size [MSS]) changes how observers (Os) search. We found that dwell time on each distractor increased with MSS, suggesting a memory search was being executed each time a new distractor was fixated. Meanwhile, although the rate of refixation increased with MSS, it was not nearly enough to suggest a strategy that involves repeatedly searching visual space for subgroups of the target set. These data provide a clear demonstration that hybrid search tasks are carried out via a "one visual search, many memory searches" heuristic in which Os examine items in the visual array once with a very low rate of refixations. For each item selected, Os activate a memory search that produces logarithmic response time increases with increased MSS. Furthermore, the percentage of distractors fixated was strongly modulated by the MSS: More items in the MSS led to a higher percentage of fixated distractors. Searching for more potential targets appears to significantly alter how Os approach the task, ultimately resulting in more eye movements and longer response times.

The paradoxical effect of low reward probabilities in suboptimal choice.

Science.gov (United States)

Fortes, Inês; Pinto, Carlos; Machado, Armando; Vasconcelos, Marco

2018-04-01

When offered a choice between 2 alternatives, animals sometimes prefer the option yielding less food. For instance, pigeons and starlings prefer an option that on 20% of the trials presents a stimulus always followed by food, and on the remaining 80% of the trials presents a stimulus never followed by food (the Informative Option), over an option that provides food on 50% of the trials regardless of the stimulus presented (the Noninformative Option). To explain this suboptimal behavior, it has been hypothesized that animals ignore (or do not engage with) the stimulus that is never followed by food in the Informative Option. To assess when pigeons attend to the stimulus usually not followed by food, we increased the probability of reinforcement, p, in the presence of that stimulus. Across 2 experiments, we found that the value of the Informative Option decreased with p. To account for the results, we added to the Reinforcement Rate Model (and also to the Hyperbolic Discounting Model) an engagement function, f(p), that specified the likelihood the animal attends to a stimulus followed by reward with probability p, and then derived the model predictions for 2 forms of f(p), a linear function, and an all-or-none threshold function. Both models predicted the observed findings with a linear engagement function: The higher the probability of reinforcement after a stimulus, the higher the probability of engaging the stimulus, and, surprisingly, the less the value of the option comprising the stimulus. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Fecal bulk, energy intake, and serum cholesterol: regression response of serum cholesterol to apparent digestibility of dry matter and suboptimal energy intake in rats on fiber-fat diet.

Science.gov (United States)

Normani, M Z; Hussain, S S; Lim, J K; Albrink, M J; Gunnells, C K; Davis, G K

1981-10-01

Two experiments were conducted in the rat to determine the relationships of serum cholesterol (SC, mg/dl), apparent digestibility of dry matter (DDM, %), and digested energy intake (DE, kcal/day) at suboptimal level of energy. The energies in diet and feces were determined by calorimetry. DE as percentage of the National Research Council requirement (DE%) was suboptimal (70 to 85%). The experiments had four to five isofibrous diets, and no fiber diets, supplemented with 0.2% crystalline cholesterol (CChol). Animals in experiment 1 were fed varying amounts of feed with 18% coconut oil in the diets where as these in experiment 2 were given fixed amounts of feed with either 6 or 18% oil. The following regressions (p less than 0.001) for SC were found: experiment 1: -1157.7 -5.97 DDM +105.5 CCI -1.48 CCI2 (r2 0.35), where CCI = CChol, mg/day; -1888.4 -2.66 DE +120.97 CCI -1.62 CCI2 (r2 0.37). Experiment 2: 762.99 -6.15 DDM -0.8 fat cal % -0.87DE% (r2 0.31), where fat cal % = fat calories % of DE. Data indicate that at suboptimal energy intake, SC was inversely related to (1) DDM, (2) fat cal, and (3) total energy intake. Liver cholesterol lowering effect of the dietary fiber was also observed. The above findings help to elucidate various conflicting reports related to diet and blood cholesterol.

SearchResultFinder: federated search made easy

NARCIS (Netherlands)

Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up

Accuracy of weight loss information in Spanish search engine results on the internet.

Science.gov (United States)

Cardel, Michelle I; Chavez, Sarah; Bian, Jiang; Peñaranda, Eribeth; Miller, Darci R; Huo, Tianyao; Modave, François

2016-11-01

To systematically assess the quality of online information related to weight loss that Spanish speakers in the U.S. are likely to access. This study evaluated the accessibility and quality of information for websites that were identified from weight loss queries in Spanish and compared this with previously published results in English. The content was scored with respect to five dimensions: nutrition, physical activity, behavior, pharmacotherapy, and surgical recommendations. Sixty-six websites met eligibility criteria (21 commercial, 24 news/media, 10 blogs, 0 medical/government/university, 11 unclassified sites). Of 16 possible points, mean content quality score was 3.4 (SD = 2.0). Approximately 1.5% of sites scored greater than 8 (out of 12) on nutrition, physical activity, and behavior. Unsubstantiated claims were made on 94% of the websites. Content quality scores varied significantly by type of website (P searches is suboptimal and relatively worse than weight loss information accessed in English, suggesting that U.S. Spanish speakers accessing weight loss information online may be provided with incomplete and inaccurate information. © 2016 The Obesity Society.

Sorting through search results: a content analysis of HPV vaccine information online.

Science.gov (United States)

Madden, Kelly; Nan, Xiaoli; Briones, Rowena; Waks, Leah

2012-05-28

Surveys have shown that many people now turn to the Internet for health information when making health-related decisions. This study systematically analyzed the HPV vaccine information returned by online search engines. HPV is the most common sexually transmitted disease and is the leading cause of cervical cancers. We conducted a content analysis of 89 top search results from Google, Yahoo, Bing, and Ask.com. The websites were analyzed with respect to source, tone, information related to specific content analyzed through the lens of the Health Belief Model, and in terms of two content themes (i.e., conspiracy theories and civil liberties). The relations among these aspects of the websites were also explored. Most websites were published by nonprofit or academic sources (34.8%) and governmental agencies (27.4%) and were neutral in tone (57.3%), neither promoting nor opposing the HPV vaccine. Overall, the websites presented suboptimal or inaccurate information related to the five behavioral predictors stipulated in the Health Belief Model. Questions related to civil liberties were present on some websites. Health professionals designing online communication with the intent of increasing HPV vaccine uptake should take care to include information about the risks of HPV, including susceptibility and severity. Additionally, websites should include information about the benefits of the vaccine (i.e., effective against HPV), low side effects as a barrier that can be overcome, and ways in which to receive the vaccine to raise individual self-efficacy. Copyright © 2011 Elsevier Ltd. All rights reserved.

Open meta-search with OpenSearch: a case study

OpenAIRE

O'Riordan, Adrian P.

2007-01-01

The goal of this project was to demonstrate the possibilities of open source search engine and aggregation technology in a Web environment by building a meta-search engine which employs free open search engines and open protocols. In contrast many meta-search engines on the Internet use proprietary search systems. The search engines employed in this case study are all based on the OpenSearch protocol. OpenSearch-compliant systems support XML technologies such as RSS and Atom for aggregation a...

A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

Directory of Open Access Journals (Sweden)

Mário Mestria

2016-04-01

Full Text Available ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP. Hybrid Heuristic algorithm uses several variable neighborhood structures combining the intensification (using local search operators and diversification (constructive heuristic and perturbation routine. In the CTSP, the vertices are partitioned into clusters and all vertices of each cluster have to be visited contiguously. The CTSP is -hard since it includes the well-known Traveling Salesman Problem (TSP as a special case. Our hybrid heuristic is compared with three heuristics from the literature and an exact method. Computational experiments are reported for different classes of instances. Experimental results show that the proposed hybrid heuristic obtains competitive results within reasonable computational time.

Heuristics for the economic dispatch problem

Energy Technology Data Exchange (ETDEWEB)

Flores, Benjamin Carpio [Centro Nacional de Controle de Energia (CENACE), Mexico, D.F. (Mexico). Dept. de Planificacion Economica de Largo Plazo], E-mail: benjamin.carpo@cfe.gob.mx; Laureano Cruces, A L; Lopez Bracho, R; Ramirez Rodriguez, J. [Universidad Autonoma Metropolitana (UAM), Mexico, D.F. (Brazil). Dept. de Sistemas], Emails: clc@correo.azc.uam.mx, rlb@correo.azc.uam.mx, jararo@correo.azc.uam.mx

2009-07-01

This paper presents GRASP (Greedy Randomized Adaptive Search Procedure), Simulated Annealing (SAA), Genetic (GA), and Hybrid Genetic (HGA) Algorithms for the economic dispatch problem (EDP), considering non-convex cost functions and dead zones the only restrictions, showing the results obtained. We also present parameter settings that are specifically applicable to the EDP, and a comparative table of results for each heuristic. It is shown that these methods outperform the classical methods without the need to assume convexity of the target function. (author)

A heuristic algorithm for a multi-product four-layer capacitated location-routing problem

Directory of Open Access Journals (Sweden)

Mohsen Hamidi

2014-01-01

Full Text Available The purpose of this study is to solve a complex multi-product four-layer capacitated location-routing problem (LRP in which two specific constraints are taken into account: 1 plants have limited production capacity, and 2 central depots have limited capacity for storing and transshipping products. The LRP represents a multi-product four-layer distribution network that consists of plants, central depots, regional depots, and customers. A heuristic algorithm is developed to solve the four-layer LRP. The heuristic uses GRASP (Greedy Randomized Adaptive Search Procedure and two probabilistic tabu search strategies of intensification and diversification to tackle the problem. Results show that the heuristic solves the problem effectively.

Search Patterns

CERN Document Server

Morville, Peter

2010-01-01

What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

Personalized Search

CERN Document Server

AUTHOR|(SzGeCERN)749939

2015-01-01

As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

Parametric optimization of ultrasonic machining process using gravitational search and fireworks algorithms

Directory of Open Access Journals (Sweden)

Debkalpa Goswami

2015-03-01

Full Text Available Ultrasonic machining (USM is a mechanical material removal process used to erode holes and cavities in hard or brittle workpieces by using shaped tools, high-frequency mechanical motion and an abrasive slurry. Unlike other non-traditional machining processes, such as laser beam and electrical discharge machining, USM process does not thermally damage the workpiece or introduce significant levels of residual stress, which is important for survival of materials in service. For having enhanced machining performance and better machined job characteristics, it is often required to determine the optimal control parameter settings of an USM process. The earlier mathematical approaches for parametric optimization of USM processes have mostly yielded near optimal or sub-optimal solutions. In this paper, two almost unexplored non-conventional optimization techniques, i.e. gravitational search algorithm (GSA and fireworks algorithm (FWA are applied for parametric optimization of USM processes. The optimization performance of these two algorithms is compared with that of other popular population-based algorithms, and the effects of their algorithm parameters on the derived optimal solutions and computational speed are also investigated. It is observed that FWA provides the best optimal results for the considered USM processes.

Mastering Search Analytics Measuring SEO, SEM and Site Search

CERN Document Server

Chaters, Brent

2011-01-01

Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt

Search Help

Science.gov (United States)

Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

Tales from the Field: Search Strategies Applied in Web Searching

Directory of Open Access Journals (Sweden)

Soohyung Joo

2010-08-01

Full Text Available In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on the findings, the authors further discuss how to enhance web-based information retrieval (IR systems to support each type of search strategy.

A comparison of performance measures for online algorithms

DEFF Research Database (Denmark)

Boyar, Joan; Irani, Sandy; Larsen, Kim Skak

2009-01-01

is to balance greediness and adaptability. We examine how these measures evaluate the Greedy Algorithm and Lazy Double Coverage, commonly studied algorithms in the context of server problems. We examine Competitive Analysis, the Max/Max Ratio, the Random Order Ratio, Bijective Analysis and Relative Worst Order...... Analysis and determine how they compare the two algorithms. We find that by the Max/Max Ratio and Bijective Analysis, Greedy is the better algorithm. Under the other measures Lazy Double Coverage is better, though Relative Worst Order Analysis indicates that Greedy is sometimes better. Our results also...... provide the first proof of optimality of an algorithm under Relative Worst Order Analysis....

Internet Search Engines

OpenAIRE

Fatmaa El Zahraa Mohamed Abdou

2004-01-01

A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

University Students' Online Information Searching Strategies in Different Search Contexts

Science.gov (United States)

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

2012-01-01

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

Massive fungal biodiversity data re-annotation with multi-level clustering

DEFF Research Database (Denmark)

Vu, D.; Szoke, S.; Wiwie, Christian

2014-01-01

With the availability of newer and cheaper sequencing methods, genomic data are being generated at an increasingly fast pace. In spite of the high degree of complexity of currently available search routines, the massive number of sequences available virtually prohibits quick and correct identific...... for clustering. An implementation of the algorithm allowed clustering of all 344,239 ITS (Internal Transcribed Spacer) fungal sequences from GenBank utilizing only a normal desktop computer within 22 CPU-hours whereas the greedy clustering method took up to 242 CPU-hours....

A GRASP model in network design for two-stage supply chain

Directory of Open Access Journals (Sweden)

Hassan Javanshir

2011-04-01

Full Text Available We consider a capacitated facility location problem (CFLP which contains a production facility and distribution centers (DCs supplying retailers' demand. The primary purpose is to locate distribution centres in the network and the objective is the minimization of the sum of fixed facility location, pipeline inventory, safety stock and lost sales. We use Greedy randomized adaptive search procedures (GRASP to solve the model. The preliminary results indicate that the proposed method of this paper could provide competitive results in reasonable amount time.

INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

OpenAIRE

Fadhilah Mat Yamin; T. Ramayah

2013-01-01

The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...

Sunk cost and work ethic effects reflect suboptimal choice between different work requirements.

Science.gov (United States)

Magalhães, Paula; White, K Geoffrey

2013-03-01

We investigated suboptimal choice between different work requirements in pigeons (Columba livia), namely the sunk cost effect, an irrational tendency to persist with an initial investment, despite the availability of a better option. Pigeons chose between two keys, one with a fixed work requirement to food of 20 pecks (left key), and the other with a work requirement to food which varied across conditions (center key). On some trials within each session, such choices were preceded by an investment of 35 pecks on the center key, whereas on others they were not. On choice trials preceded by the investment, the pigeons tended to stay and complete the schedule associated with the center key, even when the number of pecks to obtain reward was greater than for the concurrently available left key. This result indicates that pigeons, like humans, commit the sunk cost effect. With higher work requirements, this preference was extended to trials where there was no initial investment, so an overall preference for the key associated with more work was evident, consistent with the work ethic effect. We conclude that a more general work ethic effect is amplified by the effect of the prior investment, that is, the sunk cost effect. Copyright © 2013 Elsevier B.V. All rights reserved.

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

Science.gov (United States)

Nahum, Yoav

2008-02-01

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

Children's Search Engines from an Information Search Process Perspective.

Science.gov (United States)

Broch, Elana

2000-01-01

Describes cognitive and affective characteristics of children and teenagers that may affect their Web searching behavior. Reviews literature on children's searching in online public access catalogs (OPACs) and using digital libraries. Profiles two Web search engines. Discusses some of the difficulties children have searching the Web, in the…

How Users Search the Library from a Single Search Box

Science.gov (United States)

Lown, Cory; Sierra, Tito; Boyer, Josh

2013-01-01

Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…

Random searching

International Nuclear Information System (INIS)

Shlesinger, Michael F

2009-01-01

There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

Suboptimal Iodine Concentration in Breastmilk and Inadequate Iodine Intake among Lactating Women in Norway.

Science.gov (United States)

Henjum, Sigrun; Lilleengen, Anne Marie; Aakre, Inger; Dudareva, Anna; Gjengedal, Elin Lovise Folven; Meltzer, Helle Margrete; Brantsæter, Anne Lise

2017-06-22

Breastfed infants depend on sufficient maternal iodine intake for optimal growth and neurological development. Despite this, few studies have assessed iodine concentrations in human milk and there is currently no published data on iodine status among lactating women in Norway. The aim of this study was to assess iodine concentrations in breast milk (BMIC) in lactating women and estimate iodine intake. Five Mother and Child Health Centres in Oslo were randomly selected during 2016, and 175 lactating women between 2nd and 28th weeks postpartum participated. Each of the women provided four breastmilk samples which were pooled and analysed for iodine concentrations. Participants also provided information on iodine intake from food and supplements covering the last 24 h and the habitual iodine intake (food frequency questionnaire). The median (p25, p75 percentiles) BMIC was 68 (45, 98) µg/L and 76% had BMIC food (p25, p75) was 121 (82, 162) µg/day and the total intake (food and supplements) was 134 (95, 222) µg/day. The majority of lactating women had suboptimal BMIC and inadequate intake of iodine from food and supplements.

Critical phenomena in communication/computation networks with various topologies and suboptimal to optimal resource allocation

Science.gov (United States)

Cogoni, Marco; Busonera, Giovanni; Anedda, Paolo; Zanetti, Gianluigi

2015-01-01

We generalize previous studies on critical phenomena in communication networks [1,2] by adding computational capabilities to the nodes. In our model, a set of tasks with random origin, destination and computational structure is distributed on a computational network, modeled as a graph. By varying the temperature of a Metropolis Montecarlo, we explore the global latency for an optimal to suboptimal resource assignment at a given time instant. By computing the two-point correlation function for the local overload, we study the behavior of the correlation distance (both for links and nodes) while approaching the congested phase: a transition from peaked to spread g(r) is seen above a critical (Montecarlo) temperature Tc. The average latency trend of the system is predicted by averaging over several network traffic realizations while maintaining a spatially detailed information for each node: a sharp decrease of performance is found over Tc independently of the workload. The globally optimized computational resource allocation and network routing defines a baseline for a future comparison of the transition behavior with respect to existing routing strategies [3,4] for different network topologies.

Consumer perception and preference for suboptimal food under the emerging practice of expiration date based pricing in supermarkets

DEFF Research Database (Denmark)

Aschemann-Witzel, Jessica

2018-01-01

Consumers have been found to majorly prefer ‘optimal’ food over ‘suboptimal’ when purchasing food. To provide an incentive for consumers to select suboptimal food and thus decrease food waste in the supply chain, expiration date based pricing is suggested and increasingly applied. However......, it is unclear which contextual, individual, and product-related factors impact consumer likelihood of choice and thus acceptance of the practice in the long run. The study aimed at exploring the effect of communicating different motives for purchase, the product being organic, familiarity with the practice......, individual preferences, and product-related factors. An online survey experiment among 842 Danish consumers realistically mimicked the current market context. Findings reveal that neither communicating budget saving or food waste avoidance nor the product being organic has an influence. However...

Search times and probability of detection in time-limited search

Science.gov (United States)

Wilson, David; Devitt, Nicole; Maurer, Tana

2005-05-01

When modeling the search and target acquisition process, probability of detection as a function of time is important to war games and physical entity simulations. Recent US Army RDECOM CERDEC Night Vision and Electronics Sensor Directorate modeling of search and detection has focused on time-limited search. Developing the relationship between detection probability and time of search as a differential equation is explored. One of the parameters in the current formula for probability of detection in time-limited search corresponds to the mean time to detect in time-unlimited search. However, the mean time to detect in time-limited search is shorter than the mean time to detect in time-unlimited search and the relationship between them is a mathematical relationship between these two mean times. This simple relationship is derived.

Open Search Environments: The Free Alternative to Commercial Search Services

Directory of Open Access Journals (Sweden)

Adrian O'Riordan

2014-06-01

Full Text Available Open search systems present a free and less restricted alternative to commercial search services. This paper explores the space of open search technology looking in particular at the issue of interoperability. A description of current protocols and formats for engineering open search applications is presented. The suitability of these technologies and issues around their adoption and operation are discussed. This open search approach is especially proving a fitting choice in applications involving the harvesting of resources and information integration. Principal among the technological solutions are OpenSearch and SRU. OpenSearch and SRU implement a federated model to enable existing and new search engines and search clients communicate. Applications and instances where Opensearch and SRU can be combined are presented. Other relevant technologies such as OpenURL, Apache Solr, and OAI-PMH are also discussed. The deployment of these freely licensed open standards in digital library applications is now a genuine alternative to commercial or proprietary systems.

Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms

Science.gov (United States)

2017-09-01

NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and

Evidence-based Medicine Search: a customizable federated search engine.

Science.gov (United States)

Bracke, Paul J; Howse, David K; Keim, Samuel M

2008-04-01

This paper reports on the development of a tool by the Arizona Health Sciences Library (AHSL) for searching clinical evidence that can be customized for different user groups. The AHSL provides services to the University of Arizona's (UA's) health sciences programs and to the University Medical Center. Librarians at AHSL collaborated with UA College of Medicine faculty to create an innovative search engine, Evidence-based Medicine (EBM) Search, that provides users with a simple search interface to EBM resources and presents results organized according to an evidence pyramid. EBM Search was developed with a web-based configuration component that allows the tool to be customized for different specialties. Informal and anecdotal feedback from physicians indicates that EBM Search is a useful tool with potential in teaching evidence-based decision making. While formal evaluation is still being planned, a tool such as EBM Search, which can be configured for specific user populations, may help lower barriers to information resources in an academic health sciences center.

Clinician search behaviors may be influenced by search engine design.

Science.gov (United States)

Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

2010-06-30

Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that

Cube search, revisited

Science.gov (United States)

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

2015-01-01

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

Searching the ASRS Database Using QUORUM Keyword Search, Phrase Search, Phrase Generation, and Phrase Discovery

Science.gov (United States)

McGreevy, Michael W.; Connors, Mary M. (Technical Monitor)

2001-01-01

To support Search Requests and Quick Responses at the Aviation Safety Reporting System (ASRS), four new QUORUM methods have been developed: keyword search, phrase search, phrase generation, and phrase discovery. These methods build upon the core QUORUM methods of text analysis, modeling, and relevance-ranking. QUORUM keyword search retrieves ASRS incident narratives that contain one or more user-specified keywords in typical or selected contexts, and ranks the narratives on their relevance to the keywords in context. QUORUM phrase search retrieves narratives that contain one or more user-specified phrases, and ranks the narratives on their relevance to the phrases. QUORUM phrase generation produces a list of phrases from the ASRS database that contain a user-specified word or phrase. QUORUM phrase discovery finds phrases that are related to topics of interest. Phrase generation and phrase discovery are particularly useful for finding query phrases for input to QUORUM phrase search. The presentation of the new QUORUM methods includes: a brief review of the underlying core QUORUM methods; an overview of the new methods; numerous, concrete examples of ASRS database searches using the new methods; discussion of related methods; and, in the appendices, detailed descriptions of the new methods.

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

Science.gov (United States)

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.

Top-k Keyword Search Over Graphs Based On Backward Search

Directory of Open Access Journals (Sweden)

Zeng Jia-Hui

2017-01-01

Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.

People searching for people: analysis of a people search engine log

NARCIS (Netherlands)

Weerkamp, W.; Berendsen, R.; Kovachev, B.; Meij, E.; Balog, K.; de Rijke, M.

2011-01-01

Recent years show an increasing interest in vertical search: searching within a particular type of information. Understanding what people search for in these "verticals" gives direction to research and provides pointers for the search engines themselves. In this paper we analyze the search logs of

Burden of Disease Attributable to Suboptimal Breastfeeding in Iran during 1990-2010; Findings from the Global Burden of Disease Study 2010

Directory of Open Access Journals (Sweden)

Roya Kelishadi

2016-09-01

Full Text Available Background: This study uses data of the global burden of diseases (GBD study 2010 to report death, disability-adjusted life year (DALYs, years of life lived with disability (YLDs and years of life lost due to premature mortality (YLLs, attributed to suboptimal breastfeeding by age and gender during 1990 to 2010 in Iran. Materials and Methods:The GBD assessments were used, together with estimates of death and DALYs due to specific risk factors to calculate the attributed burden of each risk factor exposure compared with the theoretical-minimum-risk exposure. Uncertainties in the distribution of exposure, relative risks, and relevant outcomes were incorporated into estimates of mortality attributable and burden and were presented as 95 % uncertainty interval (UI. Results:In both genders, the age standardized DALYs rates and the age standardized death rate [(from 5 (95% UI: 2-8 to 1 (95% UI: 0-2 per 100,000 populations], attributed to breastfeeding, had a decreasing trends. The age standardized YLD rate increased from 7 (95% UI: 2-15 to 10 (95% UI: 3-23 per 100,000 populations in boys and, from 7(95% UI: 2-16 to 11(95% UI: 3-26 per 100,000 populations in girls. The YLD changes showed some variation according to age categories. For both genders, the age standardizes YLL rate decreased from 395 (95% UI: 185-681 per 100,000 populations to 111(95% UI: 42-213 per 100,000 populations. Conclusion: The burden attributed to suboptimal breastfeeding had a considerable reduction rate from 1990 to 2010. Additional studies on burden of exclusive breastfeeding with more accurate data are recommended for policies make decision.

Metabonomics-Based Study of Clinical Urine Samples in Suboptimal Health with Different Syndromes

Directory of Open Access Journals (Sweden)

Hai-Zhen Cui

2013-01-01

Full Text Available Objective. To explore the urinary biochemistry features of syndromes of traditional Chinese medicine (TCM such as syndrome of stagnation of liver Qi, spleen deficiency, liver Qi stagnation, and spleen deficiency (LSSDS in sub-optimal health status (SHS. Methods. 12 cases for each syndrome group in SHS were selected, 12 subjects were used as a normal control group, and 1H NMR detection was, respectively, carried out, and the data was corrected by the orthogonal signal correction (OSC and then adopted a partial least squares (PLS method for discriminate analysis. Results. The OSC-PLS (ctr analysis results of the nuclear overhauser enhancement spectroscopy (NOESY detection indicated that the syndromes in SHS could be differentiated, and there were significant differences in the levels of metabolites of the urine samples of the four groups; the biomarkers of LSSDS in SHS were found out. The contents of citric acid (2.54 and 2.66, trimethylamineoxide (3.26, and hippuric acid (3.98, 7.54, 7.58, 7.62, 7.66, 7.82, and 7.86 in the urine samples of LSSDS group were lower than that of the normal control group. Conclusion. There are differences in the 1H-NMR metabolic spectrum of the urine samples of the four groups, and the specific metabolic products of the LSSDS in SHS can be identified from metabonomics analysis.

Prostate-specific antigen density is predictive of outcome in suboptimal prostate seed brachytherapy.

Science.gov (United States)

Benzaquen, David; Delouya, Guila; Ménard, Cynthia; Barkati, Maroie; Taussky, Daniel

In prostate seed brachytherapy, a D 90 of prostate-specific antigen + 2). Univariate and multivariate analyses were performed, adjusting for known prognostic factors such as D 90 and prostate-specific antigen density (PSAD) of ≥0.15 ng/mL/cm 3 , to evaluate their ability to predict BF. Median followup for patients without BF was 72 months (interquartile range 56-96). BF-free recurrence rate at 5 years was 95% and at 8 years 88%. In univariate analysis, PSAD and cancer of the prostate risk assessment score were predictive of BF. On multivariate analysis, none of the factors remained significant. The best prognosis had patients with a low PSAD (<0.15 ng/mL/cm 3 ) and an optimal implant at 30 days after implantation (as defined by D 90  ≥ 130 Gy) compared to patients with both factors unfavorable (p = 0.006). A favorable PSAD was associate with a good prognosis, independently of the D 90 (<130 Gy vs. ≥130 Gy, p = 0.7). Patients with a PSAD of <0.15 ng/mL/cm 3 have little risk of BF, even in the case of a suboptimal implant. These results need to be validated in other patients' cohorts. Copyright © 2016 American Brachytherapy Society. Published by Elsevier Inc. All rights reserved.

I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

DEFF Research Database (Denmark)

Lauritsen, Thomas; Kolenda, Thomas

2002-01-01

We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....

Market Dominance and Search Quality in the Search Engine Market

NARCIS (Netherlands)

Lianos, I.; Motchenkova, E.I.

2013-01-01

We analyze a search engine market from a law and economics perspective and incorporate the choice of quality-improving innovations by a search engine platform in a two-sided model of Internet search engine. In the proposed framework, we first discuss the legal issues the search engine market raises

Greedy subspace clustering.

Science.gov (United States)

2016-09-01

We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets ...

Large Neighborhood Search

DEFF Research Database (Denmark)

Pisinger, David; Røpke, Stefan

2010-01-01

Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...

Dyniqx: a novel meta-search engine for metadata based cross search

OpenAIRE

Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan

2008-01-01

The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based cross search. Dyniqx exploits the availability of metadata in academic search services such as PubMed and Google Scholar etc for fusing search results from heterogeneous search engines. In addition, metadata from these search engines are used for generating dynamic query controls such as sliders and tick boxes etc which are ...

Meta Search Engines.

Science.gov (United States)

Garman, Nancy

1999-01-01

Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)

Faceted Search

CERN Document Server

Tunkelang, Daniel

2009-01-01

We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

Beyond the search surface: visual search and attentional engagement.

Science.gov (United States)

Duncan, J; Humphreys, G

1992-05-01

Treisman (1991) described a series of visual search studies testing feature integration theory against an alternative (Duncan & Humphreys, 1989) in which feature and conjunction search are basically similar. Here the latter account is noted to have 2 distinct levels: (a) a summary of search findings in terms of stimulus similarities, and (b) a theory of how visual attention is brought to bear on relevant objects. Working at the 1st level, Treisman found that even when similarities were calibrated and controlled, conjunction search was much harder than feature search. The theory, however, can only really be tested at the 2nd level, because the 1st is an approximation. An account of the findings is developed at the 2nd level, based on the 2 processes of input-template matching and spreading suppression. New data show that, when both of these factors are controlled, feature and conjunction search are equally difficult. Possibilities for unification of the alternative views are considered.

Search costs and efficiency : Do unemployed workers search enough?

NARCIS (Netherlands)

Gautier, Pieter A.; Moraga González, José; Wolthoff, Ronald P.

Many labor market policies affect the marginal benefits and costs of job search. The impact and desirability of such policies depend on the distribution of search costs. In this paper, we provide an equilibrium framework for identifying the distribution of search costs and we apply it to the Dutch

Delay Reduction for Instantly Decodable Network Coding in Persistent Channels With Feedback Imperfections

KAUST Repository

Douik, Ahmed S.

2015-11-05

This paper considers the multicast decoding delay reduction problem for generalized instantly decodable network coding (G-IDNC) over persistent erasure channels with feedback imperfections. The feedback scenario discussed is the most general situation in which the sender does not always receive acknowledgments from the receivers after each transmission and the feedback communications are subject to loss. The decoding delay increment expressions are derived and employed to express the decoding delay reduction problem as a maximum weight clique problem in the G-IDNC graph. This paper provides a theoretical analysis of the expected decoding delay increase at each time instant. Problem formulations in simpler channel and feedback models are shown to be special cases of the proposed generalized formulation. Since finding the optimal solution to the problem is known to be NP-hard, a suboptimal greedy algorithm is designed and compared with blind approaches proposed in the literature. Through extensive simulations, the proposed algorithm is shown to outperform the blind methods in all situations and to achieve significant improvement, particularly for high time-correlated channels.

Delay Reduction for Instantly Decodable Network Coding in Persistent Channels With Feedback Imperfections

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

This paper considers the multicast decoding delay reduction problem for generalized instantly decodable network coding (G-IDNC) over persistent erasure channels with feedback imperfections. The feedback scenario discussed is the most general situation in which the sender does not always receive acknowledgments from the receivers after each transmission and the feedback communications are subject to loss. The decoding delay increment expressions are derived and employed to express the decoding delay reduction problem as a maximum weight clique problem in the G-IDNC graph. This paper provides a theoretical analysis of the expected decoding delay increase at each time instant. Problem formulations in simpler channel and feedback models are shown to be special cases of the proposed generalized formulation. Since finding the optimal solution to the problem is known to be NP-hard, a suboptimal greedy algorithm is designed and compared with blind approaches proposed in the literature. Through extensive simulations, the proposed algorithm is shown to outperform the blind methods in all situations and to achieve significant improvement, particularly for high time-correlated channels.

Influence of prebiotics on Lactobacillus reuteri death kinetics under sub-optimal temperatures and pH.

Science.gov (United States)

Altieri, Clelia; Iorio, Maria Clara; Bevilacqua, Antonio; Sinigaglia, Milena

2016-01-01

Eaten foodstuffs are usually fortified with prebiotic ingredients, such as inulin and oligofructose (FOS). The main goal of this study was to evaluate the combined effects of inulin and FOS with either suboptimal pH or storage temperature on the viability of Lactobacillus reuteri DSM 20016. Data were modeled through Weibull equation for the evaluation of the microbiological shelf life and the survival time. Prebiotics enhanced the microbiological shelf life and enhanced the survival time of the target bacterium. The use of the factorial ANOVA highlighted that inulin and FOS exerted a different effect as a function of pH and temperature. Inulin prolonged survival time under acidic conditions, while the effect of glucose + FOS was significant at pH 8. Finally, temperature could act by increasing or decreasing the effect of prebiotics, as they could exert a protective effect at 30 °C but not at 44 °C. As the main output of this research, we could suggest that the effect of prebiotics on L. reuteri could be significantly affected by pH and temperature, thus pinpointing that the design of a symbiotic food should also rely on these factors.

An effective suggestion method for keyword search of databases

KAUST Repository

Huang, Hai

2016-09-09

This paper solves the problem of providing high-quality suggestions for user keyword queries over databases. With the assumption that the returned suggestions are independent, existing query suggestion methods over databases score candidate suggestions individually and return the top-k best of them. However, the top-k suggestions have high redundancy with respect to the topics. To provide informative suggestions, the returned k suggestions are expected to be diverse, i.e., maximizing the relevance to the user query and the diversity with respect to topics that the user might be interested in simultaneously. In this paper, an objective function considering both factors is defined for evaluating a suggestion set. We show that maximizing the objective function is a submodular function maximization problem subject to n matroid constraints, which is an NP-hard problem. An greedy approximate algorithm with an approximation ratio O((Formula presented.)) is also proposed. Experimental results show that our suggestion outperforms other methods on providing relevant and diverse suggestions. © 2016 Springer Science+Business Media New York

How doctors search

DEFF Research Database (Denmark)

Lykke, Marianne; Price, Susan; Delcambre, Lois

2012-01-01

Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...

Web Search Engines

OpenAIRE

Rajashekar, TB

1998-01-01

The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

Ordered Consumer Search

OpenAIRE

Armstrong, Mark

2016-01-01

The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...

Is searching full text more effective than searching abstracts?

Science.gov (United States)

Lin, Jimmy

2009-02-03

With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata) to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE abstracts, full-text articles, and spans (paragraphs) within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

Is searching full text more effective than searching abstracts?

Directory of Open Access Journals (Sweden)

Lin Jimmy

2009-02-01

Full Text Available Abstract Background With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE® abstracts, full-text articles, and spans (paragraphs within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Results Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Conclusion Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

Suboptimal Nutritional Characteristics in Male and Female Soldiers Compared to Sports Nutrition Guidelines.

Science.gov (United States)

Beals, Kim; Darnell, Matthew E; Lovalekar, Mita; Baker, Rachel A; Nagai, Takashi; San-Adams, Thida; Wirt, Michael D

2015-12-01

The purpose of this study was to evaluate the nutrient intake of male and female Soldiers in the 101 st Airborne Division (Air Assault) compared to sports nutrition standards for athletes, and to identify suboptimal eating characteristics that may impair physical performance and jeopardize military readiness. Male and female Soldiers from the 101 st Airborne Division (Air Assault) completed a 24-hour dietary recall and nutrition history questionnaire before anthropometric and body composition measurements were taken. Compared to sports nutrition guidelines, Soldiers of the 101 st under consume carbohydrates (males: 3.9 ± 2.0 vs. 5.0 g/kg, p < 0.001; females: 4.0 ± 2.1 vs. 5.0 g/kg, p = 0.001), male Soldiers eat too much fat (32.4% of kcal vs. <30% of kcal, p = 0.000) and saturated fat (males: 10.5 ± 3.9% of kcal vs. 10.0% of kcal, p = 0.044), and both males and females follow a meal pattern that may not optimize energy availability throughout the day. Eating too much fat and under fueling carbohydrate may negatively impact the adaptations to physical training and compromise overall health. Although Soldiers continue to participate in arduous training programs, future research should be aimed at determining the energy and macronutrient needs to fuel and recover from specific types of military training. Reprint & Copyright © 2015 Association of Military Surgeons of the U.S.

Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.

Science.gov (United States)

Brady, Arthur; Maxwell, Kyle; Daniels, Noah; Cowen, Lenore J

2009-01-01

As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model) motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all). We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.

Meta-Search Utilizing Evolitionary Recommendation: A Web Search Architecture Proposal

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Keyhanipour, A.; Krömer, P.; Moshiri, B.; Owais, S.; Snášel, V.

2008-01-01

Roč. 33, - (2008), s. 189-200 ISSN 1870-4069 Institutional research plan: CEZ:AV0Z10300504 Keywords : web search * meta-search engine * intelligent re-ranking * ordered weighted averaging * Boolean search queries optimizing Subject RIV: IN - Informatics, Computer Science

On construction of partial association rules

KAUST Repository

Moshkov, Mikhail

2009-01-01

This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during greedy algorithm work, and results of the study of association rules for the most part of binary information systems. © 2009 Springer Berlin Heidelberg.

Does linear separability really matter? Complex visual search is explained by simple search

Science.gov (United States)

Vighneshvel, T.; Arun, S. P.

2013-01-01

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search. PMID:24029822

Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search.

Science.gov (United States)

Jay, Caroline; Harper, Simon; Dunlop, Ian; Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain

2016-01-14

Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these "experts." Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the "Google generation" than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is "Google-like," enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F1,19=37.3, Pnatural language search interfaces for variable search supporting in particular: query reformulation; data browsing; faceted search; surrogates; relevance

Visual Representation Determines Search Difficulty: Explaining Visual Search Asymmetries

Directory of Open Access Journals (Sweden)

Neil eBruce

2011-07-01

Full Text Available In visual search experiments there exist a variety of experimental paradigms in which a symmetric set of experimental conditions yields asymmetric corresponding task performance. There are a variety of examples of this that currently lack a satisfactory explanation. In this paper, we demonstrate that distinct classes of asymmetries may be explained by virtue of a few simple conditions that are consistent with current thinking surrounding computational modeling of visual search and coding in the primate brain. This includes a detailed look at the role that stimulus familiarity plays in the determination of search performance. Overall, we demonstrate that all of these asymmetries have a common origin, namely, they are a consequence of the encoding that appears in the visual cortex. The analysis associated with these cases yields insight into the problem of visual search in general and predictions of novel search asymmetries.

evaluating search effectiveness of some selected search engines

African Journals Online (AJOL)

Precision, relative recall and response time were considered for this ... a total of 24 search queries were sampled based on information queries, .... searching process and results, although there are other ... Q3.2 Software prototype model.

Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search

Science.gov (United States)

Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain

2016-01-01

Background Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these “experts.” Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. Objective The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the “Google generation” than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Methods Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is “Google-like,” enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Results Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F 1,19=37.3, Peffect of task (F 3,57=6.3, Pinterface (F 1,19=18.0, Peffect of task (F 2,38=4.1, P=.025, Greenhouse

Aircraft Route Recovery Based on An Improved GRASP Method

Directory of Open Access Journals (Sweden)

Yang He

2017-01-01

Full Text Available Aircrafts maintenance, temporary airport closures are common factors that disrupt normal flight schedule. The aircraft route recovery aims to recover original schedules by some strategies, including flights swaps, and cancellations, which is a NP-hard problem. This paper proposes an improved heuristic procedure based on Greedy Random Adaptive Search Procedure (GRASP to solve this problem. The effectiveness and high global optimization capability of the heuristic is illustrated through experiments based on large-scale problems. Compared to the original one, it is shown that the improved procedure can find feasible flight recovered schedules with lower cost in a short time.

Search Advertising

OpenAIRE

Cornière (de), Alexandre

2016-01-01

Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...

Factors associated with suboptimal adherence to antiretroviral therapy in Asia

Science.gov (United States)

Jiamsakul, Awachana; Kumarasamy, Nagalingeswaran; Ditangco, Rossana; Li, Patrick CK; Phanuphak, Praphan; Sirisanthana, Thira; Sungkanuparph, Somnuek; Kantipong, Pacharee; Lee, Christopher KC; Mustafa, Mahiran; Merati, Tuti; Kamarulzaman, Adeeba; Singtoroj, Thida; Law, Matthew

2014-01-01

Introduction Adherence to antiretroviral therapy (ART) plays an important role in treatment outcomes. It is crucial to identify factors influencing adherence in order to optimize treatment responses. The aim of this study was to assess the rates of, and factors associated with, suboptimal adherence (SubAdh) in the first 24 months of ART in an Asian HIV cohort. Methods As part of a prospective resistance monitoring study, the TREAT Asia Studies to Evaluate Resistance Monitoring Study (TASER-M) collected patients’ adherence based on the World Health Organization-validated Adherence Visual Analogue Scale. SubAdh was defined in two ways: (i) 14 days. Time was divided into four intervals: 0–6, 6–12, 12–18 and 18–24 months. Factors associated with SubAdh were analysed using generalized estimating equations. Results Out of 1316 patients, 32% ever reported 2 assessments per patient per year had an odds ratio (OR)=0.7 (95% confidence interval (CI) (0.55 to 0.90), p=0.006), compared to sites with ≤2 assessments per patient per year. Compared to heterosexual exposure, SubAdh was higher in injecting drug users (IDUs) (OR=1.92, 95% CI (1.23 to 3.00), p=0.004) and lower in homosexual exposure (OR=0.52, 95% CI (0.38 to 0.71), p<0.001). Patients taking a nucleoside transcriptase inhibitor and protease inhibitor (NRTI+PI) combination were less likely to report adherence <100% (OR=0.36, 95% CI (0.20 to 0.67), p=0.001) compared to patients taking an NRTI and non-nucleoside transcriptase inhibitor (NRTI+NNRTI) combination. SubAdh decreased with increasing time on ART (all p<0.001). Similar associations were found with adherence <95% as the outcome. Conclusions We found that SubAdh, defined as either <100% and <95%, was associated with mode of HIV exposure, ART regimen, time on ART and frequency of adherence measurement. The more frequently sites assessed patients, the lower the SubAdh, possibly reflecting site resourcing for patient counselling. Although social

Bingo! Externally-Supported Performance Intervention for Deficient Visual Search in Normal Aging, Parkinson’s Disease and Alzheimer’s Disease

Science.gov (United States)

Laudate, Thomas M.; Neargarder, Sandy; Dunne, Tracy E.; Sullivan, Karen D.; Joshi, Pallavi; Gilmore, Grover C.; Riedel, Tatiana M.; Cronin-Golomb, Alice

2011-01-01

External support may improve task performance regardless of an individual’s ability to compensate for cognitive deficits through internally-generated mechanisms. We investigated if performance of a complex, familiar visual search task (the game of bingo) could be enhanced in groups with suboptimal vision by providing external support through manipulation of task stimuli. Participants were 19 younger adults, 14 individuals with probable Alzheimer’s disease (AD), 13 AD-matched healthy adults, 17 non-demented individuals with Parkinson’s disease (PD), and 20 PD-matched healthy adults. We varied stimulus contrast, size, and visual complexity during game play. The externally-supported performance interventions of increased stimulus size and decreased complexity resulted in improvements in performance by all groups. Performance improvement through increased stimulus size and decreased complexity was demonstrated by all groups. AD also obtained benefit from increasing contrast, presumably by compensating for their contrast sensitivity deficit. The general finding of improved performance across healthy and afflicted groups suggests the value of visual support as an easy-to-apply intervention to enhance cognitive performance. PMID:22066941

Suboptimal decision making by children with ADHD in the face of risk: Poor risk adjustment and delay aversion rather than general proneness to taking risks.

Science.gov (United States)

Sørensen, Lin; Sonuga-Barke, Edmund; Eichele, Heike; van Wageningen, Heidi; Wollschlaeger, Daniel; Plessen, Kerstin Jessica

2017-02-01

Suboptimal decision making in the face of risk (DMR) in children with attention-deficit hyperactivity disorder (ADHD) may be mediated by deficits in a number of different neuropsychological processes. We investigated DMR in children with ADHD using the Cambridge Gambling Task (CGT) to distinguish difficulties in adjusting to changing probabilities of choice outcomes (so-called risk adjustment) from general risk proneness, and to distinguish these 2 processes from delay aversion (the tendency to choose the least delayed option) and impairments in the ability to reflect on choice options. Based on previous research, we predicted that suboptimal performance on this task in children with ADHD would be primarily relate to problems with risk adjustment and delay aversion rather than general risk proneness. Drug naïve children with ADHD (n = 36), 8 to 12 years, and an age-matched group of typically developing children (n = 34) performed the CGT. As predicted, children with ADHD were not more prone to making risky choices (i.e., risk proneness). However, they had difficulty adjusting to changing risk levels and were more delay aversive-with these 2 effects being correlated. Our findings add to the growing body of evidence that children with ADHD do not favor risk taking per se when performing gambling tasks, but rather may lack the cognitive skills or motivational style to appraise changing patterns of risk effectively. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Beyond MEDLINE for literature searches.

Science.gov (United States)

Conn, Vicki S; Isaramalai, Sang-arun; Rath, Sabyasachi; Jantarakupt, Peeranuch; Wadhawan, Rohini; Dash, Yashodhara

2003-01-01

To describe strategies for a comprehensive literature search. MEDLINE searches result in limited numbers of studies that are often biased toward statistically significant findings. Diversified search strategies are needed. Empirical evidence about the recall and precision of diverse search strategies is presented. Challenges and strengths of each search strategy are identified. Search strategies vary in recall and precision. Often sensitivity and specificity are inversely related. Valuable search strategies include examination of multiple diverse computerized databases, ancestry searches, citation index searches, examination of research registries, journal hand searching, contact with the "invisible college," examination of abstracts, Internet searches, and contact with sources of synthesized information. Extending searches beyond MEDLINE enables researchers to conduct more systematic comprehensive searches.

Supporting Book Search

DEFF Research Database (Denmark)

Bogers, Toine; Petras, Vivien

2017-01-01

of information needs. In this paper, we present a large-scale empirical comparison of the effectiveness of book metadata elements for searching complex information needs. Using a test collection of over 2 million book records and over 330 real-world book search requests, we perform a highly controlled and in......-depth analysis of topical metadata, comparing controlled vocabularies with social tags. Tags perform better overall in this setting, but controlled vocabulary terms provide complementary information, which will improve a search. We analyze potential underlying factors that contribute to search performance......, such as the relevance aspect(s) mentioned in a request or the type of book. In addition, we investigate the possible causes of search failure. We conclude that neither tags nor controlled vocabularies are wholly suited to handling the complex information needs in book search, which means that different approaches...

Needle Custom Search: Recall-oriented search on the Web using semantic annotations

NARCIS (Netherlands)

Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon; de Rijke, Maarten; Kenter, Tom; de Vries, A.P.; Zhai, Chen Xiang; de Jong, Franciska M.G.; Radinsky, Kira; Hofmann, Katja

Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

Needle Custom Search : Recall-oriented search on the web using semantic annotations

NARCIS (Netherlands)

Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon L.

2014-01-01

Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

Sparse approximation with bases

CERN Document Server

2015-01-01

This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

Do two heads search better than one? Effects of student collaboration on web search behavior and search outcomes.

NARCIS (Netherlands)

Lazonder, Adrianus W.

2005-01-01

This study compared Pairs of students with Single students in web search tasks. The underlying hypothesis was that peer-to-peer collaboration encourages students to articulate their thoughts, which in turn has a facilitative effect on the regulation of the search process as well as search outcomes.

When is a search not a search? A comparison of searching the AMED complementary health database via EBSCOhost, OVID and DIALOG.

Science.gov (United States)

Younger, Paula; Boddy, Kate

2009-06-01

The researchers involved in this study work at Exeter Health library and at the Complementary Medicine Unit, Peninsula School of Medicine and Dentistry (PCMD). Within this collaborative environment it is possible to access the electronic resources of three institutions. This includes access to AMED and other databases using different interfaces. The aim of this study was to investigate whether searching different interfaces to the AMED allied health and complementary medicine database produced the same results when using identical search terms. The following Internet-based AMED interfaces were searched: DIALOG DataStar; EBSCOhost and OVID SP_UI01.00.02. Search results from all three databases were saved in an endnote database to facilitate analysis. A checklist was also compiled comparing interface features. In our initial search, DIALOG returned 29 hits, OVID 14 and Ebsco 8. If we assume that DIALOG returned 100% of potential hits, OVID initially returned only 48% of hits and EBSCOhost only 28%. In our search, a researcher using the Ebsco interface to carry out a simple search on AMED would miss over 70% of possible search hits. Subsequent EBSCOhost searches on different subjects failed to find between 21 and 86% of the hits retrieved using the same keywords via DIALOG DataStar. In two cases, the simple EBSCOhost search failed to find any of the results found via DIALOG DataStar. Depending on the interface, the number of hits retrieved from the same database with the same simple search can vary dramatically. Some simple searches fail to retrieve a substantial percentage of citations. This may result in an uninformed literature review, research funding application or treatment intervention. In addition to ensuring that keywords, spelling and medical subject headings (MeSH) accurately reflect the nature of the search, database users should include wildcards and truncation and adapt their search strategy substantially to retrieve the maximum number of appropriate

The burden of suboptimal breastfeeding in the United States: a pediatric cost analysis.

Science.gov (United States)

Bartick, Melissa; Reinhold, Arnold

2010-05-01

A 2001 study revealed that $3.6 billion could be saved if breastfeeding rates were increased to levels of the Healthy People objectives. It studied 3 diseases and totaled direct and indirect costs and cost of premature death. The 2001 study can be updated by using current breastfeeding rates and adding additional diseases analyzed in the 2007 breastfeeding report from the Agency for Healthcare Research and Quality. Using methods similar to those in the 2001 study, we computed current costs and compared them to the projected costs if 80% and 90% of US families could comply with the recommendation to exclusively breastfeed for 6 months. Excluding type 2 diabetes (because of insufficient data), we conducted a cost analysis for all pediatric diseases for which the Agency for Healthcare Research and Quality reported risk ratios that favored breastfeeding: necrotizing enterocolitis, otitis media, gastroenteritis, hospitalization for lower respiratory tract infections, atopic dermatitis, sudden infant death syndrome, childhood asthma, childhood leukemia, type 1 diabetes mellitus, and childhood obesity. We used 2005 Centers for Disease Control and Prevention breastfeeding rates and 2007 dollars. If 90% of US families could comply with medical recommendations to breastfeed exclusively for 6 months, the United States would save $13 billion per year and prevent an excess 911 deaths, nearly all of which would be in infants ($10.5 billion and 741 deaths at 80% compliance). Current US breastfeeding rates are suboptimal and result in significant excess costs and preventable infant deaths. Investment in strategies to promote longer breastfeeding duration and exclusivity may be cost-effective.

Usability Testing of a Large, Multidisciplinary Library Database: Basic Search and Visual Search

Directory of Open Access Journals (Sweden)

Jody Condit Fagan

2006-09-01

Full Text Available Visual search interfaces have been shown by researchers to assist users with information search and retrieval. Recently, several major library vendors have added visual search interfaces or functions to their products. For public service librarians, perhaps the most critical area of interest is the extent to which visual search interfaces and text-based search interfaces support research. This study presents the results of eight full-scale usability tests of both the EBSCOhost Basic Search and Visual Search in the context of a large liberal arts university.

Social Work Literature Searching: Current Issues with Databases and Online Search Engines

Science.gov (United States)

McGinn, Tony; Taylor, Brian; McColgan, Mary; McQuilkan, Janice

2016-01-01

Objectives: To compare the performance of a range of search facilities; and to illustrate the execution of a comprehensive literature search for qualitative evidence in social work. Context: Developments in literature search methods and comparisons of search facilities help facilitate access to the best available evidence for social workers.…

Hide and vanish: data sets where the most parsimonious tree is known but hard to find, and their implications for tree search methods.

Science.gov (United States)

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

Interest in Anesthesia as Reflected by Keyword Searches using Common Search Engines.

Science.gov (United States)

Liu, Renyu; García, Paul S; Fleisher, Lee A

2012-01-23

Since current general interest in anesthesia is unknown, we analyzed internet keyword searches to gauge general interest in anesthesia in comparison with surgery and pain. The trend of keyword searches from 2004 to 2010 related to anesthesia and anaesthesia was investigated using Google Insights for Search. The trend of number of peer reviewed articles on anesthesia cited on PubMed and Medline from 2004 to 2010 was investigated. The average cost on advertising on anesthesia, surgery and pain was estimated using Google AdWords. Searching results in other common search engines were also analyzed. Correlation between year and relative number of searches was determined with psearch engines may provide different total number of searching results (available posts), the ratios of searching results between some common keywords related to perioperative care are comparable, indicating similar trend. The peer reviewed manuscripts on "anesthesia" and the proportion of papers on "anesthesia and outcome" are trending up. Estimates for spending of advertising dollars are less for anesthesia-related terms when compared to that for pain or surgery due to relative smaller number of searching traffic. General interest in anesthesia (anaesthesia) as measured by internet searches appears to be decreasing. Pain, preanesthesia evaluation, anesthesia and outcome and side effects of anesthesia are the critical areas that anesthesiologists should focus on to address the increasing concerns.

BioCarian: search engine for exploratory searches in heterogeneous biological databases.

Science.gov (United States)

Zaki, Nazar; Tennakoon, Chandana

2017-10-02

There are a large number of biological databases publicly available for scientists in the web. Also, there are many private databases generated in the course of research projects. These databases are in a wide variety of formats. Web standards have evolved in the recent times and semantic web technologies are now available to interconnect diverse and heterogeneous sources of data. Therefore, integration and querying of biological databases can be facilitated by techniques used in semantic web. Heterogeneous databases can be converted into Resource Description Format (RDF) and queried using SPARQL language. Searching for exact queries in these databases is trivial. However, exploratory searches need customized solutions, especially when multiple databases are involved. This process is cumbersome and time consuming for those without a sufficient background in computer science. In this context, a search engine facilitating exploratory searches of databases would be of great help to the scientific community. We present BioCarian, an efficient and user-friendly search engine for performing exploratory searches on biological databases. The search engine is an interface for SPARQL queries over RDF databases. We note that many of the databases can be converted to tabular form. We first convert the tabular databases to RDF. The search engine provides a graphical interface based on facets to explore the converted databases. The facet interface is more advanced than conventional facets. It allows complex queries to be constructed, and have additional features like ranking of facet values based on several criteria, visually indicating the relevance of a facet value and presenting the most important facet values when a large number of choices are available. For the advanced users, SPARQL queries can be run directly on the databases. Using this feature, users will be able to incorporate federated searches of SPARQL endpoints. We used the search engine to do an exploratory search

Search for neutral leptons

International Nuclear Information System (INIS)

Perl, M.L.

1984-12-01

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

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

Directory of Open Access Journals (Sweden)

Younes Saadi

Full Text Available 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

Assessment and Comparison of Search capabilities of Web-based Meta-Search Engines: A Checklist Approach

Directory of Open Access Journals (Sweden)

Alireza Isfandiyari Moghadam

2010-03-01

Full Text Available   The present investigation concerns evaluation, comparison and analysis of search options existing within web-based meta-search engines. 64 meta-search engines were identified. 19 meta-search engines that were free, accessible and compatible with the objectives of the present study were selected. An author’s constructed check list was used for data collection. Findings indicated that all meta-search engines studied used the AND operator, phrase search, number of results displayed setting, previous search query storage and help tutorials. Nevertheless, none of them demonstrated any search options for hypertext searching and displaying the size of the pages searched. 94.7% support features such as truncation, keywords in title and URL search and text summary display. The checklist used in the study could serve as a model for investigating search options in search engines, digital libraries and other internet search tools.

Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.

Science.gov (United States)

Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J

2015-01-01

Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.

Subject search study. Final report

International Nuclear Information System (INIS)

Todeschini, C.

1995-01-01

The study gathered information on how users search the database of the International Nuclear Information System (INIS), using indicators such as Subject categories, Controlled terms, Subject headings, Free-text words, combinations of the above. Users participated from the Australian, French, Russian and Spanish INIS Centres, that have different national languages. Participants, both intermediaries and end users, replied to a questionnaire and executed search queries. The INIS Secretariat at the IAEA also participated. A protocol of all search strategies used in actual searches in the database was kept. The thought process for Russian and Spanish users is predominantly non-English and also the actual initial search formulation is predominantly non-English among Russian and Spanish users while it tends to be more in English among French users. A total of 1002 searches were executed by the five INIS centres including the IAEA. The search protocols indicate the following search behaviour: 1) free text words represent about 40% of search points on an average query; 2) descriptors used as search keys have the widest range as percentage of search points, from a low of 25% to a high of 48%; 3) search keys consisting of free text that coincides with a descriptor account for about 15% of search points; 4) Subject Categories are not used in many searches; 5) free text words are present as search points in about 80% of all searches; 6) controlled terms (descriptors) are used very extensively and appear in about 90% of all searches; 7) Subject Headings were used in only a few percent of searches. From the results of the study one can conclude that there is a greater reluctance on the part of non-native English speakers in initiating their searches by using free text word searches. Also: Subject Categories are little used in searching the database; both free text terms and controlled terms are the predominant types of search keys used, whereby the controlled terms are used more

Search features of digital libraries

Directory of Open Access Journals (Sweden)

Alastair G. Smith

2000-01-01

Full Text Available Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc. This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries, for instance by: providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc.

The Information Search

Science.gov (United States)

Doraiswamy, Uma

2011-01-01

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

Google Power Search

CERN Document Server

Spencer, Stephan

2011-01-01

Behind Google's deceptively simple interface is immense power for both market and competitive research-if you know how to use it well. Sure, basic searches are easy, but complex searches require specialized skills. This concise book takes you through the full range of Google's powerful search-refinement features, so you can quickly find the specific information you need. Learn techniques ranging from simple Boolean logic to URL parameters and other advanced tools, and see how they're applied to real-world market research examples. Incorporate advanced search operators such as filetype:, intit

Metaheuristic algorithms for building Covering Arrays: A review

Directory of Open Access Journals (Sweden)

Jimena Adriana Timaná-Peña

2016-09-01

Full Text Available Covering Arrays (CA are mathematical objects used in the functional testing of software components. They enable the testing of all interactions of a given size of input parameters in a procedure, function, or logical unit in general, using the minimum number of test cases. Building CA is a complex task (NP-complete problem that involves lengthy execution times and high computational loads. The most effective methods for building CAs are algebraic, Greedy, and metaheuristic-based. The latter have reported the best results to date. This paper presents a description of the major contributions made by a selection of different metaheuristics, including simulated annealing, tabu search, genetic algorithms, ant colony algorithms, particle swarm algorithms, and harmony search algorithms. It is worth noting that simulated annealing-based algorithms have evolved as the most competitive, and currently form the state of the art.

A new efficient RLF-like algorithm for the vertex coloring problem

Directory of Open Access Journals (Sweden)

Adegbindin Mourchid

2016-01-01

Full Text Available The Recursive Largest First (RLF algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices. In particular, the first vertex placed in a color class C is one with a maximum number of uncolored neighbors, and the next vertices placed in C are chosen so that they have as many uncolored neighbors which cannot be placed in C. These greedy choices can have a significant impact on the performance of the algorithm, which explains why we propose alternative selection rules. Computational experiments on 63 difficult DIMACS instances show that the resulting new RLF-like algorithm, when compared with the standard RLF, allows to obtain a reduction of more than 50% of the gap between the number of colors used and the best known upper bound on the chromatic number. The new greedy algorithm even competes with basic metaheuristics for the vertex coloring problem.

A Distributed Routing Scheme for Energy Management in Solar Powered Sensor Networks

KAUST Repository

Dehwah, Ahmad H.

2017-10-11

Energy management is critical for solar-powered sensor networks. In this article, we consider data routing policies to optimize the energy in solar powered networks. Motivated by multipurpose sensor networks, the objective is to find the best network policy that maximizes the minimal energy among nodes in a sensor network, over a finite time horizon, given uncertain energy input forecasts. First, we derive the optimal policy in certain special cases using forward dynamic programming. We then introduce a greedy policy that is distributed and exhibits significantly lower complexity. When computationally feasible, we compare the performance of the optimal policy with the greedy policy. We also demonstrate the performance and computational complexity of the greedy policy over randomly simulated networks, and show that it yields results that are almost identical to the optimal policy, for greatly reduced worst-case computational costs and memory requirements. Finally, we demonstrate the implementation of the greedy policy on an experimental sensor network.

Searching for Suicide Information on Web Search Engines in Chinese

Directory of Open Access Journals (Sweden)

Yen-Feng Lee

2017-01-01

Full Text Available Introduction: Recently, suicide prevention has been an important public health issue. However, with the growing access to information in cyberspace, the harmful information is easily accessible online. To investigate the accessibility of potentially harmful suicide-related information on the internet, we discuss the following issue about searching suicide information on the internet to draw attention to it. Methods: We use five search engines (Google, Yahoo, Bing, Yam, and Sina and four suicide-related search queries (suicide, how to suicide, suicide methods, and want to die in traditional Chinese in April 2016. We classified the first thirty linkages of the search results on each search engine by a psychiatric doctor into suicide prevention, pro-suicide, neutral, unrelated to suicide, or error websites. Results: Among the total 352 unique websites generated, the suicide prevention websites were the most frequent among the search results (37.8%, followed by websites unrelated to suicide (25.9% and neutral websites (23.0%. However, pro-suicide websites were still easily accessible (9.7%. Besides, compared with the USA and China, the search engine originating in Taiwan had the lowest accessibility to pro-suicide information. The results of ANOVA showed a significant difference between the groups, F = 8.772, P < 0.001. Conclusions: This study results suggest a need for further restrictions and regulations of pro-suicide information on the internet. Providing more supportive information online may be an effective plan for suicidal prevention.

Self-learning search engines

NARCIS (Netherlands)

Schuth, A.

2015-01-01

How does a search engine such as Google know which search results to display? There are many competing algorithms that generate search results, but which one works best? We developed a new probabilistic method for quickly comparing large numbers of search algorithms by examining the results users

Altered Innate Immune Responses in Neutrophils from Patients with Well- and Suboptimally Controlled Asthma

Directory of Open Access Journals (Sweden)

Francesca S. M. Tang

2015-01-01

Full Text Available Background. Respiratory infections are a major cause of asthma exacerbations where neutrophilic inflammation dominates and is associated with steroid refractory asthma. Structural airway cells in asthma differ from nonasthmatics; however it is unknown if neutrophils differ. We investigated neutrophil immune responses in patients who have good (AGood and suboptimal (ASubopt asthma symptom control. Methods. Peripheral blood neutrophils from AGood (ACQ 0.75, n=7, and healthy controls (HC (n=9 were stimulated with bacterial (LPS (1 μg/mL, fMLF (100 nM, and viral (imiquimod (3 μg/mL, R848 (1.5 μg/mL, and poly I:C (10 μg/mL surrogates or live rhinovirus (RV 16 (MOI1. Cell-free supernatant was collected after 1 h for neutrophil elastase (NE and matrix metalloproteinase- (MMP- 9 measurements or after 24 h for CXCL8 release. Results. Constitutive NE was enhanced in AGood neutrophils compared to HC. fMLF stimulated neutrophils from ASubopt but not AGood produced 50% of HC levels. fMLF induced MMP-9 was impaired in ASubopt and AGood compared to HC. fMLF stimulated CXCL8 but not MMP-9 was positively correlated with FEV1 and FEV1/FVC. ASubopt and AGood responded similarly to other stimuli. Conclusions. Circulating neutrophils are different in asthma; however, this is likely to be related to airflow limitation rather than asthma control.

Economic and disease burden of breast cancer associated with suboptimal breastfeeding practices in Mexico.

Science.gov (United States)

Unar-Munguía, Mishel; Meza, Rafael; Colchero, M Arantxa; Torres-Mejía, Gabriela; de Cosío, Teresita Gonzalez

2017-12-01

Exclusive breastfeeding and longer breastfeeding reduce women's breast cancer risk but Mexico has one of the lowest breastfeeding rates worldwide. We estimated the lifetime economic and disease burden of breast cancer in Mexico if 95% of parous women breastfeed each child exclusively for 6 months and continue breastfeeding for over a year. We used a static microsimulation model with a cost-of-illness approach to simulate a cohort of Mexican women. We estimated breast cancer incidence, premature mortality, disability-adjusted life years (DALYs), medical costs, and income losses due to breast cancer and extrapolated the results to 1.116 million Mexican women of age 15 in 2012. Costs were expressed in 2015 US dollars and discounted at a 3% annual rate. We estimated that 2,186 premature deaths (95% CI 2,123-2,248), 9,936 breast cancer cases (95% CI 9,651-10,220), 45,109 DALYs (95% CI 43,000-47,217), and $245 million USD (95% CI 234-256) in medical costs and income losses owing to breast cancer could be saved over a cohort's lifetime. Medical costs account for 80% of the economic burden; income losses and opportunity costs for caregivers account for 15 and 5%, respectively. In Mexico, the burden of breast cancer due to suboptimal breastfeeding in women is high in terms of morbidity, premature mortality, and the economic costs for the health sector and society.

Sound Search Engine Concept

DEFF Research Database (Denmark)

2006-01-01

Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...

Myanmar Language Search Engine

OpenAIRE

Pann Yu Mon; Yoshiki Mikami

2011-01-01

With the enormous growth of the World Wide Web, search engines play a critical role in retrieving information from the borderless Web. Although many search engines are available for the major languages, but they are not much proficient for the less computerized languages including Myanmar. The main reason is that those search engines are not considering the specific features of those languages. A search engine which capable of searching the Web documents written in those languages is highly n...

Searching and Archiving : Exploring Online Search Behaviors of Researchers

NARCIS (Netherlands)

Vyas, Dhaval; de Groot, S.; van der Veer, Gerrit C.; Dainoff, Marvin J.

2007-01-01

Searching for relevant peer-reviewed material is an integral part of corporate and academic researchers. Researchers collect huge amount of information over the years and sometimes struggle organizing it. Based on a study with 30 academic researchers, we explore, in combination, different searching

Organizational Search Strategy: An Examination of Interdependencies, Locus and Temporality of Search

NARCIS (Netherlands)

Ebrahim, Mahdi

2017-01-01

Notwithstanding the ample research on organizational search and its performance implications, the factors that shape the organizations’ search strategy is fairly under-explored. This study investigates how problems’ characteristics influence the managerial decision of searching jointly or

Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.

Directory of Open Access Journals (Sweden)

Arthur Brady

Full Text Available As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all. We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.

Suboptimal Addiction Interventions for Patients Hospitalized with Injection Drug Use-Associated Infective Endocarditis.

Science.gov (United States)

Rosenthal, Elana S; Karchmer, Adolf W; Theisen-Toupal, Jesse; Castillo, Roger Araujo; Rowley, Chris F

2016-05-01

Infective endocarditis is a serious infection, often resulting from injection drug use. Inpatient treatment regularly focuses on management of infection without attention to the underlying addiction. We aimed to determine the addiction interventions done in patients hospitalized with injection drug use-associated infective endocarditis. This is a retrospective review of patients hospitalized with injection drug use-associated infective endocarditis from January, 2004 through August, 2014 at a large academic tertiary care center in Boston, Massachusetts. For the initial and subsequent admissions, data were collected regarding addiction interventions, including consultation by social work, addiction clinical nurse and psychiatry, documentation of addiction in the discharge summary plan, plan for medication-assisted treatment and naloxone provision. There were 102 patients admitted with injection drug use-associated infective endocarditis, 50 patients (49.0%) were readmitted and 28 (27.5%) patients had ongoing injection drug use at readmission. At initial admission, 86.4% of patients had social work consultation, 23.7% had addiction consultation, and 24.0% had psychiatry consultation. Addiction was mentioned in 55.9% of discharge summary plans, 7.8% of patients had a plan for medication-assisted treatment, and naloxone was never prescribed. Of 102 patients, 26 (25.5%) are deceased. The median age at death was 40.9 years (interquartile range 28.7-48.7). We found that patients hospitalized with injection drug use-associated infective endocarditis had high rates of readmission, recurrent infective endocarditis and death. Despite this, addiction interventions were suboptimal. Improved addiction interventions are imperative in the treatment of injection drug use-associated infective endocarditis. Copyright © 2016 Elsevier Inc. All rights reserved.

Clinical significance of suboptimal hormonal levels in men with prostate cancer treated with LHRH agonists.

Science.gov (United States)

Kawakami, Jun; Morales, Alvaro

2013-01-01

We examined the serum levels of testosterone (T) (total and bioavailable) dehydroepiandrosterone (DHEA), follicle-stimulating hormone (FSH), luteinizing hormone (LH), and prostate-specific antigen (PSA) in men receiving treatment with luteinizing hormone releasing-hormone (LHRH) agonists for metastatic prostate cancer. In doing this, we want to determine the efficacy of these agents in lowering T levels and whether a possible relationship exists between PSA values, as a surrogate measure of tumour activity, and hormone levels. This was a single centre prospective study of patients on LHRH agonists. Of all the 100 eligible patients, 31 did not qualify (10 were receiving their first injection, 13 were on intermittent hormonal therapy, 7 refused to enter the trial and 1 patient's blood sample was lost). Therefore in total, 69 patients were included in the final analysis. Each patient had their blood sample drawn immediately before the administration of a LHRH agonist. The new proposed criteria of values are more commonly found in patients with suboptimal levels of testosterone receiving LHRH analogs, but the clinical importance of this finding has not been established. There is no significant difference with respect to hormonal levels reached among patients on a variety of LHRH agonists. Total testosterone determinations should be considered in patients on LHRH agonist therapy, particularly when the PSA values begin to rise since it may lead to further beneficial hormonal manipulation.

Social Search: A Taxonomy of, and a User-Centred Approach to, Social Web Search

Science.gov (United States)

McDonnell, Michael; Shiri, Ali

2011-01-01

Purpose: The purpose of this paper is to introduce the notion of social search as a new concept, drawing upon the patterns of web search behaviour. It aims to: define social search; present a taxonomy of social search; and propose a user-centred social search method. Design/methodology/approach: A mixed method approach was adopted to investigate…

Keyword Search in Databases

CERN Document Server

Yu, Jeffrey Xu; Chang, Lijun

2009-01-01

It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from

Intermittent search strategies

Science.gov (United States)

Bénichou, O.; Loverdo, C.; Moreau, M.; Voituriez, R.

2011-01-01

This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. It is first shown that intermittent search strategies are actually widely observed at various scales. At the macroscopic scale, this is, for example, the case of animals looking for food; at the microscopic scale, intermittent transport patterns are involved in a reaction pathway of DNA-binding proteins as well as in intracellular transport. Second, generic stochastic models are introduced, which show that intermittent strategies are efficient strategies that enable the minimization of search time. This suggests that the intrinsic efficiency of intermittent search strategies could justify their frequent observation in nature. Last, beyond these modeling aspects, it is proposed that intermittent strategies could also be used in a broader context to design and accelerate search processes.

Trigonometric bases for matrix weighted Lp-spaces

DEFF Research Database (Denmark)

Nielsen, Morten

2010-01-01

We give a complete characterization of 2π-periodic matrix weights W for which the vector-valued trigonometric system forms a Schauder basis for the matrix weighted space Lp(T;W). Then trigonometric quasi-greedy bases for Lp(T;W) are considered. Quasi-greedy bases are systems for which the simple...

Delaying information search

Directory of Open Access Journals (Sweden)

Yaniv Shani

2012-11-01

Full Text Available In three studies, we examined factors that may temporarily attenuate information search. People are generally curious and dislike uncertainty, which typically encourages them to look for relevant information. Despite these strong forces that promote information search, people sometimes deliberately delay obtaining valuable information. We find they may do so when they are concerned that the information might interfere with future pleasurable activities. Interestingly, the decision to search or to postpone searching for information is influenced not only by the value and importance of the information itself but also by well-being maintenance goals related to possible detrimental effects that negative knowledge may have on unrelated future plans.

submitter Searches at LEP

CERN Document Server

Kawagoe, Kiyotomo

2001-01-01

Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.

SEARCHES FOR SUPERSYMMETRY IN ATLAS

CERN Document Server

Xu, Da; The ATLAS collaboration

2017-01-01

A wide range of supersymmetric searches are presented. All searches are based on the proton- proton collision dataset collected by the ATLAS experiment during the 2015 and 2016 (before summer) run with a center-of-mass energy of 13 TeV, corresponding to an integrated lumi- nosity of 36.1 (36.7) fb-1. The searches are categorized into inclusive gluino and squark search, third generation search, electroweak search, prompt RPV search and long-lived par- ticle search. No evidence of new physics is observed. The results are intepreted in various models and expressed in terms of limits on the masses of new particles.

ElasticSearch cookbook

CERN Document Server

Paro, Alberto

2013-01-01

Written in an engaging, easy-to-follow style, the recipes will help you to extend the capabilities of ElasticSearch to manage your data effectively.If you are a developer who implements ElasticSearch in your web applications, manage data, or have decided to start using ElasticSearch, this book is ideal for you. This book assumes that you've got working knowledge of JSON and Java

Ozone data assimilation with GEOS-Chem: a comparison between 3-D-Var, 4-D-Var, and suboptimal Kalman filter approaches

Science.gov (United States)

Singh, K.; Sandu, A.; Bowman, K. W.; Parrington, M.; Jones, D. B. A.; Lee, M.

2011-08-01

Chemistry transport models determine the evolving chemical state of the atmosphere by solving the fundamental equations that govern physical and chemical transformations subject to initial conditions of the atmospheric state and surface boundary conditions, e.g., surface emissions. The development of data assimilation techniques synthesize model predictions with measurements in a rigorous mathematical framework that provides observational constraints on these conditions. Two families of data assimilation methods are currently widely used: variational and Kalman filter (KF). The variational approach is based on control theory and formulates data assimilation as a minimization problem of a cost functional that measures the model-observations mismatch. The Kalman filter approach is rooted in statistical estimation theory and provides the analysis covariance together with the best state estimate. Suboptimal Kalman filters employ different approximations of the covariances in order to make the computations feasible with large models. Each family of methods has both merits and drawbacks. This paper compares several data assimilation methods used for global chemical data assimilation. Specifically, we evaluate data assimilation approaches for improving estimates of the summertime global tropospheric ozone distribution in August 2006 based on ozone observations from the NASA Tropospheric Emission Spectrometer and the GEOS-Chem chemistry transport model. The resulting analyses are compared against independent ozonesonde measurements to assess the effectiveness of each assimilation method. All assimilation methods provide notable improvements over the free model simulations, which differ from the ozonesonde measurements by about 20 % (below 200 hPa). Four dimensional variational data assimilation with window lengths between five days and two weeks is the most accurate method, with mean differences between analysis profiles and ozonesonde measurements of 1-5 %. Two sequential

Satisfaction in motion: Subsequent search misses are more likely in moving search displays.

Science.gov (United States)

Stothart, Cary; Clement, Andrew; Brockmole, James R

2018-02-01

People often conduct visual searches in which multiple targets are possible (e.g., medical X-rays can contain multiple abnormalities). In this type of search, observers are more likely to miss a second target after having found a first one (a subsequent search miss). Recent evidence has suggested that this effect may be due to a depletion of cognitive resources from tracking the identities and locations of found targets. Given that tracking moving objects is resource-demanding, would finding a moving target further increase the chances of missing a subsequent one? To address this question, we had participants search for one or more targets hidden among distractors. Subsequent search misses were more likely when the targets and distractors moved throughout the display than when they remained stationary. However, when the found targets were highlighted in a unique color, subsequent search misses were no more likely in moving displays. Together, these results suggest that the effect of movement is likely due to the increased cognitive demands of tracking moving targets. Overall, our findings reveal that activities that involve searching for moving targets (e.g., driving) are more susceptible to subsequent search misses than are those that involve searching for stationary targets (e.g., baggage screening).

Skewed Binary Search Trees

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Moruz, Gabriel

2006-01-01

It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

Searching Harvard Business Review Online. . . Lessons in Searching a Full Text Database.

Science.gov (United States)

Tenopir, Carol

1985-01-01

This article examines the Harvard Business Review Online (HBRO) database (bibliographic description fields, abstracts, extracted information, full text, subject descriptors) and reports on 31 sample HBRO searches conducted in Bibliographic Retrieval Services to test differences between searching full text and searching bibliographic record. Sample…

A Hybrid Genetic Algorithm for the Multiple Crossdocks Problem

Directory of Open Access Journals (Sweden)

Zhaowei Miao

2012-01-01

Full Text Available We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be NP-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure, we propose a hybrid genetic algorithm (HGA integrating greedy technique and variable neighborhood search method to solve the problem. Extensive experiments under different scenarios were conducted, and results show that HGA outperforms CPLEX solver, providing solutions in realistic timescales.

A DIFFERENTIAL EVOLUTION ALGORITHM DEVELOPED FOR A NURSE SCHEDULING PROBLEM

Directory of Open Access Journals (Sweden)

Shahnazari-Shahrezaei, P.

2012-11-01

Full Text Available Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospital managers objectives and nurses preferences as much as possible by generating fair shift schedules. This paper presents a nurse scheduling problem based on a real case study, and proposes two meta-heuristics a differential evolution algorithm (DE and a greedy randomised adaptive search procedure (GRASP to solve it. To investigate the efficiency of the proposed algorithms, two problems are solved. Furthermore, some comparison metrics are applied to examine the reliability of the proposed algorithms. The computational results in this paper show that the proposed DE outperforms the GRASP.

Teknik Perangkingan Meta-search Engine

OpenAIRE

Puspitaningrum, Diyah

2014-01-01

Meta-search engine mengorganisasikan penyatuan hasil dari berbagai search engine dengan tujuan untuk meningkatkan presisi hasil pencarian dokumen web. Pada survei teknik perangkingan meta-search engine ini akan didiskusikan isu-isu pra-pemrosesan, rangking, dan berbagai teknik penggabungan hasil pencarian dari search engine yang berbeda-beda (multi-kombinasi). Isu-isu implementasi penggabungan 2 search engine dan 3 search engine juga menjadi sorotan. Pada makalah ini juga dibahas arahan penel...

BIOMedical Search Engine Framework: Lightweight and customized implementation of domain-specific biomedical search engines.

Science.gov (United States)

Jácome, Alberto G; Fdez-Riverola, Florentino; Lourenço, Anália

2016-07-01

Text mining and semantic analysis approaches can be applied to the construction of biomedical domain-specific search engines and provide an attractive alternative to create personalized and enhanced search experiences. Therefore, this work introduces the new open-source BIOMedical Search Engine Framework for the fast and lightweight development of domain-specific search engines. The rationale behind this framework is to incorporate core features typically available in search engine frameworks with flexible and extensible technologies to retrieve biomedical documents, annotate meaningful domain concepts, and develop highly customized Web search interfaces. The BIOMedical Search Engine Framework integrates taggers for major biomedical concepts, such as diseases, drugs, genes, proteins, compounds and organisms, and enables the use of domain-specific controlled vocabulary. Technologies from the Typesafe Reactive Platform, the AngularJS JavaScript framework and the Bootstrap HTML/CSS framework support the customization of the domain-oriented search application. Moreover, the RESTful API of the BIOMedical Search Engine Framework allows the integration of the search engine into existing systems or a complete web interface personalization. The construction of the Smart Drug Search is described as proof-of-concept of the BIOMedical Search Engine Framework. This public search engine catalogs scientific literature about antimicrobial resistance, microbial virulence and topics alike. The keyword-based queries of the users are transformed into concepts and search results are presented and ranked accordingly. The semantic graph view portraits all the concepts found in the results, and the researcher may look into the relevance of different concepts, the strength of direct relations, and non-trivial, indirect relations. The number of occurrences of the concept shows its importance to the query, and the frequency of concept co-occurrence is indicative of biological relations

Gaps and barriers in the control of blood glucose in people with type 2 diabetes.

Science.gov (United States)

Blonde, Lawrence; Aschner, Pablo; Bailey, Clifford; Ji, Linong; Leiter, Lawrence A; Matthaei, Stephan

2017-05-01

Glycaemic control is suboptimal in a large proportion of people with type 2 diabetes who are consequently at an increased and avoidable risk of potentially severe complications. We sought to explore attitudes and practices among healthcare professionals that may contribute to suboptimal glycaemic control through a review of recent relevant publications in the scientific literature. An electronic search of the PubMed database was performed to identify relevant publications from January 2011 to July 2015. The electronic search was complemented by a manual search of abstracts from key diabetes conferences in 2014/2015 available online. Recently published data indicate that glycaemic control is suboptimal in a substantial proportion (typically 40%-60%) of people with diabetes. This is the case across geographic regions and in both low- and higher-income countries. Therapeutic inertia appears to be an important contributor to poor glycaemic control in up to half of people with type 2 diabetes. In particular, prescribers are often willing to tolerate extended periods of 'mild' hyperglycaemia as well as having low expectations for their patients. There are often delays of 3 years or longer in initiating or intensifying glucose-lowering therapy when needed. Many people with type 2 diabetes are failed by current management, with approximately half not achieving or maintaining appropriate target blood glucose levels, leaving these patients at increased and avoidable risk of serious complications. Review criteria: The methodology of this review article is detailed in the 'Methods' section.

Adaptive Large Neighbourhood Search

DEFF Research Database (Denmark)

Røpke, Stefan

Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution....... This tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers...

Search Tips: MedlinePlus

Science.gov (United States)

... of this page: https://medlineplus.gov/searchtips.html Search Tips To use the sharing features on this page, please enable JavaScript. How do I search MedlinePlus? The search box appears at the top ...

Advanced Search

African Journals Online (AJOL)

Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

Integrated vs. Federated Search

DEFF Research Database (Denmark)

Løvschall, Kasper

2009-01-01

Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009.......Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009....

Correlations in state space can cause sub-optimal adaptation of optimal feedback control models.

Science.gov (United States)

Aprasoff, Jonathan; Donchin, Opher

2012-04-01

Control of our movements is apparently facilitated by an adaptive internal model in the cerebellum. It was long thought that this internal model implemented an adaptive inverse model and generated motor commands, but recently many reject that idea in favor of a forward model hypothesis. In theory, the forward model predicts upcoming state during reaching movements so the motor cortex can generate appropriate motor commands. Recent computational models of this process rely on the optimal feedback control (OFC) framework of control theory. OFC is a powerful tool for describing motor control, it does not describe adaptation. Some assume that adaptation of the forward model alone could explain motor adaptation, but this is widely understood to be overly simplistic. However, an adaptive optimal controller is difficult to implement. A reasonable alternative is to allow forward model adaptation to 're-tune' the controller. Our simulations show that, as expected, forward model adaptation alone does not produce optimal trajectories during reaching movements perturbed by force fields. However, they also show that re-optimizing the controller from the forward model can be sub-optimal. This is because, in a system with state correlations or redundancies, accurate prediction requires different information than optimal control. We find that adding noise to the movements that matches noise found in human data is enough to overcome this problem. However, since the state space for control of real movements is far more complex than in our simple simulations, the effects of correlations on re-adaptation of the controller from the forward model cannot be overlooked.

Search and Disrupt

DEFF Research Database (Denmark)

Ørding Olsen, Anders

. However, incumbent sources engaged in capability reconfiguration to accommodate disruption improve search efforts in disruptive technologies. The paper concludes that the value of external sources is contingent on more than their knowledge. Specifically, interdependence of sources in search gives rise...... to influence from individual strategic interests on the outcomes. More generally, this points to the need for understanding the two-way influence of sources, rather than viewing external search as one-way knowledge accessing....

Using Google Search Appliance (GSA) to search digital library collections: A Case Study of the INIS Collection Search

International Nuclear Information System (INIS)

Savic, Dobrica

2014-01-01

Google Search has established a new standard for information retrieval which did not exist with previous generations of library search facilities. The INIS hosts one of the world’s largest collections of published information on the peaceful uses of nuclear science and technology. It offers on-line access to a unique collection of 3.6 million bibliographic records and 483,000 full texts of non-conventional (grey) literature. This large digital library collection suffered from most of the well-known shortcomings of the classic library catalogue. Searching was complex and complicated, it required training in Boolean logic, full-text searching was not an option, and response time was slow. An opportune moment to improve the system came with the retirement of the previous catalogue software and the adoption of GSA as an organization-wide search engine standard. INIS was quick to realize the potential of using such a well-known application to replace its on-line catalogue. This paper presents the advantages and disadvantages encountered during three years of GSA use. Based on specific INIS-based practice and experience, this paper also offers some guidelines on ways to improve classic collections of millions of bibliographic and full-text documents, while reaping multiple benefits, such as increased use, accessibility, usability, expandability and improving user search and retrieval experiences. (author)

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Science.gov (United States)

Wang, Yifan; Wu, Lingdan; Luo, Liang; Zhang, Yifen; Dong, Guangheng

2017-01-01

The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Directory of Open Access Journals (Sweden)

Yifan Wang

Full Text Available The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Generalised Adaptive Harmony Search: A Comparative Analysis of Modern Harmony Search

Directory of Open Access Journals (Sweden)

Jaco Fourie

2013-01-01

Full Text Available Harmony search (HS was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, and most of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal and multimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.

Federated Search in the Wild: the combined power of over a hundred search engines

NARCIS (Netherlands)

Nguyen, Dong-Phuong; Demeester, Thomas; Trieschnigg, Rudolf Berend; Hiemstra, Djoerd

2012-01-01

Federated search has the potential of improving web search: the user becomes less dependent on a single search provider and parts of the deep web become available through a unified interface, leading to a wider variety in the retrieved search results. However, a publicly available dataset for

Proposta e avaliação de heurísticas grasp para o problema da diversidade máxima

Directory of Open Access Journals (Sweden)

Geiza Cristina da Silva

2006-08-01

Full Text Available O Problema da Diversidade Máxima (PDM consiste em, dado um conjunto N composto de n elementos, selecionar um subconjunto M Ì N de forma tal que os elementos de M possuam a maior diversidade possível entre eles. O PDM pertence à classe de problemas NP-Difícil limitando, com isso, o uso exclusivo de métodos exatos e tornando atrativo o desenvolvimento de novos métodos heurísticos na solução aproximada deste problema. Neste trabalho são propostos métodos heurísticos de construção e busca local que, combinados, são usados como base em diferentes versões do algoritmo GRASP (Greedy Randomized Adaptive Search Procedure. Incluímos como objetivos analisar o impacto destas heurísticas no desempenho da metaheurística GRASP. Resultados computacionais mostram que os algoritmos propostos sempre alcançam uma solução ótima quando esta é conhecida e, para instâncias maiores, apresentam um desempenho médio superior quando comparados com as melhores heurísticas GRASP da literatura.The Maximum Diversity Problem (MDP consists of, given a set N with n elements, selecting a subset M Ì N such that the elements of M have the most possible diversity among them. The MDP belongs to the class of NP-Hard problems limiting the exclusive use of exact methods and turning attractive the development of heuristics to solve the problem. In this work we propose constructive and local search heuristics which are used in different versions of GRASP (Greedy Randomized Adaptive Search Procedure. We also analyze the impact of this heuristics in the GRASP performance. Computational results show that the proposed algorithms always find an optimal solution when this one is known and, for larger instances, produce an average performance better than well known versions of GRASP from the literature.

Knowing How Good Our Searches Are: An Approach Derived from Search Filter Development Methodology

Directory of Open Access Journals (Sweden)

Sarah Hayman

2015-12-01

Full Text Available Objective – Effective literature searching is of paramount importance in supporting evidence based practice, research, and policy. Missed references can have adverse effects on outcomes. This paper reports on the development and evaluation of an online learning resource, designed for librarians and other interested searchers, presenting an evidence based approach to enhancing and testing literature searches. Methods – We developed and evaluated the set of free online learning modules for librarians called Smart Searching, suggesting the use of techniques derived from search filter development undertaken by the CareSearch Palliative Care Knowledge Network and its associated project Flinders Filters. The searching module content has been informed by the processes and principles used in search filter development. The self-paced modules are intended to help librarians and other interested searchers test the effectiveness of their literature searches, provide evidence of search performance that can be used to improve searches, as well as to evaluate and promote searching expertise. Each module covers one of four techniques, or core principles, employed in search filter development: (1 collaboration with subject experts; (2 use of a reference sample set; (3 term identification through frequency analysis; and (4 iterative testing. Evaluation of the resource comprised ongoing monitoring of web analytics to determine factors such as numbers of users and geographic origin; a user survey conducted online elicited qualitative information about the usefulness of the resource. Results – The resource was launched in May 2014. Web analytics show over 6,000 unique users from 101 countries (at 9 August 2015. Responses to the survey (n=50 indicated that 80% would recommend the resource to a colleague. Conclusions – An evidence based approach to searching, derived from search filter development methodology, has been shown to have value as an online learning

Automated Patent Searching in the EPO: From Online Searching to Document Delivery.

Science.gov (United States)

Nuyts, Annemie; Jonckheere, Charles

The European Patent Office (EPO) has recently implemented the last part of its ambitious automation project aimed at creating an automated search environment for approximately 1200 EPO patent search examiners. The examiners now have at their disposal an integrated set of tools offering a full range of functionalities from online searching, via…

Mastering ElasticSearch

CERN Document Server

Kuc, Rafal

2013-01-01

A practical tutorial that covers the difficult design, implementation, and management of search solutions.Mastering ElasticSearch is aimed at to intermediate users who want to extend their knowledge about ElasticSearch. The topics that are described in the book are detailed, but we assume that you already know the basics, like the query DSL or data indexing. Advanced users will also find this book useful, as the examples are getting deep into the internals where it is needed.

Search engine optimization

OpenAIRE

Marolt, Klemen

2013-01-01

Search engine optimization techniques, often shortened to “SEO,” should lead to first positions in organic search results. Some optimization techniques do not change over time, yet still form the basis for SEO. However, as the Internet and web design evolves dynamically, new optimization techniques flourish and flop. Thus, we looked at the most important factors that can help to improve positioning in search results. It is important to emphasize that none of the techniques can guarantee high ...

Custom Search Engines: Tools & Tips

Science.gov (United States)

Notess, Greg R.

2008-01-01

Few have the resources to build a Google or Yahoo! from scratch. Yet anyone can build a search engine based on a subset of the large search engines' databases. Use Google Custom Search Engine or Yahoo! Search Builder or any of the other similar programs to create a vertical search engine targeting sites of interest to users. The basic steps to…

Mapping online consumer search

NARCIS (Netherlands)

Bronnenberg, B.J.; Kim, J.; Albuquerque, P.

2011-01-01

The authors propose a new method to visualize browsing behavior in so-called product search maps. Manufacturers can use these maps to understand how consumers search for competing products before choice, including how information acquisition and product search are organized along brands, product

Search on Rugged Landscapes

DEFF Research Database (Denmark)

Billinger, Stephan; Stieglitz, Nils; Schumacher, Terry

2014-01-01

This paper presents findings from a laboratory experiment on human decision-making in a complex combinatorial task. We find strong evidence for a behavioral model of adaptive search. Success narrows down search to the neighborhood of the status quo, while failure promotes gradually more explorative...... for local improvements too early. We derive stylized decision rules that generate the search behavior observed in the experiment and discuss the implications of our findings for individual decision-making and organizational search....

How to improve your PubMed/MEDLINE searches: 3. advanced searching, MeSH and My NCBI.

Science.gov (United States)

Fatehi, Farhad; Gray, Leonard C; Wootton, Richard

2014-03-01

Although the basic PubMed search is often helpful, the results may sometimes be non-specific. For more control over the search process you can use the Advanced Search Builder interface. This allows a targeted search in specific fields, with the convenience of being able to select the intended search field from a list. It also provides a history of your previous searches. The search history is useful to develop a complex search query by combining several previous searches using Boolean operators. For indexing the articles in MEDLINE, the NLM uses a controlled vocabulary system called MeSH. This standardised vocabulary solves the problem of authors, researchers and librarians who may use different terms for the same concept. To be efficient in a PubMed search, you should start by identifying the most appropriate MeSH terms and use them in your search where possible. My NCBI is a personal workspace facility available through PubMed and makes it possible to customise the PubMed interface. It provides various capabilities that can enhance your search performance.

Employed and unemployed job search methods: Australian evidence on search duration, wages and job stability

OpenAIRE

Colin Green

2012-01-01

This paper examines the use and impact of job search methods of both unemployed and employed job seekers. Informal job search methods are associated with relativel high level of job exit and shorter search duration. Job exists through the public employment agency (PEA) display positive duration dependence for the unemployed. This may suggest that the PEA is used as a job search method of last resort. Informal job search methods have lower associated duration in search and higher wages than th...

Global OpenSearch

Science.gov (United States)

Newman, D. J.; Mitchell, A. E.

2015-12-01

At AGU 2014, NASA EOSDIS demonstrated a case-study of an OpenSearch framework for Earth science data discovery. That framework leverages the IDN and CWIC OpenSearch API implementations to provide seamless discovery of data through the 'two-step' discovery process as outlined by the Federation for Earth Sciences (ESIP) OpenSearch Best Practices. But how would an Earth Scientist leverage this framework and what are the benefits? Using a client that understands the OpenSearch specification and, for further clarity, the various best practices and extensions, a scientist can discovery a plethora of data not normally accessible either by traditional methods (NASA Earth Data Search, Reverb, etc) or direct methods (going to the source of the data) We will demonstrate, via the CWICSmart web client, how an earth scientist can access regional data on a regional phenomena in a uniform and aggregated manner. We will demonstrate how an earth scientist can 'globalize' their discovery. You want to find local data on 'sea surface temperature of the Indian Ocean'? We can help you with that. 'European meteorological data'? Yes. 'Brazilian rainforest satellite imagery'? That too. CWIC allows you to get earth science data in a uniform fashion from a large number of disparate, world-wide agencies. This is what we mean by Global OpenSearch.

Comparison tomography relocation hypocenter grid search and guided grid search method in Java island

International Nuclear Information System (INIS)

Nurdian, S. W.; Adu, N.; Palupi, I. R.; Raharjo, W.

2016-01-01

The main data in this research is earthquake data recorded from 1952 to 2012 with 9162 P wave and 2426 events are recorded by 30 stations located around Java island. Relocation hypocenter processed using grid search and guidded grid search method. Then the result of relocation hypocenter become input for tomography pseudo bending inversion process. It can be used to identification the velocity distribution in subsurface. The result of relocation hypocenter by grid search and guided grid search method after tomography process shown in locally and globally. In locally area grid search method result is better than guided grid search according to geological reseach area. But in globally area the result of guided grid search method is better for a broad area because the velocity variation is more diverse than the other one and in accordance with local geological research conditions. (paper)

Citation searches are more sensitive than keyword searches to identify studies using specific measurement instruments.

Science.gov (United States)

Linder, Suzanne K; Kamath, Geetanjali R; Pratt, Gregory F; Saraykar, Smita S; Volk, Robert J

2015-04-01

To compare the effectiveness of two search methods in identifying studies that used the Control Preferences Scale (CPS), a health care decision-making instrument commonly used in clinical settings. We searched the literature using two methods: (1) keyword searching using variations of "Control Preferences Scale" and (2) cited reference searching using two seminal CPS publications. We searched three bibliographic databases [PubMed, Scopus, and Web of Science (WOS)] and one full-text database (Google Scholar). We report precision and sensitivity as measures of effectiveness. Keyword searches in bibliographic databases yielded high average precision (90%) but low average sensitivity (16%). PubMed was the most precise, followed closely by Scopus and WOS. The Google Scholar keyword search had low precision (54%) but provided the highest sensitivity (70%). Cited reference searches in all databases yielded moderate sensitivity (45-54%), but precision ranged from 35% to 75% with Scopus being the most precise. Cited reference searches were more sensitive than keyword searches, making it a more comprehensive strategy to identify all studies that use a particular instrument. Keyword searches provide a quick way of finding some but not all relevant articles. Goals, time, and resources should dictate the combination of which methods and databases are used. Copyright © 2015 Elsevier Inc. All rights reserved.

Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm

Institute of Scientific and Technical Information of China (English)

Guo Jiansheng; Wang Zutong; Zheng Mingfa; Wang Ying

2014-01-01

Based on the uncertainty theory, this paper is devoted to the redundancy allocation problem in repairable parallel-series systems with uncertain factors, where the failure rate, repair rate and other relative coefficients involved are considered as uncertain variables. The availability of the system and the corresponding designing cost are considered as two optimization objectives. A crisp multiobjective optimization formulation is presented on the basis of uncertainty theory to solve this resultant problem. For solving this problem efficiently, a new multiobjective artificial bee colony algorithm is proposed to search the Pareto efficient set, which introduces rank value and crowding distance in the greedy selection strategy, applies fast non-dominated sort procedure in the exploitation search and inserts tournament selection in the onlooker bee phase. It shows that the proposed algorithm outperforms NSGA-II greatly and can solve multiobjective redundancy allocation problem efficiently. Finally, a numerical example is provided to illustrate this approach.

A HYBRID HEURISTIC ALGORITHM FOR SOLVING THE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP

Directory of Open Access Journals (Sweden)

Juan Carlos Rivera

Full Text Available The Resource Constrained Project Scheduling Problem (RCPSP is a problem of great interest for the scientific community because it belongs to the class of NP-Hard problems and no methods are known that can solve it accurately in polynomial processing times. For this reason heuristic methods are used to solve it in an efficient way though there is no guarantee that an optimal solution can be obtained. This research presents a hybrid heuristic search algorithm to solve the RCPSP efficiently, combining elements of the heuristic Greedy Randomized Adaptive Search Procedure (GRASP, Scatter Search and Justification. The efficiency obtained is measured taking into account the presence of the new elements added to the GRASP algorithm taken as base: Justification and Scatter Search. The algorithms are evaluated using three data bases of instances of the problem: 480 instances of 30 activities, 480 of 60, and 600 of 120 activities respectively, taken from the library PSPLIB available online. The solutions obtained by the developed algorithm for the instances of 30, 60 and 120 are compared with results obtained by other researchers at international level, where a prominent place is obtained, according to Chen (2011.

Searching while loaded: Visual working memory does not interfere with hybrid search efficiency but hybrid search uses working memory capacity.

Science.gov (United States)

Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M

2016-02-01

In "hybrid search" tasks, such as finding items on a grocery list, one must search the scene for targets while also searching the list in memory. How is the representation of a visual item compared with the representations of items in the memory set? Predominant theories would propose a role for visual working memory (VWM) either as the site of the comparison or as a conduit between visual and memory systems. In seven experiments, we loaded VWM in different ways and found little or no effect on hybrid search performance. However, the presence of a hybrid search task did reduce the measured capacity of VWM by a constant amount regardless of the size of the memory or visual sets. These data are broadly consistent with an account in which VWM must dedicate a fixed amount of its capacity to passing visual representations to long-term memory for comparison to the items in the memory set. The data cast doubt on models in which the search template resides in VWM or where memory set item representations are moved from LTM through VWM to earlier areas for comparison to visual items.

Searches at LEP

CERN Document Server

Junk, Tom

2000-01-01

Searches have been conducted for a broad range of new phenomena by the four experiments ALEPH, DELPHI, L3, and OPAL, at LEP2. Each experiment contributes approximately 150 pb-1 of e+e- annihilation data with a mean sqrt(s) of 205.9 GeV in 2000 to these searches (data prepared for the September 5 LEPC meeting). The statistical procedure for setting limits and evaluating the significance of excesses observed in the data is reviewed. Search results are presented for the Standard Model Higgs boson, the neutral Higgs bosons in the MSSM, charged Higgs bosons, invisibly decaying Higgs bosons produced by Higgs-strahlung, and fermiophobic Higgs bosons. Search results are briefly summarized for gauginos, stops, and staus. The photon recoil spectrum is checked for hints of new physics.

Online Patent Searching: The Realities.

Science.gov (United States)

Kaback, Stuart M.

1983-01-01

Considers patent subject searching capabilities of major online databases, noting patent claims, "deep-indexed" files, test searches, retrieval of related references, multi-database searching, improvements needed in indexing of chemical structures, full text searching, improvements needed in handling numerical data, and augmenting a…

The Evolution of Web Searching.

Science.gov (United States)

Green, David

2000-01-01

Explores the interrelation between Web publishing and information retrieval technologies and lists new approaches to Web indexing and searching. Highlights include Web directories; search engines; portalisation; Internet service providers; browser providers; meta search engines; popularity based analysis; natural language searching; links-based…

Panoramic Search: The Interaction of Memory and Vision in Search through a Familiar Scene

Science.gov (United States)

Oliva, Aude; Wolfe, Jeremy M. Arsenio, Helga C.

2004-01-01

How do observers search through familiar scenes? A novel panoramic search method is used to study the interaction of memory and vision in natural search behavior. In panoramic search, observers see part of an unchanging scene larger than their current field of view. A target object can be visible, present in the display but hidden from view, or…

Survival of lactic acid and chlorine dioxide treated Campylobacter jejuni under suboptimal conditions of pH, temperature and modified atmosphere

DEFF Research Database (Denmark)

Smigic, Nada; Rajkovic, Andreja; Nielsen, Dennis Sandris

2010-01-01

As mild decontamination treatments are gaining more and more interest due to increased consumer demands for fresh foods, it is of great importance to establish the influence of decontamination treatments on the subsequent bacterial behaviour under suboptimal storage conditions. For this purpose...... Campylobacter jejuni cells treated with lactic acid (LA, 3% lactic acid, pH 4.0, 2 min) or chlorine dioxide (ClO(2), 20 ppm, 2 min) were inoculated in Bolton broth (pH 6.0) and incubated under 80% O(2)/20% N(2), 80% CO(2)/20% N(2), air or micro-aerophilic (10% CO(2)/85% N(2)/5% O(2)) atmosphere, at 4 degrees C...... on their pH(i) values. The pH(i) response was independent on the surrounding atmosphere since similar distribution of the subpopulations was observed for all tested atmospheres. However, the pH(i) response was dependent on the initial decontamination treatment. The investigation of intracellular parameters...

Can electronic search engines optimize screening of search results in systematic reviews: an empirical study.

Science.gov (United States)

Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li

2006-02-24

Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG and Ovid. Our objective is to test the ability of an Ultraseek search engine to rank MEDLINE records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000-6000 records when the MEDLINE search strategy was replicated. Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have been pre-screened by systematic reviewers.

Web-based information search and retrieval: effects of strategy use and age on search success.

Science.gov (United States)

Stronge, Aideen J; Rogers, Wendy A; Fisk, Arthur D

2006-01-01

The purpose of this study was to investigate the relationship between strategy use and search success on the World Wide Web (i.e., the Web) for experienced Web users. An additional goal was to extend understanding of how the age of the searcher may influence strategy use. Current investigations of information search and retrieval on the Web have provided an incomplete picture of Web strategy use because participants have not been given the opportunity to demonstrate their knowledge of Web strategies while also searching for information on the Web. Using both behavioral and knowledge-engineering methods, we investigated searching behavior and system knowledge for 16 younger adults (M = 20.88 years of age) and 16 older adults (M = 67.88 years). Older adults were less successful than younger adults in finding correct answers to the search tasks. Knowledge engineering revealed that the age-related effect resulted from ineffective search strategies and amount of Web experience rather than age per se. Our analysis led to the development of a decision-action diagram representing search behavior for both age groups. Older adults had more difficulty than younger adults when searching for information on the Web. However, this difficulty was related to the selection of inefficient search strategies, which may have been attributable to a lack of knowledge about available Web search strategies. Actual or potential applications of this research include training Web users to search more effectively and suggestions to improve the design of search engines.

PIE the search: searching PubMed literature for protein interaction information.

Science.gov (United States)

Kim, Sun; Kwon, Dongseop; Shin, Soo-Yong; Wilbur, W John

2012-02-15

Finding protein-protein interaction (PPI) information from literature is challenging but an important issue. However, keyword search in PubMed(®) is often time consuming because it requires a series of actions that refine keywords and browse search results until it reaches a goal. Due to the rapid growth of biomedical literature, it has become more difficult for biologists and curators to locate PPI information quickly. Therefore, a tool for prioritizing PPI informative articles can be a useful assistant for finding this PPI-relevant information. PIE (Protein Interaction information Extraction) the search is a web service implementing a competition-winning approach utilizing word and syntactic analyses by machine learning techniques. For easy user access, PIE the search provides a PubMed-like search environment, but the output is the list of articles prioritized by PPI confidence scores. By obtaining PPI-related articles at high rank, researchers can more easily find the up-to-date PPI information, which cannot be found in manually curated PPI databases. http://www.ncbi.nlm.nih.gov/IRET/PIE/.

Nonmyopic Sensor Scheduling and its Efficient Implementation for Target Tracking Applications

Directory of Open Access Journals (Sweden)

Morrell Darryl

2006-01-01

Full Text Available We propose two nonmyopic sensor scheduling algorithms for target tracking applications. We consider a scenario where a bearing-only sensor is constrained to move in a finite number of directions to track a target in a two-dimensional plane. Both algorithms provide the best sensor sequence by minimizing a predicted expected scheduler cost over a finite time-horizon. The first algorithm approximately computes the scheduler costs based on the predicted covariance matrix of the tracker error. The second algorithm uses the unscented transform in conjunction with a particle filter to approximate covariance-based costs or information-theoretic costs. We also propose the use of two branch-and-bound-based optimal pruning algorithms for efficient implementation of the scheduling algorithms. We design the first pruning algorithm by combining branch-and-bound with a breadth-first search and a greedy-search; the second pruning algorithm combines branch-and-bound with a uniform-cost search. Simulation results demonstrate the advantage of nonmyopic scheduling over myopic scheduling and the significant savings in computational and memory resources when using the pruning algorithms.

A new approach to shortest paths on networks based on the quantum bosonic mechanism

Energy Technology Data Exchange (ETDEWEB)

Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

2011-01-15

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

Target-nontarget similarity decreases search efficiency and increases stimulus-driven control in visual search.

Science.gov (United States)

Barras, Caroline; Kerzel, Dirk

2017-10-01

Some points of criticism against the idea that attentional selection is controlled by bottom-up processing were dispelled by the attentional window account. The attentional window account claims that saliency computations during visual search are only performed for stimuli inside the attentional window. Therefore, a small attentional window may avoid attentional capture by salient distractors because it is likely that the salient distractor is located outside the window. In contrast, a large attentional window increases the chances of attentional capture by a salient distractor. Large and small attentional windows have been associated with efficient (parallel) and inefficient (serial) search, respectively. We compared the effect of a salient color singleton on visual search for a shape singleton during efficient and inefficient search. To vary search efficiency, the nontarget shapes were either similar or dissimilar with respect to the shape singleton. We found that interference from the color singleton was larger with inefficient than efficient search, which contradicts the attentional window account. While inconsistent with the attentional window account, our results are predicted by computational models of visual search. Because of target-nontarget similarity, the target was less salient with inefficient than efficient search. Consequently, the relative saliency of the color distractor was higher with inefficient than with efficient search. Accordingly, stronger attentional capture resulted. Overall, the present results show that bottom-up control by stimulus saliency is stronger when search is difficult, which is inconsistent with the attentional window account.

Prices and heterogeneous search costs

NARCIS (Netherlands)

Luis Moraga-Gonzalez, Jose; Sandor, Zsolt; Wildenbeest, Matthijs R.

2017-01-01

We study price formation in a model of consumer search for differentiated products in which consumers have heterogeneous search costs. We provide conditions under which a pure-strategy symmetric Nash equilibrium exists and is unique. Search costs affect two margins-the intensive search margin (or

Search Analytics for Your Site

CERN Document Server

Rosenfeld, Louis

2011-01-01

Any organization that has a searchable web site or intranet is sitting on top of hugely valuable and usually under-exploited data: logs that capture what users are searching for, how often each query was searched, and how many results each query retrieved. Search queries are gold: they are real data that show us exactly what users are searching for in their own words. This book shows you how to use search analytics to carry on a conversation with your customers: listen to and understand their needs, and improve your content, navigation and search performance to meet those needs.

ElasticSearch server

CERN Document Server

Rogozinski, Marek

2014-01-01

This book is a detailed, practical, hands-on guide packed with real-life scenarios and examples which will show you how to implement an ElasticSearch search engine on your own websites.If you are a web developer or a user who wants to learn more about ElasticSearch, then this is the book for you. You do not need to know anything about ElastiSeach, Java, or Apache Lucene in order to use this book, though basic knowledge about databases and queries is required.

Complete local search with memory

NARCIS (Netherlands)

Ghosh, D.; Sierksma, G.

2000-01-01

Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic

The search for the top quark

International Nuclear Information System (INIS)

Barbaro-Galtieri, A.

1989-03-01

This paper discusses the following topics: top search in the near future, general remarks, top search at HERA, searching for the top quarks at the Z 0 machines, finding the top at Lep II, top search in UA2, top search in UA1, and top search at CDF. 58 refs., 38 figs

Indirect search for New Physics: complementarity to direct searches

CERN Document Server

Mahmoudi, F

2013-01-01

We present an overview on the interplay between direct searches for new physics at the LHC and indirect constraints from the flavour sector, with an emphasis on the implications of the recent LHCb results. The complementarity with the Higgs search results will also be addressed. We show the correlation and complementarity between the different sectors in the context of a few specific examples in supersymmetry.

Suboptimal management of central nervous system infections in children: a multi-centre retrospective study

Directory of Open Access Journals (Sweden)

Kelly Christine

2012-09-01

Full Text Available Abstract Objective We aimed to audit the regional management of central nervous system (CNS infection in children. Methods The study was undertaken in five district general hospitals and one tertiary paediatric hospital in the Mersey region of the UK. Children admitted to hospital with a suspected CNS infection over a three month period were identified. Children were aged between 4 weeks and 16 years old. Details were recorded from the case notes and electronic records. We measured the appropriateness of management pathways as outlined by national and local guidelines. Results Sixty-five children were identified with a median age of 6 months (range 1 month to 15 years. Ten had a CNS infection: 4 aseptic meningitis, 3 purulent meningitis, 3 encephalitis [2 with herpes simplex virus (HSV type 1]. A lumbar puncture (LP was attempted in 50 (77% cases but only 43 had cerebrospinal fluid (CSF available for analysis. Of these 24 (57% had a complete standard set of tests performed. Fifty eight (89% received a third generation cephalosporin. Seventeen (26% also received aciclovir with no obvious indication in 9 (53%. Only 11 (65% of those receiving aciclovir had CSF herpes virus PCR. Seventeen had cranial imaging and it was the first management step in 14. Treatment lengths of both antibiotics and aciclovir were highly variable: one child with HSV encephalitis was only treated with aciclovir for 7 days. Conclusions The clinical management of children with suspected CNS infections across the Mersey region is heterogeneous and often sub-optimal, particularly for the investigation and treatment of viral encephalitis. National guidelines for the management of viral encephalitis are needed.

A Literature Review of Indexing and Searching Techniques Implementation in Educational Search Engines

Science.gov (United States)

El Guemmat, Kamal; Ouahabi, Sara

2018-01-01

The objective of this article is to analyze the searching and indexing techniques of educational search engines' implementation while treating future challenges. Educational search engines could greatly help in the effectiveness of e-learning if used correctly. However, these engines have several gaps which influence the performance of e-learning…

29 CFR 4050.4 - Diligent search.

Science.gov (United States)

2010-07-01

... 29 Labor 9 2010-07-01 2010-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than 6...

Standardization of Keyword Search Mode

Science.gov (United States)

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…

Suboptimal T-cell receptor signaling compromises protein translation, ribosome biogenesis, and proliferation of mouse CD8 T cells.

Science.gov (United States)

Tan, Thomas C J; Knight, John; Sbarrato, Thomas; Dudek, Kate; Willis, Anne E; Zamoyska, Rose

2017-07-25

Global transcriptomic and proteomic analyses of T cells have been rich sources of unbiased data for understanding T-cell activation. Lack of full concordance of these datasets has illustrated that important facets of T-cell activation are controlled at the level of translation. We undertook translatome analysis of CD8 T-cell activation, combining polysome profiling and microarray analysis. We revealed that altering T-cell receptor stimulation influenced recruitment of mRNAs to heavy polysomes and translation of subsets of genes. A major pathway that was compromised, when TCR signaling was suboptimal, was linked to ribosome biogenesis, a rate-limiting factor in both cell growth and proliferation. Defective TCR signaling affected transcription and processing of ribosomal RNA precursors, as well as the translation of specific ribosomal proteins and translation factors. Mechanistically, IL-2 production was compromised in weakly stimulated T cells, affecting the abundance of Myc protein, a known regulator of ribosome biogenesis. Consequently, weakly activated T cells showed impaired production of ribosomes and a failure to maintain proliferative capacity after stimulation. We demonstrate that primary T cells respond to various environmental cues by regulating ribosome biogenesis and mRNA translation at multiple levels to sustain proliferation and differentiation.

Measuring Personalization of Web Search

DEFF Research Database (Denmark)

Hannak, Aniko; Sapiezynski, Piotr; Kakhki, Arash Molavi

2013-01-01

are simply unable to access information that the search engines’ algorithm decidesis irrelevant. Despitetheseconcerns, there has been little quantification of the extent of personalization in Web search today, or the user attributes that cause it. In light of this situation, we make three contributions...... as a result of searching with a logged in account and the IP address of the searching user. Our results are a first step towards understanding the extent and effects of personalization on Web search engines today....

Policy implications for familial searching.

Science.gov (United States)

Kim, Joyce; Mammo, Danny; Siegel, Marni B; Katsanis, Sara H

2011-11-01

In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforcement agencies a powerful tool for developing investigative leads, apprehending criminals, revitalizing cold cases and exonerating wrongfully convicted individuals. As familial searching involves a range of logistical, social, ethical and legal considerations, states are now grappling with policy options for implementing familial searching to balance crime fighting with its potential impact on society. When developing policies for familial searching, legislators should take into account the impact of familial searching on select populations and the need to minimize personal intrusion on relatives of individuals in the DNA database. This review describes the approaches used to narrow a suspect pool from a partial match search of CODIS and summarizes the economic, ethical, logistical and political challenges of implementing familial searching. We examine particular US state policies and the policy options adopted to address these issues. The aim of this review is to provide objective background information on the controversial approach of familial searching to inform policy decisions in this area. Herein we highlight key policy options and recommendations regarding effective utilization of familial searching that minimize harm to and afford maximum protection of US citizens.

The impact of PICO as a search strategy tool on literature search quality

DEFF Research Database (Denmark)

Eriksen, Mette Brandt; Frandsen, Tove Faber

2018-01-01

Objective: This review aimed to determine, if the use of the PICO model (Patient Intervention Comparison Outcome) as a search strategy tool affects the quality of the literature search. Methods: A comprehensive literature search was conducted in: PubMed, Embase, CINAHL, PsycInfo, Cochrane Library...... and three studies were included, data was extracted, risk of bias was assessed and a qualitative analysis was conducted. The included studies compared PICO to PIC or link to related articles in PubMed; PICOS and SPIDER. One study compared PICO to unguided searching. Due to differences in intervention...

Search strategies

Science.gov (United States)

Oliver, B. M.

Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.

A Simulation of Readiness-Based Sparing Policies

Science.gov (United States)

2017-06-01

variant of a greedy heuristic algorithm to set stock levels and estimate overall WS availability. Our discrete event simulation is then used to test the...variant of a greedy heuristic algorithm to set stock levels and estimate overall WS availability. Our discrete event simulation is then used to test the...WS Type with 22 Individual WS at a Representative Site.....................................................................................31

Surface-Assisted Dynamic Search Processes.

Science.gov (United States)

Shin, Jaeoh; Kolomeisky, Anatoly B

2018-03-01

Many chemical and biological systems exhibit intermittent search phenomena when participating particles alternate between dynamic regimes with different dimensionalities. Here we investigate theoretically a dynamic search process of finding a small target on a two-dimensional surface starting from a bulk solution, which is an example of such an intermittent search process. Both continuum and discrete-state stochastic descriptions are developed. It is found that depending on the scanning length λ, which describes the area visited by the reacting molecule during one search cycle, the system can exhibit three different search regimes: (i) For small λ values, the reactant finds the target mostly via three-dimensional bulk diffusion; (ii) for large λ values, the reactant molecule associates to the target mostly via surface diffusion; and (iii) for intermediate λ values, the reactant reaches the target via a combination of three-dimensional and two-dimensional search cycles. Our analysis also shows that the mean search times have different scalings as a function of the size of the surface segment depending on the nature of the dynamic search regime. Search dynamics are also sensitive to the position of the target for large scanning lengths. In addition, it is argued that the continuum description underestimates mean search times and does not always correctly describe the most optimal conditions for the surface-assisted dynamic processes. The importance of our findings for real natural systems is discussed.

Improving IMRT-plan quality with MLC leaf position refinement post plan optimization

International Nuclear Information System (INIS)

Niu Ying; Zhang Guowei; Berman, Barry L.; Parke, William C.; Yi Byongyong; Yu, Cedric X.

2012-01-01

Purpose: In intensity-modulated radiation therapy (IMRT) planning, reducing the pencil-beam size may lead to a significant improvement in dose conformity, but also increase the time needed for the dose calculation and plan optimization. The authors develop and evaluate a postoptimization refinement (POpR) method, which makes fine adjustments to the multileaf collimator (MLC) leaf positions after plan optimization, enhancing the spatial precision and improving the plan quality without a significant impact on the computational burden. Methods: The authors’ POpR method is implemented using a commercial treatment planning system based on direct aperture optimization. After an IMRT plan is optimized using pencil beams with regular pencil-beam step size, a greedy search is conducted by looping through all of the involved MLC leaves to see if moving the MLC leaf in or out by half of a pencil-beam step size will improve the objective function value. The half-sized pencil beams, which are used for updating dose distribution in the greedy search, are derived from the existing full-sized pencil beams without need for further pencil-beam dose calculations. A benchmark phantom case and a head-and-neck (HN) case are studied for testing the authors’ POpR method. Results: Using a benchmark phantom and a HN case, the authors have verified that their POpR method can be an efficient technique in the IMRT planning process. Effectiveness of POpR is confirmed by noting significant improvements in objective function values. Dosimetric benefits of POpR are comparable to those of using a finer pencil-beam size from the optimization start, but with far less computation and time. Conclusions: The POpR is a feasible and practical method to significantly improve IMRT-plan quality without compromising the planning efficiency.

A powerful search for EDMS 6

CERN Multimedia

2015-01-01

Since the end of May, EDMS 6 has featured a brand new search solution. You might have already noticed the changes if you have run the search recently. We have integrated EDMS with the central CERN Search service, allowing EDMS to benefit from the central engine for queries and CERN search from EDMS public data, which can now be found directly via the CERN Search portal. The integration is a result of a very successful collaboration between the EDMS and the CERN Search teams.   What’s new in EDMS search The most important advantage of the new search is enabling searches in the files. While in the old search you could query only the document metadata, now the search also scans the content of the files attached to the documents. This allows for more relevant results, as the hit may be found both in the metadata or in the file. The result is displayed in the Documents & Files tab and the small icon indicates whether the object in which the queried terms were found is a file or a docume...

The development of organized visual search

Science.gov (United States)

Woods, Adam J.; Goksun, Tilbe; Chatterjee, Anjan; Zelonis, Sarah; Mehta, Anika; Smith, Sabrina E.

2013-01-01

Visual search plays an important role in guiding behavior. Children have more difficulty performing conjunction search tasks than adults. The present research evaluates whether developmental differences in children's ability to organize serial visual search (i.e., search organization skills) contribute to performance limitations in a typical conjunction search task. We evaluated 134 children between the ages of 2 and 17 on separate tasks measuring search for targets defined by a conjunction of features or by distinct features. Our results demonstrated that children organize their visual search better as they get older. As children's skills at organizing visual search improve they become more accurate at locating targets with conjunction of features amongst distractors, but not for targets with distinct features. Developmental limitations in children's abilities to organize their visual search of the environment are an important component of poor conjunction search in young children. In addition, our findings provide preliminary evidence that, like other visuospatial tasks, exposure to reading may influence children's spatial orientation to the visual environment when performing a visual search. PMID:23584560

Heuristic Search Theory and Applications

CERN Document Server

Edelkamp, Stefan

2011-01-01

Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constra

Human memory search

NARCIS (Netherlands)

Davelaar, E.J.; Raaijmakers, J.G.W.; Hills, T.T.; Robbins, T.W.; Todd, P.M.

2012-01-01

The importance of understanding human memory search is hard to exaggerate: we build and live our lives based on what whe remember. This chapter explores the characteristics of memory search, with special emphasis on the use of retrieval cues. We introduce the dependent measures that are obtained

Spatial search by quantum walk

International Nuclear Information System (INIS)

Childs, Andrew M.; Goldstone, Jeffrey

2004-01-01

Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order √(N) for d>2, and in time of order √(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous-time quantum walk on a graph. The case of the complete graph gives the continuous-time search algorithm of Farhi and Gutmann, and other previously known results can be used to show that √(N) speedup can also be achieved on the hypercube. We show that full √(N) speedup can be achieved on a d-dimensional periodic lattice for d>4. In d=4, the quantum walk search algorithm takes time of order √(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup

Axion Searches, Old and New

CERN Multimedia

CERN. Geneva

2005-01-01

Outline of the lecture: Constraints from laboratory searches and astrophysics, axion cosmology, the cavity detector of dark matter axions, solar axion searches, laser experiments, a telescope search, macroscopic forces mediated by axions.

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

Science.gov (United States)

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.

Process-oriented semantic web search

CERN Document Server

Tran, DT

2011-01-01

The book is composed of two main parts. The first part is a general study of Semantic Web Search. The second part specifically focuses on the use of semantics throughout the search process, compiling a big picture of Process-oriented Semantic Web Search from different pieces of work that target specific aspects of the process.In particular, this book provides a rigorous account of the concepts and technologies proposed for searching resources and semantic data on the Semantic Web. To collate the various approaches and to better understand what the notion of Semantic Web Search entails, this bo

Pro SharePoint 2010 Search

CERN Document Server

Noble, J; Bakman-Mikalski, Dan

2011-01-01

Pro SharePoint 2010 Search gives you expert advice on planning, deploying and customizing searches in SharePoint 2010. Drawing on the authors' extensive experience of working with real-world SharePoint deployments, this book teaches everything you'll need to know to create well-designed SharePoint solutions that always keep the end-user's experience in mind. Increase your search efficiency with SharePoint 2010's search functionality: extend the search user interface using third-party tools, and utilize analytics to improve relevancy. This practical hands-on book is a must-have resource for any

Composite Differential Search Algorithm

Directory of Open Access Journals (Sweden)

Bo Liu

2014-01-01

Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.

Maximum relevance, minimum redundancy band selection based on neighborhood rough set for hyperspectral data classification

International Nuclear Information System (INIS)

Liu, Yao; Chen, Yuehua; Tan, Kezhu; Xie, Hong; Wang, Liguo; Xie, Wu; Yan, Xiaozhen; Xu, Zhen

2016-01-01

Band selection is considered to be an important processing step in handling hyperspectral data. In this work, we selected informative bands according to the maximal relevance minimal redundancy (MRMR) criterion based on neighborhood mutual information. Two measures MRMR difference and MRMR quotient were defined and a forward greedy search for band selection was constructed. The performance of the proposed algorithm, along with a comparison with other methods (neighborhood dependency measure based algorithm, genetic algorithm and uninformative variable elimination algorithm), was studied using the classification accuracy of extreme learning machine (ELM) and random forests (RF) classifiers on soybeans’ hyperspectral datasets. The results show that the proposed MRMR algorithm leads to promising improvement in band selection and classification accuracy. (paper)

Self-regulation during job search: the opposing effects of employment self-efficacy and job search behavior self-efficacy.

Science.gov (United States)

Liu, Songqi; Wang, Mo; Liao, Hui; Shi, Junqi

2014-11-01

Adopting a self-regulatory perspective, the current study examined the within-person relationships among job search cognitions, job search behaviors, and job search success (i.e., number of job offers received). Specifically, conceptualizing job search behaviors as guided by a hierarchy of means-end (i.e., job search behavior-employment) goal structure, we differentiated employment self-efficacy from job search behavior self-efficacy. Our results showed that higher levels of perceived job search progress could lead to more frequent job search behaviors through enhancing job search behavior self-efficacy. However, higher levels of perceived job search progress could also lead to less frequent job search behaviors through elevating employment self-efficacy. In addition, the relationships between perceived job search progress and efficacy beliefs were moderated by job seekers' level of internal attribution of their progress. Finally, we found that at the within-person level, frequency of job search behaviors was positively related to number of job offers received. These findings were discussed in terms of their theoretical and practical implications. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Using a Google Search Appliance (GSA to search digital library collections: a case study of the INIS Collection Search

Directory of Open Access Journals (Sweden)

Dobrica Savic

2014-05-01

The International Nuclear Information System (INIS hosts one of the world’s largest collections of published information on the peaceful uses of nuclear science and technology. It offers online access to a unique collection of 3.6 million bibliographic records and 320,000 full-texts of non-conventional (grey literature. This large digital library collection suffered from most of the well-known shortcomings of the classic library catalogue. Searching was complex and complicated, required some training in using Boolean logic, full-text searching was not an option, and the response time was slow. An opportune moment came with the retirement of the previous catalogue software and with the adoption of Google Search Appliance (GSA as an organization-wide search engine standard. INIS was quick to realize a great potential in using such a well-known application as a replacement for its online catalogue and this paper presents the advantages and disadvantages encountered during three years of GSA use. Based on specific INIS-based practice and experience, this paper also offers some guidelines on ways to improve classic collections of millions of bibliographic and full-text documents, while achieving multiple benefits such as increased use, accessibility, usability, expandability and improving the user search and retrieval experience.

Searches for new particles at LEP

International Nuclear Information System (INIS)

Jimack, M.P.

1991-01-01

A review of searches for new particles at LEP is presented, including top b' quark searches; L ± , L 0 searches; searches for SUSY particles, the minimal standard mode Higgs boson; search for the h 0 (A 0 ); search for the H ± ; composite systems. No evidence for new physics has been seen, and mass limits are placed on new quarks and leptons, supersymmetric particles, Higgs particles and composite objects. (R.P.) 27 refs., 14 figs., 7 tabs

Multimedia Search Engines : Concept, Performance, and Types

OpenAIRE

Sayed Rabeh Sayed

2005-01-01

A Research about multimedia search engines, it starts with definition of search engines at general and multimedia search engines, then explains how they work, and divided them into: Video search engines, Images search engines, and Audio search engines. Finally, it reviews a samples to multimedia search engines.

Who should be searching? Differences in personality can affect visual search accuracy

OpenAIRE

Biggs, A. T.; Clark, K.; Mitroff, S. R.

2017-01-01

Visual search is an everyday task conducted in a wide variety of contexts. Some searches are mundane, such as finding a beverage in the refrigerator, and some have life-or-death consequences, such as finding improvised explosives at a security checkpoint or within a combat zone. Prior work has shown numerous influences on search, including “bottom-up” (physical stimulus attributes) and “top-down” factors (task-relevant or goal-driven aspects). Recent work has begun to focus on “observer-speci...