Sample records for assignment algorithm asset-based

  1. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan


    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...... technique. Computational results for the new algorithm are presented...

  2. Dynamic traffic assignment : genetic algorithms approach (United States)


    Real-time route guidance is a promising approach to alleviating congestion on the nations highways. A dynamic traffic assignment model is central to the development of guidance strategies. The artificial intelligence technique of genetic algorithm...

  3. Bandit-Inspired Memetic Algorithms for Solving Quadratic Assignment Problems

    NARCIS (Netherlands)

    Puglierin, Francesco; Drugan, Madalina M.; Wiering, Marco


    In this paper we propose a novel algorithm called the Bandit-Inspired Memetic Algorithm (BIMA) and we have applied it to solve different large instances of the Quadratic Assignment Problem (QAP). Like other memetic algorithms, BIMA makes use of local search and a population of solutions. The novelty

  4. Spectrum Assignment Algorithm for Cognitive Machine-to-Machine Networks

    Directory of Open Access Journals (Sweden)

    Soheil Rostami


    Full Text Available A novel aggregation-based spectrum assignment algorithm for Cognitive Machine-To-Machine (CM2M networks is proposed. The introduced algorithm takes practical constraints including interference to the Licensed Users (LUs, co-channel interference (CCI among CM2M devices, and Maximum Aggregation Span (MAS into consideration. Simulation results show clearly that the proposed algorithm outperforms State-Of-The-Art (SOTA algorithms in terms of spectrum utilisation and network capacity. Furthermore, the convergence analysis of the proposed algorithm verifies its high convergence rate.

  5. Ant Colony Algorithm and Simulation for Robust Airport Gate Assignment

    Directory of Open Access Journals (Sweden)

    Hui Zhao


    Full Text Available Airport gate assignment is core task for airport ground operations. Due to the fact that the departure and arrival time of flights may be influenced by many random factors, the airport gate assignment scheme may encounter gate conflict and many other problems. This paper aims at finding a robust solution for airport gate assignment problem. A mixed integer model is proposed to formulate the problem, and colony algorithm is designed to solve this model. Simulation result shows that, in consideration of robustness, the ability of antidisturbance for airport gate assignment scheme has much improved.

  6. Restart-Based Genetic Algorithm for the Quadratic Assignment Problem (United States)

    Misevicius, Alfonsas

    The power of genetic algorithms (GAs) has been demonstrated for various domains of the computer science, including combinatorial optimization. In this paper, we propose a new conceptual modification of the genetic algorithm entitled a "restart-based genetic algorithm" (RGA). An effective implementation of RGA for a well-known combinatorial optimization problem, the quadratic assignment problem (QAP), is discussed. The results obtained from the computational experiments on the QAP instances from the publicly available library QAPLIB show excellent performance of RGA. This is especially true for the real-life like QAPs.

  7. Clustered Self Organising Migrating Algorithm for the Quadratic Assignment Problem (United States)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman


    An approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Self Organising Migrating Algorithm (SOMA) is modified using this approach and vetted with the Quadratic Assignment Problem (QAP). Extensive experimentation is conducted on benchmark problems in this area.

  8. Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation

    Directory of Open Access Journals (Sweden)

    Ümit Çiftçi


    Full Text Available The goal of paper is to develop an algorithm that evaluates students then places them depending on their desired choices according to dependant preferences. The developed algorithm is also used to implement software. The success and accuracy of the software as well as the algorithm are tested by applying it to ability test at Beykent University. This ability test is repeated several times in order to fill all available places at Fine Art Faculty departments in every academic year. It has been shown that this algorithm is very fast and rigorous after application of 2008-2009 and 2009-20010 academic years.Key Words: Assignment algorithm, student placement, ability test

  9. NMR assignments of sparsely labeled proteins using a genetic algorithm. (United States)

    Gao, Qi; Chalmers, Gordon R; Moremen, Kelley W; Prestegard, James H


    Sparse isotopic labeling of proteins for NMR studies using single types of amino acid ((15)N or (13)C enriched) has several advantages. Resolution is enhanced by reducing numbers of resonances for large proteins, and isotopic labeling becomes economically feasible for glycoproteins that must be expressed in mammalian cells. However, without access to the traditional triple resonance strategies that require uniform isotopic labeling, NMR assignment of crosspeaks in heteronuclear single quantum coherence (HSQC) spectra is challenging. We present an alternative strategy which combines readily accessible NMR data with known protein domain structures. Based on the structures, chemical shifts are predicted, NOE cross-peak lists are generated, and residual dipolar couplings (RDCs) are calculated for each labeled site. Simulated data are then compared to measured values for a trial set of assignments and scored. A genetic algorithm uses the scores to search for an optimal pairing of HSQC crosspeaks with labeled sites. While none of the individual data types can give a definitive assignment for a particular site, their combination can in most cases. Four test proteins previously assigned using triple resonance methods and a sparsely labeled glycosylated protein, Robo1, previously assigned by manual analysis, are used to validate the method and develop a criterion for identifying sites assigned with high confidence.

  10. Application of a Dynamic Programming Algorithm for Weapon Target Assignment (United States)


    responsible for its safe custody. UNCLASSIFIED UNCLASSIFIED Application of a Dynamic Programming Algorithm for Weapon Target Assignment...the technique used. As a precaution , such techniques are generally referred to as suboptimal. As mentioned above, an exact solution can only be...Skovde, Sweden, 2010. [5] K. C. Jha, “Very Large-Scale Neighborhood Search Heuristics for Combinatorial Optimization Problems,” University of Florida

  11. A Fourier space algorithm for solving quadratic assignment problems


    Kondor, Risi


    The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the traveling salesman all reduce to special cases of the QAP. In this paper we propose a new approach to the QAP based on the theory of non–commutative Fourier analysis on the symmetric group. Specifically, we present a branch–and–bound algorithm that performs both the branching and the bound...

  12. Consultant-Guided Search Algorithms for the Quadratic Assignment Problem (United States)

    Iordache, Serban

    Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes of problems. In this paper, we propose an algorithm for the Quadratic Assignment Problem (QAP), which hybridizes CGS with a local search procedure. Our experimental results show that CGS is able to compete in terms of solution quality with one of the best Ant Colony Optimization algorithms, the MAX-MIN Ant System.

  13. Study on Fleet Assignment Problem Model and Algorithm

    Directory of Open Access Journals (Sweden)

    Yaohua Li


    Full Text Available The Fleet Assignment Problem (FAP of aircraft scheduling in airlines is studied, and the optimization model of FAP is proposed. The objective function of this model is revenue maximization, and it considers comprehensively the difference of scheduled flights and aircraft models in flight areas and mean passenger flows. In order to solve the model, a self-adapting genetic algorithm is supposed to solve the model, which uses natural number coding, adjusts dynamically crossover and mutation operator probability, and adopts intelligent heuristic adjusting to quicken optimization pace. The simulation with production data of an airline shows that the model and algorithms suggested in this paper are feasible and have a good application value.

  14. A Method Based on Dial's Algorithm for Multi-time Dynamic Traffic Assignment

    Directory of Open Access Journals (Sweden)

    Rongjie Kuang


    Full Text Available Due to static traffic assignment has poor performance in reflecting actual case and dynamic traffic assignment may incurs excessive compute cost, method of multi-time dynamic traffic assignment combining static and dynamic traffic assignment balances factors of precision and cost effectively. A method based on Dial's logit algorithm is proposed in the article to solve the dynamic stochastic user equilibrium problem in dynamic traffic assignment. Before that, a fitting function that can proximately reflect overloaded traffic condition of link is proposed and used to give corresponding model. Numerical example is given to illustrate heuristic procedure of method and to compare results with one of same example solved by other literature's algorithm. Results show that method based on Dial's algorithm is preferable to algorithm from others.

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

    Energy Technology Data Exchange (ETDEWEB)

    Volk, Jochen [ETH Zuerich, Institut fuer Molekularbiologie und Biophysik (Switzerland); Herrmann, Torsten [Universite de Lyon, CNRS/ENS Lyon/UCB-Lyon 1 (France); Wuethrich, Kurt [ETH Zuerich, Institut fuer Molekularbiologie und Biophysik (Switzerland)], E-mail:


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


    Directory of Open Access Journals (Sweden)

    J. Sánchez


    Full Text Available This paper presents the results of the performance evaluation, through analytical and simulation models, of a HighSpeed Packet Switch with a New Bus Assignment Algorithm, designed and developed at the Research andAdvanced Studies Center of National Polytechnic Institute in Guadalajara, México (CINVESTAV-GDL. The analyticalmodel is tested under two different arrival processes: Binomial and Poisson distributions. The simulation model istested with two bus assignment algorithms: Fixed Start and Rotated Start . The performance parameters consideredare: Cell Loss Rate, Delay and Throughput.

  17. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing. (United States)

    Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian


    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  18. Simulated annealing algorithm for solving chambering student-case assignment problem (United States)

    Ghazali, Saadiah; Abdul-Rahman, Syariza


    The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.

  19. Joint Equipment Support Task Assignment Model and Simulation Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    ying Ma Hai


    Full Text Available With the transformation of the war pattern under the information conditions, the corresponding object of equipment support also changes from “equipment-oriented” to “warfare-oriented”, and the equipment implement the joint support. Based on the characteristics of the equipment support task under the system combat conditions, the Joint Equipment Support task assignment model with the shortest transition time is established, and a model algorithm based on genetic algorithm is proposed. The validity and accuracy of the model and the algorithm are verified by the example simulation.

  20. An algorithm was developed to assign GRADE levels of evidence to comparisons within systematic reviews. (United States)

    Pollock, Alex; Farmer, Sybil E; Brady, Marian C; Langhorne, Peter; Mead, Gillian E; Mehrholz, Jan; van Wijck, Frederike; Wiffen, Philip J


    One recommended use of the Grading of Recommendations Assessment, Development and Evaluation (GRADE) approach is supporting quality assessment of evidence of comparisons included within a Cochrane overview of reviews. Within our overview, reviewers found that current GRADE guidance was insufficient to make reliable and consistent judgments. To support our ratings, we developed an algorithm to grade quality of evidence using concrete rules. Using a pragmatic, exploratory approach, we explored the challenges of applying GRADE levels of evidence and developed an algorithm to applying GRADE levels of evidence in a consistent and transparent approach. Our methods involved application of algorithms and formulas to samples of reviews, expert panel discussion, and iterative refinement and revision. The developed algorithm incorporated four key criteria: number of participants, risk of bias of trials, heterogeneity, and methodological quality of the review. A formula for applying GRADE level of evidence from the number of downgrades assigned by the algorithm was agreed. Our algorithm which assigns GRADE levels of evidence using a set of concrete rules was successfully applied within our Cochrane overview. We propose that this methodological approach has implications for assessment of quality of evidence within future evidence syntheses. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

  1. Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network. (United States)

    Choi, Sangil; Park, Jong Hyuk


    Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.

  2. A Temporal Domain Decomposition Algorithmic Scheme for Large-Scale Dynamic Traffic Assignment

    Directory of Open Access Journals (Sweden)

    Eric J. Nava


    This paper presents a temporal decomposition scheme for large spatial- and temporal-scale dynamic traffic assignment, in which the entire analysis period is divided into Epochs. Vehicle assignment is performed sequentially in each Epoch, thus improving the model scalability and confining the peak run-time memory requirement regardless of the total analysis period. A proposed self-turning scheme adaptively searches for the run-time-optimal Epoch setting during iterations regardless of the characteristics of the modeled network. Extensive numerical experiments confirm the promising performance of the proposed algorithmic schemes.

  3. Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms. (United States)

    Lee, Chankyun; Cao, Xiaoyuan; Yoshikane, Noboru; Tsuritani, Takehiro; Rhee, June-Koo Kevin


    The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study.

  4. An O(NlogN Algorithm for Region Definition Using Channels/Switchboxes and Ordering Assignment

    Directory of Open Access Journals (Sweden)

    Jin-Tai Yan


    Full Text Available For a building block placement, the routing space can be further partitioned into channels and switchboxes. In general, the definition of switchboxes releases the cyclic channel precedence constraints and further yields a safe routing ordering process. However, switchbox routing is more difficult than channel routing. In this paper, an O(NlogN region definition and ordering assignment (RDAOA algorithm is proposed to minimize the number of switchboxes for the routing phase, where N is the number of vertices in a channel precedence graph. Several examples have been tested on the proposed algorithm, and the experimental results are listed and compared.


    Directory of Open Access Journals (Sweden)

    Yee Shin Chia


    Full Text Available The channel assignment problem in wireless mobile network is the assignment of appropriate frequency spectrum to incoming calls while maintaining a satisfactory level of electromagnetic compatibility (EMC constraints. An effective channel assignment strategy is important due to the limited capacity of frequency spectrum in wireless mobile network. Most of the existing channel assignment strategies are based on deterministic methods. In this paper, an adaptive genetic algorithm (GA based channel assignment strategy is introduced for resource management and to reduce the effect of EMC interferences. The most significant advantage of the proposed optimization method is its capability to handle both the reassignment of channels for existing calls as well as the allocation of channel to a new incoming call in an adaptive process to maximize the utility of the limited resources. It is capable to adapt the population size to the number of eligible channels for a particular cell upon new call arrivals to achieve reasonable convergence speed. The MATLAB simulation on a 49-cells network model for both uniform and nonuniform call traffic distributions showed that the proposed channel optimization method can always achieve a lower average new incoming call blocking probability compared to the deterministic based channel assignment strategy.

  6. Multi-Objective Genetic Algorithm for Task Assignment on Heterogeneous Nodes

    Directory of Open Access Journals (Sweden)

    Carolina Blanch Perez del Notario


    Full Text Available Task assignment in grid computing, where both processing and bandwidth constraints at multiple heterogeneous devices need to be considered, is a challenging problem. Moreover, targeting the optimization of multiple objectives makes it even more challenging. This paper presents a task assignment strategy based on genetic algorithms in which multiple and conflicting objectives are simultaneously optimized. Specifically, we maximize task execution quality while minimizing energy and bandwidth consumption. Moreover, in our video processing scenario; we consider transcoding to lower spatial/temporal resolutions to tradeoff between video quality; processing, and bandwidth demands. The task execution quality is then determined by the number of successfully processed streams and the spatial-temporal resolution at which they are processed. The results show that the proposed algorithm offers a range of Pareto optimal solutions that outperforms all other reference strategies.

  7. Algorithm Design for Assignment Frequency Channels for Services in CATV Network

    Directory of Open Access Journals (Sweden)

    Jan Hlubik


    Full Text Available This article describes algorithm design for assignment frequency channels for services in CATV network. QAM modulated channels in designed system are dynamically switched and frequency adapted. On introduction, there is shortly described principle of providing analog video, digital video and data services in CATV network. Object of the article is focused on method of allocation individual TV and data channels on the frequency band. The conclusion compares advantages and disadvantages present and design system.

  8. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

    Directory of Open Access Journals (Sweden)

    Zhaocai Wang


    Full Text Available The unbalanced assignment problem (UAP is to optimally resolve the problem of assigning n jobs to m individuals (m < n, such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  9. Strategic flight assignment approach based on multi-objective parallel evolution algorithm with dynamic migration interval

    Directory of Open Access Journals (Sweden)

    Zhang Xuejun


    Full Text Available The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by reasonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimization problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm (MPEA framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is proposed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution (CC algorithm combined with non-dominated sorting genetic algorithm II (NSGA-II is introduced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi-objective genetic algorithm (MOGA, multi-objective evolutionary algorithm based on decomposition (MOEA/D, CC-based multi-objective algorithm (CCMA as well as other two MPEAs with different migration interval strategies.

  10. Heuristic algorithms for a storage location assignment problem in a chaotic warehouse (United States)

    Quintanilla, Sacramento; Pérez, Ángeles; Ballestín, Francisco; Lino, Pilar


    The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorithms can also be used for other purposes such as to assess when and how it is convenient to perform relocation of stored items to improve the current level of storage space availability. Computational tests performed on a set of randomly generated and real warehouse instances show the effectiveness of the proposed methods.

  11. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem. (United States)

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah


    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

  12. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

    Directory of Open Access Journals (Sweden)

    Wee Loon Lim


    Full Text Available The quadratic assignment problem (QAP is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO, a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

  13. Identifying asset-based trends in sustainable programmes which ...

    African Journals Online (AJOL)

    In this article we argue that the asset-based approach is one explanation for sustainability in programmes supporting vulnerable children. We structure our argument by formulating five questions and then pursuing tentative answers to them. We start our contention by highlighting the particularity of the challenges faced in ...

  14. Particle swarm optimization algorithm for optimizing assignment of blood in blood banking system. (United States)

    Olusanya, Micheal O; Arasomwan, Martins A; Adewumi, Aderemi O


    This paper reports the performance of particle swarm optimization (PSO) for the assignment of blood to meet patients' blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP) introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.

  15. Particle Swarm Optimization Algorithm for Optimizing Assignment of Blood in Blood Banking System

    Directory of Open Access Journals (Sweden)

    Micheal O. Olusanya


    Full Text Available This paper reports the performance of particle swarm optimization (PSO for the assignment of blood to meet patients’ blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.

  16. Resonance assignment of the NMR spectra of disordered proteins using a multi-objective non-dominated sorting genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Yu; Fritzsching, Keith J.; Hong, Mei, E-mail: [Iowa State University, Department of Chemistry (United States)


    A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR (SSNMR) spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative merit of these assignments. Our approach is modeled after the recently introduced Monte-Carlo simulated-annealing (MC/SA) protocol, with the key difference that NSGA-II simultaneously optimizes multiple assignment objectives instead of searching for possible assignments based on a single composite score. The multiple objectives include maximizing the number of consistently assigned peaks between multiple spectra (“good connections”), maximizing the number of used peaks, minimizing the number of inconsistently assigned peaks between spectra (“bad connections”), and minimizing the number of assigned peaks that have no matching peaks in the other spectra (“edges”). Using six SSNMR protein chemical shift datasets with varying levels of imperfection that was introduced by peak deletion, random chemical shift changes, and manual peak picking of spectra with moderately broad linewidths, we show that the NSGA-II algorithm produces a large number of valid and good assignments rapidly. For high-quality chemical shift peak lists, NSGA-II and MC/SA perform similarly well. However, when the peak lists contain many missing peaks that are uncorrelated between different spectra and have chemical shift deviations between spectra, the modified NSGA-II produces a larger number of valid solutions than MC/SA, and is more effective at distinguishing good from mediocre assignments by avoiding the hazard of suboptimal weighting factors for the various objectives. These two advantages, namely diversity and better evaluation, lead to a higher probability of predicting the correct

  17. Due Date Assignment in a Dynamic Job Shop with the Orthogonal Kernel Least Squares Algorithm (United States)

    Yang, D. H.; Hu, L.; Qian, Y.


    Meeting due dates is a key goal in the manufacturing industries. This paper proposes a method for due date assignment (DDA) by using the Orthogonal Kernel Least Squares Algorithm (OKLSA). A simulation model is built to imitate the production process of a highly dynamic job shop. Several factors describing job characteristics and system state are extracted as attributes to predict job flow-times. A number of experiments under conditions of varying dispatching rules and 90% shop utilization level have been carried out to evaluate the effectiveness of OKLSA applied for DDA. The prediction performance of OKLSA is compared with those of five conventional DDA models and back-propagation neural network (BPNN). The experimental results indicate that OKLSA is statistically superior to other DDA models in terms of mean absolute lateness and root mean squares lateness in most cases. The only exception occurs when the shortest processing time rule is used for dispatching jobs, the difference between OKLSA and BPNN is not statistically significant.

  18. Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm

    Directory of Open Access Journals (Sweden)

    Zixiang Li


    Full Text Available The two-sided assembly line balancing problem type-II (TALBP-II is of major importance for the reconfiguration of the two-sided assembly lines which are widely utilized to assemble large-size high-volume products. The TALBP-II is NP-hard, and some assignment restrictions in real applications make this problem much more complex. This paper provides an integer programming model for solving the TALBP-II with assignment restrictions optimally and utilizes a simple and effective iterated greedy (IG algorithm to address large-size problems. This algorithm utilizes a new local search by considering precedence relationships between tasks in order to reduce the computational time. In particular, a priority-based decoding scheme is developed to handle these assignment restrictions and reduce sequence-dependent idle times by adjusting the priority values. Experimental comparison among the proposed decoding scheme and other published ones demonstrates the efficiency of the priority-based decoding. A comprehensive computational comparison among the IG algorithm and other eight recent algorithms proves effectiveness of the proposed IG algorithm.

  19. Droop assignment algorithm for the inertial control of a DFIG-based wind power plant for supporting the grid frequency

    DEFF Research Database (Denmark)

    Lee, Jinsik; Kang, Yong Cheol; Muljadi, Edward


    of the kinetic energy stored in their rotating masses. This paper proposes a droop assignment algorithm for the inertial control of a doubly-fed induction generator-based WPP to support the grid frequency during the large disturbance. This paper assumes that a WG in the WPP has two supplementary loops...... for the inertial control, i.e. the frequency deviation loop and the rate of change of frequency (ROCOF) loop. In order to give more contribution on supporting the frequency stability by temporarily releasing more kinetic energy, the proposed algorithm assigns the droop of each WG depending on the rotor speed...... simulator. The results clearly indicate that the algorithm successfully improves the frequency nadir because WGs with higher wind speeds temporarily releases more kinetic energy....

  20. FLAMEnGO 2.0: an enhanced fuzzy logic algorithm for structure-based assignment of methyl group resonances. (United States)

    Chao, Fa-An; Kim, Jonggul; Xia, Youlin; Milligan, Michael; Rowe, Nancy; Veglia, Gianluigi


    We present an enhanced version of the FLAMEnGO (Fuzzy Logic Assignment of Methyl Group) software, a structure-based method to assign methyl group resonances in large proteins. FLAMEnGO utilizes a fuzzy logic algorithm coupled with Monte Carlo sampling to obtain a probability-based assignment of the methyl group resonances. As an input, FLAMEnGO requires either the protein X-ray structure or an NMR structural ensemble including data such as methyl-methyl NOESY, paramagnetic relaxation enhancement (PRE), methine-methyl TOCSY data. Version 2.0 of this software (FLAMEnGO 2.0) has a user-friendly graphic interface and presents improved modules that enable the input of partial assignments and additional NMR restraints. We tested the performance of FLAMEnGO 2.0 on maltose binding protein (MBP) as well as the C-subunit of the cAMP-dependent protein kinase A (PKA-C). FLAMEnGO 2.0 can be used as a standalone method or to assist in the completion of partial resonance assignments and can be downloaded at Copyright © 2014 Elsevier Inc. All rights reserved.

  1. Algorithm for generation pseudo-random series with arbitrarily assigned distribution law

    Directory of Open Access Journals (Sweden)

    В.С. Єременко


    Full Text Available  Method for generation pseudo-random series with arbitrarily assigned distribution law has been proposed. The praxis of using proposed method for generation pseudo-random series with anti-modal and approximate to Gaussian distribution law has been investigated.

  2. A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors (United States)

    Lipinski, Piotr

    This paper concerns the quadratic three-dimensional assignment problem (Q3AP), an extension of the quadratic assignment problem (QAP), and proposes an efficient hybrid evolutionary algorithm combining stochastic optimization and local search with a number of crossover operators, a number of mutation operators and an auto-adaptation mechanism. Auto-adaptation manages the pool of evolutionary operators applying different operators in different computation phases to better explore the search space and to avoid premature convergence. Local search additionally optimizes populations of candidate solutions and accelerates evolutionary search. It uses a many-core graphics processor to optimize a number of solutions in parallel, which enables its incorporation into the evolutionary algorithm without excessive increases in the computation time. Experiments performed on benchmark Q3AP instances derived from the classic QAP instances proposed by Nugent et al. confirmed that the proposed algorithm is able to find optimal solutions to Q3AP in a reasonable time and outperforms best known results found in the literature.

  3. PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem


    Sanhueza, Claudio; Jimenez, Francia; Berretta, Regina; Moscato, Pablo


    Multi-Objective Optimization Problems (MOPs) have attracted growing attention during the last decades. Multi-Objective Evolutionary Algorithms (MOEAs) have been extensively used to address MOPs because are able to approximate a set of non-dominated high-quality solutions. The Multi-Objective Quadratic Assignment Problem (mQAP) is a MOP. The mQAP is a generalization of the classical QAP which has been extensively studied, and used in several real-life applications. The mQAP is defined as havin...

  4. An Asset-Based Approach in Career Facilitation: Lessons for Higher Education Training (United States)

    Coetzee, S.; Ebersohn, L.; Ferreira, R.


    This exploratory and descriptive study investigated the use of the asset-based approach in career facilitation in South Africa. Five adolescents (3 females and 2 males) aged 16 to 18 years participated. An intervention study following a qualitative approach was conducted. We developed and implemented an asset-based career facilitation intervention…

  5. Whether and How to Select Inertia and Acceleration of Discrete Particle Swarm Optimization Algorithm: A Study on Channel Assignment

    Directory of Open Access Journals (Sweden)

    Min Jin


    Full Text Available There is recently a great deal of interest and excitement in understanding the role of inertia and acceleration in the motion equation of discrete particle swarm optimization (DPSO algorithms. It still remains unknown whether the inertia section should be abandoned and how to select the appropriate acceleration in order for DPSO to show the best convergence performance. Adopting channel assignment as a case study, this paper systematically conducts experimental filtering research on this issue. Compared with other channel assignment schemes, the proposed scheme and the selection of inertia and acceleration are verified to have the advantage to channel assignment in three respects of convergence rate, convergence speed, and the independency of the quality of initial solution. Furthermore, the experimental result implies that DSPO might have the best convergence performance when its motion equation includes an inertia section in a less medium weight, a bigger acceleration coefficient for global-search optimum, and a smaller acceleration coefficient for individual-search optimum.

  6. Successful Community Midwives in Pakistan: An Asset-Based Approach.

    Directory of Open Access Journals (Sweden)

    Zubia Mumtaz

    Full Text Available In response to the low levels of skilled birth attendance in rural Pakistan, the government introduced a new cadre of community midwives (CMWs in 2006. Assessments to-date have found that these CMWs have yet to emerge as significant providers for a number of sociocultural, geographic and financial reasons. However, a small number of CMWs have managed to establish functional practices in the private sector in conservative, infrastructure-challenged rural contexts. With an objective to highlight "what are the successful CMWs doing right given their context?" this paper adopts an asset-based approach to explore the experiences of the Pakistani CMWs who have managed to overcome the barriers and practice. We drew upon ethnographic data that was collected as part of a larger mixed methods study conducted in 2011-2012 in districts Jhelum and Layyah, Pakistan. Thirty eight CMWs, 45 other health care providers, 20 policymakers, 78 women, 35 husbands and 23 older women were interviewed. CMW clinics and practices were observed. Our data showed that only eight 8 out of 38 CMWs sampled were active providers. Poverty as a push factor to work and intrinsic individual-level characteristics that enabled the CMWs to respond successfully to the demands of the midwifery profession in the private sector emerged as the two key themes. Household poverty pushed the CMWs to work in this perceived low-status occupation. Their families supported them since they became the breadwinners. The successful CMWs also had an intrinsic sense of what was required to establish a private practice; they exhibited professionalism, had strong business sense and provided respectful maternity care. The study provides insight into how the program might improve its functioning by adapting its recruitment criteria to ensure selection of right candidates.

  7. Successful Community Midwives in Pakistan: An Asset-Based Approach. (United States)

    Mumtaz, Zubia; Levay, Adrienne V; Bhatti, Afshan


    In response to the low levels of skilled birth attendance in rural Pakistan, the government introduced a new cadre of community midwives (CMWs) in 2006. Assessments to-date have found that these CMWs have yet to emerge as significant providers for a number of sociocultural, geographic and financial reasons. However, a small number of CMWs have managed to establish functional practices in the private sector in conservative, infrastructure-challenged rural contexts. With an objective to highlight "what are the successful CMWs doing right given their context?" this paper adopts an asset-based approach to explore the experiences of the Pakistani CMWs who have managed to overcome the barriers and practice. We drew upon ethnographic data that was collected as part of a larger mixed methods study conducted in 2011-2012 in districts Jhelum and Layyah, Pakistan. Thirty eight CMWs, 45 other health care providers, 20 policymakers, 78 women, 35 husbands and 23 older women were interviewed. CMW clinics and practices were observed. Our data showed that only eight 8 out of 38 CMWs sampled were active providers. Poverty as a push factor to work and intrinsic individual-level characteristics that enabled the CMWs to respond successfully to the demands of the midwifery profession in the private sector emerged as the two key themes. Household poverty pushed the CMWs to work in this perceived low-status occupation. Their families supported them since they became the breadwinners. The successful CMWs also had an intrinsic sense of what was required to establish a private practice; they exhibited professionalism, had strong business sense and provided respectful maternity care. The study provides insight into how the program might improve its functioning by adapting its recruitment criteria to ensure selection of right candidates.

  8. Performance Analysis of IMS Network: the Proposal of new Algorithms for S-CSCF Assignment

    Directory of Open Access Journals (Sweden)

    Lubos Nagy


    Full Text Available This article is focused on the proposal of three load balancing methods which can be used for a selection of S-CSCF (Serving-Call Session Control Server server in IP Multimedia Subsystem (IMS during the registration procedures of subscribers. All presented methods are implemented and evaluated for various inter-arrival and service times in the mathematical model based on queueing theory. In this article, two methods based on performance parameters (such as utilizations, etc. and one method based on number of registered subscribers to each of available S-CSCF server are described. The main advantage of third method is that all related information is obtained from traffic analysis through I-CSCF (Interrogating-CSCF node. Also, the designed methods are compared with other selection algorithms presented in previous research works by others researchers (Hwang et col., Cho et col. or Tirana et col.. The article shows that the implemented methods can optimize the service latency of whole IMS network.

  9. A New Algorithm Using Cross-Assignment for Label-Free Quantitation with LC/LTQ-FT MS (United States)

    Andreev, Victor P.; Li, Lingyun; Cao, Lei; Gu, Ye; Rejtar, Tomas; Wu, Shiaw-Lin; Karger, Barry L.


    A new algorithm is described for label-free quantitation of relative protein abundances across multiple complex proteomic samples. Q-MEND is based on the denoising and peak picking algorithm, MEND, previously developed in our laboratory. Q-MEND takes advantage of the high resolution and mass accuracy of the hybrid LTQFT MS mass spectrometer (or other high resolution mass spectrometers, such as a Q-TOF MS). The strategy, termed “cross-assignment”, is introduced to increase substantially the number of quantitated proteins. In this approach, all MS/MS identifications for the set of analyzed samples are combined into a master ID list, and then each LC/MS run is searched for the features that can be assigned to a specific identification from that master list. The reliability of quantitation is enhanced by quantitating separately all peptide charge states, along with a scoring procedure to filter out less reliable peptide abundance measurements. The effectiveness of Q-MEND is illustrated in the relative quantitative analysis of E.coli samples spiked with known amounts of non-E.coli protein digests. A mean quantitation accuracy of 7% and mean precision of 15% is demonstrated. Q-MEND can perform relative quantitation of a set of LC/MS datasets without manual intervention and can generate files compatible with the Guidelines for Proteomic Data Publication. PMID:17441747

  10. Optimal density assignment to 2D diode array detector for different dose calculation algorithms in patient specific VMAT QA

    Energy Technology Data Exchange (ETDEWEB)

    Park, So Yeon; Park, Jong Min; Choi, Chang Heon; Chun, MinSoo; Han, Ji Hye; Cho, Jin Dong; Kim, Jung In [Dept. of Radiation Oncology, Seoul National University Hospital, Seoul (Korea, Republic of)


    The purpose of this study is to assign an appropriate density to virtual phantom for 2D diode array detector with different dose calculation algorithms to guarantee the accuracy of patient-specific QA. Ten VMAT plans with 6 MV photon beam and ten VMAT plans with 15 MV photon beam were selected retrospectively. The computed tomography (CT) images of MapCHECK2 with MapPHAN were acquired to design the virtual phantom images. For all plans, dose distributions were calculated for the virtual phantoms with four different materials by AAA and AXB algorithms. The four materials were polystyrene, 455 HU, Jursinic phantom, and PVC. Passing rates for several gamma criteria were calculated by comparing the measured dose distribution with calculated dose distributions of four materials. For validation of AXB modeling in clinic, the mean percentages of agreement in the cases of dose difference criteria of 1.0% and 2.0% for 6 MV were 97.2%±2.3%, and 99.4%±1.1%, respectively while those for 15 MV were 98.5%±0.85% and 99.8%±0.2%, respectively. In the case of 2%/2 mm, all mean passing rates were more than 96.0% and 97.2% for 6 MV and 15 MV, respectively, regardless of the virtual phantoms of different materials and dose calculation algorithms. The passing rates in all criteria slightly increased for AXB as well as AAA when using 455 HU rather than polystyrene. The virtual phantom which had a 455 HU values showed high passing rates for all gamma criteria. To guarantee the accuracy of patent-specific VMAT QA, each institution should fine-tune the mass density or HU values of this device.

  11. Robust species taxonomy assignment algorithm for 16S rRNA NGS reads: application to oral carcinoma samples

    Directory of Open Access Journals (Sweden)

    Nezar Noor Al-Hebshi


    Full Text Available Background: Usefulness of next-generation sequencing (NGS in assessing bacteria associated with oral squamous cell carcinoma (OSCC has been undermined by inability to classify reads to the species level. Objective: The purpose of this study was to develop a robust algorithm for species-level classification of NGS reads from oral samples and to pilot test it for profiling bacteria within OSCC tissues. Methods: Bacterial 16S V1-V3 libraries were prepared from three OSCC DNA samples and sequenced using 454's FLX chemistry. High-quality, well-aligned, and non-chimeric reads ≥350 bp were classified using a novel, multi-stage algorithm that involves matching reads to reference sequences in revised versions of the Human Oral Microbiome Database (HOMD, HOMD extended (HOMDEXT, and Greengene Gold (GGG at alignment coverage and percentage identity ≥98%, followed by assignment to species level based on top hit reference sequences. Priority was given to hits in HOMD, then HOMDEXT and finally GGG. Unmatched reads were subject to operational taxonomic unit analysis. Results: Nearly, 92.8% of the reads were matched to updated-HOMD 13.2, 1.83% to trusted-HOMDEXT, and 1.36% to modified-GGG. Of all matched reads, 99.6% were classified to species level. A total of 228 species-level taxa were identified, representing 11 phyla; the most abundant were Proteobacteria, Bacteroidetes, Firmicutes, Fusobacteria, and Actinobacteria. Thirty-five species-level taxa were detected in all samples. On average, Prevotella oris, Neisseria flava, Neisseria flavescens/subflava, Fusobacterium nucleatum ss polymorphum, Aggregatibacter segnis, Streptococcus mitis, and Fusobacterium periodontium were the most abundant. Bacteroides fragilis, a species rarely isolated from the oral cavity, was detected in two samples. Conclusion: This multi-stage algorithm maximizes the fraction of reads classified to the species level while ensuring reliable classification by giving priority to the

  12. A genetic algorithm for finding good balanced sequences in a customer assignment problem with no state information

    NARCIS (Netherlands)

    Hordijk, W.; Hordijk, A.; Heidergott, B.F.


    In this paper, we study the control problem of optimal assignment of tasks to servers in a multi-server queue with inhomogeneous servers. In order to improve the performance of the system, we use a periodic deterministic sequence of job assignments to servers called a billiard sequence. We then use

  13. Beyond Proficiency: An Asset-Based Approach to International Teaching Assistant Training (United States)

    Swan, Lisa M.; Kramer, Sabrina; Gopal, Anita; Shi, Lijuan; Roth, Stephen M.


    This study assesses an asset-based approach to international teaching assistant (ITA) training at a public research institution. The program is a peer mentorship-based learning community that facilitates ITAs' cultural awareness and pedagogic development. Survey results indicate the program positively impacted participants' teaching skills,…

  14. Is Poverty Multidimensional? A Comparison of Income and Asset Based Measures in Five Southern African Countries (United States)

    von Maltzahn, Robyn; Durrheim, Kevin


    This paper contests the major emphasis placed on the multidimensional nature of poverty measurement. Instead, it argues that poverty pictures created by different measures and at different units of analysis tend to converge. This argument is derived from a comparison of poverty pictures created using income and asset-based measures at the national…

  15. "Now I Know My ABCDs": Asset-Based Community Development with School Children in Ethiopia (United States)

    Johnson Butterfield, Alice K.; Yeneabat, Mulu; Moxley, David P.


    Asset-based community development (ABCD) is a promising practice for communities to engage in self-determination through the efforts residents invest in identifying community assets, framing and documenting the issues communities face, and taking action to advance quality of life. The ABCD literature does not report on the application of ABCD…

  16. Intersecting Asset-Based Service, Strengths, and Mentoring for Socially Responsible Leadership. (United States)

    Hastings, Lindsay


    Grounded in a youth leadership and mentoring program, this chapter discusses the value of asset-based community development from the service-learning literature and the concept of generativity from the leadership development literature. © 2016 Wiley Periodicals, Inc., A Wiley Company.

  17. Preparing Students for Community-Based Learning Using an Asset-Based Approach (United States)

    Garoutte, Lisa; McCarthy-Gilmore, Kate


    One goal of service and community-based learning is to produce students who are more tightly engaged in the larger communities surrounding their institutions. Drawing on data from three courses, we argue that an asset-based approach plays a role in creating authentic campus-community partnerships that strive to engage students as members of the…

  18. End-of-life conversations and care: an asset-based model for community engagement. (United States)

    Matthiesen, Mary; Froggatt, Katherine; Owen, Elaine; Ashton, John R


    Public awareness work regarding palliative and end-of-life care is increasingly promoted within national strategies for palliative care. Different approaches to undertaking this work are being used, often based upon broader educational principles, but little is known about how to undertake such initiatives in a way that equally engages both the health and social care sector and the local communities. An asset-based community engagement approach has been developed that facilitates community-led awareness initiatives concerning end-of-life conversations and care by identifying and connecting existing skills and expertise. (1) To describe the processes and features of an asset-based community engagement approach that facilitates community-led awareness initiatives with a focus on end-of-life conversations and care; and (2) to identify key community-identified priorities for sustainable community engagement processes. An asset-based model of community engagement specific to end-of-life issues using a four-step process is described (getting started, coming together, action planning and implementation). The use of this approach, in two regional community engagement programmes, based across rural and urban communities in the northwest of England, is described. The assets identified in the facilitated community engagement process encompassed people's talents and skills, community groups and networks, government and non-government agencies, physical and economic assets and community values and stories. Five priority areas were addressed to ensure active community engagement work: information, outreach, education, leadership and sustainability. A facilitated, asset-based approach of community engagement for end-of-life conversations and care can catalyse community-led awareness initiatives. This occurs through the involvement of community and local health and social care organisations as co-creators of this change across multiple sectors in a sustainable way. This approach

  19. A Novel Dynamic Physical Layer Impairment-Aware Routing and Wavelength Assignment (PLI-RWA) Algorithm for Mixed Line Rate (MLR) Wavelength Division Multiplexed (WDM) Optical Networks (United States)

    Iyer, Sridhar


    The ever-increasing global Internet traffic will inevitably lead to a serious upgrade of the current optical networks' capacity. The legacy infrastructure can be enhanced not only by increasing the capacity but also by adopting advance modulation formats, having increased spectral efficiency at higher data rate. In a transparent mixed-line-rate (MLR) optical network, different line rates, on different wavelengths, can coexist on the same fiber. Migration to data rates higher than 10 Gbps requires the implementation of phase modulation schemes. However, the co-existing on-off keying (OOK) channels cause critical physical layer impairments (PLIs) to the phase modulated channels, mainly due to cross-phase modulation (XPM), which in turn limits the network's performance. In order to mitigate this effect, a more sophisticated PLI-Routing and Wavelength Assignment (PLI-RWA) scheme needs to be adopted. In this paper, we investigate the critical impairment for each data rate and the way it affects the quality of transmission (QoT). In view of the aforementioned, we present a novel dynamic PLI-RWA algorithm for MLR optical networks. The proposed algorithm is compared through simulations with the shortest path and minimum hop routing schemes. The simulation results show that performance of the proposed algorithm is better than the existing schemes.

  20. An asset-based community initiative to reduce television viewing in New York state. (United States)

    Baker, Ida R; Dennison, Barbara A; Boyer, Penny S; Sellers, Kathleen F; Russo, Theresa J; Sherwood, Nancy A


    Childhood obesity is an epidemic. Addressing this problem will require the input of many sectors and change in many behaviors. The "community" must be part of the solution, and the solution must be constructed on existing assets that lend strength to positive environmental change. To catalyze an established asset-based community partnership to support efforts to reduce television viewing time by developing and providing alternative activities as part of a broader, 3-year study to reduce childhood obesity among preschool-aged children in rural, upstate New York. Asset mapping was utilized to compile an inventory of individual and community strengths upon which a partnership could be established. Facilitated focus group sessions were conducted to better understand childcare environmental policies and practices, and to guide changes conducive to health and fitness. Planning meetings and targeted outreach brought key stakeholders together for a community-participatory initiative to support positive environmental change. RESULTS.: The partnership planned and initiated an array of after-school and weekend community activities for preschool-aged children and their families in the weeks preceding, during, and following a designated 'TV Turn-off' week in April, 2004 and March, 2005. Methods of asset-based community development are an effective way to engage community participation in public health initiatives.

  1. Algorithms

    Indian Academy of Sciences (India)

    positive numbers. The word 'algorithm' was most often associated with this algorithm till 1950. It may however be pOinted out that several non-trivial algorithms such as synthetic (polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used.

  2. Algorithms

    Indian Academy of Sciences (India)

    In the description of algorithms and programming languages, what is the role of control abstraction? • What are the inherent limitations of the algorithmic processes? In future articles in this series, we will show that these constructs are powerful and can be used to encode any algorithm. In the next article, we will discuss ...

  3. Random Cell Identifiers Assignment

    Directory of Open Access Journals (Sweden)

    Robert Bestak


    Full Text Available Despite integration of advanced functions that enable Femto Access Points (FAPs to be deployed in a plug-and-play manner, the femtocell concept still cause several opened issues to be resolved. One of them represents an assignment of Physical Cell Identifiers (PCIs to FAPs. This paper analyses a random based assignment algorithm in LTE systems operating in diverse femtocell scenarios. The performance of the algorithm is evaluated by comparing the number of confusions for various femtocell densities, PCI ranges and knowledge of vicinity. Simulation results show that better knowledge of vicinity can significantly reduce the number of confusions events.

  4. Algorithms

    Indian Academy of Sciences (India)

    , i is referred to as the loop-index, 'stat-body' is any sequence of ... while i ~ N do stat-body; i: = i+ 1; endwhile. The algorithm for sorting the numbers is described in Table 1 and the algorithmic steps on a list of 4 numbers shown in. Figure 1.

  5. Sustaining a positive body image in adolescence: an assets-based analysis. (United States)

    Fenton, Cath; Brooks, Fiona; Spencer, Neil H; Morgan, Antony


    The increasing impetus to provide an effective response to childhood obesity has generated a corresponding concern that weight management interventions may lead to emotional problems among young people, notably in relation to the development of a negative body image. However, currently the processes and factors that contribute to the acquisition of body image among young people is poorly understood. Drawing on salutogenic theory, this paper employs an assets-based approach that focuses on health promoting and protective factors to identify how young people may create or sustain positive body images. Secondary data analysis was undertaken from the WHO Health Behaviour in School Aged Children Study. During the spring term of 2002, information was collected from 6425 English adolescents aged 11-15 using a self-administered questionnaire. The data were analysed using stepwise multinomial logistic regression to determine which factors were associated with positive body image; a total of 2898 students were included in the final analysis. Adolescents who self-identified as having a positive body image were more likely to report ease of talking with a father figure, feeling intelligent, perceiving that their family were well off and a belief that their teachers were interested in them as people. Body Mass Index, age, gender and living within a household containing a father were also significant predictors of body image. The discussion provides an exploration of how the construction of young people's emotional health is in part linked with the attainment of a secure and positive body image. The implications for health promotion and educational programmes are then examined. By considering the assets, which support or sustain a positive body image during adolescence, obesity prevention programmes could be better tailored to meet the needs of young people. In the future, a salutogenic curriculum might provide an alternative to unsustainable levels of deficit led, targeted

  6. Stationary algorithmic probability

    National Research Council Canada - National Science Library

    Müller, Markus


    ...,sincetheiractualvaluesdependonthechoiceoftheuniversal referencecomputer.Inthispaper,weanalyzeanaturalapproachtoeliminatethismachine- dependence. Our method is to assign algorithmic probabilities to the different...

  7. The bicriterion multimodal assignment problem

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan


    We consider the bicriterion multimodal assignment problem, which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points or an approximat......We consider the bicriterion multimodal assignment problem, which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points...

  8. Algorithms

    Indian Academy of Sciences (India)

    Algorithms. 3. Procedures and Recursion. R K Shyamasundar. In this article we introduce procedural abstraction and illustrate its uses. Further, we illustrate the notion of recursion which is one of the most useful features of procedural abstraction. Procedures. Let us consider a variation of the pro blem of summing the first M.

  9. Algorithms

    Indian Academy of Sciences (India)

    number of elements. We shall illustrate the widely used matrix multiplication algorithm using the two dimensional arrays in the following. Consider two matrices A and B of integer type with di- mensions m x nand n x p respectively. Then, multiplication of. A by B denoted, A x B , is defined by matrix C of dimension m xp where.

  10. Using an asset-based approach to explore the benefits of involvement in community-centred initiatives


    Brooks, Joanna; Bravington, Alison; Rodriguez, Alison; Percy-Smith, Barry; King, Nigel


    Purpose:\\ud To explore with community groups, using an asset-based approach, what local individual and community assets exist in a deprived English Local Authority area;\\ud \\ud To reflect with participants on how these assets might be utilised to improve health and wellbeing; \\ud \\ud To consider how such assets might be used to promote public health (PH) as part of changes to PH provision in the context of austerity measures and local authority budget cuts.\\ud \\ud Background:\\ud Effective com...

  11. Extending DFT-based genetic algorithms by atom-to-place re-assignment via perturbation theory: A systematic and unbiased approach to structures of mixed-metallic clusters

    Energy Technology Data Exchange (ETDEWEB)

    Weigend, Florian, E-mail: [Institut für Physikalische Chemie, Abteilung für Theoretische Chemie, Karlsruher Institut für Technologie, Fritz-Haber-Weg 2, 76131 Karlsruhe, Germany and Institut für Nanotechnologie, Karlsruher Institut für Technologie, Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen (Germany)


    Energy surfaces of metal clusters usually show a large variety of local minima. For homo-metallic species the energetically lowest can be found reliably with genetic algorithms, in combination with density functional theory without system-specific parameters. For mixed-metallic clusters this is much more difficult, as for a given arrangement of nuclei one has to find additionally the best of many possibilities of assigning different metal types to the individual positions. In the framework of electronic structure methods this second issue is treatable at comparably low cost at least for elements with similar atomic number by means of first-order perturbation theory, as shown previously [F. Weigend, C. Schrodt, and R. Ahlrichs, J. Chem. Phys. 121, 10380 (2004)]. In the present contribution the extension of a genetic algorithm with the re-assignment of atom types to atom sites is proposed and tested for the search of the global minima of PtHf{sub 12} and [LaPb{sub 7}Bi{sub 7}]{sup 4−}. For both cases the (putative) global minimum is reliably found with the extended technique, which is not the case for the “pure” genetic algorithm.

  12. Utilizing Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-Group Delay Fairness in Multi-Rate Multicast Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yean-Fu Wen


    Full Text Available Recent advance in wireless sensor network (WSN applications such as the Internet of Things (IoT have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

  13. Utilizing joint routing and capacity assignment algorithms to achieve inter- and intra-group delay fairness in multi-rate multicast wireless sensor networks. (United States)

    Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Lin, Leo Shih-Chang; Wen, Yean-Fu


    Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

  14. Utilizing Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-Group Delay Fairness in Multi-Rate Multicast Wireless Sensor Networks (United States)

    Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Lin, Leo Shih-Chang; Wen, Yean-Fu


    Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency. PMID:23493123

  15. On the Bicriterion Multi Modal Assignment Problem

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, L.R.; Andersen, K.A.


    We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points or an approximat......We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points...... or an approximation. Extensive computational results are conducted on a large library of test instances to test the performance of the algorithm and to identify hard test instances. Also, test results of the algorithm applied to the bicriterion assignment problem is given. Here our algorithm outperforms all...

  16. Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

    Directory of Open Access Journals (Sweden)

    Saehwa Kim


    Full Text Available Preemption threshold scheduling (PTS enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm.

  17. Class Schedule Assignment Based on Students Learning Rhythms Using A Genetic Algorithm Asignación de horarios de clase basado en los ritmos de aprendizaje de los estudiantes usando un algoritmo genético

    Directory of Open Access Journals (Sweden)

    Victor F. Suarez Chilma


    Full Text Available The objective of this proposal is to implement a school day agenda focused on the learning rhythms of students of elementary and secondary schools using a genetic algorithm. The methodology of this proposal takes into account legal requirements and constraints on the assignment of teachers and classrooms in public educational institutions in Colombia. In addition, this proposal provides a set of constraints focused on cognitive rhythms and subjects are scheduled at the most convenient times according to the area of knowledge. The genetic algorithm evolves through a process of mutation and selection and builds a total solution based on the best solutions for each group. Sixteen groups in a school are tested and the results of class schedule assignments are presented. The quality of the solution obtained through the established approach is validated by comparing the results to the solutions obtained using another algorithm.El objetivo de esta propuesta es implementar un horario escolar que tenga en cuenta los ritmos de aprendizaje en los estudiantes de educación primaria y secundaria, utilizando un algoritmo genético. La metodología considera los requerimientos legales y las restricciones necesarias para la asignación de maestros y aulas en instituciones educativas públicas de Colombia. Adicionalmente, se establecen un conjunto de restricciones relacionadas con el enfoque en los ritmos cognitivos, determinando las horas de la jornada en las que es más conveniente la ubicación de ciertas materias de acuerdo al área del conocimiento al que pertenecen. El algoritmo genético evoluciona mediante un proceso de mutación y selección, a través del cual se construye una solución completa a partir de la búsqueda de las mejores soluciones por grupo. Se presentan los resultados de las pruebas realizadas para la asignación de una institución con 16 grupos. La calidad de las soluciones obtenidas de acuerdo al enfoque establecido es validada

  18. Investigation of an Immunoassay with Broad Specificity to Quinolone Drugs by Genetic Algorithm with Linear Assignment of Hypermolecular Alignment of Data Sets and Advanced Quantitative Structure-Activity Relationship Analysis. (United States)

    Chen, Jiahong; Lu, Ning; Shen, Xing; Tang, Qiushi; Zhang, Chijian; Xu, Jun; Sun, Yuanming; Huang, Xin-An; Xu, Zhenlin; Lei, Hongtao


    A polyclonal antibody against the quinolone drug pazufloxacin (PAZ) but with surprisingly broad specificity was raised to simultaneously detect 24 quinolones (QNs). The developed competitive indirect enzyme-linked immunosorbent assay (ciELISA) exhibited limits of detection (LODs) for the 24 QNs ranging from 0.45 to 15.16 ng/mL, below the maximum residue levels (MRLs). To better understand the obtained broad specificity, a genetic algorithm with linear assignment of hypermolecular alignment of data sets (GALAHAD) was used to generate the desired pharmacophore model and superimpose the QNs, and then advanced comparative molecular field analysis (CoMFA) and advanced comparative molecular similarity indices analysis (CoMSIA) models were employed to study the three-dimensional quantitative structure-activity relationship (3D QSAR) between QNs and the antibody. It was found that the QNs could interact with the antibody with different binding poses, and cross-reactivity was mainly positively correlated with the bulky substructure containing electronegative atom at the 7-position, while it was negatively associated with the large bulky substructure at the 1-position of QNs.

  19. Fleet Assignment Using Collective Intelligence (United States)

    Antoine, Nicolas E.; Bieniawski, Stefan R.; Kroo, Ilan M.; Wolpert, David H.


    Product distribution theory is a new collective intelligence-based framework for analyzing and controlling distributed systems. Its usefulness in distributed stochastic optimization is illustrated here through an airline fleet assignment problem. This problem involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of linear and non-linear constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of this new stochastic optimization algorithm to a non-linear objective cold start fleet assignment problem. Results show that the optimizer can successfully solve such highly-constrained problems (130 variables, 184 constraints).

  20. The Airport Gate Assignment Problem: A Survey

    Directory of Open Access Journals (Sweden)

    Abdelghani Bouras


    Full Text Available The airport gate assignment problem (AGAP is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area.

  1. The Airport Gate Assignment Problem: A Survey (United States)

    Ghaleb, Mageed A.; Salem, Ahmed M.


    The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area. PMID:25506074

  2. Scaffolding students’ assignments

    DEFF Research Database (Denmark)

    Slot, Marie Falkesgaard


    This article discusses scaffolding in typical student assignments in mother tongue learning materials in upper secondary education in Denmark and the United Kingdom. It has been determined that assignments do not have sufficient scaffolding end features to help pupils understand concepts and build...

  3. A parametric visualization software for the assignment problem

    Directory of Open Access Journals (Sweden)

    Papamanthou Charalampos


    Full Text Available In this paper we present a parametric visualization software used to assist the teaching of the Network Primal Simplex Algorithm for the assignment problem (AP. The assignment problem is a special case of the balanced transportation problem. The main functions of the algorithm and design techniques are also presented. Through this process, we aim to underline the importance and necessity of using such educational methods in order to improve the teaching of Computer Algorithms.

  4. Historical WBAN ID Assignments (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — 4"x6" index cards represent the first written assignments of Weather Bureau Army Navy (WBAN) station identifier numbers by the National Climatic Data Center....

  5. My Favorite Assignment. (United States)

    Post, Robert E.; Johnson, Jack E.


    Presents two assignments that show (1) how George Orwell's "Politics and the English Language" can be applied to business writing and (2) how structured student-teacher conferences can generate enthusiasm for oral expression in a business communication course. (AEA)

  6. Comparison of two approaches for measuring household wealth via an asset-based index in rural and peri-urban settings of Hunan province, China

    Directory of Open Access Journals (Sweden)

    Balen Julie


    Full Text Available Abstract Background There are growing concerns regarding inequities in health, with poverty being an important determinant of health as well as a product of health status. Within the People's Republic of China (P.R. China, disparities in socio-economic position are apparent, with the rural-urban gap of particular concern. Our aim was to compare direct and proxy methods of estimating household wealth in a rural and a peri-urban setting of Hunan province, P.R. China. Methods We collected data on ownership of household durable assets, housing characteristics, and utility and sanitation variables in two village-wide surveys in Hunan province. We employed principal components analysis (PCA and principal axis factoring (PAF to generate household asset-based proxy wealth indices. Households were grouped into quartiles, from 'most wealthy' to 'most poor'. We compared the estimated household wealth for each approach. Asset-based proxy wealth indices were compared to those based on self-reported average annual income and savings at the household level. Results Spearman's rank correlation analysis revealed that PCA and PAF yielded similar results, indicating that either approach may be used for estimating household wealth. In both settings investigated, the two indices were significantly associated with self-reported average annual income and combined income and savings, but not with savings alone. However, low correlation coefficients between the proxy and direct measures of wealth indicated that they are not complementary. We found wide disparities in ownership of household durable assets, and utility and sanitation variables, within and between settings. Conclusion PCA and PAF yielded almost identical results and generated robust proxy wealth indices and categories. Pooled data from the rural and peri-urban settings highlighted structural differences in wealth, most likely a result of localized urbanization and modernization. Further research is needed

  7. Assigning sporadic tasks to unrelated machines

    NARCIS (Netherlands)

    Marchetti-Spaccamela, A.; Rutten, C.; van der Ster, S.L.; Wiese, A.


    We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each machine can be feasibly scheduled. Despite its importance for modern real-time systems, this problem has not been studied before. We present a polynomial-time algorithm which approximates the problem

  8. Generalised Assignment Matrix Methodology in Linear Programming (United States)

    Jerome, Lawrence


    Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…


    Directory of Open Access Journals (Sweden)


    Full Text Available The article is devoted to the airline scheduling process and methods of its modeling. This article describes the main stages of airline scheduling process (scheduling, fleet assignment, revenue management, operations, their features and interactions. The main part of scheduling process is fleet assignment. The optimal solution of the fleet assignment problem enables airlines to increase their incomes up to 3 % due to quality improving of connections and execution of the planned number of flights operated by less number of aircraft than usual or planned earlier. Fleet assignment of scheduling process is examined and Conventional Leg-Based Fleet Assignment Model is analyzed. Finally strong and weak aspects of the model (SWOT are released and applied. The article gives a critical analysis of FAM model, with the purpose of identi- fying possible options and constraints of its use (for example, in cases of short-term and long-term planning, changing the schedule or replacing the aircraft, as well as possible ways to improve the model.

  10. Task assignment and coaching

    NARCIS (Netherlands)

    Dominguez-Martinez, S.


    An important task of a manager is to motivate her subordinates. One way in which a manager can give incentives to junior employees is through the assignment of tasks. How a manager allocates tasks in an organization, provides information to the junior employees about his ability. Without coaching

  11. Protocol for a feasibility trial for improving breast feeding initiation and continuation: assets-based infant feeding help before and after birth (ABA). (United States)

    Jolly, Kate; Ingram, Jenny; Clarke, Joanne; Johnson, Debbie; Trickey, Heather; Thomson, Gill; Dombrowski, Stephan U; Sitch, Alice; Dykes, Fiona; Feltham, Max G; Darwent, Kirsty; MacArthur, Christine; Roberts, Tracy; Hoddinott, Pat


    Breast feeding improves the health of mothers and infants; the UK has low rates, with marked socioeconomic inequalities. While trials of peer support services have been effective in some settings, UK trials have not improved breast feeding rates. Qualitative research suggests that many women are alienated by the focus on breast feeding. We propose a change from breast feeding-focused interactions to respecting a woman's feeding choices, inclusion of behaviour change theory and an increased intensity of contacts in the 2 weeks after birth when many women cease to breast feed. This will take place alongside an assets-based approach that focuses on the positive capability of individuals, their social networks and communities.We propose a feasibility study for a multicentre randomised controlled trial of the Assets feeding help Before and After birth (ABA) infant feeding service versus usual care. A two-arm, non-blinded randomised feasibility study will be conducted in two UK localities. Women expecting their first baby will be eligible, regardless of feeding intention. The ABA infant feeding intervention will apply a proactive, assets-based, woman-centred, non-judgemental approach, delivered antenatally and postnatally tailored through face-to-face contacts, telephone and SMS texts. Outcomes will test the feasibility of delivering the intervention with recommended intensity and duration to disadvantaged women; acceptability to women, feeding helpers and professionals; and feasibility of a future randomised controlled trial (RCT), detailing recruitment rates, willingness to be randomised, follow-up rates at 3 days, 8 weeks and 6 months, and level of outcome completion. Outcomes of the proposed full trial will also be collected. Mixed methods will include qualitative interviews with women/partners, feeding helpers and health service staff; feeding helper logs; and review of audio-recorded helper-women interactions to assess intervention fidelity. Study results will

  12. Gain weighted eigenspace assignment (United States)

    Davidson, John B.; Andrisani, Dominick, II


    This report presents the development of the gain weighted eigenspace assignment methodology. This provides a designer with a systematic methodology for trading off eigenvector placement versus gain magnitudes, while still maintaining desired closed-loop eigenvalue locations. This is accomplished by forming a cost function composed of a scalar measure of error between desired and achievable eigenvectors and a scalar measure of gain magnitude, determining analytical expressions for the gradients, and solving for the optimal solution by numerical iteration. For this development the scalar measure of gain magnitude is chosen to be a weighted sum of the squares of all the individual elements of the feedback gain matrix. An example is presented to demonstrate the method. In this example, solutions yielding achievable eigenvectors close to the desired eigenvectors are obtained with significant reductions in gain magnitude compared to a solution obtained using a previously developed eigenspace (eigenstructure) assignment method.

  13. Assignment Tracking Android Application


    Akanni, Feranmi Timothy


    One of the common ways of checking that knowledge is impacted into students at every level of education is by giving various tasks to students and part of the responsibilities of the teacher is to give assignments to students and check the solution provided by the students. Increase in technology development involves a number of mobile applications that are being developed and released on a daily basis, out of which Android operating application is one of the dominant mobile application. T...

  14. Task assignment and coaching


    Dominguez-Martinez, S.


    An important task of a manager is to motivate her subordinates. One way in which a manager can give incentives to junior employees is through the assignment of tasks. How a manager allocates tasks in an organization, provides information to the junior employees about his ability. Without coaching from a manager, the junior employee only has information about his past performance. Based on his past performance, a talented junior who has performed a difficult task sometimes decides to leave the...

  15. Protein Side-Chain Resonance Assignment and NOE Assignment Using RDC-Defined Backbones without TOCSY Data3 (United States)

    Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall


    One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA have backbone RMSD 0

  16. Graphical interpretation of Boolean operators for protein NMR assignments

    NARCIS (Netherlands)

    Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy

    We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical

  17. Algorithms and Algorithmic Languages. (United States)

    Veselov, V. M.; Koprov, V. M.

    This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

  18. SAGA: rapid automatic mainchain NMR assignment for large proteins

    Energy Technology Data Exchange (ETDEWEB)

    Crippen, Gordon M., E-mail: gcrippen@umich.ed [University of Michigan, College of Pharmacy (United States); Rousaki, Aikaterini [University of Michigan, LSA Biophysics (United States); Revington, Matthew [University of Windsor, Department of Chemistry and Biochemistry (Canada); Zhang Yongbo [Northwestern University, Department of Biochemistry, Molecular Biology and Cell Biology (United States); Zuiderweg, Erik R. P., E-mail: zuiderwe@umich.ed [University of Michigan Medical School, Department of Biological Chemistry (United States)


    Here we describe a new algorithm for automatically determining the mainchain sequential assignment of NMR spectra for proteins. Using only the customary triple resonance experiments, assignments can be quickly found for not only small proteins having rather complete data, but also for large proteins, even when only half the residues can be assigned. The result of the calculation is not the single best assignment according to some criterion, but rather a large number of satisfactory assignments that are summarized in such a way as to help the user identify portions of the sequence that are assigned with confidence, vs. other portions where the assignment has some correlated alternatives. Thus very imperfect initial data can be used to suggest future experiments.

  19. Flexible taxonomic assignment of ambiguous sequencing reads

    Directory of Open Access Journals (Sweden)

    Jansson Jesper


    Full Text Available Abstract Background To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference taxonomy. Reads that cannot be reliably assigned to a unique leaf in the taxonomy (ambiguous reads are typically assigned to the lowest common ancestor of the set of species that match it. This introduces a potentially severe error in the estimation of bacteria present in the sample due to false positives, since all species in the subtree rooted at the ancestor are implicitly assigned to the read even though many of them may not match it. Results We present a method that maps each read to a node in the taxonomy that minimizes a penalty score while balancing the relevance of precision and recall in the assignment through a parameter q. This mapping can be obtained in time linear in the number of matching sequences, because LCA queries to the reference taxonomy take constant time. When applied to six different metagenomic datasets, our algorithm produces different taxonomic distributions depending on whether coverage or precision is maximized. Including information on the quality of the reads reduces the number of unassigned reads but increases the number of ambiguous reads, stressing the relevance of our method. Finally, two measures of performance are described and results with a set of artificially generated datasets are discussed. Conclusions The assignment strategy of sequencing reads introduced in this paper is a versatile and a quick method to study bacterial communities. The bacterial composition of the analyzed samples can vary significantly depending on how ambiguous reads are assigned depending on the value of the q parameter. Validation of our results in an artificial dataset confirm that a combination of values of q produces the most accurate results.

  20. Solving multiconstraint assignment problems using learning automata. (United States)

    Horn, Geir; Oommen, B John


    This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the

  1. Job Assignments under Moral Hazard

    DEFF Research Database (Denmark)

    Koch, Alexander; Nafziger, Julia

    Inefficient job assignments are usually explained with incomplete information about employees' abilities or contractual imperfections. We show that inefficient assignments arise even without uncertainty about the employee's ability and with complete contracts. Building on this result we provide...

  2. Interactive Assignments for Online Students

    Directory of Open Access Journals (Sweden)

    Pam Lowry


    Full Text Available Students can experience first hand through interactive assignments what is involved in teaching an online course. Most students develop a whole new appreciation for the student learning process. Faculty are beginning to realize that online instruction is more than a series of readings posted to a course management system. This paper summarizes the faculty member's instructional strategies involved when creating student interaction assignments. The paper also summarizes the assignments, discussion board, and trends in education from the student's perspective. In summary, it concludes with the faculty's overall perspective concerning these assignments and how the assignments could be more effective for the student.

  3. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology (United States)

    Jackson, Justin Patrick

    This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm

  4. Multichannel assignment using K-Means in cognitive radio networks

    Directory of Open Access Journals (Sweden)

    Hans Raul Marquez


    Full Text Available Context: The developed scheme allows carrying out the assignment of several frequency channels (both contiguous and not contiguous available to the secondary users that require a higher bandwidth, under an environment of equality. Objective: The following paper develops a multichannel assignment which allows taking in a more efficient way the spectral opportunities in cognitive radio networks. Method: The developed assignment model is composed by the K-Means algorithm, which is in charged of carrying out the grouping of channels through clusters for the best parameters, and another algorithm in charge of establishing an equal criteria for all the secondary users that wish to transmit. The reached results were evaluated with experimental spectral occupancy data taken from the GSM frequency band. The developed model was compared with the MFA-CRN algorithm. Results: The obtained measurements correspond to the average bandwidth, the average delay, and the fairness calculation in the assignment of several channels. The developed assignment model shows an improvement in the assignment of a higher transmission average bandwidth for each secondary user while maintaining the fairness criteria in the channel assignments. Conclusion: Despite the increasing in the number of handoffs, it is also observed that metrics such as average bandwidth, average throughput and average delay are never negatively impacted by this increase in handoffs.

  5. Stable-matching-based subcarrier assignment method for multimode PON using a multicarrier variant of subcarrier multiplexing

    NARCIS (Netherlands)

    Taniman, R.O.; Sikkes, B.; van Bochove, A.C.; de Boer, Pieter-Tjerk

    In this paper, an adaptive subcarrier assignment method based on a stable matching algorithm is considered. From the performance comparison with other assignment methods (Hungarian-algorithm-based, contiguous and interleaved), our assignment method, while of relatively low complexity, resulted in a

  6. Algorithming the Algorithm

    DEFF Research Database (Denmark)

    Mahnke, Martina; Uprichard, Emma


    changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...... would like to emphasize another side to the algorithmic everyday life. We argue that algorithms can instigate and facilitate imagination, creativity, and frivolity, while saying something that is simultaneously old and new, always almost repeating what was before but never quite returning. We show...... this by threading together stimulating quotes and screenshots from Google’s autocomplete algorithms. In doing so, we invite the reader to re-explore Google’s autocomplete algorithms in a creative, playful, and reflexive way, thereby rendering more visible some of the excitement and frivolity that comes from being...

  7. Algorithms Introduction to Algorithms

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 1. Algorithms Introduction to Algorithms. R K Shyamasundar. Series Article Volume 1 Issue 1 January 1996 pp 20-27. Fulltext. Click here to view fulltext PDF. Permanent link: ...

  8. A Process Algebra Genetic Algorithm


    Karaman, Sertac; Shima, Tal; Frazzoli, Emilio


    A genetic algorithm that utilizes process algebra for coding of solution chromosomes and for defining evolutionary based operators is presented. The algorithm is applicable to mission planning and optimization problems. As an example the high level mission planning for a cooperative group of uninhabited aerial vehicles is investigated. The mission planning problem is cast as an assignment problem, and solutions to the assignment problem are given in the form of chromosomes that are manipulate...

  9. Game theory and traffic assignment. (United States)


    Traffic assignment is used to determine the number of users on roadway links in a network. While this problem has : been widely studied in transportation literature, its use of the concept of equilibrium has attracted considerable interest : in the f...

  10. An Assignment Sequence for Underprepared Writers. (United States)

    Nimmo, Kristi


    Presents a sequenced writing assignment on shopping to aid basic writers. Describes a writing assignment focused around online and mail-order shopping. Notes steps in preparing for the assignment, the sequence, and discusses responses to the assignments. (SC)

  11. Strategy-Proof Stochastic Assignment


    Erdil, A.


    I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is highly restrictive when the mechanism involves randomization. In fact, the Random Priority mechanism...

  12. Adaptive protection algorithm and system (United States)

    Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA


    An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.

  13. A multiobjective approach towards weapon assignment in a ground ...

    African Journals Online (AJOL)

    solved in the context of a simulated, but realistic, GBAD environment by means of an existing multiobjective solution technique called the Nondominated Sorting Genetic Algorithm II. Key words: Multicriteria decision making, threat evaluation and weapon assignment, NSGA II. ∗Corresponding author: Department of Logistics ...

  14. A new heuristic for the quadratic assignment problem


    Zvi Drezner


    We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.

  15. Study on store-space assignment based on logistic AGV in e-commerce goods to person picking pattern (United States)

    Xu, Lijuan; Zhu, Jie


    This paper studied on the store-space assignment based on logistic AGV in E-commerce goods to person picking pattern, and established the store-space assignment model based on the lowest picking cost, and design for store-space assignment algorithm after the cluster analysis based on similarity coefficient. And then through the example analysis, compared the picking cost between store-space assignment algorithm this paper design and according to item number and storage according to ABC classification allocation, and verified the effectiveness of the design of the store-space assignment algorithm.

  16. A Stone Resource Assignment Model under the Fuzzy Environment

    Directory of Open Access Journals (Sweden)

    Liming Yao


    to tackle a stone resource assignment problem with the aim of decreasing dust and waste water emissions. On the upper level, the local government wants to assign a reasonable exploitation amount to each stone plant so as to minimize total emissions and maximize employment and economic profit. On the lower level, stone plants must reasonably assign stone resources to produce different stone products under the exploitation constraint. To deal with inherent uncertainties, the object functions and constraints are defuzzified using a possibility measure. A fuzzy simulation-based improved simulated annealing algorithm (FS-ISA is designed to search for the Pareto optimal solutions. Finally, a case study is presented to demonstrate the practicality and efficiency of the model. Results and a comparison analysis are presented to highlight the performance of the optimization method, which proves to be very efficient compared with other algorithms.

  17. Efficient eigenvalue assignment by state and output feedback with applications for large space structures (United States)

    Vannell, Eric C.; Kenny, Sean P.; Maghami, Peiman G.


    The erection and deployment of large flexible structures having thousands of degrees of freedom requires controllers based on new techniques of eigenvalue assignment that are computationally stable and more efficient. Scientists at NASA Langley Research Center have developed a novel and efficient algorithm for the eigenvalue assignment of large, time-invariant systems using full-state and output feedback. The objectives of this research were to improve upon the output feedback version of this algorithm, to produce a toolbox of MATLAB functions based on the efficient eigenvalue assignment algorithm, and to experimentally verify the algorithm and software by implementing controllers designed using the MATLAB toolbox on the phase 2 configuration of NASA Langley's controls-structures interaction evolutionary model, a laboratory model used to study space structures. Results from laboratory tests and computer simulations show that effective controllers can be designed using software based on the efficient eigenvalue assignment algorithm.

  18. Alternative Assignment Incentive Pay Formats (United States)


    300 dollars there was a 52% increase in applications and a 115 % increase in fill rates. This is extremely important to the Navy because it “suggest...Congress.” E-mail to 01 April 2005. 7. Nimon , W. R. and Hall, D. R. “An Experimental Analysis of the Relative Efficiency of...Scores (60 + 55 = 115 ). Accordingly, Bidder 1 is assigned to Job 1, Bidder 2 is unassigned, and Bidder 3 is assigned to Job 2. Payout in the

  19. Assigning agents to a line

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Østerdal, Lars Peter Raahave


    minimizing modification of the classic random priority method to solve this class of problems. We also provide some logical relations in our setting among standard axioms in the literature on assignment problems, and explore the robustness of our results to several extensions of our setting....

  20. Who benefits from homework assignments?


    Rønning, Marte


    Abstract: Using Dutch data on pupils in elementary school this paper is the first empirical study that analyzes whether assigning homework has an heterogeneous impact on pupil achievement. Addressing potential biases that arise from unobserved school quality, pupil selection by exploiting different methods, I find that the test score gap is larger in classes where everybody gets homework than in classes where nobody gets homework. More precisely pupils belonging to the upper part of the so...

  1. The use of meta-heuristics for airport gate assignment

    DEFF Research Database (Denmark)

    Cheng, Chun-Hung; Ho, Sin C.; Kwan, Cheuk-Lam


    Improper assignment of gates may result in flight delays, inefficient use of the resource, customer’s dissatisfaction. A typical metropolitan airport handles hundreds of flights a day. Solving the gate assignment problem (GAP) to optimality is often impractical. Meta-heuristics have recently been...... proposed to generate good solutions within a reasonable timeframe. In this work, we attempt to assess the performance of three meta-heuristics, namely, genetic algorithm (GA), tabu search (TS), simulated annealing (SA) and a hybrid approach based on SA and TS. Flight data from Incheon International Airport...

  2. Algorithm for structure constants

    CERN Document Server

    Paiva, F M


    In a $n$-dimensional Lie algebra, random numerical values are assigned by computer to $n(n-1)$ especially selected structure constants. An algorithm is then created, which calculates without ambiguity the remaining constants, obeying the Jacobi conditions. Differently from others, this algorithm is suitable even for poor personal computer. ------------- En $n$-dimensia algebro de Lie, hazardaj numeraj valoroj estas asignitaj per komputilo al $n(n-1)$ speciale elektitaj konstantoj de strukturo. Tiam algoritmo estas kreita, kalkulante senambigue la ceterajn konstantojn, obeante kondicxojn de Jacobi. Malsimile al aliaj algoritmoj, tiu cxi tauxgas ecx por malpotenca komputilo.

  3. Algorithm design

    CERN Document Server

    Kleinberg, Jon


    Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

  4. Genetic algorithms (United States)

    Wang, Lui; Bayer, Steven E.


    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  5. A Statistical Programme Assignment Model

    DEFF Research Database (Denmark)

    Rosholm, Michael; Staghøj, Jonas; Svarer, Michael

    When treatment effects of active labour market programmes are heterogeneous in an observable way  across the population, the allocation of the unemployed into different programmes becomes a particularly  important issue. In this paper, we present a statistical model designed to improve the present...... duration of unemployment spells may result if a statistical programme assignment model is introduced. We discuss several issues regarding the  plementation of such a system, especially the interplay between the statistical model and  case workers....

  6. A new genetic representation for quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    Kratica Jozef


    Full Text Available In this paper, we propose a new genetic encoding for well known Quadratic Assignment Problem (QAP. The new encoding schemes are implemented with appropriate objective function and modified genetic operators. The numerical experiments were carried out on the standard QAPLIB data sets known from the literature. The presented results show that in all cases proposed genetic algorithm reached known optimal solutions in reasonable time.

  7. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine


    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

  8. The Random Quadratic Assignment Problem (United States)

    Paul, Gerald; Shao, Jia; Stanley, H. Eugene


    The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P. Surprisingly, the QAP has not been studied before using the replica method despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for C min and C max , the costs of the minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for C min and C max and their dependence on P only through its mean and standard deviation, independent of the details of P.

  9. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan


    Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

  10. Automated solid-state NMR resonance assignment of protein microcrystals and amyloids

    Energy Technology Data Exchange (ETDEWEB)

    Schmidt, Elena [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany); Gath, Julia [ETH Zurich, Physical Chemistry (Switzerland); Habenstein, Birgit [UMR 5086 CNRS/Universite de Lyon 1, Institut de Biologie et Chimie des Proteines (France); Ravotti, Francesco; Szekely, Kathrin; Huber, Matthias [ETH Zurich, Physical Chemistry (Switzerland); Buchner, Lena [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany); Boeckmann, Anja, E-mail: [UMR 5086 CNRS/Universite de Lyon 1, Institut de Biologie et Chimie des Proteines (France); Meier, Beat H., E-mail: [ETH Zurich, Physical Chemistry (Switzerland); Guentert, Peter, E-mail: [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany)


    Solid-state NMR is an emerging structure determination technique for crystalline and non-crystalline protein assemblies, e.g., amyloids. Resonance assignment constitutes the first and often very time-consuming step to a structure. We present ssFLYA, a generally applicable algorithm for automatic assignment of protein solid-state NMR spectra. Application to microcrystals of ubiquitin and the Ure2 prion C-terminal domain, as well as amyloids of HET-s(218-289) and {alpha}-synuclein yielded 88-97 % correctness for the backbone and side-chain assignments that are classified as self-consistent by the algorithm, and 77-90 % correctness if also assignments classified as tentative by the algorithm are included.

  11. Assignment Choice, Effort, and Assignment Completion: Does Work Ethic Predict Those Who Choose Higher-Effort Assignments? (United States)

    Parkhurst, John T.; Fleisher, Matthew S.; Skinner, Christopher H.; Woehr, David J.; Hawthorn-Embree, Meredith L.


    After completing the Multidimensional Work-Ethic Profile (MWEP), 98 college students were given a 20-problem math computation assignment and instructed to stop working on the assignment after completing 10 problems. Next, they were allowed to choose to finish either the partially completed assignment that had 10 problems remaining or a new…

  12. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of

  13. Integrated assignment and path planning (United States)

    Murphey, Robert A.


    A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact

  14. Managing voluntary turnover through challenging assignments

    NARCIS (Netherlands)

    Preenen, P.T.Y.; de Pater, I.E.; van Vianen, A.E.M.; Keijzer, L.


    This study examines employees’ challenging assignments as manageable means to reduce turnover intentions, job search behaviors, and voluntary turnover. Results indicate that challenging assignments are negatively related to turnover intentions and job search behaviors and that these relationships

  15. Managing voluntary turnover through challenging assignments

    NARCIS (Netherlands)

    Preenen, P.T.Y.; Pater, I.E. de; Vianen, A.E.M. van; Keijzer, L.


    This study examines employees' challenging assignments as manageable means to reduce turnover intentions, job search behaviors, and voluntary turnover. Results indicate that challenging assignments are negatively related to turnover intentions and job search behaviors and that these relationships

  16. Assigning historic responsibility for extreme weather events (United States)

    Otto, Friederike E. L.; Skeie, Ragnhild B.; Fuglestvedt, Jan S.; Berntsen, Terje; Allen, Myles R.


    Recent scientific advances make it possible to assign extreme events to human-induced climate change and historical emissions. These developments allow losses and damage associated with such events to be assigned country-level responsibility.

  17. Assigning Homework to Couples and Families (United States)

    Dattilio, Frank M.; Dickson, Jan


    Homework assignments, or "out-of-session assignments," have gained popularity among couple and family therapists due to their potential to solidify the work achieved during the course of therapy and to help clients take responsibility for their own change. Homework assignments also serve as a testing ground in therapy to determine what works and…

  18. New optimization model for routing and spectrum assignment with nodes insecurity (United States)

    Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli


    By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.

  19. Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment (United States)

    Karimzadehgan, Maryam; Zhai, ChengXiang


    Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. PMID:22711970

  20. Asset-Based Measurement of Poverty (United States)

    Brandolini, Andrea; Magri, Silvia; Smeeding, Timothy M.


    Poverty is generally defined as income or expenditure insufficiency, but the economic condition of a household also depends on its real and financial asset holdings. This paper investigates measures of poverty that rely on indicators of household net worth. We review and assess two main approaches followed in the literature: income-net worth…

  1. New pole placement algorithm - Polynomial matrix approach (United States)

    Shafai, B.; Keel, L. H.


    A simple and direct pole-placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well-established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.

  2. Algorithmic Case Pedagogy, Learning and Gender (United States)

    Bromley, Robert; Huang, Zhenyu


    Great investment has been made in developing algorithmically-based cases within online homework management systems. This has been done because publishers are convinced that textbook adoption decisions are influenced by the incorporation of these systems within their products. These algorithmic assignments are thought to promote learning while…

  3. Library-Based Assignments That Enrich the Business Communication Course. (United States)

    Hiemstra, Kathleen M.


    Reviews the benefits of library work (and some cautions) before describing four assignments that exploit library resources: a business report assignment; a professional journal assignment; a style manual format assignment; and an international business communication assignment. (SG)

  4. Some insights on hard quadratic assignment problem instances (United States)

    Hussin, Mohamed Saifullah


    Since the formal introduction of metaheuristics, a huge number Quadratic Assignment Problem (QAP) instances have been introduced. Those instances however are loosely-structured, and therefore made it difficult to perform any systematic analysis. The QAPLIB for example, is a library that contains a huge number of QAP benchmark instances that consists of instances with different size and structure, but with a very limited availability for every instance type. This prevents researchers from performing organized study on those instances, such as parameter tuning and testing. In this paper, we will discuss several hard instances that have been introduced over the years, and algorithms that have been used for solving them.

  5. Fluid Genetic Algorithm (FGA

    Directory of Open Access Journals (Sweden)

    Ruholla Jafari-Marandi


    Full Text Available Genetic Algorithm (GA has been one of the most popular methods for many challenging optimization problems when exact approaches are too computationally expensive. A review of the literature shows extensive research attempting to adapt and develop the standard GA. Nevertheless, the essence of GA which consists of concepts such as chromosomes, individuals, crossover, mutation, and others rarely has been the focus of recent researchers. In this paper method, Fluid Genetic Algorithm (FGA, some of these concepts are changed, removed, and furthermore, new concepts are introduced. The performance of GA and FGA are compared through seven benchmark functions. FGA not only shows a better success rate and better convergence control, but it can be applied to a wider range of problems including multi-objective and multi-level problems. Also, the application of FGA for a real engineering problem, Quadric Assignment Problem (AQP, is shown and experienced.

  6. Predicting Assignment Submissions in a Multiclass Classification Problem

    Directory of Open Access Journals (Sweden)

    Bogdan Drăgulescu


    Full Text Available Predicting student failure is an important task that can empower educators to counteract the factors that affect student performance. In this paper, a part of the bigger problem of predicting student failure is addressed: predicting the students that do not complete their assignment tasks. For solving this problem, real data collected by our university’s educational platform was used. Because the problem consisted of predicting one of three possible classes (multi-class classification, the appropriate algorithms and methods were selected. Several experiments were carried out to find the best approach for this prediction problem and the used data set. An approach of time segmentation is proposed in order to facilitate the prediction from early on. Methods that address the problems of high dimensionality and imbalanced data were also evaluated. The outcome of each approach is shown and compared in order to select the best performing classification algorithm for the problem at hand.

  7. Metroplex-Wide Runway Configuration Management using COBRA (Configuration Optimization for Balanced Runway/Route Assignments) Tool Project (United States)

    National Aeronautics and Space Administration — SSCI proposes to develop and test a Configuration Optimization for Balanced Runway/Route Assignments (COBRA) tool, which includes analysis and planner algorithms for...

  8. Arbitrary eigenvalue assignments for linear time-varying multivariable control systems (United States)

    Nguyen, Charles C.


    The problem of eigenvalue assignments for a class of linear time-varying multivariable systems is considered. Using matrix operators and canonical transformations, it is shown that a time-varying system that is 'lexicography-fixedly controllable' can be made via state feedback to be equivalent to a time-invariant system whose eigenvalues are arbitrarily assignable. A simple algorithm for the design of the state feedback is provided.

  9. Enhanced functional and structural domain assignments using ...

    Indian Academy of Sciences (India)


    biology of MTB, yet the functions of many MTB proteins are unknown. We have used sensitive profile-based search procedures to assign functional and structural domains to infer functions of gene products encoded in. MTB. These domain assignments have been made using a compendium of sequence and structural ...

  10. The Assessment of Students by Formal Assignments. (United States)

    Bassey, Michael

    New Zealand universities have been examining the possibilities of abolishing end-of-year examinations and placing more importance on coursework. This monograph offers the alternative of assessing students by formal assignments. The formal assignment system has 4 essential characteristics which distinguish it from other methods of assessment. (1) A…

  11. Protein secondary structure: category assignment and predictability

    DEFF Research Database (Denmark)

    Andersen, Claus A.; Bohr, Henrik; Brunak, Søren


    structures. Single sequence prediction of the new three category assignment gives an overall prediction improvement of 3.1% and 5.1%, compared to the DSSP assignment and schemes where the helix category consists of a-helix and 3(10)-helix, respectively. These results were achieved using a standard feed-forward...

  12. Integrating Online Assignments Checking in Introductory Courses (United States)

    Pundak, David; Shacham, Miri; Herscovitz, Orit


    Web technology offers lecturers the option of checking students' assignments online. Several systems have evolved to deliver personal assignments to each student in a multi-participant course. These systems provide students with immediate feedback, allowing them to correct erroneous answers and referring them to relevant literary sources that can…

  13. Assigning Elementary Pupils to Their Teachers. (United States)

    Monk, David H.


    Examines variation in the methods used to assign students to classrooms and teachers in a small but highly diversified sample of elementary schools. Gives explicit attention to parental influence on pupil assignments as well as to effects of having an unusually incompetent or excellent teacher at a particular grade level. (NH)

  14. Frequency assignment for satellite multilevel SCPC systems (United States)

    Lau, Yuk-Hong; Skellern, D. J.


    A method for searching the frequency assignment for satellite multilevel SCPC systems is proposed based on the method for the case of equal carrier systems. The quality of assignment improves significantly on published results. The method requires only very short computations times.

  15. Gapminder: An AP Human Geography Lab Assignment (United States)

    Keller, Kenneth H.


    This lesson is designed as a lab assignment for Advanced Placement (AP) Human Geography students wherein they use the popular Gapminder web site to compare levels of development in countries from different world regions. For this lesson, it is important for the teacher to practice with Gapminder before giving the assignment to students. (Contains…

  16. Detecting Plagiarism in MS Access Assignments (United States)

    Singh, Anil


    Assurance of individual effort from students in computer-based assignments is a challenge. Due to digitization, students can easily use a copy of their friend's work and submit it as their own. Plagiarism in assignments puts students who cheat at par with those who work honestly and this compromises the learning evaluation process. Using a…

  17. Postgraduate diploma collaborative assignment: Implications for ...

    African Journals Online (AJOL)

    Business groups remained intact across various diplomas and large focus areas, which would act as a pivot for the major group assignments, were forged using scenarios from three core courses. Each general topic thus included at least three separate yet complementary portfolio assignments that differed in genre, ...

  18. The Assignment Game : The Reduced Game


    Guillermo OWEN


    Let v be an assignment game. For a given reference payoff vector (x; y), and a coalition S, bargaining within the coalition can be represented by either the reduced game or the derived game. It is known that the reduced game need not be an assignment game (in fact, it need not be super additive) while the derived game is another assignment game, with modified reservation prices. We prove that, when the reference vector is in the core of the game, the derived game is the super additive cover o...

  19. A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem

    Directory of Open Access Journals (Sweden)

    You Li


    Full Text Available The weapon-target assignment (WTA problem, known as an NP-complete problem, aims at seeking a proper assignment of weapons to targets. The biobjective WTA (BOWTA optimization model which maximizes the expected damage of the enemy and minimizes the cost of missiles is designed in this paper. A modified Pareto ant colony optimization (MPACO algorithm is used to solve the BOWTA problem. In order to avoid defects in traditional optimization algorithms and obtain a set of Pareto solutions efficiently, MPACO algorithm based on new designed operators is proposed, including a dynamic heuristic information calculation approach, an improved movement probability rule, a dynamic evaporation rate strategy, a global updating rule of pheromone, and a boundary symmetric mutation strategy. In order to simulate real air combat, the pilot operation factor is introduced into the BOWTA model. Finally, we apply the MPACO algorithm and other algorithms to the model and compare the data. Simulation results show that the proposed algorithm is successfully applied in the field of WTA which improves the performance of the traditional P-ACO algorithm effectively and produces better solutions than the two well-known multiobjective optimization algorithms NSGA-II and SPEA-II.

  20. Homework assignments in couple and family therapy. (United States)

    Dattilio, Frank M


    Homework has been cited as an integral part of a number of theoretical orientations and therapy formats; unfortunately, very little has been written about its use with couples and families. This is despite the fact that many couple and family therapists espouse the use of homework or out-of-session assignments in order to help the effects of therapy jell. This article reviews some of the empirical literature on homework assignments and their effectiveness in the domain of therapy for families and couples. It also highlights the effectiveness of and the need for out-of-session assignments in treatment. A case illustration is used to demonstrate how homework assignments may be used as a significant change agent in couple and family treatment. Copyright 2002 Wiley Periodicals, Inc.

  1. On pole structure assignment in linear systems

    Czech Academy of Sciences Publication Activity Database

    Loiseau, J.-J.; Zagalak, Petr


    Roč. 82, č. 7 (2009), s. 1179-1192 ISSN 0020-7179 R&D Projects: GA ČR(CZ) GA102/07/1596 Institutional research plan: CEZ:AV0Z10750506 Keywords : linear systems * linear state feedback * pole structure assignment Subject RIV: BC - Control Systems Theory Impact factor: 1.124, year: 2009 pole structure assignment in linear systems.pdf

  2. Economic benefit assignment in environmental cost allocation


    Collins C. Ngwakwe


    This paper aims to suggest a model to reward a dirty product which has the potential to offer sales promotion services to other clean products in a multiple product firm. The paper suggests a model economic benefit assignment (eba) for apportionment of direct waste costs where a polluting product offers a sales promotion benefit to other clean products of the same company, which proposes that benefiting products should be assigned a proportion of the direct waste cost of the polluting product...

  3. Combinatorial algorithms

    CERN Document Server

    Hu, T C


    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  4. Competitive Traffic Assignment in Road Networks

    Directory of Open Access Journals (Sweden)

    Krylatov Alexander Y.


    Full Text Available Recently in-vehicle route guidance and information systems are rapidly developing. Such systems are expected to reduce congestion in an urban traffic area. This social benefit is believed to be reached by imposing the route choices on the network users that lead to the system optimum traffic assignment. However, guidance service could be offered by different competitive business companies. Then route choices of different mutually independent groups of users may reject traffic assignment from the system optimum state. In this paper, a game theoretic approach is shown to be very efficient to formalize competitive traffic assignment problem with various groups of users in the form of non-cooperative network game with the Nash equilibrium search. The relationships between the Wardrop’s system optimum associated with the traffic assignment problem and the Nash equilibrium associated with the competitive traffic assignment problem are investigated. Moreover, some related aspects of the Nash equilibrium and the Wardrop’s user equilibrium assignments are also discussed.

  5. Autodriver algorithm

    Directory of Open Access Journals (Sweden)

    Anna Bourmistrova


    Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.

  6. Algorithm 865

    DEFF Research Database (Denmark)

    Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy


    variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel...

  7. Automated assignment of NMR chemical shifts based on a known structure and 4D spectra

    Energy Technology Data Exchange (ETDEWEB)

    Trautwein, Matthias; Fredriksson, Kai [Eberhard Karls Universität Tübingen, Institute of Pharmacy (Germany); Möller, Heiko M. [University of Potsdam, Institute of Chemistry (Germany); Exner, Thomas E., E-mail: [Eberhard Karls Universität Tübingen, Institute of Pharmacy (Germany)


    Apart from their central role during 3D structure determination of proteins the backbone chemical shift assignment is the basis for a number of applications, like chemical shift perturbation mapping and studies on the dynamics of proteins. This assignment is not a trivial task even if a 3D protein structure is known and needs almost as much effort as the assignment for structure prediction if performed manually. We present here a new algorithm based solely on 4D [{sup 1}H,{sup 15}N]-HSQC-NOESY-[{sup 1}H,{sup 15}N]-HSQC spectra which is able to assign a large percentage of chemical shifts (73–82 %) unambiguously, demonstrated with proteins up to a size of 250 residues. For the remaining residues, a small number of possible assignments is filtered out. This is done by comparing distances in the 3D structure to restraints obtained from the peak volumes in the 4D spectrum. Using dead-end elimination, assignments are removed in which at least one of the restraints is violated. Including additional information from chemical shift predictions, a complete unambiguous assignment was obtained for Ubiquitin and 95 % of the residues were correctly assigned in the 251 residue-long N-terminal domain of enzyme I. The program including source code is available at .

  8. A comprehensive quadratic assignment problem for an integrated layout design of final assembly line and manufacturing feeder cells

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani


    Full Text Available Assembly lines and cellular manufacturing systems (CMSs design have been widely used in the literature. However the integration of these manufacturing concepts is neglected in an environment where parts need to be assembled after production in different shops. In this paper, a comprehensive quadratic assignment problem is developed for the assignment of machines of each part manufacturing cell, sub-assembly tasks of each sub-assembly cell as well as the assignment of different cells and final assembly tasks within the shop floor in their relevant predetermined locations. A genetic algorithm (GA as well as a memetic algorithm (MA consisting of the proposed GA and Tabu search (TS algorithm are proposed and implemented on different size numerical examples. The obtained results show the efficiency of both algorithms to reach near optimal solutions compared to the optimal solution of small-sized problems.

  9. An Accurate and Impartial Expert Assignment Method for Scientific Project Review

    Directory of Open Access Journals (Sweden)

    Mingliang Yue


    Full Text Available Purpose: This paper proposes an expert assignment method for scientific project review that considers both accuracy and impartiality. As impartial and accurate peer review is extremely important to ensure the quality and feasibility of scientific projects, enhanced methods for managing the process are needed. Design/methodology/approach: To ensure both accuracy and impartiality, we design four criteria, the reviewers’ fitness degree, research intensity, academic association, and potential conflict of interest, to express the characteristics of an appropriate peer review expert. We first formalize the expert assignment problem as an optimization problem based on the designed criteria, and then propose a randomized algorithm to solve the expert assignment problem of identifying reviewer adequacy. Findings: Simulation results show that the proposed method is quite accurate and impartial during expert assignment. Research limitations: Although the criteria used in this paper can properly show the characteristics of a good and appropriate peer review expert, more criteria/conditions can be included in the proposed scheme to further enhance accuracy and impartiality of the expert assignment. Practical implications: The proposed method can help project funding agencies (e.g. the National Natural Science Foundation of China find better experts for project peer review. Originality/value: To the authors’ knowledge, this is the first publication that proposes an algorithm that applies an impartial approach to the project review expert assignment process. The simulation results show the effectiveness of the proposed method.

  10. Solving the Dial-a-Ride Problem using Genetic algorithms

    DEFF Research Database (Denmark)

    Bergvinsdottir, Kristin Berg; Larsen, Jesper; Jørgensen, Rene Munk

    service level constraints (Quality of Service). In this paper we present a genetic algorithm for solving the DARP. The algorithm is based on the classical cluster-first route-second approach, where it alternates between assigning customers to vehicles using a genetic algorithm and solving independent...... routing problems for the vehicles using a routing heuristic. The algorithm is implemented in Java and tested on publicly available data sets....

  11. A multi-objective approach to the assignment of stock keeping units to unidirectional picking lines

    Directory of Open Access Journals (Sweden)

    Le Roux, G. J.


    Full Text Available An order picking system in a distribution centre consisting of parallel unidirectional picking lines is considered. The objectives are to minimise the walking distance of the pickers, the largest volume of stock on a picking line over all picking lines, the number of small packages, and the total penalty incurred for late distributions. The problem is formulated as a multi-objective multiple knapsack problem that is not solvable in a realistic time. Population-based algorithms, including the artificial bee colony algorithm and the genetic algorithm, are also implemented. The results obtained from all algorithms indicate a substantial improvement on all objectives relative to historical assignments. The genetic algorithm delivers the best performance.

  12. Flow Oriented Channel Assignment for Multi-radio Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Niu Zhisheng


    Full Text Available We investigate channel assignment for a multichannel wireless mesh network backbone, where each router is equipped with multiple interfaces. Of particular interest is the development of channel assignment heuristics for multiple flows. We present an optimization formulation and then propose two iterative flow oriented heuristics for the conflict-free and interference-aware cases, respectively. To maximize the aggregate useful end-to-end flow rates, both algorithms identify and resolve congestion at instantaneous bottleneck link in each iteration. Then the link rate is optimally allocated among contending flows that share this link by solving a linear programming (LP problem. A thorough performance evaluation is undertaken as a function of the number of channels and interfaces/node and the number of contending flows. The performance of our algorithm is shown to be significantly superior to best known algorithm in its class in multichannel limited radio scenarios.

  13. Protein secondary structure assignment revisited: a detailed analysis of different assignment methods

    Directory of Open Access Journals (Sweden)

    de Brevern Alexandre G


    Full Text Available Abstract Background A number of methods are now available to perform automatic assignment of periodic secondary structures from atomic coordinates, based on different characteristics of the secondary structures. In general these methods exhibit a broad consensus as to the location of most helix and strand core segments in protein structures. However the termini of the segments are often ill-defined and it is difficult to decide unambiguously which residues at the edge of the segments have to be included. In addition, there is a "twilight zone" where secondary structure segments depart significantly from the idealized models of Pauling and Corey. For these segments, one has to decide whether the observed structural variations are merely distorsions or whether they constitute a break in the secondary structure. Methods To address these problems, we have developed a method for secondary structure assignment, called KAKSI. Assignments made by KAKSI are compared with assignments given by DSSP, STRIDE, XTLSSTR, PSEA and SECSTR, as well as secondary structures found in PDB files, on 4 datasets (X-ray structures with different resolution range, NMR structures. Results A detailed comparison of KAKSI assignments with those of STRIDE and PSEA reveals that KAKSI assigns slightly longer helices and strands than STRIDE in case of one-to-one correspondence between the segments. However, KAKSI tends also to favor the assignment of several short helices when STRIDE and PSEA assign longer, kinked, helices. Helices assigned by KAKSI have geometrical characteristics close to those described in the PDB. They are more linear than helices assigned by other methods. The same tendency to split long segments is observed for strands, although less systematically. We present a number of cases of secondary structure assignments that illustrate this behavior. Conclusion Our method provides valuable assignments which favor the regularity of secondary structure segments.

  14. Assignment of fields from particles to mesh

    CERN Document Server

    Duque, Daniel


    In Computational Fluid Dynamics there have been many attempts to combine the power of a fixed mesh on which to carry out spatial calculations with that of a set of particles that moves following the velocity field. These ideas indeed go back to Particle-in-Cell methods, proposed about 60 years ago. Of course, some procedure is needed to transfer field information between particles and mesh. There are many possible choices for this "assignment", or "projection". Several requirements may guide this choice. Two well-known ones are conservativity and stability, which apply to volume integrals of the fields. An additional one is here considered: preservation of information. This means that mesh interpolation, followed by mesh assignment, should leave the field values invariant. The resulting methods are termed "mass" assignments due to their strong similarities with the Finite Element Method. We test several procedures, including the well-known FLIP, on three scenarios: simple 1D convection, 2D convection of Zales...

  15. Algorithmic Self

    DEFF Research Database (Denmark)

    Markham, Annette

    layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also......This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....

  16. Writing Assignments that Promote Active Learning (United States)

    Narayanan, M.


    Encourage students to write a detailed, analytical report correlating classroom discussions to an important historical event or a current event. Motivate students interview an expert from industry on a topic that was discussed in class. Ask the students to submit a report with supporting sketches, drawings, circuit diagrams and graphs. Propose that the students generate a complete a set of reading responses pertaining to an assigned topic. Require each student to bring in one comment or one question about an assigned reading. The assignment should be a recent publication in an appropriate journal. Have the students conduct a web search on an assigned topic. Ask them to generate a set of ideas that can relate to classroom discussions. Provide the students with a study guide. The study guide should provide about 10 or 15 short topics. Quiz the students on one or two of the topics. Encourage the students to design or develop some creative real-world examples based on a chapter discussed or a topic of interest. Require that students originate, develop, support and defend a viewpoint using a specifically assigned material. Make the students practice using or utilizing a set of new technical terms they have encountered in an assigned chapter. Have students develop original examples explaining the different terms. Ask the students to select one important terminology from the previous classroom discussions. Encourage the students to explain why they selected that particular word. Ask them to talk about the importance of the terminology from the point of view of their educational objectives and future career. Angelo, T. A. (1991). Ten easy pieces: Assessing higher learning in four dimensions. In T. A. Angelo (Ed.), Classroom research: Early lessons from success (pp. 17-31). New Directions for Teaching and Learning, No. 46. San Francisco: Jossey-Bass.

  17. Manganese Oxidation State Assignment for Manganese Catalase. (United States)

    Beal, Nathan J; O'Malley, Patrick J


    The oxidation state assignment of the manganese ions present in the superoxidized manganese (III/IV) catalase active site is determined by comparing experimental and broken symmetry density functional theory calculated (14)N, (17)O, and (1)H hyperfine couplings. Experimental results have been interpreted to indicate that the substrate water is coordinated to the Mn(III) ion. However, by calculating hyperfine couplings for both scenarios we show that water is coordinated to the Mn(IV) ion and that the assigned oxidation states of the two manganese ions present in the site are the opposite of that previously proposed based on experimental measurements alone.

  18. Hybrid resolution approaches for dynamic assignment problem of reusable containers

    Directory of Open Access Journals (Sweden)

    Ech-Charrat Mohammed Rida


    Full Text Available In this study, we are interested in the reusing activities of reverse logistics. We focus on the dynamic assignment of reusable containers problem (e.g. gas bottles, beverages, pallets, maritime containers, etc.. The objective is to minimize the collect, reloading, storage and redistribution operations costs over a fixed planning horizon taking into account the greenhouse gas emissions. We present a new generic Mixed Integer Programming (MIP model for the problem. The proposed model was solved using the IBM ILOG CPLEX optimization software; this method yield exact solutions, but it is very time consuming. So we adapted two hybrid approaches using a genetic algorithm to solve the problem at a reduced time (The second hybrid approach is enhanced with a local search procedure based on the Variable Neighborhood Search VNS. The numerical results show that both developed hybrid approaches generate high-quality solutions in a moderate computational time, especially the second hybrid method.

  19. A combined strategy for solving quadratic assignment problem (United States)

    Ahyaningsih, Faiz


    The quadratic assignment problem is a combinatorial problem of deciding the placement of facilities in specified locations in such a way as to minimize a nonconvex objective function expressed in terms of flow between facilities, and distance between location. Due to the non-convexity nature of the problem, therefore to get a `good' starting point is necessary in order to obtain a better optimal solution. In this paper we propose a combined strategy (random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get `optimal' solution). As a computational experience we've solved the problem of Esc 16b, Esc 16c and Esc 16h from QAPLIB. Finally, we present a comparative study between Combined Strategy and Data -Guided Lexisearch Algorithm. The computational study shows the effectiveness of our proposed combined strategy.

  20. Game theoretic target assignment approach in ballistic missile defense (United States)

    Wei, Mo; Chen, Genshe; Pham, Khanh; Blasch, Erik; Wu, Yingli


    In this paper, both Pareto game theory and learning theory algorithms are utilized in a resource management module for a practical missile interception system. The resource management module will determine how many and which antimissiles will be launched for interception. Such interception decisions are based on the number of invading missiles, availability of antimissiles, special capability of antimissiles, and realistic constraints on the movements of both invading missiles and antimissiles such as minimum turning radius, maximum velocity, fuel range, etc. Simulations demonstrate performance improvements when compared to existing strategies (i.e. random assignment), independent of guidance laws (i.e. Proportional Navigation (PN) or the Differential-Game-based Guidance Law (DGL) guidance laws) under end-game interception cases or midcourse interception situations.

  1. Optimizing connected component labeling algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Kesheng; Otoo, Ekow; Shoshani, Arie


    This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 {approx} 100 in our tests on random binary images.

  2. Genetic Algorithms Principles Towards Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Nabil M. Hewahi


    Full Text Available In this paper we propose a general approach based on Genetic Algorithms (GAs to evolve Hidden Markov Models (HMM. The problem appears when experts assign probability values for HMM, they use only some limited inputs. The assigned probability values might not be accurate to serve in other cases related to the same domain. We introduce an approach based on GAs to find
    out the suitable probability values for the HMM to be mostly correct in more cases than what have been used to assign the probability values.

  3. Heuristic Scheme for Home Circuit Grouping andWavelength Assignment in LOBS-HC Networks (United States)

    Yang, Ximin; Yi, Bo; Tang, Wan; Li, Jingcong


    Grouping the Home Circuits (HCs) with the same source is a critical issue of Labeled Optical Burst Switching with Home Circuit (LOBS-HC). To maximize the wavelength utilization in LOBS-HC ring networks, an HC grouping and wavelength assignment scheme, called Longest Path Matching and Graph Coloring (LPMGC), is proposed. LPMGC consists of two phases: grouping and wavelength assignment. First, a heuristic algorithm, named Longest Path Matching (LPM), is proposed to group the HCs according to the longest common path matching between HCs and to make each group as large as possible. And then, Graph Coloring (GC) is introduced to assign wavelengths for HC groups. The numerical results show that the proposed scheme performances better than Complementary HC Assignment (CHA) and some other heuristics in both unidirectional and bidirectional LOBS-HC ring networks in terms of wavelength utilization.

  4. A tracked approach for automated NMR assignments in proteins (TATAPRO)

    Energy Technology Data Exchange (ETDEWEB)

    Atreya, H.S.; Sahu, S.C.; Chary, K.V.R.; Govil, Girjesh [Tata Institute of Fundamental Research, Department of Chemical Sciences (India)


    A novel automated approach for the sequence specific NMR assignments of {sup 1}H{sup N}, {sup 13}C{sup {alpha}}, {sup 13}C{sup {beta}}, {sup 13}C'/{sup 1}H{sup {alpha}} and {sup 15}N spins in proteins, using triple resonance experimental data, is presented. The algorithm, TATAPRO (Tracked AuTomated Assignments in Proteins) utilizes the protein primary sequence and peak lists from a set of triple resonance spectra which correlate {sup 1}H{sup N} and {sup 15}N chemical shifts with those of {sup 13}C{sup {alpha}}, {sup 13}C{sup {beta}} and {sup 13}C'/{sup 1}H{sup {alpha}}. The information derived from such correlations is used to create a 'master{sub l}ist' consisting of all possible sets of {sup 1}H{sup N}{sub i}, {sup 15}N{sub i}, {sup 13}C{sup {alpha}}{sub i}, {sup 13}C{sup {beta}}{sub i}, {sup 13}C'{sub i}/{sup 1}H{sup {alpha}}{sub i}, {sup 13}C{sup {alpha}}{sub i-1}, {sup 13}C{sup {beta}}{sub i-1} and {sup 13}C'{sub i-1}/ {sup 1}H{sup {alpha}}{sub i-1} chemical shifts. On the basis of an extensive statistical analysis of {sup 13}C{sup {alpha}} and {sup 13}C{sup {beta}} chemical shift data of proteins derived from the BioMagResBank (BMRB), it is shown that the 20 amino acid residues can be grouped into eight distinct categories, each of which is assigned a unique two-digit code. Such a code is used to tag individual sets of chemical shifts in the master{sub l}ist and also to translate the protein primary sequence into an array called pps{sub a}rray. The program then uses the master{sub l}ist to search for neighbouring partners of a given amino acid residue along the polypeptide chain and sequentially assigns a maximum possible stretch of residues on either side. While doing so, each assigned residue is tracked in an array called assig{sub a}rray, with the two-digit code assigned earlier. The assig{sub a}rray is then mapped onto the pps{sub a}rray for sequence specific resonance assignment. The program has been tested using

  5. Synchronized sweep algorithms for scalable scheduling constraints


    Letort, Arnaud; Carlsson, Mats; Beldiceanu, Nicolas


    This report introduces a family of synchronized sweep based filtering algorithms for handling scheduling problems involving resource and precedence constraints. The key idea is to filter all constraints of a scheduling problem in a synchronized way in order to scale better. In addition to normal filtering mode, the algorithms can run in greedy mode, in which case they perform a greedy assignment of start and end times. The filtering mode achieves a significant speed-up over ...

  6. Algorithms for worst-case tolerance optimization

    DEFF Research Database (Denmark)

    Schjær-Jacobsen, Hans; Madsen, Kaj


    New algorithms are presented for the solution of optimum tolerance assignment problems. The problems considered are defined mathematically as a worst-case problem (WCP), a fixed tolerance problem (FTP), and a variable tolerance problem (VTP). The basic optimization problem without tolerances...... is denoted the zero tolerance problem (ZTP). For solution of the WCP we suggest application of interval arithmetic and also alternative methods. For solution of the FTP an algorithm is suggested which is conceptually similar to algorithms previously developed by the authors for the ZTP. Finally, the VTP...... is solved by a double-iterative algorithm in which the inner iteration is performed by the FTP- algorithm. The application of the algorithm is demonstrated by means of relatively simple numerical examples. Basic properties, such as convergence properties, are displayed based on the examples....

  7. Reliability of exclusively NOESY-based automated resonance assignment and structure determination of proteins. (United States)

    Schmidt, Elena; Güntert, Peter


    Protein structure determination by NMR can in principle be speeded up both by reducing the measurement time on the NMR spectrometer and by a more efficient analysis of the spectra. Here we study the reliability of protein structure determination based on a single type of spectra, namely nuclear Overhauser effect spectroscopy (NOESY), using a fully automated procedure for the sequence-specific resonance assignment with the recently introduced FLYA algorithm, followed by combined automated NOE distance restraint assignment and structure calculation with CYANA. This NOESY-FLYA method was applied to eight proteins with 63-160 residues for which resonance assignments and solution structures had previously been determined by the Northeast Structural Genomics Consortium (NESG), and unrefined and refined NOESY data sets have been made available for the Critical Assessment of Automated Structure Determination of Proteins by NMR project. Using only peak lists from three-dimensional (13)C- or (15)N-resolved NOESY spectra as input, the FLYA algorithm yielded for the eight proteins 91-98 % correct backbone and side-chain assignments if manually refined peak lists are used, and 64-96 % correct assignments based on raw peak lists. Subsequent structure calculations with CYANA then produced structures with root-mean-square deviation (RMSD) values to the manually determined reference structures of 0.8-2.0 Å if refined peak lists are used. With raw peak lists, calculations for 4 proteins converged resulting in RMSDs to the reference structure of 0.8-2.8 Å, whereas no convergence was obtained for the four other proteins (two of which did already not converge with the correct manual resonance assignments given as input). These results show that, given high-quality experimental NOESY peak lists, the chemical shift assignments can be uncovered, without any recourse to traditional through-bond type assignment experiments, to an extent that is sufficient for calculating accurate three

  8. 48 CFR 208.7002 - Assignment authority. (United States)


    ... activities concerned. (b) Under the Integrated Materiel Management Program, assignments are made by the... Secretary of Defense (Logistics); (2) To GSA, through agreement with GSA, by the Deputy Under Secretary of Defense (Logistics); (3) Outside the contiguous United States, by the Unified Commanders; and (4) For...

  9. A Generalized Assignment Heuristic for Vehicle Routing (United States)


    operating costs included in objective (1) of (VRP). This kind of parametric analysis would be useful, for example, in evaluating vehicle acquisition decisions...of solution qcuality and runnina time for the five methods. In terms of solution cualit -i, the Fisher-Jaikumar generalized assignment method clearly

  10. Credit assignment during movement reinforcement learning. (United States)

    Dam, Gregory; Kording, Konrad; Wei, Kunlin


    We often need to learn how to move based on a single performance measure that reflects the overall success of our movements. However, movements have many properties, such as their trajectories, speeds and timing of end-points, thus the brain needs to decide which properties of movements should be improved; it needs to solve the credit assignment problem. Currently, little is known about how humans solve credit assignment problems in the context of reinforcement learning. Here we tested how human participants solve such problems during a trajectory-learning task. Without an explicitly-defined target movement, participants made hand reaches and received monetary rewards as feedback on a trial-by-trial basis. The curvature and direction of the attempted reach trajectories determined the monetary rewards received in a manner that can be manipulated experimentally. Based on the history of action-reward pairs, participants quickly solved the credit assignment problem and learned the implicit payoff function. A Bayesian credit-assignment model with built-in forgetting accurately predicts their trial-by-trial learning.

  11. Tabu search for target-radar assignment

    DEFF Research Database (Denmark)

    Hindsberger, Magnus; Vidal, Rene Victor Valqui


    In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued...

  12. 47 CFR 74.702 - Channel assignments. (United States)


    ... land mobile radio operations. (b) Changes in the TV Table of Allotments or Digital Television Table of..., AUXILIARY, SPECIAL BROADCAST AND OTHER PROGRAM DISTRIBUTIONAL SERVICES Low Power TV, TV Translator, and TV Booster Stations § 74.702 Channel assignments. (a) An applicant for a new low power TV or TV translator...

  13. Training the American Businessman for Foreign Assignment (United States)

    Harris, Philip R.; Harris, Dorothy L.


    Describes a program in cross cultural training for the American businessman about to go on foreign assignment which should increase employee effectiveness when serving outside one's own country or when working with minority groups within the United States." (Author/DR)

  14. Teachers' Grading Practices: Meaning and Values Assigned (United States)

    Sun, Youyi; Cheng, Liying


    This study explores the meaning Chinese secondary school English language teachers associate with the grades they assign to their students, and the value judgements they make in grading. A questionnaire was issued to 350 junior and senior school English language teachers in China. The questionnaire data were analysed both quantitatively and…

  15. Enhanced functional and structural domain assignments using ...

    Indian Academy of Sciences (India)

    The sequencing of the Mycobacterium tuberculosis (MTB) H37Rv genome has facilitated deeper insights into the biology of MTB, yet the functions of many MTB proteins are unknown. We have used sensitive profile-based search procedures to assign functional and structural domains to infer functions of gene products ...

  16. Teaching Historical Analysis through Creative Writing Assignments (United States)

    Peterson, Janine Larmon; Graham, Lea


    Incorporating creative writing exercises in history courses can heighten students' critical reading and analytical skills in an active learning model. We identify and define two types of possible assignments that use model texts as their locus: centripetal, which focuses on specific context and disciplinary terms, and centrifugal, which address…

  17. School Assignment, School Choice and Social Mobility (United States)

    Burgess, Simon; Briggs, Adam


    We estimate the chances of poor and non-poor children getting places in good schools, analysing the relationship between poverty, location and school assignment. Our dataset allows us to measure location and distance very precisely. The simple unconditional difference in probabilities of attending a good school is substantial. We run an analysis…

  18. 7 CFR 1437.104 - Assigned production. (United States)


    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Assigned production. 1437.104 Section 1437.104 Agriculture Regulations of the Department of Agriculture (Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS NONINSURED CROP DISASTER ASSISTANCE PROGRAM...

  19. income tax assignment under the ethiopian constitution

    African Journals Online (AJOL)


    Constitution from an income tax point of view. And finally, the article ends with some concluding remarks. 1. Theories of Fiscal Federalism In Income Tax Assignment. Few countries pursue the course of decentralization on grounds of its perceived economic efficiency or equity. Political, social, cultural or historical forces are.

  20. Politics, Internet Assignments, and Civic Knowledge. (United States)

    May, Vaughn


    Describes how one professor of American government fights the apathy and cynicism of college students toward politics by using the Internet to help students more fairly appraise the workings of the American political system. One assignment has students research and manage a particular public policy initiative through visits to Web sites…

  1. 47 CFR 74.602 - Frequency assignment. (United States)


    ... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO... 2450 and 2500 MHz are also shared with other communication services and exclusive channel assignments... Emerging Technologies licensee in accordance with § 74.690 or § 78.40. Licensees declining relocation may...

  2. Accounting for Sustainability: An Active Learning Assignment (United States)

    Gusc, Joanna; van Veen-Dirks, Paula


    Purpose: Sustainability is one of the newer topics in the accounting courses taught in university teaching programs. The active learning assignment as described in this paper was developed for use in an accounting course in an undergraduate program. The aim was to enhance teaching about sustainability within such a course. The purpose of this…

  3. Incentivized optimal advert assignment via utility decomposition

    NARCIS (Netherlands)

    Kelly, F.; Key, P.; Walton, N.


    We consider a large-scale Ad-auction where adverts are assigned over a potentially infinite number of searches. We capture the intrinsic asymmetries in information between advertisers, the advert platform and the space of searches: advertisers know and can optimize the average performance of their

  4. Semi-infinite assignment and transportation games

    NARCIS (Netherlands)

    Timmer, Judith B.; Sánchez-Soriano, Joaqu´ın; Llorca, Navidad; Tijs, Stef; Goberna, Miguel A.; López, Marco A.


    Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An

  5. Democratization of Learning through Thematic Assignment (United States)

    Medellu, Christophil S.; Lumingkewas, S.; Walangitan, J. F.


    This article describes the results of research on learning democratization in Sangihe. This study is the first year of a five-year plan. Long-term goal of this research is to create the democratic science learning in schools. Democratic learning model was developed through thematic assignment, involving the participation of parents and…

  6. On Online Assignments in a Calculus Class (United States)

    Jungic, Veselin; Kent, Deborah; Menz, Petra


    In this paper, we describe our experience with the creation and utilization of online assignments for several calculus classes at Simon Fraser University (SFU). We present our findings regarding available software by considering the needs and perspectives of the instructors, students, and administrators. We provide a list of questions that guide…

  7. On the expected number of assignments in reduced matrices for the linear assignment problem

    NARCIS (Netherlands)

    Nawijn, W.M.; Dorhout, B.


    A linear n × n assignment problem is considered for which the elements of the cost matrix are sampled from a continuous probability distribution. Based on the zero entries of the reduced matrix the expectation of the maximum number of initial assignments is determined for general n, as well as an

  8. Parallel algorithms

    CERN Document Server

    Casanova, Henri; Robert, Yves


    ""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi

  9. Rule-based support system for multiple UMLS semantic type assignments. (United States)

    Geller, James; He, Zhe; Perl, Yehoshua; Morrey, C Paul; Xu, Julia


    When new concepts are inserted into the UMLS, they are assigned one or several semantic types from the UMLS Semantic Network by the UMLS editors. However, not every combination of semantic types is permissible. It was observed that many concepts with rare combinations of semantic types have erroneous semantic type assignments or prohibited combinations of semantic types. The correction of such errors is resource-intensive. We design a computational system to inform UMLS editors as to whether a specific combination of two, three, four, or five semantic types is permissible or prohibited or questionable. We identify a set of inclusion and exclusion instructions in the UMLS Semantic Network documentation and derive corresponding rule-categories as well as rule-categories from the UMLS concept content. We then design an algorithm adviseEditor based on these rule-categories. The algorithm specifies rules for an editor how to proceed when considering a tuple (pair, triple, quadruple, quintuple) of semantic types to be assigned to a concept. Eight rule-categories were identified. A Web-based system was developed to implement the adviseEditor algorithm, which returns for an input combination of semantic types whether it is permitted, prohibited or (in a few cases) requires more research. The numbers of semantic type pairs assigned to each rule-category are reported. Interesting examples for each rule-category are illustrated. Cases of semantic type assignments that contradict rules are listed, including recently introduced ones. The adviseEditor system implements explicit and implicit knowledge available in the UMLS in a system that informs UMLS editors about the permissibility of a desired combination of semantic types. Using adviseEditor might help accelerate the work of the UMLS editors and prevent erroneous semantic type assignments. Copyright © 2012 Elsevier Inc. All rights reserved.

  10. 75 FR 55352 - Delegation of Authorities and Assignment of Responsibilities (United States)


    ... of the Secretary Delegation of Authorities and Assignment of Responsibilities Secretary's Order 5-2010 Subject: Delegation of Authorities and Assignment of Responsibilities to the Administrator, Wage and Hour Division. 1. Purpose. To delegate authorities and assign responsibilities to the...

  11. Salience Assignment for Multiple-Instance Regression (United States)

    Wagstaff, Kiri L.; Lane, Terran


    We present a Multiple-Instance Learning (MIL) algorithm for determining the salience of each item in each bag with respect to the bag's real-valued label. We use an alternating-projections constrained optimization approach to simultaneously learn a regression model and estimate all salience values. We evaluate this algorithm on a significant real-world problem, crop yield modeling, and demonstrate that it provides more extensive, intuitive, and stable salience models than Primary-Instance Regression, which selects a single relevant item from each bag.

  12. Assigning cause for sudden unexpected infant death. (United States)

    Hunt, Carl E; Darnall, Robert A; McEntire, Betty L; Hyma, Bruce A


    We have reached a conundrum in assigning cause of death for sudden unexpected infant deaths. We summarize the discordant perspectives and approaches and how they have occurred, and recommend a pathway toward improved consistency. This lack of consistency affects pediatricians and other health care professionals, scientific investigators, medical examiners and coroners, law enforcement agencies, families, and support or advocacy groups. We recommend that an interdisciplinary international committee be organized to review current approaches for assigning cause of death, and to identify a consensus strategy for improving consistency. This effort will need to encompass intrinsic risk factors or infant vulnerability in addition to known environmental risk factors including unsafe sleep settings, and must be sufficiently flexible to accommodate a progressively expanding knowledge base.

  13. Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using Branch and Bound Approach (United States)

    Shuthairah Syed-Abdullah, Sharifah; Abdul-Rahman, Syariza; Mauziah Benjamin, Aida; Wibowo, Antoni; Ku-Mahamud, Ku-Ruhana


    Quadratic Assignment Problem (QAP) has been a very popular problem to be solved among researchers due to its practical applications. Several variants of QAP have been proposed by researchers in the past in order to reflect the real situations of QAP. One of the real problems of QAP is related with facilities which are required to be assigned to certain locations due to its function. In solving this problem, a fixed assignment has to be made thus allowing for the complexity of the problem to be reduced. Hence, this study introduces Quadratic Assignment Problem with Fixed Assignment (QAPFA) with the objective to minimize the assignment cost between the facility and location. This assignment takes into account the flow and distance between facility and location. QAPFA represents the real-world situation of the problem especially in dealing with specific requirement of some facilities to specific locations. Dataset of QAPFA is introduced and is solved using branch and bound approach. As for validation, the results of QAPFA are compared with QAP in terms of objective function and running time. The computational results show that the solution quality of QAPFA is lower when compared with the QAP, while the running time for QAPFA is lower than the QAP. Since the complexity of the problem is reduced by fixing the assignment, thus there is possibility that QAPFA has lower quality than QAP due to the fixed assignment. Nevertheless, in terms of running time QAPFA is better than QAP. It can be concluded that this problem reflect the real problem and practical to be used.

  14. Gender Assignment in Danish, Swedish and Norwegian: A Comparison of the Status of Assignment Criteria

    Directory of Open Access Journals (Sweden)

    Marcin Kilarski


    Full Text Available The paper deals with gender assignment of English loanwords in Danish, Swedish and Norwegian. The following assignment criteria have been analysed: semantic (animate, mass, phonological (number of syllables, homonymy, and morphological (inflection, suffixation, deverbal monosyllables, compounds. Common gender in Danish and Swedish and masculine in Norwegian are overrepresented in comparison with the native lexicon. This is confirmed by discriminant function analysis, which shows that neuter nouns in the three languages and feminine nouns in Norwegian show fewer characteristic features. This analysis has also been used to measure the degree of regularity based on the postulated criteria: the percentage of correctly classified cases (from 67% in Swedish to 68% in Norwegian and 72% in Danish suggests only a partial regularity in gender assignment. The stronger pull of common or masculine gender is reflected in the contribution of selected assignment rules, particularly in the assignment of animates, where common or masculine nouns constitute 96% of assigned nouns. As regards phonological rules, monosyllables show a slightly better correlation with neuter gender, particularly in Danish. Homonymy is significant for nouns of both genders in Danish, while in Swedish and Norwegian nouns with a native neuter or feminine homonym are more likely to be assigned common or masculine gender. Likewise, most inflectional and derivational assignment rules contribute to the assignment of common or masculine genders, with the exception of zero plurals, Swedish n-plurals, suffixes such as -ment, -ery, deverbal monosyllables in Danish and Norwegian, and compounds whose base appears in the corpus with n. gender. Discriminant function analysis shows that plural inflection has the greatest discriminant power among the postulated criteria. Finally, it is suggested that these tendencies may indicate an ongoing expansion of common and masculine genders in the three

  15. Assignments, Details, and Transfers: Overseas Service (United States)


    contract will be served regardless of the prescribed tour length. This includes soldiers assigned to Technical Assistance Field Teams ( TAFTS ). r...PUERTO RICO (except as indicated) 36 24 2 Ponce (Ft Allen) and Isabela, Yauco, Cagus, Juana Diaz 36 18 Vieques Island NA 12 QATAR 24 12 40 AR 614–30...55AR 614–30 • 30 August 2001 TAADS The Army Authorization Document System TAFT Technical Assistance Field Team TAT turnaround time TDA table of

  16. Capacity constrained assignment in spatial databases

    DEFF Research Database (Denmark)

    U, Leong Hou; Yiu, Man Lung; Mouratidis, Kyriakos


    Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most...

  17. State assignment for asynchronous FSMs with the use of the incompatibility and complement graph (United States)

    Kulisz, Józef


    The paper presents an application of a novel concept of graph - the Incompatibility and Complement Graph - to state assignment for asynchronous FSMs. A specific feature of the graph is that it contains two kinds of edges: connecting mutually incompatible nodes, and connecting mutually complementing nodes. The graph can be useful in certain class of optimization problems, in which compatibility of bit patterns both in the true, and in the complemented form has to be analyzed. An example of such a problem is covering analysis in state assignment for asynchronous FSMs. The paper presents a simple example explaining the method. Appropriate algorithms for the graph building and coloring are also presented.

  18. Artificial intelligence applied to assigned merchandise location in retail sales systems

    Directory of Open Access Journals (Sweden)

    Cruz-Domínguez, O.


    Full Text Available This paper presents an option for improving the process of assigning storage locations for merchandise in a warehouse. A disadvantage of policies in the literature is that the merchandise is assigned allocation only according to the volume of sales and the rotation it presents. However, in some cases it is necessary to deal with other aspects such as family group membership, the physical characteristics of the products, and their sales pattern to design an integral policy. This paper presents an alternative to the afore- mentioned process using Flexsim®, artificial neural networks, and genetic algorithms.

  19. Students' Achievement and Homework Assignment Strategies. (United States)

    Fernández-Alonso, Rubén; Álvarez-Díaz, Marcos; Suárez-Álvarez, Javier; Muñiz, José


    The optimum time students should spend on homework has been widely researched although the results are far from unanimous. The main objective of this research is to analyze how homework assignment strategies in schools affect students' academic performance and the differences in students' time spent on homework. Participants were a representative sample of Spanish adolescents (N = 26,543) with a mean age of 14.4 (±0.75), 49.7% girls. A test battery was used to measure academic performance in four subjects: Spanish, Mathematics, Science, and Citizenship. A questionnaire allowed the measurement of the indicators used for the description of homework and control variables. Two three-level hierarchical-linear models (student, school, autonomous community) were produced for each subject being evaluated. The relationship between academic results and homework time is negative at the individual level but positive at school level. An increase in the amount of homework a school assigns is associated with an increase in the differences in student time spent on homework. An optimum amount of homework is proposed which schools should assign to maximize gains in achievement for students overall.

  20. Assignment and Correspondence Tracking System - Tactical / Operational Reporting (United States)

    Social Security Administration — Reporting data store for the Assignment and Correspondence Tracking System (ACT). ACT automates the assignment and tracking of correspondence processing within the...

  1. Numerical pole assignment by eigenvalue Jacobian inversion (United States)

    Sevaston, George E.


    A numerical procedure for solving the linear pole placement problem is developed which operates by the inversion of an analytically determined eigenvalue Jacobian matrix. Attention is given to convergence characteristics and pathological situations. It is not concluded that the algorithm developed is suitable for computer-aided control system design with particular reference to the scan platform pointing control system for the Galileo spacecraft.

  2. Detailed algorithmic description of a processor: a recipe for ...

    African Journals Online (AJOL)

    The method used included algorithmic translation of instructions using a stack machine. The algorithm interpreted the instructions sequentially. The method of stack technology was adopted, where instructions load literals, fetch variables onto the stack, and a store instruction corresponds to the assignment statements.

  3. An automated framework for NMR resonance assignment through simultaneous slice picking and spin system forming. (United States)

    Abbas, Ahmed; Guo, Xianrong; Jing, Bing-Yi; Gao, Xin


    Despite significant advances in automated nuclear magnetic resonance-based protein structure determination, the high numbers of false positives and false negatives among the peaks selected by fully automated methods remain a problem. These false positives and negatives impair the performance of resonance assignment methods. One of the main reasons for this problem is that the computational research community often considers peak picking and resonance assignment to be two separate problems, whereas spectroscopists use expert knowledge to pick peaks and assign their resonances at the same time. We propose a novel framework that simultaneously conducts slice picking and spin system forming, an essential step in resonance assignment. Our framework then employs a genetic algorithm, directed by both connectivity information and amino acid typing information from the spin systems, to assign the spin systems to residues. The inputs to our framework can be as few as two commonly used spectra, i.e., CBCA(CO)NH and HNCACB. Different from the existing peak picking and resonance assignment methods that treat peaks as the units, our method is based on 'slices', which are one-dimensional vectors in three-dimensional spectra that correspond to certain ([Formula: see text]) values. Experimental results on both benchmark simulated data sets and four real protein data sets demonstrate that our method significantly outperforms the state-of-the-art methods while using a less number of spectra than those methods. Our method is freely available at

  4. Algorithmic chemistry

    Energy Technology Data Exchange (ETDEWEB)

    Fontana, W.


    In this paper complex adaptive systems are defined by a self- referential loop in which objects encode functions that act back on these objects. A model for this loop is presented. It uses a simple recursive formal language, derived from the lambda-calculus, to provide a semantics that maps character strings into functions that manipulate symbols on strings. The interaction between two functions, or algorithms, is defined naturally within the language through function composition, and results in the production of a new function. An iterated map acting on sets of functions and a corresponding graph representation are defined. Their properties are useful to discuss the behavior of a fixed size ensemble of randomly interacting functions. This function gas'', or Turning gas'', is studied under various conditions, and evolves cooperative interaction patterns of considerable intricacy. These patterns adapt under the influence of perturbations consisting in the addition of new random functions to the system. Different organizations emerge depending on the availability of self-replicators.

  5. Structural Encoding of Static Single Assignment Form

    DEFF Research Database (Denmark)

    Gal, Andreas; Probst, Christian; Franz, Michael


    Static Single Assignment (SSA) form is often used as an intermediate representation during code optimization in Java Virtual Machines. Recently, SSA has successfully been used for bytecode verification. However, constructing SSA at the code consumer is costly. SSAbased mobile code transport formats...... have been shown to eliminate this cost by shifting SSA creation to the code producer. These new formats, however, are not backward compatible with the established Java class-file format. We propose a novel approach to transport SSA information implicitly through structural code properties of standard...

  6. Characteristic ratio assignment in fractional order systems. (United States)

    Tabatabaei, Mohammad; Haeri, Mohammad


    In this paper the characteristic ratios and generalized time constant are defined for all-pole commensurate fractional order systems. The sufficient condition for stability of these systems in terms of their characteristic ratios is obtained. Also an analytical approach for characteristic ratio assignment (CRA) to have a non-overshooting fast closed loop step response is introduced. The proposed CRA method is then employed to design a fractional order controller. Computer simulation results are presented to illustrate the performance of the CRA based designed fractional order controllers. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

  7. Automated probabilistic method for assigning backbone resonances of (13C,15N)-labeled proteins

    Energy Technology Data Exchange (ETDEWEB)

    Lukin, Jonathan A. [Carnegie Mellon University, Department of Biological Sciences (United States); Gove, Andrew P.; Talukdar, Sarosh N. [Carnegie Mellon University, Robotics Institute (United States); Ho Chien [Carnegie Mellon University, Department of Biological Sciences (United States)


    We present a computer algorithm for the automated assignment of polypeptide backbone and 13C{beta} resonances of a protein of known primary sequence. Input to the algorithm consists of cross peaks from several 3D NMR experiments: HNCA, HN(CA)CO, HN(CA)HA,HNCACB, COCAH, HCA(CO)N, HNCO, HN(CO)CA, HN(COCA)HA, and CBCA(CO)NH. Data from these experiments performed on glutamine-binding protein are analyzed statistically using Bayes' theorem to yield objective probability scoring functions for matching chemical shifts. Such scoring is used in the first stage of the algorithm to combine cross peaks from the first five experiments to form intraresidue segments of chemical shifts{l_brace}Ni,HiN,Ci{alpha},Ci{beta},C'i{r_brace}, while the latter five are combined into interresidue segments {l_brace}Ci{alpha},Ci{beta},C'i,Ni+1,HNi+1{r_brace}. Given a tentative assignment of segments,the second stage of the procedure calculates probability scores based on the likelihood of matching the chemical shifts of each segment with (i) overlapping segments; and (ii) chemical shift distributions of the underlying amino acid type (and secondary structure, if known). This joint probability is maximized by rearranging segments using a simulated annealing program,optimized for efficiency. The automated assignment program was tested using CBCANH and CBCA(CO)NH cross peaks of the two previously assigned proteins, calmodulin and CheA.The agreement between the results of our method and the published assignments was excellent. Our algorithm was also applied to the observed cross peaks of glutamine-binding protein of Escherichia coli, yielding an assignment in excellent agreement with that obtained by time-consuming, manual methods. The chemical shift assignment procedure described here should be most useful for NMR studies of large proteins, which are now feasible with the use of pulsed-field gradients and random partial deuteration of samples.

  8. An Airway Network Flow Assignment Approach Based on an Efficient Multiobjective Optimization Framework

    Directory of Open Access Journals (Sweden)

    Xiangmin Guan


    Full Text Available Considering reducing the airspace congestion and the flight delay simultaneously, this paper formulates the airway network flow assignment (ANFA problem as a multiobjective optimization model and presents a new multiobjective optimization framework to solve it. Firstly, an effective multi-island parallel evolution algorithm with multiple evolution populations is employed to improve the optimization capability. Secondly, the nondominated sorting genetic algorithm II is applied for each population. In addition, a cooperative coevolution algorithm is adapted to divide the ANFA problem into several low-dimensional biobjective optimization problems which are easier to deal with. Finally, in order to maintain the diversity of solutions and to avoid prematurity, a dynamic adjustment operator based on solution congestion degree is specifically designed for the ANFA problem. Simulation results using the real traffic data from China air route network and daily flight plans demonstrate that the proposed approach can improve the solution quality effectively, showing superiority to the existing approaches such as the multiobjective genetic algorithm, the well-known multiobjective evolutionary algorithm based on decomposition, and a cooperative coevolution multiobjective algorithm as well as other parallel evolution algorithms with different migration topology.

  9. Waste-aware fluid volume assignment for flow-based microfluidic biochips

    DEFF Research Database (Denmark)

    Schneider, Alexander Rüdiger; Pop, Paul; Madsen, Jan


    Microfluidic biochips are replacing the conventional biochemical analysers integrating the necessary functions onchip. We are interested in Flow-Based Microfluidic Biochips (FBMB), where a continuous flow of liquid is manipulated using integrated microvalves. Using microvalves and channels, more ...... is able to minimize the fluid consumption through optimal fluid assignment and reuse of fluid waste. Due to the algorithm's low complexity, fluid requirements can also be calculated during runtime for error recovery or statically unknown cases....

  10. Estimating The Makespan of The Two-Valued Restricted Assignment Problem


    Jansen, Klaus; Land, Kati; Maack, Marten


    We consider a special case of the scheduling problem on unrelated machines, namely the Restricted Assignment Problem with two different processing times. We show that the configuration LP has an integrality gap of at most 5/3 ~ 1.667 for this problem. This allows us to estimate the optimal makespan within a factor of 5/3, improving upon the previously best known estimation algorithm with ratio 11/6 ~ 1.833 due to Chakrabarty, Khanna, and Li.

  11. Optimization of demand assigned SCPC satellite networks (United States)

    Laborde, E.


    This paper investigates various system aspects and price tradeoffs involved in providing cost-effective Demand Assignment (DA) satellite channel service. Those network characteristics which significantly affect the ultimate cost-based decision are discussed. The number of stations participating in the DA or PA system, the number of satellite channels, and the traffic are kept parametric within expected limits, covering most of the present and future applications. In particular, the interrelationships between the network requirements (e.g., grade of service) and network elements, and the impacts of different blocking assignment allocations on the number of modems in the network is examined. A cost model is then derived that allows the evaluation and comparison of both DA and PA networks. Absolute and differential costing of PA and DA networks is permitted using economic quantities available to the system planner. These include modem cost, satellite channel cost, network size, and defined efficiency factors. Based on the differential cost comparisons for several DA and PA network strategies, tradeoffs have been derived to aid the system designer in configuring the most cost-effective DA network.

  12. Probabilistic Identification of Spin Systems and their Assignments including Coil-Helix Inference as Output (PISTACHIO)

    Energy Technology Data Exchange (ETDEWEB)

    Eghbalnia, Hamid R., E-mail:; Bahrami, Arash; Wang, Liya [National Magnetic Resonance Facility at Madison, Biochemistry Department (United States); Assadi, Amir [University of Wisconsin-Madison, Mathematics Department (United States); Markley, John L. [National Magnetic Resonance Facility at Madison, Biochemistry Department (United States)


    We present a novel automated strategy (PISTACHIO) for the probabilistic assignment of backbone and sidechain chemical shifts in proteins. The algorithm uses peak lists derived from various NMR experiments as input and provides as output ranked lists of assignments for all signals recognized in the input data as constituting spin systems. PISTACHIO was evaluated by comparing its performance with raw peak-picked data from 15 proteins ranging from 54 to 300 residues; the results were compared with those achieved by experts analyzing the same datasets by hand. As scored against the best available independent assignments for these proteins, the first-ranked PISTACHIO assignments were 80-100% correct for backbone signals and 75-95% correct for sidechain signals. The independent assignments benefited, in a number of cases, from structural data (e.g. from NOESY spectra) that were unavailable to PISTACHIO. Any number of datasets in any combination can serve as input. Thus PISTACHIO can be used as datasets are collected to ascertain the current extent of secure assignments, to identify residues with low assignment probability, and to suggest the types of additional data needed to remove ambiguities. The current implementation of PISTACHIO, which is available from a server on the Internet, supports input data from 15 standard double- and triple-resonance experiments. The software can readily accommodate additional types of experiments, including data from selectively labeled samples. The assignment probabilities can be carried forward and refined in subsequent steps leading to a structure. The performance of PISTACHIO showed no direct dependence on protein size, but correlated instead with data quality (completeness and signal-to-noise). PISTACHIO represents one component of a comprehensive probabilistic approach we are developing for the collection and analysis of protein NMR data.

  13. FLAMEnGO: a fuzzy logic approach for methyl group assignment using NOESY and paramagnetic relaxation enhancement data. (United States)

    Chao, Fa-An; Shi, Lei; Masterson, Larry R; Veglia, Gianluigi


    Building on a recent method by Matthews and co-workers [1], we developed a new and efficient algorithm to assign methyl resonances from sparse and ambiguous NMR data. The new algorithm (FLAMEnGO: Fuzzy Logic Assignment of MEthyl GrOups) uses Monte Carlo sampling in conjunction with fuzzy logic to obtain the assignment of methyl resonances at high fidelity. Furthermore, we demonstrate that the inclusion of paramagnetic relaxation enhancement (PRE) data in the assignment strategy increases the percentage of correct assignments with sparse NOE data. Using synthetic tests and experimental data we show that this new approach provides up to ∼80% correct assignments with only 30% of methyl-methyl NOE data. In the experimental case of ubiquitin, PRE data from two spin labeled sites improve the percentage of assigned methyl groups up to ∼91%. This new strategy promises to further expand methyl group NMR spectroscopy to very large macromolecular systems. Copyright © 2011 Elsevier Inc. All rights reserved.

  14. Research on bulk-cargo-port berth assignment based on priority of resource allocation

    Directory of Open Access Journals (Sweden)

    Chunfang Guo


    Full Text Available Purpose: The purpose of this paper is to propose a Priority of Resource Allocation model about how to utilize the resources of the port efficiently, through the improvement of traditional ant colony algorithm, the ship-berth matching relation constraint matrix formed by ontology reasoning. Design/methodology/approach: Through questionnaires?Explore factor analysis (EFA and principal component analysis, the authors extract the importance of the goods, the importance of customers, and type of trade as the main factors of the ship operating priority. Then the authors combine berth assignment problem with the improved ant colony algorithm, and use the model to improve ship scheduling quality. Finally, the authors verify the model with physical data in a bulk-cargo-port in China. Findings: Test by the real data of bulk cargo port, it show that ships’ resource using priority and the length of waiting time are consistent; it indicates that the priority of resource allocation play a prominent role in improving ship scheduling quality. Research limitations: The questionnaires is limited in only one port group, more  related Influence factors should be considered to extend the conclusion. Practical implications: The Priority of Resource Allocation model in this paper can be used to improve the efficiency of the dynamic berth assignment. Originality: This paper makes the time of ship in port minimized as the optimization of key indicators and establishes a dynamic berth assignment model based on improved ant colony algorithm and the ontology reasoning model.

  15. Optimization Algorithms for New Computer Architectures with Applications to Personnel Assignment Models (United States)


    Sequent Symmetry S81 using a single Intel 80386 cpu . The computational experience is presented in Table 1. Each data point in Table 1 is the sum for... 80386 cpu’s. For this study, both codes used only integer arithmetic and did not make use of math co-processors. The empirical analysis with the parallel...arcs were solved in from three to four minutes using a single cpu and in less than two minutes using eight cpu’s. ACKNOWLEDGMENT This research was

  16. Context-Aware Task Assignment in Ubiquitous Computing Environment - A Genetic Algorithm Based Approach

    NARCIS (Netherlands)

    Pawar, P.; Mei, H.; Widya, I.A.; van Beijnum, Bernhard J.F.; van Halteren, Aart


    With the advent of ubiquitous computing, a user is surrounded by a variety of devices including tiny sensor nodes, handheld mobile devices and powerful computers as well as diverse communication networks. In this networked society, the role of a human being is evolving from the data consumer to the

  17. Development of multi-class, multi-criteria bicycle traffic assignment models and solution algorithms (United States)


    Cycling is gaining popularity both as a mode of travel in urban communities and as an alternative mode to private motorized vehicles due to its wide range of benefits (health, environmental, and economical). However, this change in modal share is not...

  18. A*-Based Task Assignment Algorithm for Context-Aware Mobile Patient Monitoring Systems

    NARCIS (Netherlands)

    Mei, H.; van Beijnum, Bernhard J.F.; Pawar, P.; Widya, I.A.; Hermens, Hermanus J.


    Mobile Patient Monitoring System (MPMS) is positioned to provide high quality healthcare services in the near future. The gap between its application demands and resource supplies, however, still remains and may hinder this process. Dynamic context-aware adaptation mechanisms are required in order

  19. A Linear Quadratic Regulator Weight Selection Algorithm for Robust Pole Assignment (United States)


    in figure 39 are for n/ax, where n is the load factor [23:538-540]. Roskam [23] gives an approximation to n/a as n -Z _ -- •(102) where Z,, Z,,u. With...Ohio, August 1969 (AD 860856). 3 23. Roskam , Jan. Airplane Flight Dynamics and Automatic Flight Controls. Kansas: Roskam Aviation and Engineering

  20. Rationalization of some genetic anticodonic assignments (United States)

    Lacey, J. C., Jr.; Hall, L. M.; Mullins, D. W., Jr.


    The hydrophobicity of most amino acids correlates well with that of their anticodon nucleotides, with Trp, Tyr, Ile, and Ser being the exceptions to this rule. Using previous data on hydrophobicity and binding constants, and new data on rates of esterification of polyadenylic acid with several N-acetylaminoacyl imidazolides, several of the anticodon assignments are rationalized. Chemical reasons are shown supporting the idea of the inclusion of the Ile in the catalog of biological amino acids late in the evolution, through a mutation of the existing tRNA and its aminoacyl-tRNA-synthetase. It was found that an addition of hexane increases the incorporation of hydrophobic Ac-Phe into poly-A, in support of the Fox (1965) and Oparin (1965) emphasis on the biogenetic importance of phase-separated systems.


    Energy Technology Data Exchange (ETDEWEB)

    Sternberg, Virginia


    You have heard about issues surrounding indexing and retrieval of nuclear records and automation and micrographics of these records. Now we are going to get each of you involved in indexing and assigning keywords. The first part of this hands-on workshop will be a very basic, elementary step-by-step introduction, concentrating on how to assign keywords. It is a workshop for beginners, People who have never done it before. It is planned to demonstrate what an analyst has to do to index and assign keywords to a document. Then I will take some pages of a report and demonstrate how I choose keywords for it. Then each of you will have a chance to do the same thing with similar pages from another report. Then we will discuss the variations ln the keywords you individually assigned. There are many systems that can be used. In this particular workshop we will cover only a system of building your own keyword listing as you index your documents. We will be discussing keywords or descriptors or subject words, but first I want to point out a few other critical points about indexing. When developing an indexing project the most important thing to do first lS decide what elements you want to retrieve by. Whether you go into a large computer retrieval system or a small three-by-five card system, you have to decide in advance what you want to retrieve. Then you can go on from there. If you only need to search by equipment number or by purchase order or by contract number, then you can use a very simple retrieval system. But if you want to be able to retrieve a record by any combination of elements, then you have to consistently input these into your system. For example, if you want to be able to ask for the drawings of the piping in the secondary cooling system, level 3, manufactured by a certain vendor, then you must have put the information into the index by a retrieval file point, in advance. I want to stress that the time spent in deciding what has to be retrievable is never

  2. Diagnosis code assignment: models and evaluation metrics. (United States)

    Perotte, Adler; Pivovarov, Rimma; Natarajan, Karthik; Weiskopf, Nicole; Wood, Frank; Elhadad, Noémie


    The volume of healthcare data is growing rapidly with the adoption of health information technology. We focus on automated ICD9 code assignment from discharge summary content and methods for evaluating such assignments. We study ICD9 diagnosis codes and discharge summaries from the publicly available Multiparameter Intelligent Monitoring in Intensive Care II (MIMIC II) repository. We experiment with two coding approaches: one that treats each ICD9 code independently of each other (flat classifier), and one that leverages the hierarchical nature of ICD9 codes into its modeling (hierarchy-based classifier). We propose novel evaluation metrics, which reflect the distances among gold-standard and predicted codes and their locations in the ICD9 tree. Experimental setup, code for modeling, and evaluation scripts are made available to the research community. The hierarchy-based classifier outperforms the flat classifier with F-measures of 39.5% and 27.6%, respectively, when trained on 20,533 documents and tested on 2282 documents. While recall is improved at the expense of precision, our novel evaluation metrics show a more refined assessment: for instance, the hierarchy-based classifier identifies the correct sub-tree of gold-standard codes more often than the flat classifier. Error analysis reveals that gold-standard codes are not perfect, and as such the recall and precision are likely underestimated. Hierarchy-based classification yields better ICD9 coding than flat classification for MIMIC patients. Automated ICD9 coding is an example of a task for which data and tools can be shared and for which the research community can work together to build on shared models and advance the state of the art.

  3. Methods of using the quadratic assignment problem solution

    Directory of Open Access Journals (Sweden)

    Izabela Kudelska


    Full Text Available Background: Quadratic assignment problem (QAP is one of the most interesting of combinatorial optimization. Was presented by Koopman and Beckamanna in 1957, as a mathematical model of the location of indivisible tasks. This problem belongs to the class NP-hard issues. This forces the application to the solution already approximate methods for tasks with a small size (over 30. Even though it is much harder than other combinatorial optimization problems, it enjoys wide interest because it models the important class of decision problems. Material and methods: The discussion was an artificial intelligence tool that allowed to solve the problem QAP, among others are: genetic algorithms, Tabu Search, Branch and Bound. Results and conclusions: QAP did not arise directly as a model for certain actions, but he found its application in many areas. Examples of applications of the problem is: arrangement of buildings on the campus of the university, layout design of electronic components in systems with large scale integration (VLSI, design a hospital, arrangement of keys on the keyboard.

  4. Algorithm Theory - SWAT 2006

    DEFF Research Database (Denmark)

    issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, etc.......This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The 36 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 154 submissions. The papers address all...

  5. Fast automated protein NMR data collection and assignment by ADAPT-NMR on Bruker spectrometers (United States)

    Lee, Woonghee; Hu, Kaifeng; Tonelli, Marco; Bahrami, Arash; Neuhardt, Elizabeth; Glass, Karen C.; Markley, John L.


    ADAPT-NMR (Assignment-directed Data collection Algorithm utilizing a Probabilistic Toolkit in NMR) supports automated NMR data collection and backbone and side chain assignment for [U-13C, U-15N]-labeled proteins. Given the sequence of the protein and data for the orthogonal 2D 1H-15N and 1H-13C planes, the algorithm automatically directs the collection of tilted plane data from a variety of triple-resonance experiments so as to follow an efficient pathway toward the probabilistic assignment of 1H, 13C, and 15N signals to specific atoms in the covalent structure of the protein. Data collection and assignment calculations continue until the addition of new data no longer improves the assignment score. ADAPT-NMR was first implemented on Varian (Agilent) spectrometers [A. Bahrami, M. Tonelli, S.C. Sahu, K.K. Singarapu, H.R. Eghbalnia, J.L. Markley, PLoS One 7 (2012) e33173]. Because of broader interest in the approach, we present here a version of ADAPT-NMR for Bruker spectrometers. We have developed two AU console programs (ADAPT_ORTHO_run and ADAPT_NMR_run) that run under TOPSPIN Versions 3.0 and higher. To illustrate the performance of the algorithm on a Bruker spectrometer, we tested one protein, chlorella ubiquitin (76 amino acid residues), that had been used with the Varian version: the Bruker and Varian versions achieved the same level of assignment completeness (98% in 20 h). As a more rigorous evaluation of the Bruker version, we tested a larger protein, BRPF1 bromodomain (114 amino acid residues), which yielded an automated assignment completeness of 86% in 55 h. Both experiments were carried out on a 500 MHz Bruker AVANCE III spectrometer equipped with a z-gradient 5 mm TCI probe. ADAPT-NMR is available at in the form of pulse programs, the two AU programs, and instructions for installation and use.

  6. Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable

    Directory of Open Access Journals (Sweden)

    Ling Hong


    Full Text Available Assigning passenger flows on a metro network plays an important role in passenger flow analysis that is the foundation of metro operation. Traditional transit assignment models are becoming increasingly complex and inefficient. These models may even not be valid in case of sudden changes in the timetable or disruptions in the metro system. We propose a methodology for assigning passenger flows on a metro network based on automatic fare collection (AFC data and realized timetable. We find that the routes connecting a given origin and destination (O-D pair are related to their observed travel times (OTTs especially their pure travel times (PTTs abstracted from AFC data combined with the realized timetable. A novel clustering algorithm is used to cluster trips between a given O-D pair based on PTTs/OTTs and complete the assignment. An initial application to categorical O-D pairs on the Shanghai metro system, which is one of the largest systems in the world, shows that the proposed methodology works well. Accompanying the initial application, an interesting approach is also provided for determining the theoretical maximum accuracy of the new assignment model.

  7. A Broadcast Channel Assignment Mechanism based on The Broadcast Tree for Multi-radio Multi-channel Wireless Mesh Networks (United States)

    Xia, Yan; Zeng, Yingzhi


    This paper proposed a broadcast Channel Assignment Mechanism on base of optimized Broadcast Tree for wireless Mesh network (WMN), which is created by Branch and Bound Method. The simulations show that our algorithm not only reduces the broadcast redundancy but also avoids the potential channel interferences produced by unnecessary relay nodes.

  8. On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations

    NARCIS (Netherlands)

    Ashayeri, J.; Heuts, R.M.J.; Beekhof, M.; Wilhelm, M.R.


    This paper presents the use and extension of a geometrical-based algorithmic approach for determining the expected S/R machine cycle times, and therefore warehouse throughput, for class-based storage assignment layouts in an AS/RS.The approach was designed for the purpose of solving a practical

  9. An addendum on sensitivity analysis of the optimal assignment

    NARCIS (Netherlands)

    Volgenant, A.


    We point out that sensitivity results for the linear assignment problem can be produced by a shortest path based approach in a straightforward manner and as efficient as finding an optimal solution. Keywords: Assignment; Sensitivity analysis

  10. Efficient Mechanisms to Allocate Assignment Incentives in the Navy

    National Research Council Canada - National Science Library

    Nimon, R. W; Hall, Ricky D; Zaki, Hossam


    .... All assignments, however, may not necessarily be voluntary. These assignments (jobs) have been labeled as "hard to fill" by Navy leadership, and the Navy has implemented market-based, cash stipends to attract Sailors to these jobs...

  11. 46 CFR 67.237 - Requirements for assignments of mortgages. (United States)


    ... 46 Shipping 2 2010-10-01 2010-10-01 false Requirements for assignments of mortgages. 67.237... MEASUREMENT OF VESSELS DOCUMENTATION OF VESSELS Filing and Recording of Instruments-Mortgages, Preferred Mortgages, and Related Instruments § 67.237 Requirements for assignments of mortgages. An assignment of...

  12. Solving the k-cardinality assignment problem by transformation

    NARCIS (Netherlands)

    Volgenant, A.


    The k-cardinality Linear Assignment Problem (k-LAP) with k a given integer is a generalization of the linear assignment problem: one wants to assign k rows (a free choice out of more rows) to k columns (a free choice out of more columns) minimizing the sum of the corresponding costs. For this

  13. Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments (United States)

    Cavdar, Gamze; Doe, Sue


    Traditional writing assignments often fall short in addressing problems in college students' writing as too often these assignments fail to help students develop critical thinking skills and comprehension of course content. This article reports the use of a two-part (staged) writing assignment with postscript as a strategy for improving critical…

  14. 75 FR 55354 - Delegation of Authority and Assignment of Responsibilities (United States)


    ... of the Secretary Delegation of Authority and Assignment of Responsibilities Secretary's Order 3-2010 Subject: Delegation of Authority and Assignment of Responsibilities to the Employee Benefits Security Administration. 1. Purpose. To delegate authority and assign responsibilities for the administration of the...

  15. The algorithm design manual

    CERN Document Server

    Skiena, Steven S


    Explaining designing algorithms, and analyzing their efficacy and efficiency, this book covers combinatorial algorithms technology, stressing design over analysis. It presents instruction on methods for designing and analyzing computer algorithms. It contains the catalog of algorithmic resources, implementations and a bibliography

  16. The Algorithmic Imaginary

    DEFF Research Database (Denmark)

    Bucher, Taina


    This article reflects the kinds of situations and spaces where people and algorithms meet. In what situations do people become aware of algorithms? How do they experience and make sense of these algorithms, given their often hidden and invisible nature? To what extent does an awareness....... Examining how algorithms make people feel, then, seems crucial if we want to understand their social power....

  17. Hamiltonian Algorithm Sound Synthesis


    大矢, 健一


    Hamiltonian Algorithm (HA) is an algorithm for searching solutions is optimization problems. This paper introduces a sound synthesis technique using Hamiltonian Algorithm and shows a simple example. "Hamiltonian Algorithm Sound Synthesis" uses phase transition effect in HA. Because of this transition effect, totally new waveforms are produced.

  18. The BR eigenvalue algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics


    The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.

  19. A Bayesian approach to simultaneously quantify assignments and linguistic uncertainty

    Energy Technology Data Exchange (ETDEWEB)

    Chavez, Gregory M [Los Alamos National Laboratory; Booker, Jane M [BOOKER SCIENTIFIC FREDERICKSBURG; Ross, Timothy J [UNM


    Subject matter expert assessments can include both assignment and linguistic uncertainty. This paper examines assessments containing linguistic uncertainty associated with a qualitative description of a specific state of interest and the assignment uncertainty associated with assigning a qualitative value to that state. A Bayesian approach is examined to simultaneously quantify both assignment and linguistic uncertainty in the posterior probability. The approach is applied to a simplified damage assessment model involving both assignment and linguistic uncertainty. The utility of the approach and the conditions under which the approach is feasible are examined and identified.

  20. Using Multi-Attribute Decision Factors for a Modified All-or-Nothing Traffic Assignment

    Directory of Open Access Journals (Sweden)

    EunSu Lee


    Full Text Available To elucidate a realistic traffic assignment scenario, a multi-criterion decision system is essential. A traffic assignment model designed to simulate real-life situation may therefore utilize absolute and/or relative impedance. Ideally, the decision-making process should identify a set of traffic impedances (factors working against the smooth flow of traffic along with pertinent parameters in order for the decision system to select the most optimal or the least-impeded route. In this study, we developed geospatial algorithms that consider multiple impedances. The impedances utilized in this study included, traffic patterns, capacity and congestion. The attributes of the decision-making process also prioritize multi-traffic scenarios by adopting first-in-first-out prioritization method. We also further subdivided classical impedance into either relative impedance or absolute impedance. The main advantage of this innovative multi-attribute, impedance-based trip assignment model is that it can be implemented in a manner of algebraic approach to utilize shortest path algorithm embedded in a Geographic Information Systems (GIS—Graphical User Interface tool. Thus, the GIS package can therefore handle the multi-attribute impedance effectively. Furthermore, the method utilized in this paper displays flexibility and better adaptation to a multi-modal transportation system. Transportation, logistics, and random events, such as terrorism, can be easily analyzed with pertinent impedance.

  1. On maximizing the lifetime of Wireless Sensor Networks by optimally assigning energy supplies. (United States)

    Asorey-Cacheda, Rafael; García-Sánchez, Antonio Javier; García-Sánchez, Felipe; García-Haro, Joan; González-Castano, Francisco Javier


    The extension of the network lifetime of Wireless Sensor Networks (WSN) is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes) carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes) are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment) to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively.

  2. On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

    Directory of Open Access Journals (Sweden)

    Francisco Javier González-Castano


    Full Text Available The extension of the network lifetime of Wireless Sensor Networks (WSN is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively.

  3. Algorithmically specialized parallel computers

    CERN Document Server

    Snyder, Lawrence; Gannon, Dennis B


    Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster

  4. Single machine scheduling and due date assignment with past-sequence-dependent setup time and position-dependent processing time. (United States)

    Zhao, Chuan-Li; Hsu, Chou-Jung; Hsu, Hua-Feng


    This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in O(n(4)) time. For the model with job-independent position effects, we proved that the problems can be solved in O(n(3)) time by providing a dynamic programming algorithm.

  5. Increasing Independent Seatwork: Breaking Large Assignments into Smaller Assignments and Teaching a Student with Retardation to Recruit Reinforcement (United States)

    Wallace, Monica A.; Cox, Elizabeth A.; Skinner, Christopher H.


    A withdrawal design was used to evaluate the effects of a multicomponent intervention on independent seatwork and student-teacher interactions in a student with mild mental retardation. During the intervention phase, long assignments were changed to multiple, briefer assignments. After completing each brief assignment, the student recruited social…

  6. An automated framework for NMR resonance assignment through simultaneous slice picking and spin system forming

    KAUST Repository

    Abbas, Ahmed


    Despite significant advances in automated nuclear magnetic resonance-based protein structure determination, the high numbers of false positives and false negatives among the peaks selected by fully automated methods remain a problem. These false positives and negatives impair the performance of resonance assignment methods. One of the main reasons for this problem is that the computational research community often considers peak picking and resonance assignment to be two separate problems, whereas spectroscopists use expert knowledge to pick peaks and assign their resonances at the same time. We propose a novel framework that simultaneously conducts slice picking and spin system forming, an essential step in resonance assignment. Our framework then employs a genetic algorithm, directed by both connectivity information and amino acid typing information from the spin systems, to assign the spin systems to residues. The inputs to our framework can be as few as two commonly used spectra, i.e., CBCA(CO)NH and HNCACB. Different from the existing peak picking and resonance assignment methods that treat peaks as the units, our method is based on \\'slices\\', which are one-dimensional vectors in three-dimensional spectra that correspond to certain (N, H) values. Experimental results on both benchmark simulated data sets and four real protein data sets demonstrate that our method significantly outperforms the state-of-the-art methods while using a less number of spectra than those methods. Our method is freely available at © 2014 Springer Science+Business Media.

  7. An algorithm for link restoration of wavelength routing optical networks

    DEFF Research Database (Denmark)

    Limal, Emmanuel; Stubkjær, Kristian


    We present an algorithm for restoration of single link failure in wavelength routing multihop optical networks. The algorithm is based on an innovative study of networks using graph theory. It has the following original features: it (i) assigns working and spare channels simultaneously, (ii) prev...... low complexity is studied in detail and compared to the complexity of a classical path assignment algorithm. Finally, we explain how to use the algorithm to control the restoration path lengths.......We present an algorithm for restoration of single link failure in wavelength routing multihop optical networks. The algorithm is based on an innovative study of networks using graph theory. It has the following original features: it (i) assigns working and spare channels simultaneously, (ii......) prevents the search for unacceptable routing paths by pointing out channels required for restoration, (iii) offers a high utilization of the capacity resources and (iv) allows a trivial search for the restoration paths. The algorithm is for link restoration of networks without wavelength translation. Its...

  8. Towards fully automated structure-based NMR resonance assignment of 15N-labeled proteins from automatically picked peaks

    KAUST Repository

    Jang, Richard


    In NMR resonance assignment, an indispensable step in NMR protein studies, manually processed peaks from both N-labeled and C-labeled spectra are typically used as inputs. However, the use of homologous structures can allow one to use only N-labeled NMR data and avoid the added expense of using C-labeled data. We propose a novel integer programming framework for structure-based backbone resonance assignment using N-labeled data. The core consists of a pair of integer programming models: one for spin system forming and amino acid typing, and the other for backbone resonance assignment. The goal is to perform the assignment directly from spectra without any manual intervention via automatically picked peaks, which are much noisier than manually picked peaks, so methods must be error-tolerant. In the case of semi-automated/manually processed peak data, we compare our system with the Xiong-Pandurangan-Bailey- Kellogg\\'s contact replacement (CR) method, which is the most error-tolerant method for structure-based resonance assignment. Our system, on average, reduces the error rate of the CR method by five folds on their data set. In addition, by using an iterative algorithm, our system has the added capability of using the NOESY data to correct assignment errors due to errors in predicting the amino acid and secondary structure type of each spin system. On a publicly available data set for human ubiquitin, where the typing accuracy is 83%, we achieve 91% accuracy, compared to the 59% accuracy obtained without correcting for such errors. In the case of automatically picked peaks, using assignment information from yeast ubiquitin, we achieve a fully automatic assignment with 97% accuracy. To our knowledge, this is the first system that can achieve fully automatic structure-based assignment directly from spectra. This has implications in NMR protein mutant studies, where the assignment step is repeated for each mutant. © Copyright 2011, Mary Ann Liebert, Inc.

  9. An algorithm and a Tool for Wavelength Allocation in OMS-SP Ring Architecture

    DEFF Research Database (Denmark)

    Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun


    OMS-SP ring is one of the well known architectures in Wavelength Division Multiplexing based optical fiber networks. The architecture supports a restorable full mesh in an optical fiber ring using multiple light wavelengths. The paper presents an algorithm to allocate wavelengths in the OMS-SP ring...... architecture. A tool is also introduced which implements the algorithm and assigns wavelengths. The proposed algorithm uses fewer number of wavelengths than the classical allocation method. The algorithm is described and results are presented....

  10. The Apriori Stochastic Dependency Detection (ASDD) algorithm for learning Stochastic logic rules


    Child, C. H. T.; Stathis, K.


    Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environment. ASDD is based on features of the Apriori algorithm for mining association rules in large databases of sales transactions [1] and the MSDD algorithm for discovering stochastic dependencies in multiple streams of data [15]. Once these rules have been acquired the Precedence algorithm assigns operator precedence w...

  11. Adaptive cockroach swarm algorithm (United States)

    Obagbuwa, Ibidun C.; Abidoye, Ademola P.


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

  12. An Evolutionary Video Assignment Optimization Technique for VOD System in Heterogeneous Environment

    Directory of Open Access Journals (Sweden)

    King-Man Ho


    Full Text Available We investigate the video assignment problem of a hierarchical Video-on-Demand (VOD system in heterogeneous environments where different quality levels of videos can be encoded using either replication or layering. In such systems, videos are delivered to clients either through a proxy server or video broadcast/unicast channels. The objective of our work is to determine the appropriate coding strategy as well as the suitable delivery mechanism for a specific quality level of a video such that the overall system blocking probability is minimized. In order to find a near-optimal solution for such a complex video assignment problem, an evolutionary approach based on genetic algorithm (GA is proposed. From the results, it is shown that the system performance can be significantly enhanced by efficiently coupling the various techniques.

  13. Multiobjective Order Assignment Optimization in a Global Multiple-Factory Environment

    Directory of Open Access Journals (Sweden)

    Rong-Chang Chen


    Full Text Available In response to radically increasing competition, many manufacturers who produce time-sensitive products have expanded their production plants to worldwide sites. Given this environment, how to aggregate customer orders from around the globe and assign them quickly to the most appropriate plants is currently a crucial issue. This study proposes an effective method to solve the order assignment problem of companies with multiple plants distributed worldwide. A multiobjective genetic algorithm (MOGA is used to find solutions. To validate the effectiveness of the proposed approach, this study employs some real data, provided by a famous garment company in Taiwan, as a base to perform some experiments. In addition, the influences of orders with a wide range of quantities demanded are discussed. The results show that feasible solutions can be obtained effectively and efficiently. Moreover, if managers aim at lower total costs, they can divide a big customer order into more small manufacturing ones.

  14. Intensified Particle Swarm Optimization For The Minimum Order Frequency Assignment Problem

    Directory of Open Access Journals (Sweden)

    Osman M. S. A.


    Full Text Available The Minimum Order Frequency Assignment Problem MO-FAP is one of the main four schemes of the frequency assignment problem. The MO-FAP is a process of resource management of using the limited available spectrum in communication systems efficiently. The main objective is to minimize the total number of different used frequencies in the spectrum while satisfying the increasing capacity of customers and quality of the service. In this paper a modified PSO is called Intensified Particle Swarm Optimization IPSO. The proposed modified PSO is used for solving MO-FAP while tackling the original PSO of being trapped in local minimum in the search space. The execution of the IPSO incurred using LabView programming. The effectiveness and robustness of the proposed algorithm have been demonstrated on a well-known benchmark problems and comparing the results with a number of previously related works.

  15. Stochastic User Equilibrium Traffic Assignment with Turn-delays in Intersections

    DEFF Research Database (Denmark)

    Nielsen, Otto Anker; Simonsen, Nikolaj; Frederiksen, Rasmus Dyhr


    Turn-delays in intersections contribute significant to travel times and thus route choices in urban networks. However, turns are difficult to handle in traffic assignment models due to the asymmetric Jacobian in the cost functions. The paper describes a model where turn delays have been included...... in the solution algorithm of Sto-chastic User Equilibrium traffic assignment (SUE). When the Jacobian is symme-tric, SUE minimises the road users' 'perceived travel resistance’s'. This equals a probit-model where the links cost-functions are traffic dependent. Hereby, overlap-ping routes are handled...... on a full-scale network. Therefore, an essential part of the paper presents practical tests of convergence. Both geometric delays and delays caused by other turns are considered for each turn. Signalised and non-signalised intersec-tions are handled in different ways, as are roundabouts. In signalised...

  16. Manycast routing, modulation level and spectrum assignment over elastic optical networks (United States)

    Luo, Xiao; Zhao, Yang; Chen, Xue; Wang, Lei; Zhang, Min; Zhang, Jie; Ji, Yuefeng; Wang, Huitao; Wang, Taili


    Manycast is a point to multi-point transmission framework that requires a subset of destination nodes successfully reached. It is particularly applicable for dealing with large amounts of data simultaneously in bandwidth-hungry, dynamic and cloud-based applications. As rapid increasing of traffics in these applications, the elastic optical networks (EONs) may be relied on to achieve high throughput manycast. In terms of finer spectrum granularity, the EONs could reach flexible accessing to network spectrum and efficient providing exact spectrum resource to demands. In this paper, we focus on the manycast routing, modulation level and spectrum assignment (MA-RMLSA) problem in EONs. Both EONs planning with static manycast traffic and EONs provisioning with dynamic manycast traffic are investigated. An integer linear programming (ILP) model is formulated to derive MA-RMLSA problem in static manycast scenario. Then corresponding heuristic algorithm called manycast routing, modulation level and spectrum assignment genetic algorithm (MA-RMLSA-GA) is proposed to adapt for both static and dynamic manycast scenarios. The MA-RMLSA-GA optimizes MA-RMLSA problem in destination nodes selection, routing light-tree constitution, modulation level allocation and spectrum resource assignment jointly, to achieve an effective improvement in network performance. Simulation results reveal that MA-RMLSA strategies offered by MA-RMLSA-GA have slightly disparity from the optimal solutions provided by ILP model in static scenario. Moreover, the results demonstrate that MA-RMLSA-GA realizes a highly efficient MA-RMLSA strategy with the lowest blocking probability in dynamic scenario compared with benchmark algorithms.

  17. Storage assignment optimization in a multi-tier shuttle warehousing system (United States)

    Wang, Yanyan; Mou, Shandong; Wu, Yaohua


    The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP), which has been widely applied in the conventional automated storage and retrieval system(AS/RS). However, the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems(MSWS) because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP. In this study, a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period (SWP) and lift idle period (LIP) during transaction cycle time. A mean arrival time difference matrix for pairwise stock keeping units(SKUs) is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation. The decomposition method is applied to analyze the interactions among outbound task time, SWP, and LIP. The ant colony clustering algorithm is designed to determine storage partitions using clustering items. In addition, goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane. This combination is derived based on the analysis results of the queuing network model and on three basic principles. The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry. The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

  18. Petri Net Decomposition Method for Simultaneous Optimization of Task Assignment and Routing for AGVs (United States)

    Tanaka, Yuki; Nishi, Tatsushi; Inuiguchi, Masahiro

    We propose a simultaneous optimization method for task assignment and routing problems with multiple AGVs by the decomposition of Petri Nets. In the proposed method, Petri Net is decomposed into several subnets representing task subproblems and AGV subproblems. Each subproblem is solved by Dijkstra's algorithm. The subproblem on each subnet is repeatedly solved until a feasible solution for the original problem is derived. A solution method for subproblems with no final marking is newly developed. The effectiveness of the proposed method is demonstrated by comparing the performance with CPLEX as well as a nearest neighborhood heuristic method.

  19. Software For Genetic Algorithms (United States)

    Wang, Lui; Bayer, Steve E.


    SPLICER computer program is genetic-algorithm software tool used to solve search and optimization problems. Provides underlying framework and structure for building genetic-algorithm application program. Written in Think C.

  20. Modified Clipped LMS Algorithm

    National Research Council Canada - National Science Library

    Lotfizad, Mojtaba; Yazdi, Hadi Sadoghi


    A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization...

  1. Autonomous Star Tracker Algorithms

    DEFF Research Database (Denmark)

    Betto, Maurizio; Jørgensen, John Leif; Kilsgaard, Søren


    Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances.......Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances....

  2. A Bio-Inspired Approach to Task Assignment of Swarm Robots in 3-D Dynamic Environments. (United States)

    Xin Yi; Anmin Zhu; Yang, Simon X; Chaomin Luo


    Intending to mimic the operating mechanism of biological neural systems, a self organizing map-based approach to task assignment of a swarm of robots in 3-D dynamic environments is proposed in this paper. This approach integrates the advantages and characteristics of biological neural systems. It is capable of dynamically planning the paths of a swarm of robots in 3-D environments under uncertain situations, such as when some robots are presented in or broken down or when more than one robot is needed for some special task locations. A Bezier path optimizing algorithm and a parameter adjusting algorithm are integrated in this paper. It is capable of reducing the complexity of the robot navigation control and limiting the number of convergence iterations. The simulation results with different environments demonstrate the effectiveness of the proposed approach.

  3. Study on MAX-MIN Ant System with Random Selection in Quadratic Assignment Problem (United States)

    Iimura, Ichiro; Yoshida, Kenji; Ishibashi, Ken; Nakayama, Shigeru

    Ant Colony Optimization (ACO), which is a type of swarm intelligence inspired by ants' foraging behavior, has been studied extensively and its effectiveness has been shown by many researchers. The previous studies have reported that MAX-MIN Ant System (MMAS) is one of effective ACO algorithms. The MMAS maintains the balance of intensification and diversification concerning pheromone by limiting the quantity of pheromone to the range of minimum and maximum values. In this paper, we propose MAX-MIN Ant System with Random Selection (MMASRS) for improving the search performance even further. The MMASRS is a new ACO algorithm that is MMAS into which random selection was newly introduced. The random selection is one of the edgechoosing methods by agents (ants). In our experimental evaluation using ten quadratic assignment problems, we have proved that the proposed MMASRS with the random selection is superior to the conventional MMAS without the random selection in the viewpoint of the search performance.

  4. Graph Colouring Algorithms

    DEFF Research Database (Denmark)

    Husfeldt, Thore


    This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...... techniques and is organized by algorithmic paradigm....

  5. Optimal Mixing Evolutionary Algorithms

    NARCIS (Netherlands)

    D. Thierens (Dirk); P.A.N. Bosman (Peter); N. Krasnogor


    htmlabstractA key search mechanism in Evolutionary Algorithms is the mixing or juxtaposing of partial solutions present in the parent solutions. In this paper we look at the efficiency of mixing in genetic algorithms (GAs) and estimation-of-distribution algorithms (EDAs). We compute the mixing

  6. The UNCITRAL Convention on the Assignment of Receivables in International Trade, assignment of future receivables and Turkish law.


    Akseli, N. Orkun


    The Assignment of receivables is an important financing technique the regulation of which varies from legal system to legal system. In December 2001, the Convention on the Assignment of Receivables in International Trade made by the United Nations Commission on International Trade (“the UNCITRAL Convention”)1 was adopted by the General Assembly2. The UNCITRAL Convention was prepared for the purposes of establishing a model for the modernisation of domestic assignment law and as a first substa...

  7. Nature-inspired optimization algorithms

    CERN Document Server

    Yang, Xin-She


    Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning

  8. Multipoint to multipoint routing and wavelength assignment in multi-domain optical networks (United States)

    Qin, Panke; Wu, Jingru; Li, Xudong; Tang, Yongli


    In multi-point to multi-point (MP2MP) routing and wavelength assignment (RWA) problems, researchers usually assume the optical networks to be a single domain. However, the optical networks develop toward to multi-domain and larger scale in practice. In this context, multi-core shared tree (MST)-based MP2MP RWA are introduced problems including optimal multicast domain sequence selection, core nodes belonging in which domains and so on. In this letter, we focus on MST-based MP2MP RWA problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations to optimally construct MP2MP multicast trees is presented. A heuristic algorithm base on network virtualization and weighted clustering algorithm (NV-WCA) is proposed. Simulation results show that, under different traffic patterns, the proposed algorithm achieves significant improvement on network resources occupation and multicast trees setup latency in contrast with the conventional algorithms which were proposed base on a single domain network environment.

  9. Active learning in pre-class assignments: Exploring the use of interactive simulations to enhance reading assignments

    CERN Document Server

    Stang, Jared B; Perez, Sarah; Ives, Joss; Roll, Ido


    Pre-class reading assignments help prepare students for active classes by providing a first exposure to the terms and concepts to be used during class. We investigate if the use of inquiry-oriented PhET-based activities in conjunction with pre-class reading assignments can improve both the preparation of students for in-class learning and student attitudes towards and engagement with pre-class assignments. Over three course modules covering different topics, students were assigned randomly to complete either a textbook-only pre-class assignment or both a textbook pre-class assignment and a PhET-based activity. The assignments helped prepare students for class, as measured by performance on the pre-class quiz relative to a beginning-of-semester pre-test, but no evidence for increased learning due the PhET activity was observed. Students rated the assignments which included PhET as more enjoyable and, for the topic latest in the semester, reported engaging more with the assignments when PhET was included.

  10. Parallel sorting algorithms

    CERN Document Server

    Akl, Selim G


    Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the

  11. Digital Arithmetic: Division Algorithms

    DEFF Research Database (Denmark)

    Montuschi, Paolo; Nannarelli, Alberto


    .g., Newton–Raphson) algorithms. The first class of algorithms, the digit-recurrence type, is particularly suitable for hardware implementation as it requires modest resources and provides good performance on contemporary technology. The second class of algorithms, the multiplicative type, requires...... implement it in hardware to not compromise the overall computation performances. This entry explains the basic algorithms, suitable for hardware and software, to implement division in computer systems. Two classes of algorithms implement division or square root: digit-recurrence and multiplicative (e...

  12. Weighted Automata Algorithms (United States)

    Mohri, Mehryar

    Weighted automata and transducers are widely used in modern applications in bioinformatics and text, speech, and image processing. This chapter describes several fundamental weighted automata and shortest-distance algorithms including composition, determinization, minimization, and synchronization, as well as single-source and all-pairs shortest distance algorithms over general semirings. It presents the pseudocode of these algorithms, gives an analysis of their running time complexity, and illustrates their use in some simple cases. Many other complex weighted automata and transducer algorithms used in practice can be obtained by combining these core algorithms.

  13. Modified Clipped LMS Algorithm

    Directory of Open Access Journals (Sweden)

    Lotfizad Mojtaba


    Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.

  14. The Eco-Sculpture Assignment: Using Art to Scaffold Metacognition (United States)

    Polegato, Rosemary


    The Eco-Sculpture Assignment demonstrates that art may be used as a conduit to scaffold metacognition in marketing courses. Theoretical underpinnings are drawn from the literature on pedagogy used in general, marketing, and art education contexts. The assignment is described in detail, followed by examples of learner response that illustrate…

  15. A Poster Assignment Connects Information Literacy and Writing Skills (United States)

    Waters, Natalie


    This paper describes the implementation of a poster assignment in a writing and information literacy course required for undergraduate Life Sciences and Environmental Biology majors with the Faculty of Agricultural and Environmental Sciences at McGill University. The assignment was introduced in response to weaknesses identified through course…

  16. 24 CFR 203.350 - Assignment of mortgage. (United States)


    ... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment of mortgage. 203.350... URBAN DEVELOPMENT MORTGAGE AND LOAN INSURANCE PROGRAMS UNDER NATIONAL HOUSING ACT AND OTHER AUTHORITIES SINGLE FAMILY MORTGAGE INSURANCE Contract Rights and Obligations Assignment of Mortgage § 203.350...

  17. A tri-objective, dynamic weapon assignment model for surface ...

    African Journals Online (AJOL)

    In this paper, a tri-objective, dynamic weapon assignment model is proposed by modelling the weapon assignment problem as a multi-objective variation of the celebrated vehicle routing problem with time windows. A multi-objective, evolutionary metaheuristic for solving the vehicle routing problem with time windows is ...

  18. 47 CFR 74.786 - Digital channel assignments. (United States)


    ... Translator, and TV Booster Stations § 74.786 Digital channel assignments. (a) An applicant for a new low... same TV channel and the adjacent channel within whose licensed geographic boundaries the digital LPTV... 47 Telecommunication 4 2010-10-01 2010-10-01 false Digital channel assignments. 74.786 Section 74...

  19. Evaluation of Automatically Assigned Job-Specific Interview Modules

    NARCIS (Netherlands)

    Friesen, Melissa C; Lan, Qing; Ge, Calvin; Locke, Sarah J; Hosgood, Dean; Fritschi, Lin; Sadkowsky, Troy; Chen, Yu-Cheng; Wei, Hu; Xu, Jun; Lam, Tai Hing; Kwong, Yok Lam; Chen, Kexin; Xu, Caigang; Su, Yu-Chieh; Chiu, Brian C H; Ip, Kai Ming Dennis; Purdue, Mark P; Bassig, Bryan A; Rothman, Nat; Vermeulen, Roel

    OBJECTIVE: In community-based epidemiological studies, job- and industry-specific 'modules' are often used to systematically obtain details about the subject's work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the

  20. Negotiating Languages and Cultures: Enacting Translingualism through a Translation Assignment (United States)

    Kiernan, Julia; Meier, Joyce; Wang, Xiqiao


    This collaborative project explores the affordances of a translation assignment in the context of a learner-centered pedagogy that places composition students' movement among languages and cultures as both a site for inquiry and subject of analysis. The translation assignment asks students to translate scholarly articles or culture stories from…

  1. SKU assignment to unidirectional picking lines using correlations

    African Journals Online (AJOL)

    The clustering storage assignment policy was further expanded as three sequential steps ... determine the next SKU to assign to a cluster, had a risk of generating correlated couplets of SKUs instead of ..... an order picking system: an application to the food service industry, International Journal of Logistics. Research and ...

  2. A tri-objective, dynamic weapon assignment model for surface ...

    African Journals Online (AJOL)


    May 11, 2015 ... Mateo (CA). [12] Hosein PA & Athans M, 1989, The dynamic weapon-target assignment problem, (Unpublished). Technical Report, Massachusetts Institute of Technology, Cambridge (MA). [13] Huaiping C, Jingxu L, Yingwu C & Hao W, 2006, Survey of the research on dynamic weapon-target assignment ...

  3. Income Tax Assignment under the Ethiopian Constitution: Issues to ...

    African Journals Online (AJOL)

    This article uses the income tax assignment in the Ethiopian Constitution to highlight some of these questions and concerns. There is ample evidence to show that the assignment formula adopted by the Constitution, indeed its predecessor - the 1992 law - was motivated by the desire to divide the power of taxation over ...

  4. Case Assignment in the Inalienable Possession Construction in Korean. (United States)

    Maling, Joan; Kim, Soowon


    Investigates principles for assigning case to the Noun Phrases (NP) in the Part-Whole Construction in Korean. It is shown that the case marking on the part-NP is a function of the case-assigning properties of the matrix verb, even when this is lexically governed. (41 references) (Author/LB)

  5. Determining Feasible Solutions of a Multicriteria Assignment Problem.

    African Journals Online (AJOL)

    This paper presents an important research tool in operations research as it applies to a particular structure of the multicriteria assignment problem. The paper addresses the problem of effectiveness of feasible solutions of a multicriteria assignment problem and this was done in two steps. In the first step, we determine ...

  6. 48 CFR 1442.202 - Assignment of contract administration. (United States)


    ... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Assignment of contract administration. 1442.202 Section 1442.202 Federal Acquisition Regulations System DEPARTMENT OF THE INTERIOR CONTRACT MANAGEMENT CONTRACT ADMINISTRATION AND AUDIT SERVICES Contract Administration Services 1442.202 Assignment of contract administration. ...

  7. 48 CFR 1342.202 - Assignment of contract administration. (United States)


    ... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Assignment of contract administration. 1342.202 Section 1342.202 Federal Acquisition Regulations System DEPARTMENT OF COMMERCE CONTRACT MANAGEMENT CONTRACT ADMINISTRATION Contract Administration Services 1342.202 Assignment of contract administration. The designee authorized...

  8. Frequency assignment with minimum intermodulation noise for satellite SCPC systems (United States)

    Lau, Y.-H.; Skellern, D. J.


    A simple, fast, and effective procedure for quasi-optimum frequency assignment of equal carrier systems is given. The quality of assignments is marginally the same as published results. The computation time has been reduced greatly; a conservative estimate shows that the reduction factor can be greater than N/2.

  9. 14 CFR 1245.109 - Assignment of title to NASA. (United States)


    ... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Assignment of title to NASA. 1245.109... INTELLECTUAL PROPERTY RIGHTS Patent Waiver Regulations § 1245.109 Assignment of title to NASA. (a) The instrument of waiver set forth in § 1245.115(c) shall be voided by NASA with respect to the domestic title to...

  10. Key Issue: Teacher Hiring, Placement, and Assignment Practices (United States)

    Behrstock, Ellen; Coggshall, Jane G.


    The literature on teacher hiring and assignment tends to omit definitions of these key terms. An exception in Cohen-Vogel and Osborne-Lampkin (277), who define teacher assignment as "the reciprocal process between school management and teachers to guide decisions about who will teach, where they will teach, and what they will teach." But the…

  11. On some special cases of the restricted assignment problem

    NARCIS (Netherlands)

    Wang, C. (Chao); R.A. Sitters (René)


    textabstractWe consider some special cases of the restricted assignment problem. In this scheduling problem on parallel machines, any job j can only be assigned to one of the machines in its given subset Mj of machines. We give an LP-formulation for the problem with two job sizes and show that it

  12. 76 FR 34658 - The Internet Assigned Numbers Authority (IANA) Functions (United States)


    ... National Telecommunications and Information Administration The Internet Assigned Numbers Authority (IANA.... ACTION: Further Notice of Inquiry. ] SUMMARY: Critical to the Internet Domain Name System (DNS) is the continued performance of the Internet Assigned Numbers Authority (IANA) functions. The IANA functions have...

  13. Writing Assignments: What We Know We Don't Know. (United States)

    Beene, LynnDianne

    Questions raised by the misinterpretations evidenced in the final examination essays of a freshman English class should lead teachers to a new understanding of how the phrasing of writing assignments influences what students write. Some of the questions included: (1) How detailed must an assignment be to communicate its goals? (2) What type of…

  14. Scaffolding learners in designing investigation assignments for a computer simulation

    NARCIS (Netherlands)

    Vreman-de Olde, Cornelise; de Jong, Anthonius J.M.


    This study examined the effect of scaffolding students who learned by designing assignments for a computer simulation on the physics topic of alternating circuits. We compared the students' assignments and the knowledge acquired in a scaffolded group (N=23) and a non-scaffolded group (N=19). The

  15. Challenging assignments and activating mood : the influence of goal orientation

    NARCIS (Netherlands)

    Preenen, P.T.Y.; Vianen, A.E.M. van; Pater, I.E. de


    We examined the impact of induced goal orientation on individuals' positive- and negative-activating mood when taking part in high- or low-challenging assignments. Results indicated that performing a low-challenging assignment leads to a higher positive-activating mood with a performance-approach

  16. Challenging assignments and activating mood: the influence of goal orientation

    NARCIS (Netherlands)

    Preenen, P.T.Y.; van Vianen, A.E.M.; de Pater, I.E.


    We examined the impact of induced goal orientation on individuals' positive- and negative-activating mood when taking part in high- or low-challenging assignments. Results indicated that performing a low-challenging assignment leads to a higher positive-activating mood with a performance-approach

  17. Scaffolding Assignments and Activities for Undergraduate Research Methods (United States)

    Fisher, Sarah; Justwan, Florian


    This article details assignments and lessons created for and tested in research methods courses at two different universities, a large state school and a small liberal arts college. Each assignment or activity utilized scaffolding. Students were asked to push beyond their comfort zone while utilizing concrete and/or creative examples,…

  18. 47 CFR 22.351 - Channel assignment policy. (United States)


    ... 47 Telecommunication 2 2010-10-01 2010-10-01 false Channel assignment policy. 22.351 Section 22... MOBILE SERVICES Operational and Technical Requirements Technical Requirements § 22.351 Channel assignment policy. The channels allocated for use in the Public Mobile Services are listed in the applicable...

  19. Text-Based Writing Assignments for College Readiness (United States)

    Matsumura, Lindsay Clare; Wang, Elaine; Correnti, Richard


    Research shows that cognitively demanding text-based writing assignments increase students' reading comprehension skills and analytic writing competencies. In this article, we describe the steps that upper-elementary grade teachers can take to develop cognitively demanding assignments that build these higher-level literacy skills and put students…

  20. 28 CFR 545.23 - Inmate work/program assignment. (United States)


    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Inmate work/program assignment. 545.23 Section 545.23 Judicial Administration BUREAU OF PRISONS, DEPARTMENT OF JUSTICE INSTITUTIONAL MANAGEMENT WORK AND COMPENSATION Inmate Work and Performance Pay Program § 545.23 Inmate work/program assignment...

  1. On the Use of Writing Assignments in Intermediate Microeconomic Theory (United States)

    O'Neill, Patrick B.


    A typical writing assignment in upper level required courses is a term paper. However many economics majors, particularly those in business schools, need to develop skill at writing shorter pieces. In this paper I describe numerous examples of shorter writing assignments that I have incorporated into an Intermediate Microeconomic Theory course.…

  2. Conceptualizing Patient Barriers to Nonadherence with Homework Assignments (United States)

    Kazantzis, Nikolaos; Shinkfield, Gregg


    Nonadherence with homework assignments and, by implication, "barriers" to homework assignments are a frequent occurrence in the practice of standard cognitive therapy (Beck, A. T., Rush, A. J., Shaw, B. F., Emery, G. (1979). "Cognitive therapy of depression." New York: The Guilford Press). The clinical examples in this article illustrate some of…

  3. Kidney-inspired algorithm for optimization problems (United States)

    Jaddi, Najmeh Sadat; Alvankarian, Jafar; Abdullah, Salwani


    In this paper, a population-based algorithm inspired by the kidney process in the human body is proposed. In this algorithm the solutions are filtered in a rate that is calculated based on the mean of objective functions of all solutions in the current population of each iteration. The filtered solutions as the better solutions are moved to filtered blood and the rest are transferred to waste representing the worse solutions. This is a simulation of the glomerular filtration process in the kidney. The waste solutions are reconsidered in the iterations if after applying a defined movement operator they satisfy the filtration rate, otherwise it is expelled from the waste solutions, simulating the reabsorption and excretion functions of the kidney. In addition, a solution assigned as better solution is secreted if it is not better than the worst solutions simulating the secreting process of blood in the kidney. After placement of all the solutions in the population, the best of them is ranked, the waste and filtered blood are merged to become a new population and the filtration rate is updated. Filtration provides the required exploitation while generating a new solution and reabsorption gives the necessary exploration for the algorithm. The algorithm is assessed by applying it on eight well-known benchmark test functions and compares the results with other algorithms in the literature. The performance of the proposed algorithm is better on seven out of eight test functions when it is compared with the most recent researches in literature. The proposed kidney-inspired algorithm is able to find the global optimum with less function evaluations on six out of eight test functions. A statistical analysis further confirms the ability of this algorithm to produce good-quality results.

  4. Multiobjective Gate Assignment Based on Passenger Walking Distance and Fairness

    Directory of Open Access Journals (Sweden)

    Yu Jiang


    Full Text Available Passenger walking distance is an important index of the airport service quality. How to shorten the walking distance and balance the airlines' service quality is the focus of much research on airport gate assignment problems. According to the problems of airport passenger service quality, an optimization gate assignment model is established. The gate assignment model is based on minimizing the total walking distance of all passengers and balancing the average walking distance of passengers among different airlines. Lingo is used in the simulation of a large airport gate assignment. Test results show that the optimization model can reduce the average walking distance of passenger effectively, improve the number of flights assigned to gate, balance airline service quality, and enhance the overall service level of airports and airlines. The model provides reference for the airport gate preassignment.

  5. Wavelength Assignment in Hybrid Quantum-Classical Networks. (United States)

    Bahrani, Sima; Razavi, Mohsen; Salehi, Jawad A


    Optimal wavelength assignment in dense-wavelength-division-multiplexing (DWDM) systems that integrate both quantum and classical channels is studied. In such systems, weak quantum key distribution (QKD) signals travel alongside intense classical signals on the same fiber, where the former can be masked by the background noise induced by the latter. Here, we investigate how optimal wavelength assignment can mitigate this problem. We consider different DWDM structures and various sources of crosstalk and propose several near-optimal wavelength assignment methods that maximize the total secret key rate of the QKD channels. Our numerical results show that the optimum wavelength assignment pattern is commonly consisted of several interspersed quantum and classical bands. Using our proposed techniques, the total secret key rate of quantum channels can substantially be improved, as compared to conventional assignment methods, in the noise dominated regimes. Alternatively, we can maximize the number of QKD users supported under certain key rate constraints.

  6. Further steps in TANGO: improved taxonomic assignment in metagenomics. (United States)

    Alonso-Alemany, Daniel; Barré, Aurélien; Beretta, Stefano; Bonizzoni, Paola; Nikolski, Macha; Valiente, Gabriel


    TANGO is one of the most accurate tools for the taxonomic assignment of sequence reads. However, because of the differences in the taxonomy structures, performing a taxonomic assignment on different reference taxonomies will produce divergent results. We have improved the TANGO pipeline to be able to perform the taxonomic assignment of a metagenomic sample using alternative reference taxonomies, coming from different sources. We highlight the novel pre-processing step, necessary to accomplish this task, and describe the improvements in the assignment process. We present the new TANGO pipeline in details, and, finally, we show its performance on four real metagenomic datasets and also on synthetic datasets. The new version of TANGO, including implementation improvements and novel developments to perform the assignment on different reference taxonomies, is freely available at

  7. Exploring consumption- and asset-based poverty dynamics in Ethiopia

    African Journals Online (AJOL)

    This paper examines the dynamics of wellbeing in Ethiopia by assessing changes in poverty status based on consumption and asset ownership. Using panel data from the first two waves of the Ethiopia Socioeconomic Survey (ESS), we discover that although the cross-sectional poverty remains relatively unchanged ...

  8. and Asset-based Poverty Dynamics in Ethiopia

    African Journals Online (AJOL)

    Optiplex 7010 Pro

    waves of the ESS, we assess the dynamics of consumption-based poverty in rural Ethiopia and examine the extent to which this poverty is transient or chronic. As the .... test for the difference between the included and excluded sample means. The ..... wave 1 but moved out of poverty in wave 2, and another 16% fell back to.


    Directory of Open Access Journals (Sweden)

    Morteza KARAMI


    Full Text Available Quadratic Assignment Problem (QAP is known as one of the most difficult combinatorial optimization problems that is classified in the category of NP-hard problems. Quadratic Assignment Problem Library (QAPLIB is a full database of QAPs which contains several problems from different authors and different sizes. Many exact and meta-heuristic solution methods have been introduced to solve QAP. In this study we focus on previously introduced solution methods of QAP e.g. Branch and Bound (B&B, Simulated Annealing (SA Algorithm, Greedy Randomized Adaptive Search Procedure (GRASP for dense and sparse QAPs. The codes of FORTRAN for these methods were downloaded from QAPLIB. All problems of QAPLIB were solved by the abovementioned methods. Several results were obtained from the computational experiments part. The Results show that the Branch and Bound method is able to introduce a feasible solution for all problems while Simulated Annealing Algorithm and GRASP methods are not able to find any solution for some problems. On the other hand, Simulated Annealing and GRASP methods have shorter run time comparing to the Branch and Bound method. In addition, the performance of the methods on the objective function value is discussed.

  10. Adaptive client to mirrored-server assignment for massively multiplayer online games (United States)

    Webb, Steven Daniel; Soh, Sieteng


    The Mirrored Server (MS) architecture for network games uses multiple mirrored servers across multiple locations to alleviate the bandwidth bottleneck and to reduce the client-to-server delay time. Response time in MS can be reduced by optimally assigning clients to their mirrors. The goal of optimal client-to-mirror-assignment (CMA) is to achieve the minimum average client-to-mirror delay considering player joins (CMA-J) and leaves (CMA-L), and mirrors with limited capacity. The existing heuristic solution considers only CMA-J, and thus the average delay of the remaining players may increase when one or more players leave. Furthermore, the solution ignores mirror capacity, which may overload mirrors. In this paper we present a resource usage model for the MS architecture, and formally state the CMA problem. For both CMA-J and CMA-L we propose a polynomial time optimal solution and a faster heuristic algorithm that obtains near optimal CMA. Our simulations on randomly generated MS topologies show that our algorithms significantly reduce the average delay of the existing solution. We also compare the merits of the solutions in terms of their optimality and running time efficiency.

  11. Comparison of greedy algorithms for α-decision tree construction

    KAUST Repository

    Alkhalid, Abdulaziz


    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.

  12. Single-Sex Schools, Student Achievement, and Course Selection: Evidence from Rule-Based Student Assignments in Trinidad and Tobago


    C. Kirabo Jackson


    Existing studies on single-sex schooling suffer from biases because students who attend single-sex schools differ in unmeasured ways from those who do not. In Trinidad and Tobago students are assigned to secondary schools based on an algorithm allowing one to address self-selection bias and estimate the causal effect of attending a single-sex school versus a similar coeducational school. While students (particularly females) with strong expressed preferences for single-sex schools benefit, mo...

  13. Empirical Equation Based Chirality (n, m Assignment of Semiconducting Single Wall Carbon Nanotubes from Resonant Raman Scattering Data

    Directory of Open Access Journals (Sweden)

    Md Shamsul Arefin


    Full Text Available This work presents a technique for the chirality (n, m assignment of semiconducting single wall carbon nanotubes by solving a set of empirical equations of the tight binding model parameters. The empirical equations of the nearest neighbor hopping parameters, relating the term (2n, m with the first and second optical transition energies of the semiconducting single wall carbon nanotubes, are also proposed. They provide almost the same level of accuracy for lower and higher diameter nanotubes. An algorithm is presented to determine the chiral index (n, m of any unknown semiconducting tube by solving these empirical equations using values of radial breathing mode frequency and the first or second optical transition energy from resonant Raman spectroscopy. In this paper, the chirality of 55 semiconducting nanotubes is assigned using the first and second optical transition energies. Unlike the existing methods of chirality assignment, this technique does not require graphical comparison or pattern recognition between existing experimental and theoretical Kataura plot.

  14. Fuzzy Rules for Ant Based Clustering Algorithm

    Directory of Open Access Journals (Sweden)

    Amira Hamdi


    Full Text Available This paper provides a new intelligent technique for semisupervised data clustering problem that combines the Ant System (AS algorithm with the fuzzy c-means (FCM clustering algorithm. Our proposed approach, called F-ASClass algorithm, is a distributed algorithm inspired by foraging behavior observed in ant colonyT. The ability of ants to find the shortest path forms the basis of our proposed approach. In the first step, several colonies of cooperating entities, called artificial ants, are used to find shortest paths in a complete graph that we called graph-data. The number of colonies used in F-ASClass is equal to the number of clusters in dataset. Hence, the partition matrix of dataset founded by artificial ants is given in the second step, to the fuzzy c-means technique in order to assign unclassified objects generated in the first step. The proposed approach is tested on artificial and real datasets, and its performance is compared with those of K-means, K-medoid, and FCM algorithms. Experimental section shows that F-ASClass performs better according to the error rate classification, accuracy, and separation index.


    Directory of Open Access Journals (Sweden)

    Orhan TÜRKBEY


    Full Text Available Memetic algorithms, which use local search techniques, are hybrid structured algorithms like genetic algorithms among evolutionary algorithms. In this study, for Quadratic Assignment Problem (QAP, a memetic structured algorithm using a local search heuristic like 2-opt is developed. Developed in the algorithm, a crossover operator that has not been used before for QAP is applied whereas, Eshelman procedure is used in order to increase thesolution variability. The developed memetic algorithm is applied on test problems taken from QAP-LIB, the results are compared with the present techniques in the literature.

  16. Heuristic for Task-Worker Assignment with Varying Learning Slopes

    Directory of Open Access Journals (Sweden)

    Wipawee Tharmmaphornphilas


    Full Text Available Fashion industry has variety products, so the multi-skilled workers are required to improve flexibility in production and assignment. Generally the supervisor will assign task to the workers based on skill and skill levels of worker. Since in fashion industry new product styles are launched more frequently and the order size tends to be smaller, the workers always learn when the raw material and the production process changes. Consequently they require less time to produce the succeeding units of a task based on their learning ability. Since the workers have both experience and inexperience workers, so each worker has different skill level and learning ability. Consequently, the assignment which assumed constant skill level is not proper to use. This paper proposes a task-worker assignment considering worker skill levels and learning abilities. Processing time of each worker changes along production period due to a worker learning ability. We focus on a task-worker assignment in a fashion industry where tasks are ordered in series; the number of tasks is greater than the number of workers. Therefore, workers can perform multiple assignments followed the precedence restriction as an assembly line balancing problem. The problem is formulated in an integer linear programming model with objective to minimize makespan. A heuristic is proposed to determine the lower bound (LB and the upper bound (UB of the problem and the best assignment is determined. The performance of the heuristic method is tested by comparing quality of solution and computational time to optimal solutions.

  17. Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †

    Directory of Open Access Journals (Sweden)

    Wenyu Cai


    Full Text Available This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP problem and the Genetic Algorithm (GA is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB or Tour Length Balance (TLB constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X − Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

  18. Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves (†). (United States)

    Cai, Wenyu; Zhang, Meiyan; Zheng, Yahong Rosa


    This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X - Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

  19. Assigning breed origin to alleles in crossbred animals. (United States)

    Vandenplas, Jérémie; Calus, Mario P L; Sevillano, Claudia A; Windig, Jack J; Bastiaansen, John W M


    For some species, animal production systems are based on the use of crossbreeding to take advantage of the increased performance of crossbred compared to purebred animals. Effects of single nucleotide polymorphisms (SNPs) may differ between purebred and crossbred animals for several reasons: (1) differences in linkage disequilibrium between SNP alleles and a quantitative trait locus; (2) differences in genetic backgrounds (e.g., dominance and epistatic interactions); and (3) differences in environmental conditions, which result in genotype-by-environment interactions. Thus, SNP effects may be breed-specific, which has led to the development of genomic evaluations for crossbred performance that take such effects into account. However, to estimate breed-specific effects, it is necessary to know breed origin of alleles in crossbred animals. Therefore, our aim was to develop an approach for assigning breed origin to alleles of crossbred animals (termed BOA) without information on pedigree and to study its accuracy by considering various factors, including distance between breeds. The BOA approach consists of: (1) phasing genotypes of purebred and crossbred animals; (2) assigning breed origin to phased haplotypes; and (3) assigning breed origin to alleles of crossbred animals based on a library of assigned haplotypes, the breed composition of crossbred animals, and their SNP genotypes. The accuracy of allele assignments was determined for simulated datasets that include crosses between closely-related, distantly-related and unrelated breeds. Across these scenarios, the percentage of alleles of a crossbred animal that were correctly assigned to their breed origin was greater than 90 %, and increased with increasing distance between breeds, while the percentage of incorrectly assigned alleles was always less than 2 %. For the remaining alleles, i.e. 0 to 10 % of all alleles of a crossbred animal, breed origin could not be assigned. The BOA approach accurately assigns

  20. Formularity: Software for Automated Formula Assignment of Natural and Other Organic Matter from Ultrahigh-Resolution Mass Spectra

    Energy Technology Data Exchange (ETDEWEB)

    Tolić, Nikola [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Liu, Yina [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Liyu, Andrey [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Shen, Yufeng [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Tfaily, Malak M. [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Kujawinski, Elizabeth B. [Department; Longnecker, Krista [Department; Kuo, Li-Jung [Marine; Robinson, Errol W. [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Paša-Tolić, Ljiljana [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States; Hess, Nancy J. [Earth; amp, Biological Sciences Division, Pacific Northwest National Laboratory (PNNL), Richland, Washington 99354, United States


    Ultrahigh-resolution mass spectrometry, such as Fourier transform ion-cyclotron resonance mass spectrometry (FT-ICR MS), can resolve thousands of molecular ions in complex organic matrices. A Compound Identification Algorithm (CIA) was previously developed for automated elemental formula assignment for natural organic matter (NOM). In this work we describe a user friendly interface for CIA, titled Formularity, which includes an additional functionality to perform search of formulas based on an Isotopic Pattern Algorithm (IPA). While CIA assigns elemental formulas for compounds containing C, H, O, N, S, and P, IPA is capable of assigning formulas for compounds containing other elements. We used halogenated organic compounds (HOC), a chemical class that is ubiquitous in nature as well as anthropogenic systems, as an example to demonstrate the capability of Formularity with IPA. A HOC standard mix was used to evaluate the identification confidence of IPA. The HOC spike in NOM and tap water were used to assess HOC identification in natural and anthropogenic matrices. Strategies for reconciliation of CIA and IPA assignments are discussed. Software and sample databases with documentation are freely available from the PNNL OMICS software repository

  1. LCA*: an entropy-based measure for taxonomic assignment within assembled metagenomes. (United States)

    Hanson, Niels W; Konwar, Kishori M; Hallam, Steven J


    A perennial problem in the analysis of environmental sequence information is the assignment of reads or assembled sequences, e.g. contigs or scaffolds, to discrete taxonomic bins. In the absence of reference genomes for most environmental microorganisms, the use of intrinsic nucleotide patterns and phylogenetic anchors can improve assembly-dependent binning needed for more accurate taxonomic and functional annotation in communities of microorganisms, and assist in identifying mobile genetic elements or lateral gene transfer events. Here, we present a statistic called LCA* inspired by Information and Voting theories that uses the NCBI Taxonomic Database hierarchy to assign taxonomy to contigs assembled from environmental sequence information. The LCA* algorithm identifies a sufficiently strong majority on the hierarchy while minimizing entropy changes to the observed taxonomic distribution resulting in improved statistical properties. Moreover, we apply results from the order-statistic literature to formulate a likelihood-ratio hypothesis test and P-value for testing the supremacy of the assigned LCA* taxonomy. Using simulated and real-world datasets, we empirically demonstrate that voting-based methods, majority vote and LCA*, in the presence of known reference annotations, are consistently more accurate in identifying contig taxonomy than the lowest common ancestor algorithm popularized by MEGAN, and that LCA* taxonomy strikes a balance between specificity and confidence to provide an estimate appropriate to the available information in the data. The LCA* has been implemented as a stand-alone Python library compatible with the MetaPathways pipeline; both of which are available on GitHub with installation instructions and use-cases ( shallam@mail.ubc.caSupplementary information: Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

  2. Cloud Particles Evolution Algorithm

    Directory of Open Access Journals (Sweden)

    Wei Li


    Full Text Available Many evolutionary algorithms have been paid attention to by the researchers and have been applied to solve optimization problems. This paper presents a new optimization method called cloud particles evolution algorithm (CPEA to solve optimization problems based on cloud formation process and phase transformation of natural substance. The cloud is assumed to have three states in the proposed algorithm. Gaseous state represents the global exploration. Liquid state represents the intermediate process from the global exploration to the local exploitation. Solid state represents the local exploitation. The cloud is composed of descript and independent particles in this algorithm. The cloud particles use phase transformation of three states to realize the global exploration and the local exploitation in the optimization process. Moreover, the cloud particles not only realize the survival of the fittest through competition mechanism but also ensure the diversity of the cloud particles by reciprocity mechanism. The effectiveness of the algorithm is validated upon different benchmark problems. The proposed algorithm is compared with a number of other well-known optimization algorithms, and the experimental results show that cloud particles evolution algorithm has a higher efficiency than some other algorithms.

  3. Explaining algorithms using metaphors

    CERN Document Server

    Forišek, Michal


    There is a significant difference between designing a new algorithm, proving its correctness, and teaching it to an audience. When teaching algorithms, the teacher's main goal should be to convey the underlying ideas and to help the students form correct mental models related to the algorithm. This process can often be facilitated by using suitable metaphors. This work provides a set of novel metaphors identified and developed as suitable tools for teaching many of the 'classic textbook' algorithms taught in undergraduate courses worldwide. Each chapter provides exercises and didactic notes fo

  4. Spectral Decomposition Algorithm (SDA) (United States)

    National Aeronautics and Space Administration — Spectral Decomposition Algorithm (SDA) is an unsupervised feature extraction technique similar to PCA that was developed to better distinguish spectral features in...

  5. Shadow algorithms data miner

    CERN Document Server

    Woo, Andrew


    Digital shadow generation continues to be an important aspect of visualization and visual effects in film, games, simulations, and scientific applications. This resource offers a thorough picture of the motivations, complexities, and categorized algorithms available to generate digital shadows. From general fundamentals to specific applications, it addresses shadow algorithms and how to manage huge data sets from a shadow perspective. The book also examines the use of shadow algorithms in industrial applications, in terms of what algorithms are used and what software is applicable.

  6. A United Framework for Solving Multiagent Task Assignment Problems

    National Research Council Canada - National Science Library

    Cousin, Kevin


    .... Problems using the CMTS representation are solvable by a suite of algorithms ranging from simple random scheduling to state-of-the-art biologically inspired approaches incorporating evolutionary...

  7. The Effectiveness of Incorporating Conceptual Writing Assignments into Physics Instruction (United States)

    Cummings, Karen; Murphy, Michael


    This preliminary study examines the impact of conceptual writing assignments on student understanding of two physics concepts. Writing assignments covered the concepts of Newton's Third Law and the impulse-momentum relationship and were given to students in both high school and college level introductory physics classes. The students in these classes along with students in classes taught in an identical fashion by the same instructors without the addition of writing assignments were tested on their conceptual understanding of the two content areas. The results of this initial study indicate that the efficacy of this approach varied with topic. This study further indicates that students' benefit from the writing assignments was independent of their writing ability.

  8. Optimization of Fleet Assignment: A Case Study in Turkey

    Directory of Open Access Journals (Sweden)

    Yavuz OZDEMIR


    Full Text Available Since poor fleet assignment can cause a great increase in costs for airline companies, asolution of the type ‘right fleet for the right flight’ would be very useful. In this paper, a fleetassignment model is set up using the data of the largest Airline Company in Turkey, TurkishAirlines. The aim of this model is to assign the most appropriate fleet type to flights whileminimizing the cost and determining the optimal number of aircraft grounded overnight at eachairport. We set up a model with constraints with thinking all airline operations and solve ourproblem using integer linear programming. Finally, we get an optimum solution which minimizesthe total cost while assigning the fleet type to the flight leg. Using optimization software (Lindo6.1, the solution to this problem generates a minimum daily cost of fleet assignment.

  9. Calibrated peer review assignments for the earth sciences (United States)

    Rudd, J.A.; Wang, V.Z.; Cervato, C.; Ridky, R.W.


    Calibrated Peer Review ??? (CPR), a web-based instructional tool developed as part of the National Science Foundation reform initiatives in undergraduate science education, allows instructors to incorporate multiple writing assignments in large courses without overwhelming the instructor. This study reports successful implementation of CPR in a large, introductory geology course and student learning of geoscience content. For each CPR assignment in this study, students studied web-based and paper resources, wrote an essay, and reviewed seven essays (three from the instructor, three from peers, and their own) on the topic. Although many students expressed negative attitudes and concerns, particularly about the peer review process of this innovative instructional approach, they also recognized the learning potential of completing CPR assignments. Comparing instruction on earthquakes and plate boundaries using a CPR assignment vs. an instructional video lecture and homework essay with extensive instructor feedback, students mastered more content via CPR instruction.

  10. 47 CFR 63.24 - Assignments and transfers of control. (United States)


    ... (CONTINUED) EXTENSION OF LINES, NEW LINES, AND DISCONTINUANCE, REDUCTION, OUTAGE AND IMPAIRMENT OF SERVICE BY..., is a sale of assets and shall be treated as an assignment, which requires prior Commission approval...

  11. Assigning strains to bacterial species via the internet

    National Research Council Canada - National Science Library

    Bishop, Cynthia J; Aanensen, David M; Jordan, Gregory E; Kilian, Mogens; Hanage, William P; Spratt, Brian G


    .... The advantage of this approach (multilocus sequence analysis; MLSA) is that, for any group of related species, a strain database can be produced and combined with software that allows query strains to be assigned to species via the internet...

  12. Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

    National Research Council Canada - National Science Library

    Rodriguez-Molins, M; Salido, M.A; Barber, F

    .... This paper is based on proportionally distributing operational buffers among the tasks. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems...

  13. A singular value sensitivity approach to robust eigenstructure assignment

    DEFF Research Database (Denmark)

    Søgaard-Andersen, Per; Trostmann, Erik; Conrad, Finn


    A design technique for improving the feedback properties of multivariable state feedback systems designed using eigenstructure assignment is presented. Based on a singular value analysis of the feedback properties a design parameter adjustment procedure is outlined. This procedure allows for the ......A design technique for improving the feedback properties of multivariable state feedback systems designed using eigenstructure assignment is presented. Based on a singular value analysis of the feedback properties a design parameter adjustment procedure is outlined. This procedure allows...

  14. Neural Mechanisms of Credit Assignment in a Multicue Environment (United States)

    Kolling, Nils; Brown, Joshua W.; Rushworth, Matthew


    In complex environments, many potential cues can guide a decision or be assigned responsibility for the outcome of the decision. We know little, however, about how humans and animals select relevant information sources that should guide behavior. We show that subjects solve this relevance selection and credit assignment problem by selecting one cue and its association with a particular outcome as the main focus of a hypothesis. To do this, we examined learning while using a task design that allowed us to estimate the focus of each subject's hypotheses on a trial-by-trial basis. When a prediction is confirmed by the outcome, then credit for the outcome is assigned to that cue rather than an alternative. Activity in medial frontal cortex is associated with the assignment of credit to the cue that is the main focus of the hypothesis. However, when the outcome disconfirms a prediction, the focus shifts between cues, and the credit for the outcome is assigned to an alternative cue. This process of reselection for credit assignment to an alternative cue is associated with lateral orbitofrontal cortex. SIGNIFICANCE STATEMENT Learners should infer which features of environments are predictive of significant events, such as rewards. This “credit assignment” problem is particularly challenging when any of several cues might be predictive. We show that human subjects solve the credit assignment problem by implicitly “hypothesizing” which cue is relevant for predicting subsequent outcomes, and then credit is assigned according to this hypothesis. This process is associated with a distinctive pattern of activity in a part of medial frontal cortex. By contrast, when unexpected outcomes occur, hypotheses are redirected toward alternative cues, and this process is associated with activity in lateral orbitofrontal cortex. PMID:26818500

  15. Firm Size, Productivity, and Manager Wages: A Job Assignment Approach


    Grossmann, Volker


    Ability of managers and other nonproduction professionals is key for the productivity of firms. Hence, the assignment of heterogeneous nonproduction workers across firms determines the distribution of productivity. In turn, the transmission of productivity differences into profit differences -- resulting from product market competition -- determines firms' willingness to pay for higher managerial skills. This paper explores the equilibrium assignment of nonproduction workers across ex ante id...

  16. Effective Schools: Teacher Hiring, Assignment, Development, and Retention


    Loeb, Susanna; Kalogrides, Demetra; Beteille, Tara


    The literature on effective schools emphasizes the importance of a quality teaching force in improving educational outcomes for students. In this paper, we use value-added methods to examine the relationship between a school's effectiveness and the recruitment, assignment, development and retention of its teachers. We ask whether effective schools systematically recruit more effective teachers; whether they assign teachers to students more effectively; whether they do a better job of helping ...

  17. Patients' perspective on homework assignments in cognitive-behavioural therapy. (United States)

    Fehm, Lydia; Mrose, Jana


    Homework assignments are an indispensable part of cognitive-behavioural therapy. During the past two decades, a growing number of studies have shed light on its characteristics and effects. However, most studies primarily consider the therapists' view, and little is known about the use of supportive strategies to implement homework assignments in psychotherapy and about patients' attitudes towards regular assignments. To fill this gap, we assessed the attitudes towards homework assignments of 80 outpatients. In addition, those who had received a task during the past session (75%) were asked to report characteristics of their task as well as therapists' behaviour strategies during the assignment of the task. One week later, therapists rated the extent of completion of the task. Results showed that the patients generally had a positive attitude towards homework and that they accomplished most of the tasks. With regard to the therapists' behaviour during the assignment of the task, there seems to be room for improvement. Copyright (c) 2008 John Wiley & Sons, Ltd.

  18. Algorithms for finite rings

    NARCIS (Netherlands)

    Ciocanea Teodorescu I.,


    In this thesis we are interested in describing algorithms that answer questions arising in ring and module theory. Our focus is on deterministic polynomial-time algorithms and rings and modules that are finite. The first main result of this thesis is a solution to the module isomorphism problem in

  19. 8. Algorithm Design Techniques

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 8. Algorithms - Algorithm Design Techniques. R K Shyamasundar. Series Article Volume 2 Issue 8 August 1997 pp 6-17. Fulltext. Click here to view fulltext PDF. Permanent link: ...

  20. Genetic Algorithm Parameter Analysis


    Ernesto, BELMONT-MORENO; Instituto de Fisica, UNAM


    The energy minimizing problem of atomic cluster configuration and the 2D spin glass problem are used for testing our genetic algorithm. It is shown to be crucial to adjust the degree of mutation and the population size for the efficiency of the algorithm.

  1. Improved fault tolerance of Turbo decoding based on optimized index assignments (United States)

    Geldmacher, J.; Götze, J.


    This paper investigates the impact of an error-prone buffer memory on a channel decoder as employed in modern digital communication systems. On one hand this work is motivated by the fact that energy efficient decoder implementations may not only be achieved by optimizations on algorithmic level, but also by chip-level modifications. One of such modifications is so called aggressive voltage scaling of buffer memories, which, while achieving reduced power consumption, also injects errors into the likelihood values used during the decoding process. On the other hand, it has been recognized that the ongoing increase of integration density with smaller structures makes integrated circuits more sensitive to process variations during manufacturing, and to voltage and temperature variations. This may lead to a paradigm shift from 100 %-reliable operation to fault tolerant signal processing. Both reasons are the motivation to discuss the required co-design of algorithms and underlying circuits. For an error-prone receive buffer of a Turbo decoder the influence of quantizer design and index assignment on the error resilience of the decoding algorithm is discussed. It is shown that a suitable design of both enables a compensation of hardware induced bits errors with rates up to 1 % without increasing the computational complexity of the decoder.

  2. Coflow routing and spectrum assignment in optical orthogonal frequency division multiplexing data center networks (United States)

    Liu, Aijun; Sun, Yongmei; Ji, Yuefeng


    The communication between data-intensive applications in data centers often involves a collection of parallel flows, usually referred to as a coflow. A coflow between two groups of machines can capture diverse communication patterns observed in data centers. The static coflow routing and spectrum assignment (CofRSA) problem in optical orthogonal frequency division multiplexed data center networks is investigated, when the coflow traffic demands are given. The static CofRSA problem considers the spectrum constraints of the flows between different coflows and those within the same coflow. We formulate the static CofRSA problem as an integer linear programming (ILP) model. The objective of the ILP model is to minimize the used spectrum slots. However, the ILP model cannot achieve an optimal solution within tolerable time for large networks. To solve the problem, two highly efficient heuristic algorithms, the most cofSize first (MCSF) ordering algorithm and the greedy inserting (GI) algorithm, are proposed to achieve suboptimal solutions. The simulation results indicate that ILP provides an optimal solution for small networks, whereas GI and MCSF yield suboptimal solutions in large networks. The results also show that GI provides more efficient solutions than MCSF.

  3. Governance by algorithms

    Directory of Open Access Journals (Sweden)

    Francesca Musiani


    Full Text Available Algorithms are increasingly often cited as one of the fundamental shaping devices of our daily, immersed-in-information existence. Their importance is acknowledged, their performance scrutinised in numerous contexts. Yet, a lot of what constitutes 'algorithms' beyond their broad definition as “encoded procedures for transforming input data into a desired output, based on specified calculations” (Gillespie, 2013 is often taken for granted. This article seeks to contribute to the discussion about 'what algorithms do' and in which ways they are artefacts of governance, providing two examples drawing from the internet and ICT realm: search engine queries and e-commerce websites’ recommendations to customers. The question of the relationship between algorithms and rules is likely to occupy an increasingly central role in the study and the practice of internet governance, in terms of both institutions’ regulation of algorithms, and algorithms’ regulation of our society.

  4. Algorithms for protein design. (United States)

    Gainza, Pablo; Nisonoff, Hunter M; Donald, Bruce R


    Computational structure-based protein design programs are becoming an increasingly important tool in molecular biology. These programs compute protein sequences that are predicted to fold to a target structure and perform a desired function. The success of a program's predictions largely relies on two components: first, the input biophysical model, and second, the algorithm that computes the best sequence(s) and structure(s) according to the biophysical model. Improving both the model and the algorithm in tandem is essential to improving the success rate of current programs, and here we review recent developments in algorithms for protein design, emphasizing how novel algorithms enable the use of more accurate biophysical models. We conclude with a list of algorithmic challenges in computational protein design that we believe will be especially important for the design of therapeutic proteins and protein assemblies. Copyright © 2016 Elsevier Ltd. All rights reserved.

  5. TSAR: a program for automatic resonance assignment using 2D cross-sections of high dimensionality, high-resolution spectra

    Energy Technology Data Exchange (ETDEWEB)

    Zawadzka-Kazimierczuk, Anna; Kozminski, Wiktor [University of Warsaw, Faculty of Chemistry (Poland); Billeter, Martin, E-mail: [University of Gothenburg, Biophysics Group, Department of Chemistry and Molecular Biology (Sweden)


    While NMR studies of proteins typically aim at structure, dynamics or interactions, resonance assignments represent in almost all cases the initial step of the analysis. With increasing complexity of the NMR spectra, for example due to decreasing extent of ordered structure, this task often becomes both difficult and time-consuming, and the recording of high-dimensional data with high-resolution may be essential. Random sampling of the evolution time space, combined with sparse multidimensional Fourier transform (SMFT), allows for efficient recording of very high dimensional spectra ({>=}4 dimensions) while maintaining high resolution. However, the nature of this data demands for automation of the assignment process. Here we present the program TSAR (Tool for SMFT-based Assignment of Resonances), which exploits all advantages of SMFT input. Moreover, its flexibility allows to process data from any type of experiments that provide sequential connectivities. The algorithm was tested on several protein samples, including a disordered 81-residue fragment of the {delta} subunit of RNA polymerase from Bacillus subtilis containing various repetitive sequences. For our test examples, TSAR achieves a high percentage of assigned residues without any erroneous assignments.

  6. Two New Tools for Glycopeptide Analysis Researchers: A Glycopeptide Decoy Generator and a Large Data Set of Assigned CID Spectra of Glycopeptides. (United States)

    Lakbub, Jude C; Su, Xiaomeng; Zhu, Zhikai; Patabandige, Milani W; Hua, David; Go, Eden P; Desaire, Heather


    The glycopeptide analysis field is tightly constrained by a lack of effective tools that translate mass spectrometry data into meaningful chemical information, and perhaps the most challenging aspect of building effective glycopeptide analysis software is designing an accurate scoring algorithm for MS/MS data. We provide the glycoproteomics community with two tools to address this challenge. The first tool, a curated set of 100 expert-assigned CID spectra of glycopeptides, contains a diverse set of spectra from a variety of glycan types; the second tool, Glycopeptide Decoy Generator, is a new software application that generates glycopeptide decoys de novo. We developed these tools so that emerging methods of assigning glycopeptides' CID spectra could be rigorously tested. Software developers or those interested in developing skills in expert (manual) analysis can use these tools to facilitate their work. We demonstrate the tools' utility in assessing the quality of one particular glycopeptide software package, GlycoPep Grader, which assigns glycopeptides to CID spectra. We first acquired the set of 100 expert assigned CID spectra; then, we used the Decoy Generator (described herein) to generate 20 decoys per target glycopeptide. The assigned spectra and decoys were used to test the accuracy of GlycoPep Grader's scoring algorithm; new strengths and weaknesses were identified in the algorithm using this approach. Both newly developed tools are freely available. The software can be downloaded at

  7. Grouping genetic algorithms advances and applications

    CERN Document Server

    Mutingi, Michael


    This book presents advances and innovations in grouping genetic algorithms, enriched with new and unique heuristic optimization techniques. These algorithms are specially designed for solving industrial grouping problems where system entities are to be partitioned or clustered into efficient groups according to a set of guiding decision criteria. Examples of such problems are: vehicle routing problems, team formation problems, timetabling problems, assembly line balancing, group maintenance planning, modular design, and task assignment. A wide range of industrial grouping problems, drawn from diverse fields such as logistics, supply chain management, project management, manufacturing systems, engineering design and healthcare, are presented. Typical complex industrial grouping problems, with multiple decision criteria and constraints, are clearly described using illustrative diagrams and formulations. The problems are mapped into a common group structure that can conveniently be used as an input scheme to spe...

  8. Using Genetic Algorithm For Winter Maintenance Operations: Multi Depot K-Chinese Postman Problem

    Directory of Open Access Journals (Sweden)

    İbrahim Zeki Akyurt


    Full Text Available In this study, the assignment and routing problem of one of Istanbul’s winter maintenance activities, salt pouring, was scrutinized. The starting point of the study considers the high cost of winter maintenance work, a shrinking assigned budget, high numbers of vehicles and streets to service that the increase in difficulty to solve the problem due to their high numbers. In this respect, the problem was modeled as multi depot k-Chinese postman problem, a type of arc routing problem. This mathematical model was solved by genetic algorithm. For comparison, the current solution, Clarke and Wright Algorithm and Sweep Algorithm were used.

  9. Low-Energy Real-Time OS Using Voltage Scheduling Algorithm for Variable Voltage Processors


    Okuma, Takanori; Yasuura, Hiroto


    This paper presents a real-time OS based on $ mu $ITRON using proposed voltage scheduling algorithm for variable voltage processors which can vary supply voltage dynamically. The proposed voltage scheduling algorithms assign voltage level for each task dynamically in order to minimize energy consumption under timing constraints. Using the presented real-time OS, running tasks with low supply voltage leads to drastic energy reduction. In addition, the presented voltage scheduling algorithm is ...

  10. Single-Sex Schools, Student Achievement, and Course Selection: Evidence from Rule-Based Student Assignments in Trinidad and Tobago. NBER Working Paper No. 16817 (United States)

    Jackson, C. Kirabo


    Existing studies on single-sex schooling suffer from biases due to student selection to schools and single-sex schools being better in unmeasured ways. In Trinidad and Tobago students are assigned to secondary schools based on an algorithm allowing one to address self-selection bias and cleanly estimate an upper-bound single-sex school effect. The…

  11. A Bayesian Assignment Method for Ambiguous Bisulfite Short Reads.

    Directory of Open Access Journals (Sweden)

    Hong Tran

    Full Text Available DNA methylation is an epigenetic modification critical for normal development and diseases. The determination of genome-wide DNA methylation at single-nucleotide resolution is made possible by sequencing bisulfite treated DNA with next generation high-throughput sequencing. However, aligning bisulfite short reads to a reference genome remains challenging as only a limited proportion of them (around 50-70% can be aligned uniquely; a significant proportion, known as multireads, are mapped to multiple locations and thus discarded from downstream analyses, causing financial waste and biased methylation inference. To address this issue, we develop a Bayesian model that assigns multireads to their most likely locations based on the posterior probability derived from information hidden in uniquely aligned reads. Analyses of both simulated data and real hairpin bisulfite sequencing data show that our method can effectively assign approximately 70% of the multireads to their best locations with up to 90% accuracy, leading to a significant increase in the overall mapping efficiency. Moreover, the assignment model shows robust performance with low coverage depth, making it particularly attractive considering the prohibitive cost of bisulfite sequencing. Additionally, results show that longer reads help improve the performance of the assignment model. The assignment model is also robust to varying degrees of methylation and varying sequencing error rates. Finally, incorporating prior knowledge on mutation rate and context specific methylation level into the assignment model increases inference accuracy. The assignment model is implemented in the BAM-ABS package and freely available at

  12. Semantic Based Cluster Content Discovery in Description First Clustering Algorithm

    Directory of Open Access Journals (Sweden)



    Full Text Available In the field of data analytics grouping of like documents in textual data is a serious problem. A lot of work has been done in this field and many algorithms have purposed. One of them is a category of algorithms which firstly group the documents on the basis of similarity and then assign the meaningful labels to those groups. Description first clustering algorithm belong to the category in which the meaningful description is deduced first and then relevant documents are assigned to that description. LINGO (Label Induction Grouping Algorithm is the algorithm of description first clustering category which is used for the automatic grouping of documents obtained from search results. It uses LSI (Latent Semantic Indexing; an IR (Information Retrieval technique for induction of meaningful labels for clusters and VSM (Vector Space Model for cluster content discovery. In this paper we present the LINGO while it is using LSI during cluster label induction and cluster content discovery phase. Finally, we compare results obtained from the said algorithm while it uses VSM and Latent semantic analysis during cluster content discovery phase.

  13. Algorithms in Singular

    Directory of Open Access Journals (Sweden)

    Hans Schonemann


    Full Text Available Some algorithms for singularity theory and algebraic geometry The use of Grobner basis computations for treating systems of polynomial equations has become an important tool in many areas. This paper introduces of the concept of standard bases (a generalization of Grobner bases and the application to some problems from algebraic geometry. The examples are presented as SINGULAR commands. A general introduction to Grobner bases can be found in the textbook [CLO], an introduction to syzygies in [E] and [St1]. SINGULAR is a computer algebra system for computing information about singularities, for use in algebraic geometry. The basic algorithms in SINGULAR are several variants of a general standard basis algorithm for general monomial orderings (see [GG]. This includes wellorderings (Buchberger algorithm ([B1], [B2] and tangent cone orderings (Mora algorithm ([M1], [MPT] as special cases: It is able to work with non-homogeneous and homogeneous input and also to compute in the localization of the polynomial ring in 0. Recent versions include algorithms to factorize polynomials and a factorizing Grobner basis algorithm. For a complete description of SINGULAR see [Si].

  14. A New Modified Firefly Algorithm

    Directory of Open Access Journals (Sweden)

    Medha Gupta


    Full Text Available Nature inspired meta-heuristic algorithms studies the emergent collective intelligence of groups of simple agents. Firefly Algorithm is one of the new such swarm-based metaheuristic algorithm inspired by the flashing behavior of fireflies. The algorithm was first proposed in 2008 and since then has been successfully used for solving various optimization problems. In this work, we intend to propose a new modified version of Firefly algorithm (MoFA and later its performance is compared with the standard firefly algorithm along with various other meta-heuristic algorithms. Numerical studies and results demonstrate that the proposed algorithm is superior to existing algorithms.

  15. RNA-PAIRS: RNA probabilistic assignment of imino resonance shifts

    Energy Technology Data Exchange (ETDEWEB)

    Bahrami, Arash; Clos, Lawrence J.; Markley, John L.; Butcher, Samuel E. [National Magnetic Resonance Facility at Madison (United States); Eghbalnia, Hamid R., E-mail: [University of Cincinnati, Department of Molecular and Cellular Physiology (United States)


    The significant biological role of RNA has further highlighted the need for improving the accuracy, efficiency and the reach of methods for investigating RNA structure and function. Nuclear magnetic resonance (NMR) spectroscopy is vital to furthering the goals of RNA structural biology because of its distinctive capabilities. However, the dispersion pattern in the NMR spectra of RNA makes automated resonance assignment, a key step in NMR investigation of biomolecules, remarkably challenging. Herein we present RNA Probabilistic Assignment of Imino Resonance Shifts (RNA-PAIRS), a method for the automated assignment of RNA imino resonances with synchronized verification and correction of predicted secondary structure. RNA-PAIRS represents an advance in modeling the assignment paradigm because it seeds the probabilistic network for assignment with experimental NMR data, and predicted RNA secondary structure, simultaneously and from the start. Subsequently, RNA-PAIRS sets in motion a dynamic network that reverberates between predictions and experimental evidence in order to reconcile and rectify resonance assignments and secondary structure information. The procedure is halted when assignments and base-parings are deemed to be most consistent with observed crosspeaks. The current implementation of RNA-PAIRS uses an initial peak list derived from proton-nitrogen heteronuclear multiple quantum correlation ({sup 1}H-{sup 15}N 2D HMQC) and proton-proton nuclear Overhauser enhancement spectroscopy ({sup 1}H-{sup 1}H 2D NOESY) experiments. We have evaluated the performance of RNA-PAIRS by using it to analyze NMR datasets from 26 previously studied RNAs, including a 111-nucleotide complex. For moderately sized RNA molecules, and over a range of comparatively complex structural motifs, the average assignment accuracy exceeds 90%, while the average base pair prediction accuracy exceeded 93%. RNA-PAIRS yielded accurate assignments and base pairings consistent with imino

  16. Reflective practice: assessment of assignments in English for Specific Purposes

    Directory of Open Access Journals (Sweden)

    Galina Kavaliauskiené


    Full Text Available The construct alternative assessment has been widely used in higher education. It is often defined as any type of assessment of learners who provide a response to an assignment. The key features of alternative assessment are active participation of learners in self-evaluation of their performance, and the development of reflective thinking through reflective thinking (Schön, 1983. The success of alternative assessment in language teaching is predetermined by student’s performance and demonstrates learner’s language proficiency in contemporary communicative classrooms. This paper aims at researching the influence of students’ evaluations of various assignments for their linguistic development in English for Specific Purposes (ESP. The study uses learners’ assessment of different assignments and learners’ in-course and post-course written reflections on benefits to language mastery. Learners’ assignments included were contributions to portfolios (dossiers, such as essays and summaries, oral presentations, short impromptu talks, creative tasks, tests, and self-assessment notes (reflections on activities in learning ESP. Findings were obtained for two streams of the project participants. Results showed that self-assessment was beneficial for learners’ linguistic development. The context of learners’ reflections reveals that the attitudes to various assignments are affected by success or failure in students’ performance. Reflective practice might help teachers develop ways of dealing with previously identified difficulties and improve the quality of teaching.

  17. Wildlife forensic science: A review of genetic geographic origin assignment. (United States)

    Ogden, Rob; Linacre, Adrian


    Wildlife forensic science has become a key means of enforcing legislation surrounding the illegal trade in protected and endangered species. A relatively new dimension to this area of forensic science is to determine the geographic origin of a seized sample. This review focuses on DNA testing, which relies on assignment of an unknown sample to its genetic population of origin. Key examples of this are the trade in timber, fish and ivory and these are used only to illustrate the large number of species for which this type of testing is potentially available. The role of mitochondrial and nuclear DNA markers is discussed, alongside a comparison of neutral markers with those exhibiting signatures of selection, which potentially offer much higher levels of assignment power to address specific questions. A review of assignment tests is presented along with detailed methods for evaluating error rates and considerations for marker selection. The availability and quality of reference data are of paramount importance to support assignment applications and ensure reliability of any conclusions drawn. The genetic methods discussed have been developed initially as investigative tools but comment is made regarding their use in courts. The potential to compliment DNA markers with elemental assays for greater assignment power is considered and finally recommendations are made for the future of this type of testing. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

  18. The Utility of Writing Assignments in Undergraduate Bioscience (United States)

    Libarkin, Julie; Ording, Gabriel


    We tested the hypothesis that engagement in a few, brief writing assignments in a nonmajors science course can improve student ability to convey critical thought about science. A sample of three papers written by students (n = 30) was coded for presence and accuracy of elements related to scientific writing. Scores for different aspects of scientific writing were significantly correlated, suggesting that students recognized relationships between components of scientific thought. We found that students' ability to write about science topics and state conclusions based on data improved over the course of three writing assignments, while the abilities to state a hypothesis and draw clear connections between human activities and environmental impacts did not improve. Three writing assignments generated significant change in student ability to write scientifically, although our results suggest that three is an insufficient number to generate complete development of scientific writing skills. PMID:22383616

  19. The utility of writing assignments in undergraduate bioscience. (United States)

    Libarkin, Julie; Ording, Gabriel


    We tested the hypothesis that engagement in a few, brief writing assignments in a nonmajors science course can improve student ability to convey critical thought about science. A sample of three papers written by students (n = 30) was coded for presence and accuracy of elements related to scientific writing. Scores for different aspects of scientific writing were significantly correlated, suggesting that students recognized relationships between components of scientific thought. We found that students' ability to write about science topics and state conclusions based on data improved over the course of three writing assignments, while the abilities to state a hypothesis and draw clear connections between human activities and environmental impacts did not improve. Three writing assignments generated significant change in student ability to write scientifically, although our results suggest that three is an insufficient number to generate complete development of scientific writing skills.

  20. Neural reactivations during sleep determine network credit assignment. (United States)

    Gulati, Tanuj; Guo, Ling; Ramanathan, Dhakshin S; Bodepudi, Anitha; Ganguly, Karunesh


    A fundamental goal of motor learning is to establish the neural patterns that produce a desired behavioral outcome. It remains unclear how and when the nervous system solves this 'credit assignment' problem. Using neuroprosthetic learning, in which we could control the causal relationship between neurons and behavior, we found that sleep-dependent processing was required for credit assignment and the establishment of task-related functional connectivity reflecting the casual neuron-behavior relationship. Notably, we observed a strong link between the microstructure of sleep reactivations and credit assignment, with downscaling of non-causal activity. Decoupling of spiking to slow oscillations using optogenetic methods eliminated rescaling. Thus, our results suggest that coordinated firing during sleep is essential for establishing sparse activation patterns that reflect the causal neuron-behavior relationship.

  1. Lexical stress assignment as a problem of probabilistic inference. (United States)

    Jouravlev, Olessia; Lupker, Stephen J


    A new conceptualization of the process of stress assignment, couched in the principles of (Bayesian) probabilistic inference, is introduced in this paper. According to this approach, in deciding where to place stress in a polysyllabic word, a reader estimates the posterior probabilities of alternative stress patterns. This estimation is accomplished by adjusting a prior belief about the likelihoods of alternative stress patterns (derived from experience with the distribution of stress patterns in the language) by using lexical and non-lexical sources of evidence for stress derived from the orthographic input. The proposed theoretical framework was used to compute probabilities of stress patterns for Russian disyllabic words and nonwords which were then compared with the performance of readers. The results showed that the estimated probabilities of stress patterns were reflective of actual stress assignment performance and of naming latencies, suggesting that the mechanisms that are involved in the process of stress assignment might indeed be inferentially-based.

  2. Task Assignment Heuristics for Parallel and Distributed CFD Applications (United States)

    Lopez-Benitez, Noe; Djomehri, M. Jahed; Biswas, Rupak


    This paper proposes a task graph (TG) model to represent a single discrete step of multi-block overset grid computational fluid dynamics (CFD) applications. The TG model is then used to not only balance the computational workload across the overset grids but also to reduce inter-grid communication costs. We have developed a set of task assignment heuristics based on the constraints inherent in this class of CFD problems. Two basic assignments, the smallest task first (STF) and the largest task first (LTF), are first presented. They are then systematically costs. To predict the performance of the proposed task assignment heuristics, extensive performance evaluations are conducted on a synthetic TG with tasks defined in terms of the number of grid points in predetermined overlapping grids. A TG derived from a realistic problem with eight million grid points is also used as a test case.

  3. Optimal assignment of incoming flights to baggage carousels at airports

    DEFF Research Database (Denmark)

    Barth, Torben C.

    The problem considered in this report is an assignment problem occurring at airports. This problem concerns the assignment of baggage carousels in baggage claim halls to arriving aircraft (baggage carousel assignment problem). This is a highly dynamic problem since disruptions frequently occur...... during operations. We introduce a basic static model that can be adapted to the layout of different airports. Afterwards we show how a decision support system based on a MIP-model can be designed in a dynamic real world environment. The system supports the decisions of the dispatcher during daily...... operations. Computational results for a real world problem at Frankfurt Airport are presented. At Frankfurt Airport the suggested solution method was successfully implemented and is running now for over half an year. The experiences show that the system increases the quality of the dispatching process...

  4. Treatment allocation in hepatocellular carcinoma: Assessment of the BCLC algorithm. (United States)

    Richani, Mandy; Kolly, Philippe; Knoepfli, Marina; Herrmann, Evelyn; Zweifel, Martin; von Tengg-Kobligk, Hendrik; Candinas, Daniel; Dufour, Jean-François


    The Barcelona Clinic Liver Cancer (BCLC) staging system is the algorithm most widely used to manage patients with hepatocellular carcinoma (HCC). We aimed to investigate the extent to which the BCLC recommendations effectively guide clinical practice and assess the reasons for any deviation from the recommendations. The first-line treatments assigned to patients included in the prospective Bern HCC cohort were analyzed. Among 223 patients included in the cohort, 116 were not treated according to the BCLC algorithm. Eighty percent of the patients in BCLC stage 0 (very early HCC) and 60% of the patients in BCLC stage A (early HCC) received recommended curative treatment. Only 29% of the BCLC stage B patients (intermediate HCC) and 33% of the BCLC stage C patients (advanced HCC) were treated according to the algorithm. Eighty-nine percent of the BCLC stage D patients (terminal HCC) were treated with best supportive care, as recommended. In 98 patients (44%) the performance status was disregarded in the stage assignment. The management of HCC in clinical practice frequently deviates from the BCLC recommendations. Most of the curative therapy options, which have well-defined selection criteria, were allocated according to the recommendations, while the majority of the palliative therapy options were assigned to patients with tumor stages not aligned with the recommendations. The only parameter which is subjective in the algorithm, the performance status, is also the least respected.

  5. Recursive forgetting algorithms

    DEFF Research Database (Denmark)

    Parkum, Jens; Poulsen, Niels Kjølstad; Holst, Jan


    In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied to a sp...... to a specific algorithm with selective forgetting. Here, the forgetting is non-uniform in time and space. The theoretical analysis is supported by a simulation example demonstrating the practical performance of this algorithm......In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied...

  6. Unsupervised learning algorithms

    CERN Document Server

    Aydin, Kemal


    This book summarizes the state-of-the-art in unsupervised learning. The contributors discuss how with the proliferation of massive amounts of unlabeled data, unsupervised learning algorithms, which can automatically discover interesting and useful patterns in such data, have gained popularity among researchers and practitioners. The authors outline how these algorithms have found numerous applications including pattern recognition, market basket analysis, web mining, social network analysis, information retrieval, recommender systems, market research, intrusion detection, and fraud detection. They present how the difficulty of developing theoretically sound approaches that are amenable to objective evaluation have resulted in the proposal of numerous unsupervised learning algorithms over the past half-century. The intended audience includes researchers and practitioners who are increasingly using unsupervised learning algorithms to analyze their data. Topics of interest include anomaly detection, clustering,...

  7. Diagnostic Algorithm Benchmarking (United States)

    Poll, Scott


    A poster for the NASA Aviation Safety Program Annual Technical Meeting. It describes empirical benchmarking on diagnostic algorithms using data from the ADAPT Electrical Power System testbed and a diagnostic software framework.

  8. Quantum algorithmic information theory


    Svozil, Karl


    The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. The theory of quantum computation will be based upon a model of universal quantum computer whose elementary unit is a two-port interferometer capa...

  9. Optimization algorithms and applications

    CERN Document Server

    Arora, Rajesh Kumar


    Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc

  10. Image Segmentation Algorithms Overview


    Yuheng, Song; Hao, Yan


    The technology of image segmentation is widely used in medical image processing, face recognition pedestrian detection, etc. The current image segmentation techniques include region-based segmentation, edge detection segmentation, segmentation based on clustering, segmentation based on weakly-supervised learning in CNN, etc. This paper analyzes and summarizes these algorithms of image segmentation, and compares the advantages and disadvantages of different algorithms. Finally, we make a predi...

  11. Genetic algorithm in chemistry.


    da Costa, PA; Poppi, RJ


    Genetic algorithm is an optimization technique based on Darwin evolution theory. In last years its application in chemistry is increasing significantly due the special characteristics for optimization of complex systems. The basic principles and some further modifications implemented to improve its performance are presented, as well as a historical development. A numerical example of a function optimization is also shown to demonstrate how the algorithm works in an optimization process. Final...

  12. Adaptive Genetic Algorithm


    Jakobović, Domagoj; Golub, Marin


    In this paper we introduce an adaptive, 'self-contained' genetic algorithm (GA) with steady-state selection. This variant of GA utilizes empirically based methods for calculating its control parameters. The adaptive algorithm estimates the percentage of the population to be replaced with new individuals (generation gap). It chooses the solutions for crossover and varies the number of mutations, ail regarding the current population state. The state of the population is evaluated by observing s...

  13. Fluid Genetic Algorithm (FGA)


    Jafari-Marandi, Ruholla; Smith, Brian K.


    Genetic Algorithm (GA) has been one of the most popular methods for many challenging optimization problems when exact approaches are too computationally expensive. A review of the literature shows extensive research attempting to adapt and develop the standard GA. Nevertheless, the essence of GA which consists of concepts such as chromosomes, individuals, crossover, mutation, and others rarely has been the focus of recent researchers. In this paper method, Fluid Genetic Algorithm (FGA), some ...

  14. Algorithmic Relative Complexity


    Daniele Cerra; Mihai Datcu


    Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively. The definition of several entities in Kolmogorov’s framework relies upon ideas from classical information theory, and these two approaches share many common traits. In this work, we expand the relations between these two frameworks by introducing algorithmic cross-complexity ...

  15. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks

    Directory of Open Access Journals (Sweden)

    Enrique de la Hoz


    Full Text Available Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.

  16. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks (United States)

    de la Hoz, Enrique; Gimenez-Guzman, Jose Manuel; Marsa-Maestre, Ivan; Orden, David


    Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them. PMID:26610512

  17. Intermodulation interference-minimum frequency assignment for satellite SCPC systems (United States)

    Okinaka, H.; Yasuda, Y.; Hirata, Y.


    This paper addresses frequency assignment for single-level and multilevel SCPC systems. In order to obtain the optimum channel allocation, where the influence of intermodulation noise on carriers is minimized, a practical and effective method is proposed. The quasi-optimum solutions obtained with the proposed method are presented for single-level SCPC systems, showing their advantage in intermodulation noise reduction. Concerning frequency assignment for multilevel SCPC systems, two strategies to realize the quasi-optimum channel allocation are compared with regard to the improvement in carrier-to-intermodulation noise power ratio. The performance of the obtained channel allocation indicates the effectiveness of the proposed optimization method.

  18. Evoked Feelings, Assigned Meanings and Constructed Knowledge Based on Mistakes

    Directory of Open Access Journals (Sweden)

    Luciane Guimarães Batistella Bianchini


    Full Text Available By means of Piaget's critical clinical method, the study investigated the meanings assigned to mistakes by four students in different activities and interactive situations. The research also analyzed the results of using self-regulatory situations in understanding mistakes initially committed by the students. Data collection instruments consisted of games, video recordings, diaries and interviews. Following intervention, the students were able to recognize their competence, establish positive interactions within the group, and avoid viewing mistakes as obstacles to learning. We concluded that the meanings assigned to mistakes depend on certain variables, among them feelings nurtured by the individuals about themselves, the other, and the object of knowledge.

  19. An Enhanced Dynamic User Optimal Passenger Flow Assignment Model for Metro Networks

    Directory of Open Access Journals (Sweden)

    Hanchuan Pan


    Full Text Available By considering the difference between a car driver’s route choice behavior on the road and a passenger’s route choice behavior in urban rail transit (URT, this paper proposes an enhanced Dynamic User Optimal (DUO passenger flow assignment model for metro networks. To capture realistic URT phenomena, the model has integrated the train operation disturbance constraint. Real passenger and train data are used to verify the proposed model and algorithm. The results indicate that the DUO-based model is more suitable for describing passenger route choice behavior under uncertain conditions compared to a static model. Moreover, this paper found that passengers under oversaturated conditions are more sensitive to train operation disturbances compared to undersaturated passengers.

  20. RFID Location Algorithm

    Directory of Open Access Journals (Sweden)

    Wang Zi Min


    Full Text Available With the development of social services, people’s living standards improve further requirements, there is an urgent need for a way to adapt to the complex situation of the new positioning technology. In recent years, RFID technology have a wide range of applications in all aspects of life and production, such as logistics tracking, car alarm, security and other items. The use of RFID technology to locate, it is a new direction in the eyes of the various research institutions and scholars. RFID positioning technology system stability, the error is small and low-cost advantages of its location algorithm is the focus of this study.This article analyzes the layers of RFID technology targeting methods and algorithms. First, RFID common several basic methods are introduced; Secondly, higher accuracy to political network location method; Finally, LANDMARC algorithm will be described. Through this it can be seen that advanced and efficient algorithms play an important role in increasing RFID positioning accuracy aspects.Finally, the algorithm of RFID location technology are summarized, pointing out the deficiencies in the algorithm, and put forward a follow-up study of the requirements, the vision of a better future RFID positioning technology.

  1. SPHINX--an algorithm for taxonomic binning of metagenomic sequences. (United States)

    Mohammed, Monzoorul Haque; Ghosh, Tarini Shankar; Singh, Nitin Kumar; Mande, Sharmila S


    Compared with composition-based binning algorithms, the binning accuracy and specificity of alignment-based binning algorithms is significantly higher. However, being alignment-based, the latter class of algorithms require enormous amount of time and computing resources for binning huge metagenomic datasets. The motivation was to develop a binning approach that can analyze metagenomic datasets as rapidly as composition-based approaches, but nevertheless has the accuracy and specificity of alignment-based algorithms. This article describes a hybrid binning approach (SPHINX) that achieves high binning efficiency by utilizing the principles of both 'composition'- and 'alignment'-based binning algorithms. Validation results with simulated sequence datasets indicate that SPHINX is able to analyze metagenomic sequences as rapidly as composition-based algorithms. Furthermore, the binning efficiency (in terms of accuracy and specificity of assignments) of SPHINX is observed to be comparable with results obtained using alignment-based algorithms. A web server for the SPHINX algorithm is available at

  2. Dynamic Subchannel Assignment-Based Cross-Layer MAC and Network Protocol for Multihop Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Khanh Nguyen Quang


    Full Text Available The paper presents a dynamic subchannel assignment algorithm based on orthogonal frequency division multiple access technology operating in the time division duplexing and a new cross-layer design based on a proposed routing protocol jointed with the MAC protocol. The proposed dynamic sub-channel assignment algorithm provides a new interference avoidance mechanism which solves several drawbacks of existing radio resource allocation techniques in wireless networks using OFDMA/TDD, such as the hidden node and exposed node problems, mobility, and cochannels interference in frequency (CCI. Besides, in wireless networks, when a route is established, the radio resource allocation problems may decrease the end to end performance proportionally with the length of each route. The contention at MAC layer may cause the routing protocol at network layer to respond by finding new routes and routing table updates. The proposed routing protocol is jointed with the MAC protocol based on dynamic sub-channel assignment to ensure that the quality of service in multihop ad hoc networks is significantly improved.

  3. Display of scientific data structures for algorithm visualization (United States)

    Hibbard, William; Dyer, Charles R.; Paul, Brian


    We present a technique for defining graphical depictions for all the data types defined in an algorithm. The ability to display arbitrary combinations of an algorithm's data objects in a common frame of reference, coupled with interactive control of algorithm execution, provides a powerful way to understand algorithm behavior. Type definitions are constrained so that all primitive values occurring in data objects are assigned scalar types. A graphical display, including user interaction with the display, is modeled by a special data type. Mappings from the scalar types into the display model type provide a simple user interface for controlling how all data types are depicted, without the need for type-specific graphics logic.

  4. A Bi-Level Optimization Model for Grouping Constrained Storage Location Assignment Problems. (United States)

    Xie, Jing; Mei, Yi; Ernst, Andreas T; Li, Xiaodong; Song, Andy


    In this paper, a novel bi-level grouping optimization (BIGO) model is proposed for solving the storage location assignment problem with grouping constraint (SLAP-GC). A major challenge in this problem is the grouping constraint which restricts the number of groups each product can have and the locations of items in the same group. In SLAP-GC, the problem consists of two subproblems, one is how to group the items, and the other one is how to assign the groups to locations. It is an arduous task to solve the two subproblems simultaneously. To overcome this difficulty, we propose a BIGO. BIGO optimizes item grouping in the upper level, and uses the lower-level optimization to evaluate each item grouping. Sophisticated fitness evaluation and search operators are designed for both upper and lower level optimization so that the feasibility of solutions can be guaranteed, and the search can focus on promising areas in the search space. Based on the BIGO model, a multistart random search method and a tabu algorithm are proposed. The experimental results on the real-world dataset validate the efficacy of the BIGO model and the advantage of the tabu method over the random search method.

  5. Assigning sequences to species in the absence of large interspecific differences. (United States)

    Lou, Melanie; Golding, G Brian


    Barcoding is an initiative to define a standard fragment of DNA to be used to assign unknown sequences to existing known species groups that have been pre-identified externally (by a taxonomist). Several methods have been described that attempt to place this assignment into a Bayesian statistical framework. Here we describe an algorithm that makes use of segregating sites and we examine how well these methods perform in the absence of an interspecific 'barcoding gap'. When a barcoding gap exists, that is when the data are clearly delimited, most methods perform well. Here we have used data from the Drosophila genus because this genus includes sibling species and the species relationships within this species while complex are, arguably, better understood than in any other group. The results show that the Bayesian methods perform well even in the absence of a barcoding gap. The sequences from Drosophila are correctly identified and only when the degree of incomplete lineage sorting is extreme in simulations or within the Drosophila species, do they fail in their identifications and even then, the "correct" species has a high posterior probability. Copyright 2010 Elsevier Inc. All rights reserved.

  6. Toward efficient task assignment and motion planning for large-scale underwater missions

    Directory of Open Access Journals (Sweden)

    Somaiyeh MahmoudZadeh


    Full Text Available An autonomous underwater vehicle needs to possess a certain degree of autonomy for any particular underwater mission to fulfil the mission objectives successfully and ensure its safety in all stages of the mission in a large-scale operating field. In this article, a novel combinatorial conflict-free task assignment strategy, consisting of an interactive engagement of a local path planner and an adaptive global route planner, is introduced. The method takes advantage of the heuristic search potency of the particle swarm optimization algorithm to address the discrete nature of routing-task assignment approach and the complexity of nondeterministic polynomial-time-hard path planning problem. The proposed hybrid method is highly efficient as a consequence of its reactive guidance framework that guarantees successful completion of missions particularly in cluttered environments. To examine the performance of the method in a context of mission productivity, mission time management, and vehicle safety, a series of simulation studies are undertaken. The results of simulations declare that the proposed method is reliable and robust, particularly in dealing with uncertainties, and it can significantly enhance the level of a vehicle’s autonomy by relying on its reactive nature and capability of providing fast feasible solutions.

  7. A hardware-algorithm co-design approach to optimize seizure detection algorithms for implantable applications. (United States)

    Raghunathan, Shriram; Gupta, Sumeet K; Markandeya, Himanshu S; Roy, Kaushik; Irazoqui, Pedro P


    Implantable neural prostheses that deliver focal electrical stimulation upon demand are rapidly emerging as an alternate therapy for roughly a third of the epileptic patient population that is medically refractory. Seizure detection algorithms enable feedback mechanisms to provide focally and temporally specific intervention. Real-time feasibility and computational complexity often limit most reported detection algorithms to implementations using computers for bedside monitoring or external devices communicating with the implanted electrodes. A comparison of algorithms based on detection efficacy does not present a complete picture of the feasibility of the algorithm with limited computational power, as is the case with most battery-powered applications. We present a two-dimensional design optimization approach that takes into account both detection efficacy and hardware cost in evaluating algorithms for their feasibility in an implantable application. Detection features are first compared for their ability to detect electrographic seizures from micro-electrode data recorded from kainate-treated rats. Circuit models are then used to estimate the dynamic and leakage power consumption of the compared features. A score is assigned based on detection efficacy and the hardware cost for each of the features, then plotted on a two-dimensional design space. An optimal combination of compared features is used to construct an algorithm that provides maximal detection efficacy per unit hardware cost. The methods presented in this paper would facilitate the development of a common platform to benchmark seizure detection algorithms for comparison and feasibility analysis in the next generation of implantable neuroprosthetic devices to treat epilepsy. Copyright © 2010 Elsevier B.V. All rights reserved.

  8. Concept Maps as Cognitive Visualizations of Writing Assignments (United States)

    Villalon, Jorge; Calvo, Rafael A.


    Writing assignments are ubiquitous in higher education. Writing develops not only communication skills, but also higher-level cognitive processes that facilitate deep learning. Cognitive visualizations, such as concept maps, can also be used as part of learning activities including as a form of scaffolding, or to trigger reflection by making…

  9. Designing Effective Classroom Assignments: Intellectual Work Worth Sharing (United States)

    Hutchings, Pat; Jankowski, Natasha A.; Schultz, Kathryn E.


    The National Institute for Learning Outcomes Assessment's (NILOA's) online library of faculty-created assignments that both produce and demonstrate learning makes pedagogical work visible and available for colleagues to learn from, build on, and reward. This online library allows faculty to collaborate in sharing, critiquing, and improving…

  10. 24 CFR 236.535 - Effect of assignment of mortgage. (United States)



  11. Evaluating an Earlybird Scheme: Encouraging Early Assignment Writing and Revising (United States)

    Unsworth, Kerrie; Kauter, Katherine


    It is widely suggested that feedback on assignments is useful to students' learning, however, little research has examined how this feedback may be provided in large classes or the actual effects of such a scheme. We designed and implemented a voluntary "earlybird scheme" that provided detailed feedback to undergraduate Business students on a…

  12. Robust flight-to-gate assignment using flight presence probabilities

    NARCIS (Netherlands)

    van Schaijk, Oscar R.P.; Visser, H.G.


    In this paper we present a novel method to improve the robustness of solutions to the Flight-to-Gate Assignment Problem (FGAP), with the aim to reduce the need for gate re-planning due to unpredicted flight schedule disturbances in the daily operations at an airport. We propose an approach in

  13. Nursing Distance Learning Course Comparison of Assignments and Examination Scores (United States)

    Mundine, Jennifer


    Nursing programs have embraced distance learning in their curricula, but discussion is ongoing about course assignments and grading criteria to increase examination scores in nursing distance learning courses. Because course examinations are a predictor of success on the postgraduate licensing examination (NCLEX-RN), the purpose of this study was…

  14. Using Clouds for MapReduce Measurement Assignments (United States)

    Rabkin, Ariel; Reiss, Charles; Katz, Randy; Patterson, David


    We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services and the standard Hadoop API. Using the standard API, students directly experienced the quality of industrial big-data tools. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware,…

  15. Comparing Organic vs. Assigned UAV Support to the Maneuver Company (United States)


    hovering or perching capability. Overall, no advantage. d Survivability: likelihood of avoiding destruction by enemy action Even Against small arms... Gerald J. Lieberman. Introduction to Operations Research, 7th ed. 2001. New York, NY: McGraw-Hill. Comparing Organic vs. Assigned UAV Support

  16. Python Source Code Plagiarism Attacks on Introductory Programming Course Assignments (United States)

    Karnalim, Oscar


    This paper empirically enlists Python plagiarism attacks that have been found on Introductory Programming course assignments for undergraduate students. According to our observation toward 400 plagiarism-suspected cases, there are 35 plagiarism attacks that have been conducted by students. It starts with comment & whitespace modification as…

  17. 48 CFR 1511.011-74 - Work assignments. (United States)


    ... insert the contract clause at 1552.211-74, Work Assignments, in cost-reimbursement type term form...), and Sample Management Office (SMO) contracts), the Contracting Officer shall use the clause with... of records that may be searched for certification purposes. Alternate II shall be used for...

  18. Role of magnetic resonance imaging in assigning sex in an ...

    African Journals Online (AJOL)

    A three years old child with ambiguous genitalia since birth had been referred to Muhimbili National Hospital (MNH),a tertiary referral hospital, in order to be evaluated and assigned sex correctly. Due to periphery location of the referring center, social and economic constraints, the child was not presented earlier. Physical ...

  19. A storage assignment model for batch preparation in process industries

    NARCIS (Netherlands)

    Ashayeri, J.; Selen, W.


    Purpose – The purpose of this paper is to develop new model formulation for reducing the workload in pre‐batching at a manufacturer of flavors and fragrances, by optimally assigning ingredients to different storage types, taking into account past usage of ingredients and several restrictions about

  20. 37 CFR 1.46 - Assigned inventions and patents. (United States)


    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Assigned inventions and patents. 1.46 Section 1.46 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES National Processing Provisions Who May Apply...

  1. 48 CFR 3042.202 - Assignment of contract administration. (United States)


    ... 48 Federal Acquisition Regulations System 7 2010-10-01 2010-10-01 false Assignment of contract administration. 3042.202 Section 3042.202 Federal Acquisition Regulations System DEPARTMENT OF HOMELAND SECURITY, HOMELAND SECURITY ACQUISITION REGULATION (HSAR) CONTRACT MANAGEMENT CONTRACT ADMINISTRATION AND AUDIT SERVICES Contract Administration...

  2. SKU assignment to unidirectional picking lines using correlations ...

    African Journals Online (AJOL)

    Once all the orders for a wave are completed a new mutually exclusive set of SKUs are brought to the picking line for a new wave. SKUs which dier only in size classication, for example small, medium and large shirts, are grouped together into distributions (DBNs) and must be picked in the same wave. The assignment of ...

  3. 47 CFR 22.567 - Technical channel assignment criteria. (United States)


    ... Section 22.567 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES... assignments to be made in a manner such that BETRS communications are protected from interference caused by... meters p is the radial ERP in Watts (1) Whenever the actual HAAT is less than 30 meters (98 feet), 30...

  4. Assignment of circadian function for the Neurospora clock gene frequency

    NARCIS (Netherlands)

    Merrow, Martha; Brunner, Michael; Roenneberg, Till


    Circadian clocks consist of three elements: entrainment pathways (inputs), the mechanism generating the rhythmicity (oscillator), and the output pathways that control the circadian rhythms. It is difficult to assign molecular clock components to any one of these elements. Experiments show that




  6. Towards Next Generation Rubrics: An Automated Assignment Feedback System

    Directory of Open Access Journals (Sweden)

    Nilupulee Nathawitharana


    Full Text Available As the use of blended learning environments and digital technologies become integrated into the higher education sector, rich technologies such as analytics have shown promise in facilitating teaching and learning. One popular application of analytics is Automated Writing Evaluation (AWE systems. Such systems can be used in a formative way; for example, by providing students with feedback on digitally submitted assignments. This paper presents work on the development of an AWE software tool for an Australian university using advanced text analytics techniques. The tool was designed to provide students with timely feedback on their initial assignment drafts, for revision and further improvement. Moreover, it could also assist academics in better understanding students’ assignment performance so as to inform future teaching activities. The paper provides details on the methodology used for development of the software, and presents the results obtained from the analysis of text-based assignments submitted in two subjects. The results are discussed, highlighting how the tool can provide practical value, followed by insights into existing challenges and possible future directions.

  7. Mining Staff Assignment Rules from Event-Based Data

    NARCIS (Netherlands)

    Ly, L.T.; Rinderle, S.B.; Dadam, P.; Reichert, M.U.


    Process mining offers methods and techniques for capturing process behaviour from log data of past process executions. Although many promising approaches on mining the control flow have been published, no attempt has been made to mine the staff assignment situation of business processes. In this

  8. 28 CFR 544.74 - Work assignment limitations. (United States)


    ... appointment and promotion apply to all inmates, including those exempted from required participation in the... incentive pay position. (3) If labor force needs require, an inmate who does not meet the literacy requirement may be assigned to an industrial non-graded incentive pay position if the inmate is simultaneously...

  9. Error treatment in students' written assignments in Discourse Analysis

    African Journals Online (AJOL)

    ... is generally no consensus on how lecturers should treat students' errors in written assignments, observations in this study enabled the researcher to provide certain strategies that lecturers can adopt. Key words: Error treatment; error handling; corrective feedback, positive cognitive feedback; negative cognitive feedback; ...

  10. Augmenting superpopulation capture-recapture models with population assignment data (United States)

    Wen, Zhi; Pollock, Kenneth; Nichols, James; Waser, Peter


    Ecologists applying capture-recapture models to animal populations sometimes have access to additional information about individuals' populations of origin (e.g., information about genetics, stable isotopes, etc.). Tests that assign an individual's genotype to its most likely source population are increasingly used. Here we show how to augment a superpopulation capture-recapture model with such information. We consider a single superpopulation model without age structure, and split each entry probability into separate components due to births in situ and immigration. We show that it is possible to estimate these two probabilities separately. We first consider the case of perfect information about population of origin, where we can distinguish individuals born in situ from immigrants with certainty. Then we consider the more realistic case of imperfect information, where we use genetic or other information to assign probabilities to each individual's origin as in situ or outside the population. We use a resampling approach to impute the true population of origin from imperfect assignment information. The integration of data on population of origin with capture-recapture data allows us to determine the contributions of immigration and in situ reproduction to the growth of the population, an issue of importance to ecologists. We illustrate our new models with capture-recapture and genetic assignment data from a population of banner-tailed kangaroo rats Dipodomys spectabilis in Arizona.

  11. Single Assignment C (SAC): High Productivity meets High Performance

    NARCIS (Netherlands)

    Grelck, C.; Zsók, V.; Horváth, Z.; Plasmeijer, R.


    We present the ins and outs of the purely functional, data parallel programming language SaC (Single Assignment C). SaC defines state- and side-effect-free semantics on top of a syntax resembling that of imperative languages like C/C++/C# or Java: functional programming with curly brackets. In

  12. A multiobjective approach towards weapon assignment in a ground ...

    African Journals Online (AJOL)

    The conditions under which human operators have to propose assignments of weapon systems to engage these aircraft are severely stressful since time is a critical factor and there is no room for error. Some progress has already been made with respect to the design of computerised threat evaluation and weapon ...

  13. The Quadratic Assignment Problem is Easy for Robinsonian Matrices

    NARCIS (Netherlands)

    Laurent, M.; Seminaroti, M.


    We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A;B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson

  14. A bilinear programming solution to the quadratic assignment problem

    NARCIS (Netherlands)

    J.F. Kaashoek (Johan); J.H.P. Paelinck (Jean)


    textabstractThe quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and Wolkowicz, 1994). One of the authors has published some material, in which it was tried, by structuring the problem additionally, to bring it as closely as possible in the

  15. The quadratic assignment problem is easy for robinsonian matrices

    NARCIS (Netherlands)

    Laurent, M.; Seminaroti, M.

    We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans–Beckman form QAP(A,B), by showing that the identity permutation is optimal when AA and BB are respectively a Robinson similarity and dissimilarity matrix and one of AA or BB is a Toeplitz matrix. A Robinson

  16. More Districts Factoring Poverty into Student-Assignment Plans (United States)

    Zehr, Mary Ann


    A growing number of school districts are trying to break up concentrations of poverty on their campuses by taking students' family income into consideration in school assignments. Some of the districts replaced race with socioeconomic status as a determining indicator after the U.S. Supreme Court ruled in 2007 that using race as the primary factor…

  17. 42 CFR 436.610 - Assignment of rights to benefits. (United States)


    ...) Assign rights to the Medicaid agency to medical support and to payment for medical care from any third party; (2) Cooperate with the agency in establishing paternity and in obtaining medical support and... cooperating in establishing paternity and obtaining medical support and payments from, or derived from, the...

  18. A Search for Alternatives to Random Assignment to Treatment Groups. (United States)

    Halasa, Ofelia

    In a public school setting administrators are frequently under local pressure to make a new project service available to all eligible children. However, comparable control groups for project evaluation are often absent, and although random assignment to treatment groups remains the most systematic method of providing controls, this is not often…

  19. Privacy-Preserving Task Assignment in Spatial Crowdsourcing

    KAUST Repository

    Liu, An


    With the progress of mobile devices and wireless networks, spatial crowdsourcing (SC) is emerging as a promising approach for problem solving. In SC, spatial tasks are assigned to and performed by a set of human workers. To enable effective task assignment, however, both workers and task requesters are required to disclose their locations to untrusted SC systems. In this paper, we study the problem of assigning workers to tasks in a way that location privacy for both workers and task requesters is preserved. We first combine the Paillier cryptosystem with Yao’s garbled circuits to construct a secure protocol that assigns the nearest worker to a task. Considering that this protocol cannot scale to a large number of workers, we then make use of Geohash, a hierarchical spatial index to design a more efficient protocol that can securely find approximate nearest workers. We theoretically show that these two protocols are secure against semi-honest adversaries. Through extensive experiments on two real-world datasets, we demonstrate the efficiency and effectiveness of our protocols.

  20. A Competitive and Experiential Assignment in Search Engine Optimization Strategy (United States)

    Clarke, Theresa B.; Clarke, Irvine, III


    Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be new…

  1. The Rescue Mission: Assigning Guilt to a Chaotic Scene. (United States)

    Procter, David E.


    Seeks to identify rhetorical distinctiveness of the rescue mission as a form of belligerency--examining presidential discourse justifying the 1985 Lebanon intervention, the 1965 Dominican intervention, and the 1983 Grenada intervention. Argues that the distinction is in guilt narrowly assigned to a chaotic scene and the concomitant call for…

  2. Optimal Weight Assignment for a Chinese Signature File. (United States)

    Liang, Tyne; And Others


    Investigates the performance of a character-based Chinese text retrieval scheme in which monogram keys and bigram keys are encoded into document signatures. Tests and verifies the theoretical predictions of the optimal weight assignments and the minimal false hit rate in experiments using a real Chinese corpus for disyllabic queries of different…

  3. College Textbook Reading Assignments and Class Time Activity (United States)

    Aagaard, Lola; Conner, Timothy W., II; Skidmore, Ronald L.


    It has been reported (Lei, Barlett, Gorney, & Herschbach, 2010; Sikorski et al., 2002) that only a minority of college students actually read the course textbook or other assigned readings in preparation for examinations. Suggested strategies to remedy this situation include quizzes (Ruscio, 2001; Ryan, 2006), study worksheets (Aagaard &…

  4. Effective Schools: Teacher Hiring, Assignment, Development, and Retention (United States)

    Loeb, Susanna; Kalogrides, Demetra; Beteille, Tara


    The literature on effective schools emphasizes the importance of a quality teaching force in improving educational outcomes for students. In this article we use value-added methods to examine the relationship between a school's effectiveness and the recruitment, assignment, development, and retention of its teachers. Our results reveal four key…

  5. Threat evaluation and weapon assignment decision support: A ...

    African Journals Online (AJOL)

    In a military environment an operator is typically required to evaluate the tactical situation in real-time and protect defended assets against enemy threats by assigning available weapon systems to engage enemy craft. This environment requires rapid operational planning and decision making under severe stress conditions ...

  6. Agency and Algorithms

    Directory of Open Access Journals (Sweden)

    Hanns Holger Rutz


    Full Text Available Although the concept of algorithms has been established a long time ago, their current topicality indicates a shift in the discourse. Classical definitions based on logic seem to be inadequate to describe their aesthetic capabilities. New approaches stress their involvement in material practices as well as their incompleteness. Algorithmic aesthetics can no longer be tied to the static analysis of programs, but must take into account the dynamic and experimental nature of coding practices. It is suggested that the aesthetic objects thus produced articulate something that could be called algorithmicity or the space of algorithmic agency. This is the space or the medium – following Luhmann’s form/medium distinction – where human and machine undergo mutual incursions. In the resulting coupled “extimate” writing process, human initiative and algorithmic speculation cannot be clearly divided out any longer. An observation is attempted of defining aspects of such a medium by drawing a trajectory across a number of sound pieces. The operation of exchange between form and medium I call reconfiguration and it is indicated by this trajectory. 

  7. Evolutionary pattern search algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Hart, W.E.


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

  8. A Parallel Butterfly Algorithm

    KAUST Repository

    Poulson, Jack


    The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.

  9. Quantum Search Algorithms (United States)

    Korepin, Vladimir E.; Xu, Ying

    This article reviews recent progress in quantum database search algorithms. The subject is presented in a self-contained and pedagogical way. The problem of searching a large database (a Hilbert space) for a target item is performed by the famous Grover algorithm which locates the target item with high probability and a quadratic speed-up compared with the corresponding classical algorithm. If the database is partitioned into blocks and one is searching for the block containing the target item instead of the target item itself, then the problem is referred to as partial search. Partial search trades accuracy for speed and the most efficient version is the Grover-Radhakrishnan-Korepin (GRK) algorithm. The target block can be further partitioned into sub-blocks so that GRK's can be performed in a sequence called a hierarchy. We study the Grover search and GRK partial search in detail and prove that a GRK hierarchy is less efficient than a direct GRK partial search. Both the Grover search and the GRK partial search can be generalized to the case with several target items (or target blocks for a GRK). The GRK partial search algorithm can also be represented in terms of group theory.


    Directory of Open Access Journals (Sweden)



    Full Text Available The Multiple Traveling Salesman Problem (mTSP is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different salesman in order to create m number of tours. This paper presents a new heuristic algorithm based on the shortest path algorithm to find a solution for the mTSP. The proposed method has been programmed in C language and its performance analysis has been carried out on the library instances. The computational results show the efficiency of this method.

  11. Travel Demand-Based Assignment Model for Multimodal and Multiuser Transportation System

    Directory of Open Access Journals (Sweden)

    Bingfeng Si


    Full Text Available In this paper, the structural characteristic of urban multimodal transport system is fully analyzed and then a two-tier network structure is proposed to describe such a system, in which the first-tier network is used to depict the traveller’s mode choice behaviour and the second-tier network is used to depict the vehicle routing when a certain mode has been selected. Subsequently, the generalized travel cost is formulated considering the properties of both traveller and transport mode. A new link impedance function is proposed, in which the interferences between different vehicle flows are taken into account. Simultaneously, the bi-equilibrium patterns for multimodal transport network are proposed by extending Wardrop principle. Correspondingly, a bi-level programming model is then presented to describe the bi-equilibrium based assignment for multi-class multimodal transport network. The solution algorithm is also given. Finally, a numerical example is provided to illustrate the model and algorithm.

  12. A two-stage approach for a multi-objective component assignment problem for a stochastic-flow network (United States)

    Lin, Yi-Kuei; Yeh, Cheng-Ta


    Many real-life systems, such as computer systems, manufacturing systems and logistics systems, are modelled as stochastic-flow networks (SFNs) to evaluate network reliability. Here, network reliability, defined as the probability that the network successfully transmits d units of data/commodity from an origin to a destination, is a performance indicator of the systems. Network reliability maximization is a particular objective, but is costly for many system supervisors. This article solves the multi-objective problem of reliability maximization and cost minimization by finding the optimal component assignment for SFN, in which a set of multi-state components is ready to be assigned to the network. A two-stage approach integrating Non-dominated Sorting Genetic Algorithm II and simple additive weighting are proposed to solve this problem, where network reliability is evaluated in terms of minimal paths and recursive sum of disjoint products. Several practical examples related to computer networks are utilized to demonstrate the proposed approach.


    Directory of Open Access Journals (Sweden)

    Shilpa S. Patil


    Full Text Available In wavelength division multiplexed all optical networks; lightpath establishes a connection between sending and receiving nodes bypassing the electronic processing at intermediate nodes. One of the prime objectives of Routing and Wavelength Assignment (RWA problem is to maximize the number of connections efficiently by choosing the best routes. Although there are several algorithms available, improving the blocking performance in optical networks and finding optimal solutions for RWA problem has still remained a challenging issue. Wavelength conversion can be helpful in restricting the problem of wavelength continuity constraint but it increases complexity in the network. In this paper, we propose new weight dependent routing and wavelength assignment strategy for all optical networks without use of wavelength converters. Proposed weight function reduces blocking probability significantly, improving the network performance at various load conditions. Further, due to absence of wavelength converters, the cost and complexity of network reduces. Results show that the proposed strategy performs better than earlier reported methods.

  14. Detection of algorithmic trading (United States)

    Bogoev, Dimitar; Karam, Arzé


    We develop a new approach to reflect the behavior of algorithmic traders. Specifically, we provide an analytical and tractable way to infer patterns of quote volatility and price momentum consistent with different types of strategies employed by algorithmic traders, and we propose two ratios to quantify these patterns. Quote volatility ratio is based on the rate of oscillation of the best ask and best bid quotes over an extremely short period of time; whereas price momentum ratio is based on identifying patterns of rapid upward or downward movement in prices. The two ratios are evaluated across several asset classes. We further run a two-stage Artificial Neural Network experiment on the quote volatility ratio; the first stage is used to detect the quote volatility patterns resulting from algorithmic activity, while the second is used to validate the quality of signal detection provided by our measure.

  15. The Retina Algorithm

    CERN Multimedia

    CERN. Geneva; PUNZI, Giovanni


    Charge particle reconstruction is one of the most demanding computational tasks found in HEP, and it becomes increasingly important to perform it in real time. We envision that HEP would greatly benefit from achieving a long-term goal of making track reconstruction happen transparently as part of the detector readout ("detector-embedded tracking"). We describe here a track-reconstruction approach based on a massively parallel pattern-recognition algorithm, inspired by studies of the processing of visual images by the brain as it happens in nature ('RETINA algorithm'). It turns out that high-quality tracking in large HEP detectors is possible with very small latencies, when this algorithm is implemented in specialized processors, based on current state-of-the-art, high-speed/high-bandwidth digital devices.

  16. Algorithms in invariant theory

    CERN Document Server

    Sturmfels, Bernd


    J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics". The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.

  17. Handbook of Memetic Algorithms

    CERN Document Server

    Cotta, Carlos; Moscato, Pablo


    Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems.  The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes.   “Handbook of Memetic Algorithms” organizes, in a structured way, all the the most important results in the field of MAs since their earliest definition until now.  A broad review including various algorithmic solutions as well as successful applications is included in this book. Each class of optimization problems, such as constrained optimization, multi-objective optimization, continuous vs combinatorial problems, uncertainties, are analysed separately and, for each problem,  memetic recipes for tackling the difficulties are given with some successful examples. Although this book contains chapters written by multiple authors, ...

  18. A Subspace Algorithm

    DEFF Research Database (Denmark)

    Vissing, S.; Hededal, O.

    An algorithm is presented for computing the m smallest eigenvalues and corresponding eigenvectors of the generalized eigenvalue problem (A - λB)Φ = 0 where A and B are real n x n symmetric matrices. In an iteration scheme the matrices A and B are projected simultaneously onto an m-dimensional sub......An algorithm is presented for computing the m smallest eigenvalues and corresponding eigenvectors of the generalized eigenvalue problem (A - λB)Φ = 0 where A and B are real n x n symmetric matrices. In an iteration scheme the matrices A and B are projected simultaneously onto an m......-dimensional subspace in order to establish and solve a symmetric generalized eigenvalue problem in the subspace. The algorithm is described in pseudo code and implemented in the C programming language for lower triangular matrices A and B. The implementation includes procedures for selecting initial iteration vectors...

  19. Named Entity Linking Algorithm

    Directory of Open Access Journals (Sweden)

    M. F. Panteleev


    Full Text Available In the tasks of processing text in natural language, Named Entity Linking (NEL represents the task to define and link some entity, which is found in the text, with some entity in the knowledge base (for example, Dbpedia. Currently, there is a diversity of approaches to solve this problem, but two main classes can be identified: graph-based approaches and machine learning-based ones. Graph and Machine Learning approaches-based algorithm is proposed accordingly to the stated assumptions about the interrelations of named entities in a sentence and in general.In the case of graph-based approaches, it is necessary to solve the problem of identifying an optimal set of the related entities according to some metric that characterizes the distance between these entities in a graph built on some knowledge base. Due to limitations in processing power, to solve this task directly is impossible. Therefore, its modification is proposed. Based on the algorithms of machine learning, an independent solution cannot be built due to small volumes of training datasets relevant to NEL task. However, their use can contribute to improving the quality of the algorithm. The adaptation of the Latent Dirichlet Allocation model is proposed in order to obtain a measure of the compatibility of attributes of various entities encountered in one context.The efficiency of the proposed algorithm was experimentally tested. A test dataset was independently generated. On its basis the performance of the model was compared using the proposed algorithm with the open source product DBpedia Spotlight, which solves the NEL problem.The mockup, based on the proposed algorithm, showed a low speed as compared to DBpedia Spotlight. However, the fact that it has shown higher accuracy, stipulates the prospects for work in this direction.The main directions of development were proposed in order to increase the accuracy of the system and its productivity.

  20. Algorithmization in Learning and Instruction. (United States)

    Landa, L. N.

    An introduction to the theory of algorithms reviews the theoretical issues of teaching algorithms, the logical and psychological problems of devising algorithms of identification, and the selection of efficient algorithms; and then relates all of these to the classroom teaching process. It also descirbes some major research on the effectiveness of…

  1. Particle tracking with iterated Kalman filters and smoothers the PMHT algorithm

    CERN Document Server

    Strandlie, A


    We introduce the Probabilistic Multi-Hypothesis Tracking (PMHT) algorithm for particle tracking in high-energy physics detectors. This algorithm has been developed recently for tracking multiple targets in clutter, and it is based on maximum likelihood estimation with help of the EM algorithm. The resulting algorithm basically consists of running several iterated and coupled Kalman filters and smoothers in parallel. It is similar to the Elastic Arms algorithm, but it possesses the additional feature of being able to take process noise into account, as for instance multiple Coulomb scattering. Herein, we review its basic properties and derive a generalized version of the algorithm by including a deterministic annealing scheme. Further developments of the algorithm in order to improve the performance are also discussed. In particular, we propose to modify the hit-to-track assignment probabilities in order to obtain competition between hits in the same detector layer. Finally, we present results of an implementa...

  2. An Enhanced Differential Evolution Based Algorithm with Simulated Annealing for Solving Multiobjective Optimization Problems

    Directory of Open Access Journals (Sweden)

    Bili Chen


    Full Text Available An enhanced differential evolution based algorithm, named multi-objective differential evolution with simulated annealing algorithm (MODESA, is presented for solving multiobjective optimization problems (MOPs. The proposed algorithm utilizes the advantage of simulated annealing for guiding the algorithm to explore more regions of the search space for a better convergence to the true Pareto-optimal front. In the proposed simulated annealing approach, a new acceptance probability computation function based on domination is proposed and some potential solutions are assigned a life cycle to have a priority to be selected entering the next generation. Moreover, it incorporates an efficient diversity maintenance approach, which is used to prune the obtained nondominated solutions for a good distributed Pareto front. The feasibility of the proposed algorithm is investigated on a set of five biobjective and two triobjective optimization problems and the results are compared with three other algorithms. The experimental results illustrate the effectiveness of the proposed algorithm.

  3. Algorithms for Reinforcement Learning

    CERN Document Server

    Szepesvari, Csaba


    Reinforcement learning is a learning paradigm concerned with learning to control a system so as to maximize a numerical performance measure that expresses a long-term objective. What distinguishes reinforcement learning from supervised learning is that only partial feedback is given to the learner about the learner's predictions. Further, the predictions may have long term effects through influencing the future state of the controlled system. Thus, time plays a special role. The goal in reinforcement learning is to develop efficient learning algorithms, as well as to understand the algorithms'

  4. Wireless communications algorithmic techniques

    CERN Document Server

    Vitetta, Giorgio; Colavolpe, Giulio; Pancaldi, Fabrizio; Martin, Philippa A


    This book introduces the theoretical elements at the basis of various classes of algorithms commonly employed in the physical layer (and, in part, in MAC layer) of wireless communications systems. It focuses on single user systems, so ignoring multiple access techniques. Moreover, emphasis is put on single-input single-output (SISO) systems, although some relevant topics about multiple-input multiple-output (MIMO) systems are also illustrated.Comprehensive wireless specific guide to algorithmic techniquesProvides a detailed analysis of channel equalization and channel coding for wi

  5. Secondary Vertex Finder Algorithm

    CERN Document Server

    Heer, Sebastian; The ATLAS collaboration


    If a jet originates from a b-quark, a b-hadron is formed during the fragmentation process. In its dominant decay modes, the b-hadron decays into a c-hadron via the electroweak interaction. Both b- and c-hadrons have lifetimes long enough, to travel a few millimetres before decaying. Thus displaced vertices from b- and subsequent c-hadron decays provide a strong signature for a b-jet. Reconstructing these secondary vertices (SV) and their properties is the aim of this algorithm. The performance of this algorithm is studied with tt̄ events, requiring at least one lepton, simulated at 13 TeV.

  6. Parallel Algorithms and Patterns

    Energy Technology Data Exchange (ETDEWEB)

    Robey, Robert W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)


    This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.

  7. Network-Oblivious Algorithms

    DEFF Research Database (Denmark)

    Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino


    A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network...... in the latter model implies optimality in the decomposable bulk synchronous parallel model, which is known to effectively describe a wide and significant class of parallel platforms. The proposed framework can be regarded as an attempt to port the notion of obliviousness, well established in the context...

  8. A Generalized Jacobi Algorithm

    DEFF Research Database (Denmark)

    Vissing, S.; Krenk, S.

    An algorithm is developed for the generalized eigenvalue problem (A - λB)φ = O where A and B are real symmetric matrices. The matrices A and B are diagonalized simultaneously by a series of generalized Jacobi transformations and all eigenvalues and eigenvectors are obtained. A criterion expressed...... in terms of the transformation parameters is used to omit transformations leading to very small changes. The algorithm is described in pseudo code for lower triangular matrices A and B and implemented in the programming Language C....

  9. Combining ambiguous chemical shift mapping with structure-based backbone and NOE assignment from 15N-NOESY

    KAUST Repository

    Jang, Richard


    Chemical shift mapping is an important technique in NMRbased drug screening for identifying the atoms of a target protein that potentially bind to a drug molecule upon the molecule\\'s introduction in increasing concentrations. The goal is to obtain a mapping of peaks with known residue assignment from the reference spectrum of the unbound protein to peaks with unknown assignment in the target spectrum of the bound protein. Although a series of perturbed spectra help to trace a path from reference peaks to target peaks, a one-to-one mapping generally is not possible, especially for large proteins, due to errors, such as noise peaks, missing peaks, missing but then reappearing, overlapped, and new peaks not associated with any peaks in the reference. Due to these difficulties, the mapping is typically done manually or semi-automatically. However, automated methods are necessary for high-throughput drug screening. We present PeakWalker, a novel peak walking algorithm for fast-exchange systems that models the errors explicitly and performs many-to-one mapping. On the proteins: hBclXL, UbcH5B, and histone H1, it achieves an average accuracy of over 95% with less than 1.5 residues predicted per target peak. Given these mappings as input, we present PeakAssigner, a novel combined structure-based backbone resonance and NOE assignment algorithm that uses just 15N-NOESY, while avoiding TOCSY experiments and 13C- labeling, to resolve the ambiguities for a one-toone mapping. On the three proteins, it achieves an average accuracy of 94% or better. Copyright © 2011 ACM.

  10. Combining automated peak tracking in SAR by NMR with structure-based backbone assignment from 15N-NOESY

    KAUST Repository

    Jang, Richard


    Background: Chemical shift mapping is an important technique in NMR-based drug screening for identifying the atoms of a target protein that potentially bind to a drug molecule upon the molecule\\'s introduction in increasing concentrations. The goal is to obtain a mapping of peaks with known residue assignment from the reference spectrum of the unbound protein to peaks with unknown assignment in the target spectrum of the bound protein. Although a series of perturbed spectra help to trace a path from reference peaks to target peaks, a one-to-one mapping generally is not possible, especially for large proteins, due to errors, such as noise peaks, missing peaks, missing but then reappearing, overlapped, and new peaks not associated with any peaks in the reference. Due to these difficulties, the mapping is typically done manually or semi-automatically, which is not efficient for high-throughput drug screening.Results: We present PeakWalker, a novel peak walking algorithm for fast-exchange systems that models the errors explicitly and performs many-to-one mapping. On the proteins: hBclXL, UbcH5B, and histone H1, it achieves an average accuracy of over 95% with less than 1.5 residues predicted per target peak. Given these mappings as input, we present PeakAssigner, a novel combined structure-based backbone resonance and NOE assignment algorithm that uses just 15N-NOESY, while avoiding TOCSY experiments and 13C-labeling, to resolve the ambiguities for a one-to-one mapping. On the three proteins, it achieves an average accuracy of 94% or better.Conclusions: Our mathematical programming approach for modeling chemical shift mapping as a graph problem, while modeling the errors directly, is potentially a time- and cost-effective first step for high-throughput drug screening based on limited NMR data and homologous 3D structures. 2012 Jang et al.; licensee BioMed Central Ltd.

  11. Comparing fast VRP algorithms for collaborative urban freight transport systems: a solution probleming analysis


    Salanova Grau, Josep-Maria; Gonzalez-Feliu, Jesus


    International audience; This paper proposes a comparison between two fast heuristic algorithms to solve a multi-carrier 2E-VRP in city logistics, under realistic conditions. We propose a cluster-first route second algorithm to compare the performance of two route construction and post-optimization algorithms on real-size test cases. The clustering phase is made by a seep algorithm, which defines the number of used vehicles and assigns a set of customers to it. Then, for each cluster, which re...

  12. Optimal Scheduling for Retrieval Jobs in Double-Deep AS/RS by Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Kuo-Yang Wu


    Full Text Available We investigate the optimal scheduling of retrieval jobs for double-deep type Automated Storage and Retrieval Systems (AS/RS in the Flexible Manufacturing System (FMS used in modern industrial production. Three types of evolutionary algorithms, the Genetic Algorithm (GA, the Immune Genetic Algorithm (IGA, and the Particle Swarm Optimization (PSO algorithm, are implemented to obtain the optimal assignments. The objective is to minimize the working distance, that is, the shortest retrieval time travelled by the Storage and Retrieval (S/R machine. Simulation results and comparisons show the advantages and feasibility of the proposed methods.

  13. Solving Large Quadratic|Assignment Problems in Parallel

    DEFF Research Database (Denmark)

    Clausen, Jens; Perregaard, Michael


    searched. Much work has been done to identify such functions for the QAP, but with limited success.Parallel processing has also been used in order to increase the size of problems solvable to optimality. The systems used have, however, often been systems with relatively few, but very powerful vector...... and recalculation of bounds between branchings when used in a parallel Branch-and-Bound algorithm. The algorithm has been implemented on a 16-processor MEIKO Computing Surface with Intel i860 processors. Computational results from the solution of a number of large QAPs, including the classical Nugent 20...

  14. GPON system with user controlled port-ID assignment method (United States)

    Zhang, Na; Yoshiuchi, Hideya


    Passive Optical Network (PON) system with characters of low-cost and high-efficiency has become a promising solution for access network in relieving the bandwidth bottleneck problem. PON system can provide high-speed optical subscriber networks with broad bandwidth and long distance transmission. In current telecommunication carriers' PON system, different service has its given priority which is configured by carriers based on common requirements. However, different users have their own requirement and inflexibility of the given default service priority causes users' inconvenience and frustration. In this paper, we propose a novel method of user controlled Port-IDentifier (Port-ID) assignment in a Gigabit-capable PON (GPON) system. This method provides users a more individualized priority determination mechanism for end users through assigning a multi-level Port-ID to different service. Then users can manage their own bandwidth based on their requirements for different service and carriers can provide a flexible service management mechanism.

  15. Using a digital storytelling assignment to teach public health advocacy. (United States)

    de Castro, A B; Levesque, Salem


    The need and expectation for advocacy is central to public health nursing practice. Advocacy efforts that effectively call attention to population health threats and promote the well-being of communities rely on strategies that deliver influential messaging. The digital story is a lay method to capture meaningful, impactful stories that can be used to advocate for public health concerns. Readily available, user-friendly digital technologies allow engagement in digital media production to create digital stories. This paper describes how digital story making can be utilized as an academic assignment to teach public health advocacy within an undergraduate nursing curriculum. Providing nursing students this artistic outlet can facilitate meeting academic learning goals, while also equipping them with creative skills that can be applied in future professional practice. Nursing educators can take advantage of institutional resources and campus culture to support the use of novel digital media assignments that facilitate application of advocacy concepts. © 2017 Wiley Periodicals, Inc.

  16. A neural network approach to dynamic task assignment of multirobots. (United States)

    Zhu, Anmin; Yang, Simon X


    In this paper, a neural network approach to task assignment, based on a self-organizing map (SOM), is proposed for a multirobot system in dynamic environments subject to uncertainties. It is capable of dynamically controlling a group of mobile robots to achieve multiple tasks at different locations, so that the desired number of robots will arrive at every target location from arbitrary initial locations. In the proposed approach, the robot motion planning is integrated with the task assignment, thus the robots start to move once the overall task is given. The robot navigation can be dynamically adjusted to guarantee that each target location has the desired number of robots, even under uncertainties such as when some robots break down. The proposed approach is capable of dealing with changing environments. The effectiveness and efficiency of the proposed approach are demonstrated by simulation studies.

  17. Optimal assignment of workers to supporting services in a hospital (United States)

    Sawik, Bartosz; Mikulik, Jerzy


    Supporting services play an important role in health care institutions such as hospitals. This paper presents an application of operations research model for optimal allocation of workers among supporting services in a public hospital. The services include logistics, inventory management, financial management, operations management, medical analysis, etc. The optimality criterion of the problem is to minimize operations costs of supporting services subject to some specific constraints. The constraints represent specific conditions for resource allocation in a hospital. The overall problem is formulated as an integer program in the literature known as the assignment problem, where the decision variables represent the assignment of people to various jobs. The results of some computational experiments modeled on a real data from a selected Polish hospital are reported.

  18. Economic design of Hotelling's T2 control chart on the presence of fixed sampling rate and exponentially assignable causes (United States)

    Bahiraee, Ehsan; Raissi, Sadigh


    Control charts are extensively used in manufacturing contexts to monitor production processes. This article illustrates economical design of a variable sample size and control limit Hotelling's T 2 control chart based on a novel cost model when occurrence times of the assignable causes are exponentially distributed. The proposed nonlinear cost model is an extension of Duncan's (J Am Stat Assoc 51: 228-242, 1956) model which was employed for univariate cases. Applying genetic algorithm to find optimum parameter values and using an L 33 orthogonal array in sensitivity analysis on the model parameters is investigated through a numerical example to illustrate the effectiveness of the proposed approach.

  19. New Optimization Algorithms in Physics

    CERN Document Server

    Hartmann, Alexander K


    Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now. This presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.

  20. Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks (United States)

    Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun


    Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

  1. An algorithm for the arithmetic classification of multilattices. (United States)

    Indelicato, Giuliana


    A procedure for the construction and the classification of monoatomic multilattices in arbitrary dimension is developed. The algorithm allows one to determine the location of the points of all monoatomic multilattices with a given symmetry, or to determine whether two assigned multilattices are arithmetically equivalent. This approach is based on ideas from integral matrix theory, in particular the reduction to the Smith normal form, and can be coded to provide a classification software package.



    Rentauli Mariah Silalahi


    Students’ error analysis is very important for helping EFL teachers to develop their teaching materials, assessments and methods. However, it takes much time and effort from the teachers to do such an error analysis towards their students’ language. This study seeks to identify the common errors made by 1 class of 28 freshmen students studying English in their first semester in an IT university. The data is collected from their writing assignments for eight consecutive weeks. The errors found...

  3. Impact of a health literacy assignment on student pharmacist learning. (United States)

    Chen, Aleda M H; Noureldin, Marwa; Plake, Kimberly S


    The average American adult reads at the 8th grade level while most written health information materials, including medication guides, are written at the 12th grade level. To assist students with health literacy-sensitive communication, pharmacy schools should incorporate educational activities addressing health literacy competencies. The objectives of this study were to evaluate the impact of a health literacy assignment on student pharmacists' perceptions of: 1) learning about health literacy; 2) ability to write health literacy level-appropriate patient education material; and 3) the use of these skills in future pharmacy practice. Third professional year student pharmacists were asked to rewrite a patient medication information sheet at the 5th grade reading level, altering it from the 12th grade level. Following assignment completion, students responded to a 4-item open-ended questionnaire on what they learned from the activity, what information components were the most difficult to rewrite and reason for the difficulty, key strategies to accomplish the assignment, and their perception of the impact this assignment had on their future practice. Content analysis of the reflections was performed using QSR NVivo to identify themes grounded in the students' responses. Reflections were completed in 2009 (n = 159) and 2010 (n = 144), for a total of 303 completed reflections. Predominant themes included greater understanding about the challenges, importance, and methods of health literacy level-appropriate communication and greater awareness of the role of pharmacists in presenting information clearly to patients. Students indicated the activity increased their understanding of the complexity of patient information, the educational needs of patients, and the importance of providing information that is understandable. Student pharmacists learned methods of effective communication with patients and should be better prepared to communicate in a health literacy

  4. Linear Optimization of Frequency Spectrum Assignments Across System (United States)


    selection tools, frequency allocation, transmission optimization , electromagnetic maneuver warfare, electronic protection, assignment model 15. NUMBER...bound of start time, upper bound of end time, and duration of transmission . The system capabilities are presented to the optimization model using...made that overlap in frequency, as shown in line 2 of Table 1. Do Not Transmit frequencies will be unavailable for any transmissions and these will

  5. Evoked Feelings, Assigned Meanings and Constructed Knowledge Based on Mistakes


    Luciane Guimarães Batistella Bianchini; Mario Sergio Vasconcelos


    By means of Piaget's critical clinical method, the study investigated the meanings assigned to mistakes by four students in different activities and interactive situations. The research also analyzed the results of using self-regulatory situations in understanding mistakes initially committed by the students. Data collection instruments consisted of games, video recordings, diaries and interviews. Following intervention, the students were able to recognize their competence, establish positive...

  6. Reparation demands and collective guilt assignment of black South Africans


    Dumont, K; Waldzus, S.


    WOS:000390584400002 (Nº de Acesso Web of Science) The present research studied reparation demands of born-free Black South African adolescents as members of a former victimized group from a social psychological perspective. Two cross-sectional studies tested whether identification indirectly predicts reparation demands via assignment of collective guilt to White South Africans; and whether this indirect relation is moderated by cross-group friendship. The results support both hypotheses an...

  7. Project Assignments When Budget Padding Taints Resource Allocation


    Anil Arya; Brian Mittendorf


    This paper shows that rotation programs can be an effective response to concerns of employee budget padding. Rotation programs naturally create a "portfolio" of assignments for each manager, and the resulting diversification can reduce the downside of resource rationing. In particular, the production versus rents trade-off linked with adverse selection problems can be more efficiently carried out when the firm faces two managers with average information advantages, rather than one with a larg...

  8. Molecular cloning and chromosome assignment of murine N-ras.


    Ryan, J.; Hart, C.P.; Ruddle, F H


    The murine N-ras gene was cloned by screening an EMBL-3 recombinant phage library with a human N-ras specific probe. Hybridization of two separate unique sequence N-ras probes, isolated from the 5' and 3' flanking sequences of the murine gene, to a mouse-Chinese hamster hybrid mapping panel assigns the N-ras locus to mouse chromosome three.

  9. Planning German Army helicopter maitenance and mission assignment


    Sgaslik, Achim


    Approved for public release; distribution unlimited. German Army light helicopter transportation regiments operate 45 Bell UH-1D helicopters to support demanding missions throughout Europe. Maintenance period scheduling, major exercise and regular mission assignment decisions directly influence the readiness of the helicopter fleet. Currently, all planning is done manually, which is unstructured and time consuming. This thesis describes a decision support system designed to assist with mai...

  10. A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

    DEFF Research Database (Denmark)

    Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel


    the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical...

  11. Automatic design of decision-tree algorithms with evolutionary algorithms. (United States)

    Barros, Rodrigo C; Basgalupp, Márcio P; de Carvalho, André C P L F; Freitas, Alex A


    This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms. Top-down decision-tree algorithms are of great importance, considering their ability to provide an intuitive and accurate knowledge representation for classification problems. The automatic design of these algorithms seems timely, given the large literature accumulated over more than 40 years of research in the manual design of decision-tree induction algorithms. The proposed hyper-heuristic evolutionary algorithm, HEAD-DT, is extensively tested using 20 public UCI datasets and 10 microarray gene expression datasets. The algorithms automatically designed by HEAD-DT are compared with traditional decision-tree induction algorithms, such as C4.5 and CART. Experimental results show that HEAD-DT is capable of generating algorithms which are significantly more accurate than C4.5 and CART.

  12. Assigning ethical weights to clinical signs observed during toxicity testing. (United States)

    Ringblom, Joakim; Törnqvist, Elin; Hansson, Sven Ove; Rudén, Christina; Öberg, Mattias


    Reducing the number of laboratory animals used and refining experimental procedures to enhance animal welfare are fundamental questions to be considered in connection with animal experimentation. Here, we explored the use of cardinal ethical weights for clinical signs and symptoms in rodents by conducting trade-off interviews with members of Swedish Animal Ethics Committees in order to derive such weights for nine typical clinical signs of toxicity. The participants interviewed represent researchers, politically nominated political nominees and representatives of animal welfare organizations. We observed no statistically significant differences between these groups with respect to the magnitude of the ethical weights assigned, though the political nominees tended to assign lower weights. Overall, hunched posture was considered the most severe clinical sign and body weight loss the least severe. The ethical weights assigned varied considerably between individuals, from zero to infinite value, indicating discrepancies in prioritization of reduction and refinement. Cardinal ethical weights may be utilized to include both animal welfare refinement and reduction of animal use in designing as well as in retrospective assessment of animal experiments. Such weights may also be used to estimate ethical costs of animal experiments.

  13. Web-Based Problem-Solving Assignment and Grading System (United States)

    Brereton, Giles; Rosenberg, Ronald


    In engineering courses with very specific learning objectives, such as fluid mechanics and thermodynamics, it is conventional to reinforce concepts and principles with problem-solving assignments and to measure success in problem solving as an indicator of student achievement. While the modern-day ease of copying and searching for online solutions can undermine the value of traditional assignments, web-based technologies also provide opportunities to generate individualized well-posed problems with an infinite number of different combinations of initial/final/boundary conditions, so that the probability of any two students being assigned identical problems in a course is vanishingly small. Such problems can be designed and programmed to be: single or multiple-step, self-grading, allow students single or multiple attempts; provide feedback when incorrect; selectable according to difficulty; incorporated within gaming packages; etc. In this talk, we discuss the use of a homework/exam generating program of this kind in a single-semester course, within a web-based client-server system that ensures secure operation.

  14. Schedule-Based Passenger Assignment for High-Speed Rail Networks considering the Ticket-Booking Process

    Directory of Open Access Journals (Sweden)

    Huanyin Su


    Full Text Available This paper proposes a schedule-based passenger assignment method for high-speed rail networks considering the ticket-booking process. Passengers book tickets to reserve seats during the presale period in high-speed rail systems and passengers on trains are determined during the ticket-booking process. The ticket-booking process is modeled as a continuous and deterministic predecision process. A solution algorithm is designed using the discretization of the continuous process by partitioning the ticket-booking time and the optimal paths remain constant in any partition interval. Finally, an application to the Chinese high-speed rail network is presented. A comparison of the numerical results with the reality is conducted to validate the efficiency and precision of the method and algorithm. Based on the results, the operating efficiency of the current train schedule is evaluated and some specific improvement measures are proposed.

  15. Randomized Filtering Algorithms

    DEFF Research Database (Denmark)

    Katriel, Irit; Van Hentenryck, Pascal


    of AllDifferent and is generalization, the Global Cardinality Constraint. The first delayed filtering scheme is a Monte Carlo algorithm: its running time is superior, in the worst case, to that of enforcing are consistency after every domain event, while its filtering effectiveness is analyzed...

  16. From Story to Algorithm. (United States)

    Ball, Stanley


    Presents a developmental taxonomy which promotes sequencing activities to enhance the potential of matching these activities with learner needs and readiness, suggesting that the order commonly found in the classroom needs to be inverted. The proposed taxonomy (story, skill, and algorithm) involves problem-solving emphasis in the classroom. (JN)

  17. Combinatorial Algorithms I, (United States)


    recurrence as g, =gn- + g,,-, for n > 2, g,=1, go=0. For this recurrence, we know the solution (see 1.4.2.; g, is the n-th Fibonacci number F,) and...blocks which overlap with a new path. The algorithm is now straightforward. Whenever find-path outputs the first path P of a new bridg c we determine in

  18. Learning Lightness Algorithms (United States)

    Hurlbert, Anya C.; Poggio, Tomaso A.


    Lightness algorithms, which recover surface reflectance from the image irradiance signal in individual color channels, provide one solution to the computational problem of color constancy. We compare three methods for constructing (or "learning") lightness algorithms from examples in a Mondrian world: optimal linear estimation, backpropagation (BP) on a two-layer network, and optimal polynomial estimation. In each example, the input data (image irradiance) is paired with the desired output (surface reflectance). Optimal linear estimation produces a lightness operator that is approximately equivalent to a center-surround, or bandpass, filter and which resembles a new lightness algorithm recently proposed by Land. This technique is based on the assumption that the operator that transforms input into output is linear, which is true for a certain class of early vision algorithms that may therefore be synthesized in a similar way from examples. Although the backpropagation net performs slightly better on new input data than the estimated linear operator, the optimal polynomial operator of order two performs marginally better than both.

  19. Optimal Quadratic Programming Algorithms

    CERN Document Server

    Dostal, Zdenek


    Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. This title presents various algorithms for solving large QP problems. It is suitable as an introductory text on quadratic programming for graduate students and researchers

  20. Efficient graph algorithms

    Indian Academy of Sciences (India)

    Outline of the talk. Introduction. Computing connectivities between all pairs of vertices. All pairs shortest paths/distances. Optimal bipartite matching . – p.2/30 .... Efficient Algorithm. The time taken for this computation on any input should be bounded by a small polynomial in the input size. . – p.6/30 ...