WorldWideScience

Sample records for assignment algorithm asset-based

  1. A Novel Two-Staged Decision Support based Threat Evaluation and Weapon Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial Intelligence Techinques

    CERN Document Server

    Naeem, Huma; Hussain, Mukhtar; Khan, Shoab A

    2009-01-01

    Surveillance control and reporting (SCR) system for air threats play an important role in the defense of a country. SCR system corresponds to air and ground situation management/processing along with information fusion, communication, coordination, simulation and other critical defense oriented tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR system. In such a system, maximal or near maximal utilization of constrained resources is of extreme importance. Manual TEWA systems cannot provide optimality because of different limitations e.g.surface to air missile (SAM) can fire from a distance of 5Km, but manual TEWA systems are constrained by human vision range and other constraints. Current TEWA systems usually work on target-by-target basis using some type of greedy algorithm thus affecting the optimality of the solution and failing in multi-target scenario. his paper relates to a novel two-staged flexible dynamic decision support based optimal threat evaluation and weapon assignment...

  2. A Novel Two-Staged Decision Support based Threat Evaluation and Weapon Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial Intelligence Techinques

    OpenAIRE

    Naeem, Huma; Masood, Asif; Hussain, Mukhtar; Shoab A. Khan

    2009-01-01

    Surveillance control and reporting (SCR) system for air threats play an important role in the defense of a country. SCR system corresponds to air and ground situation management/processing along with information fusion, communication, coordination, simulation and other critical defense oriented tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR system. In such a system, maximal or near maximal utilization of constrained resources is of extreme importance. Manual TEW...

  3. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  4. Evolutionary algorithm based index assignment algorithm for noisy channel

    Institute of Scientific and Technical Information of China (English)

    李天昊; 余松煜

    2004-01-01

    A globally optimal solution to vector quantization (VQ) index assignment on noisy channel, the evolutionary algorithm based index assignment algorithm (EAIAA), is presented. The algorithm yields a significant reduction in average distortion due to channel errors, over conventional arbitrary index assignment, as confirmed by experimental results over the memoryless binary symmetric channel (BSC) for any bit error.

  5. Weekly Fleet Assignment Model and Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHU Xing-hui; ZHU Jin-fu; GONG Zai-wu

    2007-01-01

    A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.

  6. Colony location algorithm for assignment problems

    Institute of Scientific and Technical Information of China (English)

    Dingwei WANG

    2004-01-01

    A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic conmunity that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates, environment evaluation and fertilization strategy.CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.

  7. Online Assignment Algorithms for Dynamic Bipartite Graphs

    CERN Document Server

    Sahai, Ankur

    2011-01-01

    This paper analyzes the problem of assigning weights to edges incrementally in a dynamic complete bipartite graph consisting of producer and consumer nodes. The objective is to minimize the overall cost while satisfying certain constraints. The cost and constraints are functions of attributes of the edges, nodes and online service requests. Novelty of this work is that it models real-time distributed resource allocation using an approach to solve this theoretical problem. This paper studies variants of this assignment problem where the edges, producers and consumers can disappear and reappear or their attributes can change over time. Primal-Dual algorithms are used for solving these problems and their competitive ratios are evaluated.

  8. Competition assignment problem algorithm based on Hungarian method

    Institute of Scientific and Technical Information of China (English)

    KONG Chao; REN Yongtai; GE Huiling; DENG Hualing

    2007-01-01

    Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.

  9. A multicast dynamic wavelength assignment algorithm based on matching degree

    Institute of Scientific and Technical Information of China (English)

    WU Qi-wu; ZHOU Xian-wei; WANG Jian-ping; YIN Zhi-hong; ZHANG Long

    2009-01-01

    The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied. A new multicast dynamic wavelength assignment algorithm is presented based on matching degree. First, the wavelength matching degree between available wavelengths and multicast routing trees is introduced into the algorithm. Then, the wavelength assign-ment is translated into the maximum weight matching in bipartite graph, and this matching problem is solved by using an extended Kuhn-Munkres algorithm. The simulation results prove that the overall optimal wavelength assignment scheme is obtained in polynomial time. At the same time, the proposed algorithm can reduce the connecting blocking probability and improve the system resource utilization.

  10. An efficient and impartial online algorithm for kidney assignment network

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation immunity spending caused by the possible post-operation immunity rejection and patient’...

  11. Derandomization of Online Assignment Algorithms for Dynamic Graphs

    CERN Document Server

    Sahai, Ankur

    2011-01-01

    This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints. Edges in this graph may disappear and reappear over time. Performance of these algorithms is measured using simulations. This paper also attempts to derandomize the randomized online algorithm for this problem.

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

    NARCIS (Netherlands)

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

    2013-01-01

    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

  13. Feeder assignment optimization algorithm for multi-head mounter

    Institute of Scientific and Technical Information of China (English)

    Peng YUAN; Yueming HU; Haiming LIU; Hongxia GAO

    2006-01-01

    This paper analyzes optimization algorithms of assembly time for a multi-head mounter. The algorithm in this paper is composed of four steps. First, it assigns the components to feeders based on the "one-to-many mapping".Secondly, it assigns nozzles to heads by making full use of the "on-the-fly nozzle change" heads. Thirdly, it organizes the feeder groups so that the heads can pick and place components group by group. Finally, it assigns feeder groups to slots.The result demonstrates that the algorithm has good performance in practice.

  14. Localized Algorithm for Channel Assignment in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Harpreet Kaur

    2015-12-01

    Full Text Available Cognitive Radio has been emerged as a revolutionary solution to migrate the current shortage of spectrum allocation in wireless networks. In this paper, an improved localized channel allocation algorithm based on channel weight is proposed. A factor of channel stability is introduced based on link environment, which efficiently assigns the best channels to the links. Based on the framework, a conflict resolution strategy is used to make the scheme adaptable to different network conditions. Calculations indicate that this algorithm can reduce the conflicts, increase the delivery rate and link assignment rate compared with the basic channel assignment algorithm.

  15. Online Assignment Algorithms for Dynamic Bipartite Graphs

    OpenAIRE

    Sahai, Ankur

    2011-01-01

    This paper analyzes the problem of assigning weights to edges incrementally in a dynamic complete bipartite graph consisting of producer and consumer nodes. The objective is to minimize the overall cost while satisfying certain constraints. The cost and constraints are functions of attributes of the edges, nodes and online service requests. Novelty of this work is that it models real-time distributed resource allocation using an approach to solve this theoretical problem. This paper studies v...

  16. Solving the Quadratic Assignment Problem by a Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Aldy Gunawan

    2011-01-01

    Full Text Available This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP. The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP to obtain an initial solution, and then using a combined Simulated Annealing (SA and Tabu Search (TS algorithm to improve the solution. Experimental results  indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.

  17. Assignment of Cooperating UAVs to Simultaneous Tasks using Genetic Algorithms

    Science.gov (United States)

    2005-08-18

    multiple task assignment problem TSP travelling salesman problem UAV unmanned aerial vehicle VRP vehicle routing problem I. Introduction Many...assignment problem (GAP),3 and the vehicle routing problem (VRP).4 In all of these classical problems the minimum cost assignment is sought, where: in...17–23. 16Baker, B. M. and Ayechew, M. A., “A Genetic Algorithm for the Vehicle Routing Problem ,” Computers and Operations Research, Vol. 30, 2003, pp

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

    Directory of Open Access Journals (Sweden)

    Hui Zhao

    2014-01-01

    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.

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

    Directory of Open Access Journals (Sweden)

    Soheil Rostami

    2016-01-01

    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.

  20. Convergence properties of the softassign quadratic assignment algorithm.

    Science.gov (United States)

    Rangarajan, A; Vuille, A; Mjolsness, E

    1999-08-15

    The softassign quadratic assignment algorithm is a discrete-time, continuous-state, synchronous updating optimizing neural network. While its effectiveness has been shown in the traveling salesman problem, graph matching, and graph partitioning in thousands of simulations, its convergence properties have not been studied. Here, we construct discrete-time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction, which show convergence to a fixed point. The combination of good convergence properties and experimental success makes the softassign algorithm an excellent choice for neural quadratic assignment optimization.

  1. UAV Cooperative Multiple Task Assignments using Genetic Algorithms

    Science.gov (United States)

    2005-06-01

    vehicle routing problem (VRP). In all of these classical problems the minimum cost assignment is sought where: in the TSP the tour is of one agent...10] Baker, Barrie, M. and Ayechew, M. A., “A Genetic Algorithm for the Vehicle Routing Problem ,” Computers and Operations Research, Vol. 30, 2003

  2. Clustered Self Organising Migrating Algorithm for the Quadratic Assignment Problem

    Science.gov (United States)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman

    2009-08-01

    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.

  3. Restart-Based Genetic Algorithm for the Quadratic Assignment Problem

    Science.gov (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.

  4. ZAP: a distributed channel assignment algorithm for cognitive radio networks

    Directory of Open Access Journals (Sweden)

    Munaretto Anelise

    2011-01-01

    Full Text Available Abstract We propose ZAP, an algorithm for the distributed channel assignment in cognitive radio (CR networks. CRs are capable of identifying underutilized licensed bands of the spectrum, allowing their reuse by secondary users without interfering with primary users. In this context, efficient channel assignment is challenging as ideally it must be simple, incur acceptable communication overhead, provide timely response, and be adaptive to accommodate frequent changes in the network. Another challenge is the optimization of network capacity through interference minimization. In contrast to related work, ZAP addresses these challenges with a fully distributed approach based only on local (neighborhood knowledge, while significantly reducing computational costs and the number of messages required for channel assignment. Simulations confirm the efficiency of ZAP in terms of (i the performance tradeoff between different metrics and (ii the fast achievement of a suitable assignment solution regardless of network size and density.

  5. Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation

    Directory of Open Access Journals (Sweden)

    Ümit Çiftçi

    2010-03-01

    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

  6. An efficient and impartial online algorithm for kidney assignment network

    Institute of Scientific and Technical Information of China (English)

    Yu-jue Wang; Jia-yin Wang; Pei-jia Tang; Yi-tuo Ye

    2009-01-01

    An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation- immunity spending caused by the possible post-operation immunity rejection and patient's mental depression due to the HLA mismatch. The equity principle is concerned with three other factors, namely the treatment spending incurred starting from the day of registering with the kidney assignment network, the post-operation immunity spending and the negative effects of waiting for kidney resources on the clinical efficiency. The competitive analysis conducted through computer simulation indicates that the efficiency competitive ratio is between 6. 29 and 10. 43 and the equity competitive ratio is between 1. 31 and 5. 21, demonstrating that the online algorithm is of great significance in application.

  7. Locomotive assignment problem with train precedence using genetic algorithm

    Science.gov (United States)

    Noori, Siamak; Ghannadpour, Seyed Farid

    2012-07-01

    This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft fuzzy time windows. A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid genetic algorithm. In the genetic algorithm, various heuristics and efficient operators are used in the evolutionary search. The suggested algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with those solutions produced by branch-and-bound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.

  8. ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMS BASED ON EQUIVALENT NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Qi Xiaogang; Liu Lifang; Lin Sanyang

    2006-01-01

    In this paper, a Wavelength Division Multiplexing (WDM) network model based on the equivalent networks is described, and wavelength-dependent equivalent arc, equivalent networks, equivalent multicast tree and some other terms are presented. Based on this model and relevant Routing and Wavelength Assignment (RWA) strategy, a unicast RWA algorithm and a multicast RWA algorithm are presented. The wavelength-dependent equivalent arc expresses the schedule of local RWA and the equivalent network expresses the whole topology of WDM optical networks, so the two algorithms are of the flexibility in RWA and the optimization of the whole problem. The theoretic analysis and simulation results show the two algorithms are of the stronger capability and the lower complexity than the other existing algorithms for RWA problem, and the complexity of the two algorithms are only related to the scale of the equivalent networks. Finally, we prove the two algorithms' feasibility and the one-by-one corresponding relation between the equivalent multicast tree and original multicast tree, and point out the superiorities and drawbacks of the two algorithms respectively.

  9. EVOLUTIONARY NEURAL NETWORKS ALGORITHM FOR THE DYNAMIC FREQUENCY ASSIGNMENT PROBLEM

    Directory of Open Access Journals (Sweden)

    Jamal Elhachmi

    2011-06-01

    Full Text Available Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application-specific characteristics. Researchers have developed different modelling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This paper presents a new approach for solving the problem of frequency allocation based on using initially a partial solution respecting all constraints according to a greedy algorithm. This partial solution is then used for the construction of our stimulation in the form of a neural network. In a second step, the approach will use searching techniques used in conjunction with iterative algorithms for theoptimization of the parameters and topology of the network. The iterative algorithms used are named hierarchical genetic algorithms (HGA. Our approach has been tested on standard benchmark problems called Philadelphia problems of frequency assignment. The results obtained are equivalent to those of current methods. Moreover, our approach shows more efficiency in terms of flexibility and autonomy.

  10. Backbone analysis and algorithm design for the quadratic assignment problem

    Institute of Scientific and Technical Information of China (English)

    JIANG He; ZHANG XianChao; CHEN GuoLiang; LI MingChu

    2008-01-01

    As the hot line in NP-hard problems research in recent years, backbone analysis is crucial for phase transition, hardness, and algorithm design. Whereas theoretical analysis of backbone and its applications in algorithm design are still at a begin-ning state yet, this paper took the quadratic assignment problem (QAP) as a case study and proved by theoretical analysis that it is NP-hard to find the backbone, l.e., no algorithm exists to obtain the backbone of a QAP in polynomial time. Results of this paper showed that it is reasonable to acquire approximate backbone by inter-section of local optimal solutions. Furthermore, with the method of constructing biased instances, this paper proposed a new meta-heuristic - biased instance based approximate backbone (BI-AB), whose basic idea is as follows: firstly, con-struct a new biased instance for every QAP instance (the optimal solution of the new instance is also optimal for the original one); secondly, the approximate backbone is obtained by intersection of multiple local optimal solutions computed by some existing algorithm; finally, search for the optimal solutions in the reduced space by fixing the approximate backbone. Work of the paper enhanced the re-search area of theoretical analysis of backbone. The meta-heuristic proposed in this paper provided a new way for general algorithm design of NP-hard problems as well.

  11. Assigning Task by Parallel Genetic Algorithm Based on PVM

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Genetic algorithm has been proposed to solve the problem of taskassignment. Ho wever, it has some drawbacks, e.g., it often takes a long time to find an optima l solution, and the success rate is low. To overcome these problems, a new coars e-grained parallel genetic algorithm with the scheme of central migration is pr e sented, which exploits isolated sub-populations. The new approach has been impl e mented in the PVM environment and has been evaluated on a workstation network fo r solving the task assignment problem. The results show that it not only signifi cantly improves the result quality but also increases the speed for getting best solution.

  12. Study on Fleet Assignment Problem Model and Algorithm

    Directory of Open Access Journals (Sweden)

    Yaohua Li

    2013-01-01

    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.

  13. Consultant-Guided Search Algorithms for the Quadratic Assignment Problem

    Science.gov (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.

  14. Shape Assignment by Genetic Algorithm towards Designing Optimal Areas

    Directory of Open Access Journals (Sweden)

    Ismadi Md Badarudin

    2010-07-01

    Full Text Available This paper presents a preliminary study on space allocation focusing on the rectangular shapes to be assigned into an area with an intention to find optimal combination of shapes. The proposed solution is vital for promoting an optimal planting area and eventually finds the optimal number of trees as the ultimate goal. Thus, the evolutionary algorithm by GA technique was performed to find the objective. GAs by implementing some metaheuristic approaches is one of the most common techniques for handling ambiguous and / or vast possible solutions. The shape assignment strategy by the determined shapes coordinate to be assigned into an area was introduced. The aim of this study is to gauge the capability of GA to solve this problem. Therefore some strategies to determine the chromosome representation and genetic operators are essential for less computational time and result quality. Some areas coordinate were used to generate the optimal solutions. The result indicates the GA is able to fulfill both feasible result and acceptable time.

  15. Application of a Dynamic Programming Algorithm for Weapon Target Assignment

    Science.gov (United States)

    2016-02-01

    targets by simply optimizing the total ‘ cost ’ of all assignments (in the WTA case the cost relates to the threat minimisation benefit). LAPs can...an inbound missile or as a weapons system about to launch a missile. Such an approach requires a high degree of situational awareness [14], whereas... costs . 3.1 Static Weapon Target Assignment using Exhaustive Enumeration As previously mentioned, since there is no exact solution to determining the

  16. Locomotive assignment problem with train precedence using genetic algorithm

    OpenAIRE

    Noori, Siamak; Ghannadpour, Seyed

    2012-01-01

    This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should...

  17. EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    ZHAO Hui; GAO Ziyou

    2005-01-01

    This paper presents a unified framework of the nonmonotone convex combination algorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignment problems. Global convergence results are established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the nonmonotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.

  18. Constrained resource assignments: Fast algorithms and applications in wireless networks

    NARCIS (Netherlands)

    Berger, A.; Gross, J.; Harks, T.; Tenbusch, S.

    2016-01-01

    Resource assignment problems occur in a vast variety of applications, from scheduling problems over image recognition to communication networks. Often these problems can be modeled by a maximum weight matching problem in (bipartite) graphs or generalizations thereof, and efficient and practical algo

  19. Assessment Guidelines for Ant Colony Algorithms when Solving Quadratic Assignment Problems

    Science.gov (United States)

    See, Phen Chiak; Yew Wong, Kuan; Komarudin, Komarudin

    2009-08-01

    To date, no consensus exists on how to evaluate the performance of a new Ant Colony Optimization (ACO) algorithm when solving Quadratic Assignment Problems (QAPs). Different performance measures and problems sets are used by researchers to evaluate their algorithms. This paper is aimed to provide a recapitulation of the relevant issues and suggest some guidelines for assessing the performance of new ACO algorithms.

  20. A new algorithm for pole assignment of single-input linear systems using state feedback

    Institute of Scientific and Technical Information of China (English)

    QIAN Jiang; CHENG Mingsong; XU Shufang

    2005-01-01

    In this paper we present a new algorithm for the single-input pole assignment problem using state feedback. This algorithm is based on the Schur decomposition of the closed-loop system matrix, and the numerically stable unitary transformations are used whenever possible, and hence it is numerically reliable.The good numerical behavior of this algorithm is also illustrated by numerical examples.

  1. Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm

    Directory of Open Access Journals (Sweden)

    R.Mohan

    2014-06-01

    Full Text Available The problem of task assignment is one of the most fundamental among combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. A classic problem that confronts computer scientists across the globe pertaining to the effective assignment of tasks to the various processors of the system due to the intractability of the task assignment problem for more than 3 processors. Several Algorithms and methodologies have been proposed to solve the Task Assignment Problem, most of which use Graph Partitioning and Graph Matching Techniques. Significant research has also been carried out in solving the Task Assignment Problem in a parallel environment. Here we propose a modified version of iterated greedy algorithm that capitalizes on the efficacy of the Parallel Processing paradigm, minimizing the various costs along with the duration of convergence. The central notion of the algorithm is to enhance the quality of assignment in every iteration, utilizing the values from the preceding iterations and at the same time assigning these smaller computations to internal processors (i.e. parallel processing to hasten the computation. On implementation, the algorithm was tested using Message Passing Interface (MPI and the results show the effectiveness of the said algorithm.

  2. A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem

    OpenAIRE

    Gamal Abd El-Nasser A. Said; Mahmoud, Abeer M.; El-Horbaty, El-Sayed M.

    2014-01-01

    Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime efficiency and solution quality. The results show that Genetic Algorithm has a better solution quality wh...

  3. Channel Assignment Algorithms for MRMC Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Mohammad A Hoque

    2011-11-01

    Full Text Available The wireless mesh networksare considered as one of the vital elements in today’s converged networks,providing high bandwidth and connectivity over large geographical areas. Mesh routers equipped with multiple radios can significantly overcome the capacity problem and increase the aggregate throughput of the network where single radio nodessuffer from performancedegradation. Moreover, the market availability of cheap radios or network interfaces also makes multi-radio solutions more feasible.A key issue in such networks is how to efficiently design a channel assignmentscheme that utilizes the available channels as well as increases overall performance of the network. This paper provides an overall review on the issues pertaining to the channel assignment in WMNs and the most relevant approaches and solutions developed in the area. They include design challenges, goals and criteria; routing considerations, graph based solutions and challenges of partially overlapped channels. We conclude that the assignment of channels to the radio interfaces continuously poses significant challenges. Many research issues remain open for further investigation.

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

    Science.gov (United States)

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

    2015-10-23

    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m 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.

  5. Multiple targets vector miss distance measurement accuracy based on 2-D assignment algorithms

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    An extension of 2-D assignment approach is proposed for measurement-to-target association for improving multiple targets vector miss distance measurement accuracy.When the multiple targets move so closely,the measurements can not be fully resolved due to finite resolution.The proposed method adopts an auction algorithm to compute the feasible measurement-to-target assignment with unresolved measurements for solving this 2-D assignment problem.Computer simulation results demonstrate the effectiveness and feasibility of this method.

  6. Solving Benchmark Frequency Assignment Problem of Helsinki Regions Network by a Novel Nature Inspired Algorithm

    Directory of Open Access Journals (Sweden)

    Avtar Singh Buttar

    2013-03-01

    Full Text Available The Frequency Assignment Problem is assignment of frequencies or channels to establish link between base station and mobile transmitter in cellular system. To avoid interference, minimum separation between assigned frequencies is required. This problem is NP-hard. Due to limited availability of spectrum and reuse of same frequencies at different geographical locations, an excellent assignment is to be done, which must satisfy electromagnetic constraints with respect to demand in each cell. This paper presents a novel DGWCHD algorithm for frequency assignment problem in cellular radio networks. The objective is to assign the frequency satisfying electromagnetic constraints for given demand with minimum use of frequency bandwidth. The proposed algorithm is based on real wild animal such as dog’s intelligent strategies during chasing and hunting their prey. The proposed algorithm is implemented on benchmark Kunz’s test problems, which are practical FAP problems based on area around 25 regions in Helsinki, Finland. The DGWCHD algorithm has been used for call ordering and FEA strategy for assignment. The performance of the proposed novel DGWCHD algorithm has been compared with other nature inspired techniques. The results obtained are very optimistic and encouraging

  7. Heuristic file sorted assignment algorithm of parallel I/O on cluster computing system

    Institute of Scientific and Technical Information of China (English)

    CHEN Zhi-gang; ZENG Bi-qing; XIONG Ce; DENG Xiao-heng; ZENG Zhi-wen; LIU An-feng

    2005-01-01

    A new file assignment strategy of parallel I/O, which is named heuristic file sorted assignment algorithm was proposed on cluster computing system. Based on the load balancing, it assigns the files to the same disk according to the similar service time. Firstly, the files were sorted and stored at the set I in descending order in terms of their service time, then one disk of cluster node was selected randomly when the files were to be assigned, and at last the continuous files were taken orderly from the set I to the disk until the disk reached its load maximum. The experimental results show that the new strategy improves the performance by 20.2% when the load of the system is light and by 31.6% when the load is heavy. And the higher the data access rate, the more evident the improvement of the performance obtained by the heuristic file sorted assignment algorithm.

  8. A Novel Dynamic Bandwidth Assignment Algorithm for Multi-Services EPONs

    Institute of Scientific and Technical Information of China (English)

    CHEN Xue; ZHANG Yang; HUANG Xiang; DENG Yu; SUN Shu-he

    2005-01-01

    In this paper we propose a novel Dynamic Bandwidth Assignment (DBA) algorithm for Ethernet-based Passive Optical Networks (EPON) which offers multiple kinds of services. To satisfy crucial Quality of Service (QoS) requirement for Time Division Multiplexing (TDM) service and achieve fair and high bandwidth utilization simultaneously, the algorithm integrates periodic, for TDM service, and polling granting for Ethernet service. Detailed simulation shows that the algorithm guarantees carrier-grade QoS for TDM service, high bandwidth utilization and good fairness of bandwidth assignment among Optical Network Units (ONU).

  9. Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    Wang Yanxia; Qian Longjun; Guo Zhi; Ma Lifeng

    2008-01-01

    A weapon target assignment (WTA) model satisfying expected damage probabilities with an ant colony algorithm is proposed.In order to save armament resource and attack the targets effectively,the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted.The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result.Ant colony algorithm has been successfully used in many fields,especially in combination optimization.The ant colony algorithm for this WTA problem is described by analyzing path selection,pheromone update,and tabu table update.The effectiveness of the model and the algorithm is demonstrated with an example.

  10. Cooperative multiple target assignment of submunitions based on Chaos-PSO algorithm

    Science.gov (United States)

    Wu, Xuzhong; Tang, Shengjing; Shi, Jiao

    2011-10-01

    In this paper Multi-Objective particle swarm optimization (MOPSO) algorithm is utilized to solve the problem for cooperative multiple target assignment, which is the optimization problem in the discrete search space. At first a model of multi-objective optimization for Cooperative Multiple Target Assignment is established. Aiming to solve out the local convergence phenomenon, the chaos mutation is introduced into PSO for improving global optimal ability. Another underlying problem is that computing speed of the algorithm must meet the operational requirement, so a new kind of Chaos-MOPSO Algorithm is developed to solve the target assignment problem with less population and iterations. At last an authentication example is given in this paper, compared with basic MOPSO and NSGA-II, the Chaos-MOPSO algorithm obtained a better Pareto solution set with smaller computational burden.

  11. A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem

    Directory of Open Access Journals (Sweden)

    Gamal Abd El-Nasser A. Said

    2014-01-01

    Full Text Available Quadratic Assignment Problem (QAP is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP and analyze their performance in terms of both runtime efficiency and solution quality. The results show that Genetic Algorithm has a better solution quality while Tabu Search has a faster execution time in comparison with other Meta-heuristic algorithms for solving QAP.

  12. A Distributed Routing and Wavelength Assignment Algorithm for Online Muiticast in All-Optical WDM Networks

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Routing and wavelength assignment for online real-time multicast connection setup is a difficulttask due to the dynamic change of availabilities of wavelengths on links and the consideration of wave-length conversion delay in WDM networks. This paper presents a distributed routing and wavelength as-signment scheme for the setup of real-time multicast connections. It integrates routing and wavelength as-signment as a single process, which greatly reduces the connection setup time. The proposed routingmethod is based on the Prim's MST (Minimum Spanning Tree) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wave-length assignment uses the least-conversion and load balancing strategies. Simulation results show that theproposed algorithm is suitable for online multicast connection establishment in WDM networks.

  13. An experimental study of variable depth search algorithms for the quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    Elizabeth Ferreira Gouvêa Goldbarg

    2012-04-01

    Full Text Available This paper introduces a new variable depth search method for the Quadratic Assignment Problem. The new method considers the cost of edges assignment as the criterion to decide which vertices to exchange during local search moves. It also presents the results of an extensive experimental study that compares the performance of local search and variable depth search algorithms for the Quadratic Assignment Problem. The investigation presented here contributes to a better understanding of the potential of these techniques, which are widely used as intensification tools in more sophisticated heuristic methods, such as evolutionary algorithms. Different algorithms presented in the literature were implemented and compared to the proposed methods. The results of a computational experiment with 161 benchmark instances are reported. Different statistical tests are applied in order to analyze the results provided by the experiments.

  14. An improved fiber tracking algorithm based on fiber assignment using the continuous tracking algorithm and two-tensor model

    Institute of Scientific and Technical Information of China (English)

    Liuhong Zhu; Gang Guo

    2012-01-01

    This study tested an improved fiber tracking algorithm, which was based on fiber assignment using a continuous tracking algorithm and a two-tensor model. Different models and tracking decisions were used by judging the type of estimation of each voxel. This method should solve the cross-track problem. This study included eight healthy subjects, two axonal injury patients and seven demyelinating disease patients. This new algorithm clearly exhibited a difference in nerve fiber direction between axonal injury and demyelinating disease patients and healthy control subjects. Compared with fiber assignment with a continuous tracking algorithm, our novel method can track more and longer nerve fibers, and also can solve the fiber crossing problem.

  15. A multiple channel assignment algorithm and routing protocol base on wireless mesh networks

    Science.gov (United States)

    Shi, Xiaochuan; Li, Nan

    2011-10-01

    In this paper, a hybrid routing protocol TOIRP and a distributed channel assignment algorithm CLBCA of WMN in the multi-channel environment are proposed. The tree base protocol and the traditional AODV routing protocol are integrated together to reduce delay in the routing protocol, which is proposed by HWMP. A new routing metric CETTI is used in this routing protocol, which uses a new method to quantify the interference of communication. It divided interference into two parts: inter-flow interference and intra- flow interference, and it integrate the considerations of hop- count and delay. This improves the throughput of WMN. The channel assignment algorithm is divided into two parts: radio- neighbor binding and channel-radio binding. This algorithm is based on the channel load and avoids the channel-dependency problem which is common in the multi-channel environment. In the same time, it increases the utilization of each channel.

  16. Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network.

    Science.gov (United States)

    Choi, Sangil; Park, Jong Hyuk

    2016-12-02

    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.

  17. AN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS MOBILE NETWORKS

    Directory of Open Access Journals (Sweden)

    Yee Shin Chia

    2012-12-01

    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.

  18. A novel distributed algorithm for media access control address assignment in wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    TIAN Ye; SHENG Min; LI Jiandong

    2007-01-01

    This Paper presents a novel distributed media access control(MAC)address assignment algorithm,namely virtual grid spatial reusing(VGSR),for wireless sensor networks,which reduces the size of the MAC address efficiently on the basis of both the spatial reuse of MAC address and the mapping of geographical position.By adjusting the communication range of sensor nodes,VGSR algorithm can minimize the size of MAC address and meanwhile guarantee the connectivity of the sensor network.Theoretical analysis and experimental results show that VGSR algorithm is not only of low energy cost,but also scales well with the network ize,with its performance superior to that of other existing algorithms.

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

    Directory of Open Access Journals (Sweden)

    Zhaocai Wang

    2015-10-01

    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.

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

    Directory of Open Access Journals (Sweden)

    Jin-Tai Yan

    1996-01-01

    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.

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

    Directory of Open Access Journals (Sweden)

    Jan Hlubik

    2008-01-01

    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.

  2. Advanced Credit-Assignment CMAC Algorithm for Robust Self-Learning and Self-Maintenance Machine

    Institute of Scientific and Technical Information of China (English)

    ZHANG Lei(张蕾); LEE Jay; CAO Qixin(曹其新); WANG Lei(王磊)

    2004-01-01

    Smart machine necessitates self-learning capabilities to assess its own performance and predict its behavior. To achieve self-maintenance intelligence, robust and fast learning algorithms need to be embedded in machine for real-time decision. This paper presents a credit-assignment cerebellar model articulation controller (CA-CMAC) algorithm to reduce learning interference in machine learning. The developed algorithms on credit matrix and the credit correlation matrix are presented. The error of the training sample distributed to the activated memory cell is proportional to the cell's credibility, which is determined by its activated times. The convergence processes of CA-CMAC in cyclic learning are further analyzed with two convergence theorems. In addition, simulation results on the inverse kinematics of 2-degree-of-freedom planar robot arm are used to prove the convergence theorems and show that CA-CMAC converges faster than conventional machine learning.

  3. Wavelength assignment algorithm considering the state of neighborhood links for OBS networks

    Science.gov (United States)

    Tanaka, Yu; Hirota, Yusuke; Tode, Hideki; Murakami, Koso

    2005-10-01

    Recently, Optical WDM technology is introduced into backbone networks. On the other hand, as the future optical switching scheme, Optical Burst Switching (OBS) systems become a realistic solution. OBS systems do not consider buffering in intermediate nodes. Thus, it is an important issue to avoid overlapping wavelength reservation between partially interfered paths. To solve this problem, so far, the wavelength assignment scheme which has priority management tables has been proposed. This method achieves the reduction of burst blocking probability. However, this priority management table requires huge memory space. In this paper, we propose a wavelength assignment algorithm that reduces both the number of priority management tables and burst blocking probability. To reduce priority management tables, we allocate and manage them for each link. To reduce burst blocking probability, our method announces information about the change of their priorities to intermediate nodes. We evaluate its performance in terms of the burst blocking probability and the reduction rate of priority management tables.

  4. Modified stochastic user-equilibrium assignment algorithm for urban rail transit under network operation

    Institute of Scientific and Technical Information of China (English)

    朱炜; 胡昊; 徐瑞华; 洪玲

    2013-01-01

    Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit(URT) under network operation. In order to describe the congestion’s impact to passengers’ route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today’s China.

  5. Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Kwok, K.S.; Driessen, B.J.; Phillips, C.A. [Sandia National Labs., Albuquerque, NM (United States); Tovey, C.A. [Georgia Inst. of Tech., Atlanta, GA (United States)

    1997-10-01

    This work considers the problem of maximum utilization of a set of mobile robots with limited sensor-range capabilities and limited travel distances. The robots are initially in random positions. A set of robots properly guards or covers a region if every point within the region is within the effective sensor range of at least one vehicle. The authors wish to move the vehicles into surveillance positions so as to guard or cover a region, while minimizing the maximum distance traveled by any vehicle. This problem can be formulated as an assignment problem, in which they must optimally decide which robot to assign to which slot of a desired matrix of grid points. The cost function is the maximum distance traveled by any robot. Assignment problems can be solved very efficiently. Solutions times for one hundred robots took only seconds on a Silicon Graphics Crimson workstation. The initial positions of all the robots can be sampled by a central base station and their newly assigned positions communicated back to the robots. Alternatively, the robots can establish their own coordinate system with the origin fixed at one of the robots and orientation determined by the compass bearing of another robot relative to this robot. This paper presents example solutions to the multiple-target-multiple-agent scenario using a matching algorithm. Two separate cases with one hundred agents in each were analyzed using this method. They have found these mobile robot problems to be a very interesting application of network optimization methods, and they expect this to be a fruitful area for future research.

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

    Science.gov (United States)

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

    2016-01-01

    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.

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

    Directory of Open Access Journals (Sweden)

    Wee Loon Lim

    2016-01-01

    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.

  8. New algorithm for robust H2/H∞ filtering with error variance assignment

    Institute of Scientific and Technical Information of China (English)

    刘立恒; 邓正隆; 王广雄

    2004-01-01

    We consider the robust H2/H∞ filtering problem for linear perturbed systems with steady-state error variance assignment. The generalized inverse technique of matrix is introduced, and a new algorithm is developed. After two Riccati equations are solved, the filter can be obtained directly, and the following three performance requirements are simultaneously satisfied: The filtering process is asymptotically stable; the steady-state variance of the estimation error of each state is not more than the individual prespecified upper bound; the transfer function from exogenous noise inputs to error state outputs meets the prespecified H∞ norm upper bound constraint. A numerical example is provided to demonstrate the flexibility of the proposed design approach.

  9. Particle swarm optimization algorithm for optimizing assignment of blood in blood banking system.

    Science.gov (United States)

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

    2015-01-01

    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.

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

    Directory of Open Access Journals (Sweden)

    Micheal O. Olusanya

    2015-01-01

    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.

  11. 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: mhong@iastate.edu [Iowa State University, Department of Chemistry (United States)

    2013-10-17

    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

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

    Science.gov (United States)

    Yang, Yu; Fritzsching, Keith J; Hong, Mei

    2013-11-01

    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 assignment for a

  13. A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem

    Science.gov (United States)

    Matayoshi, Mitsukuni; Nakamura, Morikazu; Miyagi, Hayao

    We propose a new 2-opt base method as a local search approach used with Genetic Algorithms (GAs) in Memetic Algorithm. We got a hint from the fast 2-opt method and devised the new 2-opt method. The main different point is such that our method exchanges genes by using histories of contributions to fitness value improvement. The contribution level is represented by the value `Priority’. In computer experiment, Quadratic Assignment Problem (QAP) instances are solved by GA with the 2-opt method(First Admissible Move Strategy, the Best Admissible Move Strategy), the fast 2-opt, and our proposed method for comparative evaluation. The results showed that our improved method obtained better solutions at ealier generation of the GA and our method required less computation time than the others at some upper bound value of appropriate `Priority’ setting values. Specially, at the average elapsed time of the fast 2-opt method’s 1000th generation, the exact solution findings of ours is more than the others. In further experiment, we observe that the searching capability depends on the number of levels of `Priority’. The ratio between two different Priority level sets becomes 1.59 in computation time in solving problem instance “char25a". This characteristic is shown to be statistically significant in ten instances among eleven.

  14. A general Monte Carlo/simulated annealing algorithm for resonance assignment in NMR of uniformly labeled biopolymers

    Science.gov (United States)

    Hu, Kan-Nian; Qiang, Wei; Tycko, Robert

    2011-01-01

    We describe a general computational approach to site-specific resonance assignments in multidimensional NMR studies of uniformly 15N,13C-labeled biopolymers, based on a simple Monte Carlo/simulated annealing (MCSA) algorithm contained in the program MCASSIGN2. Input to MCASSIGN2 includes lists of multidimensional signals in the NMR spectra with their possible residue-type assignments (which need not be unique), the biopolymer sequence, and a table that describes the connections that relate one signal list to another. As output, MCASSIGN2 produces a high-scoring sequential assignment of the multidimensional signals, using a score function that rewards good connections (i.e., agreement between relevant sets of chemical shifts in different signal lists) and penalizes bad connections, unassigned signals, and assignment gaps. Examination of a set of high-scoring assignments from a large number of independent runs allows one to determine whether a unique assignment exists for the entire sequence or parts thereof. We demonstrate the MCSA algorithm using two-dimensional (2D) and three-dimensional (3D) solid state NMR spectra of several model protein samples (α-spectrin SH3 domain and protein G/B1 microcrystals, HET-s218–289 fibrils), obtained with magic-angle spinning and standard polarization transfer techniques. The MCSA algorithm and MCASSIGN2 program can accommodate arbitrary combinations of NMR spectra with arbitrary dimensionality, and can therefore be applied in many areas of solid state and solution NMR. PMID:21710190

  15. Evolutionary decision-makings for the dynamic weapon-target assignment problem

    Institute of Scientific and Technical Information of China (English)

    CHEN Jie; XIN Bin; PENG ZhiHong; DOU LiHua; ZHANG Juan

    2009-01-01

    The dynamic weapon-target assignment (DWTA) problem is an important issue In the field of military command and control.An asset-based DWTA optimization model was proposed with four kinds of constraints considered,including capability constraints,strategy constraints,resource constraints and engagement feasibility constraints.A general "virtual"representation of decisions was presented to facilitate the generation of feasible decisions.The representation is in essence the permutation of all assignment pairs.A construction procedure converts the permutations into real feasible decisions.In order to solve this problem,three evolutionary decision-making algorithms,Including a genetic algorithm and two memeitc algorithms,were developed.Experimental results show that the memetic algorithm based on greedy local search can generate obviously better DWTA decisions,especially for large-scale problems,than the genetic algorithm and the memetic algorithm based on steepest local search.

  16. A Genetic Algorithm Approach for the TV Self-Promotion Assignment Problem

    Science.gov (United States)

    Pereira, Paulo A.; Fontes, Fernando A. C. C.; Fontes, Dalila B. M. M.

    2009-09-01

    We report on the development of a Genetic Algorithm (GA), which has been integrated into a Decision Support System to plan the best assignment of the weekly self-promotion space for a TV station. The problem addressed consists on deciding which shows to advertise and when such that the number of viewers, of an intended group or target, is maximized. The GA proposed incorporates a greedy heuristic to find good initial solutions. These solutions, as well as the solutions later obtained through the use of the GA, go then through a repair procedure. This is used with two objectives, which are addressed in turn. Firstly, it checks the solution feasibility and if unfeasible it is fixed by removing some shows. Secondly, it tries to improve the solution by adding some extra shows. Since the problem faced by the commercial TV station is too big and has too many features it cannot be solved exactly. Therefore, in order to test the quality of the solutions provided by the proposed GA we have randomly generated some smaller problem instances. For these problems we have obtained solutions on average within 1% of the optimal solution value.

  17. Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair

    Institute of Scientific and Technical Information of China (English)

    Su-juan ZHENG; Xiu-ming YU; Li-qing CAO

    2009-01-01

    Solving the absent assignment problern of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.

  18. Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair

    Directory of Open Access Journals (Sweden)

    Su-juan ZHENG

    2009-06-01

    Full Text Available Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.

  19. Equilibrium model and algorithm of urban transit assignment based on augmented network

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    The passenger flow assignment problem for the urban transit network is relatively complicated due to the complexity of the network structure and many factors influencing the passengers’ route and line choices. In the past three decades, many models have been proposed to solve the passenger flow assignment problem. However, the common-line problem remains challenging in transit flow assignment. In this paper, the characteristics of the urban transit network is analysed and a new technique of augmented network is proposed to represent the urban transit system. The purpose is to eliminate the complex common-line problem when modeling transit passenger flow assignment. Through this augmentation technique, the urban transit system can be represented by an augmented network-it then behaves like a simple network and can be used as a generalized network for traffic assignment or network analysis. This paper presents a user equilibrium model for the urban transit assignment problem based on such a technique. A numerical example is also provided to illustrate the approach.

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

    Science.gov (United States)

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

    2014-08-01

    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 www.chem.umn.edu/groups/veglia/forms/flamengo2-form.html.

  1. A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors

    Science.gov (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.

  2. Particle Swarm Optimization/Greedy-Search Algorithm for Helicopter Mission Assignment in Disaster Relief

    OpenAIRE

    Andreeva-Mori, Adriana; KOBAYASHI, Keiji; Shindo, Masato; アンドレエバ森, アドリアナ; 小林, 啓二; 真道, 雅人

    2015-01-01

    In the immediate aftermath of a large-scale disaster, optimal helicopter rescue mission assignment is critical to saving many lives. However, the current practice in the field is mostly human centered. The Japan Aerospace Exploration Agency has been developing a decision support system for aircraft operation in order to promptly plan and execute rescue missions. The current research focuses on evacuation missions in particular and investigates the potential of particle swarm optimization with...

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

    OpenAIRE

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

    2015-01-01

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

  4. Multiple People Picking Assignment and Routing Optimization Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    孙慧

    2014-01-01

    In order to improve the picking efficiency, reduce the picking time, this paper take artificial picking operation of a certain distribution center which has double-area warehouse as the studying object. Discuss the picking task allocation and routing problems. Establish the TSP model of order-picking system. Create a heuristic algorithm bases on the Genetic Algorithm (GA) which help to solve the task allocating problem and to get the associated order-picking routes. And achieve the simulation experiment with the Visual 6.0C++platform to prove the rationality of the model and the effectiveness of the arithmetic.

  5. Rigorous Progress on Algorithms Based Routing and Wavelength Assignment in Trans-Egypt Network (TEGYNET Management

    Directory of Open Access Journals (Sweden)

    Abd El–Naser A. Mohammed

    2013-02-01

    Full Text Available In simple wavelength-division multiplexed (WDM networks, a connection must be established along a route using a common wavelength on all of the links along the route. The introduction of wavelength converters into WDM cross connects increases the hardware cost and complexity. Given a set of connection requests, the routing and wavelength assignment problem involves finding a route (routing and assigning a wavelength to each request. This paper has presented the WDM technology is being extensively deployed on point to point links within transport networks in the EGYPT. However, WDM promises advantages for switching and routing as well as for transmission. Optical cross connects are currently being developed which can switch an entire wavelength from an input fiber to an output fiber so that large bandwidth circuits can be routed through the network according to wavelength. High speed, fixed bandwidth, end to end connections called lightpaths can then be established between different nodes. Our suggested Trans-Egypt Network (TEGYNET which uses optical cross connects to route lightpaths through the network are referred to as wavelength routing networks. The average setup time, average link utilization, traffic load, blocking probability, and achievable link utilization in the presence of both single path and multi math routing are the major interesting parameters in the design of TEGYNET topology.

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

    2014-01-01

    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.

  7. Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modified genetic algorithm with multi-type genes

    Institute of Scientific and Technical Information of China (English)

    Deng Qibo; Yu Jianqiao; Wang Ningfei

    2013-01-01

    The task assignment problem of multiple heterogeneous unmanned aerial vehicles (UAVs), concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources (e.g., weapons) onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo-somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.

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

    Science.gov (United States)

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

    2015-01-01

    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.

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

  10. Multi-criteria optimal pole assignment robust controller design for uncertainty systems using an evolutionary algorithm

    Science.gov (United States)

    Sarjaš, Andrej; Chowdhury, Amor; Svečko, Rajko

    2016-09-01

    This paper presents the synthesis of an optimal robust controller design using the polynomial pole placement technique and multi-criteria optimisation procedure via an evolutionary computation algorithm - differential evolution. The main idea of the design is to provide a reliable fixed-order robust controller structure and an efficient closed-loop performance with a preselected nominally characteristic polynomial. The multi-criteria objective functions have quasi-convex properties that significantly improve convergence and the regularity of the optimal/sub-optimal solution. The fundamental aim of the proposed design is to optimise those quasi-convex functions with fixed closed-loop characteristic polynomials, the properties of which are unrelated and hard to present within formal algebraic frameworks. The objective functions are derived from different closed-loop criteria, such as robustness with metric ?∞, time performance indexes, controller structures, stability properties, etc. Finally, the design results from the example verify the efficiency of the controller design and also indicate broader possibilities for different optimisation criteria and control structures.

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

    2014-01-01

    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......In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight...... the differences in operations between bulk ports and container terminals which highlights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve...

  12. 一种动态个人最优交通分配的启发式方法%A Heuristic Algorithm for an Optimized Dynamic User Traffic Assignment

    Institute of Scientific and Technical Information of China (English)

    徐天泽; 黄德镛

    2004-01-01

    给出了一种基于动态最短路的动态个人最优交通分配的启发式方法.同时提出了与动态个人最优交通分配相关的一些定义.%A heuristic algorithm based on dynamic shortest paths for an optimized dynamic user traffic assignment is suggested. Several definitions related to the optimized dynamic user traffic assignment are also given.

  13. Glowworm Swarm Optimization Algorithm for Radar Target Assignment%基于萤火虫算法的雷达目标分配方法

    Institute of Scientific and Technical Information of China (English)

    田德伟; 何广军; 尤晓亮; 李槟槟

    2015-01-01

    Target assignment for optimizing the detecting effectiveness in multi-sensor management system is a non-deterministic polynomial problem.A method of radar target assignment based on glowworm swarm optimi-zation (GSO)algorithm was mentioned to solve radar target assignment problem,which was converted into mul-tidimensional knapsack problem.The use of artificial glowworm swarm optimization algorithm for the objective function for optimization and allocation strategy was determined.Simulation results showed that the algorithm was of more stable and quick convergent on radar target assignment.%针对多传感器管理的目标分配问题中如何使监测效果最佳的 NP 难题,提出了基于萤火虫算法的雷达目标分配方法,将雷达目标分配问题分解为多维背包问题,使用人工萤火虫群优化算法对目标函数进行寻优并确定分配策略。仿真结果表明,萤火虫算法在解决雷达目标分配问题时具有收敛速度快,求解结果稳定的优点,在军事运筹领域具有广泛的应用前景。

  14. FindFoci: a focus detection algorithm with automated parameter training that closely matches human assignments, reduces human inconsistencies and increases speed of analysis.

    Directory of Open Access Journals (Sweden)

    Alex D Herbert

    Full Text Available Accurate and reproducible quantification of the accumulation of proteins into foci in cells is essential for data interpretation and for biological inferences. To improve reproducibility, much emphasis has been placed on the preparation of samples, but less attention has been given to reporting and standardizing the quantification of foci. The current standard to quantitate foci in open-source software is to manually determine a range of parameters based on the outcome of one or a few representative images and then apply the parameter combination to the analysis of a larger dataset. Here, we demonstrate the power and utility of using machine learning to train a new algorithm (FindFoci to determine optimal parameters. FindFoci closely matches human assignments and allows rapid automated exploration of parameter space. Thus, individuals can train the algorithm to mirror their own assignments and then automate focus counting using the same parameters across a large number of images. Using the training algorithm to match human assignments of foci, we demonstrate that applying an optimal parameter combination from a single image is not broadly applicable to analysis of other images scored by the same experimenter or by other experimenters. Our analysis thus reveals wide variation in human assignment of foci and their quantification. To overcome this, we developed training on multiple images, which reduces the inconsistency of using a single or a few images to set parameters for focus detection. FindFoci is provided as an open-source plugin for ImageJ.

  15. Strengthening Universal Primary Education in Uganda: The Potential Role of an Asset-Based Development Policy

    Science.gov (United States)

    Ssewamala, Fred M.; Wang, Julia Shu-Huah; Karimli, Leyla; Nabunya, Proscovia

    2011-01-01

    This paper is divided into three complementary parts. First, we examine the challenges to the Universal Primary Education (UPE) policy in Uganda, including insufficient instructional materials and family-level poverty. Second, guided by asset theory, and based on a systematic review of studies on asset-based development programs and interventions,…

  16. Frequency Assignment Based on Genetic algorithm on Battlefield%基于遗传算法的战场频率分配研究

    Institute of Scientific and Technical Information of China (English)

    陈自卫; 贺强; 喻永成

    2015-01-01

    Frequency assignment problem is the core of the electromagnetic spectrum management .The aim is to use the separation of frequencies assigned to minimize interference in the network ,while using spectrum efficiently at the same time .A mathematic model for frequency assignment based on minimum interference is introduced ,the frequency assignment method based on genetic algorithm is put forward ,and many assignment combinations of frequency can be gained by the method .%频率分配是指为用频台站合理的频率分配,使相互之间不产生干扰或者干扰最小,是军事电磁频谱管理的基础性内容。建立了基于干扰最小的频率分配数学模型,提出了基于遗传算法的频率分配算法,可以得到满足战场分配需求的多个分配组合。

  17. 改进蚁群算法在二次分配问题中的应用%Application of Improved Ant Colony Algorithm for Quadratic Assignment Problems

    Institute of Scientific and Technical Information of China (English)

    袁东锋; 吕聪颖

    2013-01-01

    为了解决基本蚁群算法在求解大规模二次分配问题时暴露出的缺陷,本文提出一种改进的蚁群算法.在基本蚂蚁算法中,采用全局信息素更新策略,使用距离及流量作为启发式信息并引入局部优化策略,对每代的最优解进行改进,进一步加快算法的收敛速度.通过对于二次分配问题的3种不同类型的问题进行实验,将改进的蚁群算法与基本蚂蚁算法及混合遗传算法进行比较,结果表明该改进算法具有更优的性能.%In order to solve the problems that the basic ant colony algorithm for solving large scale quadratic assignment has revealed defects, this paper proposes an improved ant colony algorithm. This algorithm adopts the global pheromone update strategy, the use of distance and traffic as heuristic information and the introduction of local optimization strategy. The optimal solution for each generation is to improve and further accelerate the convergence speed. For the quadratic assignment problem through three different types of problems, and improved ant colony algorithm with the basic ant algorithm and the hybrid genetic algorithm are compared, the experiments show that the improved method has better performance.

  18. Cooperative Task Assignment for Multiple Fighters Using Improved MOSFLA Algorithm%基于改进MOSFLA的多机协同任务分配

    Institute of Scientific and Technical Information of China (English)

    何建华; 王安龙; 陈松; 张越; 刘琨; 赵焕义

    2014-01-01

    为解决多机协同任务分配这一多约束组合优化问题,提出了一种基于矩阵二进制编码的改进多目标混合蛙跳算法( multi-objective shuffled frog-leaping algorithm, MOSFLA)的任务分配策略。首先,建立了基于目标剩余价值、战机攻击损耗和航程代价的多目标优化模型;然后,对混合蛙跳算法的位置更新策略进行了改进,以保证更新过程中解的可行性及算法的全局收敛能力;最后,利用改进算法求解多机协同对地攻击任务分配问题,得出问题的Pareto最优解集。仿真实验表明,改进算法能够在较短时间内同时得出多个分配方案,增加决策的灵活性。%The multi-fighter cooperative task assignment problem is a multi-constrained combinatorial optimization problem. In order to solve this problem, a multi-objective shuffled frog-leaping algorithm ( MOSFLA) based on ma-trix binary encoding is proposed. First of all, it establishes a multi-objective optimization model of task assignment by using the target residual value, the damages of fighters and the voyage costs. Then to ensure the feasibility of so-lutions produced in the update process and to ensure the global convergence capability of the improved algorithm, it improves the individual position update strategy of shuffled frog-leaping algorithm. Finally, it uses the improved al-gorithm to obtain the Pareto optimal solutions in air-to-ground attack mission assignment problem. Simulation results and their analysis show preliminarily that the improved algorithm can come in a variety of task assignment alterna-tives in a short time simultaneously, thus increasing the flexibility of the decision.

  19. A Path towards uncertainty assignment in an operational cloud phase algorithm from ARM vertically pointing active sensors

    Energy Technology Data Exchange (ETDEWEB)

    Riihimaki, Laura D.; Comstock, Jennifer M.; Anderson, K. K.; Holmes, Aimee E.; Luke, Edward

    2016-06-10

    Knowledge of cloud phase (liquid, ice, mixed, etc) is necessary to describe the radiative impact of clouds and their lifetimes, but is a property that is difficult to simulate correctly in climate models. One step towards improving those simulations is to make observations of cloud phase with sufficient accuracy to help constrain model representations of cloud processes. A variety of methods, based primarily on decision tree approaches, have been used to identify cloud phase from active remote sensors. These algorithms do not include uncertainty estimates, which contributes an unknown amount of uncertainty to the retrieval of cloud microphysical properties and to model parameterization development and evaluation. In this study, we outline a methodology using a Bayesian classifier to estimate the probabilities of cloud phase class from Atmospheric Radiation Measurement (ARM) vertically pointing active remote sensors. We also test the value of including higher moments of the cloud radar Doppler spectrum than are traditionally used operationally. Using training data of known phase from the Mixed-Phase Arctic Cloud Experiment (M-PACE) field campaign, we demonstrate a proof of concept for how the algorithm can be trained and run as an operational cloud phase retrieval. Over 95% of data is identified correctly for pure ice and liquid cases used in this study. Mixed-phase and snow cases are more problematic to identify correctly. When lidar data are not available, including additional information from the Doppler spectrum provides substantial improvement to the algorithm.

  20. 武器目标协同火力分配建模及算法%Modeling and Algorithm of Weapon Target Cooperative Fire Assignment

    Institute of Scientific and Technical Information of China (English)

    李平; 李长文

    2015-01-01

    Aimming at the disadvantages of current fire assignment model and the requirements of the practical operation, the problem of weapon target cooperative fire assignment is researched, and the hierarchical structure of fire assignment is built out. Through the research of the fire assignment principles and integrating targets selection and missile target assign⁃ment, the fire assignment model is established, which takes the efficiency cost ratio of missile weapon operation as the opti⁃mization objective, and subjected to the target damage requirements. Aiming at the fire assignment problem, genetic algo⁃rithm is improved by utilizing characteristics of the problem and heuristic information. Simulation results show that the im⁃proved genetic algorithm has better optimization ability and can solve the optimization problem in this paper effectively.%针对当前火力分配模型的不足以及实际作战的需求,对武器目标协同火力分配问题进行了研究,建立了火力分配层次结构;通过对火力分配原则的研究,结合打击目标选择和弹目分配,建立了以导弹武器作战效费比为总目标,以目标毁伤要求为约束的火力分配模型。采用遗传算法求解火力分配问题,根据问题的特点和问题中的启发信息,对遗传算法进行了改进。仿真结果表明,改进算法的性能有较大提高,可用于解决复杂武器目标分配这类非线性整数规划问题。

  1. Bacterial foraging algorithm for quadratic assignment problems%细菌觅食算法求解二次分配问题

    Institute of Scientific and Technical Information of China (English)

    戴秋萍; 马良; 郗莹

    2013-01-01

    To solve the quadratic assignment problems efficiently,a new intelligent optimization algorithm based on group searching strategy is proposed called bacterial foraging optimization algorithm (BFO).The bacteria feeding process is simulated,and the information of the bacterial individual is combined the bacterial group.It's efficiently to avoid the local optimization by adopting the new strategy,and the adaptive search step length improves the optimization of the convergence speed.Compared to other algorithms indicate that this algorithm is better than the other algorithm in quality of optimization.%为有效解决二次分配问题,提出了一种基于群体搜索的群智能优化算法—细菌觅食算法.算法模拟了细菌觅食全过程,并将细菌个体信息与探索细菌群体信息进行结合,采用了群体搜索策略进行局部寻优.该策略有效的避免了算法陷入局部最优,而算法中采用的自适应搜索步长,进一步提高了优化的收敛速度.实验结果表明,用细菌觅食算法解决二次分配问题,并将仿真结果与其他算法进行比较,表明了该算法的搜索质量优于其他算法.

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

    Science.gov (United States)

    Iyer, Sridhar

    2016-12-01

    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.

  3. 二次分配问题的大洪水算法求解%Great Deluge Algorithm for Quadratic Assignment Problem

    Institute of Scientific and Technical Information of China (English)

    魏欣; 马良; 张惠珍

    2011-01-01

    大洪水算法是一种求解组合优化问题的独特方法,该方法通过模拟洪水上涨的过程来达到求解一些组合优化难题的目的.本文运用该方法求解二次分配问题(QAP),设计了相应的算法程序,并对QAPLIB(二次分配基准问题库)中的算例进行了实验测试,结果表明,大洪水算法可以快速有效地求得二次分配问题的优化解,是求解二次分配问题的一个新的较好方案.%The great deluge algorithm ( GDA) is a special approach for solving combinatorial optimization problems.It can be used to solve some NP-hard combinatorial optimization problems through simulating the process of flood rising.In this paper, we use this algorithm to solve the quadratic assignment problem and design the corresponding program.The instances in the QABLIB are tested experimentally.And the results show that the algorithm is able to find the optimal solution quickly and effectively, and that the CDA is a new and promising method for the QAP.

  4. CNVrd, a read-depth algorithm for assigning copy-number at the FCGR locus: population-specific tagging of copy number variation at FCGR3B.

    Directory of Open Access Journals (Sweden)

    Hoang tan Nguyen

    Full Text Available The extent of contribution from common gene copy number (CN variants in human disease is currently unresolved. Part of the reason for this is the technical difficulty in directly measuring CN variation (CNV using molecular methods, and the lack of single nucleotide polymorphisms (SNPs that can tag complex CNV that has arisen multiple times on different SNP haplotypes. One CNV locus implicated in human disease is FCGR. Here we aimed to use next-generation sequencing (NGS data from the 1000 Genomes Project to assign CN at FCGR3A and FCGR3B and to comprehensively assess the ability of SNPs to tag specific CN variants. A read-depth algorithm was developed (CNVrd and validated on a subset of HapMap samples using CN assignments that had previously been determined using molecular and microarray methods. At 7 out of 9 other complex loci there was >90% concordance with microarray data. However, given that some prior knowledge of CN is required, the generalizability of CNVrd is limited and should be applied to other complex CNV loci with caution. Subsequently, CN was assigned et FCGR3B using CNVrd in a total of 952 samples from the 1000 Genomes Project, using three classes and SNPs that correlated with duplication were identified. The best tag SNP was observed in the Mexican-American sample set for duplication at FCGR3B. This SNP (rs117435514, r² = 0.79 also tagged similar duplication in Chinese and Japanese (r² = 0.35-0.60, but not in Caucasian or African. No tag SNP for duplication at FCGR3A or deletion at FCGR3B was identified in any population. We conclude that it is possible to tag CNV at the FCGR locus, but CN and SNPs have to be characterized and correlated on a population-specific basis.

  5. Cuckoo Search Algorithm for Quadratic Assignment Problem%二次分配问题的布谷鸟搜索算法

    Institute of Scientific and Technical Information of China (English)

    许秋艳

    2015-01-01

    二次分配问题是一种典型的组合优化难题。该问题由于目标函数的非线性而使得问题的求解异常复杂。为求解二次分配问题,设计基于布谷鸟搜索算法的优化方法。布谷鸟搜索算法是一种新型现代启发式算法,具有结构简单和易于编程等特点。针对二次分配问题的特点,给出算法的实现流程。实验结果表明该算法的可行性和有效性。%Quadratic Assignment Problem (QAP) is a typical hard problem in combinatorial optimization. It is hard to solve QAP because of its non-linear objective function. To solve QAP, proposes a method based on Cuckoo Search Algorithm (CSA). CSA is a novel metaheuristic which is simple and easy to program. According the features of QAP, shows the algorithm procedure. The results demonstrate that the presented method is feasible and effective.

  6. Random Cell Identifiers Assignment

    Directory of Open Access Journals (Sweden)

    Robert Bestak

    2012-01-01

    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.

  7. Target Optimal Assignment of Multi-Reconnaissance Sensor by Generic Algorithm%应用GA的多侦察传感器目标最优分配

    Institute of Scientific and Technical Information of China (English)

    周磊; 朱峰; 刘明辉

    2012-01-01

    Pros and cons on target assignment of multi - reconnaissance sensor training mission directly affect training effect. By analyzing the quantity and category of sensor and target, confirming the objective function,building the rational simulation programming model, and taking generic algorithm as search method, the best reconnaissance efficacy Plan of Target Assignment can be found out rapidly and effectively, which affordes beneficial help to training under best reconnaissance efficiency, and shortens the mission period and economizes the resource.%研究优化侦察效果问题,多侦察传感器训练演练任务中的侦察目标分配优劣直接影响着训练演练效果.为了提高侦察效能,通过分析传感器和目标的类别及数量,建立明确的目标函数,组成合理的仿真规划模型,采用遗传算法作为搜索最优方法,克服了传统算法缺点,能够快速而且有效地找出最大侦察效能下的目标分配方案.仿真结果表明,改进的方法为多传感器最佳侦察效果的相应训练演练提供了有益的帮助,节省了任务周期,降低了资源消耗.

  8. A note on ranking assignments using reoptimization

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  9. Balanced input-output assignment

    Science.gov (United States)

    Gawronski, W.; Hadaegh, F. Y.

    1989-01-01

    Actuator/sensor locations and balanced representations of linear systems are considered for a given set of controllability and observability grammians. The case of equally controlled and observed states is given special attention. The assignability of grammians is examined, and the conditions for their existence are presented, along with several algorithms for their determination. Although an arbitrary positive semidefinite matrix is not always assignable, the identity grammian is shown to be always assignable. The results are extended to the case of flexible structures.

  10. The Research of Cooperative Task Assignment of Multiple UAVs Based on Hybrid Bacterial Foraging Algorithm%基于混合细菌觅食算法的多无人机任务分配研究

    Institute of Scientific and Technical Information of China (English)

    杨尚君; 王社伟; 陶军; 赵德林

    2011-01-01

    The multi-UAV cooperative task assignment problem is the key way to resolve multi-UAV cooperative control. Firstly, the features of UAV task assignment are analyzed in depth, and then the extended mixed integer linear programming (MILP) model for task assignment is established. Due to the analysis of the advantages and disadvantages of the bacterial foraging optimization algorithm and particle swarm optimization, a hybrid optimization algorithm with stronger global search ability and faster convergence is proposed. Finally, the algorithm applied to multi-UAV cooperative task assignment is implemented and simulated, and the simulation results show the hybrid algorithm is more effective than the standard PSO and bacterial foraging algorithm.%多无人机协同任务分配问题是多无人机协同控制的关键.本文首先深入分析多无人机任务分配问题的特点,建立了扩展的混合整数线性规划(MILP)任务分配模型.其次,通过分析细菌觅食优化算法和粒子群优化算法的优缺点,提出一种具有较强全局搜索能力且收敛速度快的混合细菌觅食优化算法.最后将该算法应用于多无人机协同任务分配中并进行了仿真实验,仿真结果表明该方法在求解效率上比标准粒子群算法和标准细菌觅食算法有显著提高.

  11. 基于量子遗传算法的航空通信频率动态分配%Dynamic Aeronautical Communication Frequency Assignment Based on Quantum Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    徐雪飞; 李建华; 沈迪; 郭蓉

    2015-01-01

    For more efficient aeronautical communication frequency assignment,a method for dynamic aero-nautical communication frequency assignment based on quantum genetic algorithm ( QGA ) is proposed. Through analyzing the thought of dynamic frequency assignment,the architecture of dynamic frequency as-signment is constructed,then a flow chart for it is given. On this basis,the dynamic aeronautical communi-cation frequency assignment problems are discussed,the constraint condition for dynamic frequency assign-ment is defined,and then the dynamic aeronautical communication frequency assignment model is estab-lished. Finally, the QGA and genetic algorithm( GA) are used to simulate the same examples and the re-sult shows that the QGA has more advantages in population fitness and convergence rate,and the dynamic frequency assignment model can dynamically adjust fitness under the condition of different populations. The method meets the practice and application requirements of dynamics,accuracy and timeliness for aero-nautical communication frequency assignment.%为了更加有效地对航空通信频率进行分配,提出了一种基于量子遗传算法的航空通信频率动态分配方法。通过对频率动态分配思路进行分析,建立了频率动态分配框架,给出了频率动态分配的具体流程。在此基础上,讨论了航空通信频率动态分配问题,定义了航空通信频率动态分配约束条件,建立了航空通信频率动态分配模型。最后,运用量子遗传算法和遗传算法对算例进行仿真对比。结果表明:量子遗传算法在种群适应度和收敛速度上具备明显的优越性,频率动态分配模型能够根据不同种群数量条件动态调整适应度,能够较好满足航空通信频率分配问题动态性、准确性、时效性等实践运用要求。

  12. 基于量子遗传算法的光电干扰资源优化分配研究%Optimization Assignment Model for Electro-optic Jamming Resources Based on Quantum Genetic Algorithms

    Institute of Scientific and Technical Information of China (English)

    吴涛; 王迅

    2011-01-01

    Combining the principle of the target assignment for the defense strategy in an electro-optic information system,A model for the optimization assignment of jamming resources is established.The solution and steps are presented by using the quantum genetic algorithms.With the example simulation,it succeeds in obtaining an optimum assignment scheme for jamming resources.The simulation shows that the proposed solution superiors to the genetic algorithms and is a valid methods to the solution of the model for the optimization assignment of jamming resources.%结合光电信息系统作战运筹中目标分配原则,建立了干扰资源优化分配模型。给出了基于量子遗传算法的模型求解方法及步骤,并进行了实例仿真,得出了最佳干扰资源分配方案。仿真结果表明,该方法优于遗传算法,对于求解干扰资源优化分配模型是有效、可行的。

  13. Hybrid strategy with ant colony and simulated annealing algorithm and its improvement in target assignment%目标分配的蚁群-模拟退火算法及其改进

    Institute of Scientific and Technical Information of China (English)

    麻士东; 龚光红; 韩亮; 宋晓

    2011-01-01

    In the process of air-to-ground attacking by helicopter formations, target assignment plays an important role in completing military tasks. The integrated interest function and the principle of helicopter target assignment are made. Target assignment in helicopter formation' s air-to-ground attacking is realized by using hybrid strategy with ant colony algorithm and simulated annealing algorithm. Aimed at the defect because of deciding current best solution by integrated interest function, the hybrid strategy are improved, that is, to decide current best solution by amount of pheromone. So the best solution can be determined both by integrated interest function and amount of pheromone, and bad individual interests and slow convergence will be avoided in order to get maximal interests in process of assignment. A test is given to validate the improved hybrid algorithm, and the results indicate that the improved algorithm has a better performance in finding optimal solution and more quick convergence than before, and has a more reasonable assignment results.%直升机编队的对地攻击过程中,目标分配是实现作战任务的重要条件.确定了直升机目标分配的优势度计算方法以及目标分配的原则.利用蚁群-模拟退火算法实现了直升机对地攻击的目标分配过程,并针对分配过程中,采用综合优势度最大来确定最优路径所出现的不足对算法进行了改进,即根据信息素的积累量来确定最优路径,能够综合考虑信息素浓度与优势度的影响,避免了为达到全局最大优势度而出现的个体分配效益不好以及收敛缓慢的情况.实验结果表明,改进的算法效率更高,收敛的速度较之前更快,分配结果更趋合理.

  14. The Relation between Two Types of Traffic Assignment Models' Algorithm and It's Application%两类交通分配模型算法的关系及其应用

    Institute of Scientific and Technical Information of China (English)

    俞礼军; 严宝杰

    2001-01-01

    The relation between two types of traffic assignment model(four models) is discussed. It is discovered that capacity restraint traffic assignment's algorithm can be transformed into UE model's algorithm by adding one mold. The research is useful for programming software based on UE model in traffic planning. Furthermore, classifying problem of all-or-nothing traffic assignment model is analyzed. The results can be used in engineering.%针对两类(4个)交通分配模型及其关系,以及“全有全无”交通分配模型归类问题进行了研究,通过对比研究发现,仅需在目前常用的基于容限交通分配模型的算法中加入一个模块即可实现一种用户平衡模型的结果,为编写一类用户平衡的软件提供了捷径,对理论与实践也有一定的指导价值。

  15. 基于"虚拟工序库"作业系统的工人指派模型及算法研究%A Research on Worker Assignment Model and Its Algorithm Based on the "Virtual Process Database" Operating System

    Institute of Scientific and Technical Information of China (English)

    程硕; 张毕西; 曹铭; 胡盛强

    2015-01-01

    为中小制造型企业生产模式下的"虚拟工序库"作业系统中的工人指派制定合理的方案,以生产成本最小化为目标,构建满足订单交货期的工人指派模型,采用种群的精英保留的遗传算法对此问题进行优化,并通过实例仿真验证了该方法增强了全局的寻优能力,提高全局的收敛速度,研究表明该方法对解决工人指派问题是行之有效的.%:In order to obtain a reasonable worker-assignment plan for small and medium-sized manufac-turing enterprises under"virtual process database" ( VPDs) operating system, and to minimize production cost, a worker-assignment model is constructed, through using the improved genetic algorithm of elitism preservation, optimizing the workers′assignment and scheduling in VPDs.Repeated simulation experi-ments and comparison show that the improved genetic algorithm has the faster speed of convergence, which indicates that it is effective.

  16. 移动 Ad Hoc 网络安全分配地址算法%Algorithm of Security Assigning Addresses for Mobile Ad Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    吴岳

    2013-01-01

    通过分析现有自动地址分配算法中存在的安全隐患,采用目前通用的加密算法,提出一种安全的网络地址自动分配算法。无论是移动网络还是传统网络,采用该算法进行自动分配地址,被攻击的概率是非常低的。%Through analysis of the security risks existing in automatic address allocation algorithm , using common encryption algo-rithms currently , this paper presents a secure network address auto allocation algorithm .Both the mobile network and traditional networks , using the algorithm for automatic address allocation , the probabilities of being attacked are very low .

  17. 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: florian.weigend@kit.edu [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)

    2014-10-07

    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.

  18. Method for frequency assignment based on hybrid particle swarm optimization algorithm%基于混合粒子群优化的频率指配方法研究

    Institute of Scientific and Technical Information of China (English)

    薛寒; 刘培国; 黄纪军

    2015-01-01

    A mathematical model suitable for frequency assignment is built in this paper,in which certain factors affecting the electromagnetic environment are transformed to the constraints,and then the cost function is constructed,to make the elec-tromagnetic environment to be described quantitatively. Hybrid particle swarm optimization algorithm is used to solve the prob-lem of frequency assignment,in which the thought of genetic algorithm is introduced,and natural selection and hybridization means are added in the iterative process. The simulation results indicate that the algorithm converges quickly and has a certain capability to avoid its falling into local optimum.%建立适用于频率指配问题的数学模型,将电磁兼容性分析的各类因素转化为约束条件,使得电磁兼容问题可以被定量描述,并在此基础上构建了代价函数.采用粒子群优化算法来解决频率指配的问题,在算法的迭代过程中引入了遗传算法思想,加入了自然选择和杂交的手段.仿真证明算法能够达到较快的收敛速度,并有一定的避免陷入局部最优的能力.

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

    Science.gov (United States)

    Weigend, Florian

    2014-10-07

    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 PtHf12 and [LaPb7Bi7](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.

  20. 基于航班机型分配的机队规划启发式算法%Heurist algorithm of fleet planning based on airline fleet assignment

    Institute of Scientific and Technical Information of China (English)

    汪瑜; 孙宏

    2011-01-01

    Traditional fleet planning methods could not accurately reflect airlines' operation environment.In order to solve this problem, based on airline fleet assignment technique, this research constructed a new fleet planning algorithm. The basic idea was given candidate aircraft types and airline's production and operation environment, which contained route network, flight schedule, traffic demand and mean fare level, this algorithm used fleet assignment technique to optimize airline fleet composition. Firstly, the flight fleet assignment was described as a network flow model in time sequence network. Secondly, the algorithm regarded the minimum "flight pairings-aircraft type assignment" cost as objective function, there and there only one competitive aircraft type in the fleet and lowest numbers of selected aircraft types were taken as constraints. Finally, the simulated annealing algorithm was set up. Simulation shows that for problem which scale is 13 fiight pairings and 7 candidate aircraft types, the average calculating time is 5.42 seconds,results are stable and feasible.%为了解决传统机队规划方法无法准确反映航空公司运营环境的问题,从航班机型分配的角度为航空公司设计机队规划算法,其基本思想是:给定候选机型以及航空公司生产运营环境(航线网络、航班计划、航班订座需求和平均票价水平),利用航班机型分配寻找最优的机队配置方案.将航班机型分配描述为时序网络图中的网络流问题,以"航班节-航班机型分配"成本最小为目标函数,机队中有且仅有一种竞争机型,被选用机型最低飞机数为约束条件设计模拟退火算法.仿真结果表明:对规模为13个航班节,7种候选机型的问题,算法平均运算时间为5.42秒,结果稳定且高效可行.

  1. Applications in channel assignment based on improved artificial bee colony algorithm%改进人工蜂群算法在信道分配上的应用

    Institute of Scientific and Technical Information of China (English)

    刘俊霞; 贾振红; 覃锡忠; 常春; 王浩

    2013-01-01

    The frequency resources of mobile communication network are limited, in order to improve wireless resource utiliza-tion, the improved artificial bee colony algorithm is to solve the wireless channel allocation problem. The proposed algorithm with gradually reduced dynamic step balances local and global search capability. The introduction of the single-individual selec-tive mutation increases population diversity and the convergence speed. Simulation results show that the improved algorithm can be better to solve the wireless channel allocation, improve the convergence rate and convergence speed of algorithm.%  移动通信网络中频率资源是有限的,为了提高无线资源的利用率,将改进的人工蜂群算法用于解决无线信道分配问题。提出的算法用逐步减小邻域搜索范围的动态步长来均衡局部与全局搜索能力;对单个体引入选择性变异技术,增加了种群的多样性,加快了算法的收敛速度。仿真结果表明,改进后的算法能较好地解决无线信道分配问题,提高了算法的收敛率和收敛速度。

  2. 一种面向体系结构的自适应软件构件分派模型及算法%An Assignment Model and Algorithm for Self-Adaptive Software Based on Architecture

    Institute of Scientific and Technical Information of China (English)

    陈洪龙; 李仁发; 李蕊; Edwin Sha

    2011-01-01

    The research on self-adaptive evolution software is one of the new focuses in the field of software engineering, and the online evolution that makes software adapt to the changing environment according to the architecture meta information attracts most people's attention. But due to the insufficient consideration in non-function requirements of software evolution, we focus on the optimal component assignment problem in self-adaptive software which is continuously meeting system's constraints based on architecture information during runtime. In this paper, the component assignment based architecture model is firstly described in detail, and a component assignment model is set up for this problem and proved to be NP (non-deterministic polynomial). And then we propose a heuristic algorithm to find a solution for this problem. Finally, the experimental results show that compared with the algorithm of greedy and ILP, the proposed algorithm has many advantages such as multi-object balance and time performance, and compared with ILP alone, the algorithm has better time performance. So it testifies that the heuristic algorithm proposed in this paper is effective for online evolution decision.%自适应演化软件是近年来软件工程领域的研究热点,而以体系结构为中心的自适应演化尤其受到重视.针对当前演化中对非功能性约束关注的不足,着重对面向体系结构的自适应演化框架中构件的分派优化问题进行研究.首先详细描述了基于体系结构模型的构件分派问题,并建立能够满足嵌入式软件构造机制中非功能性约束的分派模型,接着证明该分派问题为NP完全问题,最后提出一种启发式分派算法找出近似最优解,实验表明,与贪婪和整线性规划算法相比,该算法具有多目标均衡的优势;而与整线性规划算法相比,虽然不能保证找到最优解,但具有较大的计算时间优势.

  3. An estimation of distribution algorithm applied to weapon-target assignment problem and its parameter design%武器-目标分配问题的分布估计算法及参数设计

    Institute of Scientific and Technical Information of China (English)

    高尚

    2012-01-01

    An optimization model of the weapon-target assignment problem (WTA) is given. The similarities and differences of the distribution algorithm and the genetic algorithm are analyzed. The estimation distribution algorithm (EDA) is applied to solve the weapon-target assignment problem. In the EDA, through the statistics of the information of selected individuals in the current group, the probability of the individual distribution in next generation is given and the next generation of group is formed by random sampling. The influence of several parameter design strategies such as population and selection proportion is analyzed. It is concluded that the algorithm with a moderate population and a moderate selection proportion can efficiently find the converged solution among those algorithms. Simulation results show that the EDA is reliable and effective for solving the weapon-target assignment problem. This method has good scalability, and it can be modified to solve general combinatorial optimization problems.%建立了武器-目标分配问题的优化模型,分析了分布估计算法与遗传算法的异同.将分布估计算法应用于武器-目标分配问题,该算法通过统计当前群体中优选出的个体信息,给出下一代个体的概率估计,用随机取样的方法生成下一代群体.分析了个体种群数量、选择比例等参数对算法的影响,得出个体种群数量和选择比例取适中时效果最好的结论.仿真结果表明了分布估计算法求解武器-目标分配问题是可靠有效的.此方法具有较好的可扩展性,修改此算法可解决一般组合优化问题.

  4. Ant Colony Algorithm based on the ASRank and MMAS for the Aircraft Assigning Problem%基于ASRank和MMAS的蚁群算法求解飞机指派问题

    Institute of Scientific and Technical Information of China (English)

    张涛; 胡佳研; 李福娟; 张玥杰

    2012-01-01

    本文将航班串的飞机指派问题归结为车辆路径问题,考虑连续航班串之间衔接时间、衔接机场的约束、每架飞机的总飞行时间约束,建立了带有飞行时间约束的车辆路径问题的混合整数规划模型.构造了蚁群系统算法,引入基于排序的蚂蚁系统和最大最小蚂蚁系统算法的信息素更新策略.选取某航空公司7组初始航班串集合进行测试,并对算法中的重要参数进行了分析.实验结果表明,本文设计的模型和算法可以有效地减少连续航班串之间的总衔接时间,在可接受的计算时间内获得满意解.%The domestic airlines are relatively small in comparison with the international airlines. Airlines used to make the flight plans using simple and rough methods. The competition among the airlines became stronger with the expansion of airlines, and the opening of the air transportation market. Therefore, flight-planning management becomes more important. Aircraft assigning problem ( AAP) is to assign planes to the proper flight reasonably in order to make full use of the fleet resources. Good flight planning can not only ensure the safety and punctuality of flights, but also improve the utilization rale of fleets and decrease the cost of operation and maintenance so as to maximize the economic benefits of the airlines.The theoretical research on the flight-assigning problem is in its infancy, and most of the research just considers the next day aircraft assignment. However, in practice the airline engineering personnel generally makes aircraft plans every week. Although conducting aircraft assignment daily simplifies the problem and greatly reduces the constraints involved, the assignment method can hardly capture the actual demand. Based on the process of flight planning of the domestic airlines, we transform the aircraft assignment problem into vehicle routing problem (VRP) and study the weekly flight assignment problem. This problem is a kind

  5. The Random Fuzzy Multi-objective Assignment Problem Based on A Hybrid Intelligent Algorithm%基于混合智能算法的随机模糊多目标指派问题

    Institute of Scientific and Technical Information of China (English)

    肖继先; 寇春蕾

    2015-01-01

    文中从不确定理论出发,将随机模糊约束规划理论引入对随机模糊多目标指派问题的研究。构建了多目标指派问题的随机模糊规划机会约束模型,并设计了将随机模糊模拟、神经网络和遗传算法结合在一起的混合智能算法对模型进行求解。%This paper based on the uncertainty theory,put the theory of random fuzzy constraint programming introduce into the study of random fuzzy multi-objective assignment problem.Build random fuzzy planning opportunities constraint model of the Multi -objective Assignment problem.And design a hybrid intelligent algorithm, which combined the random fuzzy simulation,neural network and genetic algorithm,to solve the model.

  6. 模糊优化理论的武器-目标分配模型及求解算法%Research on Weapon-target Assignment Model and Algorithm Based on the Fuzzy Optimization Theory

    Institute of Scientific and Technical Information of China (English)

    黄国锐; 李朋辉; 丁俊香; 韩玮

    2013-01-01

    Weapon-target assignment is a typical NP-complete problem, with the incrase in the number of weapons and targets, as well as the existence of the diversity of evaluation criterion for the allocation result, traditional optimzation algorithm such as implicit enumeration method, cutting plane method, branch and bound method is difficult to solve the problem effectively. This paper desctibes the multi-objiective hybrid optimization theory based on the fuzzy optimization method, establishes the optimal weapon-target assignment model of multi-indicator and applies the ant colony algorithm to solve problem, which provides an effective method to solve the complex problem of weapon-target assignment.%武器-目标分配问题是一个典型的NP完全问题,随着武器和目标数量的增多,以及分配结果评价标准多样性的存在,传统的优化求解算法如隐枚举法、割平面法、分支定界法等很难进行有效地求解.介绍一种基于模糊优选技术的多目标混合优化理论,运用该理论建立了多个指标下的最佳武器-目标分配模型,并将蚁群算法应用于对模型的求解,为解决复杂的武器-目标分配问题提供了一种有效方法.

  7. An Algorithm for the Storage Location Assignment Problem for Outbound Containers in a Container Terminal%集装箱码头出口箱堆位分配算法

    Institute of Scientific and Technical Information of China (English)

    范灵芳; 陈璐

    2011-01-01

    The storage allocation of outbound containers in the storage yard directly affects the loading efficiency.This paper proposed a two-stage algorithm to determine the storage locations for outbound containers in a container terminal.The first stage is to assign the containers with certain bays.The second stage is to determine the specific location for each container in the pre-assigned bays.In the first stage,the problem is formulated as a Mixed Integer Programming(MIP) model,and a heuristic algorithm is developed in the second stage.The experiment results demonstrate that the proposed algorithm can solve the problem effectively.%集装箱码头上出口箱的堆位分配直接影响出口箱的装船作业效率。本文提出对出口箱在码头堆场内进行堆位分配的两阶段优化算法。第一阶段对出口箱进行贝位分配;在此基础上第二阶段在已分配的贝内,为每个到港出口箱分配具体箱位。算法第一阶段采用混合整数规划模型对问题进行建模和求解,第二阶段采用基于混合堆放的启发式算法进行堆位分配求解。实验结果表明,本文所提出的算法可以有效解决出口箱的堆位分配问题。

  8. 一种新型VHF/UHF数据链中的时隙分配策略%A novel timeslot assignment algorithm of VHF/UHF data link

    Institute of Scientific and Technical Information of China (English)

    粱爽; 赵伟光

    2012-01-01

    时隙分配技术是VHF/UHF数据链中的一项关键技术,通过它可以提高系统的通信效率。在目前VHF~HF数据链的基础上.提出了一种新的时隙分配高层算法:渐变分配策略,它主要是以固定分配方式为主,以竞争分配和动态分配为辅的一种新型时隙分配策略,兼有固定分配、竞争分配和动态分配的优点,同时又尽可能克服它们的缺点,以最小代价换来最大成效。%The timeslot allocation algorithm is one of important technologies on VHF/UHF Data Link to improve the communication efficiency of the system. Focus on the characteristics of VHF/UHF Data Link, the paper proposes a new algorithm, which named after Shading Allocation Strategy. It mainly gives priority to Fixation Allocation and minority to Competition Allocation and Dynamic Allocation. The strategy has concurrently advantages of Fixation, Competition and Dynamic Allocation, and avoids their disadvantages as much as possible to exchange minimum cost for maximum effect.

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

    2013-03-01

    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.

  10. Utilizing joint routing and capacity assignment algorithms to achieve inter- and intra-group delay fairness in multi-rate multicast wireless sensor networks.

    Science.gov (United States)

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

    2013-03-14

    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.

  11. A Timetable-based Transit Network Stochastic User Equilibrium Assignment Algorithm%基于时刻表的公交网络随机用户均衡配流算法研究

    Institute of Scientific and Technical Information of China (English)

    岳强; 宋瑞; 徐梁; 刘志谦

    2011-01-01

    In order to improve the informationization, planning and management of public transit< scientific public transit planning and management strategies are needed. Transit flow assignment is one of the key aspects of transit planning and management. This paper reviews the transit flow assignment research at both home and abroad. Based on the concept of urban general transit network, connection, connection segment and attraction connection set, this paper proposes a volume-restrained &. Timetable-based stochastic user equilibrium transit assignment model (VRT-SUE). The principle and solving steps of VRT-SUE algorithm are discussed and a numerical example is presented to showcase the proposed VRT-SUE. Assignment results show that the algorithm can well represent the influences of the departure time, arrival time, transfer number and cost onto traveler's behavior.%提高公共交通规划管理及信息化水平,需要制定科学的公交规划管理策略,公交客流分配是公交规划与管理的核心内容之一.为促进公交配流理论研究,提高公交客流分配结果科学性,分析了国内外公交配流研究现状,对于城市广义公交网络,结合公交时刻表,定义了公交连接、连接片段以及吸引连接集合,建立了容量限制下基于时刻表的公交网络随机用户均衡配流算法(VRT-SUE),对算法原理和求解步骤进行了探讨.构建实例公交网络进行分析测试,配流结果显示该模型能够很好的反映出出发时间、到达时间、换乘次数及费用等对乘客公交出行的影响,算法是合理和有效的.

  12. Improved Artificial Immune Algorithm Based on Weapon-Target Assignment%基于改进人工免疫算法的火力分配

    Institute of Scientific and Technical Information of China (English)

    刘洪引; 李体方; 王立安

    2014-01-01

    随着现代武器杀伤力的极大提高,任何来袭目标的突防都可能造成极大的破坏,这对传统的火力分配提出了挑战。提出一种新的火力集中原则,在满足对来袭目标一定杀伤的前提下,适当转移火力,实现火力总的集中,据此建立了火力分配优化模型。通过改进人工免疫算法的抗体群,提高模型的求解速度,缩短方案的寻优时间。通过实例进行仿真,结果表明,基于改进人工免疫算法能较快速实现火力分配,算法具有一定的可行性。%With the great improvement of modern weapons,any target penetration may cause great damage,which challenges the traditional fire distribution. So a new firepower-concentrated principle is put forward in this paper. According to the principle,the fire total concentration can be obtained through transferring fire appropriately,and a fire distribution model is founded. An optimized fire distribution scheme is given based on the improved artificial immune algorithm. The simulation results show that the improved artificial immune algorithm is capable of distributing the firepower effectively and quickly,the method has certain feasibility.

  13. 分布式遗传模拟退火算法的火力打击目标分配优化%Optimization for Target Assignment in Fire Strike Based on Distributed Genetic Simulated Annealing Algorithm

    Institute of Scientific and Technical Information of China (English)

    吴坤鸿; 詹世贤

    2016-01-01

    根据火力打击规则,建立了多目标函数的目标分配模型,提出了分布式遗传模拟退火算法对模型进行求解。分布式遗传模拟退火算法基于经典遗传算法进行改进:将单目标串行搜索方式变成多目标分布式搜索方式,适用于多目标寻优问题求解;采用保留最优个体和轮盘赌相结合的方式进行个体选择,在交叉算子中引入模拟退火算法,使用自适应变异概率,较好地保持算法广度和深度搜索平衡。最后,通过仿真实验验证了算法的有效性和可靠性。%According to the rules of fire strike,a target assignment model is presented,and a Distributed Genetic Simulated Annealing algorithm (DGSA)is applied to resolve this model. DGSA is improved based on classic Genetic Algorithm (GA)as below:the single object serial-searched mode is changed to multiple objects distributed-searched mode,which is fitter for resolving multiobjective optimization; in order to keep a better balance between exploration and exploitation of algorithm,a method by coupling best one preservation and roulette wheel is established for individual selection,and simulated annealing algorithm is combined into crossover operation,and self -adaptive mutation probability is applied. Finally,the efficiency and reliability of DGSA is verified by simulation experiment.

  14. A Model of Hierarchical Key Assignment Scheme

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhigang; ZHAO Jing; XU Maozhi

    2006-01-01

    A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.

  15. Cooperative control algorithm of task assignment and path planning for multiple UAVs%无人机任务分配与航迹规划协同控制方法

    Institute of Scientific and Technical Information of China (English)

    孙小雷; 齐乃明; 董程; 姚蔚然

    2015-01-01

    针对无人机协同控制问题,提出一种多无人机任务分配与航迹规划的整体控制架构。将威胁和障碍区域考虑为合理的多边形模型,使用改进的 A*算法规划出两个航迹点之间的最短路径。并利用该路径航程作为任务分配过程全局目标函数的输入,采用与协同系统相匹配的粒子结构进行改进粒子群优化(particle swarm optimization, PSO)任务分配迭代寻优。根据分配结果并考虑无人机性能约束,基于 B-spline 法平滑路径组合,生成飞行航迹。仿真结果表明,算法在保证计算速度和收敛性能的同时,能够产生合理的任务分配结果和无人机的可飞行航迹。%An integrating framework of task assignment and path planning for multiple unmanned aerial ve-hicles (UAVs)is presented.To avoid the obstacles area which is represented as polygon,the shortest path seg-ment between UAVs and task can be found by the improved A* algorithm.According to this segment distance, the global objective function of task allocation is modeled.The assignment process is determined by improved particle swarm optimization (PSO),which particle structure matches the cooperative system.The B-spline method is adopted to smooth the flight path,which consists of path segments of the assignment.Numerical re-sults demonstrate that the proposed method can achieve the optimal task assignment solution and best flight routes.

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

    2013-03-01

    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

  17. Force Assignment of Radar Jamming System Based on Adaptive Genetic Algorithm%基于自适应遗传算法的雷达干扰系统兵力分配

    Institute of Scientific and Technical Information of China (English)

    潘伟

    2014-01-01

    The electronic jamming measures are used to decrease the detect ability of airborne ra-dar in air-raid combat. The jamming effectiveness is directly affected by the assignment of jam-ming force. According to the air-raid combat feature, a jamming force optimization apportion model is proposed based on an adaptive genetic algorithm. The adaptive crossover probability and adaptive mutation probability are proposed, which consider the influence of every generation to algorithm and the effect individual fitness in every generation. Finally, an example is given, which shows the feasibility of the proposed algorithm for handling the complicate and difficult problem of optimization apportion for jamming force.%在防空袭作战中,为了有效地降低敌机载雷达的探测能力,必须综合运用电子干扰措施实施电子干扰,干扰兵力分配直接影响干扰效果。结合防空袭作战的特点,提出了基于自适应遗传算法的雷达干扰系统兵力分配模型,并设计了既考虑到进化代数对算法影响,又考虑到每代中不同个体适应度对算法作用的自适应交叉概率和变异概率。仿真实例表明该方法可以有效解决雷达干扰系统兵力分配这一复杂而困难的问题。

  18. Crosstalk-Aware Routing Resource Assignment

    Institute of Scientific and Technical Information of China (English)

    Hai-Long Yao; Yi-Ci Cai; Qiang Zhou; Xian-Long Hong

    2005-01-01

    Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.

  19. 基于多群体改进萤火虫算法的UCAV协同多目标分配%Target Assignment in Cooperative Attacking of UCAVs Based on Multi-Intelligence Improved Glowworm Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    王永泉; 罗建军

    2014-01-01

    对多UCAV协同攻击目标分配问题进行了研究。以收益指标、消耗指标及航程指标为准则建立数学模型,采用改进的萤火虫优化算法对模型进行求解;对基本萤火虫优化算法进行了改进,给出了新的萤火虫更新策略,引入了局部搜索及全局信息交换机制,并将萤火虫优化算法与混合蛙跳算法融合,实现了多智能群体共同进化,提出了一种基于多群体改进萤火虫优化算法的UCAV目标分配算法;针对UCAV协同攻击决策特点,设计了萤火虫离散编码方式,最终得到多UCAV协同攻击最优分配方案。仿真结果表明,多群体萤火虫优化算法能够稳定快速地给出目标分配最优方案。%A target allocation algorithm based on multi-intelligence improved glowworm swarm optimization ( MIG-SO) algorithm is proposed. A model of decision-making is built up by taking benefit index, loss index and range in-dex as the criteria, and the MIGSO is used to solve the model. Finally the optimal allocation scheme for multi-air-craft cooperative attacking is gotten. According to the characteristics of UCAV attack decision making, a special coding for firefly particle and firefly update strategy is presented. With shuffled frog leaping algorithm (SFLA), glowworms are divided into different ethnic groups, and local search and global information exchange method im-proves GSO performance. SFLA is also combined with GSO, which realize the co-evolution of the two kinds of groups. The simulation results shows that the MIGSO algorithm can give the optimal target assignment solution quickly and effectively.

  20. Multi-UAV Dynamic Task Assignment by Particle Swarm Optimization Algorithm Based on Division and Union Strategy%基于分合粒子群算法的多无人机任务重分配

    Institute of Scientific and Technical Information of China (English)

    许书诚; 王琪; 刘贤敏

    2012-01-01

    With the mission implemented by multi-UAV, the change of the battle field and formation state of UAV may cause failure of the original distribution plan or reduce efficiency, so it is necessary to execute multi-UAV dynamic task assignment again- Firstly, a formulation was proposed for it. Then task reassignment based on grouping was used. ,task grouping was implemented according to improved k-means algorithm, and particle swarm optimization algorithm based on division and union strategy was used to make task reassignment inside a group. In the end,a simulation proceeds.The simulation results indicate that the approach satisfies the requirements of the battle field.%多UAV在执行任务过程中,战场环境以及UAV编队状态的改变将导致原有的分配计划失效或效率降低,因此有必要重新分配任务.针对多无人机任务重分配问题,首先建立了相应的数学模型.其次运用分组基础上的任务重分配策略进行任务分配,提出了改进的K均值聚类算法进行初步分组,再在分组的基础下,提出了分合粒子群优化算法进行组内任务分配.最后进行实验仿真,实验结果与分析表明基于分合粒子群算法的任务重分配方法能有效地满足多变的战场环境要求.

  1. 集中式信道分配算法在WSN移动节点中的应用研究%Study on Centralized Channel Assignment Algorithm for Mobile Nodes in Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    赵军; 陈祥光; 刘春涛; 余向明; 岳彬

    2011-01-01

    为提高油料保障系统中信息采集的实时性和能量的高效性,使网关及时检测到移动设备的状态,降低无线网络间的干扰,提高网络的容量.以军用机场加油车为研究对象,提出了适用于快速移动节点的集中式信道分配算法和功率分级的能量控制方法.在无线网络节点上安装两个工作在不同频道上的网络接口,通过控制协商动态的切换数据信道,平衡网络负载,以增加总的带宽.实验结果表明,采用3条数据信道便可实现信道的集中式分配和发送功率的分级控制,有效地扩展了网络的容量和提高能量的高效性.%By investigating the working process of tanker trucks in a military airport, this paper proposes a centralized channel assignment algorithm and a power rating control method for fast-moving nodes to improve the real-time property and energy efficiency of the information collection, detect the state of mobile devices promptly, reduce interference between wireless networks and to increase network capacity in oil security systems. Considering the fact that IEEE 802. 11 wireless LAN standard defines a number of non-overlapping channels which could be used at the same time, two wireless network interfaces operating on different channels could be installed to every node. Through the negotiation on the control channel and switching the data channel dynamically, the balance of network loads could be fulfilled so as to increase the total bandwidth. Simulation and application results demonstrate that, only three data channels is needed to realize the centralized channel assignment and the power rating control, and the network capacity and energy efficiency could be improved effectively.

  2. Task Assignment of Multi-UCAV Based on PSO Algorithm Under Uncertain Environment%不确定环境下基于PSO算法的多无人机任务分配方法

    Institute of Scientific and Technical Information of China (English)

    2013-01-01

    The information of UCAV obtained in combat environment typically has uncertainty. A decision-making method for multi-UAV task allocation problem under uncertain environment was presented. The uncertain indicators of UCAV task assignment are analyzed. Combine subjective and objective weights to determine indicators integrated weights. Combining particle swarm optimization (PSO) algorithm and ranking interval numbers method, the task assignment method based on interval-uncertain information was given. The simulation results proved the feasibility and effectiveness of the proposed method. The decision-making method can not only solve the UAV task allocation problem under the certain information environment, but also solve the UAV task allocation problem under the interval number uncertain information environment.%  实战环境下,无人机所获得的信息通常具有不确定性,针对不确定环境下的多无人机任务分配问题,提出了一种决策方法。分析无人机任务规划中各指标的不确定性,采用主观赋值和客观赋值相结合的方法,确定指标的综合权重,将离散粒子群优化算法和区间数排序方法相结合,给出区间形式不确定信息的无人机任务分配方法。仿真实验结果表明了该方法的可行性和有效性。该决策方法不仅能解决确定信息情况下的无人机任务分配问题,而且能解决区间数不确定信息情况下的无人机任务分配问题。

  3. Assignment Model In Manual Operating System Making To Order Considering Learning Effect And Algorithm Research%考虑员工学习效应的 MTO/MOS 指派模型及算法研究

    Institute of Scientific and Technical Information of China (English)

    于秀丽; 张毕西; 李逸帆; 李弘

    2014-01-01

    MTO( Make-To-Order) and MOS( Manual Operation System ) is the general production system model of the small and medium manufacturing enterprises .The worker ’ skills have an important influence on the perform-ance in such a system .With the growing in times of repetition , learning effect happens and workers ’ efficiencies continuously improve .We propose an optimization model of the front-line workers ’ Assignment considering learning effect , paying full attention to the individual difference in order to narrowing the gap between theory re-searches and production practices .Taking the lead time as the objective function , the model is based on work-ers’ previous experience, learning ability, technology difficulty and batch size .Due to workers’ assignment is NP complete problem , the Bootstrap approach to solve the problem is proposed .A case study indicates that the proposed model can provide a promising worker assignment approach and the proposed algorithm is effective for combinational optimization problem .%订单式生产( MTO)人工作业系统( MOS)是我国中小制造企业广泛采用的生产系统模式。在MTO/MOS中,一线员工生产技能对生产绩效具有直接的影响。随着重复操作次数的增多,员工的生产效率不断提高,即产生学习效应。本文考虑员工学习效应来优化一线员工的配置,强调员工初始技能和学习能力的个体差异对完工期的影响,以期缩小理论研究与生产实践之间的差距。本文首先提出一个基于员工初始技能、员工的学习能力、工艺难度和订单批量的员工技能动态变化函数。然后,以最小化完工期为目标,建立一个优化模型。由于员工指派问题属于“完全NP-Hard”问题,为了求解本文所提出模型,本文提出Bootstrap方法对问题进行求解。最后,基于一个算例分析,验证该模型及算法的有效性。

  4. Combinatorial model and algorithm involving OD distribution and stochastic user equilibrium assignment%OD分布与随机均衡分配的组合模型及算法

    Institute of Scientific and Technical Information of China (English)

    周溪召

    2001-01-01

    Because the randomness of transportation information has not been considered in present practical transportation planning ,the accuracy or efficiency of transportation planning is depreciated.In order to overcome this drawback,the combinatorial model simulaneously involving OD distribution of trips in a transportation network and stochastic user equilibrium assignment(SUEA) of trips to routes in each OD pairs was developped on the basis of analysis on random ness in choices of route and destination for a given mode. It was proved that the solution of the combinatorial model was unique and it satisfied Wardropian principle of SUEA and requirement of OD distribution by introducing Langrangian function.Finally,the algorithm of model was given by using the direction hunting method.%目前交通规划实践缺乏考虑交通信息的随机性,从而降低了它所得结果的准确性.为此,通过分析出行路径选择和目标选择的随机性,建立了交通网络OD分布与随机平衡(或均衡)分配的组合模型,通过引入拉格朗日函数,证明了模型最优解满足随机用户平衡条件和OD分布的要求且最优解是唯一的;最后给出了模型的方向搜索算法.

  5. Dynamic Assignment in Microsimulations of Pedestrians

    CERN Document Server

    Kretz, Tobias; Hofsäß, Ingmar; Leonhardt, Axel

    2014-01-01

    A generic method for dynamic assignment used with microsimulation of pedestrian dynamics is introduced. As pedestrians - unlike vehicles - do not move on a network, but on areas they in principle can choose among an infinite number of routes. To apply assignment algorithms one has to select for each OD pair a finite (realistically a small) number of relevant representatives from these routes. This geometric task is the main focus of this contribution. The main task is to find for an OD pair the relevant routes to be used with common assignment methods. The method is demonstrated for one single OD pair and exemplified with an example.

  6. Adaptive Task Assignment in Online Learning Environments

    OpenAIRE

    Andersen, Per-Arne; Kråkevik, Christian; Goodwin, Morten; Yazidi, Anis

    2016-01-01

    With the increasing popularity of online learning, intelligent tutoring systems are regaining increased attention. In this paper, we introduce adaptive algorithms for personalized assignment of learning tasks to student so that to improve his performance in online learning environments. As main contribution of this paper, we propose a a novel Skill-Based Task Selector (SBTS) algorithm which is able to approximate a student's skill level based on his performance and consequently suggest adequa...

  7. A parametric visualization software for the assignment problem

    Directory of Open Access Journals (Sweden)

    Papamanthou Charalampos

    2005-01-01

    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.

  8. Historical WBAN ID Assignments

    Data.gov (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....

  9. My Favorite Assignment.

    Science.gov (United States)

    Post, Robert E.; Johnson, Jack E.

    1982-01-01

    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)

  10. Genetic spectrum assignment model with constraints in cognitive radio networks

    Directory of Open Access Journals (Sweden)

    Fang Ye

    2011-06-01

    Full Text Available The interference constraints of genetic spectrum assignment model in cognitive radio networks are analyzed in this paper. An improved genetic spectrum assignment model is proposed. The population of genetic algorithm is divided into two sets, the feasible spectrum assignment strategies and the randomly updated spectrum assignment strategies. The penalty function is added to the utility function to achieve the spectrum assignment strategy that satisfies the interference constraints and has better fitness. The proposed method is applicable in both the genetic spectrum assignment model and the quantum genetic spectrum assignment mode. It can ensure the randomness of partial chromosomes in the population to some extent, and reduce the computational complexity caused by the constraints-free procedure after the update of population. Simulation results show that the proposed method can achieve better performance than the conventional genetic spectrum assignment model and quantum genetic spectrum assignment model

  11. Generalised Assignment Matrix Methodology in Linear Programming

    Science.gov (United States)

    Jerome, Lawrence

    2012-01-01

    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…

  12. Computational Aspects of Assigning Agents to a Line

    DEFF Research Database (Denmark)

    Aziz, Haris; Hougaard, Jens Leth; Moreno-Ternero, Juan D.

    2017-01-01

    We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. We introduce a general approach to compute aggregate gap-minimizing assignments, as well as gap-egalitarian assignme......We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. We introduce a general approach to compute aggregate gap-minimizing assignments, as well as gap......-egalitarian assignments. The approach relies on an algorithm which is shown to be faster than general purpose algorithms for the assignment problem. We also extend the approach to probabilistic assignments and explore the computational features of existing, as well as new, methods for this setting....

  13. 42 CFR 433.146 - Rights assigned; assignment method.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN... Assignment of Rights to Benefits § 433.146 Rights assigned; assignment method. (a) Except as specified...

  14. The double-assignment method for the exponential chaotic tabu search in quadratic assignment problems

    Science.gov (United States)

    Shibata, Kazuaki; Horio, Yoshihiko; Aihara, Kazuyuki

    The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts features of the Lin-Kernighan algorithm. We then introduce chaotic neuro-dynamics into the double-assignment method to propose a novel exponential chaotic tabu search. We further improve the proposed exponential chaotic tabu search with the double-assignment method by enhancing the effect of chaotic neuro-dynamics.

  15. NR 512 All Assignments

    OpenAIRE

    Laynebaril1

    2017-01-01

     NR 512 All Assignments Click Link Below To Buy: http://hwcampus.com/shop/nr-512-assignments/ Or Visit www.hwcampus.com   NR512 Week 4 Scavenger Hunt Latest 2017 W4_NR512 Second Life (SL) Scavenger Hunt Work Sheet Student Name: Dorinda Ezell Avatar Name: Dvezellnr512 INSTRUCTIONS Instructions: 1. As you complete the Scavenger Hunt, please write your answers to the questions on this worksheet. 2. Save it as a MS Word document in the following format: ...

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

    2010-09-01

    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

  17. Task assignment and coaching

    NARCIS (Netherlands)

    Dominguez-Martinez, S.

    2009-01-01

    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 fr

  18. 有人机—无人机群协同空战目标分配算法%Reseach on Mission Assignment Algorithm of Cooperation Air Combat for MAV and Multi-UAV

    Institute of Scientific and Technical Information of China (English)

    刘万俊; 傅裕松; 翁兴伟

    2012-01-01

    To solve the mission assignment problem for MAV (Manned Aerial Vehicle) and multi-UAV (Unmanned Aerial Vehicle) in cooperation air combat. A DPSO (Discrete Particle Swarm Optimization) is put forward. The research is divided into three situation which includes that one UCAV is assigned one target, one UCAV is assigned two targets regardless of attack order and one UCAV is assigned two targets considering attack order. And then a new particle formation method is proposed. The risk return matrix and cost function of multi-mission assignment which combines air combat capability index and dominant function are designed. The simulation result shows that the arithmetic has good astringency and it has reference value for the Multi-mission assignment for MAV and multi-UAV in cooperation air combat.%针对有人机—无人机群协同空战目标分配问题,运用离散粒子群算法,分为1架UCAV分配1个目标,1架UCAV分配2个目标时不考虑攻击先后影响和考虑攻击先后影响3种情况进行了仿真研究,提出了一种新的粒子构造方法.综合考虑空战能力指数和优势函数,构造了收益风险矩阵和多目标分配的代价函数.仿真结果具有良好收敛性,对有人机—无人机群协同空战目标分配具有参考价值.

  19. File Assignment Policy in Network Storage System

    Institute of Scientific and Technical Information of China (English)

    Cao Qiang; Xie Chang-sheng

    2003-01-01

    Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however, mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data placement in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.

  20. File Assignment Policy in Network Storage System

    Institute of Scientific and Technical Information of China (English)

    CaoQiang; XieChang-sheng

    2003-01-01

    Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however,mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data place ment in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.

  1. The Robust Pole Assignment Problem for Second-Order Systems

    Directory of Open Access Journals (Sweden)

    Hao Liu

    2010-01-01

    the discussion into two cases and propose two algorithms for solving this problem. Numerical examples show that the problem of the robust eigenvalue assignment for the quadratic pencil can be solved effectively.

  2. Routing and wavelength assignment in hierarchical WDM networks

    Institute of Scientific and Technical Information of China (English)

    Yiyi LU; Ruxiang JIN; Chen HE

    2008-01-01

    A new routing and wavelength assignment method applied in hierarchical wavelength division multiplexing(WDM)networks is proposed.The algorithm is called offiine band priority algorithm(offiine BPA).The offline BPA targets to maximize the number of waveband paths under the condition of minimum number of wavelengths,and solve the routing and wavelength assignment(RWA)problem with waveband grooming to reduce cost.Based on the circle construction algorithm,waveband priority function is introduced to calculate the RWA problem.Simulation results demonstrate that the proposed algorithm achieves significant cost reduction in WDM network construction.

  3. Scaffolding students’ assignments

    DEFF Research Database (Denmark)

    Slot, Marie Falkesgaard

    2013-01-01

    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...... objects. The article presents the results of empirical research on tasks given in Danish and British learning materials. This work is based on a further development of my PhD thesis: “Learning materials in the subject of Danish” (Slot 2010). The main focus is how cognitive models (and subsidiary explicit...... learning goals) can help students structure their argumentative and communica-tive learning processes, and how various multimodal representations can give more open-ended learning possibilities for collaboration. The article presents a short introduction of the skills for 21st century learning and defines...

  4. Personnel shift assignment: Existence conditions and network models

    NARCIS (Netherlands)

    Berg, van den Jeroen P.; Panton, David M.

    1994-01-01

    The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule. This paper discusses the existence conditions for both continuous and forward rotating shift assignments and heuristic network algorithm

  5. Demand assignment in the ACTS LBR system

    Science.gov (United States)

    Palmer, Larry C.; White, Lawrence W.

    1990-05-01

    On the Advanced Communications Technology Satellite (ACTS) being developed at NASA Lewis, low-burst-rate (LBR) traffic stations will access the ACTS multibeam package via two hopping beams that can be directed at certain areas in the continental U.S. An onboard baseband processor (BBP) demodulates uplink traffic, switches it between uplink and downlink beams at baseband, and then remodulates it for retransmission at 20 GHz. This study describes the demand-assigned operation of the ACTS LBR system, where the onboard switch is remote from both traffic stations and master control station (MCS). Network control uses inbound and outbound orderwire channels and a BBP control channel, allowing the MCS to coordinate assignment of individual 64-kb/s spacecraft channels. Models are developed to simulate the dynamics of the assignment process and verify the call blocking behavior, to predict control channel loads, and to evaluate algorithms for burst time plan rearrangement.

  6. 快速降阶匈牙利算法的云计算任务分配模型%Task assignment model in cloud computing based on Hungary algorithm of faster reduced order

    Institute of Scientific and Technical Information of China (English)

    任金霞; 何富江

    2014-01-01

    为了提高云计算任务分配效率,在标准匈牙利算法的基础上,提出一种快速降阶优化算法的云计算任务分配模型。为实现快速求解全局任务分配问题,快速降阶算法不断排除已确定的分配方案对应的代价矩阵元素,从而快速降低矩阵的阶次。并可根据成本矩阵规模将矩阵分解成多个矩阵,使得该算法在任务和计算机不对等的情况下同样适用。论文最后的仿真结果表明,快速降阶匈牙利算法计算耗时远远小于匈牙利算法,并能有效提高计算机的利用率。%In order to improve the efficiency of task allocation in cloud computing, on the basis of standard Hungary algorithm, this paper puts forward a task allocation model in cloud computing using fast reduced order optimization algorithm. To solve all task allocation problem fast, the algorithm constantly rules out corresponding matrix elements in the allocation plan, and thus the order of the matrix is quickly reduced. And the matrix is decomposed into multiple matrixes according to the size of cost matrix, which makes the algorithm also applicable in the uncoordinated case of tasks and computer. The final simulated results of the paper show that Hungary algorithm in the fast reduced order costs far less time than that of Hungarian algorithm, and the former improves the utilization of the computer.

  7. Flexible taxonomic assignment of ambiguous sequencing reads

    Directory of Open Access Journals (Sweden)

    Jansson Jesper

    2011-01-01

    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.

  8. Fast assignment reduction in inconsistent incomplete decision systems

    Institute of Scientific and Technical Information of China (English)

    Min Li; Shaobo Deng; Shengzhong Feng; Jianping Fan

    2014-01-01

    This paper focuses on fast algorithm for computing the assignment reduct in inconsistent incomplete decision systems. It is quite inconvenient to judge the assignment reduct directly ac-cording to its definition. We propose the judgment theorem for the assignment reduct in the inconsistent incomplete decision system, which greatly simplifies judging this type reduct. On such basis, we derive a novel attribute significance measure and construct the fast assignment reduction algorithm (F-ARA), intended for com-puting the assignment reduct in inconsistent incomplete decision systems. Final y, we make a comparison between F-ARA and the discernibility matrix-based method by experiments on 13 Univer-sity of California at Irvine (UCI) datasets, and the experimental results prove that F-ARA is efficient and feasible.

  9. Concept and Method of Asset-Based Community Development Planning: A Case Study on Minlecun Community in Chongqing’s Yuzhong District

    Institute of Scientific and Technical Information of China (English)

    Huang; Ling; Liu; Yang; Xu; Jianfeng

    2015-01-01

    With the transformation of the Chinese economy from an extensive growth to intensive development, city development is also gradually turning from incremental construction to stock management. Community, as a basic unit of human settlements, is an important platform to build and improve the social governance capability. In 2013, Shiyoulu Jiedao Offi ce of Yuzhong District led the 1st urban community development planning, which was a milestone of Chongqing’s city regeneration and governance innovation. This paper focuses on two key issues: how to understand the community values and make the community development planning based on the above, and how to integrate with the local forces so that the community development planning can be integrated into the action plan. Combined with the practice of Minlecun Community Development Planning, using the concept of asset-based community development, a comprehensive survey is conducted on community assets(including three aspects of physical, human, and social capital), and a community comprehensive planning strategy is formulated which covers two parts: the optimization of community spaces and the upgrading of community governance. The paper explores the local-based community planning theories and methods from such aspects as value attitude, public participation, role transformation of urban planners, and others.

  10. Improved Quantum Immune Clonic Algorithm in Weapon-Target Assignment under Conditions of Network Confrontation Environment%基于网络对抗火力分配的改进量子免疫克隆算法

    Institute of Scientific and Technical Information of China (English)

    冯超; 景小宁; 李秋妮; 夏菲; 费凯

    2016-01-01

    考虑对于目标与目标组成网络的攻击总收益最大、自身消耗最小的原则,建立网络对抗条件下火力分配多目标优化模型,引入随机网络拓扑结构,分析火力分配方案对于随机网络的攻击效果,采用改进量子免疫克隆多目标算法对模型进行求解。通过实验仿真,分析攻击收益与不同弹药成本之间的变化情况,发现使用改进算法得到火力分配方案的攻击效率比标准算法平均高出23%;对算法的收敛性与Pareto解分布的均匀性进行研究,发现改进算法得到的 Pa-reto解分布均匀性比标准算法提高了42%,验证了模型的有效性以及改进算法的优越性。%In consideration of the principles that attack benefits of network combined targets with targets are maximal and its own consumption is minimal in total,a multi-obj ective optimization model is estab-lished under conditions of network confrontation environment in fire distribution.Under conditions of ran-dom network topology introduced,the effect of fire distribution corresponding to the random network is analyzed.This paper adopts quantum-inspired immune clonic multi-obj ective optimization algorithm to solve the model of fire distribution.Though experimental simulation,the change circumstances of the total attack benefits are analyzed by using different cost ammunition.The attack efficiency of the fire distribu-tion scheme increases by 23% by using the improved algorithm over the fire distribution scheme by using standard algorithm.The convergence of the algorithm and superiority of Pareto solution distribution are studied.The experiments demonstrate that the Pareto efficiency solution distribution increases 42% by u-sing the improved algorithm over using the standard algorithm.The superiority of the model and the effi-ciency of the algorithm are verified.

  11. Fiber Assignment in Next-generation Wide-field Spectrographs

    OpenAIRE

    Morales, Isaac; Montero-Dorta, Antonio D.; Azzaro, Marco; Prada, Francisco; Sanchez, Justo; Becerril, Santiago

    2011-01-01

    We present an optimized algorithm for assigning fibers to targets in next-generation fiber-fed multi-object spectrographs. The method, that we named draining algorithm, ensures that the maximum number of targets in a given target field is observed in the first few tiles. Using randomly distributed targets and mock galaxy catalogs we have estimated that the gain provided by the draining algorithm as compared to a random assignment can be as much as 2% for the first tiles. This would imply for ...

  12. Gene family assignment-free comparative genomics

    Directory of Open Access Journals (Sweden)

    Doerr Daniel

    2012-12-01

    Full Text Available Abstract Background The comparison of relative gene orders between two genomes offers deep insights into functional correlations of genes and the evolutionary relationships between the corresponding organisms. Methods for gene order analyses often require prior knowledge of homologies between all genes of the genomic dataset. Since such information is hard to obtain, it is common to predict homologous groups based on sequence similarity. These hypothetical groups of homologous genes are called gene families. Results This manuscript promotes a new branch of gene order studies in which prior assignment of gene families is not required. As a case study, we present a new similarity measure between pairs of genomes that is related to the breakpoint distance. We propose an exact and a heuristic algorithm for its computation. We evaluate our methods on a dataset comprising 12 γ-proteobacteria from the literature. Conclusions In evaluating our algorithms, we show that the exact algorithm is suitable for computations on small genomes. Moreover, the results of our heuristic are close to those of the exact algorithm. In general, we demonstrate that gene order studies can be improved by direct, gene family assignment-free comparisons.

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

  14. Simulation Optimization of the Crossdock Door Assignment Problem

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel distance by material handling equipment is minimized. We propose a two fold solution; simulation and optimization of the simulation model simulation optimization. The novel aspect of our solution approach is that we intend to use simulation to derive a more realistic objective function and use Memetic algorithms to find an optimal solution. The main advantage of using Memetic algorithms is that it combines a local search with Genetic Algorithms. The Crossdock Door Assignment Problem is a new domain application to Memetic Algorithms and it is yet unknown how it will perform.

  15. Automation of gene assignments to metabolic pathways using high-throughput expression data

    Directory of Open Access Journals (Sweden)

    Yona Golan

    2005-08-01

    Full Text Available Abstract Background Accurate assignment of genes to pathways is essential in order to understand the functional role of genes and to map the existing pathways in a given genome. Existing algorithms predict pathways by extrapolating experimental data in one organism to other organisms for which this data is not available. However, current systems classify all genes that belong to a specific EC family to all the pathways that contain the corresponding enzymatic reaction, and thus introduce ambiguity. Results Here we describe an algorithm for assignment of genes to cellular pathways that addresses this problem by selectively assigning specific genes to pathways. Our algorithm uses the set of experimentally elucidated metabolic pathways from MetaCyc, together with statistical models of enzyme families and expression data to assign genes to enzyme families and pathways by optimizing correlated co-expression, while minimizing conflicts due to shared assignments among pathways. Our algorithm also identifies alternative ("backup" genes and addresses the multi-domain nature of proteins. We apply our model to assign genes to pathways in the Yeast genome and compare the results for genes that were assigned experimentally. Our assignments are consistent with the experimentally verified assignments and reflect characteristic properties of cellular pathways. Conclusion We present an algorithm for automatic assignment of genes to metabolic pathways. The algorithm utilizes expression data and reduces the ambiguity that characterizes assignments that are based only on EC numbers.

  16. Interactive Assignments for Online Students

    Directory of Open Access Journals (Sweden)

    Pam Lowry

    2009-04-01

    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.

  17. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    Science.gov (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

  18. 模拟退火遗传算法求解面试组专家工作安排问题%Solving the Interview Group Expert Assignment Problem with Simulated Annealing Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    陈香

    2013-01-01

    In order to effectively solve Arrange fair and objective interview to interview members of the Group ,in this pa-per ,the issues were discussed ,establish its mathematical model ,the model is a complex non -linear integer programming problem .Proposed a packing code ,simulated annealing genetic ,multi-point crossover ,the search for variability in the field of genetic algorithms to solve the mathematical model ,And with an example :30 experts to interview 300 students each interview group of four experts ,with the genetic algorithm to solve the calculation of the examples ,show that the improved genetic algorithm can be efficient for solving the approximate optimal solution of problem solving can meet the job interview fair and reasonable arrangements required to achieve results .%为了有效求解如何安排面试专家组成员工作使面试公正客观的问题,建立面试安排工作数学模型,该模型为复杂的非线性整数规划问题。提出一种装箱编码、模拟退火遗传、多点交叉、领域搜索变异的遗传算法对数学模型进行求解,并以一个30名专家对300名学生进行面试,且每个面试组4名专家的例子用遗传算法进行求解计算。结果表明,改进后的遗传算法能高效求解出问题的近似最优解,求解结果能满足面试工作安排所提出的要求。

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

    NARCIS (Netherlands)

    Taniman, R.O.; Sikkes, B.; Bochove, van A.C.; Boer, de P.T.

    2006-01-01

    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

  20. A Solution Method for the Quadratic Assignment Problem Based on the Hungarian Algorithm%一种基于匈牙利算法的二次分配问题求解方法

    Institute of Scientific and Technical Information of China (English)

    张惠珍; 马良

    2009-01-01

    二次分配问题(Quadratic assignment problem,QAP)属于NP-hard组合优化难题.二次分配问题的线性化及下界计算方法,是求解二次分配问题的重要途径.以Frieze-Yadegar线性化模型和Gilmore-Lawler下界为基础,详细论述了二次分配问题线性化模型的结构特征,并分析了Gilmore-Lawler下界值往往远离目标函数最优值的原因.在此基础上,提出一种基于匈牙利算法的二次分配问题对偶上升下界求解法.通过求解QAPLIB中的部分实例,说明了方法的有效和可行性.

  1. Optimizing Marine Security Guard Assignments

    Science.gov (United States)

    2011-06-01

    Bangkok , Thailand East Asia and Pacific 18 4 Fort Lauderdale, Florida Western Hemisphere - South 13 5 Frankfurt, Germany Western Europe and Scandinavia 15...2008). Each 7 stationing plan satisfies a myriad of unit requirements, such as building and land availability. Similarly, each assignment solution...optimize the assignment of enlisted Marines to billets. EAM-GLOBAL seeks to assign the best Marine-billet fit while balancing staffing shortages

  2. An Aggregation Approach for Group Multicriteria Assignment

    Directory of Open Access Journals (Sweden)

    George Rigopoulos

    2008-01-01

    Full Text Available We presented an aggregation approach for group multicriteria assignment decisions, where group members express their preferences on problem parameters in numeric format. Individual preferences are aggregated by WOWA operator following the majority concept and a group parameter set is derived that is used as input for the classification algorithm. In addition, we present a numeric example of the approach, demonstrating its applicability. The methodology has been applied to classification problems in business environment, with sufficient results depicting its validity for such problems.

  3. Pole Assignment for Second-Order Systems

    Science.gov (United States)

    CHU, E. K.

    2002-01-01

    This paper contains some results for pole assignment problems for the second-order system M ẍ(t)+D ẋ(t)+K x (t)=B u (t) . Specifically, Algorithm 0 constructs feedback matrices F1 and F2 such that the closed-loop quadratic pencil Pc( λ)= λ2M+ λ ( D+ BF2)+( K+ BF1) has a desired set of eigenvalues and the associated eigenvectors are well-conditioned. The method is a modification of the SVD-based method proposed by Juang and Maghami [1, 2] which is a second-order adaptation of the well-known robust eigenvalue assignment method by Kautsky et al. [3] for first-order systems. Robustness is achieved by minimising some not-so-well-known condition numbers of the eigenvalues of the closed-loop second-order pencil. We next consider the partial pole assignment problem. In 1997, Datta, Elhay and Ram proposed three biorthogonality relations for eigenvectors of symmetric definite quadratic pencils [4]. One of these relations was used to derive an explicit solution to the partial pole assignment problem by state feedback for the related single-input symmetric definite second-order control system. The solution shed new light on the stabilisation and control of large flexible space structures, for which only one small subset of the spectrum needs to be reassigned while retaining the complementary part of the spectrum. In this paper, the method has been generalised for multi-input and non-symmetric quadratic pencils. Finally, we discuss briefly the output feedback pole assignment problem.

  4. A multi-channel routing protocol for channel assignment and routing algorithm joint%信道分配与负载均衡相结合的多信道路由协议

    Institute of Scientific and Technical Information of China (English)

    栾渊鑫; 叶竹君

    2015-01-01

    为了降低邻居节点间的信道冲突,最大化并行传输的信道数目,从而提高移动Ad hoc网络的性能,提出了一种信道分配和路由选择相结合的多信道路由协议LBMMR.LBMMR协议在MAC层和路由层间进行实时的信道状态的信息交互,节点根据信道状态列表,在每一跳中始终选择信道干扰指数最小的信道,从而减少与邻居节点的信道干扰和冲突.在路由选择方面,以信道已用带宽和节点接口队列长度作为负载均衡的判据,在全路径范围内找到一条负载均衡且干扰最小的路径.仿真结果表明,与现有的多信道路由协议相比,LBMMR在网络吞吐量、端到端时延等方面具有明显的性能提升.%In order to reduce co -channel conflict and maximize the number of parallel transmission , thereby improving the performance of mobile Ad hoc networks , this paper pro-posed a multi -channel routing protocol LBMMR which combines with channel assignment and routing .The channel state and information can be exchanged between MAC and routing layer in real time .In order to reduce channel interference and conflicts with neighboring nodes, each node according to the channel usage list has always selected the least channel interference index at each hop .To find the least interfered path for network load balancing on a global scale , LBMMR employed occupied channel bandwidth and the length of the node ’ s interface-queue as the reference of the node routing .Simulation results showed that compared with the existing multi -channel routing protocols , LBMMR provided much higher system total throughputs and shorter end -to-end packet delays .

  5. A New Approach to Pointer Analysis for Assignments

    Institute of Scientific and Technical Information of China (English)

    HUANG Bo; ZANG Binyu; LI Jing; ZHU Chuanqi

    2001-01-01

    Pointer analysis is a technique to identify at compile-time the po tential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are clas sified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by Institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.

  6. An algorithm for 3-SAT problems

    OpenAIRE

    Tsukimoto, Hiroshi

    2016-01-01

    This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and the sums of the formulas are calculated. The algorithm outputs the number of satisfying assignments. The computational complexity of the algorithm is probably polynomial.

  7. A New and Better Algorithm for Evaluation of Overall Performance of Embedded Computer through Combining Grey Correlation with Assignment Weight%基于组合权重的嵌入式计算机综合性能灰色关联评价算法

    Institute of Scientific and Technical Information of China (English)

    周延年; 朱怡安

    2011-01-01

    文章针对嵌入式计算机的自身特点,建立了嵌入式计算机性能评估指标体系.同时,将组合赋权法和灰色关联度相结合,提出了组合权重的灰色关联评价模型.该模型将组合赋权法确定指标的权重系数代替灰色关联分析中的均值权重系数,用来修正各评价指标的差异,并对嵌入式计算机性能进行综合评估.实验结果表明,该方法有效地解决了部分指标信息不完全和部分指标信息模糊的问题,提高了计算机性能评估的可靠性,为今后嵌入式计算机综合性能的评价提供了有价值的参考.%Aim. The introduction of the full paper reviews some papers in the open literature, all in Chinese, and then proposes our better algorithm, which is explained in sections 1,2 and 3. Section 1 establishes the embedded computer performance appraisal indicator system, whose hierarchical structure for six main indexes is given in Fig.1. Section 2 explains the evaluation algorithm through combining grey correlation with assignment weight; its core consists of: ( 1 ) we combine the analytic hierarchy process (AHP) with the entropy weight to calculate the weight of each index and replace the average value weighting for the gray correlation analysis; (2) we carry out the comprehensive evaluation of the performance of embedded computer with our evaluation algorithm. Section 3 improves the grey correlation evaluation algorithm in section 2. Section 4 gives an illustrative example to verify the effectiveness of our evaluation algorithm and applies it to the comprehensive evaluation of embedded computer; the evaluation results, given in Table 3, and their analysis show preliminarily that our evaluation algorithm can effectively evaluate the performance of embedded computer.

  8. 基于资产准备金制度的货币政策工具创新——兼论资产准备金制度的局限性及面临的难题%On Monetary Policy Tool Innovation of Asset-based Reserve Requirements:The Limits of Asset-Based Reserve Requeirements a

    Institute of Scientific and Technical Information of China (English)

    王剑

    2011-01-01

    For traditional monetary policy instruments,there are many problems about dealing with more and more complicated economic conditions.Asset-based reserve requirements(ABRR) are the feasible choice for monetary policy innovation,which has significant advant%传统的货币政策工具已难以应对日益复杂的经济形势,基于资产的准备金制度在宏观调控、结构调整以及宏观审慎监管等方面都具有显著优势,是货币政策工具创新的一个可行选择。本文对该制度的作用机理、优势与局限性等问题进行了研究,并结合我国货币调控的实践得出一些启示与思考。

  9. 基于改进递推预测误差神经网络算法的极点配置PID控制方法%PID Control Based on Pole-assignment and Modified Recursive Prediction Error Algorithm for Neural Networks

    Institute of Scientific and Technical Information of China (English)

    吴平景; 王银河; 陈浩广

    2015-01-01

    针对工业控制中系统模型参数通常未知的特点,利用改进递推预测误差算法为基础的神经网络系统参数辨识方法,设计了极点配置自校正数字PID控制器.相比于基于梯度学习算法的神经网络辨识方法和通常的PID控制器,该方法具有参数辨识结构简单、神经元权值调整可持续且计算速度快、所采用的数字PID控制器鲁棒性强等优点.最后的数值仿真结果验证了本文算法及控制方法的有效性.%Since the parameters in control system models are usually unknown in industrial applications,this paper tries to identify the system parameters by using the modified recursive prediction error algorithm for neural networks,and then design a self tuning PID controller via the pole-assignment method.Com-pared with the neural network identification based on the gradient learning algorithm and conventional PID,the method in this paper has simple structure of parameters,sustainable adjustment of neuron weights and quick calculation speed.Furthermore,this digital PID controller also enjoys good perform-ance and easy application.And the simulation results verify that the effectiveness of this identification al-gorithm as well as the controller in this paper.

  10. Job assignment with multivariate skills

    OpenAIRE

    Brilon, Stefanie

    2010-01-01

    This paper analyzes the job assignment problem faced by a firm when workers’ skills are distributed along several dimensions and jobs require different skills to varying extent. I derive optimal assignment rules with and without slot constraints, and show that under certain circumstances workers may get promoted although in their new job they are expected to be less productive than in their old job. This can be interpreted as a version of the Peter Principle which states that workers get prom...

  11. Improving load balance with flexibly assignable tasks

    Energy Technology Data Exchange (ETDEWEB)

    Pinar, Ali; Hendrickson, Bruce

    2003-09-09

    In many applications of parallel computing, distribution ofthe data unambiguously implies distribution of work among processors. Butthere are exceptions where some tasks can be assigned to one of severalprocessors without altering the total volume of communication. In thispaper, we study the problem of exploiting this flexibility in assignmentof tasks to improve load balance. We first model the problem in terms ofnetwork flow and use combinatorial techniques for its solution. Ourparametric search algorithms use maximum flow algorithms for probing on acandidate optimal solution value. We describe two algorithms to solve theassignment problem with \\logW_T and vbar P vbar probe calls, w here W_Tand vbar P vbar, respectively, denote the total workload and number ofproce ssors. We also define augmenting paths and cuts for this problem,and show that anyalgorithm based on augmenting paths can be used to findan optimal solution for the task assignment problem. We then consideracontinuous version of the problem, and formulate it as a linearlyconstrained optimization problem, i.e., \\min\\|Ax\\|_\\infty,\\; {\\rms.t.}\\;Bx=d. To avoid solving an intractable \\infty-norm optimization problem,we show that in this case minimizing the 2-norm is sufficient to minimizethe \\infty-norm, which reduces the problem to the well-studiedlinearly-constrained least squares problem. The continuous version of theproblem has the advantage of being easily amenable to parallelization.Our experiments with molecular dynamics and overlapped domaindecomposition applications proved the effectiveness of our methods withsignificant improvements in load balance. We also discuss how ourtechniques can be enhanced for heterogeneous systems.

  12. A New Approach to Pointer Analysis for Assignments

    Institute of Scientific and Technical Information of China (English)

    黄波; 臧斌宇; 等

    2001-01-01

    Pointer analysis is a technique to identify at copile-time the potential values of the pointer expressions in a program,which promises significant benefits for optimzing and parallelizing complilers.In this paper,a new approach to pointer analysis for assignments is presented.In this approach,assignments are classified into three categories:pointer assignments,structure(union)assignents and normal assignments which don't affect the point-to information.Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm.When analyzing a pointer assigemtn.a new method called expression expansion is used to calculate both the left targets and the right targets.The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper,which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables.This algorithm is implemented in Agassiz,an analyzing tool for C programs developed by Institute of Parallel Processing,Fudan University,Its accuracy and effectiveness are illustrated by experimental data.

  13. A new heuristic for the quadratic assignment problem

    OpenAIRE

    Zvi Drezner

    2002-01-01

    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.

  14. A Stone Resource Assignment Model under the Fuzzy Environment

    Directory of Open Access Journals (Sweden)

    Liming Yao

    2012-01-01

    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.

  15. 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...... assignment  mechanism, which is based on the discretionary choice of case workers. This is done in a duration model context, using the timing-of-events framework to identify causal effects. We compare different assignment  mechanisms, and the results suggest that a significant reduction in the average...... 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....

  16. AC410 Unit 9 Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

     AC410 Unit 9 Assignment Click Link Below To Buy: http://hwcampus.com/shop/ac410-unit-9-assignment/   18–29. The CPA firm of Carson & Boggs LLP is performing an internal control audit in accordance with PCAOB Standard No. 5. The partner in charge of the engagement has asked you to explain the process of determining which controls to test. Describe the process, presenting each of the links in this process and a short summary of how the auditors approach each of them. v ...

  17. Applications of Assignment Algorithms to Nonparametric Tests for Homogeneity

    Science.gov (United States)

    2009-09-01

    of alternatives but is less powerful than the Mann-Whitney test (Conover, 1999), is the Wald - Wolfowitz runs test ( Wald and Wolfowitz , 1940...from different distributions. Like the Mann-Whitney test, the Wald - Wolfowitz test is asymptotically normal. Two other tests that are consistent...and multivariate cases: techniques based on rank permutations (such as Mann-Whitney and Wald - Wolfowitz ) and tests based on distribution function

  18. State-Space Search for Improved Autonomous UAVs Assignment Algorithm

    Science.gov (United States)

    2004-12-01

    Proceedings of the American Control Conference , Anchorage, Alaska, 2002. [2] Guo, W. and Nygard, K., “Combinatorial Trading...Resource Allocation,” Proceedings of the American Control Conference , Arlington, Vir- ginia, 2001. [5] Schumacher, C. J., Chandler, P. R., and Rasmussen...and Loitering,” Proceedings of the American Control Conference , Denver, Colorado, 2003. [7] Rasmussen, S.

  19. Assigning agents to a line

    DEFF Research Database (Denmark)

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

    2014-01-01

    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?

    Science.gov (United States)

    Ronning, Marte

    2011-01-01

    Using Dutch data on pupils in elementary school this paper is the first empirical study to analyze whether assigning homework has a heterogeneous impact on pupil achievement. Addressing potential biases by using a difference-in-difference approach, I find that the test score gap is larger in classes where everybody gets homework than in classes…

  1. Assessing Contributions to Group Assignments

    Science.gov (United States)

    Johnston, Lucy; Miles, Lynden

    2004-01-01

    We report the use of a combination of self- and peer-assessment in an undergraduate social psychology laboratory course. Students worked in small groups on a self-directed empirical project that they each wrote up independently as a laboratory report. Marks for the written assignment were moderated by a contribution index measure based on the…

  2. Adaptive protection algorithm and system

    Science.gov (United States)

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

    2009-04-28

    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.

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  4. Selection and Assignment of Machines: a Parallel Aproach

    OpenAIRE

    Francisco Ribeiro, José

    2003-01-01

    In this paper, a two-phase method is presented for selection of machines to be kept on the shop floor and assignment of parts to be manufactured to these machines. In the first phase, dynamic programming or a heuristic procedure identifies a set of feasible solutions to a knapsack problem. In the second phase, implicit enumeration technique or a greedy algorithm solves an assignment problem. The proposed method is written in language C and runs on a parallel virtual machine called PVM-W95. Th...

  5. Systematic assignment of thermodynamic constraints in metabolic network models

    Directory of Open Access Journals (Sweden)

    Heinemann Matthias

    2006-11-01

    Full Text Available Abstract Background The availability of genome sequences for many organisms enabled the reconstruction of several genome-scale metabolic network models. Currently, significant efforts are put into the automated reconstruction of such models. For this, several computational tools have been developed that particularly assist in identifying and compiling the organism-specific lists of metabolic reactions. In contrast, the last step of the model reconstruction process, which is the definition of the thermodynamic constraints in terms of reaction directionalities, still needs to be done manually. No computational method exists that allows for an automated and systematic assignment of reaction directions in genome-scale models. Results We present an algorithm that – based on thermodynamics, network topology and heuristic rules – automatically assigns reaction directions in metabolic models such that the reaction network is thermodynamically feasible with respect to the production of energy equivalents. It first exploits all available experimentally derived Gibbs energies of formation to identify irreversible reactions. As these thermodynamic data are not available for all metabolites, in a next step, further reaction directions are assigned on the basis of network topology considerations and thermodynamics-based heuristic rules. Briefly, the algorithm identifies reaction subsets from the metabolic network that are able to convert low-energy co-substrates into their high-energy counterparts and thus net produce energy. Our algorithm aims at disabling such thermodynamically infeasible cyclic operation of reaction subnetworks by assigning reaction directions based on a set of thermodynamics-derived heuristic rules. We demonstrate our algorithm on a genome-scale metabolic model of E. coli. The introduced systematic direction assignment yielded 130 irreversible reactions (out of 920 total reactions, which corresponds to about 70% of all irreversible

  6. PARETO OPTIMAL SOLUTIONS FOR MULTI-OBJECTIVE GENERALIZED ASSIGNMENT PROBLEM

    Directory of Open Access Journals (Sweden)

    S. Prakash

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: The Multi-Objective Generalized Assignment Problem (MGAP with two objectives, where one objective is linear and the other one is non-linear, has been considered, with the constraints that a job is assigned to only one worker – though he may be assigned more than one job, depending upon the time available to him. An algorithm is proposed to find the set of Pareto optimal solutions of the problem, determining assignments of jobs to workers with two objectives without setting priorities for them. The two objectives are to minimise the total cost of the assignment and to reduce the time taken to complete all the jobs.

    AFRIKAANSE OPSOMMING: ‘n Multi-doelwit veralgemeende toekenningsprobleem (“multi-objective generalised assignment problem – MGAP” met twee doelwitte, waar die een lineêr en die ander nielineêr is nie, word bestudeer, met die randvoorwaarde dat ‘n taak slegs toegedeel word aan een werker – alhoewel meer as een taak aan hom toegedeel kan word sou die tyd beskikbaar wees. ‘n Algoritme word voorgestel om die stel Pareto-optimale oplossings te vind wat die taaktoedelings aan werkers onderhewig aan die twee doelwitte doen sonder dat prioriteite toegeken word. Die twee doelwitte is om die totale koste van die opdrag te minimiseer en om die tyd te verminder om al die take te voltooi.

  7. CONTRACT ASSIGNMENT – THEORETICAL ASPECTS

    Directory of Open Access Journals (Sweden)

    Bogdan NAZAT

    2016-12-01

    Full Text Available This project aims to study in detail the theoretical aspects concerning the contract assignment, as provided by the relevant regulation, and the doctrine corresponding to old and current regulations. In this respect, this project aims to give the reader a comprehensive look on the institution in question, the regulation offered by the current Civil Code is reviewed taking into account the national and international doctrine.

  8. Graphical interpretation of Boolean operators for protein NMR assignments

    Energy Technology Data Exchange (ETDEWEB)

    Verdegem, Dries [Universite des Sciences et Technologies de Lille, Unite de Glycobiologie Structurale et Fonctionelle, UMR 8576 CNRS, IFR 147 (France); Dijkstra, Klaas [University of Groningen, Department of Biophysical Chemistry (Netherlands); Hanoulle, Xavier; Lippens, Guy [Universite des Sciences et Technologies de Lille, Unite de Glycobiologie Structurale et Fonctionelle, UMR 8576 CNRS, IFR 147 (France)], E-mail: guy.lippens@univ-lille1.fr

    2008-09-15

    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 three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal.

  9. A Circuit Simulation Technique for Congested Network Traffic Assignment Problem

    Science.gov (United States)

    Cho, Hsun-Jung; Huang, Heng

    2007-12-01

    The relation between electrical circuit and traffic network has been proposed by Sasaki and Inouye, but they proposed link cost function is a linear function which cannot present the congestion situation. Cho and Huang extended the link cost function to a nonlinear function which can explain the congested network. In this paper, we proposed a foremost and novel approach to solve the traffic assignment problem (TAP) by simulating the electrical circuit network which consists of nonlinear link cost function models. Comparing with the solutions of Frank-Wolfe algorithm, the simulation results are nearly identical. Thus, the simulation of a network circuit model can be applied to solve network traffic assignment problems. Finally, two examples are proposed, and the results confirmed that electrical circuit simulation is workable in solving congested network traffic assignment problems.

  10. Equilibrium Assignment Model with Uncertainties in Traffic Demands

    Directory of Open Access Journals (Sweden)

    Aiwu Kuang

    2013-01-01

    Full Text Available In this study, we present an equilibrium traffic assignment model considering uncertainties in traffic demands. The link and route travel time distributions are derived based on the assumption that OD traffic demand follows a log-normal distribution. We postulate that travelers can acquire the variability of route travel times from past experiences and factor such variability into their route choice considerations in the form of mean route travel time. Furthermore, all travelers want to minimize their mean route travel times. We formulate the assignment problem as a variational inequality, which can be solved by a route-based heuristic solution algorithm. Some numerical studies on a small test road network are carried out to validate the proposed model and algorithm, at the same time, some reasonable results are obtained.

  11. Value-of-information aware active task assignment

    Science.gov (United States)

    Mu, Beipeng; Chowdhary, Girish; How, Jonathan P.

    2013-05-01

    This paper discusses the problem of robust allocation of unmanned vehicles (T.N) to targets with uncertainties. In particular, the team consists of heterogeneous vehicles with different exploration and exploitation abilities. A general framework is presented to model uncertainties in the planning problems, which goes beyond traditional Gaussian noise. Traditionally, exploration and exploitation are decoupled into two assignment problems are planned with un-correlated goals. The coupled planning method considered here assign exploration vehicles based on its potential influence of the exploitation. Furthermore, a fully decentralized algorithm, Consensus-Based Bundle Algorithm (CBBA), is used to implement the decoupled and coupled methods. CBBA can handle system dynamic constraints such as target distance, vehicle velocities, and has computation complexity polynomial to the number of vehicles and targets. The coupled method is shown to have improved planning performance in a simulated scenario with uncertainties about target classification.

  12. UPMASK: Unsupervised Photometric Membership Assignment in Stellar Clusters

    Science.gov (United States)

    Krone-Martins, Alberto; Moitinho, Andre

    2015-04-01

    UPMASK, written in R, performs membership assignment in stellar clusters. It uses photometry and spatial positions, but can take into account other types of data. UPMASK takes into account arbitrary error models; the code is unsupervised, data-driven, physical-model-free and relies on as few assumptions as possible. The approach followed for membership assessment is based on an iterative process, principal component analysis, a clustering algorithm and a kernel density estimation.

  13. A new genetic representation for quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    Kratica Jozef

    2011-01-01

    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.

  14. Hierarchical method of task assignment for multiple cooperating UAV teams

    Institute of Scientific and Technical Information of China (English)

    Xiaoxuan Hu; Huawei Ma; Qingsong Ye; He Luo

    2015-01-01

    The problem of task assignment for multiple cooperat-ing unmanned aerial vehicle (UAV) teams is considered. Multiple UAVs forming several smal teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchical task assignment method is presented to address the problem. It breaks the original problem down to three levels of sub-problems: tar-get clustering, cluster al ocation and target assignment. The first two sub-problems are central y solved by using clustering algo-rithms and integer linear programming, respectively, and the third sub-problem is solved in a distributed and paral el manner, using a mixed integer linear programming model and an improved ant colony algorithm. The proposed hierarchical method can reduce the computational complexity of the task assignment problem con-siderably, especial y when the number of tasks or the number of UAVs is large. Experimental results show that this method is feasi-ble and more efficient than non-hierarchical methods.

  15. 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: a.bockmann@ibcp.fr [UMR 5086 CNRS/Universite de Lyon 1, Institut de Biologie et Chimie des Proteines (France); Meier, Beat H., E-mail: beme@ethz.ch [ETH Zurich, Physical Chemistry (Switzerland); Guentert, Peter, E-mail: guentert@em.uni-frankfurt.de [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany)

    2013-07-15

    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.

  16. Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches

    Directory of Open Access Journals (Sweden)

    Omar M. Zakaria

    2016-01-01

    Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

  17. Assignment Choice, Effort, and Assignment Completion: Does Work Ethic Predict Those Who Choose Higher-Effort Assignments?

    Science.gov (United States)

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

    2011-01-01

    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…

  18. More General Optimal Offset Assignment

    Directory of Open Access Journals (Sweden)

    Sven Mallach

    2015-06-01

    Full Text Available This manuscript presents exact approaches to the general offset assignment problem arising in the address code generation phase of compilers for application-specific processors. First, integer programming models for architecture-dependent and theoretically motivated special cases of the problem are established. Then, these models are extended to provide the first widely applicable formulations for the most general problem setting, supporting processors with several address registers and complex addressing capabilities. Existing heuristics are similarly extended and practical applicability of the proposed methods is demonstrated by experimental evaluation using an established and large benchmark set. The experiments allow us to study the impact of exploiting more complex memory addressing capabilities on the address computation costs of real-world programs. We also show how to integrate operand reordering techniques for commutative instructions into existing solution approaches.

  19. The Random Quadratic Assignment Problem

    Science.gov (United States)

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

    2011-11-01

    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.

  20. Solving the Quadratic Assignment Problems using Parallel ACO with Symmetric Multi Processing

    Science.gov (United States)

    Tsutsui, Shigeyoshi

    In this paper, we propose several types of parallel ant colony optimization algorithms with symmetric multi processing for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. As a base ant colony optimization algorithm, we used the cunning Ant System (cAS) which showed promising performance our in previous studies. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ant colony optimization algorithms is promising in solving quadratic assignment problems for real or real-like instances.

  1. Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment.

    Science.gov (United States)

    Karimzadehgan, Maryam; Zhai, Chengxiang

    2012-07-01

    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.

  2. A Novel Solution to the Dynamic Routing and Wavelength Assignment Problem in Transparent Optical Networks

    CERN Document Server

    Bhanja, Urmila; Roy, Rajarshi; 10.5121/ijcnc.2010.2209

    2010-01-01

    We present an evolutionary programming algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in optical wavelength-division multiplexing (WDM) networks under wavelength continuity constraint. We assume an ideal physical channel and therefore neglect the blocking of connection requests due to the physical impairments. The problem formulation includes suitable constraints that enable the algorithm to balance the load among the individuals and thus results in a lower blocking probability and lower mean execution time than the existing bio-inspired algorithms available in the literature for the DRWA problems. Three types of wavelength assignment techniques, such as First fit, Random, and Round Robin wavelength assignment techniques have been investigated here. The ability to guarantee both low blocking probability without any wavelength converters and small delay makes the improved algorithm very attractive for current optical switching networks.

  3. 5 CFR 351.705 - Administrative assignment.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Administrative assignment. 351.705 Section 351.705 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.705 Administrative assignment. (a) An...

  4. Competition Based Neural Networks for Assignment Problems

    Institute of Scientific and Technical Information of China (English)

    李涛; LuyuanFang

    1991-01-01

    Competition based neural networks have been used to solve the generalized assignment problem and the quadratic assignment problem.Both problems are very difficult and are ε approximation complete.The neural network approach has yielded highly competitive performance and good performance for the quadratic assignment problem.These neural networks are guaranteed to produce feasible solutions.

  5. A polyhedral approach to quadratic assignment problem

    OpenAIRE

    Köksaldı, Ahmet Sertaç Murat

    1994-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references. In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of solutions to Quadratic Assignment Problems has been limited to instances of small dimension. In...

  6. The Mechanism Design Approach to Student Assignment

    Science.gov (United States)

    Pathak, Parag A.

    2011-01-01

    The mechanism design approach to student assignment involves the theoretical, empirical, and experimental study of systems used to allocate students into schools around the world. Recent practical experience designing systems for student assignment has raised new theoretical questions for the theory of matching and assignment. This article reviews…

  7. 5 CFR 870.901 - Assignments permitted.

    Science.gov (United States)

    2010-01-01

    ... (CONTINUED) FEDERAL EMPLOYEES' GROUP LIFE INSURANCE PROGRAM Assignments of Life Insurance § 870.901..., and compensationers. (2) An individual may assign ownership of all life insurance under this part... Benefit before assigning the remainder of his/her insurance, the amount of Basic insurance does...

  8. Online Learning of Assignments that Maximize Submodular Functions

    CERN Document Server

    Golovin, Daniel; Streeter, Matthew

    2009-01-01

    Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize value of information? These applications exhibit strong diminishing returns: Selection of redundant ads and information sources decreases their marginal utility. We show that these and other problems can be formalized as repeatedly selecting an assignment of items to positions to maximize a sequence of monotone submodular functions that arrive one by one. We present an efficient algorithm for this general problem and analyze it in the no-regret model. Our algorithm possesses strong theoretical guarantees, such as a performance ratio that converges to the optimal constant of 1-1/e. We empirically evaluate our algorithm on two real-world online optimization problems on the web: ad allocation with submodular utilities, and dynamically ranking blogs to detect information cascades.

  9. New optimization model for routing and spectrum assignment with nodes insecurity

    Science.gov (United States)

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

    2017-04-01

    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.

  10. Integrated assignment and path planning

    Science.gov (United States)

    Murphey, Robert A.

    2005-11-01

    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

  11. Stereospecific assignments in proteins using exact NOEs

    Energy Technology Data Exchange (ETDEWEB)

    Orts, Julien; Vögeli, Beat; Riek, Roland, E-mail: roland.riek@phys.chem.ethz.ch [Swiss Federal Institute of Technology, Laboratory of Physical Chemistry (Switzerland); Güntert, Peter, E-mail: guentert@em.uni-frankfurt.de [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany)

    2013-10-18

    Recently developed methods to measure distances in proteins with high accuracy by “exact” nuclear Overhauser effects (eNOEs) make it possible to determine stereospecific assignments, which are particularly important to fully exploit the accuracy of the eNOE distance measurements. Stereospecific assignments are determined by comparing the eNOE-derived distances to protein structure bundles calculated without stereospecific assignments, or an independently determined crystal structure. The absolute and relative CYANA target function difference upon swapping the stereospecific assignment of a diastereotopic group yields the respective stereospecific assignment. We applied the method to the eNOE data set that has recently been obtained for the third immunoglobulin-binding domain of protein G (GB3). The 884 eNOEs provide relevant data for 47 of the total of 75 diastereotopic groups. Stereospecific assignments could be established for 45 diastereotopic groups (96 %) using the X-ray structure, or for 27 diastereotopic groups (57 %) using structures calculated with the eNOE data set without stereospecific assignments, all of which are in agreement with those determined previously. The latter case is relevant for structure determinations based on eNOEs. The accuracy of the eNOE distance measurements is crucial for making stereospecific assignments because applying the same method to the traditional NOE data set for GB3 with imprecise upper distance bounds yields only 13 correct stereospecific assignments using the X-ray structure or 2 correct stereospecific assignments using NMR structures calculated without stereospecific assignments.

  12. Automatic Assessment of Programming assignment

    Directory of Open Access Journals (Sweden)

    Surendra Gupta

    2012-01-01

    Full Text Available In today’s world study of computer’s language is more important. Effective and good programming skills are need full all computer science students. They can be master in programming, only through intensive exercise practices. Due to day by day increasing number of students in the class, the assessment of programming exercises leads to extensive workload for teacher/instructor, particularly if it has to be carried out manually. In this paper, we propose an automatic assessment system for programming assignments, using verification program with random inputs. One of the most important properties of a program is that, it carries out its intended function. The intended function of a program or part of a program can be verified by using inverse function’s verification program. For checking intended functionality and evaluation of a program, we have used verification program. This assessment system has been tested on basic C programming courses, and results shows that it can work well in basic programming exercises, with some initial promising results

  13. An Investigation of the Partial-Assignment Completion Effect on Students' Assignment Choice Behavior

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; Conley, Elisha

    2011-01-01

    This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment…

  14. Optimization of Load Assignment to Boilers in Industrial Boiler Plants

    Institute of Scientific and Technical Information of China (English)

    CAO Jia-cong; QIU Guang; CAO Shuang-hua; LIU Feng-qiang

    2004-01-01

    Along with the increasing importance of sustainable energy, the optimization of load assignment to boilers in an industrial boiler plant becomes one of the major projects for the optimal operation of boiler plants. Optimal load assignment for power systems has been a long-lasting subject, while it is quite new for industrial boiler plants. The existing methods of optimal load assignment for boiler plants are explained and analyzed briefly in the paper. They all need the fuel cost curves of boilers. Thanks to some special features of the curves for industrial boilers, a new model referred to as minimized departure model (MDM) of optimization of load assignment for boiler plants is developed and proposed in the paper. It merely relies upon the accessible data of two typical working conditions to build the model, viz. the working conditions with the highest efficiency of a boiler and with no-load. Explanation of the algorithm of computer program is given, and effort is made so as to determine in advance how many and which boilers are going to work. Comparison between the results using MDM and the results reported in references is carried out, which proves that MDM is preferable and practicable.

  15. Process and Strategy of Full Life Circle Management of Power Metering Assets Based on MDS%基于MDS系统的电能计量资产全寿命周期管理流程及策略

    Institute of Scientific and Technical Information of China (English)

    吴华; 孙恺霞; 娄云; 田娟

    2015-01-01

    In this paper, on the basis of the manufacturing dispatching system of the province-level metering centers, we established the process for the full life circle management of the power metering assets, analyzed the correspondence between the links in the life circle of the metering assets and the functional modules of the MDS system, proposed the strategy for the full life circle management of the power metering assets based on the MDS system, and at the end, through a specific case, demonstrated the effectiveness and practicality of the management process and strategy.%基于省级计量中心生产调度平台(MDS系统),构建了电能计量资产全寿命周期的管理流程,分析了计量资产全寿命周期环节与MDS系统各业务模块的对应关系,提出了基于MDS系统的电能计量资产全寿命周期流程管理策略。最后以国网重庆市电力公司电力科学研究院计量中心为例,验证了基于MDS系统的电能计量资产全寿命周期流程管理的有效性和实用性。

  16. Fiber Assignment in Next-generation Wide-field Spectrographs

    CERN Document Server

    Morales, Isaac; Azzaro, Marco; Prada, Francisco; Sanchez, Justo; Becerril, Santiago

    2011-01-01

    We present an optimized algorithm for assigning fibers to targets in next-generation fiber-fed multi-object spectrographs. The method, that we named draining algorithm, ensures that the maximum number of targets in a given target field is observed in the first few tiles. Using randomly distributed targets and mock galaxy catalogs we have estimated that the gain provided by the draining algorithm as compared to a random assignment can be as much as 2% for the first tiles. This would imply for a survey like BigBOSS saving for observation several hundred thousand objects or, alternatively, reducing the covered area in ~350 sq. deg. An important advantage of this method is that the fiber collision problem can be solved easily and in an optimal way. We also discuss additional optimizations of the fiber positioning process. In particular, we show that allowing for rotation of the focal plane can improve the efficiency of the process in ~3.5-4.5% even if only small adjustments are permitted (up to 2 deg). For instru...

  17. Block-decoupling vibration control using eigenstructure assignment

    Science.gov (United States)

    Wei, Xiaojun; Mottershead, John E.

    2016-06-01

    A theoretical study is presented on the feasibility of applying active control for the purpose of vibration isolation in lightweight structures by block diagonalisation of the system matrices and at the same time assigning eigenvalues (natural frequencies and damping) to the chosen substructures separately. The methodology, based on eigenstructure assignment using the method of receptances, is found to work successfully when the eigenvalues of the open-loop system are controllable and the open- and closed-loop eigenvalues are distinct. In the first part of the paper results are obtained under the restriction that the mass matrix is diagonal (lumped). This is certainly applicable in the case of numerous engineering systems consisting of discrete masses with flexible interconnections of negligible mass. Later in the paper this restriction is lifted to allow bandedness of the mass matrix. Several numerical examples are used to illustrate the working of the proposed algorithm.

  18. Algorithm for structure constants

    CERN Document Server

    Paiva, F M

    2011-01-01

    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.

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

    DEFF Research Database (Denmark)

    Limal, Emmanuel; Stubkjær, Kristian

    1999-01-01

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

  20. Job assignments, intrinsic motivation and explicit incentives

    OpenAIRE

    Nafziger, Julia

    2008-01-01

    This paper considers the interplay of job assignments with the intrinsic and extrinsic motivation of an agent. Job assignments influence the self confidence of the agent, and thereby his intrinsic motivation. Monetary reward allow the principal to complement intrinsic motivation with extrinsic incentives. The main result is that the principal chooses an inefficient job assignment rule to enhance the agent's intrinsic motivation even though she can motivate him with monetary rewards. This show...

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

    Data.gov (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...

  2. Arbitrary eigenvalue assignments for linear time-varying multivariable control systems

    Science.gov (United States)

    Nguyen, Charles C.

    1987-01-01

    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.

  3. Solving the quadratic assignment problem with clues from nature.

    Science.gov (United States)

    Nissen, V

    1994-01-01

    This paper describes a new evolutionary approach to solving quadratic assignment problems. The proposed technique is based loosely on a class of search and optimization algorithms known as evolution strategies (ES). These methods are inspired by the mechanics of biological evolution and have been applied successfully to a variety of difficult problems, particularly in continuous optimization. The combinatorial variant of ES presented here performs very well on the given test problems as compared with the standard 2-Opt heuristic and results with simulated annealing and tabu search. Extensions for practical applications in factory layout are described.

  4. Robust quadratic assignment problem with budgeted uncertain flows

    Directory of Open Access Journals (Sweden)

    Mohammad Javad Feizollahi

    2015-12-01

    Full Text Available We consider a generalization of the classical quadratic assignment problem, where material flows between facilities are uncertain, and belong to a budgeted uncertainty set. The objective is to find a robust solution under all possible scenarios in the given uncertainty set. We present an exact quadratic formulation as a robust counterpart and develop an equivalent mixed integer programming model for it. To solve the proposed model for large-scale instances, we also develop two different heuristics based on 2-Opt local search and tabu search algorithms. We discuss performance of these methods and the quality of robust solutions through extensive computational experiments.

  5. Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment

    Science.gov (United States)

    Barnawi, Waleed T.

    Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned

  6. Predicting Assignment Submissions in a Multiclass Classification Problem

    Directory of Open Access Journals (Sweden)

    Bogdan Drăgulescu

    2015-08-01

    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. 33 CFR 401.61 - Assigned frequencies.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel...

  8. Optimization of Rated Officer Staff Assignments

    Science.gov (United States)

    2007-06-01

    determinant +1, -1 or 0, which holds for the assignment problem ( Bazaraa et al., 1990). The Unimodularity Theorem states for an integer matrix A with...Prentice-Hall, 1993. 2. Air Force Instruction 36-2110, Assignments, 20 April 2005. 3. Bazaraa , Mokhtar S., Jarvis, John J. and Sherali, Hanif D

  9. A Role-Based Fuzzy Assignment Model

    Institute of Scientific and Technical Information of China (English)

    ZUO Bao-he; FENG Shan

    2002-01-01

    It's very important to dynamically assign the tasks to corresponding actors in workflow management system, especially in complex applications. This improves the flexibility of workflow systems.In this paper, a role-based workflow model with fuzzy optimized intelligent assignment is proposed and applied in the investment management system. A groupware-based software model is also proposed.

  10. Stress Assignment in Reading Italian Polysyllabic Pseudowords

    Science.gov (United States)

    Sulpizio, Simone; Arduino, Lisa S.; Paizi, Despina; Burani, Cristina

    2013-01-01

    In 4 naming experiments we investigated how Italian readers assign stress to pseudowords. We assessed whether participants assign stress following distributional information such as stress neighborhood (the proportion and number of existent words sharing orthographic ending and stress pattern) and whether such distributional information affects…

  11. Effects of Individualized Assignments on Biology Achievement.

    Science.gov (United States)

    Kremer, Philip L.

    1983-01-01

    Compared detailed (favoring field dependence and induction) and nondetailed (favoring field dependence and deduction) assignments on biology achievement of grade 10 male students (N=95) over a seven-month period. Detailed assignments, employing pictorial and verbal block diagrams and high structure, significantly enhanced learning among some…

  12. Online Discussion Assignments Improve Students' Class Preparation

    Science.gov (United States)

    Lineweaver, Tara T.

    2010-01-01

    To increase the number of students who read the text before class and to promote student interaction centering on text material, I developed an online discussion assignment as a required component of a cognitive psychology course. Across 2 studies, this assignment had a limited effect on examination performance, but students completing online…

  13. 48 CFR 208.7002 - Assignment authority.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignment authority. 208..., DEPARTMENT OF DEFENSE ACQUISITION PLANNING REQUIRED SOURCES OF SUPPLIES AND SERVICES Coordinated Acquisition 208.7002 Assignment authority. (a) Under the DoD Coordinated Acquisition Program,...

  14. 7 CFR 601.1 - Functions assigned.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Functions assigned. 601.1 Section 601.1 Agriculture... AGRICULTURE GENERAL FUNCTIONS § 601.1 Functions assigned. The Natural Resources Conservation Service (NRCS) is... conserve, improve, and sustain natural resources. The following functions support the mission. (a)...

  15. Detecting Plagiarism in MS Access Assignments

    Science.gov (United States)

    Singh, Anil

    2013-01-01

    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…

  16. Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method

    Science.gov (United States)

    Morihiro, Yusuke; Miyamoto, Toshiyuki; Kumagai, Sadatoshi

    This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.

  17. Comparing of the Deterministic Simulated Annealing Methods for Quadratic Assignment Problem

    Directory of Open Access Journals (Sweden)

    Mehmet Güray ÜNSAL

    2013-08-01

    Full Text Available In this study, Threshold accepting and Record to record travel methods belonging to Simulated Annealing that is meta-heuristic method by applying Quadratic Assignment Problem are statistically analyzed whether they have a significant difference with regard to the values of these two methods target functions and CPU time. Between the two algorithms, no significant differences are found in terms of CPU time and the values of these two methods target functions. Consequently, on the base of Quadratic Assignment Problem, the two algorithms are compared in the study have the same performance in respect to CPU time and the target functions values

  18. Airport Gate Assignment: New Model and Implementation

    CERN Document Server

    Li, Chendong

    2008-01-01

    Airport gate assignment is of great importance in airport operations. In this paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model and implement the model with Optimization Programming language (OPL). With the objective to minimize the number of conflicts of any two adjacent aircrafts assigned to the same gate, we build a mathematical model with logical constraints and the binary constraints, which can provide an efficient evaluation criterion for the Airlines to estimate the current gate assignment. To illustrate the feasibility of the model we construct experiments with the data obtained from Continental Airlines, Houston Gorge Bush Intercontinental Airport IAH, which indicate that our model is both energetic and effective. Moreover, we interpret experimental results, which further demonstrate that our proposed model can provide a powerful tool for airline companies to estimate the efficiency of their current work of gate assignment.

  19. MidSFN Local Scheduling AlgorithmMidSFN Local Scheduling Algorithm for Heterogeneous Grid Environment

    Directory of Open Access Journals (Sweden)

    Dr.G.Sumathi

    2012-05-01

    Full Text Available A grid is a heterogeneous computing and communication system that allows a group of nodes to compass a task. The process of assigning the jobs or subtasks to the nodes present in the heterogeneous grid is known as scheduling. The type of scheduling in which the subtasks are assigned to the nodes is known as Local Scheduling.A significant research problem is how to assign resources to the subtasks and order the execution of the subtasks that are matched to maximize performance criterion of a local grid system. This procedure of scheduling is called mapping or resource allocation. MidSFN adverts to Medium Subtask Fastest Node algorithm which classifies the subtasks into three tier categories, High, Middle and Low based on their priority. In MidSFN algorithm priority is assigned based on the new parameters Computational Complexity and Processing Power. The value for processing power is assigned based on the Performance Factor. The value of the Performance Factor is the product of the number of operations per cycle per processor and the number of instructions processed per second. In MidSFN algorithm the subtask of medium computational complexity and resources exhibiting medium processing power are assigned with a high priority. The subtasks are then mapped to respective processors based on the assigned priority for execution. Compared to other local scheduling algorithms, MidSFN algorithm shows efficient load balancing and better computation with effective usage of resources. The effectiveness of this algorithm is evaluated through simulation results.

  20. Priority-Based Routing Resource Assignment Considering Crosstalk

    Institute of Scientific and Technical Information of China (English)

    Yi-Ci Cai; Bin Liu; Yan Xiong; Qiang Zhou; Xian-Long Hong

    2006-01-01

    Crosstalk has become one of the most critical concerns in very deep sub-micron era. This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. Noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage,so that the operations could easily cooperate to fully exert their power on crosstalk reduction. An efficient priority-based heuristic algorithm is developed, which works slice by slice. Crosstalk avoidance, and many other aspects that are critical in routing practice including congestion, vias, layer preference, etc., are taken into account. A track reservation strategy is adopted in the algorithm framework to compensate the undesired effects caused by sequential routing. Experimental results on a series of ISPD98 and industrial benchmarks show that the proposed approach is able to reduce capacitive crosstalk by about 70% on average without compromising completion ratio compared with a previously reported graph based algorithm,demonstrating the advantages of the approach.

  1. Genetic algorithms

    Science.gov (United States)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    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.

  2. Algorithm design

    CERN Document Server

    Kleinberg, Jon

    2006-01-01

    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.

  3. The Assignment Game : The Reduced Game

    OpenAIRE

    Owen, Guillermo

    1992-01-01

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

  4. 5 CFR 870.902 - Making an assignment.

    Science.gov (United States)

    2010-01-01

    ... assignment. (a) To assign insurance, an insured individual must complete an approved assignment form. Only the insured individual can make an assignment; no one can assign on behalf of an insured individual... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Making an assignment. 870.902 Section...

  5. A new routing assignment model for Internet

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper builds a new traffic assignment model for Internet. The routing policy based on this model can realize load splitting in a network automatically, which overcomes the shortcoming of OSPF and satisfies the load balancing requirement of IETF.

  6. New pole placement algorithm - Polynomial matrix approach

    Science.gov (United States)

    Shafai, B.; Keel, L. H.

    1990-01-01

    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.

  7. Performance-driven assignment and mapping for reliable networks-on-chips

    Institute of Scientific and Technical Information of China (English)

    Qian-qi LE; Guo-wu YANG; William N.N.HUNG; Xiao-yu SONG; Fu-you FAN

    2014-01-01

    Network-on-chip (NoC) communication architectures present promising solutions for scalable communication re-quests in large system-on-chip (SoC) designs. Intellectual property (IP) core assignment and mapping are two key steps in NoC design, significantly affecting the quality of NoC systems. Both are NP-hard problems, so it is necessary to apply intelligent algorithms. In this paper, we propose improved intelligent algorithms for NoC assignment and mapping to overcome the draw-backs of traditional intelligent algorithms. The aim of our proposed algorithms is to minimize power consumption, time, area, and load balance. This work involves multiple conflicting objectives, so we combine multiple objective optimization with intelligent algorithms. In addition, we design a fault-tolerant routing algorithm and take account of reliability using comprehensive perfor-mance indices. The proposed algorithms were implemented on embedded system synthesis benchmarks suite (E3S). Experimental results show the improved algorithms achieve good performance in NoC designs, with high reliability.

  8. Fibre assignment in next-generation wide-field spectrographs

    Science.gov (United States)

    Morales, Isaac; Montero-Dorta, Antonio D.; Azzaro, Marco; Prada, Francisco; Sánchez, Justo; Becerril, Santiago

    2012-01-01

    We present an optimized algorithm for assigning fibres to targets in next-generation fibre-fed multi-object spectrographs. The method, which we have called the draining algorithm, ensures that the maximum number of targets in a given target field is observed in the first few tiles. Using randomly distributed targets and mock galaxy catalogues, we have estimated that the gain provided by the draining algorithm, compared to a random assignment, can be as much as 2 per cent for the first tiles. For a survey such as the Baryon Oscillation Spectroscopic Survey (BigBOSS), this would imply saving for observation several hundred thousand objects or, alternatively, reducing the covered area in ˜350 deg2. An important advantage of this method is that the fibre collision problem can be solved easily and in an optimal way. We also discuss the additional optimizations of the fibre-positioning process. In particular, we show that if we allow for the rotation of the focal plane, we can improve the efficiency of the process by ˜3.5-4.5 per cent, even if only small adjustments are permitted (up to 2°). For instruments that allow large rotations of the focal plane, the expected gain increases to ˜5-6 per cent. Therefore, these results strongly support the use of focal plane rotation in future spectrographs, as far as the efficiency of the fibre-positioning process is concerned. Finally, we discuss the implications of our optimizations and provide some basic hints for an optimal survey strategy, based on the number of targets per positioner.

  9. Competitive Traffic Assignment in Road Networks

    Directory of Open Access Journals (Sweden)

    Krylatov Alexander Y.

    2016-09-01

    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.

  10. Least Square Methods for Solving Systems of Inequalities with Application to an Assignment Problem

    Science.gov (United States)

    1992-11-01

    problem using continuous methods and (2) solving systems of inequalities (and equalities) in a least square sense. The specific assignment problem has...linear equations, in a least square sense are developed. Common algorithmic approaches to solve nonlinear least square problems are adapted to solve

  11. Cooperative distributed target tracking algorithm in mobile wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distrib...

  12. Comparison of traffic assignment in VISUM and transport simulation in MATSim

    Directory of Open Access Journals (Sweden)

    Bartłomiej PIĄTKOWSKI

    2013-01-01

    Full Text Available The paper presents a comparison of different approaches to traffic modelling and forecasting in VISUM and MATSim. The comparison was based on three indicators: link volumes, average travel time and distance. For this purpose, a virtual city with a road network and an OD matrix describing travel demands were created. Next the input data were created to both systems. The equilibrium and the dynamic stochastic assignment algorithms were used in VISUM while in MATSim a multi-agent approach was used for planning and a queue-based flow model for simulation. The comparison showed that although the overall results obtained in both systems were convergent, the detailed distribution of traffic was different. In VISUM the static assignment algorithm resulted in increased traffic flow on links located near to the connectors, while the dynamic one assigned traffic more uniformly, matching the MATSim’s results.

  13. Dynamic Optimal CCI Weight Channel Pre-evaluative Assignment in Adaptive Array Antenna System

    Institute of Scientific and Technical Information of China (English)

    MENG Weixiao; ZHANG Naitong

    2001-01-01

    Dynamic Channel Assignment (DCA)together with Adaptive Array Antenna (AAA) takes an important part in cellular mobile communication system. In this paper, a conception of co-channel in terference (CCI) quantification is advanced in multicell 8-element circular adaptive array antenna system.Normalized CCI weight relational expression, which is concerned in distance and look angle difference is sublimed from experiential sampling, induction and non-linear fitting. Then an algorithm of optimal CCI weight channel pre-evaluation is proposed as a solution of dynamic channel assignment. The least sum of weight value before assignment is used to pre-evaluate the performance of all the channels. Based on an approached practical cellular model, a series of systemclassed simulations are accomplished. Simulation resuits show that this algorithm is quite effective: system capacity is increased greatly; traffic block probabilities are decreased remarkably; nice channel quality is maintained; the reliability of DCA is enhanced; the higher frequency utilization efficiency is also obtained.

  14. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine

    2009-01-01

    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

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

    2017-04-01

    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.

  16. A New Algorithm for Minimum Cost MRGAP

    Directory of Open Access Journals (Sweden)

    Lutfu Sagbansua

    2009-10-01

    Full Text Available This paper introduces an algorithm based on independent and combined strategies of surrogate constraint relaxation and scatter search coupled with simple Tabu search, subgradient optimization, and Lagrangean relaxation. The key contribution of this research is the development of effective RAMP and Primal-Dual RAMP algorithms for the MRGAP. Assignment problems involve assigning a set of jobs at hand to another set of agents which are limited in resources. Depending on the number of constraints, several different types of assignment problems can be formulated. The paper discusses the formulation of such a problem and an algorithm produced to solve these problems. Computational results are provided as a basis of comparison with several algorithms.

  17. Evolving evolutionary algorithms using linear genetic programming.

    Science.gov (United States)

    Oltean, Mihai

    2005-01-01

    A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.

  18. An Approach In Optimization Of Ad-Hoc Routing Algorithms

    Directory of Open Access Journals (Sweden)

    Sarvesh Kumar Sharma

    2012-06-01

    Full Text Available In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.

  19. Heuristic Scheme for Home Circuit Grouping andWavelength Assignment in LOBS-HC Networks

    Science.gov (United States)

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

    2014-09-01

    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.

  20. Multi-input partial eigenvalue assignment for high order control systems with time delay

    Science.gov (United States)

    Zhang, Lei

    2016-05-01

    In this paper, we consider the partial eigenvalue assignment problem for high order control systems with time delay. Ram et al. (2011) [1] have shown that a hybrid method can be used to solve partial quadratic eigenvalue assignment problem of single-input vibratory system. Based on this theory, a rather simple algorithm for solving multi-input partial eigenvalue assignment for high order control systems with time delay is proposed. Our method can assign the expected eigenvalues and keep the no spillover property. The solution can be implemented with only partial information of the eigenvalues and the corresponding eigenvectors of the matrix polynomial. Numerical examples are given to illustrate the efficiency of our approach.

  1. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan

    2016-01-01

    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.

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

    Directory of Open Access Journals (Sweden)

    de Brevern Alexandre G

    2005-09-01

    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.

  3. argosy B6029 full course latest 2015 winters [all assignments and Assignment discussion

    OpenAIRE

    Laynebaril

    2017-01-01

     argosy B6029 full course latest 2015 winters [all assignments and Assignment discussion ] Click Link Below To Buy:   http://hwcampus.com/shop/b6029-full-course/   Assignment 2: Discussion—Competitive Advantage and Globalization Competitive advantage implies the creation of a system that has a unique advantage over competitors. With the advent of globalization, the competition has become stronger and can be located anywhere in the world. The idea behind competitive adv...

  4. Improving active eigenvector assignment through passive modifications

    Science.gov (United States)

    Belotti, R.; Richiedei, D.

    2016-09-01

    Specifications on the dynamic behavior of feedback-controlled vibrating systems are often expressed in terms of its eigenstructure, i.e. eigenvalues and eigenvectors. The notion of controllability establishes the possibility to assign eigenvalues through state feedback, but it is not adequate to assure the assignment of arbitrary eigenvectors. Indeed, assignable eigenvectors are just those belonging to the allowable vector subspace, which depends on the physical properties of the vibrating system (mass, damping and stiffness matrices) and of the actuators. To overcome this limitation, this paper proposes a hybrid approach that exploits passive modification of the system physical parameters to modify the allowable subspace in such a way that it spans (or closely approximates) the desired eigenvectors. Then, once that the system modifications have been computed, standard techniques for control synthesis can be employed to compute the gains assigning the desired poles and the eigenvectors. The modification of the allowable subspace is cast in this work as a rank minimization problem, which can be efficiently tackled through semi-definite programming. The proposed method is numerically validated on a lumped parameter system, by proving that the assignment of eigenvectors by hybrid control is significantly enhanced compared with sole active control.

  5. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    1993-01-01

    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 distri

  6. Quantum Algorithms

    Science.gov (United States)

    Abrams, D.; Williams, C.

    1999-01-01

    This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

  7. NVR-BIP: Nuclear Vector Replacement using Binary Integer Programming for NMR Structure-Based Assignments.

    Science.gov (United States)

    Apaydin, Mehmet Serkan; Çatay, Bülent; Patrick, Nicholas; Donald, Bruce R

    2011-05-01

    Nuclear magnetic resonance (NMR) spectroscopy is an important experimental technique that allows one to study protein structure and dynamics in solution. An important bottleneck in NMR protein structure determination is the assignment of NMR peaks to the corresponding nuclei. Structure-based assignment (SBA) aims to solve this problem with the help of a template protein which is homologous to the target and has applications in the study of structure-activity relationship, protein-protein and protein-ligand interactions. We formulate SBA as a linear assignment problem with additional nuclear overhauser effect constraints, which can be solved within nuclear vector replacement's (NVR) framework (Langmead, C., Yan, A., Lilien, R., Wang, L. and Donald, B. (2003) A Polynomial-Time Nuclear Vector Replacement Algorithm for Automated NMR Resonance Assignments. Proc. the 7th Annual Int. Conf. Research in Computational Molecular Biology (RECOMB), Berlin, Germany, April 10-13, pp. 176-187. ACM Press, New York, NY. J. Comp. Bio., (2004), 11, pp. 277-298; Langmead, C. and Donald, B. (2004) An expectation/maximization nuclear vector replacement algorithm for automated NMR resonance assignments. J. Biomol. NMR, 29, 111-138). Our approach uses NVR's scoring function and data types and also gives the option of using CH and NH residual dipolar coupling (RDCs), instead of NH RDCs which NVR requires. We test our technique on NVR's data set as well as on four new proteins. Our results are comparable to NVR's assignment accuracy on NVR's test set, but higher on novel proteins. Our approach allows partial assignments. It is also complete and can return the optimum as well as near-optimum assignments. Furthermore, it allows us to analyze the information content of each data type and is easily extendable to accept new forms of input data, such as additional RDCs.

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

    Directory of Open Access Journals (Sweden)

    Niu Zhisheng

    2010-01-01

    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.

  9. Flow Oriented Channel Assignment for Multi-Radio Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Fei Ye

    2010-01-01

    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.

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

    2000-06-15

    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

  11. From course assignment paper to publishable manuscript.

    Science.gov (United States)

    Rew, Lynn

    2012-12-01

    Both undergraduate and graduate nursing students are expected to write numerous papers in their educational programs; however, most of these papers are never published. Many students and faculty lack the skills needed to convert a course assignment paper to a publishable manuscript. The purpose of this article is to describe 10 steps that can transform a course assignment paper into a publishable manuscript. These steps include outlining, clarifying the topic, clearly stating the purpose, identifying an appropriate audience, revising with faculty's feedback, querying journal editors, revising to conform to journal's author guidelines, requesting and responding to peer feedback, and finally editing and proofreading prior to submitting the manuscript. Faculty members are encouraged to make writing assignments that students can then convert to publishable manuscripts. Such publications form an essential cornerstone of professional holistic nursing.

  12. Assignment of fields from particles to mesh

    CERN Document Server

    Duque, Daniel

    2016-01-01

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

  13. Writing Assignments that Promote Active Learning

    Science.gov (United States)

    Narayanan, M.

    2014-12-01

    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.

  14. The Wiener maximum quadratic assignment problem

    CERN Document Server

    Cela, Eranda; Woeginger, Gerhard J

    2011-01-01

    We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time solution for the following problem from chemical graph theory: Find a tree that maximizes the Wiener index among all trees with a prescribed degree sequence. This settles an open problem from the literature.

  15. AC410 Unit 2 Homework Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

      AC410 Unit 2 Homework Assignment Click Link Below To Buy: http://hwcampus.com/shop/ac410-unit-2-homework-assignment/   3-31 Ron Barber, CPA, is auditing the financial statements of DGF, Inc., a publicly held company. During the course of the audit, Barber discovered that DGF has been making illegal bribes to foreign government officials to obtain business, and he reported the matter to senior management and the board of directors of DGF. Required: If management a...

  16. Evolving Networks with Nonlinear Assignment of Weight

    Institute of Scientific and Technical Information of China (English)

    TANG Chao; TANG Yi

    2006-01-01

    We propose a weighted evolving network model in which the underlying topological structure is still driven by the degree according to the preferential attachment rule while the weight assigned to the newly established edges is dependent on the degree in a nonlinear form. By varying the parameter α that controls the function determining the assignment of weight, a wide variety of power-law behaviours of the total weight distributions as well as the diversity of the weight distributions of edges are displayed. Variation of correlation and heterogeneity in the network is illustrated as well.

  17. Experimenting with Request Assignment Simulator (RAS

    Directory of Open Access Journals (Sweden)

    R. Arokia Paul Rajan

    2014-11-01

    Full Text Available There is no existence of dedicated simulators on the Internet that studies the impact of load balancing principles of the cloud architectures. Request Assignment Simulator (RAS is a customizable, visual tool that helps to understand the request assignment to the resources based on the load balancing principles. We have designed this simulator to fit into Infrastructure as a Service (IaaS cloud model. In this paper, we present a working manual useful for the conduct of experiment with RAS. The objective of this paper is to instill the user to understand the pertinent parameters in the cloud, their metrics, load balancing principles, and their impact on the performance.

  18. Earth Observation Satellites Scheduling Based on Decomposition Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Feng Yao

    2010-11-01

    Full Text Available A decomposition-based optimization algorithm was proposed for solving Earth Observation Satellites scheduling problem. The problem was decomposed into task assignment main problem and single satellite scheduling sub-problem. In task assignment phase, the tasks were allocated to the satellites, and each satellite would schedule the task respectively in single satellite scheduling phase. We adopted an adaptive ant colony optimization algorithm to search the optimal task assignment scheme. Adaptive parameter adjusting strategy and pheromone trail smoothing strategy were introduced to balance the exploration and the exploitation of search process. A heuristic algorithm and a very fast simulated annealing algorithm were proposed to solve the single satellite scheduling problem. The task assignment scheme was valued by integrating the observation scheduling result of multiple satellites. The result was responded to the ant colony optimization algorithm, which can guide the search process of ant colony optimization. Computation results showed that the approach was effective to the satellites observation scheduling problem.

  19. Java bytecode verification via static single assignment form

    DEFF Research Database (Denmark)

    Gal, Andreas; Probst, Christian W.; Franz, Michael

    2008-01-01

    Java Virtual Machines (JVMs) traditionally perform bytecode verification by way of an iterative data-flow analysis. Bytecode verification is necessary to ensure type safety because temporary variables in the JVM are not statically typed. We present an alternative verification mechanism that trans......Java Virtual Machines (JVMs) traditionally perform bytecode verification by way of an iterative data-flow analysis. Bytecode verification is necessary to ensure type safety because temporary variables in the JVM are not statically typed. We present an alternative verification mechanism...... that transforms JVM bytecode into Static Single Assignment Form (SSA) and thereby propagates definitions directly to uses. Type checking at control flow merge points can then be performed in a single pass. Our prototype implementation of the new algorithm is faster than the standard JVM bytecode verifier. It has...

  20. UPMASK: unsupervised photometric membership assignment in stellar clusters

    CERN Document Server

    Krone-Martins, A

    2013-01-01

    We develop a method for membership assignment in stellar clusters using only photometry and positions. The method, UPMASK, is aimed to be unsupervised, data driven, model free, and to rely on as few assumptions as possible. It is based on an iterative process, principal component analysis, clustering algorithm, and kernel density estimations. Moreover, it is able to take into account arbitrary error models. An implementation in R was tested on simulated clusters that covered a broad range of ages, masses, distances, reddenings, and also on real data of cluster fields. Running UPMASK on simulations showed that it effectively separates cluster and field populations. The overall spatial structure and distribution of cluster member stars in the colour-magnitude diagram were recovered under a broad variety of conditions. For a set of 360 simulations, the resulting true positive rates (a measurement of purity) and member recovery rates (a measurement of completeness) at the 90% membership probability level reached ...

  1. State assignment approach to asynchronous CMOS circuit design

    Science.gov (United States)

    Kantabutra, Vitit; Andreou, Andreas G.

    1994-04-01

    We present a new algorithm for state assignment in asynchronous circuits so that for each circuit state transition, only one (secondary) state variable switches. No intermediate unstable states are used. The resultant circuits operate at optimum speed in terms of the number of transitions made and use only static CMOS gates. By reducing the number of switching events per state transition, noise due to the switching events is reduced and dynamic power dissipation may also be reduced. Our approach is suitable for asynchronous sequential circuits that are designed from flow tables or state transition diagrams. The proposed approach may also be useful for designing synchronous circuits, but explorations into the subject of clock power would be necessary to determine its usefulness.

  2. OptiClust, an Improved Method for Assigning Amplicon-Based Sequence Data to Operational Taxonomic Units

    Science.gov (United States)

    Westcott, Sarah L.

    2017-01-01

    ABSTRACT Assignment of 16S rRNA gene sequences to operational taxonomic units (OTUs) is a computational bottleneck in the process of analyzing microbial communities. Although this has been an active area of research, it has been difficult to overcome the time and memory demands while improving the quality of the OTU assignments. Here, we developed a new OTU assignment algorithm that iteratively reassigns sequences to new OTUs to optimize the Matthews correlation coefficient (MCC), a measure of the quality of OTU assignments. To assess the new algorithm, OptiClust, we compared it to 10 other algorithms using 16S rRNA gene sequences from two simulated and four natural communities. Using the OptiClust algorithm, the MCC values averaged 15.2 and 16.5% higher than the OTUs generated when we used the average neighbor and distance-based greedy clustering with VSEARCH, respectively. Furthermore, on average, OptiClust was 94.6 times faster than the average neighbor algorithm and just as fast as distance-based greedy clustering with VSEARCH. An empirical analysis of the efficiency of the algorithms showed that the time and memory required to perform the algorithm scaled quadratically with the number of unique sequences in the data set. The significant improvement in the quality of the OTU assignments over previously existing methods will significantly enhance downstream analysis by limiting the splitting of similar sequences into separate OTUs and merging of dissimilar sequences into the same OTU. The development of the OptiClust algorithm represents a significant advance that is likely to have numerous other applications. IMPORTANCE The analysis of microbial communities from diverse environments using 16S rRNA gene sequencing has expanded our knowledge of the biogeography of microorganisms. An important step in this analysis is the assignment of sequences into taxonomic groups based on their similarity to sequences in a database or based on their similarity to each other

  3. 48 CFR 211.274-5 - Policy for assignment of Government-assigned serial numbers.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Policy for assignment of... DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE ACQUISITION PLANNING DESCRIBING AGENCY NEEDS Using and Maintaining Requirements Documents 211.274-5 Policy for assignment of...

  4. An efficient assignment of drainage direction over flat surfaces in raster digital elevation models

    Science.gov (United States)

    Barnes, Richard; Lehman, Clarence; Mulla, David

    2014-01-01

    In processing raster digital elevation models (DEMs) it is often necessary to assign drainage directions over flats-that is, over regions with no local elevation gradient. This paper presents an approach to drainage direction assignment which is not restricted by a flat's shape, number of outlets, or surrounding topography. Flow is modeled by superimposing a gradient away from higher terrain with a gradient towards lower terrain resulting in a drainage field exhibiting flow convergence, an improvement over methods which produce regions of parallel flow. This approach builds on previous work by Garbrecht and Martz (1997), but presents several important improvements. The improved algorithm guarantees that flats are only resolved if they have outlets. The algorithm does not require iterative application; a single pass is sufficient to resolve all flats. The algorithm presents a clear strategy for identifying flats and their boundaries. The algorithm is not susceptible to loss of floating-point precision. Furthermore, the algorithm is efficient, operating in O(N) time whereas the older algorithm operates in O(N) time. In testing, the improved algorithm ran 6.5 times faster than the old for a 100×100 cell flat and 69 times faster for a 700×700 cell flat. In tests on actual DEMs, the improved algorithm finished its processing 38-110 times sooner while running on a single processor than a parallel implementation of the old algorithm did while running on 16 processors. The improved algorithm is an optimal, accurate, easy-to-implement drop-in replacement for the original. Pseudocode is provided in the paper and working source code is provided in the Supplemental Materials.

  5. 75 FR 55352 - Delegation of Authorities and Assignment of Responsibilities

    Science.gov (United States)

    2010-09-10

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

  6. Feedback for Web-based Assignments.

    Science.gov (United States)

    Collis, Betty; De Boer, W.; Slotman, K.

    2001-01-01

    Discusses a concept used at the University of Twente based on increased flexibility in learning options and the active student in which there are assignments submitted and monitored via a Web-based course management system. Outlines conceptual aspects of feedback as part of the assessment process, particularly feedback supported by a Web-based…

  7. Assignment procedure biases in randomized policy experiments

    DEFF Research Database (Denmark)

    Aldashev, Gani; Kirchsteiger, Georg; Sebald, Alexander Christopher

    2017-01-01

    ’s propensity to act reciprocally. When people are motivated by reciprocity, the choice of assignment procedure influences the RCTs’ findings. We show that even credible and explicit randomization procedures do not guarantee an unbiased prediction of the impact of policy interventions; however, they minimize...

  8. Accounting for Sustainability: An Active Learning Assignment

    Science.gov (United States)

    Gusc, Joanna; van Veen-Dirks, Paula

    2017-01-01

    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…

  9. Tabu search for target-radar assignment

    DEFF Research Database (Denmark)

    Hindsberger, Magnus; Vidal, Rene Victor Valqui

    2000-01-01

    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...... that tabu search could be used in near real-time decision making systems...

  10. Politics, Internet Assignments, and Civic Knowledge.

    Science.gov (United States)

    May, Vaughn

    2000-01-01

    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…

  11. 12 CFR 25.28 - Assigned ratings.

    Science.gov (United States)

    2010-01-01

    ... on the bank's performance under the lending, investment and service tests, the community development..., investment, and service tests. The OCC assigns a rating for a bank assessed under the lending, investment, and service tests in accordance with the following principles: (1) A bank that receives...

  12. On Online Assignments in a Calculus Class

    Science.gov (United States)

    Jungic, Veselin; Kent, Deborah; Menz, Petra

    2012-01-01

    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…

  13. A Literature Assignment with a Civic Emphasis.

    Science.gov (United States)

    Brough, Barbara L.

    1989-01-01

    Describes how students wrestled with an assignment that asked them to name their heroes or heroines, compare them to "Beowulf," and defend their choices in writing and class discussion. Tells how students gained insight into their community and the ways in which people make it better. (MG)

  14. Writing Assignments Based on Literary Works.

    Science.gov (United States)

    Matthews, Dorothy, Ed.

    1985-01-01

    The literature selections serving as the basis for writing assignments in the articles in this journal issue range from time-honored English classics ("Beowulf,""Sir Gawain and the Green Knight") and American standards ("A Farewell to Arms,""The Scarlet Letter") to contemporary fiction. The articles deal with works by women writers (Shirley…

  15. Dynamic traffic assignment on parallel computers

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K.; Frye, R.; Jakob, R.; Rickert, M.; Stretz, P.

    1998-12-01

    The authors describe part of the current framework of the TRANSIMS traffic research project at the Los Alamos National Laboratory. It includes parallel implementations of a route planner and a microscopic traffic simulation model. They present performance figures and results of an offline load-balancing scheme used in one of the iterative re-planning runs required for dynamic route assignment.

  16. Test-assignment: a quadratic coloring problem

    NARCIS (Netherlands)

    Duives, Jelle; Lodi, Andrea; Malaguti, Enrico

    2013-01-01

    We consider the problem of assigning the test variants of a written exam to the desks of a classroom in such a way that desks that are close-by receive different variants. The problem is a generalization of the Vertex Coloring and we model it as a binary quadratic problem. Exact solution methods bas

  17. Experimental results on quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    N.P. Nikolov

    1999-08-01

    Full Text Available The paper presents experimental results on quadratic assignment problem. The "scanning area" method formulated for radioelectronic equipment design is applied. For all more complex tests ours results are better or coincident with the ones known in literature. Conclusion concerning the effectiveness of method are given.

  18. School Assignment, School Choice and Social Mobility

    Science.gov (United States)

    Burgess, Simon; Briggs, Adam

    2010-01-01

    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…

  19. Radio labeling with pre-assigned frequencies

    NARCIS (Netherlands)

    Bodlaender, H.L.; Broersma, H.J.; Fomin, F.V.; Pyatkin, A.V.; Woeginer, G.J.

    2007-01-01

    A radio labeling of a graph G is an assignment of pairwise distinct, positive integer labels to the vertices of G such that labels of adjacent vertices differ by at least 2. The radio labeling problem (RL) consists in determining a radio labeling that minimizes the maximum label that is used (the so

  20. Assessing the Assignment Policy for Army Women

    Science.gov (United States)

    2007-01-01

    General surgeon 61K Thoracic surgeon 61L Plastic surgeon 61M Orthopedic surgeon 61N Flight surgeon 61P Physiatrist 61Q Radiation oncologist 61R Diagnostic... veterinarian (immaterial) Branch 65, Army Medical Specialist Corps 65A Occupational therapy Table C.3—Continued 100 Assessing the Assignment Policy for Army

  1. Improving Marine Corps Assignment of SDAP Levels

    Science.gov (United States)

    2013-03-01

    Advisor William R. Gates, Dean Graduate School of Business and Public Policy iv THIS PAGE INTENTIONALLY LEFT BLANK v ABSTRACT The...normally covered through TAD funds, COLA, BAH, and BAS, but not SDAP. 9 Information Paper, SDAP...Lien, and Dave Gregory. Evaluation of the Assignment Incentive Pay (AIP) System. Alexandria: CNA, June 2004. Greene, William . Econometric Analysis

  2. Incentivized optimal advert assignment via utility decomposition

    NARCIS (Netherlands)

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

    2014-01-01

    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 a

  3. Teaching Historical Analysis through Creative Writing Assignments

    Science.gov (United States)

    Peterson, Janine Larmon; Graham, Lea

    2015-01-01

    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…

  4. Semi-infinite assignment and transportation games

    NARCIS (Netherlands)

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

    2001-01-01

    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 assignm

  5. Democratization of Learning through Thematic Assignment

    Science.gov (United States)

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

    2015-01-01

    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. Sequence specific resonance assignment via Multicanonical Monte Carlo search using an ABACUS approach.

    Science.gov (United States)

    Lemak, Alexander; Steren, Carlos A; Arrowsmith, Cheryl H; Llinás, Miguel

    2008-05-01

    ABACUS [Grishaev et al. (2005) Proteins 61:36-43] is a novel protocol for automated protein structure determination via NMR. ABACUS starts from molecular fragments defined by unassigned J-coupled spin-systems and involves a Monte Carlo stochastic search in assignment space, probabilistic sequence selection, and assembly of fragments into structures that are used to guide the stochastic search. Here, we report further development of the two main algorithms that increase the flexibility and robustness of the method. Performance of the BACUS [Grishaev and Llinás (2004) J Biomol NMR 28:1-101] algorithm was significantly improved through use of sequential connectivities available from through-bond correlated 3D-NMR experiments, and a new set of likelihood probabilities derived from a database of 56 ultra high resolution X-ray structures. A Multicanonical Monte Carlo procedure, Fragment Monte Carlo (FMC), was developed for sequence-specific assignment of spin-systems. It relies on an enhanced assignment sampling and provides the uncertainty of assignments in a quantitative manner. The efficiency of the protocol was validated on data from four proteins of between 68-116 residues, yielding 100% accuracy in sequence specific assignment of backbone and side chain resonances.

  7. Assignment and Correspondence Tracking System - Tactical / Operational Reporting

    Data.gov (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...

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

    Directory of Open Access Journals (Sweden)

    Cruz-Domínguez, O.

    2016-05-01

    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.

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

    Science.gov (United States)

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

    2014-06-01

    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 http://sfb.kaust.edu.sa/Pages/Software.aspx.

  10. Dominant pole and eigenstructure assignment for positive systems with state feedback

    Science.gov (United States)

    Li, Zhao; Lam, James

    2016-09-01

    In this paper, the dominant pole assignment problem, the dominant eigenstructure assignment problem and the robust dominant pole assignment problem for linear time-invariant positive systems with state feedback are considered. The dominant pole assignment problem is formulated as a linear programming problem, and the dominant eigenstructure problem is formulated as a quasiconvex optimisation problem with linear constraints. The robust dominant pole assignment problem is formulated as a non-convex optimisation problem with non-linear constraints which is solved using particle swarm optimisation (PSO) with an efficient scheme which employs the dominant eigenstructure assignment technique to accelerate the convergence of the PSO procedure. Each of the three problems can be further constrained by requiring that the controller has a pre-specified structure, or the gain matrix have both elementwise upper and lower bounds. These constraints can be incorporated into the proposed scheme without increasing the complexity of the algorithms. Both the continuous-time case and the discrete-time case are treated in the paper.

  11. Robust, integrated computational control of NMR experiments to achieve optimal assignment by ADAPT-NMR.

    Science.gov (United States)

    Bahrami, Arash; Tonelli, Marco; Sahu, Sarata C; Singarapu, Kiran K; Eghbalnia, Hamid R; Markley, John L

    2012-01-01

    ADAPT-NMR (Assignment-directed Data collection Algorithm utilizing a Probabilistic Toolkit in NMR) represents a groundbreaking prototype for automated protein structure determination by nuclear magnetic resonance (NMR) spectroscopy. With a [(13)C,(15)N]-labeled protein sample loaded into the NMR spectrometer, ADAPT-NMR delivers complete backbone resonance assignments and secondary structure in an optimal fashion without human intervention. ADAPT-NMR achieves this by implementing a strategy in which the goal of optimal assignment in each step determines the subsequent step by analyzing the current sum of available data. ADAPT-NMR is the first iterative and fully automated approach designed specifically for the optimal assignment of proteins with fast data collection as a byproduct of this goal. ADAPT-NMR evaluates the current spectral information, and uses a goal-directed objective function to select the optimal next data collection step(s) and then directs the NMR spectrometer to collect the selected data set. ADAPT-NMR extracts peak positions from the newly collected data and uses this information in updating the analysis resonance assignments and secondary structure. The goal-directed objective function then defines the next data collection step. The procedure continues until the collected data support comprehensive peak identification, resonance assignments at the desired level of completeness, and protein secondary structure. We present test cases in which ADAPT-NMR achieved results in two days or less that would have taken two months or more by manual approaches.

  12. Robust, integrated computational control of NMR experiments to achieve optimal assignment by ADAPT-NMR.

    Directory of Open Access Journals (Sweden)

    Arash Bahrami

    Full Text Available ADAPT-NMR (Assignment-directed Data collection Algorithm utilizing a Probabilistic Toolkit in NMR represents a groundbreaking prototype for automated protein structure determination by nuclear magnetic resonance (NMR spectroscopy. With a [(13C,(15N]-labeled protein sample loaded into the NMR spectrometer, ADAPT-NMR delivers complete backbone resonance assignments and secondary structure in an optimal fashion without human intervention. ADAPT-NMR achieves this by implementing a strategy in which the goal of optimal assignment in each step determines the subsequent step by analyzing the current sum of available data. ADAPT-NMR is the first iterative and fully automated approach designed specifically for the optimal assignment of proteins with fast data collection as a byproduct of this goal. ADAPT-NMR evaluates the current spectral information, and uses a goal-directed objective function to select the optimal next data collection step(s and then directs the NMR spectrometer to collect the selected data set. ADAPT-NMR extracts peak positions from the newly collected data and uses this information in updating the analysis resonance assignments and secondary structure. The goal-directed objective function then defines the next data collection step. The procedure continues until the collected data support comprehensive peak identification, resonance assignments at the desired level of completeness, and protein secondary structure. We present test cases in which ADAPT-NMR achieved results in two days or less that would have taken two months or more by manual approaches.

  13. Assigning cause for sudden unexpected infant death.

    Science.gov (United States)

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

    2015-06-01

    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.

  14. Pole assignment in descriptor periodic systems

    Institute of Scientific and Technical Information of China (English)

    FAN; Hung-Yuan; LIN; Wen-Wei; XU; Shufang

    2005-01-01

    In this paper a pole assignment problem is considered for the descriptor linear discrete-time periodic systems, which is using the periodic proportional-derivative feedback to modify a given system such that the closed loop system has a specified selfconjugate set of eigenvalues. It is shown that the complete reachability of an open loop periodic system is equivalent to the possibility of assigning an arbitrary set of the eigenvalues to the system by choosing the suitable periodic proportional-derivative feedback.A computational approach is also proposed to solve the problem, which uses the reliable numerical techniques based on the orthogonal transformations. Numerical examples are presented to illustrate the effectiveness of the proposed approach.

  15. 几种基于匈牙利算法求解二次分配问题的方法及其分析比较%Empirical Comparative Analysis of the Solution Methods for the Quadratic Assignment Problem Based on the Hungarian Algorithm

    Institute of Scientific and Technical Information of China (English)

    张惠珍; 马良

    2010-01-01

    二次分配问题(Quadratic assignment problem,QAP)属于NP-hard组合优化难题.二次分配问题的线性化模型和下界计算方法,是求解二次分配问题的重要途径.本文以二次分配问题的线性化模型为基础,根据现有QAP对偶上升下界计算方法中的具体操作,提出几种可行的QAP对偶上升计算新方法.最后,通过求解QAPLIB中的部分实例,深入分析其运行结果,详细讨论了基于匈牙利算法求解二次分配问题的对偶方法中哪些操作可较大程度地提高目标函数最优解的下界增长速度,这为基于匈牙利算法求解二次分配问题的方法的改进奠定了基础.

  16. Assignation of limited resources in pediatrics

    Directory of Open Access Journals (Sweden)

    Garduño Espinosa Armando

    2014-07-01

    Full Text Available Limited resources assignation is fundamental in the development of health services and since they will never be enough, justice is- sues arise. Many distributive justice theories are discussed: liberal, equilable and utilitarian, as well as ethic principles and cost-benefit relation, that is, the consequences. Palliative medicine is suggested as a strategy to reduce the cost of hospitable care and to enhance its designation.

  17. Capacity constrained assignment in spatial databases

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  18. Online Ad Assignment with an Ad Exchange

    OpenAIRE

    Dvořák, Wolfgang; Henzinger, Monika

    2016-01-01

    Ad exchanges are becoming an increasingly popular way to sell advertisement slots on the internet. An ad exchange is basically a spot market for ad impressions. A publisher who has already signed contracts reserving advertisement impressions on his pages can choose between assigning a new ad impression for a new page view to a contracted advertiser or to sell it at an ad exchange. This leads to an online revenue maximization problem for the publisher. Given a new impression to sell decide whe...

  19. Protein secondary structure: category assignment and predictability

    DEFF Research Database (Denmark)

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

    2001-01-01

    In the last decade, the prediction of protein secondary structure has been optimized using essentially one and the same assignment scheme known as DSSP. We present here a different scheme, which is more predictable. This scheme predicts directly the hydrogen bonds, which stabilize the secondary......-forward neural network with one hidden layer on a data set identical to the one used in earlier work....

  20. Elementary Components of the Quadratic Assignment Problem

    CERN Document Server

    Chicano, Francisco; Alba, Enrique

    2011-01-01

    The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP can be written as the sum of three elementary landscapes when the swap neighborhood is used. We present a closed formula for each of the three elementary components and we compute bounds for the autocorrelation coefficient.

  1. An Optimal Online Algorithm for Halfplane Intersection

    Institute of Scientific and Technical Information of China (English)

    WU Jigang; JI Yongchang; CHEN Guoliang

    2000-01-01

    The intersection of N halfplanes is a basic problem in computational geometry and computer graphics. The optimal offiine algorithm for this problem runs in time O(N log N). In this paper, an optimal online algorithm which runs also in time O(N log N) for this problem is presented. The main idea of the algorithm is to give a new definition for the left side of a given line, to assign the order for the points of a convex polygon, and then to use binary search method in an ordered vertex set. The data structure used in the algorithm is no more complex than array.

  2. Students' Achievement and Homework Assignment Strategies

    Science.gov (United States)

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

    2017-01-01

    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.

  3. Accurate taxonomic assignment of short pyrosequencing reads.

    Science.gov (United States)

    Clemente, José C; Jansson, Jesper; Valiente, Gabriel

    2010-01-01

    Ambiguities in the taxonomy dependent assignment of pyrosequencing reads are usually resolved by mapping each read to the lowest common ancestor in a reference taxonomy of all those sequences that match the read. This conservative approach has the drawback of mapping a read to a possibly large clade that may also contain many sequences not matching the read. A more accurate taxonomic assignment of short reads can be made by mapping each read to the node in the reference taxonomy that provides the best precision and recall. We show that given a suffix array for the sequences in the reference taxonomy, a short read can be mapped to the node of the reference taxonomy with the best combined value of precision and recall in time linear in the size of the taxonomy subtree rooted at the lowest common ancestor of the matching sequences. An accurate taxonomic assignment of short reads can thus be made with about the same efficiency as when mapping each read to the lowest common ancestor of all matching sequences in a reference taxonomy. We demonstrate the effectiveness of our approach on several metagenomic datasets of marine and gut microbiota.

  4. Algorithms Could Automate Cancer Diagnosis

    Science.gov (United States)

    Baky, A. A.; Winkler, D. G.

    1982-01-01

    Five new algorithms are a complete statistical procedure for quantifying cell abnormalities from digitized images. Procedure could be basis for automated detection and diagnosis of cancer. Objective of procedure is to assign each cell an atypia status index (ASI), which quantifies level of abnormality. It is possible that ASI values will be accurate and economical enough to allow diagnoses to be made quickly and accurately by computer processing of laboratory specimens extracted from patients.

  5. 38 CFR 19.3 - Assignment of proceedings.

    Science.gov (United States)

    2010-07-01

    ... 38 Pensions, Bonuses, and Veterans' Relief 2 2010-07-01 2010-07-01 false Assignment of proceedings... Assignment of proceedings. (a) Assignment. The Chairman may assign a proceeding instituted before the Board, including any motion, to an individual Member or to a panel of three or more Members for adjudication...

  6. Genetic Algorithms Principles Towards Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Nabil M. Hewahi

    2011-10-01

    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.

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

  8. A New Page Ranking Algorithm Based On WPRVOL Algorithm

    Directory of Open Access Journals (Sweden)

    Roja Javadian Kootenae

    2013-03-01

    Full Text Available The amount of information on the web is always growing, thus powerful search tools are needed to search for such a large collection. Search engines in this direction help users so they can find their desirable information among the massive volume of information in an easier way. But what is important in the search engines and causes a distinction between them is page ranking algorithm used in them. In this paper a new page ranking algorithm based on "Weighted Page Ranking based on Visits of Links (WPRVOL Algorithm" for search engines is being proposed which is called WPR'VOL for short. The proposed algorithm considers the number of visits of first and second level in-links. The original WPRVOL algorithm takes into account the number of visits of first level in-links of the pages and distributes rank scores based on the popularity of the pages whereas the proposed algorithm considers both in-links of that page (first level in-links and in-links of the pages that point to it (second level in-links in order to calculation of rank of the page, hence more related pages are displayed at the top of search result list. In the summary it is said that the proposed algorithm assigns higher rank to pages that both themselves and pages that point to them be important.

  9. QoS Aware Wavelength Assignment in Wavelength Division Multiplexing Based Optical Networks

    Directory of Open Access Journals (Sweden)

    U. Mahmud

    2015-01-01

    Full Text Available Wavelength Division Multiplexing (WDM is used in optical networks to implement data circuits. These circuits allow exchange of information as a measure of wavelength in optical domain. Quality of Service (QoS provisioning is one of the issues in WDM optical networks. This paper discusses different QoS aware Routing and Wavelength Assignment (RWA algorithms. Some unaddressed issues are identified that include the effects of degraded performance, traffic patterns and type of QoS service for users. A software module is proposed that calculates a ‘D’ factor facilitating in the wavelength assignment for QoS provisioning. This module is designed to work in conjunction with existing RWA algorithms.

  10. Replicating and Extending Research on the Partial Assignment Completion Effect: Is Sunk Cost Related to Partial Assignment Completion Strength?

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Taylor, Emily P.; Skinner, Christopher H.; Parkhurst, John; Nalls, Meagan L.

    2014-01-01

    After students acquire a skill, mastery often requires them to choose to engage in assigned academic activities (e.g., independent seatwork, and homework). Although students may be more likely to choose to work on partially completed assignments than on new assignments, the partial assignment completion (PAC) effect may not be very powerful. The…

  11. A linear-time algorithm for Euclidean feature transform sets

    NARCIS (Netherlands)

    Hesselink, Wim H.

    2007-01-01

    The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the

  12. Numerical pole assignment by eigenvalue Jacobian inversion

    Science.gov (United States)

    Sevaston, George E.

    1986-01-01

    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.

  13. Strategy-Proof Assignment Of Multiple Resources

    DEFF Research Database (Denmark)

    Erlanson, Albin; Szwagrzak, Karol

    2015-01-01

    We examine the strategy-proof allocation of multiple resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. In the domain of multidimensional single-peaked preferences, we find that any allocation mechanism obtained...... by maximizing a separably concave function over a polyhedral extension of the set of Pareto-efficient allocations is strategy-proof. Moreover, these are the only strategy-proof, unanimous, consistent, and resource-monotonic mechanisms. These mechanisms generalize the parametric rationing mechanisms (Young, 1987...

  14. Assignments, Details, and Transfers: Overseas Service

    Science.gov (United States)

    2001-08-30

    exception, soldiers stationed on Johnston Atoll , Enewetak Atoll , or Sinai, Egypt, will not be involuntarily extended. Soldiers assigned to these loca...OF THE PACIFIC IS- LANDS Micronesia (as indicated), Northern Marianas as indicated), Saipan 24 12 Marshall Islands (as indicated) Enewetak Atoll NA 12...5 and note 5 Johnston Atoll , Enewetak Atoll , Sinai, Egypt, note 6, table 6–1 Reasons for, table 6–1 180 day rule, 6–1c 30 day rule, 6–1b 60 day rule

  15. Constrained neural approaches to quadratic assignment problems.

    Science.gov (United States)

    Ishii, S; Sato, M

    1998-08-01

    In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.

  16. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment

    Science.gov (United States)

    Alonso-Mora, Javier; Samaranayake, Samitha; Wallar, Alex; Frazzoli, Emilio; Rus, Daniela

    2017-01-01

    Ride-sharing services are transforming urban mobility by providing timely and convenient transportation to anybody, anywhere, and anytime. These services present enormous potential for positive societal impacts with respect to pollution, energy consumption, congestion, etc. Current mathematical models, however, do not fully address the potential of ride-sharing. Recently, a large-scale study highlighted some of the benefits of car pooling but was limited to static routes with two riders per vehicle (optimally) or three (with heuristics). We present a more general mathematical model for real-time high-capacity ride-sharing that (i) scales to large numbers of passengers and trips and (ii) dynamically generates optimal routes with respect to online demand and vehicle locations. The algorithm starts from a greedy assignment and improves it through a constrained optimization, quickly returning solutions of good quality and converging to the optimal assignment over time. We quantify experimentally the tradeoff between fleet size, capacity, waiting time, travel delay, and operational costs for low- to medium-capacity vehicles, such as taxis and van shuttles. The algorithm is validated with ∼3 million rides extracted from the New York City taxicab public dataset. Our experimental study considers ride-sharing with rider capacity of up to 10 simultaneous passengers per vehicle. The algorithm applies to fleets of autonomous vehicles and also incorporates rebalancing of idling vehicles to areas of high demand. This framework is general and can be used for many real-time multivehicle, multitask assignment problems. PMID:28049820

  17. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.

    Science.gov (United States)

    Alonso-Mora, Javier; Samaranayake, Samitha; Wallar, Alex; Frazzoli, Emilio; Rus, Daniela

    2017-01-17

    Ride-sharing services are transforming urban mobility by providing timely and convenient transportation to anybody, anywhere, and anytime. These services present enormous potential for positive societal impacts with respect to pollution, energy consumption, congestion, etc. Current mathematical models, however, do not fully address the potential of ride-sharing. Recently, a large-scale study highlighted some of the benefits of car pooling but was limited to static routes with two riders per vehicle (optimally) or three (with heuristics). We present a more general mathematical model for real-time high-capacity ride-sharing that (i) scales to large numbers of passengers and trips and (ii) dynamically generates optimal routes with respect to online demand and vehicle locations. The algorithm starts from a greedy assignment and improves it through a constrained optimization, quickly returning solutions of good quality and converging to the optimal assignment over time. We quantify experimentally the tradeoff between fleet size, capacity, waiting time, travel delay, and operational costs for low- to medium-capacity vehicles, such as taxis and van shuttles. The algorithm is validated with ∼3 million rides extracted from the New York City taxicab public dataset. Our experimental study considers ride-sharing with rider capacity of up to 10 simultaneous passengers per vehicle. The algorithm applies to fleets of autonomous vehicles and also incorporates rebalancing of idling vehicles to areas of high demand. This framework is general and can be used for many real-time multivehicle, multitask assignment problems.

  18. Equitable traffic assignment with environmental cost functions

    Energy Technology Data Exchange (ETDEWEB)

    Benedek, C.M. [Univ. of Alberta, Edmonton, Alberta (Canada). Dept. of Civil and Environmental Engineering; Rilett, L.R. [Texas A and M Univ., College Station, TX (United States). Dept. of Civil Engineering

    1998-01-01

    In the past 10 years increased importance has been placed on public participation and environmental concerns in transportation system decision-making. While there are numerous societal objectives to consider when planning and operating a transportation system, it is not clear whether the optimal strategy with respect to one objective is also the optimal strategy with respect to the other objectives. This paper examines how new objectives and environmental considerations can be modeled within the traditional, macroscopic traffic assignment methodology. In addition, a new methodology for modeling the assignment of vehicles in realistic networks is developed based on equitable, rather than user-equilibrium or system-optimal, principles. The basic premise is that with the advent of intelligent transportation systems (ITS) the operation of the transportation system based on the objectives of the general public, rather than the traveling public and system operators, is feasible. A methodology for modeling these situations is required. All of the approaches discussed here were tested on a calibrated network from Edmonton, Alberta, Canada.

  19. Dynamic assignment: there is an equilibrium !

    CERN Document Server

    Meunier, Frédéric

    2008-01-01

    Given a network with a continuum of users at some origins, suppose that the users wish to reach specific destinations, but that they are not indifferent to the time needed to reach their destination. They may have several possibilities (of routes or deparure time), but their choices modify the travel times on the network. Hence, each user faces the following problem: given a pattern of travel times for the different possible routes that reach the destination, find a shortest path. The situation in a context of perfect information is a so-called Nash equilibrium, and the question whether there is such an equilibrium and of finding it if it exists is the so-called equilibrium assignment problem. It arises for various kind of networks, such as computers, communication or transportation network. When each user occupies permanently the whole route from the origin to its destination, we call it the static assignment problem, which has been extensively studied with pioneers works by Wardrop or Beckmann. A less studi...

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

    Directory of Open Access Journals (Sweden)

    Xiangmin Guan

    2015-01-01

    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.

  1. Algorithms for worst-case tolerance optimization

    DEFF Research Database (Denmark)

    Schjær-Jacobsen, Hans; Madsen, Kaj

    1979-01-01

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

  2. An ambiguity principle for assigning protein structural domains.

    Science.gov (United States)

    Postic, Guillaume; Ghouzam, Yassine; Chebrek, Romain; Gelly, Jean-Christophe

    2017-01-01

    Ambiguity is the quality of being open to several interpretations. For an image, it arises when the contained elements can be delimited in two or more distinct ways, which may cause confusion. We postulate that it also applies to the analysis of protein three-dimensional structure, which consists in dividing the molecule into subunits called domains. Because different definitions of what constitutes a domain can be used to partition a given structure, the same protein may have different but equally valid domain annotations. However, knowledge and experience generally displace our ability to accept more than one way to decompose the structure of an object-in this case, a protein. This human bias in structure analysis is particularly harmful because it leads to ignoring potential avenues of research. We present an automated method capable of producing multiple alternative decompositions of protein structure (web server and source code available at www.dsimb.inserm.fr/sword/). Our innovative algorithm assigns structural domains through the hierarchical merging of protein units, which are evolutionarily preserved substructures that describe protein architecture at an intermediate level, between domain and secondary structure. To validate the use of these protein units for decomposing protein structures into domains, we set up an extensive benchmark made of expert annotations of structural domains and including state-of-the-art domain parsing algorithms. The relevance of our "multipartitioning" approach is shown through numerous examples of applications covering protein function, evolution, folding, and structure prediction. Finally, we introduce a measure for the structural ambiguity of protein molecules.

  3. An ambiguity principle for assigning protein structural domains

    Science.gov (United States)

    Postic, Guillaume; Ghouzam, Yassine; Chebrek, Romain; Gelly, Jean-Christophe

    2017-01-01

    Ambiguity is the quality of being open to several interpretations. For an image, it arises when the contained elements can be delimited in two or more distinct ways, which may cause confusion. We postulate that it also applies to the analysis of protein three-dimensional structure, which consists in dividing the molecule into subunits called domains. Because different definitions of what constitutes a domain can be used to partition a given structure, the same protein may have different but equally valid domain annotations. However, knowledge and experience generally displace our ability to accept more than one way to decompose the structure of an object—in this case, a protein. This human bias in structure analysis is particularly harmful because it leads to ignoring potential avenues of research. We present an automated method capable of producing multiple alternative decompositions of protein structure (web server and source code available at www.dsimb.inserm.fr/sword/). Our innovative algorithm assigns structural domains through the hierarchical merging of protein units, which are evolutionarily preserved substructures that describe protein architecture at an intermediate level, between domain and secondary structure. To validate the use of these protein units for decomposing protein structures into domains, we set up an extensive benchmark made of expert annotations of structural domains and including state-of-the-art domain parsing algorithms. The relevance of our “multipartitioning” approach is shown through numerous examples of applications covering protein function, evolution, folding, and structure prediction. Finally, we introduce a measure for the structural ambiguity of protein molecules. PMID:28097215

  4. Algorithms and theoretical topics on selected combinatorial optimization problems

    OpenAIRE

    Kaveh, Arman

    2010-01-01

    We study the Quadratic Assignment Problem (QAP), Three Dimensional Assignment Problem (3AP) and Quadratic Three Dimensional Assignment Problem (Q3AP), which combines aspects of both QAP and 3AP. The three problems are known to be NP-hard. We propose new algorithms for obtaining near optimal solutions of QAP and 3AP and present computational results. Our algorithms obtain improved solutions in some benchmark instances of QAP and 3AP. We also discuss theoretical results on 3AP and Q3AP such as ...

  5. Using rule-based shot dose assignment in model-based MPC applications

    Science.gov (United States)

    Bork, Ingo; Buck, Peter; Wang, Lin; Müller, Uwe

    2014-10-01

    Shrinking feature sizes and the need for tighter CD (Critical Dimension) control require the introduction of new technologies in mask making processes. One of those methods is the dose assignment of individual shots on VSB (Variable Shaped Beam) mask writers to compensate CD non-linearity effects and improve dose edge slope. Using increased dose levels only for most critical features, generally only for the smallest CDs on a mask, the change in mask write time is minimal while the increase in image quality can be significant. This paper describes a method combining rule-based shot dose assignment with model-based shot size correction. This combination proves to be very efficient in correcting mask linearity errors while also improving dose edge slope of small features. Shot dose assignment is based on tables assigning certain dose levels to a range of feature sizes. The dose to feature size assignment is derived from mask measurements in such a way that shape corrections are kept to a minimum. For example, if a 50nm drawn line on mask results in a 45nm chrome line using nominal dose, a dose level is chosen which is closest to getting the line back on target. Since CD non-linearity is different for lines, line-ends and contacts, different tables are generated for the different shape categories. The actual dose assignment is done via DRC rules in a pre-processing step before executing the shape correction in the MPC engine. Dose assignment to line ends can be restricted to critical line/space dimensions since it might not be required for all line ends. In addition, adding dose assignment to a wide range of line ends might increase shot count which is undesirable. The dose assignment algorithm is very flexible and can be adjusted based on the type of layer and the best balance between accuracy and shot count. These methods can be optimized for the number of dose levels available for specific mask writers. The MPC engine now needs to be able to handle different dose

  6. INDEXING WORKSHOP: HOW TO ASSIGN KEYWORDS

    Energy Technology Data Exchange (ETDEWEB)

    Sternberg, Virginia

    1979-09-01

    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

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

    Science.gov (United States)

    Xia, Yan; Zeng, Yingzhi

    2016-02-01

    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.

    2001-01-01

    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 stor

  9. 7 CFR 1404.3 - Payments which may be assigned.

    Science.gov (United States)

    2010-01-01

    ... OF AGRICULTURE GENERAL REGULATIONS AND POLICIES ASSIGNMENT OF PAYMENTS § 1404.3 Payments which may be assigned. Except as otherwise provided in this part or in individual program regulations, contracts...

  10. Assignment Choice: Do Students Choose Briefer Assignments or Finishing What They Started?

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; O'Neil, Michael; Conley, Elisha

    2010-01-01

    Academic skill development requires engagement in effortful academic behaviors. Although students may be more likely to choose to engage in behaviors that require less effort, they also may be motivated to complete assignments that they have already begun. Seventh-grade students (N = 88) began a mathematics computation worksheet, but were stopped…

  11. Methods of using the quadratic assignment problem solution

    Directory of Open Access Journals (Sweden)

    Izabela Kudelska

    2012-09-01

    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.

  12. Algorithmic Self

    DEFF Research Database (Denmark)

    Markham, Annette

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

  13. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    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

  14. 75 FR 55354 - Delegation of Authority and Assignment of Responsibilities

    Science.gov (United States)

    2010-09-10

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

  15. Assignment Procedures in the Air Force Procurement Management Information System.

    Science.gov (United States)

    Ward, Joe H., Jr.; And Others

    An overview is presented of the procedure for offering jobs in the Air Force Procurement Management Information System (PROMIS), an assignment system which makes possible the use of human resources research findings to improve individual personnel assignments. A general framework for viewing personnel assignment systems is presented; then job…

  16. Solving the k-cardinality assignment problem by transformation

    NARCIS (Netherlands)

    Volgenant, A.

    2004-01-01

    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 polyno

  17. 7 CFR 762.160 - Assignment of guarantee.

    Science.gov (United States)

    2010-01-01

    ... of the loan. The holder must assign the guaranteed portion back to the original lender if requested... AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.160 Assignment of guarantee. (a) The following general requirements apply to assigning guaranteed loans: (1) Subject to Agency concurrence, the...

  18. 46 CFR 387.5 - Surplus property assignment recommendation.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 8 2010-10-01 2010-10-01 false Surplus property assignment recommendation. 387.5 Section 387.5 Shipping MARITIME ADMINISTRATION, DEPARTMENT OF TRANSPORTATION MISCELLANEOUS UTILIZATION AND... property assignment recommendation. Before any assignment recommendation is submitted to the...

  19. Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments

    Science.gov (United States)

    Cavdar, Gamze; Doe, Sue

    2012-01-01

    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…

  20. Assessment of a Diversity Assignment in a PR Principles Course

    Science.gov (United States)

    Gallicano, Tiffany Derville; Stansberry, Kathleen

    2012-01-01

    This study assesses an assignment for incorporating diversity into the principles of public relations course. The assignment is tailored to the challenges of using an active learning approach in a large lecture class. For the assignment, students write a goal, objectives, strategies, an identification of tactics, and evaluation plans for either…

  1. 28 CFR 524.72 - CIM assignment categories.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false CIM assignment categories. 524.72 Section..., CLASSIFICATION, AND TRANSFER CLASSIFICATION OF INMATES Central Inmate Monitoring (CIM) System § 524.72 CIM assignment categories. CIM cases are classified according to the following assignments: (a) Witness...

  2. Survey of the research on dynamic weapon-target assignment problem

    Institute of Scientific and Technical Information of China (English)

    Cai Huaiping; Liu Jingxu; Chen Yingwu; Wang Hao

    2006-01-01

    The basic concepts and models of weapon-target assignment (WTA) are introduced and the mathematical nature of the WTA models is also analyzed. A systematic survey of research on WTA problem is provided. The present research on WTA is focused on models and algorithms. In the research on models of WTA, the static WTA models are mainly studied and the dynamic WTA models are not fully studied in deed. In the research on algorithms of WTA, the intelligent algorithms are often used to solve the WTA problem. The small scale of static WTA problems has been solved very well, however, the large scale of dynamic WTA problems has not been solved effectively so far. Finally, the characteristics of dynamic WTA are analyzed and directions for the future research on dynamic WTA are discussed.

  3. Algorithm 865

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  4. Autodriver algorithm

    Directory of Open Access Journals (Sweden)

    Anna Bourmistrova

    2011-02-01

    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.

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

    KAUST Repository

    Jang, Richard

    2011-03-01

    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.

  6. APPLYING REINFORCEMENT LEARNING TO THE WEAPON ASSIGNMENT PROBLEM IN AIR DEFENCE

    Directory of Open Access Journals (Sweden)

    Herman Le Roux

    2011-11-01

    Full Text Available The modern battlefield is a fast-paced, information-rich environment, where discovery of intent, situation awareness and the rapid evolution of concepts of operation and doctrine are critical success factors. A combination of the techniques investigated and tested in this work, together with other techniques in Artificial Intelligence (AI and modern computational techniques, may hold the key to relieving the burden of the decision-maker and aiding in better decision-making under pressure. The techniques investigated in this article were two methods from the machine-learning subfield of reinforcement learning (RL, namely a Monte Carlo (MC control algorithm with exploring starts (MCES, and an off-policy temporal-difference (TD learning-control algorithm, Q-learning. These techniques were applied to a simplified version of the weapon assignment (WA problem in air defence. The MCES control algorithm yielded promising results when searching for an optimal shooting order. A greedy approach was taken in the Q-learning algorithm, but experimentation showed that the MCES-control algorithm still performed significantly better than the Q-learning algorithm, even though it was slower.

  7. Routing and spectrum assignment based on ant colony optimization of minimum consecutiveness loss in elastic optical networks

    Science.gov (United States)

    Wang, Fu; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Tian, Qinghua; Zhang, Qi; Rao, Lan; Tian, Feng; Luo, Biao; Liu, Yingjun; Tang, Bao

    2016-10-01

    Elastic Optical Networks are considered to be a promising technology for future high-speed network. In this paper, we propose a RSA algorithm based on the ant colony optimization of minimum consecutiveness loss (ACO-MCL). Based on the effect of the spectrum consecutiveness loss on the pheromone in the ant colony optimization, the path and spectrum of the minimal impact on the network are selected for the service request. When an ant arrives at the destination node from the source node along a path, we assume that this path is selected for the request. We calculate the consecutiveness loss of candidate-neighbor link pairs along this path after the routing and spectrum assignment. Then, the networks update the pheromone according to the value of the consecutiveness loss. We save the path with the smallest value. After multiple iterations of the ant colony optimization, the final selection of the path is assigned for the request. The algorithms are simulated in different networks. The results show that ACO-MCL algorithm performs better in blocking probability and spectrum efficiency than other algorithms. Moreover, the ACO-MCL algorithm can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness. Compared with other algorithms, the ACO-MCL algorithm can reduce the blocking rate by at least 5.9% in heavy load.

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

    2010-10-07

    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.

  9. 31 CFR 306.56 - Assignment of securities registered in the names of or assigned to two or more persons.

    Science.gov (United States)

    2010-07-01

    ... PUBLIC DEBT GENERAL REGULATIONS GOVERNING U.S. SECURITIES Assignments by or in Behalf of Individuals... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Assignment of securities registered in the names of or assigned to two or more persons. 306.56 Section 306.56 Money and Finance:...

  10. Algorithms for intravenous insulin delivery.

    Science.gov (United States)

    Braithwaite, Susan S; Clement, Stephen

    2008-08-01

    This review aims to classify algorithms for intravenous insulin infusion according to design. Essential input data include the current blood glucose (BG(current)), the previous blood glucose (BG(previous)), the test time of BG(current) (test time(current)), the test time of BG(previous) (test time(previous)), and the previous insulin infusion rate (IR(previous)). Output data consist of the next insulin infusion rate (IR(next)) and next test time. The classification differentiates between "IR" and "MR" algorithm types, both defined as a rule for assigning an insulin infusion rate (IR), having a glycemic target. Both types are capable of assigning the IR for the next iteration of the algorithm (IR(next)) as an increasing function of BG(current), IR(previous), and rate-of-change of BG with respect to time, each treated as an independent variable. Algorithms of the IR type directly seek to define IR(next) as an incremental adjustment to IR(previous). At test time(current), under an IR algorithm the differences in values of IR(next) that might be assigned depending upon the value of BG(current) are not necessarily continuously dependent upon, proportionate to, or commensurate with either the IR(previous) or the rate-of-change of BG. Algorithms of the MR type create a family of IR functions of BG differing according to maintenance rate (MR), each being an iso-MR curve. The change of IR(next) with respect to BG(current) is a strictly increasing function of MR. At test time(current), algorithms of the MR type use IR(previous) and the rate-of-change of BG to define the MR, multiplier, or column assignment, which will be used for patient assignment to the right iso-MR curve and as precedent for IR(next). Bolus insulin therapy is especially effective when used in proportion to carbohydrate load to cover anticipated incremental transitory enteral or parenteral carbohydrate exposure. Specific distinguishing algorithm design features and choice of parameters may be important to

  11. Traffic-Aware Channel Assignment in Wireless Sensor Networks

    Science.gov (United States)

    Wu, Yafeng; Keally, Matthew; Zhou, Gang; Mao, Weizhen

    Existing frequency assignment efforts in wireless sensor network research focus on balancing available physical frequencies among neighboring nodes, without paying attention to the fact that different nodes have different traffic volumes. Ignoring the different traffic requirements in different nodes in frequency assignment design leads to poor MAC performance. Therefore, in this paper, we are motivated to propose traffic-aware frequency assignment, which considers nodes’ traffic volumes when making frequency decisions. We incorporate our traffic-aware frequency assignment design into an existing multi-channel MAC, and compare the performance with two conventional frequency assignment schemes. Our performance evaluation demonstrates that traffic-aware channel assignment can greatly improve multi-channel MAC performance. Our traffic-aware assignment scheme greatly enhances the packet delivery ratio and system throughput, while reducing channel access delay and energy consumption.

  12. Regulatory focus and the assignment of punishment

    Directory of Open Access Journals (Sweden)

    Chloe Carmichael

    2007-06-01

    Full Text Available Regulatory Focus has been demonstrated to influence human behavior in a number of domains, such as object valuation and readiness to commit time or money to social projects. It has also been demonstrated to influence an individual’s approach to mistakes; and a person’s preference for global or local processing of information. The present work seeks to consider how regulatory focus might interact with punitive behaviors, specifically, the assignment of legal punishment. In this study, 240 undergraduates completed a series of written instruments that assessed their regulatory focus. They read a vignette that described a target that commits a crime, is detected by the police, and is arrested due to a careless mistake. Participants were asked what level of legal punishment they deemed appropriate. Participants’ punitive evaluations show that there are significant interactions a between the regulatory focus of the participant and the regulatory focus of the target and b between the regulatory focus of the participant and the level of detail used to describe the target and her behavior. In each case, when the regulatory foci matched, causing ‘fit,’ the participant was more lenient than in the non-fit condition.

  13. Reference databases for taxonomic assignment in metagenomics.

    Science.gov (United States)

    Santamaria, Monica; Fosso, Bruno; Consiglio, Arianna; De Caro, Giorgio; Grillo, Giorgio; Licciulli, Flavio; Liuni, Sabino; Marzano, Marinella; Alonso-Alemany, Daniel; Valiente, Gabriel; Pesole, Graziano

    2012-11-01

    Metagenomics is providing an unprecedented access to the environmental microbial diversity. The amplicon-based metagenomics approach involves the PCR-targeted sequencing of a genetic locus fitting different features. Namely, it must be ubiquitous in the taxonomic range of interest, variable enough to discriminate between different species but flanked by highly conserved sequences, and of suitable size to be sequenced through next-generation platforms. The internal transcribed spacers 1 and 2 (ITS1 and ITS2) of the ribosomal DNA operon and one or more hyper-variable regions of 16S ribosomal RNA gene are typically used to identify fungal and bacterial species, respectively. In this context, reliable reference databases and taxonomies are crucial to assign amplicon sequence reads to the correct phylogenetic ranks. Several resources provide consistent phylogenetic classification of publicly available 16S ribosomal DNA sequences, whereas the state of ribosomal internal transcribed spacers reference databases is notably less advanced. In this review, we aim to give an overview of existing reference resources for both types of markers, highlighting strengths and possible shortcomings of their use for metagenomics purposes. Moreover, we present a new database, ITSoneDB, of well annotated and phylogenetically classified ITS1 sequences to be used as a reference collection in metagenomic studies of environmental fungal communities. ITSoneDB is available for download and browsing at http://itsonedb.ba.itb.cnr.it/.

  14. A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

    OpenAIRE

    Mehdi Alinaghian; Zahra Kaviani; Siyavash Khaledan

    2015-01-01

    A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (GCW) for Vehicle Routing Problem regarding to fuel consumption is presented. The objective function ...

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

    KAUST Repository

    Abbas, Ahmed

    2014-04-19

    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 http://sfb.kaust.edu.sa/Pages/Software.aspx. © 2014 Springer Science+Business Media.

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

    Directory of Open Access Journals (Sweden)

    Francisco Javier González-Castano

    2013-08-01

    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.

  17. A tabu search approach for the NMR protein structure-based assignment problem.

    Science.gov (United States)

    Cavuşlar, Gizem; Çatay, Bülent; Apaydın, Mehmet Serkan

    2012-01-01

    Spectroscopy is an experimental technique which exploits the magnetic properties of specific nuclei and enables the study of proteins in solution. The key bottleneck of NMR studies is to map the NMR peaks to corresponding nuclei, also known as the assignment problem. Structure-Based Assignment (SBA) is an approach to solve this computationally challenging problem by using prior information about the protein obtained from a homologous structure. NVR-BIP used the Nuclear Vector Replacement (NVR) framework to model SBA as a binary integer programming problem. In this paper, we prove that this problem is NP-hard and propose a tabu search (TS) algorithm (NVR-TS) equipped with a guided perturbation mechanism to efficiently solve it. NVR-TS uses a quadratic penalty relaxation of NVR-BIP where the violations in the Nuclear Overhauser Effect constraints are penalized in the objective function. Experimental results indicate that our algorithm finds the optimal solution on NVRBIP’s data set which consists of seven proteins with 25 templates (31 to 126 residues). Furthermore, it achieves relatively high assignment accuracies on two additional large proteins, MBP and EIN (348 and 243 residues, respectively), which NVR-BIP failed to solve. The executable and the input files are available for download at http://people.sabanciuniv.edu/catay/NVR-TS/NVR-TS.html.

  18. Assigning categorical information to Japanese medical terms using MeSH and MEDLINE.

    Science.gov (United States)

    Onogi, Yuzo

    2007-01-01

    This paper reports on the assigning of MeSH (Medical Subject Headings) categories to Japanese terms in an English-Japanese dictionary using the titles and abstracts of articles indexed in MEDLINE. In a previous study, 30,000 of 80,000 terms in the dictionary were mapped to MeSH terms by normalized comparison. It was reasoned that if the remaining dictionary terms appeared in MEDLINE-indexed articles that are indexed using MeSH terms, then relevancies between the dictionary terms and MeSH terms could be calculated, and thus MeSH categories assigned. This study compares two approaches for calculating the weight matrix. One is the TF*IDF method and the other uses the inner product of two weight matrices. About 20,000 additional dictionary terms were identified in MEDLINE-indexed articles published between 2000 and 2004. The precision and recall of these algorithms were evaluated separately for MeSH terms and non-MeSH terms. Unfortunately, the precision and recall of the algorithms was not good, but this method will help with manual assignment of MeSH categories to dictionary terms.

  19. A New RWA Algorithm Based on Multi-Objective

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    In this article, we studied the associated research problems and challenges on routing and wavelength assignment (RWA) in WDM (wavelength division multiplexing) networks. Various RWA approaches are examined and compared. We proposed a new RWA algorithm based on multi-objective. In this new algorithm, we consider multiple network optimizing objectives to setup a lightpath with maximize profit and shortest path under the limited resources. By comparing and analyzing, the proposed algorithm is much better ...

  20. Hearing the clusters in a graph: A distributed algorithm

    CERN Document Server

    Sahai, Tuhin; Banaszuk, Andrzej

    2009-01-01

    We propose a novel distributed algorithm to decompose graphs or cluster data. The algorithm recovers the solution obtained from spectral clustering without need for expensive eigenvalue/ eigenvector computations. We demonstrate that by solving the wave equation on the graph, every node can assign itself to a cluster by performing a local fast Fourier transform. We prove the equivalence of our algorithm to spectral clustering, derive convergence rates and demonstrate it on examples.

  1. assignFAST: An Autosuggest based tool for FAST Subject Assignment

    Directory of Open Access Journals (Sweden)

    Rick Bennett

    2014-03-01

    Full Text Available Subject assignment is really a three-phase task. The first phase is intellectual—reviewing the material and determining its topic. The second phase is more mechanical, identifying the correct subject heading(s.  The final phase is retyping or cutting and pasting the heading(s into the cataloging interface along with any diacritics, and potentially correcting formatting and subfield coding. If authority control is available in the interface, some of these tasks may be automated or partially automated. A cataloger with a reasonable knowledge of FAST[i],[ii] or even LCSH[iii] can quickly get to the proper heading, but usually needs to confirm the final details—was it plural? Am I thinking of an alternate form? Is it inverted? Etc. This often requires consulting the full authority file interface. assignFAST is a Web service that consolidates the entire second phase of the manual process of subject assignment for FAST subjects into a single step based on autosuggest technology. [i] Chan, Lois Mai and Edward T. O'Neill.  FAST: Faceted Application of Subject Terminology, Prnciples and Applications Libraries Unlimited, Santa Barbara, 2010. http://lu.com/showbook.cfm?isbn=9781591587224. [ii] OCLC Research Activities associated with FAST are summarized at  http://www.oclc.org/research/activities/fast/ [iii] Chan, Lois M. Library of Congress Subject Headings : Principles and Application: Principles and Application. Westport, Conn: Libraries Unlimited, 2005.

  2. Assigning the Vibration-Rotation Spectra Using the Lww Program Package

    Science.gov (United States)

    Lodyga, Wieslaw; Kreglewski, Marek

    2016-06-01

    The LWW program package is based on traditional methods used in assigning rotationally resolved IR molecular spectra. The Loomis-Wood diagrams, which are used to visualize spectral branches and facilitate their identification, are combined with the power of interactive lower state combination difference (LSCD) checking, which provides immediate verification of correct assignments of quantum numbers to spectral lines. The traditional Giessen/Cologne type Loomis-Wood algorithm is also implemented. Predictions of vibration-rotation wavenumbers are calculated from a table of vibration-rotation energies, which can be imported from any external fitting program. Program includes many additional tools like simulation of a spectrum from a catalog file (list of transitions with intensities), build-up of a vibration-rotation band from individual branches and simultaneous displaying of two IR spectra - active one used for assignments and a reference one, both with full link to their peak-list files. Importing energies as well as exporting assigned data for fitting in an external program is made easy and flexible by a user-programmed import/export interface, which facilitates iterative refining of energy levels and gives a possibility of using directly exact vibration-rotation energies. Program is available in tree versions: for symmetric top, asymmetric top and molecules with large amplitude motions. The program is designed for the Windows operating systems and is available with full documentation on www.lww.amu.edu.pl .

  3. Integrating computer-aided modeling and micro-simulation in multi-criteria evaluation of service infrastructure assignment approaches

    Directory of Open Access Journals (Sweden)

    Alfonso Duran

    2013-07-01

    Full Text Available Purpose: This paper proposes an integrated computer-supported multi-staged approach to the flexible design and multicriteria evaluation of service infrastructure assignment processes/ algorithms. Design/methodology/approach: It involves particularizing a metamodel encompassing the main generic components and relationships into process models and process instances, by incorporating structural data from the real-life system. Existing data on the target user population is fed into a micro-modeling system to generate a matching population of individual “virtual” users, each with its own set of trait values. The micro-simulation of their interaction with the assignment process of both the incumbent and the competitors generates a rich multi-dimensional output, encompassing both “revealed” and non-observable data. This enables a comprehensive multi-criteria evaluation of the foreseeable performance of the designed process/ algorithm, and therefore its iterative improvement. Findings: The research project developed a set of methodologies and associated supporting tools encompassing the modeling, micro-simulation and performance assessment of service infrastructure assignment processes. Originality/value: The proposed approach facilitates, in a multicriteria environment, the flexible modeling/design of situation-specific assignment processes/algorithms and their performance assessment when facing their case-specific user population.

  4. A Joint Link and Channel Assignment Routing Scheme for Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    H.S.Zhao

    2013-12-01

    Full Text Available Cognitive radio (CR is a promising technology that enables opportunistic utilization of the temporarily vacant spectrum to mitigate the spectrum scarcity in wireless communications. Since secondary users (SUs should vacate the channel in use immediately after detecting the reappearances of primary users (PUs in cognitive radio networks (CRNs, the route reliability is a distinctive challenge for routing in CRNs. Furthermore, the throughput requirement of an SU session should be satisfied and it is always preferable to select a route with less negative influence on other current or latish sessions. To account for the route reliability challenge, we study the joint link and channel assignment routing problem for CRNs. It is formulated in a form of integer nonlinear programming (INLP, which is NP-hard, with the objective of minimizing the interference of a new route to other routes while providing route reliability and throughput guarantee. An on-demand route discovery algorithm is proposed to find reliable candidate paths, while a joint link and channel assignment routing algorithm with sequentially-connected-link coordination is proposed to choose the near-optimal route for improving the route reliability and minimizing negative influence. Simulation results demonstrate that the proposed algorithm achieves considerable improvement over existing schemes in both route reliability and throughput.

  5. An analysis of spectral envelope-reduction via quadratic assignment problems

    Science.gov (United States)

    George, Alan; Pothen, Alex

    1994-01-01

    A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

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

    DEFF Research Database (Denmark)

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

    1997-01-01

    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...... intersections a separate model handles queues longer than one green-period. Green-waves can also be taken into consideration. The model has been tested on a large-scale network for Copenhagen with good results. To make it possible to establish the comprehensive data, a GIS-based 'expert system' was implemented....

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

    Directory of Open Access Journals (Sweden)

    Rong-Chang Chen

    2014-01-01

    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.

  8. A Unified Approach to Nonlinear Dynamic Inversion Control with Parameter Determination by Eigenvalue Assignment

    Directory of Open Access Journals (Sweden)

    Yu-Chi Wang

    2015-01-01

    Full Text Available This paper presents a unified approach to nonlinear dynamic inversion control algorithm with the parameters for desired dynamics determined by using an eigenvalue assignment method, which may be applied in a very straightforward and convenient way. By using this method, it is not necessary to transform the nonlinear equations into linear equations by feedback linearization before beginning control designs. The applications of this method are not limited to affine nonlinear control systems or limited to minimum phase problems if the eigenvalues of error dynamics are carefully assigned so that the desired dynamics is stable. The control design by using this method is shown to be robust to modeling uncertainties. To validate the theory, the design of a UAV control system is presented as an example. Numerical simulations show the performance of the design to be quite remarkable.

  9. Variable Neighborhood Search for the University Lecturer-Student Assignment Problem

    CERN Document Server

    Geiger, Martin Josef

    2008-01-01

    The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to scientific topics which are proposed and supported by members of staff. The problem involves the optimization under given preferences of students which may be expressed when applying for certain topics. It is possible to observe that variable neighborhood search leads to superior results for the tested problem instances. One instance is taken from an actual case, while others have been generated based on the real world data to support the analysis with a deeper analysis. An extension of the problem has been formulated by integrating a second objective function that simultaneously balances the workload of the members of staff while maximizing utility of the students. The algorithmic approach has been prototypically implemented in a computer system. One important aspect in t...

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

    Directory of Open Access Journals (Sweden)

    King-Man Ho

    2010-01-01

    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.

  11. Clonify: unseeded antibody lineage assignment from next-generation sequencing data.

    Science.gov (United States)

    Briney, Bryan; Le, Khoa; Zhu, Jiang; Burton, Dennis R

    2016-04-22

    Defining the dynamics and maturation processes of antibody clonal lineages is crucial to understanding the humoral response to infection and immunization. Although individual antibody lineages have been previously analyzed in isolation, these studies provide only a narrow view of the total antibody response. Comprehensive study of antibody lineages has been limited by the lack of an accurate clonal lineage assignment algorithm capable of operating on next-generation sequencing datasets. To address this shortcoming, we developed Clonify, which is able to perform unseeded lineage assignment on very large sets of antibody sequences. Application of Clonify to IgG+ memory repertoires from healthy individuals revealed a surprising lack of influence of large extended lineages on the overall repertoire composition, indicating that this composition is driven less by the order and frequency of pathogen encounters than previously thought. Clonify is freely available at www.github.com/briney/clonify-python.

  12. Implementation and Performance Analysis of Parallel Assignment Algorithms on a Hypercube Computer.

    Science.gov (United States)

    1987-12-01

    graphical representation of the problem where each . node in the tree corresponds to either a source or a destination. The nodes are con- ;% nected by arcs...Xu, cu + 7r, - irj) are plotted to determine if they fall on a "kilter line" which is graphically derived from the upper and lower flow bounds, and...result of work performed under contract to the Defense Advanced Research Projects Agency (DARPA) and the U.S. Army. DESE Research and Engineering was

  13. A Near-Optimal Optimization Algorithm for Link Assignment in Wireless Ad-Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    Heng-Chang Liu; Bao-Hua Zhao

    2006-01-01

    Over the past few years, wireless networking technologies have made vast forays in our daily lives. In wireless ad-hoc networks, links are set up by a number of units without any permanent infrastructures. In this paper, the resource optimization is considered to maximize the network throughput by efficiently using the network capacity, where multi-hop functionality and spatial TDMA (STDMA) access scheme are used. The objective is to find the minimum frame length with given traffic distributions and corresponding routing information. Because of the complex structure of the underlying mathematical problem, previous work and analysis become intractable for networks of realistic sizes. The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. A column generation solution is proposed and several enhancements are made in order to fasten its convergence. Numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes.

  14. Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

    Institute of Scientific and Technical Information of China (English)

    WANG Yanyan; MOU Shandong; WU Yaohua

    2016-01-01

    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.

  15. Storage assignment optimization in a multi-tier shuttle warehousing system

    Science.gov (United States)

    Wang, Yanyan; Mou, Shandong; Wu, Yaohua

    2016-03-01

    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.

  16. Parallel algorithms

    CERN Document Server

    Casanova, Henri; Robert, Yves

    2008-01-01

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

  17. Working in groups for coursework assignments: The tertiary students’ perspective

    OpenAIRE

    Pung Wun Chiew; Rosnah Bt. Hj. Mustafa; Shirley Michael Slee

    2013-01-01

    The study examined undergraduates’ perception of group work in doing coursework assignments. It specifically investigated students’ perceptions of the usefulness of group work in doing assignments; identified reasons which influence students’ preference or non-preference for group work in doing assignments; determined students’ expectations of instructor’s roles in group work; and compared students’ perceptions of group work across ethnic groups. A 39-item questionnaire was distributed to 200...

  18. Toll modeling in context of road network assignment

    OpenAIRE

    2008-01-01

    Traffic network assignment is the last phase in the classical 4-phase traffic forecasting model. There are different methods of traffic assignment ranging from the most simple »all or nothing« method to the complex iterative methods such as Tribute method, however, only some of them are suitable for network assignment distribution modeling considering toll collection influence. For toll collection influence modeling we must consider the so called value of time. Value of time is indicated in t...

  19. Strategies for Effective Comments on Students’ Written Assignments

    Institute of Scientific and Technical Information of China (English)

    任永东

    2014-01-01

    Comments on students’ assignments are important for English course. The loopholes in teachers’ working schemes-com-ments of their students’ written assignments are the clues around which the paper spreads. In the process of teaching, some English teach-ers pay so much attention to the contents taught in class but ignore the comments on students’ written assignments. Consequently, it is not applicable for students to correct their mistakes in time and they probably make the same mistakes repeatedly.

  20. CYCLE TIMES ASSIGNMENT OF NONLINEAR DISCRETE EVENT DYNAMIC SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    CHEN Wende

    2000-01-01

    In this paper, nonautonomous models of Discrete Event Dynamic Systems (DEDS) are established by min-max function, reachability and observability are defined,the problem on cycle times assignment of DEDS, which corresponds with the important problem on poles assignment of linear systems, is studied. By Gunawardena et al.'Duality Theorem following results are obtained: Cycle times of system can be assigned under state feedback(or output feedback) if and only if system is reachable (or reachable and obserbable).

  1. Comparative Study of Static Task Scheduling Algorithms for Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Miss. Kalpana A. Manudhane

    2013-03-01

    Full Text Available On the distributed or parallel heterogeneous computing systems, an application is usually decomposed into several interdependent sets of co-operating subtasks and assigned to a set of available processors for execution. Task scheduling is in general NP-compete problem. Static task scheduling algorithms are categorized as Heuristic based and Guided random search based scheduling algorithms. Heuristic algorithms guaranteed to find near optimal solution in less than polynomial time. Heuristic based list scheduling algorithms are Heterogeneous Earliest Finish Time (HEFT and Critical-Path-On- -Processor (CPOP. Whereas, Guided random search based scheduling algorithms have shown robust performance on verity of schedulingproblems. Typical examples are Multiple Priority Queueing Genetic Algorithm (MPQGA, Tabu Search(TS, Ant Colony System (ACS. This paper gives comparative study of all these static task scheduling algorithms and compares them on the basis of average makespan, schedule length ratio (SLR and speedup and running time of algorithm.

  2. An explicit solution to right factorization with application in eigenstructure assignment

    Institute of Scientific and Technical Information of China (English)

    Guangren DUAN; Bin ZHOU

    2005-01-01

    Based on the well-known Leverrier algorithm, a simple explicit solution to right factorization of a linear system is established.This solution is expressed by the controllability matrix of the given system and a symmetric operator matrix.Applications of this solution to a type of generalized Sylvester matrix equations and the problem of parametric eigenstructure assignment by state feedback are investigated,and general complete parametric solutions to these two problems are deduced. These new solutions are simple,and possess desirable structural properties which render the solutions readily implementable.An example demonstrates the effect of the proposed results.

  3. Probabilistic Cross-Identification in Crowded Fields as an Assignment Problem

    CERN Document Server

    Budavari, Tamas

    2016-01-01

    One of the outstanding challenges of cross-identification is multiplicity: detections in crowded regions of the sky are often linked to more than one candidate associations of similar likelihoods. We map the resulting maximum likelihood partitioning to the fundamental assignment problem of discrete mathematics and efficiently solve the two-way catalog-level matching in the realm of combinatorial optimization using the so-called Hungarian algorithm. We introduce the method, demonstrate its performance in a mock universe where the true associations are known, and discuss the applicability of the new procedure to large surveys.

  4. O(1) Delta Component Computation Technique for the Quadratic Assignment Problem

    CERN Document Server

    Podolsky, Sergey

    2012-01-01

    The paper describes a novel technique that allows to reduce by half the number of delta values that were required to be computed with complexity O(N) in most of the heuristics for the quadratic assignment problem. Using the correlation between the old and new delta values, obtained in this work, a new formula of complexity O(1) is proposed. Found result leads up to 25% performance increase in such well-known algorithms as Robust Tabu Search and others based on it.

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

    2016-01-01

    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.

  6. Study on MAX-MIN Ant System with Random Selection in Quadratic Assignment Problem

    Science.gov (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.

  7. Solution to the quadratic assignment problem using semi-Lagrangian relaxation

    Institute of Scientific and Technical Information of China (English)

    Huizhen Zhang; Cesar Beltran-Royo; Bo Wang; Liang Ma; Ziying Zhang

    2016-01-01

    The semi-Lagrangian relaxation (SLR), a new exact method for combinatorial optimization problems with equality con-straints, is applied to the quadratic assignment problem (QAP). A dual ascent algorithm with finite convergence is developed for solving the semi-Lagrangian dual problem associated to the QAP. We perform computational experiments on 30 moderately difficult QAP instances by using the mixed integer programming solvers, Cplex, and SLR+Cplex, respectively. The numerical results not only further il ustrate that the SLR and the developed dual ascent algorithm can be used to solve the QAP reasonably, but also dis-close an interesting fact: comparing with solving the unreduced problem, the reduced oracle problem cannot be always effectively solved by using Cplex in terms of the CPU time.

  8. Case Assignment in the Inalienable Possession Construction in Korean.

    Science.gov (United States)

    Maling, Joan; Kim, Soowon

    1992-01-01

    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)

  9. A Poster Assignment Connects Information Literacy and Writing Skills

    Science.gov (United States)

    Waters, Natalie

    2015-01-01

    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…

  10. The Eco-Sculpture Assignment: Using Art to Scaffold Metacognition

    Science.gov (United States)

    Polegato, Rosemary

    2014-01-01

    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…

  11. 45 CFR 12.8 - Assignment of surplus real property.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 1 2010-10-01 2010-10-01 false Assignment of surplus real property. 12.8 Section 12.8 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION DISPOSAL AND UTILIZATION OF SURPLUS REAL PROPERTY FOR PUBLIC HEALTH PURPOSES § 12.8 Assignment of surplus real property. (a) Notice of interest in a specific...

  12. Students' Evaluation of Writing Assignments in an Abnormal Psychology Course.

    Science.gov (United States)

    Procidano, Mary E.

    1991-01-01

    Presents a study in which students in an abnormal psychology class rated the usefulness of drafts for two writing assignments. Reports that a research proposal was more effective than a case study in generating interest in psychology and opportunity for creativity. Concludes that writing assignments should reflect important aspects of a…

  13. 25 CFR 212.34 - Individual tribal assignments excluded.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Individual tribal assignments excluded. 212.34 Section... ALLOTTED LANDS FOR MINERAL DEVELOPMENT How To Acquire Leases § 212.34 Individual tribal assignments... made pursuant to tribal constitutions or ordinances for the use of individual Indians and assignees...

  14. The Transformative Potential of Creative Assignments in Higher Education

    Science.gov (United States)

    Duenkel, Nicky

    2013-01-01

    This paper encourages shifts in praxis to promote the thoughtful inclusion of creativity into higher education assignments in order to broaden and deepen student experience, and offer greater integration between required assignments and the complexity of students' lives. Obstacles to integrating creativity into academia are also briefly explored.…

  15. Automating Formative and Summative Feedback for Individualised Assignments

    Science.gov (United States)

    Hamilton, Ian Robert

    2009-01-01

    Purpose: The purpose of this paper is to report on the rationale behind the use of a unique paper-based individualised accounting assignment, which automated the provision to students of immediate formative and timely summative feedback. Design/methodology/approach: As students worked towards completing their assignment, the package provided…

  16. Graduate Writing Assignments across Faculties in a Canadian University

    Science.gov (United States)

    Shi, Ling; Dong, Yanning

    2015-01-01

    This study examines 143 graduate assignments across 12 faculties or schools in a Canadian university in order to identify types of writing tasks. Based on the descriptions provided by the instructors, we identified nine types of assignments, with scholarly essay being the most common, followed by summary and response, literature review, project,…

  17. Assigning Grammatical Relations with a Back-off Model

    CERN Document Server

    De Lima, E F

    1997-01-01

    This paper presents a corpus-based method to assign grammatical subject/object relations to ambiguous German constructs. It makes use of an unsupervised learning procedure to collect training and test data, and the back-off model to make assignment decisions.

  18. 7 CFR 12.34 - Paperwork Reduction Act assigned number.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 1 2010-01-01 2010-01-01 false Paperwork Reduction Act assigned number. 12.34 Section 12.34 Agriculture Office of the Secretary of Agriculture HIGHLY ERODIBLE LAND AND WETLAND CONSERVATION Wetland Conservation § 12.34 Paperwork Reduction Act assigned number. The information...

  19. Negotiating Languages and Cultures: Enacting Translingualism through a Translation Assignment

    Science.gov (United States)

    Kiernan, Julia; Meier, Joyce; Wang, Xiqiao

    2016-01-01

    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…

  20. 14 CFR 1245.109 - Assignment of title to NASA.

    Science.gov (United States)

    2010-01-01

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

  1. New Heuristic Rounding Approaches to the Quadratic Assignment Problem

    CERN Document Server

    Gharibi, Wajeb

    2011-01-01

    Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency.

  2. Genetics of traffic assignment models for strategic transport planning

    NARCIS (Netherlands)

    Bliemer, M.C.J.; Raadsen, M.; Brederode, L.; Bell, M.; Wismans, L.J.J.; Smith, M.

    2016-01-01

    This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic

  3. Dynamic Equilibrium Assignment Convergence by En-route Flow Smoothing

    NARCIS (Netherlands)

    Pel, A.J.; Bliemer, M.C.J.; Hoogendoorn, S.P.

    2010-01-01

    An essential feature in many dynamic traffic assignment (DTA) models used for planning purposes is to compute the (dynamic) equilibrium assignment, where travellers follow user-optimal routes, leading to minimal experienced route travel times. To compute these time-varying route flows in the equilib

  4. 45 CFR 302.50 - Assignment of rights to support.

    Science.gov (United States)

    2010-10-01

    ... process; or (2) Except for obligations assigned under 42 CFR 433.146, other legal process as established... competent jurisdiction or administrative process which covers the assigned support rights. (2) If there is no court or administrative order, an amount determined in writing by the IV-D agency as part of...

  5. On the Use of Writing Assignments in Intermediate Microeconomic Theory

    Science.gov (United States)

    O'Neill, Patrick B.

    2009-01-01

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

  6. 33 CFR 3.01-5 - Assignment of functions.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Assignment of functions. 3.01-5... Provisions § 3.01-5 Assignment of functions. Section 888 of Pub. L. 107-296, 116 Stat. 2135, authorizes the Commandant of the Coast Guard to exercise certain functions, powers, and duties vested in the Secretary...

  7. Individual Assignments and Academic Dishonesty--Exploring the Learning Conundrum

    Science.gov (United States)

    Leonard, Valorie; LeBrasseur, Rolland

    2008-01-01

    A survey of university business professors focused on their use of individual assignments in courses and their views on cheating and its impact on student learning. Based on responses from 456 professors (37% response rate) from Ontario, Canada, it was concluded that most faculty believe that individual assignments are effective learning tools and…

  8. 42 CFR 435.610 - Assignment of rights to benefits.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits. 435.610 Section....610 Assignment of rights to benefits. (a) As a condition of eligibility, the agency must require... paternity and in obtaining medical support and payments, unless the individual establishes good cause...

  9. 42 CFR 436.610 - Assignment of rights to benefits.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits. 436.610 Section... General Financial Eligibility Requirements and Options § 436.610 Assignment of rights to benefits. (a) As... payments, unless the individual establishes good cause for not cooperating, and except for...

  10. 48 CFR 1442.202 - Assignment of contract administration.

    Science.gov (United States)

    2010-10-01

    ... Assignment of contract administration. (a) The decision to withhold normal individual contract administration... 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...

  11. FellWalker - a Clump Identification Algorithm

    CERN Document Server

    Berry, David

    2014-01-01

    This paper describes the FellWalker algorithm, a watershed algorithm that segments a 1-, 2- or 3-dimensional array of data values into a set of disjoint clumps of emission, each containing a single significant peak. Pixels below a nominated constant data level are assumed to be background pixels and are not assigned to any clump. FellWalker is thus equivalent in purpose to the CLUMPFIND algorithm. However, unlike CLUMPFIND, which segments the array on the basis of a set of evenly-spaced contours and thus uses only a small fraction of the available data values, the FellWalker algorithm is based on a gradient-tracing scheme which uses all available data values. Comparisons of CLUMPFIND and FellWalker using a crowded field of artificial Gaussian clumps, all of equal peak value and width, suggest that the results produced by FellWalker are less dependent on specific parameter settings than are those of CLUMPFIND.

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

    Directory of Open Access Journals (Sweden)

    Yu Jiang

    2013-01-01

    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.

  13. Multiobjective controller synthesis via eigenstructure assignment with state feedback

    Science.gov (United States)

    Li, Zhao; Lam, James

    2016-10-01

    A general parameter scheme for multiobjective controller synthesis via eigenstructure assignment with state feedback is proposed. The scheme provides total pole configurability, that is, pole assignment constraints, partial pole assignment constraints, generalised regional pole assignment constraints can be dealt with simultaneously without introducing essential conservatism. The scheme is derived from the pole assignment approach using Sylvester equations, and the parameter space is the Cartesian product of some subspaces characterising the free parameters. Under the scheme, the controller design problems are formulated as nonlinear optimisation problems with both objectives and constraints being differentiable and can be solved by derivative-based nonlinear programming technique. Numerical examples are given to illustrate the efficiency of the proposed method.

  14. Evaluation of a UMLS Auditing Process of Semantic Type Assignments.

    Science.gov (United States)

    Gu, Huanying Helen; Hripcsak, George; Chen, Yan; Morrey, C Paul; Elhanan, Gai; Cimino, James; Geller, James; Perl, Yehoshua

    2007-10-11

    The UMLS is a terminological system that integrates many source terminologies. Each concept in the UMLS is assigned one or more semantic types from the Semantic Network, an upper level ontology for biomedicine. Due to the complexity of the UMLS, errors exist in the semantic type assignments. Finding assignment errors may unearth modeling errors. Even with sophisticated tools, discovering assignment errors requires manual review. In this paper we describe the evaluation of an auditing project of UMLS semantic type assignments. We studied the performance of the auditors who reviewed potential errors. We found that four auditors, interacting according to a multi-step protocol, identified a high rate of errors (one or more errors in 81% of concepts studied) and that results were sufficiently reliable (0.67 to 0.70) for the two most common types of errors. However, reliability was low for each individual auditor, suggesting that review of potential errors is resource-intensive.

  15. Novel multi-objective optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    Jie Zeng; Wei Nie

    2014-01-01

    Many multi-objective evolutionary algorithms (MOEAs) can converge to the Pareto optimal front and work wel on two or three objectives, but they deteriorate when faced with many-objective problems. Indicator-based MOEAs, which adopt various indicators to evaluate the fitness values (instead of the Pareto-dominance relation to select candidate solutions), have been regarded as promising schemes that yield more satisfactory re-sults than wel-known algorithms, such as non-dominated sort-ing genetic algorithm (NSGA-II) and strength Pareto evolution-ary algorithm (SPEA2). However, they can suffer from having a slow convergence speed. This paper proposes a new indicator-based multi-objective optimization algorithm, namely, the multi-objective shuffled frog leaping algorithm based on the ε indicator (ε-MOSFLA). This algorithm adopts a memetic meta-heuristic, namely, the SFLA, which is characterized by the powerful capa-bility of global search and quick convergence as an evolutionary strategy and a simple and effective ε-indicator as a fitness as-signment scheme to conduct the search procedure. Experimental results, in comparison with other representative indicator-based MOEAs and traditional Pareto-based MOEAs on several standard test problems with up to 50 objectives, show thatε-MOSFLA is the best algorithm for solving many-objective optimization problems in terms of the solution quality as wel as the speed of convergence.

  16. A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model

    CERN Document Server

    Arumugam, Mahesh

    2008-01-01

    Several self-stabilizing time division multiple access (TDMA) algorithms are proposed for sensor networks. In addition to providing a collision-free communication service, such algorithms enable the transformation of programs written in abstract models considered in distributed computing literature into a model consistent with sensor networks, i.e., write all with collision (WAC) model. Existing TDMA slot assignment algorithms have one or more of the following properties: (i) compute slots using a randomized algorithm, (ii) assume that the topology is known upfront, and/or (iii) assign slots sequentially. If these algorithms are used to transform abstract programs into programs in WAC model then the transformed programs are probabilistically correct, do not allow the addition of new nodes, and/or converge in a sequential fashion. In this paper, we propose a self-stabilizing deterministic TDMA algorithm where a sensor is aware of only its neighbors. We show that the slots are assigned to the sensors in a concu...

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

    Science.gov (United States)

    Arefin, Md Shamsul

    2012-01-01

    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.

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

    2012-12-01

    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.

  19. Centralized Fuzzy Data Association Algorithm of Three-sensor Multi-target Tracking System

    Directory of Open Access Journals (Sweden)

    Zhaofeng Su

    2014-02-01

    Full Text Available For improving the effect of multi-target tracking in dense target and clutter scenario, a centralized fuzzy optimal assignment algorithm (CMS-FOA of three-sensor multi-target system is proposed. And on the base of this, a generalized probabilistic data association algorithm (CMS-FOAGPDA based on CMS-FOA algorithm is presented. The fusion algorithm gets effective 3-tuple of measurement set by using components of several satisfactory solutions of the fuzzy optimal assignment problem and then uses generalized probabilistic data association algorithm to calculate the update states of targets. Simulation results show that, in the aspect of multi-target tracking accuracy, CMS-FOA algorithm is superior to the optimal assignment (CMS-OA algorithm based on state estimate and CMS-FOAGPDA algorithm is better than CMS-FOA algorithm. But considering the time spent, CMS-FOA algorithm spends a minimum of time and CMS-FOAGPDA algorithm is exactly on the contrary. Therefore, compared with CMS-OA algorithm, the two algorithms presented in the study each has its advantages and should be chosen according to the needs of the actual application when in use.

  20. Issues Challenges and Tools of Clustering Algorithms

    Directory of Open Access Journals (Sweden)

    Parul Agarwal

    2011-05-01

    Full Text Available Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure. This paper has captured the problems that are faced in real when clustering algorithms are implemented .It also considers the most extensively used tools which are readily available and support functions which ease the programming. Once algorithms have been implemented, they also need to be tested for its validity. There exist several validation indexes for testing the performance and accuracy which have also been discussed here.

  1. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

  2. Low complexity bit loading algorithm for OFDM system

    Institute of Scientific and Technical Information of China (English)

    Yang Yu; Sha Xuejun; Zhang Zhonghua

    2006-01-01

    A new approach to loading for orthogonal frequency division multiplexing (OFDM) system is proposed, this bit-loading algorithm assigns bits to different subchannels in order to minimize the transmit energy. In the algorithm,first most bit are allocated to each subchannels according to channel condition, Shannon formula and QoS require of the user, then the residual bit are allocated to the subchannels bit by bit. In this way the algorithm is efficient while calculation is less complex. This is the first time to load bits with the scale following Shannon formula and the algorithm is of O (4N) complexity.

  3. Evolutionary Graph Drawing Algorithms

    Institute of Scientific and Technical Information of China (English)

    Huang Jing-wei; Wei Wen-fang

    2003-01-01

    In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements.

  4. Pattern Recognition based Lexi-Search Approach to the Variant Multi- Dimensional Assignment Problem

    Directory of Open Access Journals (Sweden)

    Purusotham, S.

    2011-08-01

    Full Text Available The Multi Dimensional Assignment Problem (MDAP is a combinatorial optimization problem that is known to be NP –Hard. In this paper we discuss a problem with four dimensions. N jobs can be executed on Nmachines, at k facilities, using l concessions. Every job is to be scheduled on some machine at one of the facilities, using some concession. No two jobs can run on the same machine, at the same facility using the same concession. Furthermore, there is a specified maximum number of jobs that can be run at a given facility, andthere is a maximum number of jobs that can avail of a given concession. C (i, j, k, l be the cost of allocating job ‘i’ on machine ‘j’ at facility ‘k’ using the concession ‘l’. This is provided as a 4 dimensional array. The objective is to schedule the jobs in such a way that the constraints are met and the cost is minimized. For this problem we developed a Pattern Recognition Technique based Lexi Search Algorithm, which comes under the exact methods. The concepts and the algorithm involving in this problem are discussed with a suitable numerical example. We programmed the proposed Lexi Search algorithm using C. This algorithm takesless CPU run time as compared with the existed methods, and hence it suggested for solving the higher dimensional problems.

  5. New optimal algorithm of data association for multi-passive-sensor location system

    Institute of Scientific and Technical Information of China (English)

    ZHOU Li; HE You; ZHANG WeiHua

    2007-01-01

    In dense target and false detection scenario of four time difference of arrival (TDOA)for multi-passive-sensor location system, the global optimal data association algorithm has to be adopted. In view of the heavy calculation burden of the traditional optimal assignment algorithm, this paper proposes a new global optimal assignment algorithm and a 2-stage association algorithm based on a statistic test.Compared with the traditional optimal algorithm, the new optimal algorithm avoids the complicated operations for finding the target position before we calculate association cost; hence, much of the procedure time is saved. In the 2-stage association algorithm, a large number of false location points are eliminated from candidate associations in advance. Therefore, the operation is further decreased, and the correct data association probability is improved in varying degrees. Both the complexity analyses and simulation results can verify the effectiveness of the new algorithms.

  6. Efficient FM Algorithm for VLSI Circuit Partitioning

    Directory of Open Access Journals (Sweden)

    M.RAJESH

    2013-04-01

    Full Text Available In FM algorithm initial partitioning matrix of the given circuit is assigned randomly, as a result for larger circuit having hundred or more nodes will take long time to arrive at the final partition if theinitial partitioning matrix is close to the final partitioning then the computation time (iteration required is small . Here we have proposed novel approach to arrive at initial partitioning by using spectralfactorization method the results was verified using several circuits.

  7. Assigning numbers to the arrows: Parameterizing a gene regulation network by using accurate expression kinetics

    Science.gov (United States)

    Ronen, Michal; Rosenberg, Revital; Shraiman, Boris I.; Alon, Uri

    2002-08-01

    A basic challenge in systems biology is to understand the dynamical behavior of gene regulation networks. Current approaches aim at determining the network structure based on genomic-scale data. However, the network connectivity alone is not sufficient to define its dynamics; one needs to also specify the kinetic parameters for the regulation reactions. Here, we ask whether effective kinetic parameters can be assigned to a transcriptional network based on expression data. We present a combined experimental and theoretical approach based on accurate high temporal-resolution measurement of promoter activities from living cells by using green fluorescent protein (GFP) reporter plasmids. We present algorithms that use these data to assign effective kinetic parameters within a mathematical model of the network. To demonstrate this, we employ a well defined network, the SOS DNA repair system of Escherichia coli. We find a strikingly detailed temporal program of expression that correlates with the functional role of the SOS genes and is driven by a hierarchy of effective kinetic parameter strengths for the various promoters. The calculated parameters can be used to determine the kinetics of all SOS genes given the expression profile of just one representative, allowing a significant reduction in complexity. The concentration profile of the master SOS transcriptional repressor can be calculated, demonstrating that relative protein levels may be determined from purely transcriptional data. This finding opens the possibility of assigning kinetic parameters to transcriptional networks on a genomic scale.

  8. SAS-Pro: simultaneous residue assignment and structure superposition for protein structure alignment.

    Science.gov (United States)

    Shah, Shweta B; Sahinidis, Nikolaos V

    2012-01-01

    Protein structure alignment is the problem of determining an assignment between the amino-acid residues of two given proteins in a way that maximizes a measure of similarity between the two superimposed protein structures. By identifying geometric similarities, structure alignment algorithms provide critical insights into protein functional similarities. Existing structure alignment tools adopt a two-stage approach to structure alignment by decoupling and iterating between the assignment evaluation and structure superposition problems. We introduce a novel approach, SAS-Pro, which addresses the assignment evaluation and structure superposition simultaneously by formulating the alignment problem as a single bilevel optimization problem. The new formulation does not require the sequentiality constraints, thus generalizing the scope of the alignment methodology to include non-sequential protein alignments. We employ derivative-free optimization methodologies for searching for the global optimum of the highly nonlinear and non-differentiable RMSD function encountered in the proposed model. Alignments obtained with SAS-Pro have better RMSD values and larger lengths than those obtained from other alignment tools. For non-sequential alignment problems, SAS-Pro leads to alignments with high degree of similarity with known reference alignments. The source code of SAS-Pro is available for download at http://eudoxus.cheme.cmu.edu/saspro/SAS-Pro.html.

  9. Algorithmic chemistry

    Energy Technology Data Exchange (ETDEWEB)

    Fontana, W.

    1990-12-13

    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.

  10. An ideal mass assignment scheme for measuring the Power Spectrum with FFTs

    CERN Document Server

    Cui, Weiguang; Yang, Xiaohu; Wang, Yu; Feng, Longlong; Springel, Volker

    2008-01-01

    In measuring the power spectrum of the distribution of large numbers of dark matter particles in simulations, or galaxies in observations, one has to use Fast Fourier Transforms (FFT) for calculational efficiency. However, because of the required mass assignment onto grid points in this method, the measured power spectrum $\\la |\\delta^f(k)|^2\\ra$ obtained with an FFT is not the true power spectrum $P(k)$ but instead one that is convolved with a window function $|W(\\vec k)|^2$ in Fourier space. In a recent paper, Jing (2005) proposed an elegant algorithm to deconvolve the sampling effects of the window function and to extract the true power spectrum, and tests using N-body simulations show that this algorithm works very well for the three most commonly used mass assignment functions, i.e., the Nearest Grid Point (NGP), the Cloud In Cell (CIC) and the Triangular Shaped Cloud (TSC) methods. In this paper, rather than trying to deconvolve the sampling effects of the window function, we propose to select a particu...

  11. ANALYSIS AND PERFORMANCE MEASUREMENT OF EXISTING SOLUTION METHODS OF QUADRATIC ASSIGNMENT PROBLEM

    Directory of Open Access Journals (Sweden)

    Morteza KARAMI

    2014-01-01

    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.

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

    Directory of Open Access Journals (Sweden)

    Wipawee Tharmmaphornphilas

    2010-04-01

    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.

  13. Automation of the CHARMM General Force Field (CGenFF) II: Assignment of bonded parameters and partial atomic charges

    Science.gov (United States)

    Vanommeslaeghe, K.; Raman, E. Prabhu; MacKerell, A. D.

    2012-01-01

    Molecular mechanics force fields are widely used in computer-aided drug design for the study of drug candidates interacting with biological systems. In these simulations, the biological part is typically represented by a specialized biomolecular force field, while the drug is represented by a matching general (organic) force field. In order to apply these general force fields to an arbitrary drug-like molecule, functionality for assignment of atom types, parameters and partial atomic charges is required. In the present article, algorithms for the assignment of parameters and charges for the CHARMM General Force Field (CGenFF) are presented. These algorithms rely on the existing parameters and charges that were determined as part of the parametrization of the force field. Bonded parameters are assigned based on the similarity between the atom types that define said parameters, while charges are determined using an extended bond-charge increment scheme. Charge increments were optimized to reproduce the charges on model compounds that were part of the parametrization of the force field. A “penalty score” is returned for every bonded parameter and charge, allowing the user to quickly and conveniently assess the quality of the force field representation of different parts of the compound of interest. Case studies are presented to clarify the functioning of the algorithms and the significance of their output data. PMID:23145473

  14. Assignments of autoionization states of O2-asterisk

    Science.gov (United States)

    Wu, C. Y. Robert

    1987-01-01

    Attention is given to the uncertainties that remain concerning the autoionization states of O2 leading to the a 4Pi(u) and A 2Pi(u) states of O2(+), as well as some of the assignments of the autoionization states and the determinations of effective quantum numbers and quantum defects. The former problems of vibrational assignments are unambiguously established in view of a study of isotopic oxygen molecules. A systematic examination of the known Rydberg series is conducted, and new assignments and interpretations for several autoionization states leading to the various states of O2(+) are suggested.

  15. Computational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations

    CERN Document Server

    Jiménez, Andrea

    2011-01-01

    Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this work we show that it is NP-complete to decide whether or not a surface triangulation admits a satisfying spin-assignment, and that it is #P-complete to determine the number of such assignments. Both results are derived via an elaborate (and atypical) reduction that maps a Boolean formula in 3-conjunctive normal form into a triangulation of an orientable closed surface.

  16. Linear assignment maps for correlated system-environment states

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez-Rosario, Cesar A.; Modi, Kavan; Aspuru-Guzik, Alan

    2010-01-20

    Assignment maps are mathematical operators that describe initial system-environment states for open quantum systems. We re-examine the notion of assignments that account for correlations between the system and the environment and show that these maps can be made linear at the expense of giving up positivity or consistency of the map. We study the role of positivity and consistency of the map and show the effects of relaxing these. Finally, we establish a connection between the violation of the positivity of linear assignments and the no-broadcasting theorem.

  17. A note on the assignments of Rydberg states of COS

    Science.gov (United States)

    Wu, C. Y. R.

    1982-01-01

    Assignments of the Rydberg states which converge to the respective X-tilde and B-tilde ion states of the COS(+) ion are reported. The assignments were made based on previously established orderings for the quantum defects of isoelectronic molecules. The Rydberg series I and II, which converge to the X-tilde 2 Pi state of COS(+), and the series III, IV, V, VI and VII, which converge to the B-tilde 2 Sigma + state, are assigned to molecular orbitals characterized by predominant sulfur orbitals, in contrast to those converging to the C-tilde states, which are characterized by oxygen atomic orbitals.

  18. A variable neighbourhood search algorithm for the constrained task allocation problem

    OpenAIRE

    Lusa, A.; Potts, C.N.

    2006-01-01

    A Variable Neighbourhood Search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, task assignment costs, and communication costs between tasks assigned to different processors. A comput...

  19. Interagency Reform: Changing Organizational Culture through Education and Assignment

    Science.gov (United States)

    2007-03-30

    to focus on the people operating inside the interagency community. That takes changing basic organizational culture using an in-stride method that...capitalizes on two momentous influencers of organizational culture - education and interagency assignments.

  20. A singular value sensitivity approach to robust eigenstructure assignment

    DEFF Research Database (Denmark)

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

    1986-01-01

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

  1. Task Assignment Problem Solved by Continuous Hopfield Network

    Directory of Open Access Journals (Sweden)

    Ettaouil Mohamed

    2012-03-01

    Full Text Available The task assignment problem with non uniform communication costs (TAP consists in finding an assignment of the tasks to the processors such that the total execution and communication costs is minimized. This problem is naturally formulated as 0-1 quadratic programming subject to linear constraints (QP. In this paper, we propose a new approach to solve the task assignment problem with non uniform communication costs using the continuous Hopfield network (CHN. This approach is based on some energy or Lyapunov function, which diminishes as the system develops until a local minimum value is obtained. We show that this approach is able to determine a good solution for this problem. Finally, some computational experiments solving the task assignment problem with non-uniform communication costs are shown.

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

    Directory of Open Access Journals (Sweden)

    Yavuz OZDEMIR

    2012-01-01

    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.

  3. Recommender Systems for the Conference Paper Assignment Problem

    CERN Document Server

    Conry, Don; Ramakrishnan, Naren

    2009-01-01

    Conference paper assignment, i.e., the task of assigning paper submissions to reviewers, presents multi-faceted issues for recommender systems research. Besides the traditional goal of predicting `who likes what?', a conference management system must take into account aspects such as: reviewer capacity constraints, adequate numbers of reviews for papers, expertise modeling, conflicts of interest, and an overall distribution of assignments that balances reviewer preferences with conference objectives. Among these, issues of modeling preferences and tastes in reviewing have traditionally been studied separately from the optimization of paper-reviewer assignment. In this paper, we present an integrated study of both these aspects. First, due to the paucity of data per reviewer or per paper (relative to other recommender systems applications) we show how we can integrate multiple sources of information to learn paper-reviewer preference models. Second, our models are evaluated not just in terms of prediction accu...

  4. Calibrated peer review assignments for the earth sciences

    Science.gov (United States)

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

    2009-01-01

    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.

  5. wrtg391 full course [ all discussions and all assignments

    OpenAIRE

    Laynebaril

    2017-01-01

    wrtg391 full course [ all discussions and all assignments   Critically Thinking in WRTG 391 Click Link Below To Buy: http://hwcampus.com/shop/wrtg391-full-course/   Actions for 'Critically Thinking in WRTG 391'SubscribeHide Description Welcome to WRTG 391!   Assignment: After watching Dr. Derek Cabrera's lecture please write a short paragraph in which you answer oneof the following questions: Why does Dr. Cabrera differentiate between the ability t...

  6. HSA 505 Week 3 Assignment 1  Product Development

    OpenAIRE

    Laynebaril1

    2017-01-01

    HSA 505 Week 3 Assignment 1  Product Development   Click Link Below To Buy:   http://hwcampus.com/shop/hsa-505-week-3-assignment-1-product-development/   Health services continue to affect the gross domestic product, and this dramatic transformation has great demands on each dollar spent to deliver patient-centered products. Health care marketing must be repeatedly applied and practiced strategically to include environmental dimensions, such as technology, socioeco...

  7. Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.

    Directory of Open Access Journals (Sweden)

    Lei Li

    Full Text Available Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT, which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are.

  8. Chemical shift assignments of two oleanane triterpenes from Euonymus hederaceus

    Institute of Scientific and Technical Information of China (English)

    HU He-jiao; WANG Kui-wu; WU Bin; SUN Cui-rong; PAN Yuan-jiang

    2005-01-01

    1H-NMR and 13C-NMR assignments of 12-oleanene-3,11-dione (compound 1) were completely described for the first time through conventional 1D NMR and 2D shift-correlated NMR experiments using 1H-1HCOSY, HMQC, HMBC techniques.Based on its NMR data, the assignments of 28-hydroxyolean-12-ene-3,11-dione (compound 2) were partially revised.

  9. The challenge of expenditure-assignment reform in Russia

    OpenAIRE

    1994-01-01

    This paper is an examination of the critical role the assignment of expenditure responsibilities must play in building the Russian Federation. The fiscal federalism system and the expenditure assignments inherited from the Soviet Union were not truly decentralized. All the real decisions were made back in Moscow. Although subnational governments now have authority to create their own budgets, past processes and institutions still undermine local autonomy. How ever, the most serious threat to ...

  10. Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.

    Science.gov (United States)

    Li, Lei; Wang, Yan; Liu, Guanfeng; Wang, Meng; Wu, Xindong

    2015-01-01

    Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications) with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT), which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are.

  11. Algorithm Theory - SWAT 2006

    DEFF Research Database (Denmark)

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

  12. Algorithm Animation with Galant.

    Science.gov (United States)

    Stallmann, Matthias F

    2017-01-01

    Although surveys suggest positive student attitudes toward the use of algorithm animations, it is not clear that they improve learning outcomes. The Graph Algorithm Animation Tool, or Galant, challenges and motivates students to engage more deeply with algorithm concepts, without distracting them with programming language details or GUIs. Even though Galant is specifically designed for graph algorithms, it has also been used to animate other algorithms, most notably sorting algorithms.

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

    Science.gov (United States)

    Jackson, C. Kirabo

    2011-01-01

    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…

  14. Novel algorithm of finding good candidate pre-configuration cycles in survivable WDM mesh network

    Institute of Scientific and Technical Information of China (English)

    ZHAO Tai-fei; YU Hong-fang; LI Le-min

    2006-01-01

    We present a novel algorithm of finding cycles, called the Fast Cycles Mining Algorithm (FCMA),for effi cient p-cycle network design in WDM networks. The algorithm is also flexible in that the number and the length of cycles generated are controlled by several input parameters. The problem of wavelength assign ment on p-cycle is considered in the algorithm. This algorithm is scalable and especially suitable for surviv able WDM mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.

  15. Models and Algorithm for Stochastic Network Designs

    Institute of Scientific and Technical Information of China (English)

    Anthony Chen; Juyoung Kim; Seungjae Lee; Jaisung Choi

    2009-01-01

    The network design problem (NDP) is one of the most difficult and challenging problems in trans-portation. Traditional NDP models are often posed as a deterministic bilevel program assuming that all rele-vant inputs are known with certainty. This paper presents three stochastic models for designing transporta-tion networks with demand uncertainty. These three stochastic NDP models were formulated as the ex-pected value model, chance-constrained model, and dependent-chance model in a bilevel programming framework using different criteria to hedge against demand uncertainty. Solution procedures based on the traffic assignment algorithm, genetic algorithm, and Monte-Cado simulations were developed to solve these stochastic NDP models. The nonlinear and nonconvex nature of the bilevel program was handled by the genetic algorithm and traffic assignment algorithm, whereas the stochastic nature was addressed through simulations. Numerical experiments were conducted to evaluate the applicability of the stochastic NDP models and the solution procedure. Results from the three experiments show that the solution procedures are quite robust to different parameter settings.

  16. A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Mehdi Alinaghian

    2015-08-01

    Full Text Available A significant portion of Gross Domestic Production (GDP in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG. In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (GCW for Vehicle Routing Problem regarding to fuel consumption is presented. The objective function is fuel consumption, drivers, and the usage of vehicles. Being compared to exact methods solutions for small-sized problems and to Differential Evolution (DE algorithm solutions for large-scaled problems, the results show efficient performance of the proposed GCW algorithm.

  17. A model of cloud application assignments in software-defined storages

    Science.gov (United States)

    Bolodurina, Irina P.; Parfenov, Denis I.; Polezhaev, Petr N.; Shukhman, Alexander E.

    2017-01-01

    The aim of this study is to analyze the structure and mechanisms of interaction of typical cloud applications and to suggest the approaches to optimize their placement in storage systems. In this paper, we describe a generalized model of cloud applications including the three basic layers: a model of application, a model of service, and a model of resource. The distinctive feature of the model suggested implies analyzing cloud resources from the user point of view and from the point of view of a software-defined infrastructure of the virtual data center (DC). The innovation character of this model is in describing at the same time the application data placements, as well as the state of the virtual environment, taking into account the network topology. The model of software-defined storage has been developed as a submodel within the resource model. This model allows implementing the algorithm for control of cloud application assignments in software-defined storages. Experimental researches returned this algorithm decreases in cloud application response time and performance growth in user request processes. The use of software-defined data storages allows the decrease in the number of physical store devices, which demonstrates the efficiency of our algorithm.

  18. A Variable Weighted Least-Connection Algorithm for Multimedia Transmission

    Institute of Scientific and Technical Information of China (English)

    杨立辉; 余胜生

    2003-01-01

    Under high loads, a multimedia duster server can serve many hundreds of connections concurrently, where a load balancer distributes the incoming connection request to each node according to a preset algorithm. Among existing scheduling algorithms, round-Robin and least-connection do not take into account the difference of service capability of each node and improved algorithms such as weighted round-Robin and weighted least-connection. They also do not consider the fact that the ratio of number of TCP connections and the fixed weight does not reflect the real load of node. In this paper we introduce our attempts in improving the scheduling algorithms and propose a variable weighted least-connection algorithm, which assigns variable weight, instead of fixed weight, to each node according to its real time resource. A validating trial has been performed and the results show that the proposed algorithm has effective load balancing in one central control node scenario.

  19. An Efficient Graph-Coloring Algorithm for Processor Allocation

    Directory of Open Access Journals (Sweden)

    Mohammed Hasan Mahafzah

    2013-06-01

    Full Text Available This paper develops an efficient exact graph-coloring algorithm based on Maximum Independent Set (MIS for allocating processors in distributed systems. This technique represents the allocated processors in specific time in a fully connected graph and prevents each processor in multiprocessor system to be assigned to more than one process at a time. This research uses a sequential technique to distribute processes among processors. Moreover, the proposed method has been constructed by modifying the FMIS algorithm. The proposed algorithm has been programmed in Visual C++ and implemented on an Intel core i7. The experiments show that the proposed algorithm gets better performance in terms of CPU utilization, and minimum time for of graph coloring, comparing with the latest FMIS algorithm. The proposed algorithm can be developed to detect defected processor in the system.

  20. An optimization approach for minimum norm and robust partial quadratic eigenvalue assignment problems for vibrating structures

    Science.gov (United States)

    Brahma, Sanjoy; Datta, Biswa

    2009-07-01

    The partial quadratic eigenvalue assignment problem (PQEVAP) concerns the reassignment of a small number of undesirable eigenvalues of a quadratic matrix pencil, while leaving the remaining large number of eigenvalues and the corresponding eigenvectors unchanged. The problem arises in controlling undesirable resonance in vibrating structures and in stabilizing control systems. The solution of this problem requires computations of a pair of feedback matrices. For practical effectiveness, these feedback matrices must be computed in such a way that their norms and the condition number of the closed-loop eigenvector matrix are as small as possible. These considerations give rise to the minimum norm partial quadratic eigenvalue assignment problem (MNPQEVAP) and the robust partial quadratic eigenvalue assignment problem (RPQEVAP), respectively. In this paper we propose new optimization based algorithms for solving these problems. The problems are solved directly in a second-order setting without resorting to a standard first-order formulation so as to avoid the inversion of a possibly ill-conditioned matrix and the loss of exploitable structures of the original model. The algorithms require the knowledge of only the open-loop eigenvalues to be replaced and their corresponding eigenvectors. The remaining open-loop eigenvalues and their corresponding eigenvectors are kept unchanged. The invariance of the large number of eigenvalues and eigenvectors under feedback is guaranteed by a proven mathematical result. Furthermore, the gradient formulas needed to solve the problems by using the quasi-Newton optimization technique employed are computed in terms of the known quantities only. Above all, the proposed methods do not require the reduction of the model order or the order of the controller, even when the underlying finite element model has a very large degree of freedom. These attractive features, coupled with minimal computational requirements, such as solutions of small