WorldWideScience

Sample records for weapon assignment algorithm

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

    Science.gov (United States)

    2016-02-01

    UNCLASSIFIED UNCLASSIFIED Application of a Dynamic Programming Algorithm for Weapon Target Assignment Lloyd Hammond Weapons and...Combat Systems Division Defence Science and Technology Group DST Group-TR-3221 ABSTRACT Threat evaluation and weapon assignment...dynamic programming algorithm for Weapon Target Assignment which, after more rigorous testing, could be used as a concept demonstrator and as an auxiliary

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

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

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

  5. 武器目标协同火力分配建模及算法%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.%针对当前火力分配模型的不足以及实际作战的需求,对武器目标协同火力分配问题进行了研究,建立了火力分配层次结构;通过对火力分配原则的研究,结合打击目标选择和弹目分配,建立了以导弹武器作战效费比为总目标,以目标毁伤要求为约束的火力分配模型。采用遗传算法求解火力分配问题,根据问题的特点和问题中的启发信息,对遗传算法进行了改进。仿真结果表明,改进算法的性能有较大提高,可用于解决复杂武器目标分配这类非线性整数规划问题。

  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 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.%建立了武器-目标分配问题的优化模型,分析了分布估计算法与遗传算法的异同.将分布估计算法应用于武器-目标分配问题,该算法通过统计当前群体中优选出的个体信息,给出下一代个体的概率估计,用随机取样的方法生成下一代群体.分析了个体种群数量、选择比例等参数对算法的影响,得出个体种群数量和选择比例取适中时效果最好的结论.仿真结果表明了分布估计算法求解武器-目标分配问题是可靠有效的.此方法具有较好的可扩展性,修改此算法可解决一般组合优化问题.

  8. Explicit pattern matching assignment algorithm

    Science.gov (United States)

    Levedahl, Mark

    2002-08-01

    Sharing data between two tracking systems frequently involves use of an object map: the transmitting system sends a frame of data with multiple observations, and the receiving system uses an assignment algorithm to correlate the information with its local observation data base. The usual prescription for this problem is an optimal assignment algorithm (such as JVC or auction) using a cost matrix based upon chi-squared distances between the local and remote observation data. The optimal assignment algorithm does not actually perform pattern matching, so this approach is not robust to large registration errors between the two systems when there exist differences in the number of observations held by both systems. Performance of a new assignment algorithm that uses a cost function including terms for both registration errors and track to track random errors is presented: the cost function explicitly includes a bias between the two observation sets and thus provides a maximum likelihood solution to the assignment problem. In practice, this assignment approach provides near perfect assignment accuracy in cases where the bias errors exceed the dimension of the transmitted object map and there exist mismatches in the numbers of observations made by the two systems. This performance extends to many cases where the optimal assignment algorithm methodology produces errors nearly 100% of the time. The paper includes the theoretical foundation of the assignment problem solved and comparison of achieved accuracy with existing optimal assignment approaches.

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

  10. Threat evaluation and weapon assignment decision support: A ...

    African Journals Online (AJOL)

    Evaluation and Weapon Assignment (TEWA) process with regards to Command and ... [81] TE refers to “the part of threat analysis concerned with the ...... makers are more likely to screen options with respect to cut-offs or goals when there is.

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

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

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

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

  15. Automated Navigation System based on Weapon-Target Assignment

    Directory of Open Access Journals (Sweden)

    Mohammad Khairudin

    2011-12-01

    Full Text Available Operating of weapon on the tank is mostly by manually. It is not desired performance for a critical operation. An automatic control system is required to operate the weapon with the target while maintaining the accuracy. In this paper has designed an automatic weapon control system using object image proccessing. Various an image processing methods used to improve the weapon accuracy to obtain the intended target. The method used in digital image processing is the Camshift motion tracking method. This method is compared with the Lucas Canade motion tracking method. This comparison is conducted to found more precise results between the two methods. Results of object image processing are used to control the direction of the weapon that towards the desired goal. The results show that the implementation of the Lucas Canade motion tracking method using fire simulation tools have been successful. The performance of the Lucas Canade motion tracking methods is better than the CamShift method. Using Lucas Canade method for weapon controller is accordance with the purposes.

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

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

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

  19. applying reinforcement learning to the weapon assignment problem ...

    African Journals Online (AJOL)

    ismith

    Intelligence (AI) and modern computational techniques, may hold the key to relieving the ... In his 2007 book, The Utility of Force – The Art of War in the Modern. World, General ..... The assignment problem is solved given the status of DAs, .... This was not a good policy, seeing that it did not take into account where the.

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

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

  2. Threat evaluation and weapon assignment decision support: A review of the state of the art

    Directory of Open Access Journals (Sweden)

    JN Roux

    2007-12-01

    Full Text Available In a military environment an operator is typically required to evaluate the tactical situation in real-time and protect defended assets against enemy threats by assigning available weapon systems to engage enemy craft. This environment requires rapid operational planning and decision making under severe stress conditions, and the associated responsibilities are usually divided between a number of operators and computerized decision support systems that aid these operators during the decision making processes. The aim in this paper is to review the state of the art of this kind of threat evaluation and weapon assignment decision support process as it stands within the context of a ground based air defence system (GBADS at the turn of the twenty first century. However, much of the contents of the paper may be generalized to military environments other than a GBADS one.

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

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

  5. New assignment algorithms for data association

    Science.gov (United States)

    Castanon, David A.

    1992-08-01

    This paper presents an overview of new classes of algorithms for the algorithm concepts for the solution of combinatorial optimization problems arising in data association. These algorithms are based on extensions of Bertsekas' auction algorithm. The paper includes experimental results using these algorithms and a modification of the algorithm of Jonker and Volgenant on 2-dimensional measurement-track data association problems in the presence of false alarms, missed detections, sensor bias noise, and sensor measurement noise. The results indicate that some of the new algorithms are very efficient for the solution of these data association problems.

  6. A new algorithm for reliable and general NMR resonance assignment.

    Science.gov (United States)

    Schmidt, Elena; Güntert, Peter

    2012-08-01

    The new FLYA automated resonance assignment algorithm determines NMR chemical shift assignments on the basis of peak lists from any combination of multidimensional through-bond or through-space NMR experiments for proteins. Backbone and side-chain assignments can be determined. All experimental data are used simultaneously, thereby exploiting optimally the redundancy present in the input peak lists and circumventing potential pitfalls of assignment strategies in which results obtained in a given step remain fixed input data for subsequent steps. Instead of prescribing a specific assignment strategy, the FLYA resonance assignment algorithm requires only experimental peak lists and the primary structure of the protein, from which the peaks expected in a given spectrum can be generated by applying a set of rules, defined in a straightforward way by specifying through-bond or through-space magnetization transfer pathways. The algorithm determines the resonance assignment by finding an optimal mapping between the set of expected peaks that are assigned by definition but have unknown positions and the set of measured peaks in the input peak lists that are initially unassigned but have a known position in the spectrum. Using peak lists obtained by purely automated peak picking from the experimental spectra of three proteins, FLYA assigned correctly 96-99% of the backbone and 90-91% of all resonances that could be assigned manually. Systematic studies quantified the impact of various factors on the assignment accuracy, namely the extent of missing real peaks and the amount of additional artifact peaks in the input peak lists, as well as the accuracy of the peak positions. Comparing the resonance assignments from FLYA with those obtained from two other existing algorithms showed that using identical experimental input data these other algorithms yielded significantly (40-142%) more erroneous assignments than FLYA. The FLYA resonance assignment algorithm thus has the

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

  8. Performance comparison of 2D assignment algorithms for assigning truth objects to measured tracks

    Science.gov (United States)

    Levedahl, Mark

    2000-07-01

    The processing time requirements of several algorithms for solving the 2-d (also called single frame) linear assignment problem are compared, along with their accuracy given either random or biased measurement errors. The specific problem considered is that of assigning measurements to truth objects using costs that are the chi-squared distances between them. Performance comparisons are provided for the algorithms implemented both in a compiled language C or FORTRAN) as well as the interpretive MatLab language. Accuracy considerations show optimal assignment algorithm is preferred if biased measurement errors are present. The Jonker-Volgenant-Castanon (JVC) algorithm is the preferred approach considering both average and maximum solution time. The Auction algorithm finds favor due to being both efficient as well as easy to understand, but is never faster and often much slower than the JVC algorithm. Both algorithms are dramatically faster than the Munkres algorithm. The greedy nearest neighbor algorithm is an ad hoc solution to provide a sub-optimal but unique solution more cheaply than the optimal assignment algorithms. However, the JVC algorithm is as fast as the greedy for simple problems, marginally slower at hard problems, and is vastly more accurate in the presence of measurement biases.

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

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

  11. A Weapon Target Assignment Model Based on Weapon Utility%一种基于武器效用的武器目标分配模型

    Institute of Scientific and Technical Information of China (English)

    王金山; 李伟兵

    2015-01-01

    为解决武器优化分配中存在的2个问题,提出一种基于武器效用的武器目标分配模型。通过两类武器的效用分析,把目标达到期望毁伤概率作为武器效用最大的起点,设置两类武器的效用函数,以最大武器效用为准则,建立武器分配的线性整数规划模型,并对比2种模型的结果。实践结果证明:新模型求解分配的速度快耗时短,可满足战场需求,且结果更加合理。%In order to overtake two problems in weapon optimal assignment, propose a weapon target assignment model based on weapon utility. By two type weapons utility analysis, set expected kill probability as the start point of maximum weapon utility, and set utility function of two type weapons, takes maximum weapon utility as rule, establish linear integer planning model, and compare the results of two models. The practice results show that the new model has fast speed on solution distribution and use less time. It meets the battlefield requirements and has more reasonable results.

  12. Geometry-Of-Fire Tracking Algorithm for Direct-Fire Weapon Systems

    Science.gov (United States)

    2015-09-01

    NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS Approved for public release; distribution is unlimited GEOMETRY-OF- FIRE ...TRACKING ALGORITHM FOR DIRECT- FIRE WEAPON SYSTEMS by Caleb K. Khan September 2015 Thesis Advisor: Zachary Staples Co-Advisor: Xiaoping...2015 3. REPORT TYPE AND DATES COVERED Master’s Thesis 4. TITLE AND SUBTITLE GEOMETRY-OF- FIRE TRACKING ALGORITHM FOR DIRECT- FIRE WEAPON SYSTEMS

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

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

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

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

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

  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. Algorithms for selecting informative marker panels for population assignment.

    Science.gov (United States)

    Rosenberg, Noah A

    2005-11-01

    Given a set of potential source populations, genotypes of an individual of unknown origin at a collection of markers can be used to predict the correct source population of the individual. For improved efficiency, informative markers can be chosen from a larger set of markers to maximize the accuracy of this prediction. However, selecting the loci that are individually most informative does not necessarily produce the optimal panel. Here, using genotypes from eight species--carp, cat, chicken, dog, fly, grayling, human, and maize--this univariate accumulation procedure is compared to new multivariate "greedy" and "maximin" algorithms for choosing marker panels. The procedures generally suggest similar panels, although the greedy method often recommends inclusion of loci that are not chosen by the other algorithms. In seven of the eight species, when applied to five or more markers, all methods achieve at least 94% assignment accuracy on simulated individuals, with one species--dog--producing this level of accuracy with only three markers, and the eighth species--human--requiring approximately 13-16 markers. The new algorithms produce substantial improvements over use of randomly selected markers; where differences among the methods are noticeable, the greedy algorithm leads to slightly higher probabilities of correct assignment. Although none of the approaches necessarily chooses the panel with optimal performance, the algorithms all likely select panels with performance near enough to the maximum that they all are suitable for practical use.

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

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

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

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

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

  15. Heterogeneous Defensive Naval Weapon Assignment To Swarming Threats In Real Time

    Science.gov (United States)

    2016-03-01

    four incoming targets to be countered with two multi-domain capable RAM launchers, the average model solve time using Microsoft Excel VBA for pre...Microsoft Visual Basic for Applications ( VBA ) code is used to pre-process all input data and calculations required for the model , formulate the MIP and...providing the operator with recommended weapon-target pairings based on current defensive capabilities and threat profiles. The model consists of a pre

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

  17. Applying reinforcement learning to the weapon assignment problem in air defence

    CSIR Research Space (South Africa)

    Mouton, H

    2011-12-01

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

  18. Thermal weapon sights with integrated fire control computers: algorithms and experiences

    Science.gov (United States)

    Rothe, Hendrik; Graswald, Markus; Breiter, Rainer

    2008-04-01

    The HuntIR long range thermal weapon sight of AIM is deployed in various out of area missions since 2004 as a part of the German Future Infantryman system (IdZ). In 2007 AIM fielded RangIR as upgrade with integrated laser Range finder (LRF), digital magnetic compass (DMC) and fire control unit (FCU). RangIR fills the capability gaps of day/night fire control for grenade machine guns (GMG) and the enhanced system of the IdZ. Due to proven expertise and proprietary methods in fire control, fast access to military trials for optimisation loops and similar hardware platforms, AIM and the University of the Federal Armed Forces Hamburg (HSU) decided to team for the development of suitable fire control algorithms. The pronounced ballistic trajectory of the 40mm GMG requires most accurate FCU-solutions specifically for air burst ammunition (ABM) and is most sensitive to faint effects like levelling or firing up/downhill. This weapon was therefore selected to validate the quality of the FCU hard- and software under relevant military conditions. For exterior ballistics the modified point mass model according to STANAG 4355 is used. The differential equations of motions are solved numerically, the two point boundary value problem is solved iteratively. Computing time varies according to the precision needed and is typical in the range from 0.1 - 0.5 seconds. RangIR provided outstanding hit accuracy including ABM fuze timing in various trials of the German Army and allied partners in 2007 and is now ready for series production. This paper deals mainly with the fundamentals of the fire control algorithms and shows how to implement them in combination with any DSP-equipped thermal weapon sights (TWS) in a variety of light supporting weapon systems.

  19. Some recent results in the analysis of greedy algorithms for assignment problems

    NARCIS (Netherlands)

    Faigle, U.

    1994-01-01

    We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs, probabilistic analysis for linear assignment and

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

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

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

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

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

  5. Study of Direction Probability and Algorithm of Improved Marriage in Honey Bees Optimization for Weapon Network System

    Institute of Scientific and Technical Information of China (English)

    YANG Chen-guang; TU Xu-yan; CHEN Jie

    2009-01-01

    To solve the weapon network system optimization problem against small raid objects with low attitude, the concept of direction probability and a new evaluation index system are proposed. By calculating the whole damaging probability that changes with the defending angle, the efficiency of the whole weapon network system can be subtly described. With such method, we can avoid the inconformity of the description obtained from the traditional index systems. Three new indexes are also proposed, I.e. Join index, overlap index and cover index, which help manage the relationship among several sub-weapon-networks. By normalizing the computation results with the Sigmoid function, the matching problem between the optimization algorithm and indexes is well settled. Also, the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem. Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.

  6. 舰炮对空射击火力分配模型研究%Weapon target assignment model of navy gun's anti-aircraft firing

    Institute of Scientific and Technical Information of China (English)

    田峰; 白江

    2011-01-01

    To deal with weapon target assignment of navy guns' anti-aircraft firing in air defense operations, based on the combat capability of navy guns, the threatening trend of air targets, weapon target assignment and firing time distribution, dynamic weapon target assignment was applied to analyze primarily the effect of firing time on damage probability. At last, based on weight function and damage probability P(t), the objective function and the distribution model of firing time were calculated. The result provides some reference for theoretical analysis and practical application of navy guns' anti-aircraft firing.%为解决防空作战中舰炮对空射击火力分配问题,综合考虑舰炮武器的作战能力和空中目标的威胁态势,结合武器目标分配和射击时机分配,采用动态火力分配研究方法,重点分析了射击时机对毁伤概率的影响.结合权重函数与毁伤概率P(t)的分布律,最终计算出了射击时机目标函数和射击时机分配模型.该研究成果对于舰炮对空射击的理论分析和实际运用提供了参考.

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

  9. Two Planning Models and Solving Method of Sensor/Weapon-Target Assignment Problem%传感器/武器——目标分配问题的两种规划模型及求解

    Institute of Scientific and Technical Information of China (English)

    杨晓凌; 邱涤珊; 黄维; 彭黎

    2012-01-01

    Sensor /Weapon-Target Assignment (S/WT A) Problem is proposed on the basis of Weapon-Target Assignment (WTA) Problem by analyzing the relationship between Sensor-Target Assignment (STA) and WTA. Two planning models of S/WTA is given according to the computation methods of the probability that a target is damaged. The target sets to which weapons are assigned contains all the targets possibly captured by sensors in one of the models, but in the other model only the expected target set captured by sensors is hit by weapons. Based on the feature of the models,two novelty genetic operators are designed for solving the problem by genetic algorithm. Finally,the two planning models are validated through a numerical example.%通过分析现代火力打击作战中传感器——目标分配与武器——目标分配间的相互关系,在武器——目标分配问题基础上提出了传感器/武器——目标分配问题.依据目标被毁伤概率的两种计算方法,给出了该问题的两种规划模型,在武器目标分配时一种模型考虑所有可能被截获的目标,而另一种模型则只考虑被传感器截获的期望目标集合.根据模型特点在应用遗传算法对问题进行求解时,设计了异体交换算子和段内交换算子等两种新的遗传操作算子.最后通过仿真算例对两种模型进行了验证.

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

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

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

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

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

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

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

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

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

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

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

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

  2. Boolean Networks-Based Auction Algorithm for Task Assignment of Multiple UAVs

    Directory of Open Access Journals (Sweden)

    Xiaolei Sun

    2015-01-01

    Full Text Available This paper presents an application of Boolean networks-based auction algorithm (BNAA for task assignment in unmanned aerial vehicles (UAVs systems. Under reasonable assumptions, the assignment framework consists of mission control system, communication network, and ground control station. As the improved algorithm of consensus-based bundle algorithm (CBBA, the BNAA utilizes a cluster-based combinatorial auction policy to handle multiple tasks. Instead of empirical method based on look-up table about conditional variables, Boolean network is introduced into consensus routine of BNAA for solving the conflict of assignment across the fleet of UAVs. As a new mathematic theory, semitensor product provides the implementation and theoretical proof of Boolean networks. Numerical results demonstrate the effectiveness and efficiency of proposed BNAA method.

  3. Simulated annealing algorithm for solving chambering student-case assignment problem

    Science.gov (United States)

    Ghazali, Saadiah; Abdul-Rahman, Syariza

    2015-12-01

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

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

  5. 坦克分队动态火力优化配置建模%Research on the Model of Dynamic Weapon Target Assignment for Tank Unit

    Institute of Scientific and Technical Information of China (English)

    徐克虎; 黄大山; 王天召

    2013-01-01

      充分考虑信息化战场上坦克分队战斗中我方作战单元、目标及战场环境等因素的影响,依据火力单元的战场感知能力、射击命中概率与目标的防护能力、战场价值确定射击价值,依据火力单元的战场机动时间和射击预留时间确定射击时机,建立动态火力优化配置模型。%The weapon and environment features in informationization battlefield have been considered sufficiently to analyse shooting value and shooting time. The shooting value was determined by the battlefield awareness ability and hit probability of fire unit and the protection ability and battlefield value of target. The shooting time was determined by the appointed-motion time and scheduled time of fire unit. The model of dynamic weapon target assignment has been established based on the two above-mentioned elements.

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

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

    Directory of Open Access Journals (Sweden)

    Eric J. Nava

    2012-03-01

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

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

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

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

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

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

  13. An algorithm research of ship formotion's cooperatine anti- air weapons distribution optimitation%舰艇编队协同防空武器优化分配算法

    Institute of Scientific and Technical Information of China (English)

    窦强; 马英超; 王海川

    2012-01-01

    In order to improve the ship formation' s cooperative anti-air weapons efficiency, a 0-1 planning model for weapon optimal assignment and GA steps to solve it have been built based on the Principle of handling the most targets in the shortest time. Calculation shows that, the 0-1 planning model and GA steps have strong adaptability and fast convergence rate. The algorithm gives an effective method to solve large scale ship formation' s weapon assignment problems.%为提高舰艇编队协同防空武器的使用效率,基于最短时间内毁伤最多目标的原则,建立了武器优化分配的0-1规划模型,并给出了遗传算法求解该模型的具体步骤.计算表明,0-1规划模型及遗传算法具有适应性强、收敛速度快等优点.算法为解决舰艇编队较大规模武器优化分配问题提供了一种有效的方法.

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

  15. Particle Swarm Optimization Based on Creative Thinking for Solving Weapon Target Assignment Problem%创造性思维粒子群优化的武器目标分配

    Institute of Scientific and Technical Information of China (English)

    刘振林; 唐苏妍; 葛伟

    2012-01-01

    现代战争特点为防空作战中武器目标分配(WTA)问题的求解效率和质量提出了新的需求和挑战.建立了WTA问题模型,并选择粒子群优化算法(PSO)求解模型.针对PSO算法在求解WTA模型中出现的早熟收敛特性,从认知心理学角度进行分析,将创造性思维(CT)引入PSO的速度更新公式中,提出了一种基于创造性思维的PSO算法CTPSO.针对WTA模型的离散性特点,设计了编码与解码策略,及位置和速度矢量的离散化运算规则.实验证明了CTPSO算法在WTA问题求解质量和求解效率方面的优越性.%Because of new characteristics of modern warfare new requirements and challenges of Weapon Target Assignment (WTA) in air defense warfare are put forward. A WTA model is designed, and Particle Swarm Optimization (PSO) algorithm is chosen to solve it. PSO suffers from the premature convergence problem in solving WTA. To solve this problem, PSO algorithm is analyzed from cognitive psychology and CTPSO algorithm is proposed by introducing CT to the evolution model of PSO. According to the discreteness in WTA model, discrete strategies are designed by setting the coding and decoding rules,and the operation rules for particles' velocity and positions. Experimental results show that CTPSO has priority in solution quality and convergence rate.

  16. Taboo search algorithm for item assignment in synchronized zone automated order picking system

    Science.gov (United States)

    Wu, Yingying; Wu, Yaohua

    2014-07-01

    The idle time which is part of the order fulfillment time is decided by the number of items in the zone; therefore the item assignment method affects the picking efficiency. Whereas previous studies only focus on the balance of number of kinds of items between different zones but not the number of items and the idle time in each zone. In this paper, an idle factor is proposed to measure the idle time exactly. The idle factor is proven to obey the same vary trend with the idle time, so the object of this problem can be simplified from minimizing idle time to minimizing idle factor. Based on this, the model of item assignment problem in synchronized zone automated order picking system is built. The model is a form of relaxation of parallel machine scheduling problem which had been proven to be NP-complete. To solve the model, a taboo search algorithm is proposed. The main idea of the algorithm is minimizing the greatest idle factor of zones with the 2-exchange algorithm. Finally, the simulation which applies the data collected from a tobacco distribution center is conducted to evaluate the performance of the algorithm. The result verifies the model and shows the algorithm can do a steady work to reduce idle time and the idle time can be reduced by 45.63% on average. This research proposed an approach to measure the idle time in synchronized zone automated order picking system. The approach can improve the picking efficiency significantly and can be seen as theoretical basis when optimizing the synchronized automated order picking systems.

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

  18. Geometry-of-fire tracking algorithm for direct-fire weapon systems

    OpenAIRE

    Khan, Caleb K.

    2015-01-01

    Approved for public release; distribution is unlimited The continuous cycle for validating geometry of fires on a battlefield impedes momentum. A force that can decide and act quicker than the enemy has an advantage. The goal of this thesis is to provide dismounted infantry units with this advantage by developing a sensor network that streamlines the geometry-of-fire validation cycle for direct-fire weapon systems. This is the first attempt to develop technology for this specific applicati...

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

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

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

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

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

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

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

  6. 基于不完全信息空战的火力分配建模与应用%Research on Weapon-Target Assignment Modeling and Application Based on Incomplete Information Air Combat

    Institute of Scientific and Technical Information of China (English)

    隋永华; 郭雷; 俞利新; 王海晏

    2012-01-01

    To solve the problem of weapon-target assignment in an incomplete information air combat, the common weapon-target assignment model is analized, the defect of which is pointed out, and an improved weapon-target assignment model is built. The computation method of the key arguments of the model is proposed according to the character of incomplete information air combat. The improved mode can work efficiently based on the limited papameters obtained easily in the condition of incomplete information. Finally,the efficiency of the model is validated through a typical air combat example.%为了解决不完全信息空战中的火力分配问题,分析了常规空战火力分配模型,指出了其中的不足,建立了一种改进的火力分配模型.针对不完全信息空战特点,给出了其中关键参数的确定方法.该改进模型可有效利用战机在不完全信息条件下容易获取的有限参数进行火力分配,具有很强的实用性.最后通过典型应用实例验证了模型的有效性.

  7. Research on Weapon Target Assignment for Surface Warship Formation with Cooperative Engagement Capability%CEC条件下舰艇编队目标武器分配研究

    Institute of Scientific and Technical Information of China (English)

    王玮; 董天忠; 张玉芝

    2009-01-01

    在分析CEC条件下舰艇编队目标武器分配模式的基础上,综合运用MAS理论与方法,建立了舰艇编队目标武器分配MAS模型,即利用Agent描述舰艇编队的各种物理资源或逻辑资源,通过网络及Agent通讯协议将多个Agent连接成一个整体系统,设计了映射实体功能的Agent结构,从而为舰艇编队目标武器分配决策提供了一条新途径.%On the base of analyzing the mode of weapon target assignment for surface warship formation with cooperative engagement capability, a MAS model of the weapon target assignment for warship formation is proposed by means of the MAS theory and method, it is described which includes all kinds of physical or logical resource by the Agent, many agent subsystem is connected into a integrated system through network and communication protocols of the Agent. The Agent structure of a mapping entity functions has been designed, therefore provide a new way for the decision of the weapon target assignment for warship formation.

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

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

    2014-01-01

    A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR 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 solid-state NMR 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

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

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

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

  13. An Adaptive H infinity Control Algorithm for Jitter Control and Target Tracking in a Directed Energy Weapon

    Science.gov (United States)

    2012-05-16

    system, (2) free electron laser for weapons of mass destruction detection, (3) high power microwave weapon, (4) electric fiber weapon system, and (5...1980’s and 1990’s1. Free-space laser communication provides many advantages to traditional microwave communication: broader bandwidth, lower power...eliminate torsional and bending modes below approximately 200 Hz. The mass of the bread board is 71.3 kg. Figure 10 Newport Breadboard7 2.1.6

  14. Due Date Assignment in a Dynamic Job Shop with the Orthogonal Kernel Least Squares Algorithm

    Science.gov (United States)

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

    2017-06-01

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

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

  16. Cell Assignment in Hybrid CMOS/Nanodevices Architecture Using a PSO/SA Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Sadiq M. Sait

    2013-10-01

    anowire\\MOLecular Hybrid, higher circuit densities are possible. In CMOL there is an additional layer of nanofabric on top of CMOS stack. Nanodevices that lie between overlapping nanowires are programmable and can implement any combinational logic using a netlist of NOR gates. The limitation on the length of nanowires put a constraint on the connectivity domain of a circuit. The gates connected to each other must be within a connectivity radius; otherwise an extra buffer is inserted to connect them. Particle swarm optimization (PSO has been used in a variety of problems that are NP- hard. PSO compared to the other iterative heuristic techniques is simpler to implement. Besides, it delivers comparable results. In this paper, a hybrid of PSO and simulated annealing (SA for solving the cell assignment in CMOL, an NP-hard problem, is proposed. The proposed method takes advantage of the exploration and exploitation factors of PSO and the intrinsic hill climbing feature of SA to reduce the number of buffers to be inserted. Experiments conducted on ISCAS'89 benchmark circuits and a comparison with other heuristic techniques, are presented. Results showed that the proposed hybrid algorithm achieved better solution in terms of buffer count in reasonable time.

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

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

  19. Hybrid routing and spectrum assignment algorithms based on distance-adaptation combined coevolution and heuristics in elastic optical networks

    Science.gov (United States)

    Ding, Zhe; Xu, Zhanqi; Zeng, Xiaodong; Ma, Tao; Yang, Fan

    2014-04-01

    By adopting the orthogonal frequency division multiplexing technology, spectrum-sliced elastic optical path networks can offer flexible bandwidth to each connection request and utilize the spectrum resources efficiently. The routing and spectrum assignment (RSA) problems in SLICE networks are solved by using heuristic algorithms in most prior studies and addressed by intelligent algorithms in few investigations. The performance of RSA algorithms can be further improved if we could combine such two types of algorithms. Therefore, we propose three hybrid RSA algorithms: DACE-GMSF, DACE-GLPF, and DACE-GEMkPSF, which are the combination of the heuristic algorithm and coevolution based on distance-adaptive policy. In the proposed algorithms, we first groom the connection requests, then sort the connection requests by using the heuristic algorithm (most subcarriers first, longest path first, and extended most k paths' slots first), and finally search the approximately optimal solution with the coevolutionary policy. We present a model of the RSA problem by using integral linear programming, and key elements in the proposed algorithms are addressed in detail. Simulations under three topologies show that the proposed hybrid RSA algorithms can save spectrum resources efficiently.

  20. Comparative Analysis of Existing Methods and Algorithms for Automatic Assignment of Reviewers to Papers

    CERN Document Server

    Kalmukov, Yordan

    2010-01-01

    The article focuses on the importance of the automatic assignment of reviewers to papers for increasing the assignment accuracy therefore the quality of the scientific event itself. It discusses the main aspects that influence the assignment accuracy, performs a detailed analysis of the methods of describing papers and reviewers' competences used by the existing conference management systems and suggests some improvements in the way the similarity factors are calculated.

  1. An approach of basing - on fuzzy, grey noncooperative Nash games to multi- team dynamic weapon- target assignment%基于模糊-灰色非合作Nash博弈的多组动态武器-目标分配方法

    Institute of Scientific and Technical Information of China (English)

    张毅; 姜青山; 陈国生

    2012-01-01

    Aiming at the uncertainties in weapon - target assignment ( WTA), a kind of oppositive multi - team dynamic WTA( MT- DWTA) problem is studied. Firstly,the oppositive MT- DWTA model is built. Sec- ondly, with distance discount factor (DDF) and fuzzy - grey target relative value and team Nash pair of strategies, a model of MT - DWTA is formed basing on fuzzy - grey noncooperative Nash games. And then the MT - DWTA model is transformed into quadratic programming problem. Finally, a kind of genetic algorithm (GA) and ant colo- ny optimization(ACO) with cyclic multiexehange(CME) heuristic algorithm is designed to solve a more large - scale MT- DWTA problem, and the simulation result shows that new algorithm can solve it in a short time%针对武器-目标分配(weapon-targetassignment,WTA)中的不确定性因素,研究了一类对抗性质的多组动态WTA(muhi-teamdynamicWTA,MT-DWTA)问题.首先,构建了对抗性质的MT-DWTA模型;其次,引入距离折算因子、模糊一灰色的目标相对价值和组Nash策略对的概念,构建了模糊-灰色非合作Nash博弈的MT-DWTA模型;然后,把该模型转化为二次规划模型;最后,设计一种循环多次交换启发式遗传-蚁群优化算法,仿真结果表明新算法能够在较短时间内求解较大规模的MT-DWTA的优化问题.

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

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

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

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

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

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

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

  9. Special Weapons

    Data.gov (United States)

    Federal Laboratory Consortium — Supporting Navy special weapons, the division provides an array of engineering services, technical publication support services, logistics support services, safety...

  10. ProDomAs, protein domain assignment algorithm using center-based clustering and independent dominating set.

    Science.gov (United States)

    Ansari, Elnaz Saberi; Eslahchi, Changiz; Pezeshk, Hamid; Sadeghi, Mehdi

    2014-09-01

    Decomposition of structural domains is an essential task in classifying protein structures, predicting protein function, and many other proteomics problems. As the number of known protein structures in PDB grows exponentially, the need for accurate automatic domain decomposition methods becomes more essential. In this article, we introduce a bottom-up algorithm for assigning protein domains using a graph theoretical approach. This algorithm is based on a center-based clustering approach. For constructing initial clusters, members of an independent dominating set for the graph representation of a protein are considered as the centers. A distance matrix is then defined for these clusters. To obtain final domains, these clusters are merged using the compactness principle of domains and a method similar to the neighbor-joining algorithm considering some thresholds. The thresholds are computed using a training set consisting of 50 protein chains. The algorithm is implemented using C++ language and is named ProDomAs. To assess the performance of ProDomAs, its results are compared with seven automatic methods, against five publicly available benchmarks. The results show that ProDomAs outperforms other methods applied on the mentioned benchmarks. The performance of ProDomAs is also evaluated against 6342 chains obtained from ASTRAL SCOP 1.71. ProDomAs is freely available at http://www.bioinf.cs.ipm.ir/software/prodomas. © 2014 Wiley Periodicals, Inc.

  11. Prediction of the wounded and rescue algorithm for emergent events during destruction of Japanese-abandoned chemical weapons(JACW in transportable system

    Directory of Open Access Journals (Sweden)

    Yue-cheng YU

    2011-05-01

    Full Text Available Objective To explore the potential injuries and amount of the wounded during destruction of JACW in transportable system(TSD,thereby to formulate the rational allocation of medical staff at the scene and the scientific algorithm of medical rescue in emergent events.Methods Prediction of the different injuries and amount of the wounded,allocation of the force for emergency medical rescue(EMR,and EMR algorithm were formulated based on the detailed investigation on the types of chemical weapons,working processes and risks during the elimination of JACW in the TSD background.Results The JACW in Nanjing Depository were diphenylcyanarsine,diphenylchloroarsine,chloroacetophenone,mustard gas and lewisite,among them the foremost two were in the majority.Red tanks containing the chemical toxicants are the main types of chemical weapons in warfare,and there were also a few chemical bombs.It was estimated that four to seven workers might be injured in one accident,of them two or three might be seriously injured.The types of injury might be due to intoxication of chemical agent,chemical burn,explosion injury,or combined injuries.The rational allocation of EMR force combined with the scientific rescue algorithm was made according to the information.Conclusions It is of great significance to scientifically allocate the EMR force and formulate algorithm based on the rational prediction of the types and amount of the wounded during elimination process of JACW with TSD in Nanjing.Theory and experience from this research will provide important reference for the same kind of work in other cities later.

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

  13. [Biological weapons].

    Science.gov (United States)

    Kerwat, K; Becker, S; Wulf, H; Densow, D

    2010-08-01

    Biological weapons are weapons of mass destruction that use pathogens (bacteria, viruses) or the toxins produced by them to target living organisms or to contaminate non-living substances. In the past, biological warfare has been repeatedly used. Anthrax, plague and smallpox are regarded as the most dangerous biological weapons by various institutions. Nowadays it seems quite unlikely that biological warfare will be employed in any military campaigns. However, the possibility remains that biological weapons may be used in acts of bioterrorism. In addition all diseases caused by biological weapons may also occur naturally or as a result of a laboratory accident. Risk assessment with regard to biological danger often proves to be difficult. In this context, an early identification of a potentially dangerous situation through experts is essential to limit the degree of damage. Georg Thieme Verlag KG Stuttgart * New York.

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

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

    Directory of Open Access Journals (Sweden)

    Lubos Nagy

    2013-01-01

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-03-15

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

  18. 一种动态个人最优交通分配的启发式方法%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.

  19. 基于一种改进粒子群算法的水下远程武器航路规划%Route Planning of Underwater Long-range Weapon Based on an Improved PSO Algorithm

    Institute of Scientific and Technical Information of China (English)

    初磊; 纪金耀; 罗笛

    2011-01-01

    An improved particle swarm optimization (PSO) algorithm with particle exchanging is proposed to solve the problem of moving back in the route planning of underwater long-range weapon based on basic PSO. Combining the route planning model of the underwater long-range weapon, this improved PSO algorithm is used in a combat simulation system of a certain long-range weapon. Simulation result shows that this algorithm can enhance the effect of the route planning and be helpful to the operational application of the long-range weapon.%针对水下远程武器航路规划中,采用基本粒子群算法避障出现的航路倒退问题,提出了一种借鉴遗传算法采用粒子对换的改进粒子群优化(PSO)算法,并结合远程武器的航路规划设计模型,应用于水下武器作战仿真系统.计算结果表明,该算法可有效提高远程武器航路规划避障的计算效果,对水下远程武器的作战使用研究具有一定的参考价值.

  20. QUANTUM BEHAVIOUR PARTICLE SWARM OPTIMISATION APPLIED TO WEAPON TARGET ASSIGNMENT PROBLEM%应用于武器-目标分配问题的量子行为粒子群优化算法

    Institute of Scientific and Technical Information of China (English)

    李欣然; 靳雁霞

    2012-01-01

    WTA problem is vital in modern warfare. The WTA model is built aiming at minimum failure probability in allocating weapons for shooting all the targets. This paper puts forward a quantum behaviour particle swarm optimisation algorithm with inertia weight adaptive adjustment to overcome the deficiencies of premature convergence and low optimisation efficiency the existing algorithm has in solving such kind of problems. First, the concept of focusing distance changing rate is introduced, the inertial weight factor is formulated as the function of focusing distance rate so as to provide the algorithm with dynamic adaptability. Meanwhile, an effective method of judging and preventing premature and stagnation is embedded into the algorithm. The optimisation example shows that this algorithm can effectively solve the WTA problems.%武器一目标分配(WTA)问题是现代战争中一个十分重要的问题.以分配武器迎击全部目标的失败概率最小为目标,构建武器一目标分配问题模型;针对已有算法求解这类问题存在的早熟收敛、优化效率较低的缺点,提出一种惯性权重自适应调整的量子行为粒子群优化算法.首先引入聚焦距离变化率的概念,将惯性权重因子表示为关于聚焦距离变化率的函数,从而使算法具有动态自适应性;同时在算法中嵌入一种判断和避免搜索早熟和停滞的有效方法.优化实例的结果分析表明,该算法能有效地解决武器-目标分配问题.

  1. A General Firepower Optimization Algorithm for Shipboard Air Defense Hard Weapon%一种通用型舰载防空硬武器火力优化算法∗

    Institute of Scientific and Technical Information of China (English)

    林桦; 王公宝

    2016-01-01

    针对当前武器优化分配算法缺少通用性,难以兼顾效率和时间的问题,提出了一种通用型舰载防空硬武器火力优化算法。该算法首先提取各舰载武器能够攻击的目标集合,然后对各武器的目标集合逐一进行时间分配,并计算对目标的毁伤概率,最终完成所有武器的分配。计算表明,该算法具有很好的通用性和实时性,可适用于较大规模舰载防空硬武器的火力优化分配问题。%Currently, weapon optimization algorithm is lack of generality, and it is difficult to balance the efficiency and time. To solve this problem, a general firepower optimization algorithm for shipboard air defense hard weapons is presented. The algorithm first extracts the target set of each shipboard weapon to attack, and then carries on the time allocation to each weapon�s target set one by one, and calculates the damage probability to the target, finally completes the distribution of all weapons. The calculation shows that the proposed algorithm is very general and real⁃time, which can be adapted to the fire⁃power optimization allocation problem of large scale shipboard air defense hard weapons.

  2. 3D imaging by fast deconvolution algorithm in short-range UWB radar for concealed weapon detection

    NARCIS (Netherlands)

    Savelyev, T.; Yarovoy, A.

    2013-01-01

    A fast imaging algorithm for real-time use in short-range (ultra-wideband) radar with synthetic or real-array aperture is proposed. The reflected field is presented here as a convolution of the target reflectivity and point spread function (PSF) of the imaging system. To obtain a focused 3D image, t

  3. 3D imaging by fast deconvolution algorithm in short-range UWB radar for concealed weapon detection

    NARCIS (Netherlands)

    Savelyev, T.; Yarovoy, A.

    2013-01-01

    A fast imaging algorithm for real-time use in short-range (ultra-wideband) radar with synthetic or real-array aperture is proposed. The reflected field is presented here as a convolution of the target reflectivity and point spread function (PSF) of the imaging system. To obtain a focused 3D image,

  4. Optimization of Aimpoints for Coordinate Seeking Weapons

    Science.gov (United States)

    2015-09-01

    process. The program works by first taking in the number of weapons used and arranging them in a fixed uniform spacing on a circle centered on the...MATLAB program is used as the coding tool for the development of this algorithm and the optimization process. The program works by first taking in the...number of weapons used and arranging them in a fixed uniform spacing on a circle centered on the assumed target location. Then, the weapon

  5. 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 难题,提出了基于萤火虫算法的雷达目标分配方法,将雷达目标分配问题分解为多维背包问题,使用人工萤火虫群优化算法对目标函数进行寻优并确定分配策略。仿真结果表明,萤火虫算法在解决雷达目标分配问题时具有收敛速度快,求解结果稳定的优点,在军事运筹领域具有广泛的应用前景。

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

  7. Detecting necessary and sufficient parts for assembling a functional weapon

    Science.gov (United States)

    Hempelmann, Christian F.; Solomon, Divya; Arslan, Abdullah N.; Attardo, Salvatore; Blount, Grady P.; Adkins, Tracy; Sirakov, Nikolay M.

    2017-05-01

    Continuing our previous research to visually extract and visually and conceptually match weapons, this study develops a method to determine whether a set of weapon parts visually extracted from images taken from different scenes can be assembled as a firing weapon. This new approach identifies potential weapons in the ontology via tracing detected necessary and sufficient parts through their meronymic relation to the whole weapon. A fast algorithm for identifying potential weapons that can be assembled from a given set of detected parts is presented.

  8. 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 .%频率分配是指为用频台站合理的频率分配,使相互之间不产生干扰或者干扰最小,是军事电磁频谱管理的基础性内容。建立了基于干扰最小的频率分配数学模型,提出了基于遗传算法的频率分配算法,可以得到满足战场分配需求的多个分配组合。

  9. 改进蚁群算法在二次分配问题中的应用%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.

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

  11. Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem

    Institute of Scientific and Technical Information of China (English)

    Yu Xue; Yi Zhuang; Tianquan Ni; Siru Ni; Xuezhi Wen

    2014-01-01

    Cooperative jamming weapon-target assignment (CJWTA) problem is a key issue in electronic countermeasures (ECM). Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution (SLDDE) algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.

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

  13. 基于拍卖算法的多机协同火力分配%Multi-aircraft cooperative fire assignment based on auction algorithm

    Institute of Scientific and Technical Information of China (English)

    费爱国; 张陆游; 丁前军

    2012-01-01

    为解决超视距协同空战中的多机协同火力分配问题,首先建立了空战威胁估计和空战优势估计模型,构建了多机协同火力分配的数学模型.其次基于多智能体拍卖算法,提出了一种分布式的多机协同火力分配方法,该方法同时考虑了火力分配的效益和代价,能在较短的时间内给出较为合理的协同火力分配方案,具有计算量小、通信量低、动态性以及实时性好等特点,可应用于解决多机协同火力分配中的资源分配、冲突消解等协作问题.最后,通过仿真实验证明了该方法的合理性和有效性.%In order to solve the question of multi-aircraft cooperative fire assignment during beyond-visual-range cooperative air combat, firstly, the air combat threaten estimation model and superiority estimation model are built, and the mathematical model for multi-aircraft cooperative fire assignment is established. Secondly, based on the auction algorithm of the multi-agent system theory, a new distributed multi-aircraft cooperative fire assignment method is brought forward, and the fire assignment gain and cost are simultaneously considered. This method can get a reasonable cooperative fire assignment scheme within a short time, and has a low computation and communication burden, good dynamics and real-time characteristics. It can be used to solve the question of resource assignment and conflict elimination for the multi-aircraft cooperative fire assignment. Finally, the simulation results show that the method is reasonable and valid.

  14. Nuclear weapons modernizations

    Energy Technology Data Exchange (ETDEWEB)

    Kristensen, Hans M. [Federation of American Scientists, Washington, DC (United States)

    2014-05-09

    This article reviews the nuclear weapons modernization programs underway in the world's nine nuclear weapons states. It concludes that despite significant reductions in overall weapons inventories since the end of the Cold War, the pace of reductions is slowing - four of the nuclear weapons states are even increasing their arsenals, and all the nuclear weapons states are busy modernizing their remaining arsenals in what appears to be a dynamic and counterproductive nuclear competition. The author questions whether perpetual modernization combined with no specific plan for the elimination of nuclear weapons is consistent with the nuclear Non-Proliferation Treaty and concludes that new limits on nuclear modernizations are needed.

  15. 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.%为有效解决二次分配问题,提出了一种基于群体搜索的群智能优化算法—细菌觅食算法.算法模拟了细菌觅食全过程,并将细菌个体信息与探索细菌群体信息进行结合,采用了群体搜索策略进行局部寻优.该策略有效的避免了算法陷入局部最优,而算法中采用的自适应搜索步长,进一步提高了优化的收敛速度.实验结果表明,用细菌觅食算法解决二次分配问题,并将仿真结果与其他算法进行比较,表明了该算法的搜索质量优于其他算法.

  16. 二次分配问题的大洪水算法求解%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.

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

  18. The bicriterion multimodal assignment problem

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  19. Research on Reliability Optimization of Antiaircraft Weapon System Based on Heuristic Algorithm%启发式算法的防空武器系统可靠性优化

    Institute of Scientific and Technical Information of China (English)

    郭强; 蒋里强; 高建军

    2013-01-01

    针对复杂武器系统可靠性分配最优化问题,以系统的可靠度最大为目标函数,综合考虑系统的费用、质量等约束条件,建立了武器系统的可靠性冗余分配最优化模型,提出了基于启发式方法的求解算法,通过改进各级子系统的可靠性从而使总的系统可靠性最大.算法设计比较简便,易于编程实现.通过对防空武器系统的可靠性分配优化问题进行实例分析,结果表明算法是有效、实用的.为大型复杂武器系统的可靠性设计和优化研究提供了科学有效的方法.%Aiming at the reliability redundancy optimization allotment of the complicated weapon system, using the biggest reliability as the target value, synthesize expenses, quality .etc. to control as condition, the model optimization about the reliability redundancy optimization allotment of the weapon system is builded up; put forward the heuristic algorithm solving calculated way according to opposite increase quantity through. Tthe reliability that passes the improvement all levels subsystem makes the total system reliability biggest, carrying on a solid example analysis to the reliability redundancy optimization allotment of the antiaircraft weapon system.

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

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

  2. Computational Challenges in Nuclear Weapons Simulation

    Energy Technology Data Exchange (ETDEWEB)

    McMillain, C F; Adams, T F; McCoy, M G; Christensen, R B; Pudliner, B S; Zika, M R; Brantley, P S; Vetter, J S; May, J M

    2003-08-29

    After a decade of experience, the Stockpile Stewardship Program continues to ensure the safety, security and reliability of the nation's nuclear weapons. The Advanced Simulation and Computing (ASCI) program was established to provide leading edge, high-end simulation capabilities needed to meet the program's assessment and certification requirements. The great challenge of this program lies in developing the tools and resources necessary for the complex, highly coupled, multi-physics calculations required to simulate nuclear weapons. This paper describes the hardware and software environment we have applied to fulfill our nuclear weapons responsibilities. It also presents the characteristics of our algorithms and codes, especially as they relate to supercomputing resource capabilities and requirements. It then addresses impediments to the development and application of nuclear weapon simulation software and hardware and concludes with a summary of observations and recommendations on an approach for working with industry and government agencies to address these impediments.

  3. 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.%研究优化侦察效果问题,多侦察传感器训练演练任务中的侦察目标分配优劣直接影响着训练演练效果.为了提高侦察效能,通过分析传感器和目标的类别及数量,建立明确的目标函数,组成合理的仿真规划模型,采用遗传算法作为搜索最优方法,克服了传统算法缺点,能够快速而且有效地找出最大侦察效能下的目标分配方案.仿真结果表明,改进的方法为多传感器最佳侦察效果的相应训练演练提供了有益的帮助,节省了任务周期,降低了资源消耗.

  4. Nonstrategic Nuclear Weapons

    Science.gov (United States)

    2014-01-03

    William Potter , and Nikolai Sokov, Reducing and Regulating Tactical (Nonstrategic) Nuclear Weapons in Europe, The James Martin Center For...See William C. Potter and Nikolai Sokov, “Nuclear Weapons that People Forget,” International Herald Tribune, May 31, 2000. 87 Sam Nunn, Igor...their security.97 94 Kent Harris , “NATO Allies Want U.S. Nuclear Weapons out of Europe

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

  6. Reconversion of nuclear weapons

    CERN Document Server

    Kapitza, Sergei P

    1993-01-01

    The nuclear predicament or nuclear option. Synopsis of three lectures : 1- The physical basis of nuclear technology. Physics of fission. Chain reaction in reactors and weapons. Fission fragments. Separration of isotopes. Radiochemistry.2- Nuclear reactors with slow and fast neutrons. Power, size, fuel and waste. Plutonium production. Dose rate, shielding and health hazard. The lessons of Chernobyl3- Nuclear weapons. Types, energy, blast and fallout. Fusion and hydrogen bombs. What to do with nuclear weapons when you cannot use them? Testing. Nonmilittary use. Can we get rid of the nuclear weapon? Nuclear proliferation. Is there a nuclear future?

  7. Y-chromosomal haplogroup distribution in the Tuzla Canton of Bosnia and Herzegovina: A concordance study using four different in silico assignment algorithms based on Y-STR data.

    Science.gov (United States)

    Dogan, S; Babic, N; Gurkan, C; Goksu, A; Marjanovic, D; Hadziavdic, V

    2016-12-01

    Y-chromosomal haplogroups are sets of ancestrally related paternal lineages, traditionally assigned by the use of Y-chromosomal single nucleotide polymorphism (Y-SNP) markers. An increasingly popular and a less labor-intensive alternative approach has been Y-chromosomal haplogroup assignment based on already available Y-STR data using a variety of different algorithms. In the present study, such in silico haplogroup assignments were made based on 23-loci Y-STR data for 100 unrelated male individuals from the Tuzla Canton, Bosnia and Herzegovina (B&H) using the following four different algorithms: Whit Athey's Haplogroup Predictor, Jim Cullen's World Haplogroup & Haplogroup-I Subclade Predictor, Vadim Urasin's YPredictor and the NevGen Y-DNA Haplogroup Predictor. Prior in-house assessment of these four different algorithms using a previously published dataset (n=132) from B&H with both Y-STR (12-loci) and Y-SNP data suggested haplogroup misassignment rates between 0.76% and 3.02%. Subsequent analyses with the Tuzla Canton population sample revealed only a few differences in the individual haplogroup assignments when using different algorithms. Nevertheless, the resultant Y-chromosomal haplogroup distribution by each method was very similar, where the most prevalent haplogroups observed were I, R and E with their sublineages I2a, R1a and E1b1b, respectively, which is also in accordance with the previously published Y-SNP data for the B&H population. In conclusion, results presented herein not only constitute a concordance study on the four most popular haplogroup assignment algorithms, but they also give a deeper insight into the inter-population differentiation in B&H on the basis of Y haplogroups for the first time. Copyright © 2016 Elsevier GmbH. All rights reserved.

  8. 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)任务分配模型.其次,通过分析细菌觅食优化算法和粒子群优化算法的优缺点,提出一种具有较强全局搜索能力且收敛速度快的混合细菌觅食优化算法.最后将该算法应用于多无人机协同任务分配中并进行了仿真实验,仿真结果表明该方法在求解效率上比标准粒子群算法和标准细菌觅食算法有显著提高.

  9. Virtual nuclear weapons

    Energy Technology Data Exchange (ETDEWEB)

    Pilat, J.F.

    1997-08-01

    The term virtual nuclear weapons proliferation and arsenals, as opposed to actual weapons and arsenals, has entered in recent years the American lexicon of nuclear strategy, arms control, and nonproliferation. While the term seems to have an intuitive appeal, largely due to its cyberspace imagery, its current use is still vague and loose. The author believes, however, that if the term is clearly delineated, it might offer a promising approach to conceptualizing certain current problems of proliferation. The first use is in a reference to an old problem that has resurfaced recently: the problem of growing availability of weapon-usable nuclear materials in civilian nuclear programs along with materials made `excess` to defense needs by current arms reduction and dismantlement. It is argued that the availability of these vast materials, either by declared nuclear-weapon states or by technologically advanced nonweapon states, makes it possible for those states to rapidly assemble and deploy nuclear weapons. The second use has quite a different set of connotations. It is derived conceptually from the imagery of computer-generated reality. In this use, one thinks of virtual proliferation and arsenals not in terms of the physical hardware required to make the bomb but rather in terms of the knowledge/experience required to design, assemble, and deploy the arsenal. Virtual weapons are a physics reality and cannot be ignored in a world where knowledge, experience, materials, and other requirements to make nuclear weapons are widespread, and where dramatic army reductions and, in some cases, disarmament are realities. These concepts are useful in defining a continuum of virtual capabilities, ranging from those at the low end that derive from general technology diffusion and the existence of nuclear energy programs to those at the high end that involve conscious decisions to develop or maintain militarily significant nuclear-weapon capabilities.

  10. Neurotoxic Weapons and Syndromes.

    Science.gov (United States)

    Carota, Antonio; Calabrese, Pasquale; Bogousslavsky, Julien

    2016-01-01

    The modern era of chemical and biological warfare began in World War I with the large-scale production and use of blistering and choking agents (chlorine, phosgene and mustard gases) in the battlefield. International treaties (the 1925 Geneva Protocol, the 1975 Biological and Toxin Weapons Convention and the 1993 Chemical Weapons Convention) banned biological and chemical weapons. However, several countries are probably still engaged in their development. Hence, there is risk of these weapons being used in the future. This chapter will focus on neurotoxic weapons (e.g. nerve agents, chemical and biological neurotoxins, psychostimulants), which act specifically or preeminently on the central nervous system and/or the neuromuscular junction. Deeply affecting the function of the nervous system, these agents either have incapacitating effects or cause clusters of casualties who manifest primary symptoms of encephalopathy, seizures, muscle paralysis and respiratory failure. The neurologist should be prepared both to notice patterns of symptoms and signs that are sufficiently consistent to raise the alarm of neurotoxic attacks and to define specific therapeutic interventions. Additionally, extensive knowledge on neurotoxic syndromes should stimulate scientific research to produce more effective antidotes and antibodies (which are still lacking for most neurotoxic weapons) for rapid administration in aerosolized forms in the case of terrorist or warfare scenarios. © 2016 S. Karger AG, Basel.

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

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

  14. 多平台雷达有源干扰资源分配算法%Research on the Radar Active Jamming Resource Assignment Algorithm of Multi-platforms

    Institute of Scientific and Technical Information of China (English)

    吕明山; 姜宁

    2013-01-01

    根据现代干扰机特点,建立“多对多”雷达有源干扰资源分配数学模型,结合分配算法的具体应用环境,提出了基于多Agent分布协同拍卖的雷达干扰资源分配算法,实例表明该方法可行.%According to the multi-targets jamming characteristics of morden radar jammer,it constructs the mathematical model of radar active jamming resource assignment,and proposes the assignment algorithm based on multi-agents distributed cooperative auction combined with its concrete application conditions.The algorithm is proved to be feasible by an example.

  15. Operational research in weapon system

    Directory of Open Access Journals (Sweden)

    R. S. Varma

    1958-04-01

    Full Text Available "The paper is divided into three parts: (a The first part deals with what operational research is. (bThe second part gives what we mean by Weapon Systems and discusses considerations that determine the choice of a particular weapon system from a class weapon systems. (cThe third part deals with some aspects of weapon replacement policy.The effectiveness of a weapon system is defined as E=D/C where E is weapon effectiveness (a comparative figure of merit; D is total damage inflicted or prevented and C is total cost, D and C being reduced to common dimensions. During the course of investigations, criteria regarding to choice of weapon or weapons from a set of weapon systems are established through production function and military effect curves. A procedure is described which maximizes the expectation of military utility in order to select a weapon system from the class of weapon systems. This is done under the following simplifying assumptions: (a Non- decreasing utility function; (b Constant average cost for each kind of weapons; and (c Independence of the performance of each unit of weapon. Some of the difficulties which arises when any of these restrictions is relaxed are briefly mentioned. Finally, the policy of weapon replacement and the factors governing the same are described."

  16. 基于量子遗传算法的光电干扰资源优化分配研究%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.%结合光电信息系统作战运筹中目标分配原则,建立了干扰资源优化分配模型。给出了基于量子遗传算法的模型求解方法及步骤,并进行了实例仿真,得出了最佳干扰资源分配方案。仿真结果表明,该方法优于遗传算法,对于求解干扰资源优化分配模型是有效、可行的。

  17. Wounds and weapons

    Energy Technology Data Exchange (ETDEWEB)

    Vogel, H. [Asklepios Klinik St. Georg, Roentgenabteilung, Lohmuehlenstrasse 5, 20099 Hamburg (Germany)], E-mail: Hermann.vogel@ak-stgeorg.lbk-hh.de; Dootz, B. [Asklepios Klinik St. Georg, Roentgenabteilung, Lohmuehlenstrasse 5, 20099 Hamburg (Germany)

    2007-08-15

    Purpose: X-ray findings are described, which are typical for injuries due to conventional weapons. It is intended to demonstrate that radiographs can show findings characteristic for weapons. Material and method: The radiograms have been collected in Vietnam, Croatia, Serbia, Bosnia, Chad, Iran, Afghanistan, USA, Great Britain, France, Israel, Palestine, and Germany. Results: Radiograms of injuries due to hand grenades show their content (globes) and cover fragments. The globes are localized regionally in the victim's body. Survivors of cluster bombs show singular or few globes; having been hit by many globes would have been lethal. Shotguns produce characteristic distributions of the pallets and depth of penetration different from those of hand grenades and cluster bombs; cover fragments are lacking. Gunshot wounds (GSW) can be differentiated in those to low velocity bullets, high velocity projectiles, and projectiles, which disintegrate on impact. The radiogram furnishes the information about a dangerous shock and helps to recognize the weapon. Radiograms of victims of explosion show fragments and injuries due to the blast, information valid for therapy planning and prognosis. The radiogram shows details which can be used in therapy, forensic medicine and in war propaganda - examples could be findings typical for cluster bombs and for dumdum bullets; it shows the cruelty of the employment of weapons against humans and the conflict between the goal of medical care and those of military actions. Conclusion: Radiographs may show, which weapon has been employed; they can be read as war reports.

  18. Wounds and weapons.

    Science.gov (United States)

    Vogel, H; Dootz, B

    2007-08-01

    X-ray findings are described, which are typical for injuries due to conventional weapons. It is intended to demonstrate that radiographs can show findings characteristic for weapons. The radiograms have been collected in Vietnam, Croatia, Serbia, Bosnia, Chad, Iran, Afghanistan, USA, Great Britain, France, Israel, Palestine, and Germany. Radiograms of injuries due to hand grenades show their content (globes) and cover fragments. The globes are localized regionally in the victim's body. Survivors of cluster bombs show singular or few globes; having been hit by many globes would have been lethal. Shotguns produce characteristic distributions of the pallets and depth of penetration different from those of hand grenades and cluster bombs; cover fragments are lacking. Gunshot wounds (GSW) can be differentiated in those to low velocity bullets, high velocity projectiles, and projectiles, which disintegrate on impact. The radiogram furnishes the information about a dangerous shock and helps to recognize the weapon. Radiograms of victims of explosion show fragments and injuries due to the blast, information valid for therapy planning and prognosis. The radiogram shows details which can be used in therapy, forensic medicine and in war propaganda - examples could be findings typical for cluster bombs and for dumdum bullets; it shows the cruelty of the employment of weapons against humans and the conflict between the goal of medical care and those of military actions. Radiographs may show, which weapon has been employed; they can be read as war reports.

  19. Bioterrorism: toxins as weapons.

    Science.gov (United States)

    Anderson, Peter D

    2012-04-01

    The potential for biological weapons to be used in terrorism is a real possibility. Biological weapons include infectious agents and toxins. Toxins are poisons produced by living organisms. Toxins relevant to bioterrorism include ricin, botulinum, Clostridium perfrigens epsilson toxin, conotoxins, shigatoxins, saxitoxins, tetrodotoxins, mycotoxins, and nicotine. Toxins have properties of biological and chemical weapons. Unlike pathogens, toxins do not produce an infection. Ricin causes multiorgan toxicity by blocking protein synthesis. Botulinum blocks acetylcholine in the peripheral nervous system leading to muscle paralysis. Epsilon toxin damages cell membranes. Conotoxins block potassium and sodium channels in neurons. Shigatoxins inhibit protein synthesis and induce apoptosis. Saxitoxin and tetrodotoxin inhibit sodium channels in neurons. Mycotoxins include aflatoxins and trichothecenes. Aflatoxins are carcinogens. Trichothecenes inhibit protein and nucleic acid synthesis. Nicotine produces numerous nicotinic effects in the nervous system.

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

    African Journals Online (AJOL)

    2015-05-11

    May 11, 2015 ... metaheuristic for solving the vehicle routing problem with time .... by Flood [10] and formulated as a mathematical model by Manne [21] later that year. ...... another in the indifference grid method, and hence, both solutions will ...

  1. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

  2. Weapon of the Weak?

    DEFF Research Database (Denmark)

    Amber, Van der Graaf; Otjes, Simon; Rasmussen, Anne

    2016-01-01

    Social media have the potential to offset existing inequalities in representation among interest groups and act as a ‘weapon of the weak’ by providing a technological infrastructure that allows even groups with limited resources to create content and interact across the globe. We expand on the sp......Social media have the potential to offset existing inequalities in representation among interest groups and act as a ‘weapon of the weak’ by providing a technological infrastructure that allows even groups with limited resources to create content and interact across the globe. We expand...

  3. The Optimum Replacement of Weapon

    Institute of Scientific and Technical Information of China (English)

    ZHANG Xiao; ZHANG Jin-chun

    2002-01-01

    The theory of LCC (Life Cycle Cost) is applied in this paper. The relation between the economic life of weapon and the optimum replacement is analyzed. The method to define the optimum replacement time of weapon is discussed.

  4. Multiple smart weapons employment mechanism

    Energy Technology Data Exchange (ETDEWEB)

    McGlynn, M.P.; Meiklejohn, W.D.

    1993-07-20

    A digital communications armament network adaptor is described for carrying multiple smart weapons on a single wing pylon station of an aircraft, comprising: an aircraft having a weapons controller configured in compliance with MIL-STD 1553; multiple wing-mounted pylons on said aircraft, each providing a weapons station with communications and ejection and release mechanisms electrically connected to said controller for the airborne launch of smart weapons; a multiple ejector rack affixed to at least one pylon, said rack holding a plurality of smart weapons; and an electronic digital network connected between the controller and said rack-mounted smart weapons, said network located in said rack and including circuitry which receives coded digital communications from said controller and selectively rebroadcasts said communications to one of said smart weapons on said rack designated by said coded communications, thereby controlling all required functions of said designated smart weapon.

  5. Nuclear weapon detection categorization analysis

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-12-01

    This statement of work is for the Proof of Concept for nuclear weapon categories utility in Arms control. The focus of the project will be to collect, analyze and correlate Intrinsic Radiation (INRAD) calculation results for the purpose of defining measurable signatures that differentiate categories of nuclear weapons. The project will support START III negotiations by identifying categories of nuclear weapons. The categories could be used to clarify sub-limits on the total number of nuclear weapons.

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

  7. Applying Agile MethodstoWeapon/Weapon-Related Software

    Energy Technology Data Exchange (ETDEWEB)

    Adams, D; Armendariz, M; Blackledge, M; Campbell, F; Cloninger, M; Cox, L; Davis, J; Elliott, M; Granger, K; Hans, S; Kuhn, C; Lackner, M; Loo, P; Matthews, S; Morrell, K; Owens, C; Peercy, D; Pope, G; Quirk, R; Schilling, D; Stewart, A; Tran, A; Ward, R; Williamson, M

    2007-05-02

    This white paper provides information and guidance to the Department of Energy (DOE) sites on Agile software development methods and the impact of their application on weapon/weapon-related software development. The purpose of this white paper is to provide an overview of Agile methods, examine the accepted interpretations/uses/practices of these methodologies, and discuss the applicability of Agile methods with respect to Nuclear Weapons Complex (NWC) Technical Business Practices (TBPs). It also provides recommendations on the application of Agile methods to the development of weapon/weapon-related software.

  8. 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.%直升机编队的对地攻击过程中,目标分配是实现作战任务的重要条件.确定了直升机目标分配的优势度计算方法以及目标分配的原则.利用蚁群-模拟退火算法实现了直升机对地攻击的目标分配过程,并针对分配过程中,采用综合优势度最大来确定最优路径所出现的不足对算法进行了改进,即根据信息素的积累量来确定最优路径,能够综合考虑信息素浓度与优势度的影响,避免了为达到全局最大优势度而出现的个体分配效益不好以及收敛缓慢的情况.实验结果表明,改进的算法效率更高,收敛的速度较之前更快,分配结果更趋合理.

  9. 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个)交通分配模型及其关系,以及“全有全无”交通分配模型归类问题进行了研究,通过对比研究发现,仅需在目前常用的基于容限交通分配模型的算法中加入一个模块即可实现一种用户平衡模型的结果,为编写一类用户平衡的软件提供了捷径,对理论与实践也有一定的指导价值。

  10. 基于"虚拟工序库"作业系统的工人指派模型及算法研究%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.

  11. 基于熵权的传感反应网络任务分派算法%Tasks Assignment Algorithm Based on Entropy for Wireless Sensor and Actor Networks

    Institute of Scientific and Technical Information of China (English)

    易军; 许磊

    2011-01-01

    针对无线传感反应网络中事件频发区域内执行器节点能耗过大问题,提出一种基于熵权的任务分派算法,利用拍卖机制,建立基于熵权的执行代价评估模型,并根据网络的实际情况,将任务元分派建模成平衡或者非平衡整数规划问题,使任务并发执行.仿真实验表明,网络实时性和能耗均衡性都得到了改善.%Aimed at "hot zone" problem of wireless sensor and actor networks, a tasks assignment algorithm based on entropy was proposed to make the whole network energy consumption more balanced. Considering network situation,the entropy-based cost of taking action model was established by using auction method. The task assignment problem among actors was formulated as a balanced or non-balanced task assignment optimization problem, different task units were executed in parallel to enhance higher real-time response. The result of simulation shows that the algorithm can provide more balance in energy consumption and higher real-time performance.

  12. Nonstrategic Nuclear Weapons

    Science.gov (United States)

    2017-02-21

    have eased in recent years, with their nuclear tests in 1998 and continued animosity toward each other, India and Pakistan have joined the list of...could be complex, difficult, and very time- consuming . 137 Given the large disparity in the numbers of U.S. and Russian nonstrategic nuclear weapons

  13. Medicalized weapons & modern war.

    Science.gov (United States)

    Gross, Michael L

    2010-01-01

    "Medicalized" weapons--those that rely on advances in neuroscience, physiology, and pharmacology--offer the prospect of reducing casualties and protecting civilians. They could be especially useful in modern asymmetric wars in which conventional states are pitted against guerrilla or insurgent forces. But may physicians and other medical workers participate in their development?

  14. Neutrino Counter Nuclear Weapon

    CERN Document Server

    Tang, Alfred

    2008-01-01

    Radiations produced by neutrino-antineutrino annihilation at the Z0 pole can be used to heat up the primary stage of a thermonuclear warhead and can in principle detonate the device remotely. Neutrino-antineutrino annihilation can also be used as a tactical assault weapon to target hideouts that are unreachable by conventional means.

  15. Nuclear weapons in Europe

    CERN Document Server

    Calogero, F

    1981-01-01

    Information speech given by Prof. Calogero from the university of Roma to describe the actual situation of nuclear weapons in Europe, the strategical reasons or justifications for this deployment, the prospects of negociations, and what scientists could do and do on this issue.

  16. Pakistans Nuclear Weapons

    Science.gov (United States)

    2016-02-12

    Memorandum from Air Commodore Khalid Banuri, 2011. 84 Mahmud Ali Durrani, “Pakistan’s Strategic Thinking and the Role of Nuclear Weapons...Richard P. Cronin , K. Alan Kronstadt, and Sharon Squassoni. Also see CRS Report RL33498, Pakistan-U.S. Relations, by K. Alan Kronstadt. 168 For a

  17. 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.%建立适用于频率指配问题的数学模型,将电磁兼容性分析的各类因素转化为约束条件,使得电磁兼容问题可以被定量描述,并在此基础上构建了代价函数.采用粒子群优化算法来解决频率指配的问题,在算法的迭代过程中引入了遗传算法思想,加入了自然选择和杂交的手段.仿真证明算法能够达到较快的收敛速度,并有一定的避免陷入局部最优的能力.

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

  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. Non-lethal weapons and their characteristics

    OpenAIRE

    DAMJANOVIC DRAGAN Z.

    2015-01-01

    Non-lethal weapons, also called less-lethal weapons, less-than lethal weapons, non-deadly weapons, compliance weapons, or pain-inducing weapons are weapons intended to be less likely to kill a living target than conventional weapons. It is often understood that accidental, incidental, and correlative casualties are risked wherever force is applied, but non-lethal weapons try to minimise the risk as much as possible. Non-lethal weapons are used in combat situations to limit the escalation of c...

  1. NON-LETHAL WEAPONS AND THEIR CHARACTERISTICS

    OpenAIRE

    2015-01-01

    Non-lethal weapons, also called less-lethal weapons, less-than lethal weapons, non-deadly weapons, compliance weapons, or pain-inducing weapons are weapons intended to be less likely to kill a living target than conventional weapons. It is often understood that accidental, incidental, and correlative casualties are risked wherever force is applied, but non-lethal weapons try to minimise the risk as much as possible. Non-lethal weapons are used in combat situations to limit the escalation of c...

  2. 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.%  移动通信网络中频率资源是有限的,为了提高无线资源的利用率,将改进的人工蜂群算法用于解决无线信道分配问题。提出的算法用逐步减小邻域搜索范围的动态步长来均衡局部与全局搜索能力;对单个体引入选择性变异技术,增加了种群的多样性,加快了算法的收敛速度。仿真结果表明,改进后的算法能较好地解决无线信道分配问题,提高了算法的收敛率和收敛速度。

  3. 基于航班机型分配的机队规划启发式算法%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秒,结果稳定且高效可行.

  4. Bioterrorism: pathogens as weapons.

    Science.gov (United States)

    Anderson, Peter D; Bokor, Gyula

    2012-10-01

    Biowarfare has been used for centuries. The use of biological weapons in terrorism remains a threat. Biological weapons include infectious agents (pathogens) and toxins. The most devastating bioterrorism scenario would be the airborne dispersal of pathogens over a concentrated population area. Characteristics that make a specific pathogen a high-risk for bioterrorism include a low infective dose, ability to be aerosolized, high contagiousness, and survival in a variety of environmental conditions. The most dangerous potential bioterrorism agents include the microorganisms that produce anthrax, plague, tularemia, and smallpox. Other diseases of interest to bioterrorism include brucellosis, glanders, melioidosis, Q fever, and viral encephalitis. Food safety and water safety threats are another area of concern.

  5. Millimeter Wave Radar Applications to Weapons Systems

    Science.gov (United States)

    1976-06-01

    ocity, and azimuth and elevation arRles ; assignment of target to L weapon for engagement; and assessment of the damage by the indication of cessa- tion...paper. 29 D.E. Gray, American institute of Physics Handbook ," McGraw-Hill, New S~York, 1957. --. . - - . .A • -•• =_ . . . . •,,- - - The complex...B-13) is the target-to-clutter power ratio. I. 41I 7 Handbook of Mathematical Functions, U.S. Department of Commerce, National Bureau of Standards

  6. 一种面向体系结构的自适应软件构件分派模型及算法%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完全问题,最后提出一种启发式分派算法找出近似最优解,实验表明,与贪婪和整线性规划算法相比,该算法具有多目标均衡的优势;而与整线性规划算法相比,虽然不能保证找到最优解,但具有较大的计算时间优势.

  7. Illegal Weapons Exports?

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Amnesty International, a human rights organization, released a report on June 11 accusing China of facilitating regional conflicts and human rights violations by exporting a large quantity of weapons to Sudan, Nepal, Myanmar and the Great Lakes countries of Africa. Responding to such charges, Teng Jianqun, a researcher with the China Arms Control and Disarmament Association, told the official Xinhua News Agency that China has always put its limited arms exports under strict control and surveillance, deno...

  8. Counterproliferation of Nuclear Weapons

    Science.gov (United States)

    2010-04-01

    an occurrence. In his book, Atomic Tragedy, Sean Malloy writes that Henry Stimson, the United States Secretary of War, warned in April, 1945 that...Ibid., 380. 41 Ibid. 42 Sean L. Malloy , Atomic Tragedy: Henry L. Stimson and the Decision to use the Bomb Against Japan (Ithaca, New York...Weapons of Mass Destruction in the Middle East, 96-97. 45 Robert M. Gates, National Defense Strategy (Washington, DC: US Government Printing Office

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

  10. On the Bicriterion Multi Modal Assignment Problem

    DEFF Research Database (Denmark)

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

    2005-01-01

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

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

  12. The morality of weapons research.

    Science.gov (United States)

    Forge, John

    2004-07-01

    I ask whether weapons research is ever justified. Weapons research is identified as the business of the engineer. It is argued that the engineer has responsibility for the uses to which the tools that he designs can be put, and that responsibility extends to the use of weapons. It is maintained that there are no inherently defensive weapons, and hence there is no such thing as 'defensive' weapons research. The issue then is what responsibilities as a professional the engineer has in regard to such research. An account is given to ground the injunction not to provide the means to harm as a duty for the engineers. This account is not, however, absolutist, and as such it allows justifiable exceptions. The answer to my question is thus not that weapons research is never justified but there must be a strong assurance that the results will only be used as a just means in a just cause.

  13. 32 CFR 234.10 - Weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 2 2010-07-01 2010-07-01 false Weapons. 234.10 Section 234.10 National Defense... PENTAGON RESERVATION § 234.10 Weapons. (a) Except as otherwise authorized under this section, the following are prohibited: (1) Possessing a weapon. (2) Carrying a weapon. (3) Using a weapon. (b) This section...

  14. 一种新型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.

  15. Handheld ultrasound concealed weapons detector

    Science.gov (United States)

    Felber, Franklin S.; Wild, Norbert C.; Nunan, Scott C.; Breuner, Dennis; Doft, Frank

    1998-12-01

    A handheld, battery-operated prototype of a remove concealed weapons detector has been built and tested. The concealed weapons detector will enable law enforcement and security officers to detect metallic and nonmetallic weapons concealed beneath clothing remotely from beyond arm's length to about 20 feet. These detectors may be used to: (1) allow hands-off, stand-off frisking of suspects for metallic and nonmetallic weapons; and (2) search for metallic and nonmetallic weapons on cooperative subjects at courthouse entrances and other monitored security portals. We have demonstrated that we image weapons concealed under heavy clothing, not just detect them, at ranges up to 15 feet using the same ultrasound frequency (40 kHz) used by commercial rangefinders. The concealed weapons detector operates much as a rangefinder, but at higher peak fluxes and pulse repetition frequencies. The detector alerts the user to concealed weapons audibly and visibly by detecting ultrasound glints above a body/clothing baseline, and by compensating for changing range and attenuation. The detector locates concealed weapons within a 6-inch illuminated spot at 10 feet. The signal processor eliminates any signal from behind the target.

  16. Weapons Neutron Research Facility (WNR)

    Data.gov (United States)

    Federal Laboratory Consortium — The Weapons Neutron Research Facility (WNR) provides neutron and proton beams for basic, applied, and defense-related research. Neutron beams with energies ranging...

  17. 认知网络中基于快速多赢家多频段拍卖的动态频谱分配%Dynamic spectrum assignment based on FADM algorithm in cognitive networks

    Institute of Scientific and Technical Information of China (English)

    吴广恩; 任品毅; 战明浩

    2009-01-01

    In order to improve auction effectiveness in dynamic spectrum assignment (DSA), a new assignment scheme based on FADM(fast auction with multiple goods and multiple winners) algorithm was given. The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming. Our scheme restrains collusion with reservation price and discriminated price. Furthermore, the reservation price and bid price can be adjusted dynamically to spectrum supply and demand,which can balance revenue and social efficiency of spectrum auction. The results of performance analysis and simulation indicate that the FADM algorithm can make spectrum utilization close to demand and improve allocation revenue as high as possible.%针对传统拍卖方法在动态频谱分配中的低效问题,本文提出了一种基于FADM(fast auction with multiple bands and multiple winners)算法的动态频谱分配方法.FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题,从而可用动态规划寻求最佳的出清向量;新算法采用了保留价格和差异定价抑制共谋,且根据供求关系动态调整保留价格和竞标价格,兼顾了频谱分配的经济效益和社会效益.性能分析和计算机仿真结果表明,FADM算法可以使频谱有效利用率逼近实际需求率,同时尽可能提高分配收益.

  18. 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.%集装箱码头上出口箱的堆位分配直接影响出口箱的装船作业效率。本文提出对出口箱在码头堆场内进行堆位分配的两阶段优化算法。第一阶段对出口箱进行贝位分配;在此基础上第二阶段在已分配的贝内,为每个到港出口箱分配具体箱位。算法第一阶段采用混合整数规划模型对问题进行建模和求解,第二阶段采用基于混合堆放的启发式算法进行堆位分配求解。实验结果表明,本文所提出的算法可以有效解决出口箱的堆位分配问题。

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

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

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

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

  2. Insulin as a weapon.

    Science.gov (United States)

    Robinson, Samuel D; Safavi-Hemami, Helena

    2016-12-01

    The discovery of insulin and its use for the treatment of diabetes is undoubtedly one of the true successes of modern medicine. Injectable insulin would prove the first effective treatment for a previously incurable and usually fatal disease. Soon after however, the powerful effects of insulin overdose would be reported, and subsequently exploited for dubious medical and sometimes nefarious purposes. In this article we describe the discovery that certain venomous marine snails of the genus Conus also exploit the powerful effects of insulin overdose, employing it as a weapon for prey capture. Copyright © 2016 Elsevier Ltd. All rights reserved.

  3. Detection of Nuclear Weapons and Materials: Science, Technologies, Observations

    Science.gov (United States)

    2010-06-04

    between Z=57 (lanthanum) and Z=72 ( hafnium ), inclusive, are very rare in commerce, making 72 a reasonable boundary between high Z and lower Z elements...materials used in nuclear weapons of other nations (e.g., for alloys ) for purposes of nuclear forensics. (2) Another task is to develop the algorithms

  4. 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),对算法原理和求解步骤进行了探讨.构建实例公交网络进行分析测试,配流结果显示该模型能够很好的反映出出发时间、到达时间、换乘次数及费用等对乘客公交出行的影响,算法是合理和有效的.

  5. Naval Weapons Station Earle Reassessment

    Science.gov (United States)

    2013-12-01

    surveys for their Section 110 compliance: Architectural Resources Survey, Naval Weapons Station Earle, Monmouth County, New Jersey (Louis Berger 1999...text within brackets. Berger Report 1999 Architectural Resources Survey, Naval Weapons Station Earle, Monmouth County, New Jersey (Louis Berger... architectural treatment of buildings at NWS Earle: a traditional vernacular theme with minimal decorative detailing. This so-called minimal traditional

  6. Proportionality and Autonomous Weapons Systems

    NARCIS (Netherlands)

    van den Boogaard, J.

    2015-01-01

    Given the swift technologic development, it may be expected that the availability of the first truly autonomous weapons systems is fast approaching. Once they are deployed, these weapons will use artificial intelligence to select and attack targets without further human intervention. Autonomous

  7. Proportionality and Autonomous Weapons Systems

    NARCIS (Netherlands)

    van den Boogaard, J.

    2015-01-01

    Given the swift technologic development, it may be expected that the availability of the first truly autonomous weapons systems is fast approaching. Once they are deployed, these weapons will use artificial intelligence to select and attack targets without further human intervention. Autonomous weap

  8. Musculoskeletal colloquialisms based on weapons.

    Science.gov (United States)

    Agrawal, Anuj

    2017-01-01

    Eponyms and colloquialisms are commonly used in orthopaedic literature and convey a great deal of information in a concise fashion. Several orthopaedic conditions have characteristic clinical or radiologic appearances, mimicking the appearance of certain arms or weapons. Most of these are easy to memorise and recognise, provided the orthopaedic surgeon is aware of the colloquialism and familiar with the appearance of the weapon on which it is based. Unfortunately, many such colloquialisms are based on traditional weapons no longer in current use, and their appearances are not familiar to most orthopaedists, creating confusion and difficulty in understanding them. In this paper, we have reviewed the musculoskeletal colloquialisms based on weapons, including a brief description of the weapon with illustrations, highlighting the importance of the colloquialism in diagnosis or treatment of musculoskeletal conditions.

  9. Nuclear weapon reliability evaluation methodology

    Energy Technology Data Exchange (ETDEWEB)

    Wright, D.L. [Sandia National Labs., Albuquerque, NM (United States)

    1993-06-01

    This document provides an overview of those activities that are normally performed by Sandia National Laboratories to provide nuclear weapon reliability evaluations for the Department of Energy. These reliability evaluations are first provided as a prediction of the attainable stockpile reliability of a proposed weapon design. Stockpile reliability assessments are provided for each weapon type as the weapon is fielded and are continuously updated throughout the weapon stockpile life. The reliability predictions and assessments depend heavily on data from both laboratory simulation and actual flight tests. An important part of the methodology are the opportunities for review that occur throughout the entire process that assure a consistent approach and appropriate use of the data for reliability evaluation purposes.

  10. 分布式遗传模拟退火算法的火力打击目标分配优化%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.

  11. Why are U.S. nuclear weapon modernization efforts controversial?

    Science.gov (United States)

    Acton, James

    2016-03-01

    U.S. nuclear weapon modernization programs are focused on extending the lives of existing warheads and developing new delivery vehicles to replace ageing bombers, intercontinental ballistic missiles, and ballistic missile submarines. These efforts are contested and controversial. Some critics argue that they are largely unnecessary, financially wasteful and potentially destabilizing. Other critics posit that they do not go far enough and that nuclear weapons with new military capabilities are required. At its core, this debate centers on three strategic questions. First, what roles should nuclear weapons be assigned? Second, what military capabilities do nuclear weapons need to fulfill these roles? Third, how severe are the unintended escalation risks associated with particular systems? Proponents of scaled-down modernization efforts generally argue for reducing the role of nuclear weapons but also that, even under existing policy, new military capabilities are not required. They also tend to stress the escalation risks of new--and even some existing--capabilities. Proponents of enhanced modernization efforts tend to advocate for a more expansive role for nuclear weapons in national security strategy. They also often argue that nuclear deterrence would be enhanced by lower yield weapons and/or so called bunker busters able to destroy more deeply buried targets. The debate is further fueled by technical disagreements over many aspects of ongoing and proposed modernization efforts. Some of these disagreements--such as the need for warhead life extension programs and their necessary scope--are essentially impossible to resolve at the unclassified level. By contrast, unclassified analysis can help elucidate--though not answer--other questions, such as the potential value of bunker busters.

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

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

  14. Trends in causes of death among children under 5 in Bangladesh, 1993-2004: an exercise applying a standardized computer algorithm to assign causes of death using verbal autopsy data

    Directory of Open Access Journals (Sweden)

    Walker Neff

    2011-08-01

    Full Text Available Abstract Background Trends in the causes of child mortality serve as important global health information to guide efforts to improve child survival. With child mortality declining in Bangladesh, the distribution of causes of death also changes. The three verbal autopsy (VA studies conducted with the Bangladesh Demographic and Health Surveys provide a unique opportunity to study these changes in child causes of death. Methods To ensure comparability of these trends, we developed a standardized algorithm to assign causes of death using symptoms collected through the VA studies. The original algorithms applied were systematically reviewed and key differences in cause categorization, hierarchy, case definition, and the amount of data collected were compared to inform the development of the standardized algorithm. Based primarily on the 2004 cause categorization and hierarchy, the standardized algorithm guarantees comparability of the trends by only including symptom data commonly available across all three studies. Results Between 1993 and 2004, pneumonia remained the leading cause of death in Bangladesh, contributing to 24% to 33% of deaths among children under 5. The proportion of neonatal mortality increased significantly from 36% (uncertainty range [UR]: 31%-41% to 56% (49%-62% during the same period. The cause-specific mortality fractions due to birth asphyxia/birth injury and prematurity/low birth weight (LBW increased steadily, with both rising from 3% (2%-5% to 13% (10%-17% and 10% (7%-15%, respectively. The cause-specific mortality rates decreased significantly due to neonatal tetanus and several postneonatal causes (tetanus: from 7 [4-11] to 2 [0.4-4] per 1,000 live births (LB; pneumonia: from 26 [20-33] to 15 [11-20] per 1,000 LB; diarrhea: from 12 [8-17] to 4 [2-7] per 1,000 LB; measles: from 5 [2-8] to 0.2 [0-0.7] per 1,000 LB; injury: from 11 [7-17] to 3 [1-5] per 1,000 LB; and malnutrition: from 9 [6-13] to 5 [2-7]. Conclusions

  15. 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.%在防空袭作战中,为了有效地降低敌机载雷达的探测能力,必须综合运用电子干扰措施实施电子干扰,干扰兵力分配直接影响干扰效果。结合防空袭作战的特点,提出了基于自适应遗传算法的雷达干扰系统兵力分配模型,并设计了既考虑到进化代数对算法影响,又考虑到每代中不同个体适应度对算法作用的自适应交叉概率和变异概率。仿真实例表明该方法可以有效解决雷达干扰系统兵力分配这一复杂而困难的问题。

  16. Feature extraction from time domain acoustic signatures of weapons systems fire

    Science.gov (United States)

    Yang, Christine; Goldman, Geoffrey H.

    2014-06-01

    The U.S. Army is interested in developing algorithms to classify weapons systems fire based on their acoustic signatures. To support this effort, an algorithm was developed to extract features from acoustic signatures of weapons systems fire and applied to over 1300 signatures. The algorithm filtered the data using standard techniques then estimated the amplitude and time of the first five peaks and troughs and the location of the zero crossing in the waveform. The results were stored in Excel spreadsheets. The results are being used to develop and test acoustic classifier algorithms.

  17. Youths Carrying a Weapon or Using a Weapon in a Fight: What Makes the Difference?

    Science.gov (United States)

    Thurnherr, Judit; Michaud, Pierre-Andre; Berchtold, Andre; Akre, Christina; Suris, Joan-Carles

    2009-01-01

    The objective of this study was to characterize weapon-carrying adolescents and to assess whether weapon carriers differ from weapon users. Data were drawn from a cross-sectional school-based survey of 7548 adolescents aged 16-20 years in Switzerland. Youths carrying a weapon were compared with those who do not. Subsequently, weapon carriers were…

  18. On the Bicriterion Multi Modal Assignment Problem

    DEFF Research Database (Denmark)

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

    2005-01-01

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

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

  20. Risk in the Weapons Stockpile

    Energy Technology Data Exchange (ETDEWEB)

    Noone, Bailey C [Los Alamos National Laboratory

    2012-08-14

    When it comes to the nuclear weapons stockpile, risk must be as low as possible. Design and care to keep the stockpile healthy involves all aspects of risk management. Design diversity is a method that helps to mitigate risk.

  1. Real life identification of partially occluded weapons in video frames

    Science.gov (United States)

    Hempelmann, Christian F.; Arslan, Abdullah N.; Attardo, Salvatore; Blount, Grady P.; Sirakov, Nikolay M.

    2016-05-01

    We empirically test the capacity of an improved system to identify not just images of individual guns, but partially occluded guns and their parts appearing in a videoframe. This approach combines low-level geometrical information gleaned from the visual images and high-level semantic information stored in an ontology enriched with meronymic part-whole relations. The main improvements of the system are handling occlusion, new algorithms, and an emerging meronomy. Well-known and commonly deployed in ontologies, actual meronomies need to be engineered and populated with unique solutions. Here, this includes adjacency of weapon parts and essentiality of parts to the threat of and the diagnosticity for a weapon. In this study video sequences are processed frame by frame. The extraction method separates colors and removes the background. Then image subtraction of the next frame determines moving targets, before morphological closing is applied to the current frame in order to clean up noise and fill gaps. Next, the method calculates for each object the boundary coordinates and uses them to create a finite numerical sequence as a descriptor. Parts identification is done by cyclic sequence alignment and matching against the nodes of the weapons ontology. From the identified parts, the most-likely weapon will be determined by using the weapon ontology.

  2. The Weaponization of Social Media

    Science.gov (United States)

    2016-06-10

    media efforts will be compared to similar Western business and civic social media centric marketing efforts from both a technical and theoretical...THE WEAPONIZATION OF SOCIAL MEDIA A thesis presented to the Faculty of the U.S. Army Command and General Staff College in...The Weaponization of Social Media 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Jack B. Irby III, MAJ 5d

  3. 基于多群体改进萤火虫算法的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.

  4. OIL AS POLITICAL WEAPON

    Directory of Open Access Journals (Sweden)

    Mariana, BUICAN

    2013-12-01

    Full Text Available Oil (called by some black gold has not always been as coveted and used, but only in the last hundred years has established itself as a highly sought after as an indispensable proper functioning of modern economic activity that an important factor in international politics. International oil regime has changed in the last decades. In 1960, oil regime was a private oligopol which had links with governments main consuming countries. By then the price of a barrel of oil was two U.S. dollars and seven major transnational oil companies decided the amount of oil that will be produced. Meanwhile the world region with the largest oil exports were more strongly expressed nationalism and decolonization. Result, it was so in the late 60s in the region occur independent states. They have created an organization aim of this resource to their advantage - OPEC (Organization of Petroleum Exporting Countries. Thus since 1973 there have been changes in the international regime governing oil field, namely producing countries were fixed production rate and price. After this time the oil weapon has become increasingly important in the management of international relations. Oil influenced the great powers to Middle East conflicts that occurred in the last century, but their attitude about the emergence of new sources of oil outside OPEC. In the late 90's, Russia has become a major supplier of oil to the West.

  5. Transfer alignment of shipborne inertial-guided weapon systems

    Institute of Scientific and Technical Information of China (English)

    Sun Changyue; Deng Zhenglong

    2009-01-01

    The transfer alignment problem of the shipborne weapon inertial navigation system (INS) is addressed. Specifically, two transfer alignment algorithms subjected to the ship motions induced by the waves are discussed. To consider the limited maneuver level performed by the ship, a new filter algorithm for transfer alignment methods using velocity and angular rate matching is first derived. And then an improved method using integrated velocity and integrated angular rate matching is introduced to reduce the effect of the ship body flexure. The simulation results show the feasibility and validity of the proposed transfer alignment algorithms.

  6. 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均值聚类算法进行初步分组,再在分组的基础下,提出了分合粒子群优化算法进行组内任务分配.最后进行实验仿真,实验结果与分析表明基于分合粒子群算法的任务重分配方法能有效地满足多变的战场环境要求.

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

  8. The Effects of Nuclear Weapons

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, Samuel

    1964-02-01

    This book is a revision of "The Effects of Nuclear Weapons" which was issued in 1957. It was prepared by the Defense Atomic Support Agency of the Department of Defense in coordination with other cognizant governmental agencies and was published by the U.S. Atomc Energy Commission. Although the complex nature of nuclear weapons effects does not always allow exact evaluation, the conclusions reached herein represent the combined judgment of a number of the most competent scientists working the problem. There is a need for widespread public understanding of the best information available on the effects of nuclear weapons. The purpose of this book is to present as accurately as possible, within the limits of national security, a comprehensive summary of this information.

  9. 集中式信道分配算法在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.

  10. 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.%  实战环境下,无人机所获得的信息通常具有不确定性,针对不确定环境下的多无人机任务分配问题,提出了一种决策方法。分析无人机任务规划中各指标的不确定性,采用主观赋值和客观赋值相结合的方法,确定指标的综合权重,将离散粒子群优化算法和区间数排序方法相结合,给出区间形式不确定信息的无人机任务分配方法。仿真实验结果表明了该方法的可行性和有效性。该决策方法不仅能解决确定信息情况下的无人机任务分配问题,而且能解决区间数不确定信息情况下的无人机任务分配问题。

  11. The Effects of Nuclear Weapons

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, Samuel

    1957-06-01

    This handbook prepared by the Armed Forces Special Weapons Project of the Department of Defense in coordination with other cognizant government agencies and published by the United States Atomic Energy Commission, is a comprehensive summary of current knowledge on the effects of nuclear weapons. The effects information contained herein is calculated for yields up to 20 megatons and the scaling laws for hypothetically extending the calculations beyond this limit are given. The figure of 20 megatons however is not be taken as an indication of capabilities or developments.

  12. Computation of Weapons Systems Effectiveness

    Science.gov (United States)

    2013-09-01

    Aircraft Dive Angle : Initial Weapon Release Velocity at x-axis VOx VOz x: x-axis z: z-axis : Initial Weapon Release Velocity at z...altitude Impact Velocity (x− axis), Vix = VOx (3.4) Impact Velocity (z− axis), Viz = VOz + (g ∗ TOF) (3.5) Impact Velocity, Vi = �Vix2 + Viz2 (3.6...compute the ballistic partials to examine the effects that varying h, VOx and VOz have on RB using the following equations: ∂RB ∂h = New RB−Old RB

  13. Protein side-chain resonance assignment and NOE assignment using RDC-defined backbones without TOCSY data.

    Science.gov (United States)

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

    2011-08-01

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

  14. 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方法对问题进行求解。最后,基于一个算例分析,验证该模型及算法的有效性。

  15. 32 CFR 1903.10 - Weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 6 2010-07-01 2010-07-01 false Weapons. 1903.10 Section 1903.10 National... INSTALLATIONS § 1903.10 Weapons. (a) Except as provided in paragraph (c) of this section, knowingly possessing or causing to be present a weapon on an Agency installation, or attempting to do so is prohibited. (b...

  16. 48 CFR 25.301-3 - Weapons.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Weapons. 25.301-3 Section... FOREIGN ACQUISITION Contracts Performed Outside the United States 25.301-3 Weapons. The contracting officer shall follow agency procedures and the weapons policy established by the combatant commander or...

  17. 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分布的要求且最优解是唯一的;最后给出了模型的方向搜索算法.

  18. Handheld Concealed Weapons Detector Development

    Science.gov (United States)

    2003-03-01

    Enforcement, Edward M. Carapezza, Donald Spector, Eds., Proc. SPIE 2938, 110 - 119 (1997). 3. Franklin Felber, Norbert Wild, Scott Nunan , Dennis Breuner... Nunan , D. Breuner, and F. Doft, "Handheld Ultrasound Concealed-Weapons Detector," in Enforcement and Security Technologies, A. Trent DePersia, J. J

  19. [Modern pneumatic weapons and injuries they cause].

    Science.gov (United States)

    Kozachenko, I N

    2013-01-01

    The data on the history of development and further improvement of pneumatic weapons are presented with special reference to specific features of different types and varieties of these weapons, cartridges for them, and the sphere of their application. Investigations into peculiarities of damages caused by high-capacity pneumatic weapons to the objects of forensic medical expertise affected from different distances are reviewed. Results of forensic medical expertise and clinical studies on the structure of body injuries inflicted by gunshots from pneumatic weapons to the human body are discussed. The author emphasizes the necessity of developing up-to-date terminology and classification of gunshot injuries caused by shooting from pneumatic weapons.

  20. Why Sexually Selected Weapons Are Not Ornaments.

    Science.gov (United States)

    McCullough, Erin L; Miller, Christine W; Emlen, Douglas J

    2016-10-01

    The elaboration and diversification of sexually selected weapons remain poorly understood. We argue that progress in this topic has been hindered by a strong bias in sexual selection research, and a tendency for weapons to be conflated with ornaments used in mate choice. Here, we outline how male-male competition and female choice are distinct mechanisms of sexual selection, and why weapons and ornaments are fundamentally different types of traits. We call for research on the factors contributing to weapon divergence, the potential for male-male competition to drive speciation, and the specific use of weapons in the context of direct fights versus displays. Given that weapons are first and foremost fighting structures, biomechanical approaches are an especially promising direction for understanding weapon design. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

  2. History of Laser Weapon Research

    Science.gov (United States)

    2012-01-01

    surgery/medicine, hair re- moval, presentation pointers, law enforcement, ranging and sighting devices, welding applications, and much more. Using...other laser technology develop- ments. The first chemical laser, hydrogen fluoride ( HF ), was built in 1965, producing 1 kW. It was then that DoD became...energy laser (HEL) weapons. In industry, the more powerful CO2 lasers are used for weld - ing, drilling, and cutting. There are many different types

  3. Deterrence and Cyber-Weapons

    Science.gov (United States)

    2013-03-01

    67, no. 4 (2012): 41. 4 Scott Shackelford , “Estonia Three Years Later,” Journal of Internet Law 8, no. 13 (2010): 25. 3 weapons were employed...effects of 134 Scott Shackelford , “From Nuclear War to Net War: Analogizing Cyber-Attacks in...International Law,” (unpublished paper, Stanford University), 5-6. 135 Shackelford , unpublished paper, 76. 136 Ibid., 73. 137 Mary Ellen O’Connell, “Cyber

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

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

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

  7. 36 CFR 2.4 - Weapons, traps and nets.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Weapons, traps and nets. 2.4... PROTECTION, PUBLIC USE AND RECREATION § 2.4 Weapons, traps and nets. (a)(1) Except as otherwise provided in... prohibited: (i) Possessing a weapon, trap or net (ii) Carrying a weapon, trap or net (iii) Using a weapon...

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

  9. New weapons and the arms race

    Energy Technology Data Exchange (ETDEWEB)

    Tsipis, K.

    1983-01-01

    In speaking about technologies that could further animate the weapons competition between the US and the USSR, it is useful to distinguish between technologies that have already been incorporated into specific weapons systems, and new technologies that are of a generic nature, can be used in a variety of applications, and can best be described by the tasks that they can perform rather than any specific weapons' application. The author discusses these in reverse order.

  10. A different kind of weapon focus: simulated training with ballistic weapons reduces change blindness

    OpenAIRE

    Taylor, J. Eric T.; Witt, Jessica K.; Pratt, Jay

    2017-01-01

    Attentional allocation is flexibly altered by action-related priorities. Given that tools – and specifically weapons – can affect attentional allocation, we asked whether training with a weapon or holding a weapon during search would affect change detection. In three experiments, participants searched for changes to agents, shootable objects, or environments in the popular flicker paradigm. Participants trained with a simulated weapon or watched a video from the same training perspective and ...

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

  12. 76 FR 6087 - Draft Weapons Safety Assessment on the Use of Enhanced Weapons; Notice of Availability and...

    Science.gov (United States)

    2011-02-03

    ... Draft Weapons Safety Assessment on the Use of Enhanced Weapons; Notice of Availability and Request for... ``Weapons Safety Assessment'' (WSA). This guidance would be used by licensees and certificate holders applying to the NRC to obtain enhanced weapons under the NRC's proposed rule titled ``Enhanced Weapons...

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

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

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

  16. FLEET ASSIGNMENT MODELLING

    Directory of Open Access Journals (Sweden)

    2016-01-01

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

  17. 有人机—无人机群协同空战目标分配算法%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种情况进行了仿真研究,提出了一种新的粒子构造方法.综合考虑空战能力指数和优势函数,构造了收益风险矩阵和多目标分配的代价函数.仿真结果具有良好收敛性,对有人机—无人机群协同空战目标分配具有参考价值.

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

  19. [Myocardial infarction after conduction electrical weapon shock].

    Science.gov (United States)

    Ben Ahmed, H; Bouzouita, K; Selmi, K; Chelli, M; Mokaddem, A; Ben Ameur, Y; Boujnah, M R

    2013-04-01

    Controversy persists over the safety of conducted electrical weapons, which are increasingly used by law enforcement agencies around the world. We report a case of 33-year-old man who had an acute inferior myocardial infarction after he was shot in the chest with an electrical weapon. Copyright © 2012 Elsevier Masson SAS. All rights reserved.

  20. Radioactive Fallout From Nuclear Weapons Testing ...

    Science.gov (United States)

    2017-08-07

    Detonating nuclear weapons above ground sends radioactive materials into the atmosphere from the ground level up to very high elevations. Overtime, these materials settle out of the atmosphere and fall to the ground. Fallout typically contains hundreds of different radionuclides. Since the end of aboveground nuclear weapons testing, radionuclides have largely decayed away.

  1. Color image fusion for concealed weapon detection

    NARCIS (Netherlands)

    Toet, A.

    2003-01-01

    Recent advances in passive and active imaging sensor technology offer the potential to detect weapons that are concealed underneath a person's clothing or carried along in bags. Although the concealed weapons can sometimes easily be detected, it can be difficult to perceive their context, due to the

  2. Weapons Acquisition. Processes of Selected Foreign Government.

    Science.gov (United States)

    1986-02-01

    period from 1977 to 1985: (1) 5.56mm calibre assault rifle. (2) Milan and Hot antitank weapon systems. (3) Roland ground-to-air weapon system. (4) AMX 30...and standardization edicts . Awards and penalties are laid on accordingly. (7/17, 13/20) The ministries stand apart from one another in the same way

  3. Nuclear weapons, nuclear effects, nuclear war

    Energy Technology Data Exchange (ETDEWEB)

    Bing, G.F.

    1991-08-20

    This paper provides a brief and mostly non-technical description of the militarily important features of nuclear weapons, of the physical phenomena associated with individual explosions, and of the expected or possible results of the use of many weapons in a nuclear war. Most emphasis is on the effects of so-called ``strategic exchanges.``

  4. Color image fusion for concealed weapon detection

    NARCIS (Netherlands)

    Toet, A.

    2003-01-01

    Recent advances in passive and active imaging sensor technology offer the potential to detect weapons that are concealed underneath a person's clothing or carried along in bags. Although the concealed weapons can sometimes easily be detected, it can be difficult to perceive their context, due to the

  5. Overview of surplus weapons plutonium disposition

    Energy Technology Data Exchange (ETDEWEB)

    Rudy, G.

    1996-05-01

    The safe disposition of surplus weapons useable plutonium is a very important and urgent task. While the functions of long term storage and disposition directly relate to the Department`s weapons program and the environmental management program, the focus of this effort is particularly national security and nonproliferation.

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

  7. Prediction Task Assignment of Multi-UAV Approach Based on Consensus

    Science.gov (United States)

    Chen, Chen; Qin, Zheng; Xing, Jian-Kuan

    In the battlefield, UAV (Unmanned Aerial Vehicle) needs to assign tasks dynamically by using the radar tracking information, but when the poor weather comes, or UAV enters blind area, the radar cannot gather the accurate information which severely impair the assignment result. A new task assignment prediction method was proposed in this paper. We first predict the UAV information using UKF (Unscented Kalman Filter) algorithm, and then clear up the collision by auction algorithm. Finally, we assign the tasks. The results show that the algorithm performs better than greedy task assignment and consensus based auction algorithm.

  8. Childhood maltreatment and threats with weapons.

    Science.gov (United States)

    Casiano, Hygiea; Mota, Natalie; Afifi, Tracie O; Enns, Murray W; Sareen, Jitender

    2009-11-01

    The relationship between childhood maltreatment and future threats with weapons is unknown. We examined data from the nationally representative National Comorbidity Survey Replication (n = 5692) and conducted multiple logistic regression analyses to determine the association between childhood maltreatment and lifetime behavior of threatening others with a gun or other weapon. After adjusting for sociodemographic variables, physical abuse, sexual abuse, and witnessing domestic violence were significantly associated with threats made with a gun (adjusted odds ratios [AOR] ranging between 3.38 and 4.07) and other weapons (AOR ranging between 2.16 and 2.83). The greater the number of types of maltreatment experienced, the stronger the association with lifetime threats made to others with guns and any weapons. Over 94% of respondents who experienced maltreatment and made threats reported that the maltreatment occurred prior to threatening others with weapons. Prevention efforts that reduce exposure to maltreatment may reduce violent behavior in later life.

  9. Weapon Control System for Airborne Application.

    Directory of Open Access Journals (Sweden)

    M. Sankar Kishore

    2000-07-01

    Full Text Available The integrated fire' control system (IFCS plays an important role in the present-day fighter aircraft and helicopters. Wecapons, such as missiles (active/passive, rockets and guns may be present on thelfighter aircraft or helicopter .IFCS monitors the status of the weapons present on the vehicle and passes the information to pilot/co-pilot. Depending upon the health/availability of the weapons, IFCS selects/fires the weapons. An attempt has been made to bring out the details of one such IFCS. As a I stepping stone, smaller version is developed and same philosophy can be used for integrating ftlore and I more weapons. Here, emphasis has been made on design and development of weapon control unit which is the heart f IFCS, both in hardware and software. The system has been developed using a 486 DX2 processor, and an elaborate software has been developed in PL/M.

  10. Domination analysis of greedy heuristics for the frequency assignment problem

    OpenAIRE

    Koller, A E; Noble, S D

    2004-01-01

    We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem. We show that the domination number of this algorithm is at least $\\sigma^{n-\\lceil\\log_2 n\\rceil-1}$ where $\\sigma$ is the available span and $n$ the number of vertices in the constraint graph. In contrast to this we show that the standard greedy algorithm has domination number strictly...

  11. Weapon Involvement in the Victimization of Children.

    Science.gov (United States)

    Mitchell, Kimberly J; Hamby, Sherry L; Turner, Heather A; Shattuck, Anne; Jones, Lisa M

    2015-07-01

    To report the prevalence of weapons involved in the victimization of youth with particular emphasis on weapons with a "high lethality risk" and how such exposure fits into the broader victimization and life experiences of children and adolescents. Data were collected as part of the Second National Survey of Children's Exposure to Violence, a nationally representative telephone survey of youth ages 2 to 17 years and caregivers (N = 4114) conducted in 2011. Estimates from the Second National Survey of Children's Exposure to Violence indicate that almost 14 million youth, ages 2–17, in the United States have been exposed to violence involving a weapon in their lifetimes as witnesses or victims,or .1 in 5 children in this age group [corrected]. More than 2 million youth in the United States (1 in 33) have been directly assaulted in incidents where the high lethality risk weapons of guns and knives were used. Differences were noted between victimizations involving higher and lower lethality risk weapons as well as between any weapon involvement versus none. Poly-victims, youth with 7 or more victimization types, were particularly likely to experience victimization with any weapon, as well as victimization with a highly lethal weapon compared with nonpoly-victims. Findings add to the field's broadening conceptualization of youth victimization highlighting the potentially highly consequential risk factor of weapon exposure as a component of victimization experiences on the mental health of youth. Further work on improving gun safety practices and taking steps to reduce children's exposure to weapon-involved violence is warranted to reduce this problem. Copyright © 2015 by the American Academy of Pediatrics.

  12. Concealed weapons detection using electromagnetic resonances

    Science.gov (United States)

    Hunt, Allen R.; Hogg, R. Douglas; Foreman, William

    1998-12-01

    Concealed weapons pose a significant threat to both law enforcement and security agency personnel. The uncontrolled environments associated with peacekeeping and the move toward relaxation of concealed weapons laws here in the U.S. provide a strong motivation for developing weapons detection technologies which are noninvasive and can function noncooperatively. Existing weapons detection systems are primarily oriented to detecting metal and require the cooperation of the person being searched. The new generation of detectors under development that focuses primarily on imaging methods, faces problems associated with privacy issues. There remains a need for a weapons detector which is portable, detects weapons remotely, avoids the issues associated with privacy rights, can tell the difference between car keys and a knife, and is affordable enough that one can be issued to every peacekeeper and law enforcement officer. AKELA is developing a concealed weapons detector that uses wideband radar techniques to excite natural electromagnetic resonances that characterize the size, shape, and material composition of an object. Neural network processing is used to classify the difference between weapons and nuisance objects. We have constructed both time and frequency domain test systems and used them to gather experimental data on a variety of armed and unarmed individuals. These experiments have been performed in an environment similar to the operational environment. Preliminary results from these experiments show that it is possible to detect a weapon being carried by an individual from a distance of 10 to 15 feet, and to detect a weapon being concealed behind the back. The power required is about 100 milliwatts. A breadboard system is being fabricated and will be used by AKELA and our law enforcement partner to gather data in operationally realistic situations. While a laptop computer will control the breadboard system, the wideband radar electronics will fit in a box the

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

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

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

  16. Weapons barrel life cycle determination

    Directory of Open Access Journals (Sweden)

    Nebojša Pene Hristov

    2013-10-01

    Full Text Available This article describes the dynamic processes within the gun barrel during the firing process in exploitation. It generally defines the basic principles of constructing tube elements, and shows the distortion of the basic geometry of the tube interior due to wear as well as the impact it causes during exploitation. The article also defines basic empirical models as well as a model based on fracture mechanics for the calculation of a use-life of the barrel, and other elements essential for the safe use of the barrel as the basic weapon element. Erosion causes are analysed in order to control and reduce wear and prolong the lifetime of the gun barrel. It gives directions for the reparation of barrels with wasted resources. In conclusion, the most influential elements of tube wear are given as well as possible modifications of existing systems, primarily propellant charges, with a purpose of prolonging lifetime of gun barrels. The guidelines for a proper determination of the lifetime based on the barrel condition assessment are given as well. INTRODUCTION The barrel as the basic element of each weapon is described as well as the processes occurring during the firing that have impulsive character and are accompanied by large amounts of energy. The basic elements of barrel and itheir constructive characteristics are descibed. The relation between Internal ballistics, ie calculation of the propellant gas pressure in the firing process, and structural elements defined by the barrel material resistance is shown. In general, this part of the study explains the methodology of the gun barrel structural elements calculation, ie. barrel geometry, taking into account the degrees of safety in accordance with Military Standards.   TUBE WEAR AND DEFORMATIONS The weapon barrel gradually wears out during exploitation due to which it no longer satisfies the set requirements. It is considered that the barrel has experienced a lifetime when it fails to fulfill the

  17. Storage assignment problem in flexible manufacturing

    Energy Technology Data Exchange (ETDEWEB)

    Abdel-Hamid, A.

    1994-12-31

    In this talk some results of a joint project with industry that had the aim to speed up the operation of an automatic storage device of a flexible manufacturing system is presented. One of the aspects that influence this speed is the technique used to solve the problem of assigning containers with different sizes to storage locations of an automatic storage system (storage assignment problem, shortly, SAP). Both off-line and on line computational studies of various solution techniques (heuristics, a cutting plane algorithm) to solve SAP are reported. These studies show that under heavy load conditions a considerable speed up of the system can be achieved.

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

  19. Fourth and Fifth Amendment issues raised by Chemical Weapons Convention inspections

    Energy Technology Data Exchange (ETDEWEB)

    Tanzman, E.A. [Argonne National Lab., IL (United States). Economics and Law Section

    1994-10-21

    The Chemical Weapons Convention (CWC) offers a unique challenge to the United States system of constitutional law. This discussion is about the Fourth and Fifth Amendment issues raised by the CWC and about how federal implementing legislation can allow verification inspections to take place in the United States under the Chemical Weapons Convention while remaining in compliance with the Constitution. By implementing legislation, the author means a federal statute that would be enacted separately from Senate approval of the Convention itself. Although implementing legislation is a relatively unusual accompaniment to a treaty, it will be necessary to the CWC, and the Administration has submitted a bill that was under consideration in the last Congress and presumably will be reintroduced early next year. The Fourth and Fifth Amendment problems posed by the CWC arise from the verification inspection scheme embodied in the treaty. The CWC depends heavily on on-site inspections to verify compliance with its key requirements. These include destroying all chemicals weapons stockpiles and bringing potential chemical weapons precursors under international control. The Convention contains four distinct kinds of inspections: systematic inspections of chemical weapons storage and destruction facilities, routine inspections of various declared facilities, challenge inspections, and a variant on challenge inspections in cases of alleged use of chemical weapons. All inspections are supposed to be only as intrusive as necessary to carry out the Convention. These inspections will be carried out by inspectors employed by the Organization for the Prohibition of Chemical Weapons (OPCW), located in The Hague, which is responsible for enforcing the Convention. Generally, the inspected State Party is permitted to assign observers to accompany the inspectors.

  20. Zero Assignment in Multivariable System Using Pole Assignment Method

    OpenAIRE

    Smagina, Ye.

    2002-01-01

    In the paper we consider the invariant zero assignment problem in a linear multivariable system with several inputs/outputs by constructing a system output matrix. The problem is reduced to the pole assignment problem by a state feedback (modal control) in a descriptor system or a regular one. It is shown that the zero assignment and pole assignment are mathematically equivalent problems.

  1. Protein Side-Chain Resonance Assignment and NOE Assignment Using RDC-Defined Backbones without TOCSY Data3

    Science.gov (United States)

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

    2011-01-01

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

  2. 快速降阶匈牙利算法的云计算任务分配模型%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.

  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. Assigning phrase breaks from part-of-speech sequences.

    OpenAIRE

    Black, Alan W.; Taylor, Paul A.

    1997-01-01

    One of the important stages in the process of turning unmarked text into speech is the assignment of appropriate phrase break boundaries. Phrase break boundaries are important to later modules including accent assignment, duration control and pause insertion. A number of different algorithms have been proposed for such a task, ranging from the simple to the complex. These different algorithms require different information such as part of speech tags, syntax and even ...

  5. Taser and Conducted Energy Weapons.

    Science.gov (United States)

    LeClair, Thomas G; Meriano, Tony

    2015-01-01

    It is clear that CEWs are an increasingly prevalent law enforcement tool, adopted to address a complex and challenging problem. The potential for serious injury from a single deployment of a CEW is extremely low. The debate regarding the link between these electrical weapons and sudden in-custody death is likely to continue because their use is often in complex and volatile situations. Any consideration of injuries has to be put into that context. One must also consider what injuries to a subject would result if an alternative force method was used. Furthermore, the potential benefits of CEWs, including reduction in injuries to the public and law-enforcement officers, need to be considered.

  6. Air guns: toys or weapons?

    Science.gov (United States)

    Aslan, Sahin; Uzkeser, Mustafa; Katirci, Yavuz; Cakir, Zeynep; Bilir, Ozlem; Bilge, Fatih; Cakir, Murtaza

    2006-09-01

    Air guns and blank guns may appear relatively harmless at first glance, but they are, in fact, potentially destructive, even lethal, weapons. Approximately 2 to 2.5 million nonpowder firearms are sold annually, and again approximately 12.9 per 100,000 population are treated for such injuries in hospital emergency departments each year in the United States. Unfortunately, these guns are considered to be a toy for children. Therefore, incidents of air gun injuries are gradually increasing. Although such injuries may initially be considered trivial, it may signify severe internal tissue pathologies. These apparently trivial injuries may have catastrophic consequences if unnoticed. In this study, we report 4 cases with head injury due to a shot by these guns. The cases indicate that these people had used the guns belonging to their parents for the purpose of suicide. The cases also show that these machines are not innocent.

  7. Electronic eyebox for weapon sights

    Science.gov (United States)

    Szapiel, Stan; Greenhalgh, Catherine; Wagner, Kevin; Nobes, Ryan

    2016-05-01

    We expand the effective size of the eyebox of a magnified telescopic weapon sight by following the movements of the operator's eye to create a larger, `electronic eyebox'. The original eyebox of the telescope is dynamically relocated in space so that proper overlap between the pupil of the eye and the exit pupil of the device is maintained. Therefore, the operator will perceive the entire field of view of the instrument in a much bigger spatial region than the one defined by the original eyebox. Proof-of-the-concept results are presented with a more than 3.5X enlargement of the eyebox volume along with recommendations for the next phase of development.

  8. Graphical interpretation of Boolean operators for protein NMR assignments

    NARCIS (Netherlands)

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

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

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

  10. Toward a nuclear weapons free world?

    Energy Technology Data Exchange (ETDEWEB)

    Maaranen, S.A. [Los Alamos National Lab., NM (United States). Center for International Security Affairs

    1996-09-01

    Doubts about the wisdom of relying on nuclear weapons are as old as nuclear weapons themselves. But despite this questioning, nuclear weapons came to be seen as the indispensable element of American (indeed Western) security during the Cold War. By the 1970s and 1980s, however, discontent was growing about the intense US-Soviet nuclear arms competition, as it failed to provide any enduring improvement in security; rather, it was seen as creating ever greater risks and dangers. Arms control negotiations and limitations, adopted as a means to regulate the technical competition, may also have relieved some of the political pressures and dangers. But the balance of terror, and the fears of it, continued. The Strategic Defense Initiative (SDI) under President Reagan was a very different approach to escaping from the precarious protection of nuclear weapons, in that it sought a way to continue to defend the US and the West, but without the catastrophic risks of mutual deterrence. As such, SDI connoted unhappiness with the precarious nuclear balance and, for many, with nuclear weapons in general. The disappearance of the Warsaw Pact, the disintegration of the Soviet Union, and the sudden end of the Cold War seemed to offer a unique opportunity to fashion a new, more peaceful world order that might allow for fading away of nuclear weapons. Scholars have foreseen two different paths to a nuclear free world. The first is a fundamental improvement in the relationships between states such that nuclear weapons are no longer needed. The second path is through technological development, e.g., missile defenses which could provide effective protection against nuclear attacks. The paper discusses nuclear weapon policy in the US, views of other nuclear states, the future of nuclear weapons, and issues in a less-nuclear world.

  11. Weapon container catalog. Volumes 1 & 2

    Energy Technology Data Exchange (ETDEWEB)

    Brown, L.A.; Higuera, M.C.

    1998-02-01

    The Weapon Container Catalog describes H-gear (shipping and storage containers, bomb hand trucks and the ancillary equipment required for loading) used for weapon programs and for special use containers. When completed, the catalog will contain five volumes. Volume 1 for enduring stockpile programs (B53, B61, B83, W62, W76, W78, W80, W84, W87, and W88) and Volume 2, Special Use Containers, are being released. The catalog is intended as a source of information for weapon program engineers and also provides historical information. The catalog also will be published on the SNL Internal Web and will undergo periodic updates.

  12. [New challenges in the biological weapons convention].

    Science.gov (United States)

    Sissonen, Susanna; Raijas, Tiina; Haikala, Olli; Hietala, Heikki; Virri, Markku; Nikkari, Simo

    2012-01-01

    Microbes and their toxins are biological weapons that can cause disease in humans, animals or plants, and which can be used with hostile intent in warfare and terrorism. Biological agents can be used as weapons of mass destruction and therefore, immense human and social and major economical damage can be caused. Rapid development of life sciences and technologies during the recent decades has posed new challenges to the Biological Weapons Convention. The Convention states that the States Parties to the BWC strive to ensure that the Convention remains relevant and effective, despite changes in science, technology or politics.

  13. The Spear: An Effective Weapon Since Antiquity

    OpenAIRE

    Robert E. Dohrenwend

    2012-01-01

    The spear is perhaps man’s oldest weapon, and may even be his oldest tool. Over the hundreds of thousands of years of the weapon’s existence, it evolved from a pointed stick into an efficient hunting missile, and then became the most effective hand-held bladed weapon humans ever devised. The spear and its use is the only martial art originally devised for use against species other than our own, and more than any other weapon, the spear emphasizes the relationship between hunting and warfare. ...

  14. The Importance of Designating Cyberspace Weapon Systems

    Science.gov (United States)

    2013-10-01

    PerspectiveSpace Focus Cyberspace Vulnerability Assessment / Hunter Weapon System The Air Force Cyberspace Vulnerability Assessment ( CVA ) / Hunter  weapon...system can perform defensive sorties worldwide via remote or on-site access. The  CVA /Hunter weapon sys- tem is operated by one active duty unit, the...support all of the mission crews. Developed by the for- mer Air Force Information Operations Center, the  CVA /Hunter  weapon system was fielded to the 688th

  15. Reasoning about Assignments in Recursive Data Structures

    Science.gov (United States)

    Tamalet, Alejandro; Madlener, Ken

    This paper presents a framework to reason about the effects of assignments in recursive data structures. We define an operational semantics for a core language based on Meyer's ideas for a semantics for the object-oriented language Eiffel. A series of field accesses, e.g. f1 • f2 • ··· • fn , can be seen as a path on the heap. We provide rules that describe how these multidot expressions are affected by an assignment. Using multidot expressions to construct an abstraction of a list, we show the correctness of a list reversal algorithm. This approach does not require induction and the reasoning about the assignments is encapsulated in the mentioned rules. We also discuss how to use this approach when working with other data structures and how it compares to the inductive approach. The framework, rules and examples have been formalised and proven correct using the PVS proof assistant.

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

  17. 48 CFR 217.173 - Multiyear contracts for weapon systems.

    Science.gov (United States)

    2010-10-01

    ... weapon systems. 217.173 Section 217.173 Federal Acquisition Regulations System DEFENSE ACQUISITION... Mulityear Contracting 217.173 Multiyear contracts for weapon systems. As authorized by 10 U.S.C. 2306b(h... contract for— (a) A weapon system and associated items, services, and logistics support for a weapon system...

  18. 36 CFR 1002.4 - Weapons, traps and nets.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons, traps and nets. 1002... AND RECREATION § 1002.4 Weapons, traps and nets. (a)(1) Except as otherwise provided in this section, the following are prohibited: (i) Possessing a weapon, trap or net. (ii) Carrying a weapon, trap or...

  19. 43 CFR 15.11 - Explosives and dangerous weapons.

    Science.gov (United States)

    2010-10-01

    ... 43 Public Lands: Interior 1 2010-10-01 2010-10-01 false Explosives and dangerous weapons. 15.11... § 15.11 Explosives and dangerous weapons. No person shall carry, use or possess within the Preserve... other kind of weapon potentially harmful to the reef structure. The use of such weapons from beyond the...

  20. A different kind of weapon focus: simulated training with ballistic weapons reduces change blindness.

    Science.gov (United States)

    Taylor, J Eric T; Witt, Jessica K; Pratt, Jay

    2017-01-01

    Attentional allocation is flexibly altered by action-related priorities. Given that tools - and specifically weapons - can affect attentional allocation, we asked whether training with a weapon or holding a weapon during search would affect change detection. In three experiments, participants searched for changes to agents, shootable objects, or environments in the popular flicker paradigm. Participants trained with a simulated weapon or watched a video from the same training perspective and then searched for changes while holding a weapon or a control object. Results show an effect of training, highlighting the importance of sensorimotor experience for the action-relevant allocation of attention, and a possible interaction between training and the object held during search. Simulated training with ballistic weapons reduces change blindness. This result has implications for the interaction between tool use and attentional allocation.

  1. The Dynamic Frequency Assignment Problem

    OpenAIRE

    Dupont, Audrey; Linhares, Andréa,; Artigues, Christian; Feillet, Dominique; Michelon, Philippe; Vasquez, Michel

    2008-01-01

    21 pages; International audience; In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring frequency assignments need to be established throughout a deployment. The problem decomposes in three phases: assignment of an initial kernel of communications, dynamic assignment of new communication links and reparation when no assignment is possible. Different solution...

  2. A Generalized Assignment Game

    OpenAIRE

    Camiña, Ester

    2002-01-01

    The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of both pairwise and group stable outcomes is proved. We study the structure of the group stable set and we finally prove that the set of group stable payoffs forms a complete lattice with one optimal gr...

  3. Controlling Weapons-Grade Fissile Material

    Science.gov (United States)

    Rotblat, J.

    1977-01-01

    Discusses the problems of controlling weapons-grade fissionable material. Projections of the growth of fission nuclear reactors indicates sufficient materials will be available to construct 300,000 atomic bombs each containing 10 kilograms of plutonium by 1990. (SL)

  4. Weapons dismantlement issues in independent Ukraine

    Energy Technology Data Exchange (ETDEWEB)

    Zack, N.R. [Los Alamos National Lab., NM (United States); Kirk, E.J. [American Association for the Advancement of Science, Washington, DC (United States)

    1994-07-01

    The American Association for the Advancement of Science sponsored a seminar during September 1993, in Kiev, Ukraine, entitled ``Toward a Nuclear Free Future -- Barriers and Problems.`` It brought together Ukrainians, Belarusians, and Americans to discuss the legal, political, safeguards and security, economic, and technical dimensions of nuclear weapons dismantlement and destruction. US representatives initiated discussions on legal and treaty requirements and constraints, safeguards and security issues surrounding dismantlement, storage and disposition of nuclear materials, warhead transportation, and economic considerations. Ukrainians gave presentations on arguments for and against the Ukraine keeping nuclear weapons, Ukrainian Parliament non-approval of START I, alternative strategies for dismantling silos and launchers, and economic and security implications of nuclear weapons removal from the Ukraine. Participants from Belarus discussed proliferation and control regime issues, This paper will highlight and detail the issues, concerns, and possible impacts of the Ukraine`s dismantlement of its nuclear weapons.

  5. Europium-155 in Debris from Nuclear Weapons

    DEFF Research Database (Denmark)

    Aarkrog, Asker; Lippert, Jørgen Emil

    1967-01-01

    The lithium-drifted germanium detector enables determination of europium-155 on a routine basis in environmental samples contaminated with debris from nuclear weapons. From measurements of europium-155, cesium-144, and strontium-90 in air filters collected between 1961 and 1966, the yield...... of europium-155 from weapons was estimated at 1400 atoms per 10$^{6}$ fissions, which is close to the yield of europium-155 from fast fission of uranium-238....

  6. Individual Combatant’s Weapons Firing Algorithm Phase 1

    Science.gov (United States)

    2010-06-01

    MNVD) The AN/PVS-14 Monocular Night-Vision Device (MNVD) is a system that uses an aviator- grade , passive, third-generation 12 tube for enhanced...targets to engage. Flgore 4-1. Landscap4ll target. POINT OF AIM Suppressive fire should be well-aimed, sustained, semiautomatic fire. Although...are delivered using the slow semiautomatic rate of fire (one round every 3 to 10 seconds). During training, this allows for a slow and precise

  7. Overall View of Chemical and Biochemical Weapons

    Science.gov (United States)

    Pitschmann, Vladimír

    2014-01-01

    This article describes a brief history of chemical warfare, which culminated in the signing of the Chemical Weapons Convention. It describes the current level of chemical weapons and the risk of using them. Furthermore, some traditional technology for the development of chemical weapons, such as increasing toxicity, methods of overcoming chemical protection, research on natural toxins or the introduction of binary technology, has been described. In accordance with many parameters, chemical weapons based on traditional technologies have achieved the limit of their development. There is, however, a big potential of their further development based on the most recent knowledge of modern scientific and technical disciplines, particularly at the boundary of chemistry and biology. The risk is even higher due to the fact that already, today, there is a general acceptance of the development of non-lethal chemical weapons at a technologically higher level. In the future, the chemical arsenal will be based on the accumulation of important information from the fields of chemical, biological and toxin weapons. Data banks obtained in this way will be hardly accessible and the risk of their materialization will persist. PMID:24902078

  8. Overall view of chemical and biochemical weapons.

    Science.gov (United States)

    Pitschmann, Vladimír

    2014-06-04

    This article describes a brief history of chemical warfare, which culminated in the signing of the Chemical Weapons Convention. It describes the current level of chemical weapons and the risk of using them. Furthermore, some traditional technology for the development of chemical weapons, such as increasing toxicity, methods of overcoming chemical protection, research on natural toxins or the introduction of binary technology, has been described. In accordance with many parameters, chemical weapons based on traditional technologies have achieved the limit of their development. There is, however, a big potential of their further development based on the most recent knowledge of modern scientific and technical disciplines, particularly at the boundary of chemistry and biology. The risk is even higher due to the fact that already, today, there is a general acceptance of the development of non-lethal chemical weapons at a technologically higher level. In the future, the chemical arsenal will be based on the accumulation of important information from the fields of chemical, biological and toxin weapons. Data banks obtained in this way will be hardly accessible and the risk of their materialization will persist.

  9. Overall View of Chemical and Biochemical Weapons

    Directory of Open Access Journals (Sweden)

    Vladimír Pitschmann

    2014-06-01

    Full Text Available This article describes a brief history of chemical warfare, which culminated in the signing of the Chemical Weapons Convention. It describes the current level of chemical weapons and the risk of using them. Furthermore, some traditional technology for the development of chemical weapons, such as increasing toxicity, methods of overcoming chemical protection, research on natural toxins or the introduction of binary technology, has been described. In accordance with many parameters, chemical weapons based on traditional technologies have achieved the limit of their development. There is, however, a big potential of their further development based on the most recent knowledge of modern scientific and technical disciplines, particularly at the boundary of chemistry and biology. The risk is even higher due to the fact that already, today, there is a general acceptance of the development of non-lethal chemical weapons at a technologically higher level. In the future, the chemical arsenal will be based on the accumulation of important information from the fields of chemical, biological and toxin weapons. Data banks obtained in this way will be hardly accessible and the risk of their materialization will persist.

  10. ENVIRONMENTAL CONTAMINATION FROM WEAPON TESTS

    Energy Technology Data Exchange (ETDEWEB)

    none

    1958-10-01

    The program of the Atomic Energy Commission on environmental contamination from weapons tests is designed for the overall evaluation of the hazard to humans from test operations. It is limited to studies of the deposition of activity at long range rather than the problems associated with immediate, close-in fallout. The program has largely been a study of Sr{sup 90}, since considerations based on experience and measurement indicate that it is the isotope of greatest potential hazard. Data are presented pertinent to the monitoring of long-range fallout, particularly Sr{sup 90} and Cs{sup 137}. Values are tabulated for the fallout deposition, air concentrations, water concentrations, and the amounts in foods and human bone. In addition, results are given for some experimental investigations. The report of these results is not interpretative although certain papers that do attempt to interpret the present situation with respect to Sr{sup 90} in particular are reprinted. Bibliographies are presented covering the period since the 1957 hearings before the Joint Committee on Atomic Energy concerning the nature of radioactive fallout and its effects on man. A document list of submissions to the United Nations Scientific Committee on the Effects of Atomic Radiation is given to illustrate the work done in other countries. Several papers on the subject, which have not been generally available, are reprinted.

  11. 模拟退火遗传算法求解面试组专家工作安排问题%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名专家的例子用遗传算法进行求解计算。结果表明,改进后的遗传算法能高效求解出问题的近似最优解,求解结果能满足面试工作安排所提出的要求。

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

  13. Effectiveness of mindfulness and emotion regulation trainings on physical and psychological well-being among chemical weapon victims

    Directory of Open Access Journals (Sweden)

    Mohammad Narimani

    2011-11-01

    Full Text Available Background: Chemical weapon victims are suffering from physical difficulties and psychological trainings may help to decrease these problems. The purpose of this research was to examine the effectiveness of mindfulness and emotion regulation training on physical and psychological well-being in chemical weapon victims.Methods: An experimental, pre-post and follow-up study designed. Forty seven chemical weapon victims men with low mental health in Sardasht city (North-Western Iran randomly selected and assigned into three groups: 1-Mindfulness training group 2- Emotion regulation training group and 3- Control group. The first two groups were received mindfulness-based stress eduction training and emotion regulation training respectively, while no training provided for control group. Data was collected using the General Health Questionnaire, and Physical Syndromes Scale. Analysis of variance with repeated measure was used for analyzing the data.Results: Results indicated that mindfulness and emotion regulation were significantly improved physical syndromes and mental health in chemical weapon victims. Also, the effectiveness of mindfulness in follow-up scores of physical syndromes and in post-test and follow-up scores of mental health was higher than the base line scores (P<0.01. Conclusion: Our findings confirmed effectiveness of mindfulness and emotion regulation on improvement of physical syndromes and mental health in chemical weapon victims. Therefore, mindfulness and emotion regulation training could be suggested for improvement of physical and psychological well-being among chemical weapon victims.

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

  15. 基于效果的舰载软硬武器近卫火力分配研究%Rearch on Fire Distribution Methods Based on Operation Effect about Attacking Targets in Near Area of Surface Ship Using Shipborn Hard and Soft Weapon

    Institute of Scientific and Technical Information of China (English)

    解维河; 吴从旭; 汪德虎

    2013-01-01

    针对水面舰艇利用软硬杀伤武器抗击近区目标作战使用问题,提出基于毁伤失能和据止等作战效果的软硬武器使用火力决策方法,建立水面舰艇近卫作战软硬武器火力分配模型,通过实例建立模型,并将建立的非线性模型转化成利用匈牙利算法进行解算的指派问题进行模型解算,研究的方法和结果对水面舰艇近卫作战火力分配决策方案的制定具有一定的指导意义.%According to the operational problems about the surface ship using soft and hard weapons against nearly area target,the solution method about the use of the hard and soft weapon fire decision-making method based on the damage disability and stop fighting effect is proposed,the hard and soft weapon fire distribution model and practical use modelis established,transform the nonlinear model into the assignment problem model,and is calculated in Hungary algorithm,the research methods and results of surface ship near area defense firepower allocation decision scheme formulation has certain guiding significance.

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

  17. Two-dimensional assignment with merged measurements using Langrangrian relaxation

    Science.gov (United States)

    Briers, Mark; Maskell, Simon; Philpott, Mark

    2004-01-01

    Closely spaced targets can result in merged measurements, which complicate data association. Such merged measurements violate any assumption that each measurement relates to a single target. As a result, it is not possible to use the auction algorithm in its simplest form (or other two-dimensional assignment algorithms) to solve the two-dimensional target-to-measurement assignment problem. We propose an approach that uses the auction algorithm together with Lagrangian relaxation to incorporate the additional constraints resulting from the presence of merged measurements. We conclude with some simulated results displaying the concepts introduced, and discuss the application of this research within a particle filter context.

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

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

  20. Modern weapons and military equipment for issue no. 3-2015

    OpenAIRE

    ЙЕВТИЧ МИЛОШ М.

    2015-01-01

    Optimal features for concealed carry weapons. The specificity of jobs and tasks that require concealed carrying of weapons by officials require specific criteria when choosing personal weapons specialist.

  1. MODERN WEAPONS AND MILITARY EQUIPMENT FOR ISSUE NO. 3-2015

    OpenAIRE

    2015-01-01

    Optimal features for concealed carry weapons. The specificity of jobs and tasks that require concealed carrying of weapons by officials require specific criteria when choosing personal weapons specialist.

  2. Color image fusion for concealed weapon detection

    Science.gov (United States)

    Toet, Alexander

    2003-09-01

    Recent advances in passive and active imaging sensor technology offer the potential to detect weapons that are concealed underneath a person's clothing or carried along in bags. Although the concealed weapons can sometimes easily be detected, it can be difficult to perceive their context, due to the non-literal nature of these images. Especially for dynamic crowd surveillance purposes it may be impossible to rapidly asses with certainty which individual in the crowd is the one carrying the observed weapon. Sensor fusion is an enabling technology that may be used to solve this problem. Through fusion the signal of the sensor that depicts the weapon can be displayed in the context provided by a sensor of a different modality. We propose an image fusion scheme in which non-literal imagery can be fused with standard color images such that the result clearly displays the observed weapons in the context of the original color image. The procedure is such that the relevant contrast details from the non-literal image are transferred to the color image without altering the original color distribution of this image. The result is a natural looking color image that fluently combines all details from both input sources. When an observer who performs a dynamic crowd surveillance task, detects a weapon in the scene, he will also be able to quickly determine which person in the crowd is actually carrying the observed weapon (e.g. "the man with the red T-shirt and blue jeans"). The method is illustrated by the fusion of thermal 8-12 μm imagery with standard RGB color images.

  3. 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中的部分实例,说明了方法的有效和可行性.

  4. Future of clip-on weapon sights: pros and cons from an applications perspective

    Science.gov (United States)

    Knight, C. Reed; Greenslade, Ken; Francisco, Glen

    2015-05-01

    US Domestic, International, allied Foreign National Warfighters and Para-Military First Responders (Police, SWAT, Special Operations, Law Enforcement, Government, Security and more) are put in harm's way all the time. To successfully complete their missions and return home safely are the primary goals of these professionals. Tactical product improvements that affect mission effectiveness and solider survivability are pivotal to understanding the past, present and future of Clip-On in-line weapon sights. Clip-On Weapon Sight (WS) technology was deemed an interim solution by the US Government for use until integrated and fused (day/night multi-sensor) Weapon Sights (WSs) were developed/fielded. Clip-On has now become the solution of choice by Users, Warriors, Soldiers and the US Government. SWaP-C (size, weight and power -cost) has been improved through progressive advances in Clip-On Image Intensified (I2), passive thermal, LL-CMOS and fused technology. Clip-On Weapon Sights are now no longer mounting position sensitive. Now they maintain aim point boresight, so they can be used for longer ranges with increased capabilities while utilizing the existing zeroed weapon and daysight optic. Active illuminated low-light level (both analog I2 and digital LL-CMOS) imaging is rightfully a real-world technology, proven to deliver daytime and low-light level identification confidence. Passive thermal imaging is also a real-world technology, proven to deliver daytime, nighttime and all-weather (including dirty battlefield) target detection confidence. Image processing detection algorithms with intelligent analytics provide documented promise to improve confidence by reducing Users, Warriors and Soldiers' work-loads and improving overall system engagement solution outcomes. In order to understand the future of Clip-On in-line weapon sights, addressing pros and cons, this paper starts with an overview of historical weapon sight applications, technologies and stakeholder decisions

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

  6. Parallel scheduling algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Dekel, E.; Sahni, S.

    1983-01-01

    Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.

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

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

  9. Locomotive Assignment Optimization Including Train Delays

    Directory of Open Access Journals (Sweden)

    Sandra Kasalica

    2013-10-01

    Full Text Available Intention– Cyclic locomotive assignment planning is a specific type of organization of locomotive usage, and in fact, it means putting the complete workload to a closed chain, which is repeated periodically. The concept of cyclic locomotive assignment planning type organization in the area of train traction has proven in practice as the best one, but as it is made for in-advance defined timetable and without considering the stochastic nature of the timetable realization process, it leads to incompatibility in using locomotives. Methodology – Methodology defined in this paper contains: research of train delays on the Serbian Railways and Montenegrin Railways networks, analysis of the real system organization of locomotive usage in conditions of train delays, theoretical thesis of solving the problem of optimal cyclic locomotive assignment planning in conditions of train delays, designing of a model with algorithms, preparing the software package, testing the model and program with results, as well as the conclusions drawn from the complete research project. Results– The optimization model of cyclic locomotive assignment planning during the process of making timetable including train delays has been defined. Conclusion –The obtained results have shown as expected, that the larger delays of trains required a larger number of locomotives. However, by using this model it is possible to optimize the required number of locomotives, taking into account the real time delays of trains.

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

  11. Prions: the danger of biochemical weapons

    Directory of Open Access Journals (Sweden)

    Eric Almeida Xavier

    2014-09-01

    Full Text Available The knowledge of biotechnology increases the risk of using biochemical weapons for mass destruction. Prions are unprecedented infectious pathogens that cause a group of fatal neurodegenerative diseases by a novel mechanism. They are transmissible particles that are devoid of nucleic acid. Due to their singular characteristics, Prions emerge as potential danger since they can be used in the development of such weapons. Prions cause fatal infectious diseases, and to date there is no therapeutic or prophylactic approach against these diseases. Furthermore, Prions are resistant to food-preparation treatments such as high heat and can find their way from the digestive system into the nervous system; recombinant Prions are infectious either bound to soil particles or in aerosols. Therefore, lethal Prions can be developed by malicious researchers who could use it to attack political enemies since such weapons cause diseases that could be above suspicion.

  12. Evaluation of Automatically Assigned Job-Specific Interview Modules.

    Science.gov (United States)

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

    2016-08-01

    In community-based epidemiological studies, job- and industry-specific 'modules' are often used to systematically obtain details about the subject's work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the correct module. We evaluated, in the context of a case-control study of lymphoid neoplasms in Asia ('AsiaLymph'), the performance of an algorithm that provided automatic, real-time module assignment during a computer-assisted personal interview. AsiaLymph's occupational component began with a lifetime occupational history questionnaire with free-text responses and three solvent exposure screening questions. To assign each job to one of 23 study-specific modules, an algorithm automatically searched the free-text responses to the questions 'job title' and 'product made or services provided by employer' using a list of module-specific keywords, comprising over 5800 keywords in English, Traditional and Simplified Chinese. Hierarchical decision rules were used when the keyword match triggered multiple modules. If no keyword match was identified, a generic solvent module was assigned if the subject responded 'yes' to any of the three solvent screening questions. If these question responses were all 'no', a work location module was assigned, which redirected the subject to the farming, teaching, health professional, solvent, or industry solvent modules or ended the questions for that job, depending on the location response. We conducted a reliability assessment that compared the algorithm-assigned modules to consensus module assignments made by two industrial hygienists for a subset of 1251 (of 11409) jobs selected using a stratified random selection procedure using module-specific strata. Discordant assignments between the algorithm and consensus assignments (483 jobs) were qualitatively reviewed by the hygienists to evaluate the potential information lost from missed questions with using

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

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

    NARCIS (Netherlands)

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

    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

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

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

    NARCIS (Netherlands)

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

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

  17. Task Analyses of Three Selected Weapons Systems.

    Science.gov (United States)

    1976-10-01

    using weapons is a joint function of the specific weapon system, the goals (missions) of the system, and the environment in which it is used. The first...Identification of fire mission profiles which state general job functions for each type of typical mission. Documentary sources such as Field Manuals...nd Arin,,, Ui, Guni i A,!i" tant uuPnrr No. I Can; n , r Grup - ( nile. .rs and Prir Diff,-ront S, tm: -inch L,,t.’r _, Fort Hood l::t Cavall, I

  18. #TheWeaponizationOfSocialMedia

    DEFF Research Database (Denmark)

    Nissen, Thomas Elkjer

    In today’s conflict environment, transformed by information technology and of who can communicate and how, states, non-state actors, ad hoc activist networks and individuals create effect(s) in and through social network media in support of their objectives. #TheWeaponizationOfSocialMedia develops...... a framework for understanding how social network media shapes global politics and contemporary conflicts by examining their role as a platform for conduction intelligence collection, targeting, cyber-operations, psychological warfare and command and control activities. Through these, the weaponization...

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

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

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

  2. 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...... are collected to carry out the computational comparison. Although the literature has documented these algorithms, this work may be a first attempt to evaluate their performance using a set of realistic flight data....

  3. Implementing the chemical weapons convention

    Energy Technology Data Exchange (ETDEWEB)

    Kellman, B.; Tanzman, E. A.

    1999-12-07

    In 1993, as the CWC ratification process was beginning, concerns arose that the complexity of integrating the CWC with national law could cause each nation to implement the Convention without regard to what other nations were doing, thereby causing inconsistencies among States as to how the CWC would be carried out. As a result, the author's colleagues and the author prepared the Manual for National Implementation of the Chemical Weapons Convention and presented it to each national delegation at the December 1993 meeting of the Preparatory Commission in The Hague. During its preparation, the Committee of CWC Legal Experts, a group of distinguished international jurists, law professors, legally-trained diplomats, government officials, and Parliamentarians from every region of the world, including Central Europe, reviewed the Manual. In February 1998, they finished the second edition of the Manual in order to update it in light of developments since the CWC entered into force on 29 April 1997. The Manual tries to increase understanding of the Convention by identifying its obligations and suggesting methods of meeting them. Education about CWC obligations and available alternatives to comply with these requirements can facilitate national response that are consistent among States Parties. Thus, the Manual offers options that can strengthen international realization of the Convention's goals if States Parties act compatibly in implementing them. Equally important, it is intended to build confidence that the legal issues raised by the Convention are finite and addressable. They are now nearing competition of an internet version of this document so that interested persons can access it electronically and can view the full text of all of the national implementing legislation it cites. The internet address, or URL, for the internet version of the Manual is http: //www.cwc.ard.gov. This paper draws from the Manual. It comparatively addresses approximately thirty

  4. 10 CFR Appendix H to Part 73 - Weapons Qualification Criteria

    Science.gov (United States)

    2010-01-01

    ... position, then fire 2 rounds and reholster 2 15 yards 2 5 seconds Standing, draw weapon, move to kneeling...) Standing, draw weapon, fire 2 rounds, move to kneeling position and fire 2 rounds, reload and reholster Minimum qualifying = 70%. 4 15 yards 2 5 seconds Draw weapon and fire 2 rounds standing, come to low...

  5. 25 CFR 11.444 - Carrying concealed weapons.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Carrying concealed weapons. 11.444 Section 11.444 Indians... ORDER CODE Criminal Offenses § 11.444 Carrying concealed weapons. A person who goes about in public places armed with a dangerous weapon concealed upon his or her person is guilty of a misdemeanor unless...

  6. Someone at School Has a Weapon. What Should I Do?

    Science.gov (United States)

    ... for You Shyness Someone at School Has a Weapon. What Should I Do? KidsHealth > For Teens > Someone at School Has a Weapon. What Should I Do? Print A A A ... Why do students bring guns, knives, or other weapons to school? Some are just showing off, others ...

  7. 76 FR 1136 - Electroshock Weapons Test and Measurement Workshop

    Science.gov (United States)

    2011-01-07

    ... National Institute of Standards and Technology Electroshock Weapons Test and Measurement Workshop AGENCY..., academia, military, test instrument manufacturers, etc.) of electroshock weapons that provide stand-off... requirements for electroshock weapons, the Law Enforcement Standards Office (OLES) at NIST has developed...

  8. 46 CFR 386.23 - Weapons and explosives.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 8 2010-10-01 2010-10-01 false Weapons and explosives. 386.23 Section 386.23 Shipping... AND GROUNDS AT THE UNITED STATES MERCHANT MARINE ACADEMY § 386.23 Weapons and explosives. No person shall carry or possess firearms, other dangerous or deadly weapons or parts thereof, explosives or items...

  9. Agent-based Modeling Methodology for Analyzing Weapons Systems

    Science.gov (United States)

    2015-03-26

    43 Figure 14: Simulation Study Methodology for the Weapon System Analysis Metrics Definition and Data Collection The analysis plan calls for...AGENT-BASED MODELING METHODOLOGY FOR ANALYZING WEAPONS SYSTEMS THESIS Casey D. Connors, Major, USA...AGENT-BASED MODELING METHODOLOGY FOR ANALYZING WEAPONS SYSTEMS THESIS Presented to the Faculty Department of Operational Sciences

  10. 36 CFR 702.7 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons and explosives. 702.7... Weapons and explosives. Except where duly authorized by law, and in the performance of law enforcement functions, no person shall carry firearms, other dangerous or deadly weapons, or explosives, either openly...

  11. 7 CFR 501.12 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 501.12 Section 501.12... OF AGRICULTURE CONDUCT ON U.S. MEAT ANIMAL RESEARCH CENTER, CLAY CENTER, NEBRASKA § 501.12 Weapons... arrows, darts, other dangerous or deadly weapons, or explosives, either openly or concealed, except as...

  12. 31 CFR 407.13 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Weapons and explosives. 407.13... TREASURY ANNEX § 407.13 Weapons and explosives. No person while on the property shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or concealed, except for official purposes. ...

  13. 49 CFR 1544.219 - Carriage of accessible weapons.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 9 2010-10-01 2010-10-01 false Carriage of accessible weapons. 1544.219 Section...: AIR CARRIERS AND COMMERCIAL OPERATORS Operations § 1544.219 Carriage of accessible weapons. (a... weapons, do not apply to a law enforcement officer (LEO) aboard a flight for which screening is required...

  14. 31 CFR 91.13 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 1 2010-07-01 2010-07-01 false Weapons and explosives. 91.13 Section... CONDUCT IN OR ON THE BUREAU OF THE MINT BUILDINGS AND GROUNDS § 91.13 Weapons and explosives. No person while on the property shall carry firearms, other dangerous or deadly weapons, or explosives, either...

  15. 44 CFR 15.15 - Weapons and explosives.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Weapons and explosives. 15.15... EMERGENCY TRAINING CENTER § 15.15 Weapons and explosives. No person entering or while at Mt. Weather or the NETC will carry or possess firearms, other dangerous or deadly weapons, explosives or items intended to...

  16. 7 CFR 502.13 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 502.13 Section 502.13....13 Weapons and explosives. No person while in or on BARC property shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or concealed, except as officially authorized for...

  17. 32 CFR 552.125 - Disposition of confiscated weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 3 2010-07-01 2010-07-01 true Disposition of confiscated weapons. 552.125..., Ammunition, and Explosives-Fort Lewis, Washington § 552.125 Disposition of confiscated weapons. Commanders will maintain confiscated weapons in the unit arms room pending final disposition. They will provide...

  18. 36 CFR 504.14 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons and explosives. 504... GOVERNING SMITHSONIAN INSTITUTION BUILDINGS AND GROUNDS § 504.14 Weapons and explosives. No person while on the premises shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or...

  19. 31 CFR 0.215 - Possession of weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 1 2010-07-01 2010-07-01 false Possession of weapons and explosives... OF THE TREASURY EMPLOYEE RULES OF CONDUCT Rules of Conduct § 0.215 Possession of weapons and explosives. (a) Employees shall not possess firearms, explosives, or other dangerous or deadly weapons...

  20. 7 CFR 500.12 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 500.12 Section 500.12... OF AGRICULTURE NATIONAL ARBORETUM Conduct on U.S. National Arboreturm Property § 500.12 Weapons and... weapons, or explosives, either openly or concealed, except for authorized official purposes. (b) No person...

  1. 7 CFR 503.13 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 503.13 Section 503.13... OF AGRICULTURE CONDUCT ON PLUM ISLAND ANIMAL DISEASE CENTER § 503.13 Weapons and explosives. No person while in or on the PIADC shall carry firearms or other dangerous or deadly weapons or explosives...

  2. 36 CFR 13.30 - Weapons, traps and nets.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Weapons, traps and nets. 13... INTERIOR NATIONAL PARK SYSTEM UNITS IN ALASKA General Provisions § 13.30 Weapons, traps and nets. (a... of this chapter, the following are prohibited— (1) Possessing a weapon, trap, or net; (2) Carrying a...

  3. 14 CFR 135.119 - Prohibition against carriage of weapons.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Prohibition against carriage of weapons... Flight Operations § 135.119 Prohibition against carriage of weapons. No person may, while on board an aircraft being operated by a certificate holder, carry on or about that person a deadly or dangerous weapon...

  4. 32 CFR 228.7 - Prohibition on weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 2 2010-07-01 2010-07-01 false Prohibition on weapons and explosives. 228.7... (CONTINUED) MISCELLANEOUS SECURITY PROTECTIVE FORCE § 228.7 Prohibition on weapons and explosives. No persons... illegal or legally controlled weapon (e.g., throwing stars, switchblades), explosives, or items intended...

  5. 4 CFR 25.14 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 4 Accounts 1 2010-01-01 2010-01-01 false Weapons and explosives. 25.14 Section 25.14 Accounts... AND ON ITS GROUNDS § 25.14 Weapons and explosives. No person while entering or in the GAO Building or on its grounds shall carry or possess firearms, other dangerous or deadly weapons, explosives or...

  6. 31 CFR 700.11 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Weapons and explosives. 700.11... FEDERAL LAW ENFORCEMENT TRAINING CENTER (FLETC) BUILDINGS AND GROUNDS § 700.11 Weapons and explosives. No person, while on the property, shall carry firearms, other dangerous or deadly weapons, or explosives...

  7. 50 CFR 27.43 - Weapons other than firearms.

    Science.gov (United States)

    2010-10-01

    ... 50 Wildlife and Fisheries 6 2010-10-01 2010-10-01 false Weapons other than firearms. 27.43 Section... (CONTINUED) THE NATIONAL WILDLIFE REFUGE SYSTEM PROHIBITED ACTS Disturbing Violations: With Weapons § 27.43 Weapons other than firearms. The use or possession of cross bows, bows and arrows, air guns, spears, gigs...

  8. 43 CFR 423.30 - Weapons, firearms, explosives, and fireworks.

    Science.gov (United States)

    2010-10-01

    ... 43 Public Lands: Interior 1 2010-10-01 2010-10-01 false Weapons, firearms, explosives, and... WATERBODIES Rules of Conduct § 423.30 Weapons, firearms, explosives, and fireworks. (a) You may possess... exceptions: (1) You must not have a weapon in your possession when at or in a Reclamation facility. (2) You...

  9. 36 CFR 520.15 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons and explosives. 520... Weapons and explosives. No person while on the premises shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or concealed, except for official purposes, nor shall any person...

  10. 15 CFR 265.39 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 1 2010-01-01 2010-01-01 false Weapons and explosives. 265.39 Section..., GAITHERSBURG, MARYLAND, AND BOULDER AND FORT COLLINS, COLORADO Buildings and Grounds § 265.39 Weapons and... dangerous or deadly weapons or materials, or explosives, either openly or concealed, without the written...

  11. Demand Analysis of Informational Shipboard Gun Weapon System Interface Design

    Directory of Open Access Journals (Sweden)

    WANG Hui-chuan

    2013-04-01

    Full Text Available According to development demand of informational shipboard gun weapon system, design concept of shipboard gun weapon system interface is proposed. System composition is put forward and function demand of interface is analyzed from combat, training and detection aspects. General principle need to be followed in design process. A new concept is provided for development of shipboard gun weapon system interface.

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

  13. Interactive visual exploration and refinement of cluster assignments.

    Science.gov (United States)

    Kern, Michael; Lex, Alexander; Gehlenborg, Nils; Johnson, Chris R

    2017-09-12

    With ever-increasing amounts of data produced in biology research, scientists are in need of efficient data analysis methods. Cluster analysis, combined with visualization of the results, is one such method that can be used to make sense of large data volumes. At the same time, cluster analysis is known to be imperfect and depends on the choice of algorithms, parameters, and distance measures. Most clustering algorithms don't properly account for ambiguity in the source data, as records are often assigned to discrete clusters, even if an assignment is unclear. While there are metrics and visualization techniques that allow analysts to compare clusterings or to judge cluster quality, there is no comprehensive method that allows analysts to evaluate, compare, and refine cluster assignments based on the source data, derived scores, and contextual data. In this paper, we introduce a method that explicitly visualizes the quality of cluster assignments, allows comparisons of clustering results and enables analysts to manually curate and refine cluster assignments. Our methods are applicable to matrix data clustered with partitional, hierarchical, and fuzzy clustering algorithms. Furthermore, we enable analysts to explore clustering results in context of other data, for example, to observe whether a clustering of genomic data results in a meaningful differentiation in phenotypes. Our methods are integrated into Caleydo StratomeX, a popular, web-based, disease subtype analysis tool. We show in a usage scenario that our approach can reveal ambiguities in cluster assignments and produce improved clusterings that better differentiate genotypes and phenotypes.

  14. Managing nuclear weapons in the United States

    Energy Technology Data Exchange (ETDEWEB)

    Miller, G.

    1993-03-16

    This report discusses the management and security of nuclear weapons in the post-cold war United States. The definition of what constitutes security is clearly changing in the US. It is now a much more integrated view that includes defense and the economy. The author tries to bring some semblance of order to these themes in this brief adaptation of a presentation.

  15. Optical countermeasures against CLOS weapon systems

    NARCIS (Netherlands)

    Toet, A.; Benoist, K.W.; Lingen, J.N.J. van; Schleijpen, H.M.A.

    2013-01-01

    There are many weapon systems in which a human operator acquires a target, tracks it and designates it. Optical countermeasures against this type of systems deny the operator the possibility to fulfill this visual task. We describe the different effects that result from stimulation of the human

  16. Europium-155 in Debris from Nuclear Weapons

    DEFF Research Database (Denmark)

    Aarkrog, Asker; Lippert, Jørgen Emil

    1967-01-01

    The lithium-drifted germanium detector enables determination of europium-155 on a routine basis in environmental samples contaminated with debris from nuclear weapons. From measurements of europium-155, cesium-144, and strontium-90 in air filters collected between 1961 and 1966, the yield...

  17. The Politics of Weapons Standardization in NATO.

    Science.gov (United States)

    1981-07-01

    does raise new and useful perspectives on the problem. And, as he notes, it raises the spectre that instead of attacking the causes of NATO’s malaise...construct- ing his Utopia . 1 58 Two articles, which focus on the weapons procurement process within the United States alone, note the unnecessary

  18. Nuclear Weapon Testing Limitations and International Security

    Science.gov (United States)

    Corden, Pierce S.

    2017-01-01

    For over 50 years stopping nuclear weapon tests has been sought to support achieving international security without nuclear weapons. Testing is the critical path beyond primitive fission devices, e.g. to develop thermonuclear weapons, reduce weight and volume and increase yield. The 1958 Geneva Conference of Experts considered ways to verify a test ban. With then-limitations on seismology, and lack of in-country monitoring and on-site inspections, the 1963 Limited Test Ban Treaty prohibits testing only in the atmosphere, outer space and under water, and is verified by National Technical Means. The US and USSR agreed to a limit of 150 kilotons on underground explosions in the 1970s-80s. The 1996 Comprehensive Nuclear-Test-Ban Treaty bans all nuclear explosions. Its International Monitoring System - seismic, hydroacoustic, infrasound and radionuclide sensors - is being used, and has easily detected testing by the DPRK. On-site inspections will be available under an in-force Treaty. A 2012 National Academy report concludes that cheating attempts would not undermine U.S. security, and the program for monitoring and extending the life of US weapons has succeeded since US testing ceased in 1992.

  19. Principles of Guided Missiles and Nuclear Weapons.

    Science.gov (United States)

    Naval Personnel Program Support Activity, Washington, DC.

    Fundamentals of missile and nuclear weapons systems are presented in this book which is primarily prepared as the second text of a three-volume series for students of the Navy Reserve Officers' Training Corps and the Officer Candidate School. Following an introduction to guided missiles and nuclear physics, basic principles and theories are…

  20. The Spear: An Effective Weapon Since Antiquity

    Directory of Open Access Journals (Sweden)

    Robert E. Dohrenwend

    2012-07-01

    Full Text Available The spear is perhaps man’s oldest weapon, and may even be his oldest tool. Over the hundreds of thousands of years of the weapon’s existence, it evolved from a pointed stick into an efficient hunting missile, and then became the most effective hand-held bladed weapon humans ever devised. The spear and its use is the only martial art originally devised for use against species other than our own, and more than any other weapon, the spear emphasizes the relationship between hunting and warfare. Virtually without exception, the spear is present wherever there are humans. The spear may claim to be the senior martial art, and the weapon is still in use today. Early techniques are preserved by the small number of Japanese sojutsu schools, and modern Chinese martial artists have developed elegant and impressive gymnastic routines for the spear. The javelin throw is a modern Olympic track and field event, and there are people who have resurrected the Aztec atlatl for sporting competition. Today, the spear is still used in Europe for hunting wild boar, and the continued issue of the obsolete bayonet to modern soldiers testifies to a deep, almost instinctive respect still possessed by the military for the spear.

  1. [Consequences learned from the use of chemical weapons during the First World War for the modern military medicine].

    Science.gov (United States)

    Belskikh, A N; Basharin, V A; Chepur, S V; Khalimov, Yu Sh; Markizova, N F

    2015-08-01

    The article describes the way medical service dealed with problems resulted from the use of chemical weapons during the First World War (1914-1918). It was revealed that many of the abovementioned problems remain unsolved up to the present moment. It is stated the existence of the threat of use of chemical weapons in modem military conflicts, which expands the area of responsibility for medical chemical protection. The authors proved necessity and algorithm of the training system, considered as a part of medical protection in case of adverse factors of chemical nature.

  2. Assigning agents to a line

    DEFF Research Database (Denmark)

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

    2014-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. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and assigned...

  3. 基于改进递推预测误差神经网络算法的极点配置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.

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

  5. Air gun wounding and current UK laws controlling air weapons.

    Science.gov (United States)

    Bruce-Chwatt, Robert Michael

    2010-04-01

    Air weapons whether rifles or pistols are, potentially, lethal weapons. The UK legislation is complex and yet little known to the public. Hunting with air weapons and the laws controlling those animals that are permitted to be shot with air weapons is even more labyrinthine due to the legal power limitations on the possession of air weapons. Still relatively freely available by mail order or on the Internet, an increasing number of deaths have been reported from the misuse of air weapons or accidental discharges. Ammunition for air weapons has become increasingly sophisticated, effective and therefore increasingly dangerous if misused, though freely available being a mere projectile without a concomitant cartridge containing a propellant and an initiator.

  6. A Statistical Programme Assignment Model

    DEFF Research Database (Denmark)

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

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

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

  8. The Art of Probability Assignment

    CERN Document Server

    Dimitrov, Vesselin I

    2012-01-01

    The problem of assigning probabilities when little is known is analized in the case where the quanities of interest are physical observables, i.e. can be measured and their values expressed by numbers. It is pointed out that the assignment of probabilities based on observation is a process of inference, involving the use of Bayes' theorem and the choice of a probability prior. When a lot of data is available, the resulting probability are remarkable insensitive to the form of the prior. In the oposite case of scarse data, it is suggested that the probabilities are assigned such that they are the least sensitive to specific variations of the probability prior. In the continuous case this results in a probability assignment rule wich calls for minimizing the Fisher information subject to constraints reflecting all available information. In the discrete case, the corresponding quantity to be minimized turns out to be a Renyi distance between the original and the shifted distribution.

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

  10. #TheWeaponizationOfSocialMedia

    DEFF Research Database (Denmark)

    Nissen, Thomas Elkjer

    In today’s conflict environment, transformed by information technology and of who can communicate and how, states, non-state actors, ad hoc activist networks and individuals create effect(s) in and through social network media in support of their objectives. #TheWeaponizationOfSocialMedia develops...... a framework for understanding how social network media shapes global politics and contemporary conflicts by examining their role as a platform for conduction intelligence collection, targeting, cyber-operations, psychological warfare and command and control activities. Through these, the weaponization...... of social media shows both the possibilities and the limitations of social network media in contemporary conflicts and makes a contribution to theorizing and studying contemporary conflicts....

  11. Emergency management of chemical weapons injuries.

    Science.gov (United States)

    Anderson, Peter D

    2012-02-01

    The potential for chemical weapons to be used in terrorism is a real possibility. Classes of chemical weapons include nerve agents, vesicants (blister agents), choking agents, incapacitating agents, riot control agents, blood agents, and toxic industrial chemicals. The nerve agents work by blocking the actions of acetylcholinesterase leading to a cholinergic syndrome. Nerve agents include sarin, tabun, VX, cyclosarin, and soman. The vesicants include sulfur mustard and lewisite. The vesicants produce blisters and also damage the upper airways. Choking agents include phosgene and chlorine gas. Choking agents cause pulmonary edema. Incapacitating agents include fentanyl and its derivatives and adamsite. Riot control agents include Mace and pepper spray. Blood agents include cyanide. The mechanism of toxicity for cyanide is blocking oxidative phosphorylation. Toxic industrial chemicals include agents such as formaldehyde, hydrofluoric acid, and ammonia.

  12. Making Weapons for the Terracotta Army

    Directory of Open Access Journals (Sweden)

    Marcos Martinón-Torres

    2011-10-01

    Full Text Available The Terracotta Army of the First Emperor of China is one of the most emblematic archaeological sites in the world. Many questions remain about the logistics of technology, standardisation and labour organisation behind the creation of such a colossal construction in just a few decades over 2,000 years ago. An ongoing research project co-ordinated between the UCL Institute of Archaeology and the Emperor Qin Shihang's Terracotta Army Museum is beginning to address some of these questions. This paper outlines some results of the typological, metric, microscopic, chemical and spatial analyses of the 40,000 bronze weapons recovered with the Terracotta Warriors. Thanks to a holistic approach developed specifically for this project, it is possible to reveal remarkable aspects of the organisation of the Qin workforce in production cells, of the standardisation, efficiency and quality-control procedures employed, and of the sophisticated technical knowledge of the weapon-makers.

  13. Ending the scourge of chemical weapons

    Energy Technology Data Exchange (ETDEWEB)

    Brin, J.

    1993-04-01

    After more than 20 years of arduous negotiations, representatives from 131 countries gathered in Paris in January to sign a treaty banning the development, production, and transfer to other countries of chemical-warfare agents and their means of delivery. The treaty - called the Chemical Weapons Convention, or CWC - complements the more limited Geneva Protocol of 1925, which bans the use of toxic chemicals in warfare. When the CWC enters into force in about two years, it will prohibit the manufacture for military purposes of lethal chemicals such as sulfur mustard, which causes painful skin blistering and lung damage, and nerve agents, which cause rapid death by interfering with the transmission of nerve impulses. The goal is to eliminate from the earth this particularly inhumane form of warfare. The paper discusses facets of the treaty, especially the verification challenge with its inspection on demand features. Short accompanying pieces discuss classifying chemicals and the destruction of chemical weapons under the CWC.

  14. Effects of nuclear weapons. Third edition

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, S.; Dolan, P.J.

    1977-01-01

    Since the last edition of ''The Effects of Nuclear Weapons'' in 1962 much new information has become available concerning nuclear weapon effects. This has come in part from the series of atmospheric tests, including several at very high altitudes, conducted in the Pacific Ocean area in 1962. In addition, laboratory studies, theoretical calculations, and computer simulations have provided a better understanding of the various effects. A new chapter has been added on the electromagnetic pulse. The chapter titles are as follows: general principles of nuclear explosions; descriptions of nuclear explosions; air blast phenomena in air and surface bursts; air blast loading; structural damage from air blast; shock effects of surface and subsurface bursts; thermal radiation and its effects; initial nuclear radiation; residual nuclear radiation and fallout; radio and radar effects; the electromagnetic pulse and its effects; and biological effects. (LTN)

  15. The Effects of Nuclear Weapons. Third edition

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, S; Dolan, P J

    1977-01-01

    Since the last edition of ''The Effects of Nuclear Weapons'' in 1962 much new information has become available concerning nuclear weapon effects. This has come in part from the series of atmospheric tests, including several at very high altitudes, conducted in the Pacific Ocean area in 1962. In addition, laboratory studies, theoretical calculations, and computer simulations have provided a better understanding of the various effects. A new chapter has been added on the electromagnetic pulse. The chapter titles are as follows: general principles of nuclear explosions; descriptions of nuclear explosions; air blast phenomena in air and surface bursts; air blast loading; structural damage from air blast; shock effects of surface and subsurface bursts; thermal radiation and its effects; initial nuclear radiation; residual nuclear radiation and fallout; radio and radar effects; the electromagnetic pulse and its effects; and biological effects. (LTN)

  16. Civil monetary penalties--weapon against fraud or instrument of health policy?

    Science.gov (United States)

    Barton, H M

    1989-06-01

    Most physicians are aware of the highly publicized aspects of government health care regulation, including attempts at mandatory physician assignment and recoupment of services deemed medically unnecessary. There is less awareness of the potential pitfalls of civil monetary penalties, as many physicians believe they are primarily applicable to false claim allegations. However, the use of civil monetary penalties is increasing as Congress creates new bases of liability. This development leads to the question: Are civil monetary penalties a weapon against fraud or an instrument of federal policy?

  17. Applications of Assignment Algorithms to Nonparametric Tests for Homogeneity

    Science.gov (United States)

    2009-09-01

    and Siegmund MST Minimum spanning tree MD Mahalanobis distance MD-R Mahalanobis distance, robust NAP Non-Bipartite Accumulated Pairs NNVE...competitor, the maximum likelihood ratio test of James, James, and Siegmund (JJS), even when the parametric assumptions for that test are met. When those...competitor, the maximum likelihood ratio test of James, James, and Siegmund (1992), for various cases including different underlying distributions

  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. Java bytecode verification via static single assignment form

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  1. The US nuclear weapon infrastructure and a stable global nuclear weapon regime

    Energy Technology Data Exchange (ETDEWEB)

    Immele, John D [Los Alamos National Laboratory; Wagner, Richard L [Los Alamos National Laboratory

    2009-01-01

    US nuclear weapons capabilities -- extant force structure and nuclear weapons infrastructure as well as declared policy -- influence other nations' nuclear weapons postures, at least to some extent. This influence can be desirable or undesirable, and is, of course, a mixture of both. How strong the influence is, and its nature, are complicated, controversial, and -- in our view -- not well understood but often overstated. Divergent views about this influence and how it might shape the future global nuclear weapons regime seem to us to be the most serious impediment to reaching a national consensus on US weapons policy, force structure and supporting infrastructure. We believe that a paradigm shift to capability-based deterrence and dissuasion is not only consistent with the realities of the world and how it has changed, but also a desirable way for nuclear weapon postures and infrastructures to evolve. The US and other nuclear states could not get to zero nor even reduce nuclear arms and the nuclear profile much further without learning to manage latent capability. This paper has defined three principles for designing NW infrastructure both at the 'next plateau' and 'near zero.' The US can be a leader in reducing weapons and infrastructure and in creating an international regime in which capability gradually substitutes for weapons in being and is transparent. The current 'strategy' of not having policy or a Congressionally-approved plan for transforming the weapons complex is not leadership. If we can conform the US infrastructure to the next plateau and architect it in such a way that it is aligned with further arms reductions, it will have these benefits: The extant stockpile can be reduced in size, while the smaller stockpile still deters attack on the US and Allies. The capabilities of the infrastructure will dissuade emergence of new challenges/threats; if they emerge, nevertheless, the US will be able to deal with them in

  2. Adversarial Use of Weapons of Mass Destruction

    Science.gov (United States)

    2000-01-01

    had weaponized 10,000 liters of concentrated botu- linum toxin, 6,500 liters of concentrated anthrax, and 1,580 liters of concentrated aflatoxin .2 The...might cost only $30–50 million, according to the Research Institute for the Study of Conflict and Terrorism. That could be cut in half if safety ...10 Most nations pursuing NBC capabilities today are also consider- ing long-range delivery means. On the strategic level adversaries are likely to use

  3. Defense Acquisitions: Assessments of Selected Weapon Programs

    Science.gov (United States)

    2016-03-01

    of contractors delivering the 10 costliest programs have performed well relative to broad-based market indices, indicating that investors expect...16-329SP Assessments of Major Weapon Programs Two programs—the B-2 Extremely High Frequency Satellite Communications and Computer...expected. The B-2 Extremely High Frequency Satellite Communications and Computer Increment 1 date was revised to reflect the actual delivery of

  4. The Aerodynamics of High Speed Aerial Weapons

    OpenAIRE

    Prince, Simon A.

    1999-01-01

    The focus of this work is the investigation of the complex compressible flow phenomena associated with high speed aerial weapons. A three dimen- sional multiblock finite volume flow solver was developed with the aim of studying the aerodynamics of missile configurations and their component structures. The first component of the study involved the aerodynamic investigation of the isolated components used in the design of conventional missile config- urations. The computati...

  5. Imprecise Probability Methods for Weapons UQ

    Energy Technology Data Exchange (ETDEWEB)

    Picard, Richard Roy [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Vander Wiel, Scott Alan [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2016-05-13

    Building on recent work in uncertainty quanti cation, we examine the use of imprecise probability methods to better characterize expert knowledge and to improve on misleading aspects of Bayesian analysis with informative prior distributions. Quantitative approaches to incorporate uncertainties in weapons certi cation are subject to rigorous external peer review, and in this regard, certain imprecise probability methods are well established in the literature and attractive. These methods are illustrated using experimental data from LANL detonator impact testing.

  6. Defense Acquisitions: Assessments of Selected Weapon Programs

    Science.gov (United States)

    2015-03-01

    Assessment 56 Figure 13: Examples of Knowledge Scorecards 58 Contents Page v GAO-15-342SP Assessments of Selected Weapon Programs Abbreviations...efficiencies realized through contract negotiations (13 programs), • design trades to balance affordability and capability (10 programs), • changed...at the time of our review with a scorecard and narrative summary at the bottom of the first page of each assessment. As illustrated in figure 12

  7. Conventional Weapons Effects on Reinforced Soil Walls.

    Science.gov (United States)

    1995-03-01

    of the reinforced soil wall. 14. SUBJECT TERMS 15. NUMBER OF PAGES Reinforced soil, conventional weapons, protective structures, 388 geosynthetics ...high tensile strength materials such as steel strips or geosynthetics . A single face of a reinforced soil berm can be constructed to approximately...yards of geosynthetics representing $3.1 billion have been used in a wide range of civil engineering applications (Koerner, 1990). Between 1991 and 1992

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

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

  10. RESTRICTIONS BY THE USE OF WEAPONS OF RUSSIAN CITIZENS

    Directory of Open Access Journals (Sweden)

    Lyatsa A. Kodzokova

    2016-01-01

    Full Text Available Abstract: The article considers the restrictions imposed on the circulation of civilian and service weapons. The author analyzes the restrictions on the circulation of weapons, the procedure for their implementation in practice. Federal Law "On weapons" only in paragraph 6 p. 1, art. 6 "Restrictions imposed on the circulation of civilian and service weapons" refers to the prohibition of 'turnover as a civilian and service weapons and other items affecting the action is based on the use of radiation and biological factors; weapons and other items affecting the action is based on the use of electromagnetic, light, thermal, subsonic or ultrasonic radiation and which have output parameters that exceed the value set by state standards of the Russian Federation and the relevant regulations of the federal executive authority in the field of public health, as well as these weapons and items produced outside the Russian territory " How to regard this provision of the law? As the transfer of new weapons, not specific item. 25 of the Federal Law "On weapons", or items prohibited for circulation in the territory of our state? This inconsistency decreases the effectiveness of the legal regulation of arms trafficking. Unification of definitions in this area will allow applying the law correctly and reasonably, including criminal. But for this it is necessary taking into account the experience and the modern needs of the various branches of law provide a clearer definition of "weapon" and its species. The author's conclusions may be used in law enforcement. 

  11. Why are sexually selected weapons almost absent in females?

    Institute of Scientific and Technical Information of China (English)

    Anders BERGLUND

    2013-01-01

    In sex role reversed species,predominantly females evolve sexually selected traits,such as ornaments and/or weapons.Female ornaments are common and their function well documented in many species,whether sex role reversed or not.However,sexually selected female weapons seem totally absent except for small wing spurs in three jacana species,present in both males and females.This poor female weaponry is in sharp contrast to the situation in species with conventional sex roles:males commonly have evolved sexually selected weapons as well as ornaments.At the same time,females in many taxa have naturally selected weapons,used in competition over resources or in predator defence.Why are sexually selected weapons then so rare,almost absent,in females? Here I briefly review weaponry in females and the function of these weapons,conclude that the near absence of sexually selected weapons begs an explanation,and suggest that costs of sexually selected weapons may exceed costs of ornaments.Females are more constrained when evolving sexually selected traits compared to males,at least compared to those males that do not provide direct benefits,as trait costs reduce a female's fecundity.I suggest that this constraining trade-off between trait and fecundity restricts females to evolve ornaments but rarely weapons.The same may apply to paternally investing males.Whether sexually selected weapons actually are more costly than sexually selected ornaments remains to be investigated.

  12. Nuclear weapons and NATO-Russia relations

    Energy Technology Data Exchange (ETDEWEB)

    Cornwell, G.C.

    1998-12-01

    Despite the development of positive institutional arrangements such as Russian participation in the NATO-led peacekeeping force in Bosnia and the NATO- Russia Permanent Joint Council, the strategic culture of Russia has not changed in any fundamental sense. Russian strategic culture has not evolved in ways that would make Russian policies compatible with those of NATO countries in the necessary economic, social, technological, and military spheres. On the domestic side, Russia has yet to establish a stable democracy and the necessary legal, judicial, and regulatory institutions for a free-market economy. Russia evidently lacks the necessary cultural traditions, including concepts of accountability and transparency, to make these adaptations in the short-term. Owing in part to its institutional shortcomings, severe socioeconomic setbacks have afflicted Russia. Russian conventional military strength has been weakened, and a concomitant reliance by the Russians on nuclear weapons as their ultimate line of defense has increased. The breakdown in the infrastructure that supports Russian early warning and surveillance systems and nuclear weapons stewardship defense, coupled with a tendency towards has exacerbated Russian anxiety and distrust toward NATO. Russia`s reliance on nuclear weapons as the ultimate line of defense, coupled with a tendency toward suspicion and distrust toward NATO, could lead to dangerous strategic miscalculation and nuclear catastrophe.

  13. The Chemical Weapons Convention -- Legal issues

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-08-01

    The Chemical Weapons Convention (CWC) offers a unique challenge to the US system of constitutional law. Its promise of eliminating what is the most purely genocidal type of weapon from the world`s arsenals as well as of destroying the facilities for producing these weapons, brings with it a set of novel legal issues. The reservations about the CWC expressed by US business people are rooted in concern about safeguarding confidential business information and protecting the constitutional right to privacy. The chief worry is that international verification inspectors will misuse their power to enter commercial property and that trade secrets or other private information will be compromised as a result. It has been charged that the Convention is probably unconstitutional. The author categorically disagrees with that view and is aware of no scholarly writing that supports it. The purpose of this presentation is to show that CWC verification activities can be implemented in the US consistently with the traditional constitutional regard for commercial and individual privacy. First, he very briefly reviews the types of verification inspections that the CWC permits, as well as some of its specific privacy protections. Second, he explains how the Fourth Amendment right to privacy works in the context of CWC verification inspections. Finally, he reviews how verification inspections can be integrated into these constitutional requirements in the SU through a federal implementing statute.

  14. Measures to implement the Chemical Weapons Convention

    Energy Technology Data Exchange (ETDEWEB)

    Tanzman, E.; Kellman, B.

    1999-11-05

    This seminar is another excellent opportunity for those involved in preventing chemical weapons production and use to learn from each other about how the Chemical Weapons Convention (CWC) can become a foundation of arms control in Africa and around the world. The author is grateful to the staff of the Organization for the Prohibition of Chemical Weapons (OPCW) for inviting him to address this distinguished seminar. The views expressed in this paper are those of the authors alone, and do not represent the position of the government of the US nor or of any other institution. In 1993, as the process of CWC ratification was beginning, concerns arose that the complexity of integrating the treaty with national law would cause each nation to implement the Convention without regard to what other nations were doing, thereby causing inconsistencies among States Parties in how the Convention would be carried out. As a result the Manual for National Implementation of the Chemical Weapons Convention was prepared and presented it to each national delegation at the December 1993 meeting of the Preparatory Commission in The Hague. During its preparation, the Manual was reviewed by the Committee of Legal Experts on National Implementation of the Chemical Weapons Convention, a group of distinguished international jurists, law professors, legally-trained diplomats, government officials, and Parliamentarians from every region of the world, including Mica. In February 1998, the second edition of the Manual was published in order to update it in light of developments since the CWC entered into force on 29 April 1997. The second edition 1998 clarified the national implementation options to reflect post-entry-into-force thinking, added extensive references to national implementing measures that had been enacted by various States Parties, and included a prototype national implementing statute developed by the authors to provide a starting point for those whose national implementing

  15. Measures to implement the Chemical Weapons Convention

    Energy Technology Data Exchange (ETDEWEB)

    Tanzman, E.; Kellman, B.

    1999-11-05

    This seminar is another excellent opportunity for those involved in preventing chemical weapons production and use to learn from each other about how the Chemical Weapons Convention (CWC) can become a foundation of arms control in Africa and around the world. The author is grateful to the staff of the Organization for the Prohibition of Chemical Weapons (OPCW) for inviting him to address this distinguished seminar. The views expressed in this paper are those of the authors alone, and do not represent the position of the government of the US nor or of any other institution. In 1993, as the process of CWC ratification was beginning, concerns arose that the complexity of integrating the treaty with national law would cause each nation to implement the Convention without regard to what other nations were doing, thereby causing inconsistencies among States Parties in how the Convention would be carried out. As a result the Manual for National Implementation of the Chemical Weapons Convention was prepared and presented it to each national delegation at the December 1993 meeting of the Preparatory Commission in The Hague. During its preparation, the Manual was reviewed by the Committee of Legal Experts on National Implementation of the Chemical Weapons Convention, a group of distinguished international jurists, law professors, legally-trained diplomats, government officials, and Parliamentarians from every region of the world, including Mica. In February 1998, the second edition of the Manual was published in order to update it in light of developments since the CWC entered into force on 29 April 1997. The second edition 1998 clarified the national implementation options to reflect post-entry-into-force thinking, added extensive references to national implementing measures that had been enacted by various States Parties, and included a prototype national implementing statute developed by the authors to provide a starting point for those whose national implementing

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

  17. Systems engineering analysis of kinetic energy weapon concepts

    Energy Technology Data Exchange (ETDEWEB)

    Senglaub, M.

    1996-06-01

    This study examines, from a systems engineering design perspective, the potential of kinetic energy weapons being used in the role of a conventional strategic weapon. Within the Department of Energy (DOE) complex, strategic weapon experience falls predominantly in the nuclear weapons arena. The techniques developed over the years may not be the most suitable methodologies for use in a new design/development arena. For this reason a more fundamental approach was pursued with the objective of developing an information base from which design decisions might be made concerning the conventional strategic weapon system concepts. The study examined (1) a number of generic missions, (2) the effects of a number of damage mechanisms from a physics perspective, (3) measures of effectiveness (MOE`s), and (4) a design envelope for kinetic energy weapon concepts. With the base of information a cut at developing a set of high-level system requirements was made, and a number of concepts were assessed against these requirements.

  18. Systems engineering analysis of kinetic energy weapon concepts

    Energy Technology Data Exchange (ETDEWEB)

    Senglaub, M.

    1996-06-01

    This study examines, from a systems engineering design perspective, the potential of kinetic energy weapons being used in the role of a conventional strategic weapon. Within the Department of Energy (DOE) complex, strategic weapon experience falls predominantly in the nuclear weapons arena. The techniques developed over the years may not be the most suitable methodologies for use in a new design/development arena. For this reason a more fundamental approach was pursued with the objective of developing an information base from which design decisions might be made concerning the conventional strategic weapon system concepts. The study examined (1) a number of generic missions, (2) the effects of a number of damage mechanisms from a physics perspective, (3) measures of effectiveness (MOE`s), and (4) a design envelope for kinetic energy weapon concepts. With the base of information a cut at developing a set of high-level system requirements was made, and a number of concepts were assessed against these requirements.

  19. 76 FR 70317 - Continuation of the National Emergency With Respect to Weapons of Mass Destruction

    Science.gov (United States)

    2011-11-10

    ... With Respect to Weapons of Mass Destruction #0; #0; #0; Presidential Documents #0; #0; #0;#0;Federal... Weapons of Mass Destruction On November 14, 1994, by Executive Order 12938, the President declared a... weapons (weapons of mass destruction) and the means of delivering such weapons. On July 28, 1998, the...

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

  1. Small sample Bayesian analyses in assessment of weapon performance

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Abundant test data are required in assessment of weapon performance.When weapon test data are insufficient,Bayesian analyses in small sample circumstance should be considered and the test data should be provided by simulations.The several Bayesian approaches are discussed and some limitations are founded.An improvement is put forward after limitations of Bayesian approaches available are analyzed and t he improved approach is applied to assessment of some new weapon performance.

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

  3. Classifier Assignment by Corpus-based Approach

    CERN Document Server

    Sornlertlamvanich, V; Meknavin, S; Sornlertlamvanich, Virach; Pantachat, Wantanee; Meknavin, Surapant

    1994-01-01

    This paper presents an algorithm for selecting an appropriate classifier word for a noun. In Thai language, it frequently happens that there is fluctuation in the choice of classifier for a given concrete noun, both from the point of view of the whole spe ech community and individual speakers. Basically, there is no exect rule for classifier selection. As far as we can do in the rule-based approach is to give a default rule to pick up a corresponding classifier of each noun. Registration of classifier for each noun is limited to the type of unit classifier because other types are open due to the meaning of representation. We propose a corpus-based method (Biber, 1993; Nagao, 1993; Smadja, 1993) which generates Noun Classifier Associations (NCA) to overcome the problems in classifier assignment and semantic construction of noun phrase. The NCA is created statistically from a large corpus and recomposed under concept hierarchy constraints and frequency of occurrences.

  4. Strategies for denaturing the weapons-grade plutonium stockpile

    Energy Technology Data Exchange (ETDEWEB)

    Buckner, M.R.; Parks, P.B.

    1992-10-01

    In the next few years, approximately 50 metric tons of weapons-grade plutonium and 150 metric tons of highly-enriched uranium (HEU) may be removed from nuclear weapons in the US and declared excess. These materials represent a significant energy resource that could substantially contribute to our national energy requirements. HEU can be used as fuel in naval reactors, or diluted with depleted uranium for use as fuel in commercial reactors. This paper proposes to use the weapons-grade plutonium as fuel in light water reactors. The first such reactor would demonstrate the dual objectives of producing electrical power and denaturing the plutonium to prevent use in nuclear weapons.

  5. DOE Nuclear Weapon Reliability Definition: History, Description, and Implementation

    Energy Technology Data Exchange (ETDEWEB)

    Wright, D.L.; Cashen, J.J.; Sjulin, J.M.; Bierbaum, R.L.; Kerschen, T.J.

    1999-04-01

    The overarching goal of the Department of Energy (DOE) nuclear weapon reliability assessment process is to provide a quantitative metric that reflects the ability of the weapons to perform their intended function successfully. This white paper is intended to provide insight into the current and long-standing DOE definition of nuclear weapon reliability, which can be summarized as: The probability of achieving the specified yield, at the target, across the Stockpile-To-Target Sequence of environments, throughout the weapon's lifetime, assuming proper inputs.

  6. Granular analyzing of weapon SoS demand description

    Institute of Scientific and Technical Information of China (English)

    Zhao Qingsong; Yang Kewei; Chen Yingwu; Li Mengjun

    2009-01-01

    The systematism of weapon combat is the typical characteristic of a modern battlefield. The process of combat is complex and the demand description of weapon system of systems (SOS) is difficult. Granular analyzing is an important method for solving the complex problem in the world. Granular thinking is introduced into the demand description of weapon SoS. Granular computing and granular combination based on a relation of compatibility is proposed. Based on the level of degree and degree of detail, the granular resolution of weapon SoS is defined and an example is illustrated at the end.

  7. ON THE OFFENSE: USING CYBER WEAPONS TO INFLUENCE COGNITIVE BEHAVIOR

    Directory of Open Access Journals (Sweden)

    Mary Fendley

    2012-12-01

    Full Text Available There is an increasing recognition that cyber warfare is an important area of development for targeting and weaponeering, with far-reaching effects in national defense and economic security. The ability to conduct effective operations in cyberspace relies on a robust situational awareness of events occurring in both the physical and information domains, with an understanding of how they affect the cognitive domain of friendly, neutral, and adversary population sets. The dynamic nature of the battlefield complicates efforts to understand shifting adversary motivations and intentions. There are very few approaches, to date, that systematically evaluate the effects of the repertoire of cyber weapons on the cognitive, perceptual, and behavioral characteristics of the adversary. In this paper, we describe a software environment called Cognitive Cyber Weapon Selection Tool (CCWST that simulates a scenario involving cyber weaponry.This tool provides the capabilities to test weapons which may induce behavioral state changes in the adversaries. CCWST provides the required situational awareness to the Cyber Information Operations (IO planner to conduct intelligent weapon selection during weapon activation in order to induce the desired behavioral change in the perception of the adversary. Weapons designed to induce the cognitive state changes of deception, distraction, distrust and confusion were then tested empirically to evaluate the capabilities and expected cognitive state changes induced by these weapons. The results demonstrated that CCWST is a powerful environment within which to test and evaluate the impact of cyber weapons on influencing cognitive behavioral states during information processing.

  8. 7 CFR 760.31 - Assignment.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 7 2010-01-01 2010-01-01 false Assignment. 760.31 Section 760.31 Agriculture... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

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

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

  11. Cardiac fibrillation risk of Taser weapons.

    Science.gov (United States)

    Leitgeb, Norbert

    2014-06-01

    The debate on potential health hazards associated with delivering electric discharges to incapacitated subjects, in particular on whether electric discharge weapons are lethal, less lethal or non-lethal, is still controversial. The cardiac fibrillation risks of Taser weapons X26 and X3 have been investigated by measuring the delivered high-tension pulses in dependence on load impedance. Excitation thresholds and sinus-to-Taser conversion factors have been determined by numerical modeling of endocardial, myocardial, and epicardial cells. Detailed quantitative assessment of cardiac electric exposure has been performed by numerical simulation at the normal-weighted anatomical model NORMAN. The impact of anatomical variation has been quantified at an overweight model (Visible Man), both with a spatial resolution of 2 × 2 × 2 mm voxels. Spacing and location of dart electrodes were systematically varied and the worst-case position determined. Based on volume-weighted cardiac exposure assessment, the fibrillation probability of the worst-case hit was determined to 30% (Taser X26) and 9% (Taser X3). The overall risk assessment of Taser application accounting for realistic spatial hit distributions was derived from training sessions of police officers under realistic scenarios and by accounting for the influence of body (over-)weight as well as gender. The analysis of the results showed that the overall fibrillation risk of Taser use is not negligible. It is higher at Taser X26 than at Taser X3 and amounts to about 1% for Europeans with an about 20% higher risk for Asians. Results demonstrate that enhancement as well as further reduction of fibrillation risk depends on responsible use or abuse of Taser weapons.

  12. The Regulation of the Possession of Weapons at Gatherings

    Directory of Open Access Journals (Sweden)

    Pieter du Toit

    2013-12-01

    Full Text Available The Dangerous Weapons Act 15 of 2013 provides for certain prohibitions and restrictions in respect of the possession of a dangerous weapon and it repeals the Dangerous Weapons Act 71 of 1968 as well as the different Dangerous Weapons Acts in operation in the erstwhile TBVC States. The Act also amends the Regulation of Gatherings Act 205 of 1993 to prohibit the possession of any dangerous weapon at a gathering or demonstration. The Dangerous Weapons Act provides for a uniform system of law governing the use of dangerous weapons for the whole of South Africa and it furthermore no longer places the onus on the individual charged with the offence of the possession of a dangerous weapon to show that he or she did not have any intention of using the firearm for an unlawful purpose. The Act also defines the meaning of a dangerous weapon. According to our court’s interpretation of the Dangerous Weapons Act 71 of 1968 a dangerous weapon was regarded as an object used or intended to be used as a weapon even if it had not been designed for use as a weapon. The Act, however, requires the object to be capable of causing death or inflicting serious bodily harm if it were used for an unlawful purpose. The possession of a dangerous weapon, in circumstances which may raise a reasonable suspicion that the person intends to use it for an unlawful purpose, attracts criminal liability. The Act also provides a useful set of guidelines to assist courts to determine if a person charged with the offence of the possession of a dangerous weapon had indeed intended to use the weapon for an unlawful purpose. It seems, however, that the Act prohibits the possession of a dangerous weapon at gatherings, even if the person carrying the weapon does not intend to use it for an unlawful purpose. The state will, however, have to prove that the accused had the necessary control over the object and the intention to exercise such control, as well as that the object is capable of

  13. Postulated accident scenarios in weapons disassembly

    Energy Technology Data Exchange (ETDEWEB)

    Payne, S.S. [Dept. of Energy, Albuquerque, NM (United States)

    1997-06-01

    A very brief summary of three postulated accident scenarios for weapons disassembly is provided in the paper. The first deals with a tetrahedral configuration of four generic pits; the second, an infinite planar array of generic pits with varying interstitial water density; and the third, a spherical shell with internal mass suspension in water varying the size and mass of the shell. Calculations were performed using the Monte Carlo Neutron Photon transport code MCNP4A. Preliminary calculations pointed to a need for higher resolution of small pit separation regimes and snapshots of hydrodynamic processes of water/plutonium mixtures.

  14. Stinging plants: as future bio-weapon.

    Science.gov (United States)

    Gupta, Sanjay Mohan; Kumar, Kamal

    2016-09-01

    In the present opinion paper, we have been introducing for the first time the stinging plants and/or their biological toxins as novel bio-threat agents that may be used for the development of bio-weapons for self-defence purpose. The selected studied stinging plants are having dual role as nutraceutical and ethno-pharmacological uses apart from their less explored stinging property. However, future detailed work is required for identification and characterization of the precise stinging chemical components that will be used for the formulation of novel bio-warfare agents for self-defence purpose.

  15. Environmental Detection of Clandestine Nuclear Weapon Programs

    Science.gov (United States)

    Kemp, R. Scott

    2016-06-01

    Environmental sensing of nuclear activities has the potential to detect nuclear weapon programs at early stages, deter nuclear proliferation, and help verify nuclear accords. However, no robust system of detection has been deployed to date. This can be variously attributed to high costs, technical limitations in detector technology, simple countermeasures, and uncertainty about the magnitude or behavior of potential signals. In this article, current capabilities and promising opportunities are reviewed. Systematic research in a variety of areas could improve prospects for detecting covert nuclear programs, although the potential for countermeasures suggests long-term verification of nuclear agreements will need to rely on methods other than environmental sensing.

  16. DOE battery program for weapon applications

    Science.gov (United States)

    Clark, R. P.; Baldwin, A. R.

    This report discusses the Department of Energy (DOE) Weapons Battery program which originates from Sandia National Laboratories (SNL) and involves activities ranging from research, design and development to testing, consulting, and production support. The primary customer is the DOE/Office of Defense Programs, although work is also done for various Department of Defense agencies and their contractors. The majority of the SNL activities involve thermal battery (TB) and lithium ambient temperature battery (LAMB)technologies. Smaller efforts are underway in the areas of silver oxide/zinc and nickel oxide/cadmium batteries as well as double layer capacitors.

  17. Recoil Considerations for Shoulder-Fired Weapons

    Science.gov (United States)

    2012-05-01

    2012) Steyr 15.2 mm 35 g 1450 m/s 39.6 lb 11.4 Burns (2012) Type 97 (Japanese) 20 mm 162 g 790 m/s 130 lb 28.7 Burns (2012) 12HB00 ( Remington ...shotgun 0.727 in 807 gr (12 × 00) 1225 ft/s 7.0 lb 4.37 Remington (2011) Remington Express 12B0 shotgun 0.727 in 580 gr (12 × 0) 1275 ft/s...7.0 lb 3.28 Remington 5 Table 3. Recoil-related characteristics of selected shoulder-fired weapons cited in table 1. Nomenclature

  18. [Botulinum toxin as a biological weapon].

    Science.gov (United States)

    Rossow, Heidi; Kinnunen, Paula M; Nikkari, Simo

    2012-01-01

    Botulism is caused by botulinum neurotoxin produced by the bacterium Clostridium botulinum. It is a flaccid paralysis in which consciousness and nociception are preserved. Natural botulism typically results from ingestion of inadequately heated or unheated vacuum-packed foods. In addition, botulinum toxin is one of the most feared biological weapons. In the diagnosis and treatment of botulism early suspicion is essential. Several coinciding or local clusters without a typical connecting source, or an uncommon type of toxin may indicate an intentionally caused epidemic.

  19. 76 FR 6199 - Enhanced Weapons, Firearms Background Checks, and Security Event Notifications

    Science.gov (United States)

    2011-02-03

    ... Regulatory Commission 10 CFR Part 73 Enhanced Weapons, Firearms Background Checks, and Security Event... Enhanced Weapons, Firearms Background Checks, and Security Event Notifications AGENCY: Nuclear Regulatory... revisions in these implementing regulations that address the voluntary application for enhanced weapons and...

  20. 77 FR 59891 - Proposed Information Collection; Comment Request; Chemical Weapons Convention Declaration and...

    Science.gov (United States)

    2012-10-01

    ... Bureau of Industry and Security Proposed Information Collection; Comment Request; Chemical Weapons...@bis.doc.gov . SUPPLEMENTARY INFORMATION: ] I. Abstract The Chemical Weapons Convention Implementation Act of 1998 and Commerce Chemical Weapons Convention Regulations (CWCR) specify the rights...

  1. A Study of New Method for Weapon System Effectiveness Evaluation Based on Bayesian Network

    Institute of Scientific and Technical Information of China (English)

    YAN Dai-wei; GU Liang-xian; PAN Lei

    2008-01-01

    As weapon system effectiveness is affected by many factors, its evaluation is essentially a multi-criterion decision making problem for its complexity. The evaluation model of the effectiveness is established on the basis of metrics architecture of the effectiveness. The Bayesian network, which is used to evaluate the effectiveness, is established based on the metrics architecture and the evaluation models. For getting the weights of the metrics by Bayesian network, subjective initial values of the weights are given, gradient ascent algorithm is adopted, and the reasonable values of the weights are achieved. And then the effectiveness of every weapon system project is gained. The weapon system, whose effectiveness is relative maximum, is the optimization system. The research result shows that this method can solve the problem of AHP method which evaluation results are not compatible to the practice results and overcome the shortcoming of neural network in multilayer and multi-criterion decision. The method offers a new approaeh for evaluating the effectiveness.

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

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

  4. Three-Dimensional Microwave Imaging for Concealed Weapon Detection Using Range Stacking Technique

    Directory of Open Access Journals (Sweden)

    Weixian Tan

    2017-01-01

    Full Text Available Three-dimensional (3D microwave imaging has been proven to be well suited for concealed weapon detection application. For the 3D image reconstruction under two-dimensional (2D planar aperture condition, most of current imaging algorithms focus on decomposing the 3D free space Green function by exploiting the stationary phase and, consequently, the accuracy of the final imagery is obtained at a sacrifice of computational complexity due to the need of interpolation. In this paper, from an alternative viewpoint, we propose a novel interpolation-free imaging algorithm based on wavefront reconstruction theory. The algorithm is an extension of the 2D range stacking algorithm (RSA with the advantages of low computational cost and high precision. The algorithm uses different reference signal spectrums at different range bins and then forms the target functions at desired range bin by a concise coherent summation. Several practical issues such as the propagation loss compensation, wavefront reconstruction, and aliasing mitigating are also considered. The sampling criterion and the achievable resolutions for the proposed algorithm are also derived. Finally, the proposed method is validated through extensive computer simulations and real-field experiments. The results show that accurate 3D image can be generated at a very high speed by utilizing the proposed algorithm.

  5. Method for concurrent execution of primitive operations by dynamically assigning operations based upon computational marked graph and availability of data

    Science.gov (United States)

    Stoughton, John W. (Inventor); Mielke, Roland V. (Inventor)

    1990-01-01

    Computationally complex primitive operations of an algorithm are executed concurrently in a plurality of functional units under the control of an assignment manager. The algorithm is preferably defined as a computationally marked graph contianing data status edges (paths) corresponding to each of the data flow edges. The assignment manager assigns primitive operations to the functional units and monitors completion of the primitive operations to determine data availability using the computational marked graph of the algorithm. All data accessing of the primitive operations is performed by the functional units independently of the assignment manager.

  6. The Relationship between Social Capital and Weapon Possession on Campus

    Science.gov (United States)

    Messer, Rachel H.; Bradley, Kristopher I.; Calvi, Jessica L.; Kennison, Shelia M.

    2012-01-01

    The present research focused on the problem of how college officials might be able to predict weapon possession on college campuses. We hypothesized that measures of social capital (i.e., trust and participation in society) may be useful in identifying individuals who are likely to possess weapons on campuses. Prior research has shown that those…

  7. Victimization and Health Risk Factors among Weapon-Carrying Youth

    Science.gov (United States)

    Stayton, Catherine; McVeigh, Katharine H.; Olson, E. Carolyn; Perkins, Krystal; Kerker, Bonnie D.

    2011-01-01

    Objective: To compare health risks of 2 subgroups of weapon carriers: victimized and nonvictimized youth. Methods: 2003-2007 NYC Youth Risk Behavior Surveys were analyzed using bivariate analyses and multinomial logistic regression. Results: Among NYC teens, 7.5% reported weapon carrying without victimization; 6.9% reported it with victimization.…

  8. Rethinking the Development of Weapons and Their Impact

    Science.gov (United States)

    Katsioloudis, Petros J.; Jones, Mildred V.

    2011-01-01

    As one reads about the history of humans, he/she sees very early on that humans are naturally "tool users." More specifically, humans used tools as a means of subsistence and survival. Even today humans use tools to extend their capabilities beyond imagination. These tools are even used as weapons. However primitive, these early weapons would soon…

  9. 32 CFR 552.116 - Privately owned weapons-security.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 3 2010-07-01 2010-07-01 true Privately owned weapons-security. 552.116 Section..., Ammunition, and Explosives-Fort Lewis, Washington § 552.116 Privately owned weapons—security. Privately owned arms and ammunition will be secured in the manner required for military weapons and ammunition but...

  10. Monoclonal Antibodies to Prevent Use of Mycotoxins as Biological Weapons

    Science.gov (United States)

    2007-07-01

    Mycotoxins as Biological Weapons PRINCIPAL INVESTIGATOR: Marta Feldmesser, M.D. CONTRACTING ORGANIZATION: Albert Einstein College of...Monoclonal Antibodies to Prevent Use of Mycotoxins as Biological Weapons 5b. GRANT NUMBER W81XWH-06-1-0085 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR

  11. Adapting the Law of Armed Conflict to Autonomous Weapon Systems

    Science.gov (United States)

    2014-01-01

    remains in the realm of theory . Still, several modern highly- automated—and some would call them autonomous—weapon systems already exist. These are...CROSS, 483, 507 (2012). 58. Backstrom & Henderson, supra note 57, at 401. 59. Justin McClelland , The Review of Weapons in Accordance with Article 36

  12. Civilian preparedness and counter-terrorism: conventional weapons.

    Science.gov (United States)

    Lucci, Edward B

    2006-06-01

    Most terrorist attacks involve conventional weapons. These explosive devices produce injury patterns that are sometimes predict-able. The chaos produced from these weapons can be greatly reduced with prior planning, response practice, and realization by the entire medical community of the need to participate in preparation for these devastating events.

  13. Willingness to pay for defense against weapons of mass destruction.

    Science.gov (United States)

    Mulvaney, J M; LaBarre, D; Pastel, R; Landauer, M

    2001-12-01

    A survey assessed the willingness to pay for defense against weapons of mass destruction. The results were evaluated according to the benefit to society. The results indicated preferences for increased spending on intelligence gathering, training, and equipment. We concluded that the United States is spending less for weapons of mass destruction defense than the sample population was willing to pay.

  14. Rethinking the Development of Weapons and Their Impact

    Science.gov (United States)

    Katsioloudis, Petros J.; Jones, Mildred V.

    2011-01-01

    As one reads about the history of humans, he/she sees very early on that humans are naturally "tool users." More specifically, humans used tools as a means of subsistence and survival. Even today humans use tools to extend their capabilities beyond imagination. These tools are even used as weapons. However primitive, these early weapons would soon…

  15. HFE (Human Factors Engineering) Technology for Navy Weapon System Acquisition.

    Science.gov (United States)

    1979-07-01

    uncovering of improved propulsion systems, sensors , weapons, etc., by industry or governr-ient agencies, may in.tiate the development of a new weapon system...needs. (No. A-109) _L a f. Tailor an acquisition stratagy for each program, as soon as the agency decides to solict alternative system design concepto

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

  17. Exploiting image registration for automated resonance assignment in NMR.

    Science.gov (United States)

    Strickland, Madeleine; Stephens, Thomas; Liu, Jian; Tjandra, Nico

    2015-06-01

    Analysis of protein NMR data involves the assignment of resonance peaks in a number of multidimensional data sets. To establish resonance assignment a three-dimensional search is used to match a pair of common variables, such as chemical shifts of the same spin system, in different NMR spectra. We show that by displaying the variables to be compared in two-dimensional plots the process can be simplified. Moreover, by utilizing a fast Fourier transform cross-correlation algorithm, more common to the field of image registration or pattern matching, we can automate this process. Here, we use sequential NMR backbone assignment as an example to show that the combination of correlation plots and segmented pattern matching establishes fast backbone assignment in fifteen proteins of varying sizes. For example, the 265-residue RalBP1 protein was 95.4% correctly assigned in 10 s. The same concept can be applied to any multidimensional NMR data set where analysis comprises the comparison of two variables. This modular and robust approach offers high efficiency with excellent computational scalability and could be easily incorporated into existing assignment software.

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

  19. Dynamic Joint Fire Distribution Method Based on Decentralized Cooperative Auction Algorithm%分布式协同拍卖算法的动态联合火力分配方法

    Institute of Scientific and Technical Information of China (English)

    黎子芬; 李相民; 陈金柱; 代进进; 孔繁峨

    2012-01-01

    动态联合火力分配问题是一类实时性很强的优化问题.以多机编队协同攻击地面机动目标为背景,建立了联合考虑武器、传感器和目标的火力分配问题的数学模型.根据分布式协同拍卖算法的基本原理,考虑不同目标的火力分配截止时间不同,设计了基于分布协同拍卖的动态目标分配算法.所提出的算法主要有以下两个优点:根据不同目标的火力分配截止时间不同,在算法运行的不同阶段给出相应目标的分配方案能有效地提高算法解的质量;根据分配原则,能将具有不同火力分配截止期的目标分配给同一组攻击机——传感器组,能更充分地发挥编队中作战能力较强的攻击机与传感器的优势,从而发挥编队的最大攻击能力.最后,通过仿真,对算法在以上两方面的优点进行了验证.%Joint fire distribution is a real-time optimization problem which is researching into assignment among weapons, sensors and targets. A mathematical model is established on joint fire distribution problem against a background of air formation attacking to surface mobile targets. Based on decentralized cooperative auction algorithm, an algorithm on dynamic joint fire distribution is proposed. The algorithm dynamically sets temporal restrictions based on different fire distribution deadlines of different targets when a suboptimal partial assignment schemes must be reached. The algorithm has two main merits. One is that the algorithm can remarkably improve the quality of assignment schemes. The other is that a weapon-sensor pair can be assigned to more than one target in different temporal restrictions without missing any deadline, which can take full advantage of the formation's full-scale attack ability. The two merits of the algorithm are verified in simulation in the end.

  20. Weapons Retrieved After the Implementation of Emergency Department Metal Detection.

    Science.gov (United States)

    Malka, S Terez; Chisholm, Robin; Doehring, Marla; Chisholm, Carey

    2015-09-01

    Several high-profile violent incidents have occurred within emergency departments (EDs). There are no recent studies reporting the effectiveness of ED metal detection. Our aim was to assess the effect of metal detection on ED weapons retrieval. In September 2011, a metal detector was installed at the entrance of an urban, high-volume teaching hospital ED. The security company recorded retrieved firearms, knives, chemical sprays, and other weapons. We performed qualitative analysis of weapons retrieval data for a 26-month period. A total of 5877 weapons were retrieved, an average of 218 per month: 268 firearms, 4842 knives, 512 chemical sprays, and 275 other weapons, such as brass knuckles, stun guns, and box cutters. The number of retrieved guns decreased from 2012 to 2013 (from 182 to 47), despite an increase in metal detection hours from 8 h per day to 16 h per day. The number of retrieved knives, chemical sprays, and other weapons increased. Recovered knives increased from 2062 in 2012 to 2222 in 2013, chemical sprays increased from 170 to 305, and other weapons increased from 51 to 201. A large number of weapons were retrieved after the initiation of metal detection in the ED entrance. Increasing hours of metal detection increased the number of retrieved knives, chemical sprays, and other weapons. Retrieved firearms decreased after increasing metal detection hours. Metal detection in the ED entrance is effective in reducing entrance of weapons into the ED. Metal detectors may offer additional benefit in reducing attempts to enter with firearms. Copyright © 2015 Elsevier Inc. All rights reserved.

  1. Distinguishing among weapons offenders, drug offenders, and weapons and drug offenders based on childhood predictors and adolescent correlates.

    Science.gov (United States)

    Stephens, Skye; Day, David M

    2013-07-01

    Weapons and drug offences incur a large cost to society and tend to be strongly associated. Improved understanding of their antecedents could inform targeted early intervention and prevention programmes. This study aimed to examine differences in criminal careers, childhood predictors and adolescent correlates among weapons-only offenders, drugs-only offenders and a versatile group of weapons + drugs offenders. We conducted a longitudinal records study of 455 young Canadians charged with drug and/or weapons offences who started their offending in late childhood/early adolescence. Consistent with expectation, differences emerged in their criminal careers as the versatile group had a longer criminal career and desisted from offending at a later age than weapons-only offenders. Against prediction, weapons-only offenders experienced the greatest number of childhood predictors and adolescent correlates. The three offending groups could be differentiated on offending trajectories and developmental factors.In making links between past events and later behaviour, life-course criminology may inform development of effective early intervention and prevention strategies.As weapons-only offenders experience the greatest level of adversity in childhood and adolescence, they may benefit most (of these three groups) from early intervention and prevention programmes.A reduction in weapon carrying and use might be achieved by early identification of children risk factors (e.g. family adversity) and appropriate intervention. Copyright © 2013 John Wiley & Sons, Ltd.

  2. 47 CFR 74.802 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.802 Section 74.802... Frequency assignment. (a) Frequencies within the following bands may be assigned for use by low power... exceed 200 kHz. (d) Low power auxiliary licensees will not be granted exclusive frequency assignments. (e...

  3. 47 CFR 74.602 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.602 Section 74.602... Stations § 74.602 Frequency assignment. (a) The following frequencies are available for assignment to... 2450 and 2500 MHz are also shared with other communication services and exclusive channel assignments...

  4. 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... REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.705 Administrative assignment. (a) An agency... cannot make an equally reasonable assignment by displacing an employee in a lower subgroup; (2) Permit an...

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

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

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

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

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

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

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

  12. Proportionality, just war theory and weapons innovation.

    Science.gov (United States)

    Forge, John

    2009-03-01

    Just wars are supposed to be proportional responses to aggression: the costs of war must not greatly exceed the benefits. This proportionality principle raises a corresponding 'interpretation problem': what are the costs and benefits of war, how are they to be determined, and a 'measurement problem': how are costs and benefits to be balanced? And it raises a problem about scope: how far into the future do the states of affairs to be measured stretch? It is argued here that weapons innovation always introduces costs, and that these costs cannot be determined in advance of going to war. Three examples, the atomic bomb, the AK-47 and the ancient Greek catapult, are given as examples. It is therefore argued that the proportionality principle is inapplicable prospectively. Some replies to the argument are discussed and rejected. Some more general defences of the proportionality principle are considered and also rejected. Finally, the significance of the argument for Just War Theory as a whole is discussed.

  13. Nuclear weapons issues in South Asia

    Energy Technology Data Exchange (ETDEWEB)

    Joeck, N.

    1993-07-02

    This report discusses how the US can play a productive mediating role in South Asia by engaging India and Pakistan in an international forum to manage nuclear weapons, as Edward Teller advocated. India and Pakistan have developed their nuclear capabilities because they fear their neighbors, not because they want to threaten fear their neighbors, not because they want to threaten the US. The appropriate response for the US, therefore, is diplomatic engagement and negotiations. In addition to the international approach, encouragement and facilitation of regional and bilateral interactions will also be important. Formal arms control agreements have been reached, but less formal confidence-building measures, and unilateral security pledges may well be combined to form a more secure strategic environment in South Asia than a nuclear armed confrontation across the porous South Asian border.

  14. Radiological Weapons: How Great Is The Danger?

    Energy Technology Data Exchange (ETDEWEB)

    Moore, G M

    2003-06-01

    One of the underlying purposes of this paper is to provoke thinking about the interplay between the regulation of radioactive materials and the risk of their use in an radiological weapon (RW). Also considered in this paper are the types of RWs that a terrorist might use, the nature of the threat and danger posed by the various types of RWs, the essential elements that must be considered in responding to the terrorist use of an RW, and what steps may need to be taken a priori to minimize the consequences of the inevitable use of an RW. Because radiological dispersal devices (RDDs) have been the focus of so much recent concern and because RDDs are arguably the most likely of RWs to be used by a terrorist group, a major focus of this paper will be on RDDs. Radiological weapons are going to be used by some individual or group, if not this year then next year, or at some time in the foreseeable future. A policy of focusing resources solely on prevention of their use would leave any government open to significant economic disruption when the inevitable use occurs. Preplanning can limit the injuries, property damage, and economic losses that might result from the use of an RW. Moreover, a combination of efforts to prevent and to minimize the impact of RWs may significantly discourage potential users. The dangers from RWs can be dealt with while society continues to enjoy the benefits of nuclear technology that were promised under Atoms for Peace. However, some restructuring of our use of radioactive materials is necessary to ensure that the current and future uses of radioactive materials outweigh the potential disruption caused by misuse of the materials in RWs.

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

    DEFF Research Database (Denmark)

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

    2017-01-01

    the fluid volume assignment for each operation of the application, such that the FUs volume requirements are satisfied, while over- and underflow are avoided and the total volume of fluid used is minimized. We propose an algorithm for this fluid assignment problem. Compared to previous work, our method...... is able to minimize the fluid consumption through optimal fluid assignment and reuse of fluid waste. Due to the algorithm's low complexity, fluid requirements can also be calculated during runtime for error recovery or statically unknown cases....

  16. Screening adolescents in the emergency department for weapon carriage.

    Science.gov (United States)

    Cunningham, Rebecca M; Resko, Stella M; Harrison, Stephanie Roahen; Zimmerman, Marc; Stanley, Rachel; Chermack, Stephen T; Walton, Maureen A

    2010-02-01

    The objective was to describe the prevalence and correlates of past-year weapon involvement among adolescents seeking care in an inner-city emergency department (ED). This cross-sectional study administered a computerized survey to all eligible adolescents (age 14-18 years), 7 days a week, who were seeking care over an 18-month period at an inner-city Level 1 ED. Validated measures were administered, including measures of demographics, sexual activity, substance use, injury, violent behavior, weapon carriage, and/or weapon use. Zero-inflated Poisson (ZIP) regression models were used to identify correlates of the occurrence and past-year frequency of these weapons variables. Adolescents (n = 2069, 86% response rate) completed the computerized survey. Fifty-five percent were female; 56.5% were African American. In the past year, 20% of adolescents reported knife or razor carriage, 7% reported gun carriage, and 6% pulled a knife or gun on someone. Although gun carriage was more frequent among males, females were as likely to carry a knife or pull a weapon in the past year. One-fifth of all adolescents seeking care in this inner-city ED have carried a weapon. Understanding weapon carriage among teens seeking ED care is a critical first step to future ED-based injury prevention initiatives. (c) 2010 by the Society for Academic Emergency Medicine.

  17. Hamburgian weapon delivery technology: a quantitative comparative approach

    DEFF Research Database (Denmark)

    Riede, Felix

    2010-01-01

    cran). Numerous studies have addressed the question of whether these points tipped arrows fired from bows, darts launched with the help of spear-throwers, or some other projectile delivery weapon. This paper approaches the question of Hamburgian weapon delivery technology from a quantitative...... comparative angle. Lithic metric data as well as information on presumed Hamburgian projectile shafts are used to demonstrate that the bow-and-arrow was the most likely weapon delivery method. This is reflected in the shape similarity with both later prehistoric arrow-points and shafts of the Ahrensburgian...

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

  19. 32 CFR 552.130 - Disposition of confiscated/seized weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 3 2010-07-01 2010-07-01 true Disposition of confiscated/seized weapons. 552..., Ammunition and Other Dangerous Weapons on Fort Gordon § 552.130 Disposition of confiscated/seized weapons. All weapons, ammunition, explosives, or other devices defined in this subpart, that are confiscated...

  20. 32 CFR 552.122 - Personnel not authorized to possess or retain personal weapons.

    Science.gov (United States)

    2010-07-01

    ... personal weapons. 552.122 Section 552.122 National Defense Department of Defense (Continued) DEPARTMENT OF... authorized to possess or retain personal weapons. (a) Possession, retention or storage of personal weapons or... enforcement officer authorized to carry the weapon under state or federal law, while on Fort Lewis or a sub...