Redundant and fault-tolerant algorithms for real-time measurement and control systems for weapon equipment.

PubMed

Li, Dan; Hu, Xiaoguang

2017-03-01

Because of the high availability requirements from weapon equipment, an in-depth study has been conducted on the real-time fault-tolerance of the widely applied Compact PCI (CPCI) bus measurement and control system. A redundancy design method that uses heartbeat detection to connect the primary and alternate devices has been developed. To address the low successful execution rate and relatively large waste of time slices in the primary version of the task software, an improved algorithm for real-time fault-tolerant scheduling is proposed based on the Basic Checking available time Elimination idle time (BCE) algorithm, applying a single-neuron self-adaptive proportion sum differential (PSD) controller. The experimental validation results indicate that this system has excellent redundancy and fault-tolerance, and the newly developed method can effectively improve the system availability. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

The development of a quick-running prediction tool for the assessment of human injury owing to terrorist attack within crowded metropolitan environments

PubMed Central

Pope, Daniel J.

2011-01-01

In the aftermath of the London ‘7/7’ attacks in 2005, UK government agencies required the development of a quick-running tool to predict the weapon and injury effects caused by the initiation of a person borne improvised explosive device (PBIED) within crowded metropolitan environments. This prediction tool, termed the HIP (human injury predictor) code, was intended to: — assist the security services to encourage favourable crowd distributions and densities within scenarios of ‘sensitivity’;— provide guidance to security engineers concerning the most effective location for protection systems;— inform rescue services as to where, in the case of such an event, individuals with particular injuries will be located;— assist in training medical personnel concerning the scope and types of injuries that would be sustained as a consequence of a particular attack;— assist response planners in determining the types of medical specialists (burns, traumatic amputations, lungs, etc.) required and thus identify the appropriate hospitals to receive the various casualty types.This document describes the algorithms used in the development of this tool, together with the pertinent underpinning physical processes. From its rudimentary beginnings as a simple spreadsheet, the HIP code now has a graphical user interface (GUI) that allows three-dimensional visualization of results and intuitive scenario set-up. The code is underpinned by algorithms that predict the pressure and momentum outputs produced by PBIEDs within open and confined environments, as well as the trajectories of shrapnel deliberately placed within the device to increase injurious effects. Further logic has been implemented to transpose these weapon effects into forms of human injury depending on where individuals are located relative to the PBIED. Each crowd member is subdivided into representative body parts, each of which is assigned an abbreviated injury score after a particular calculation cycle. The injury levels of each affected body part are then summated and a triage state assigned for each individual crowd member based on the criteria specified within the ‘injury scoring system’. To attain a comprehensive picture of a particular event, it is important that a number of simulations, using what is substantively the same scenario, are undertaken with natural variation being applied to the crowd distributions and the PBIED output. Accurate mathematical representation of such complex phenomena is challenging, particularly as the code must be quick-running to be of use to the stakeholder community. In addition to discussing the background and motivation for the algorithm and GUI development, this document also discusses the steps taken to validate the tool and the plans for further functionality implementation. PMID:21149351

The development of a quick-running prediction tool for the assessment of human injury owing to terrorist attack within crowded metropolitan environments.

PubMed

Pope, Daniel J

2011-01-27

In the aftermath of the London '7/7' attacks in 2005, UK government agencies required the development of a quick-running tool to predict the weapon and injury effects caused by the initiation of a person borne improvised explosive device (PBIED) within crowded metropolitan environments. This prediction tool, termed the HIP (human injury predictor) code, was intended to:--assist the security services to encourage favourable crowd distributions and densities within scenarios of 'sensitivity'; --provide guidance to security engineers concerning the most effective location for protection systems; --inform rescue services as to where, in the case of such an event, individuals with particular injuries will be located; --assist in training medical personnel concerning the scope and types of injuries that would be sustained as a consequence of a particular attack; --assist response planners in determining the types of medical specialists (burns, traumatic amputations, lungs, etc.) required and thus identify the appropriate hospitals to receive the various casualty types. This document describes the algorithms used in the development of this tool, together with the pertinent underpinning physical processes. From its rudimentary beginnings as a simple spreadsheet, the HIP code now has a graphical user interface (GUI) that allows three-dimensional visualization of results and intuitive scenario set-up. The code is underpinned by algorithms that predict the pressure and momentum outputs produced by PBIEDs within open and confined environments, as well as the trajectories of shrapnel deliberately placed within the device to increase injurious effects. Further logic has been implemented to transpose these weapon effects into forms of human injury depending on where individuals are located relative to the PBIED. Each crowd member is subdivided into representative body parts, each of which is assigned an abbreviated injury score after a particular calculation cycle. The injury levels of each affected body part are then summated and a triage state assigned for each individual crowd member based on the criteria specified within the 'injury scoring system'. To attain a comprehensive picture of a particular event, it is important that a number of simulations, using what is substantively the same scenario, are undertaken with natural variation being applied to the crowd distributions and the PBIED output. Accurate mathematical representation of such complex phenomena is challenging, particularly as the code must be quick-running to be of use to the stakeholder community. In addition to discussing the background and motivation for the algorithm and GUI development, this document also discusses the steps taken to validate the tool and the plans for further functionality implementation.

Acoustic firearm discharge detection and classification in an enclosed environment

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

Luzi, Lorenzo; Gonzalez, Eric; Bruillard, Paul

2016-05-01

Two different signal processing algorithms are described for detection and classification of acoustic signals generated by firearm discharges in small enclosed spaces. The first is based on the logarithm of the signal energy. The second is a joint entropy. The current study indicates that a system using both signal energy and joint entropy would be able to both detect weapon discharges and classify weapon type, in small spaces, with high statistical certainty.

Study on store-space assignment based on logistic AGV in e-commerce goods to person picking pattern

NASA Astrophysics Data System (ADS)

Xu, Lijuan; Zhu, Jie

2017-10-01

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

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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

2008-07-01

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

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

PubMed Central

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.8 – 1.5 Å from the reference structures determined by traditional NMR approaches. PMID:21706248

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Assessment as a Strategic Weapon.

ERIC Educational Resources Information Center

Alfred, Richard L.

2000-01-01

Sets forth eight rules for using assessment to allow community colleges to create a distinctive image: create a "brand identity," differentiate the institution from competitors, big picture goals, total institution performance, priority assigned to stakeholders, measuring intangible benefits, continuous customer touch, and urgency for action.…

PhosSA: Fast and accurate phosphorylation site assignment algorithm for mass spectrometry data.

PubMed

Saeed, Fahad; Pisitkun, Trairak; Hoffert, Jason D; Rashidian, Sara; Wang, Guanghui; Gucek, Marjan; Knepper, Mark A

2013-11-07

Phosphorylation site assignment of high throughput tandem mass spectrometry (LC-MS/MS) data is one of the most common and critical aspects of phosphoproteomics. Correctly assigning phosphorylated residues helps us understand their biological significance. The design of common search algorithms (such as Sequest, Mascot etc.) do not incorporate site assignment; therefore additional algorithms are essential to assign phosphorylation sites for mass spectrometry data. The main contribution of this study is the design and implementation of a linear time and space dynamic programming strategy for phosphorylation site assignment referred to as PhosSA. The proposed algorithm uses summation of peak intensities associated with theoretical spectra as an objective function. Quality control of the assigned sites is achieved using a post-processing redundancy criteria that indicates the signal-to-noise ratio properties of the fragmented spectra. The quality assessment of the algorithm was determined using experimentally generated data sets using synthetic peptides for which phosphorylation sites were known. We report that PhosSA was able to achieve a high degree of accuracy and sensitivity with all the experimentally generated mass spectrometry data sets. The implemented algorithm is shown to be extremely fast and scalable with increasing number of spectra (we report up to 0.5 million spectra/hour on a moderate workstation). The algorithm is designed to accept results from both Sequest and Mascot search engines. An executable is freely available at http://helixweb.nih.gov/ESBL/PhosSA/ for academic research purposes.

75 FR 42091 - Agency Forms Undergoing Paperwork Reduction Act Review

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-20

... Prevention (CDC). Background and Brief Description On October 30, 2000, the Energy Employees Occupational... Energy and certain of its vendors, contractors and subcontractors. This legislation also provided for... Nuclear Weapons Workers'') on December 7, 2000 (65 FR 77487), assigning primary responsibility for...

Thinking About CAS without Thinking about CAS Doctrine: Selected Interactions of Institutional Processes within the Close Air Support Mission

DTIC Science & Technology

2013-12-13

situation; (2) the valuation actors assign to states of the world and to actions; (3) the way actors acquire, process, retain, and use knowledge...situation based on previous experiences or training, or even personal views about the conflict. The valuation actors assign to states of the world and...include one hour on a dedicated air-to-ground training range, such as the Superior Valley range complex near Naval Air Weapons Station China Lake, 42

An Algorithm for Protein Helix Assignment Using Helix Geometry

PubMed Central

Cao, Chen; Xu, Shutan; Wang, Lincong

2015-01-01

Helices are one of the most common and were among the earliest recognized secondary structure elements in proteins. The assignment of helices in a protein underlies the analysis of its structure and function. Though the mathematical expression for a helical curve is simple, no previous assignment programs have used a genuine helical curve as a model for helix assignment. In this paper we present a two-step assignment algorithm. The first step searches for a series of bona fide helical curves each one best fits the coordinates of four successive backbone Cα atoms. The second step uses the best fit helical curves as input to make helix assignment. The application to the protein structures in the PDB (protein data bank) proves that the algorithm is able to assign accurately not only regular α-helix but also 310 and π helices as well as their left-handed versions. One salient feature of the algorithm is that the assigned helices are structurally more uniform than those by the previous programs. The structural uniformity should be useful for protein structure classification and prediction while the accurate assignment of a helix to a particular type underlies structure-function relationship in proteins. PMID:26132394

Ordnance News

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

Bofman, Ryan K.

Since July of 2016 I have been assigned as a Guest Scientist at Los Alamos National Laboratory under the Training With Industries (TWI) Program. Los Alamos National Laboratory has proven to be a challenging and rewarding assignment in which I have found myself at the cutting edge of technologies pertinent to the Explosive Ordnance Disposal career field. In the last 7 months I have had the pleasure of working in an applications group that conducts research at the DOE “Q” and SCI levels. The group “uses a broad range of engineering and scientific expertise to support nuclear counter proliferation (NCP),more » nuclear counter terrorism (NCT), and nuclear emergency response (ER) missions. The Group contributes to national programs intended to protect, deter, and respond to weapons of mass destruction through tailored training and by using specialized applied electromagnetic solutions, rapid prototyping, designing/building/testing/delivering tools and trainers along with novel safing technologies, RF solutions, and cyberphysical applications”. While the specifics of the work performed are classified, the groups “core expertise includes pulsed power; EMP effects; nuclear weapons engineering; weapons effects and materials; predictive/hydrodynamic modeling and testing; firing and penalty systems; x-ray and non-destructive evaluation of threat devices; applied physics; advanced RF systems; powerline communications; novel electronics; 3-D printing of specialized components and cyber assessment/response technologies”. (int.lanl.gov/org/padgs/threat-identification-response/analytics-intelligencetechnology/ a-3/index.shtml)« less

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

NASA Technical Reports Server (NTRS)

Mielke, Roland V. (Inventor); Stoughton, John W. (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.

48 CFR 252.211-7008 - Use of Government-Assigned Serial Numbers

Code of Federal Regulations, 2010 CFR

2010-10-01

... Serial Numbers 252.211-7008 Section 252.211-7008 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE CLAUSES AND FORMS SOLICITATION PROVISIONS AND CONTRACT..., tracked, and towed vehicles for use on highway or rough terrain; weapon and missile end items; ammunition...

Optical bullet-tracking algorithms for weapon localization in urban environments

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

Roberts, R S; Breitfeller, E F

2006-03-31

Localization of the sources of small-arms fire, mortars, and rocket propelled grenades is an important problem in urban combat. Weapons of this type produce characteristic signatures, such as muzzle flashes, that are visible in the infrared. Indeed, several systems have been developed that exploit the infrared signature of muzzle flash to locate the positions of shooters. However, systems based on muzzle flash alone can have difficulty localizing weapons if the muzzle flash is obscured or suppressed. Moreover, optical clutter can be problematic to systems that rely on muzzle flash alone. Lawrence Livermore National Laboratory (LLNL) has developed a projectile trackingmore » system that detects and localizes sources of small-arms fire, mortars and similar weapons using the thermal signature of the projectile rather than a muzzle flash. The thermal signature of a projectile, caused by friction as the projectile travels along its trajectory, cannot be concealed and is easily discriminated from optical clutter. The LLNL system was recently demonstrated at the MOUT facility of the Aberdeen Test Center [1]. In the live-fire demonstration, shooters armed with a variety of small-arms, including M-16s, AK-47s, handguns, mortars and rockets, were arranged at several positions in around the facility. Experiments ranged from a single-weapon firing a single-shot to simultaneous fire of all weapons on full automatic. The LLNL projectile tracking system was demonstrated to localize multiple shooters at ranges up to 400m, far greater than previous demonstrations. Furthermore, the system was shown to be immune to optical clutter that is typical in urban combat. This paper describes the image processing and localization algorithms designed to exploit the thermal signature of projectiles for shooter localization. The paper begins with a description of the image processing that extracts projectile information from a sequence of infrared images. Key to the processing is an adaptive spatio-temporal filter developed to suppress scene clutter. The filtered image sequence is further processed to produce a set of parameterized regions, which are classified using several discriminate functions. Regions that are classified as projectiles are passed to a data association algorithm that matches features from these regions with existing tracks, or initializes new tracks as needed. A Kalman filter is used to smooth and extrapolate existing tracks. Shooter locations are determined by solving a combinatorial least-squares solution for all bullet tracks. It also provides an error ellipse for each shooter, quantifying the uncertainty of shooter location. The paper concludes with examples from the live-fire exercise at the Aberdeen Test Center.« less

New approach for detecting and classifying concealed weapons

NASA Astrophysics Data System (ADS)

Roybal, Lyle G.; Rice, Philip M.; Manhardt, Joseph M.

1997-02-01

The possession of a weapon in the courtroom of our American justice system is a Federal offense. A weapon in the courtroom is a particularly serious problem for judges, plaintiffs, defendants, and bystanders because of the emotional nature and environment of the courtroom. Potential violators include organized criminals and gangsters, individuals with personal vendettas, and otherwise sane and reasonable people who, because of the emotion of the moment, lose sight of right and wrong in our justice system. Most Federal courthouses incorporate some sort of metal detection apparatus used to screen and prevent individuals from carrying personal weapons into courtrooms. These devices are considered conventional in the sense that they employ an active electromagnetic induction technique that is sensitive to the presence of metal. This technique provides no information concerning the massiveness and location of the offending metal object and is prone to false alarms. This work introduces an alternative method for weapons discrimination that is based on passive magnetics technology in concert with simple comparative algorithms such that massiveness and location of suspected weapons may be determined. Since this system provides information not available from conventional metal detectors, false alarms will be greatly reduced, allowing remote monitoring of all entrances into a courtroom from a single vantage point, thereby saving considerable resources used on personnel costs.

Real life identification of partially occluded weapons in video frames

NASA Astrophysics Data System (ADS)

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.

Ontological Problem-Solving Framework for Assigning Sensor Systems and Algorithms to High-Level Missions

PubMed Central

Qualls, Joseph; Russomanno, David J.

2011-01-01

The lack of knowledge models to represent sensor systems, algorithms, and missions makes opportunistically discovering a synthesis of systems and algorithms that can satisfy high-level mission specifications impractical. A novel ontological problem-solving framework has been designed that leverages knowledge models describing sensors, algorithms, and high-level missions to facilitate automated inference of assigning systems to subtasks that may satisfy a given mission specification. To demonstrate the efficacy of the ontological problem-solving architecture, a family of persistence surveillance sensor systems and algorithms has been instantiated in a prototype environment to demonstrate the assignment of systems to subtasks of high-level missions. PMID:22164081

32 CFR 552.121 - Possession or retention of prohibited weapons.

Code of Federal Regulations, 2012 CFR

2012-07-01

... practice of martial arts, for example, a nunchaku, except during the legitimate martial arts training. If martial arts use is authorized, storage of these instruments during nontraining periods will be in a..., BEQ or BOQ. Martial arts instruments may be stored in assigned government family quarters during...

32 CFR 552.121 - Possession or retention of prohibited weapons.

Code of Federal Regulations, 2013 CFR

2013-07-01

... practice of martial arts, for example, a nunchaku, except during the legitimate martial arts training. If martial arts use is authorized, storage of these instruments during nontraining periods will be in a..., BEQ or BOQ. Martial arts instruments may be stored in assigned government family quarters during...

32 CFR 552.121 - Possession or retention of prohibited weapons.

Code of Federal Regulations, 2011 CFR

2011-07-01

... practice of martial arts, for example, a nunchaku, except during the legitimate martial arts training. If martial arts use is authorized, storage of these instruments during nontraining periods will be in a..., BEQ or BOQ. Martial arts instruments may be stored in assigned government family quarters during...

32 CFR 552.121 - Possession or retention of prohibited weapons.

Code of Federal Regulations, 2014 CFR

2014-07-01

... practice of martial arts, for example, a nunchaku, except during the legitimate martial arts training. If martial arts use is authorized, storage of these instruments during nontraining periods will be in a..., BEQ or BOQ. Martial arts instruments may be stored in assigned government family quarters during...

32 CFR 552.121 - Possession or retention of prohibited weapons.

Code of Federal Regulations, 2010 CFR

2010-07-01

... practice of martial arts, for example, a nunchaku, except during the legitimate martial arts training. If martial arts use is authorized, storage of these instruments during nontraining periods will be in a..., BEQ or BOQ. Martial arts instruments may be stored in assigned government family quarters during...

44 CFR 351.24 - The Department of Energy.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 44 Emergency Management and Assistance 1 2011-10-01 2011-10-01 false The Department of Energy. 351... Assignments § 351.24 The Department of Energy. (a) Determine the appropriate planning bases for the Department of Energy (DOE) owned and contractor operated nuclear facilities (e.g., research and weapon...

44 CFR 351.24 - The Department of Energy.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 44 Emergency Management and Assistance 1 2013-10-01 2013-10-01 false The Department of Energy. 351... Assignments § 351.24 The Department of Energy. (a) Determine the appropriate planning bases for the Department of Energy (DOE) owned and contractor operated nuclear facilities (e.g., research and weapon...

44 CFR 351.24 - The Department of Energy.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 44 Emergency Management and Assistance 1 2014-10-01 2014-10-01 false The Department of Energy. 351... Assignments § 351.24 The Department of Energy. (a) Determine the appropriate planning bases for the Department of Energy (DOE) owned and contractor operated nuclear facilities (e.g., research and weapon...

44 CFR 351.24 - The Department of Energy.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false The Department of Energy. 351... Assignments § 351.24 The Department of Energy. (a) Determine the appropriate planning bases for the Department of Energy (DOE) owned and contractor operated nuclear facilities (e.g., research and weapon...

44 CFR 351.24 - The Department of Energy.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 44 Emergency Management and Assistance 1 2012-10-01 2011-10-01 true The Department of Energy. 351... Assignments § 351.24 The Department of Energy. (a) Determine the appropriate planning bases for the Department of Energy (DOE) owned and contractor operated nuclear facilities (e.g., research and weapon...

Grading Practices--Watching Out for Land Mines.

ERIC Educational Resources Information Center

Nottingham, Marv

1988-01-01

The A to F grading pattern is a highly subjective practice that demands great expertise and assumes a high degree of test validity. This article discusses the merits of extra credit assignments, homework, and "pop" quizzes; outlines defensible grading procedures; and discusses common grading problems, such as using grades as weapons. (MLH)

H2LIFT: global navigation simulation ship tracking and WMD detection in the maritime domain

NASA Astrophysics Data System (ADS)

Wyffels, Kevin

2007-04-01

This paper presents initial results for a tracking simulation of multiple maritime vehicles for use in a data fusion program detecting Weapons of Mass Destruction (WMD). This simulation supports a fusion algorithm (H2LIFT) for collecting and analyzing data providing a heuristic analysis tool for detecting weapons of mass destruction in the maritime domain. Tools required to develop a navigational simulation fitting a set of project objectives are introduced for integration into the H2LIFT algorithm. Emphasis is placed on the specific requirements of the H2LIFT project, however the basic equations, algorithms, and methodologies can be used as tools in a variety of scenario simulations. Discussion will be focused on track modeling (e.g. position tracking of ships), navigational techniques, WMD detection, and simulation of these models using Matlab and Simulink. Initial results provide absolute ship position data for a given multi-ship maritime scenario with random generation of a given ship containing a WMD. Required coordinate systems, conversions between coordinate systems, Earth modeling techniques, and navigational conventions and techniques are introduced for development of the simulations.

A New Secondary Structure Assignment Algorithm Using Cα Backbone Fragments

PubMed Central

Cao, Chen; Wang, Guishen; Liu, An; Xu, Shutan; Wang, Lincong; Zou, Shuxue

2016-01-01

The assignment of secondary structure elements in proteins is a key step in the analysis of their structures and functions. We have developed an algorithm, SACF (secondary structure assignment based on Cα fragments), for secondary structure element (SSE) assignment based on the alignment of Cα backbone fragments with central poses derived by clustering known SSE fragments. The assignment algorithm consists of three steps: First, the outlier fragments on known SSEs are detected. Next, the remaining fragments are clustered to obtain the central fragments for each cluster. Finally, the central fragments are used as a template to make assignments. Following a large-scale comparison of 11 secondary structure assignment methods, SACF, KAKSI and PROSS are found to have similar agreement with DSSP, while PCASSO agrees with DSSP best. SACF and PCASSO show preference to reducing residues in N and C cap regions, whereas KAKSI, P-SEA and SEGNO tend to add residues to the terminals when DSSP assignment is taken as standard. Moreover, our algorithm is able to assign subtle helices (310-helix, π-helix and left-handed helix) and make uniform assignments, as well as to detect rare SSEs in β-sheets or long helices as outlier fragments from other programs. The structural uniformity should be useful for protein structure classification and prediction, while outlier fragments underlie the structure–function relationship. PMID:26978354

Classifying threats with a 14-MeV neutron interrogation system.

PubMed

Strellis, Dan; Gozani, Tsahi

2005-01-01

SeaPODDS (Sea Portable Drug Detection System) is a non-intrusive tool for detecting concealed threats in hidden compartments of maritime vessels. This system consists of an electronic neutron generator, a gamma-ray detector, a data acquisition computer, and a laptop computer user-interface. Although initially developed to detect narcotics, recent algorithm developments have shown that the system is capable of correctly classifying a threat into one of four distinct categories: narcotic, explosive, chemical weapon, or radiological dispersion device (RDD). Detection of narcotics, explosives, and chemical weapons is based on gamma-ray signatures unique to the chemical elements. Elements are identified by their characteristic prompt gamma-rays induced by fast and thermal neutrons. Detection of RDD is accomplished by detecting gamma-rays emitted by common radioisotopes and nuclear reactor fission products. The algorithm phenomenology for classifying threats into the proper categories is presented here.

Multiple nodes transfer alignment for airborne missiles based on inertial sensor network

NASA Astrophysics Data System (ADS)

Si, Fan; Zhao, Yan

2017-09-01

Transfer alignment is an important initialization method for airborne missiles because the alignment accuracy largely determines the performance of the missile. However, traditional alignment methods are limited by complicated and unknown flexure angle, and cannot meet the actual requirement when wing flexure deformation occurs. To address this problem, we propose a new method that uses the relative navigation parameters between the weapons and fighter to achieve transfer alignment. First, in the relative inertial navigation algorithm, the relative attitudes and positions are constantly computed in wing flexure deformation situations. Secondly, the alignment results of each weapon are processed using a data fusion algorithm to improve the overall performance. Finally, the feasibility and performance of the proposed method were evaluated under two typical types of deformation, and the simulation results demonstrated that the new transfer alignment method is practical and has high-precision.

A Markov Random Field Framework for Protein Side-Chain Resonance Assignment

NASA Astrophysics Data System (ADS)

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

Nuclear magnetic resonance (NMR) spectroscopy plays a critical role in structural genomics, and serves as a primary tool for determining protein structures, dynamics and interactions in physiologically-relevant solution conditions. The current speed of protein structure determination via NMR is limited by the lengthy time required in resonance assignment, which maps spectral peaks to specific atoms and residues in the primary sequence. Although numerous algorithms have been developed to address the backbone resonance assignment problem [68,2,10,37,14,64,1,31,60], little work has been done to automate side-chain resonance assignment [43, 48, 5]. Most previous attempts in assigning side-chain resonances depend on a set of NMR experiments that record through-bond interactions with side-chain protons for each residue. Unfortunately, these NMR experiments have low sensitivity and limited performance on large proteins, which makes it difficult to obtain enough side-chain resonance assignments. On the other hand, it is essential to obtain almost all of the side-chain resonance assignments as a prerequisite for high-resolution structure determination. To overcome this deficiency, we present a novel side-chain resonance assignment algorithm based on alternative NMR experiments measuring through-space interactions between protons in the protein, which also provide crucial distance restraints and are normally required in high-resolution structure determination. We cast the side-chain resonance assignment problem into a Markov Random Field (MRF) framework, and extend and apply combinatorial protein design algorithms to compute the optimal solution that best interprets the NMR data. Our MRF framework captures the contact map information of the protein derived from NMR spectra, and exploits the structural information available from the backbone conformations determined by orientational restraints and a set of discretized side-chain conformations (i.e., rotamers). A Hausdorff-based computation is employed in the scoring function to evaluate the probability of side-chain resonance assignments to generate the observed NMR spectra. The complexity of the assignment problem is first 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 used to find a set of optimal side-chain resonance assignments that best fit the NMR data. We have tested our algorithm on NMR data for five proteins, including the FF Domain 2 of human transcription elongation factor CA150 (FF2), the B1 domain of Protein G (GB1), human ubiquitin, the ubiquitin-binding zinc finger domain of the human Y-family DNA polymerase Eta (pol η UBZ), and the human Set2-Rpb1 interacting domain (hSRI). Our algorithm assigns resonances for more than 90% of the protons in the proteins, and achieves about 80% correct side-chain resonance assignments. The final structures computed using distance restraints resulting from the set of assigned side-chain resonances have backbone RMSD 0.5 - 1.4 Å and all-heavy-atom RMSD 1.0 - 2.2 Å from the reference structures that were determined by X-ray crystallography or traditional NMR approaches. These results demonstrate that our algorithm can be successfully applied to automate side-chain resonance assignment and high-quality protein structure determination. Since our algorithm does not require any specific NMR experiments for measuring the through-bond interactions with side-chain protons, it can save a significant amount of both experimental cost and spectrometer time, and hence accelerate the NMR structure determination process.

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

PubMed

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 larger number of residues. On the other hand, when there are multiple equally good assignments that are significantly different from each other, the modified NSGA-II is less efficient than MC/SA in finding all the solutions. This problem is solved by a combined NSGA-II/MC algorithm, which appears to have the advantages of both NSGA-II and MC/SA. This combination algorithm is robust for the three most difficult chemical shift datasets examined here and is expected to give the highest-quality de novo assignment of challenging protein NMR spectra.

Integration of tools for the Design and Assessment of High-Performance, Highly Reliable Computing Systems (DAHPHRS), phase 1

NASA Technical Reports Server (NTRS)

Scheper, C.; Baker, R.; Frank, G.; Yalamanchili, S.; Gray, G.

1992-01-01

Systems for Space Defense Initiative (SDI) space applications typically require both high performance and very high reliability. These requirements present the systems engineer evaluating such systems with the extremely difficult problem of conducting performance and reliability trade-offs over large design spaces. A controlled development process supported by appropriate automated tools must be used to assure that the system will meet design objectives. This report describes an investigation of methods, tools, and techniques necessary to support performance and reliability modeling for SDI systems development. Models of the JPL Hypercubes, the Encore Multimax, and the C.S. Draper Lab Fault-Tolerant Parallel Processor (FTPP) parallel-computing architectures using candidate SDI weapons-to-target assignment algorithms as workloads were built and analyzed as a means of identifying the necessary system models, how the models interact, and what experiments and analyses should be performed. As a result of this effort, weaknesses in the existing methods and tools were revealed and capabilities that will be required for both individual tools and an integrated toolset were identified.

United Campuses to Prevent Nuclear War: Nuclear War Course Summaries.

ERIC Educational Resources Information Center

Journal of College Science Teaching, 1983

1983-01-01

Briefly describes 46 courses on nuclear war available from United Campuses to Prevent Nuclear War (UCAM). These courses are currently being or have been taught at colleges/universities, addressing effects of nuclear war, arms race history, new weapons, and past arms control efforts. Syllabi (with assignments/reading lists) are available from UCAM.…

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

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

Syed A. Ahmad; Umesh Shukla; Ryan E. Irwin

2011-03-01

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five algorithms representative of DCPA used in literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate themore » effectiveness of the algorithms in achieving feasible link allocations in the network, as well as their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment (LICIPA) algorithm does not require cross-link gain information, has the overall lowest run time, and highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.« less

Dynamic traffic assignment : genetic algorithms approach

DOT National Transportation Integrated Search

1997-01-01

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

Craig R. Bomben

NASA Technical Reports Server (NTRS)

2001-01-01

Craig R. Bomben became a pilot in the Flight Crew Branch of NASA's Dryden Flight Research Center, Edwards, Calif., in June 2001. His flying duties include a variety of research and support activities while piloting the F/A-18, DC-8, T-34C and King Air aircraft. He has more than 17 years and 3,800 hours of military and civilian flight experience in over 50 different aircraft types. Bomben came to NASA Dryden from a U.S. Navy assignment to the Personnel Exchange Program, Canada. He served as a test pilot in the Canadian Armed Forces located in Cold Lake, Alberta. He participated in numerous developmental programs to include CT-133 airborne ejection seat testing, F/A-18 weapons flutter testing and F/A-18 night vision goggles integration. Bomben performed U.S. Navy fleet service in 1995 as a strike-fighter department head. He completed two overseas deployments onboard the USS George Washington and USS Stennis. As a combat strike leader, he headed numerous multi-national missions over Iraq in support of Operation Southern Watch. Bomben graduated from the U.S. Naval Test Pilot School in 1992 and was subsequently assigned to the Naval Weapons Test Squadron at Pt. Mugu, Calif. During this tour he developed the F-14D bombsight and worked on various other F-14D and F/A-18 weapon systems developmental programs. Bomben is a 1985 graduate of Washington State University with a bachelor of science degree in electrical engineering. He graduated from naval flight training in 1987 and was recognized as a Commodore List graduate. His first assignment was to Naval Air Station Pensacola, Fla., where he was an instructor in the T-2B Buckeye. When selected to fly the F/A-18 in 1989, he joined a fleet squadron and deployed aboard the USS Forrestal. Bomben is married to the former Aissa Asuncion. They live in Lancaster, Calif., with their 3 children.

Craig R. Bomben

NASA Image and Video Library

2001-06-19

Craig R. Bomben became a pilot in the Flight Crew Branch of NASA's Dryden Flight Research Center, Edwards, Calif., in June 2001. His flying duties include a variety of research and support activities while piloting the F/A-18, DC-8, T-34C and King Air aircraft. He has more than 17 years and 3,800 hours of military and civilian flight experience in over 50 different aircraft types. Bomben came to NASA Dryden from a U.S. Navy assignment to the Personnel Exchange Program, Canada. He served as a test pilot in the Canadian Armed Forces located in Cold Lake, Alberta. He participated in numerous developmental programs to include CT-133 airborne ejection seat testing, F/A-18 weapons flutter testing and F/A-18 night vision goggles integration. Bomben performed U.S. Navy fleet service in 1995 as a strike-fighter department head. He completed two overseas deployments onboard the USS George Washington and USS Stennis. As a combat strike leader, he headed numerous multi-national missions over Iraq in support of Operation Southern Watch. Bomben graduated from the U.S. Naval Test Pilot School in 1992 and was subsequently assigned to the Naval Weapons Test Squadron at Pt. Mugu, Calif. During this tour he developed the F-14D bombsight and worked on various other F-14D and F/A-18 weapon systems developmental programs. Bomben is a 1985 graduate of Washington State University with a bachelor of science degree in electrical engineering. He graduated from naval flight training in 1987 and was recognized as a Commodore List graduate. His first assignment was to Naval Air Station Pensacola, Fla., where he was an instructor in the T-2B Buckeye. When selected to fly the F/A-18 in 1989, he joined a fleet squadron and deployed aboard the USS Forrestal. Bomben is married to the former Aissa Asuncion. They live in Lancaster, Calif., with their 3 children.

A Practical Millimeter-Wave Holographic Imaging System with Tunable IF Attenuator

NASA Astrophysics Data System (ADS)

Zhu, Yu-Kun; Yang, Ming-Hui; Wu, Liang; Sun, Yun; Sun, Xiao-Wei

2017-10-01

A practical millimeter-wave (mmw) holographic imaging system with tunable intermediate frequency (IF) attenuator has been developed. It can be used for the detection of concealed weapons at security checkpoints, especially the airport. The system is utilized to scan the passenger and detect the weapons hidden in the clothes. To reconstruct the three dimensions (3-D) image, a holographic mmw imaging algorithm based on aperture synthesis and back scattering is presented. The system is active and works at 28-33 GHz. Tunable IF attenuator is applied to compensate the intensity and phase differences between multi-channels and multi-frequencies.

Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu\\xA0search

NASA Astrophysics Data System (ADS)

Yeh, Cheng-Ta; Lin, Yi-Kuei; Yang, Jo-Yun

2018-07-01

Network reliability is an important performance index for many real-life systems, such as electric power systems, computer systems and transportation systems. These systems can be modelled as stochastic-flow networks (SFNs) composed of arcs and nodes. Most system supervisors respect the network reliability maximization by finding the optimal multi-state resource assignment, which is one resource to each arc. However, a disaster may cause correlated failures for the assigned resources, affecting the network reliability. This article focuses on determining the optimal resource assignment with maximal network reliability for SFNs. To solve the problem, this study proposes a hybrid algorithm integrating the genetic algorithm and tabu search to determine the optimal assignment, called the hybrid GA-TS algorithm (HGTA), and integrates minimal paths, recursive sum of disjoint products and the correlated binomial distribution to calculate network reliability. Several practical numerical experiments are adopted to demonstrate that HGTA has better computational quality than several popular soft computing algorithms.

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

DTIC Science & Technology

2015-09-01

this specific application. A scaled-down version for a fire team was created with XBee Pro radios, Arduino Uno microcontrollers, Raspberry Pi computers...constructed with XBee Pro radios, Arduino Uno microcontrollers, Raspberry Pi computers and ROS [5]. The XBee Pro radios and Arduino Uno microcontrollers...communicated the positional data of each node as shown in Figure 4, and the Raspberry Pi computers and ROS executed the tracking algorithm and allowed

Evaluation of Automatically Assigned Job-Specific Interview Modules

PubMed Central

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

Objective: In community-based epidemiological studies, job- and industry-specific ‘modules’ are often used to systematically obtain details about the subject’s work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the 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. Methods: 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 the algorithm-assigned module (none, low, medium, high). Results: The most frequently assigned modules were the work location (33%), solvent (20%), farming and food industry (19%), and dry cleaning and textile industry (6.4%) modules. In the reliability subset, the algorithm assignment had an exact match to the expert consensus-assigned module for 722 (57.7%) of the 1251 jobs. Overall, adjusted for the proportion of jobs in each stratum, we estimated that 86% of the algorithm-assigned modules would result in no information loss, 2% would have low information loss, and 12% would have medium to high information loss. Medium to high information loss occurred for <10% of the jobs assigned the generic solvent module and for 21, 32, and 31% of the jobs assigned the work location module with location responses of ‘someplace else’, ‘factory’, and ‘don’t know’, respectively. Other work location responses had ≤8% with medium to high information loss because of redirections to other modules. Medium to high information loss occurred more frequently when a job description matched with multiple keywords pointing to different modules (29–69%, depending on the triggered assignment rule). Conclusions: These evaluations demonstrated that automatically assigned modules can reliably reproduce an expert’s module assignment without the direct involvement of an industrial hygienist or interviewer. The feasibility of adapting this framework to other studies will be language- and exposure-specific. PMID:27250109

Evaluation of Automatically Assigned Job-Specific Interview Modules.

PubMed

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 the algorithm-assigned module (none, low, medium, high). The most frequently assigned modules were the work location (33%), solvent (20%), farming and food industry (19%), and dry cleaning and textile industry (6.4%) modules. In the reliability subset, the algorithm assignment had an exact match to the expert consensus-assigned module for 722 (57.7%) of the 1251 jobs. Overall, adjusted for the proportion of jobs in each stratum, we estimated that 86% of the algorithm-assigned modules would result in no information loss, 2% would have low information loss, and 12% would have medium to high information loss. Medium to high information loss occurred for <10% of the jobs assigned the generic solvent module and for 21, 32, and 31% of the jobs assigned the work location module with location responses of 'someplace else', 'factory', and 'don't know', respectively. Other work location responses had ≤8% with medium to high information loss because of redirections to other modules. Medium to high information loss occurred more frequently when a job description matched with multiple keywords pointing to different modules (29-69%, depending on the triggered assignment rule). These evaluations demonstrated that automatically assigned modules can reliably reproduce an expert's module assignment without the direct involvement of an industrial hygienist or interviewer. The feasibility of adapting this framework to other studies will be language- and exposure-specific. Published by Oxford University Press on behalf of the British Occupational Hygiene Society 2016.

Application of a fast sorting algorithm to the assignment of mass spectrometric cross-linking data.

PubMed

Petrotchenko, Evgeniy V; Borchers, Christoph H

2014-09-01

Cross-linking combined with MS involves enzymatic digestion of cross-linked proteins and identifying cross-linked peptides. Assignment of cross-linked peptide masses requires a search of all possible binary combinations of peptides from the cross-linked proteins' sequences, which becomes impractical with increasing complexity of the protein system and/or if digestion enzyme specificity is relaxed. Here, we describe the application of a fast sorting algorithm to search large sequence databases for cross-linked peptide assignments based on mass. This same algorithm has been used previously for assigning disulfide-bridged peptides (Choi et al., ), but has not previously been applied to cross-linking studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

AUTOBA: automation of backbone assignment from HN(C)N suite of experiments.

PubMed

Borkar, Aditi; Kumar, Dinesh; Hosur, Ramakrishna V

2011-07-01

Development of efficient strategies and automation represent important milestones of progress in rapid structure determination efforts in proteomics research. In this context, we present here an efficient algorithm named as AUTOBA (Automatic Backbone Assignment) designed to automate the assignment protocol based on HN(C)N suite of experiments. Depending upon the spectral dispersion, the user can record 2D or 3D versions of the experiments for assignment. The algorithm uses as inputs: (i) protein primary sequence and (ii) peak-lists from user defined HN(C)N suite of experiments. In the end, one gets H(N), (15)N, C(α) and C' assignments (in common BMRB format) for the individual residues along the polypeptide chain. The success of the algorithm has been demonstrated, not only with experimental spectra recorded on two small globular proteins: ubiquitin (76 aa) and M-crystallin (85 aa), but also with simulated spectra of 27 other proteins using assignment data from the BMRB.

A model and solving algorithm of combination planning for weapon equipment based on Epoch-era analysis method

NASA Astrophysics Data System (ADS)

Wang, Meng; Zhang, Huaiqiang; Zhang, Kan

2017-10-01

Focused on the circumstance that the equipment using demand in the short term and the development demand in the long term should be made overall plans and took into consideration in the weapons portfolio planning and the practical problem of the fuzziness in the definition of equipment capacity demand. The expression of demand is assumed to be an interval number or a discrete number. With the analysis method of epoch-era, a long planning cycle is broke into several short planning cycles with different demand value. The multi-stage stochastic programming model is built aimed at maximize long-term planning cycle demand under the constraint of budget, equipment development time and short planning cycle demand. The scenario tree is used to discretize the interval value of the demand, and genetic algorithm is designed to solve the problem. At last, a case is studied to demonstrate the feasibility and effectiveness of the proposed mode.

Analysis of labor employment assessment on production machine to minimize time production

NASA Astrophysics Data System (ADS)

Hernawati, Tri; Suliawati; Sari Gumay, Vita

2018-03-01

Every company both in the field of service and manufacturing always trying to pass efficiency of it’s resource use. One resource that has an important role is labor. Labor has different efficiency levels for different jobs anyway. Problems related to the optimal allocation of labor that has different levels of efficiency for different jobs are called assignment problems, which is a special case of linear programming. In this research, Analysis of Labor Employment Assesment on Production Machine to Minimize Time Production, in PT PDM is done by using Hungarian algorithm. The aim of the research is to get the assignment of optimal labor on production machine to minimize time production. The results showed that the assignment of existing labor is not suitable because the time of completion of the assignment is longer than the assignment by using the Hungarian algorithm. By applying the Hungarian algorithm obtained time savings of 16%.

Scheduling with genetic algorithms

NASA Technical Reports Server (NTRS)

Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.

1994-01-01

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

Simulated annealing algorithm for solving chambering student-case assignment problem

NASA Astrophysics Data System (ADS)

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.

More reliable protein NMR peak assignment via improved 2-interval scheduling.

PubMed

Chen, Zhi-Zhong; Lin, Guohui; Rizzi, Romeo; Wen, Jianjun; Xu, Dong; Xu, Ying; Jiang, Tao

2005-03-01

Protein NMR peak assignment refers to the process of assigning a group of "spin systems" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination. Recently, protein NMR peak assignment has been formulated as an interval scheduling problem (ISP), where a protein sequence P of amino acids is viewed as a discrete time interval I (the amino acids on P one-to-one correspond to the time units of I), each subset S of spin systems that are known to originate from consecutive amino acids from P is viewed as a "job" j(s), the preference of assigning S to a subsequence P of consecutive amino acids on P is viewed as the profit of executing job j(s) in the subinterval of I corresponding to P, and the goal is to maximize the total profit of executing the jobs (on a single machine) during I. The interval scheduling problem is max SNP-hard in general; but in the real practice of protein NMR peak assignment, each job j(s) usually requires at most 10 consecutive time units, and typically the jobs that require one or two consecutive time units are the most difficult to assign/schedule. In order to solve these most difficult assignments, we present an efficient 13/7-approximation algorithm for the special case of the interval scheduling problem where each job takes one or two consecutive time units. Combining this algorithm with a greedy filtering strategy for handling long jobs (i.e., jobs that need more than two consecutive time units), we obtain a new efficient heuristic for protein NMR peak assignment. Our experimental study shows that the new heuristic produces the best peak assignment in most of the cases, compared with the NMR peak assignment algorithms in the recent literature. The above algorithm is also the first approximation algorithm for a nontrivial case of the well-known interval scheduling problem that breaks the ratio 2 barrier.

Adaptive protection algorithm and system

DOEpatents

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.

A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications

NASA Astrophysics Data System (ADS)

Entezari-Maleki, Reza; Movaghar, Ali

Task scheduling algorithms in grid environments strive to maximize the overall throughput of the grid. In order to maximize the throughput of the grid environments, the makespan of the grid tasks should be minimized. In this paper, a new task scheduling algorithm is proposed to assign tasks to the grid resources with goal of minimizing the total makespan of the tasks. The algorithm uses the genetic approach to find the suitable assignment within grid resources. The experimental results obtained from applying the proposed algorithm to schedule independent tasks within grid environments demonstrate the applicability of the algorithm in achieving schedules with comparatively lower makespan in comparison with other well-known scheduling algorithms such as, Min-min, Max-min, RASA and Sufferage algorithms.

DefenseLink Special: On Assignment with Jim Garamone

Science.gov Websites

DefenseLink.mil Aug. 04, 2015 War on Terror Transformation News Products Press Resources Images Websites Contact LOYALTY, Iraq, June 26, 2006 - As the nature of the war on terror in Iraq has changed, so have the targets of Africa Using New Weapon in Terror War * Progress Being Made Throughout U.S. Central Command Region

An Evaluation of the WSSC (Weapon System Support Cost) Cost Allocation Algorithms. II. Installation Support.

DTIC Science & Technology

1983-06-01

S XX3OXX, or XX37XX is found. As a result, the following two host-financed tenant support accounts currently will be treated as unit operations costs ... Horngren , Cost Accounting : A Managerial Emphasis, Prentice-Hall Inc., Englewood Cliffs, NJ, 1972. 10. D. B. Levine and J. M. Jondrow, "The...WSSC COST ALLOCATION Technical Report ~ALGORITHMS II: INSTALLATION SUPPORT 6. PERFORMING ORG. REPORT NUMBER 7. AUTHOR( S ) 9. CONTRACT OR GRANT NUMBER

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

NASA Astrophysics Data System (ADS)

Barnawi, Waleed T.

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

Deducing chemical structure from crystallographically determined atomic coordinates

PubMed Central

Bruno, Ian J.; Shields, Gregory P.; Taylor, Robin

2011-01-01

An improved algorithm has been developed for assigning chemical structures to incoming entries to the Cambridge Structural Database, using only the information available in the deposited CIF. Steps in the algorithm include detection of bonds, selection of polymer unit, resolution of disorder, and assignment of bond types and formal charges. The chief difficulty is posed by the large number of metallo-organic crystal structures that must be processed, given our aspiration that assigned chemical structures should accurately reflect properties such as the oxidation states of metals and redox-active ligands, metal coordination numbers and hapticities, and the aromaticity or otherwise of metal ligands. Other complications arise from disorder, especially when it is symmetry imposed or modelled with the SQUEEZE algorithm. Each assigned structure is accompanied by an estimate of reliability and, where necessary, diagnostic information indicating probable points of error. Although the algorithm was written to aid building of the Cambridge Structural Database, it has the potential to develop into a general-purpose tool for adding chemical information to newly determined crystal structures. PMID:21775812

Autonomous Guidance Strategy for Spacecraft Formations and Reconfiguration Maneuvers

NASA Astrophysics Data System (ADS)

Wahl, Theodore P.

A guidance strategy for autonomous spacecraft formation reconfiguration maneuvers is presented. The guidance strategy is presented as an algorithm that solves the linked assignment and delivery problems. The assignment problem is the task of assigning the member spacecraft of the formation to their new positions in the desired formation geometry. The guidance algorithm uses an auction process (also called an "auction algorithm''), presented in the dissertation, to solve the assignment problem. The auction uses the estimated maneuver and time of flight costs between the spacecraft and targets to create assignments which minimize a specific "expense'' function for the formation. The delivery problem is the task of delivering the spacecraft to their assigned positions, and it is addressed through one of two guidance schemes described in this work. The first is a delivery scheme based on artificial potential function (APF) guidance. APF guidance uses the relative distances between the spacecraft, targets, and any obstacles to design maneuvers based on gradients of potential fields. The second delivery scheme is based on model predictive control (MPC); this method uses a model of the system dynamics to plan a series of maneuvers designed to minimize a unique cost function. The guidance algorithm uses an analytic linearized approximation of the relative orbital dynamics, the Yamanaka-Ankersen state transition matrix, in the auction process and in both delivery methods. The proposed guidance strategy is successful, in simulations, in autonomously assigning the members of the formation to new positions and in delivering the spacecraft to these new positions safely using both delivery methods. This guidance algorithm can serve as the basis for future autonomous guidance strategies for spacecraft formation missions.

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

Peterson, J.F.

The global proliferation of ballistic missiles and weapons of mass destruction (WMD) has become one of the most immediate and dangerous threats to U.S. national security. Ballistic missiles were used in four of the last six major wars. Some 190 missiles were fired by Iraqis over a six week period at Iranian cities in 1988, during the 'War of the Cities'. Iraq's firing of Scuds against coalition forces and Israel during the Gulf War provided a vivid reminder of the threat these weapons can present to the world community. During the 1980's, many Third World countries assigned a high prioritymore » to the acquisition of ballistic missiles. By 1991, more than 20 of these nations either possessed ballistic missiles or were attempting to obtain them. Today 43 nations possess ballistic missiles. Seventeen of these probably have a nuclear weapon capability, with 20 of them possessing also a chemical or biological capability. This paper seeks to: define the military challenge ballistic missiles represent; review current U.S. counter-proliferation and nonproliferation initiatives and, finally make recommendations on other potential methods or considerations to reduce ballistic missile proliferation.« less

Preliminary assessment of the impact of incorporating a detailed algorithm for the effects of nuclear irradiation on combat crew performance into the Janus combat simulation

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

Warshawsky, A.S.; Uzelac, M.J.; Pimper, J.E.

The Crew III algorithm for assessing time and dose dependent combat crew performance subsequent to nuclear irradiation was incorporated into the Janus combat simulation system. Battle outcomes using this algorithm were compared to outcomes based on the currently used time-independent cookie-cutter'' assessment methodology. The results illustrate quantifiable differences in battle outcome between the two assessment techniques. Results suggest that tactical nuclear weapons are more effective than currently assumed if performance degradation attributed to radiation doses between 150 to 3000 rad are taken into account. 6 refs., 9 figs.

Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment

PubMed Central

Karimzadehgan, Maryam; Zhai, ChengXiang

2011-01-01

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

The airport gate assignment problem: a survey.

PubMed

Bouras, Abdelghani; Ghaleb, Mageed A; Suryahatmaja, Umar S; Salem, Ahmed M

2014-01-01

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

The Airport Gate Assignment Problem: A Survey

PubMed Central

Ghaleb, Mageed A.; Salem, Ahmed M.

2014-01-01

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

Effectiveness Testing and Evaluation of Non-Lethal Weapons for Crowd Management

DTIC Science & Technology

2014-06-01

and Combat Service Support• Program Executive Office Ground Combat Systems • Program Executive Office Soldier TACOM LCMC MG Michael J. Terry Assigned...technologies and explosive ordnance disposal Fire Control: Battlefield digitization; embedded system software; aero ballistics and telemetry ARDEC...influence predictive variables Introduction Crowd Behavior Research at TBRL UNCLASSIFIED 7 Data Measurement • Vicon V8i system • 24 cameras • 120 fps

Distributed resource allocation under communication constraints

NASA Astrophysics Data System (ADS)

Dodin, Pierre; Nimier, Vincent

2001-03-01

This paper deals with a study of the multi-sensor management problem for multi-target tracking. The collaboration between many sensors observing the same target means that they are able to fuse their data during the information process. Then one must take into account this possibility to compute the optimal association sensors-target at each step of time. In order to solve this problem for real large scale system, one must both consider the information aspect and the control aspect of the problem. To unify these problems, one possibility is to use a decentralized filtering algorithm locally driven by an assignment algorithm. The decentralized filtering algorithm we use in our model is the filtering algorithm of Grime, which relaxes the usual full-connected hypothesis. By full-connected, one means that the information in a full-connected system is totally distributed everywhere at the same moment, which is unacceptable for a real large scale system. We modelize the distributed assignment decision with the help of a greedy algorithm. Each sensor performs a global optimization, in order to estimate other information sets. A consequence of the relaxation of the full- connected hypothesis is that the sensors' information set are not the same at each step of time, producing an information dis- symmetry in the system. The assignment algorithm uses a local knowledge of this dis-symmetry. By testing the reactions and the coherence of the local assignment decisions of our system, against maneuvering targets, we show that it is still possible to manage with decentralized assignment control even though the system is not full-connected.

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

NASA Astrophysics Data System (ADS)

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 driving milestone events that helped shape the Clip-On weapon sight industry. Then, this paper systematically reviews current attributes of integrated multispectral wavelength electro-optical imaging systems that successfully (and sometimes unsuccessfully) shape today's Warrior, Soldier and User's net-capabilities. Finally, this paper explores the evolution, pros and cons, of future Clip-On weapon sights, from a manufacturing and real world applications perspective for tomorrow's military soldier and paramilitary first responder.

Assignment Of Finite Elements To Parallel Processors

NASA Technical Reports Server (NTRS)

Salama, Moktar A.; Flower, Jon W.; Otto, Steve W.

1990-01-01

Elements assigned approximately optimally to subdomains. Mapping algorithm based on simulated-annealing concept used to minimize approximate time required to perform finite-element computation on hypercube computer or other network of parallel data processors. Mapping algorithm needed when shape of domain complicated or otherwise not obvious what allocation of elements to subdomains minimizes cost of computation.

The application of an MPM-MFM method for simulating weapon-target interaction.

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

Ma, X.; Zou, Q.; Zhang, D. Z.

2005-01-01

During the past two decades, Los Alamos National Laboratory (LANL) has developed computational algorithms and software for analysis of multiphase flow suitable for high-speed projectile penetration of metallic and nonmetallic materials, using a material point method (MPM)-multiphase flow method (MFM). Recently, ACTA has teamed with LANL to advance a computational algorithm for simulating complex weapon-target interaction for penetrating and exploding munitions, such as tank rounds and artillery shells, as well as non-exploding kinetic energy penetrators. This paper will outline the mathematical basis for the MPM-MFM method as implemented in LANL's CartaBlanca code. CartaBlanca, written entirely in Java using object-oriented design,more » is used to solve complex problems involving (a) failure and penetration of solids, (b) heat transfer, (c) phase change, (d) chemical reactions, and (e) multiphase flow. We will present its application to the penetration of a steel target by a tungsten cylinder and compare results with time-resolved experimental data published by Anderson, et. al., Int. J. Impact Engng., Vol. 16, No. 1, pp. 1-18, 1995.« less

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.

PubMed

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.

Systematic assignment of thermodynamic constraints in metabolic network models

PubMed Central

Kümmel, Anne; Panke, Sven; Heinemann, Matthias

2006-01-01

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 reactions that are required to disable thermodynamically infeasible energy production. Conclusion Although not being fully comprehensive, our algorithm for systematic reaction direction assignment could define a significant number of irreversible reactions automatically with low computational effort. We envision that the presented algorithm is a valuable part of a computational framework that assists the automated reconstruction of genome-scale metabolic models. PMID:17123434

History of 232-F, tritium extraction processing

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

Blackburn, G.W.

1994-08-01

In 1950 the Atomic Energy Commission authorized the Savannah River Project principally for the production of tritium and plutonium-239 for use in thermonuclear weapons. 232-F was built as an interim facility in 1953--1954, at a cost of $3.9M. Tritium extraction operations began in October, 1955, after the reactor and separations startups. In July, 1957 a larger tritium facility began operation in 232-H. In 1958 the capacity of 232-H was doubled. Also, in 1957 a new task was assigned to Savannah River, the loading of tritium into reservoirs that would be actual components of thermonuclear weapons. This report describes the historymore » of 232-F, the process for tritium extraction, and the lessons learned over the years that were eventually incorporated into the new Replacement Tritium Facility.« less

United States Air Force Graduate Student Research Program. 1989 Program Management Report

DTIC Science & Technology

1989-12-01

research at Air Force laboratories /centers. Each assignment is in a subject area and at an Air Force facility mutually agreed upon by the...housing difficult to find, c) 10 weeks too short for research period. June 20, 1989 Astronautics Laboratory Edwards Air Force Base, California June 21...1989 HRL: Operations Training Division Williams Air Force Base, Arizona June 22, 1989 Weapons Laboratory Kirtland Air

Reduction of Total Ownership Cost

DTIC Science & Technology

2003-09-30

preparation of the Technology Development Strategy, which addresses technology risk for a new weapon system. If there is a misstep...requirements for a new system may be transfixed by the technical performance and may not clearly establish requirements for ownership cost to achieve...important to the PM than TOC goals that will not be realized until long after the PM has departed for a new assignment or retired. If PMs and their

Method and Process for the Creation of Modeling and Simulation Tools for Human Crowd Behavior

DTIC Science & Technology

2014-07-23

Support• Program Executive Office Ground Combat Systems • Program Executive Office Soldier TACOM LCMC MG Michael J. Terry Assigned/Direct Support...environmental technologies and explosive ordnance disposal Fire Control: Battlefield digitization; embedded system software; aero ballistics and...MRAD – Handheld stand-off NLW operated by Control Force • Simulated Projectile Weapon • Simulated Handheld Directed Energy NLW ( VDE ) – Simulated

Adhesives: Test Method, Group Assignment, and Categorization Guide for High-Loading-Rate Applications Preparation and Testing of Single Lap Joints (Ver. 2.2, Unlimited)

DTIC Science & Technology

2016-04-01

Gerard Chaney, and Charles Pergantis Weapons and Materials Research Directorate, ARL Coatings, Corrosion, and Engineered Polymers Branch (CCEPB...SUBJECT TERMS single lap joint, adhesive, sample preparation, testing, database, metadata, material pedigree, ISO 16. SECURITY CLASSIFICATION OF: 17...temperature/water immersion conditioning test for lap-joint test specimens using the test tubes and convection oven method

One of My Favorite Assignments: Automated Teller Machine Simulation.

ERIC Educational Resources Information Center

Oberman, Paul S.

2001-01-01

Describes an assignment for an introductory computer science class that requires the student to write a software program that simulates an automated teller machine. Highlights include an algorithm for the assignment; sample file contents; language features used; assignment variations; and discussion points. (LRW)

Optimal processor assignment for pipeline computations

NASA Technical Reports Server (NTRS)

Nicol, David M.; Simha, Rahul; Choudhury, Alok N.; Narahari, Bhagirath

1991-01-01

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

Advancement and results in hostile fire indication using potassium line missile warning sensors

NASA Astrophysics Data System (ADS)

Montgomery, Joel; Montgomery, Marjorie; Hardie, Russell

2014-06-01

M&M Aviation has been developing and conducting Hostile Fire Indication (HFI) tests using potassium line emission sensors for the Air Force Visible Missile Warning System (VMWS) to advance both algorithm and sensor technologies for UAV and other airborne systems for self protection and intelligence purposes. Work began in 2008 as an outgrowth of detecting and classifying false alarm sources for the VMWS using the same K-line spectral discrimination region but soon became a focus of research due to the high interest in both machine-gun fire and sniper geo-location via airborne systems. Several initial tests were accomplished in 2009 using small and medium caliber weapons including rifles. Based on these results, the Air Force Research Laboratory (AFRL) funded the Falcon Sentinel program in 2010 to provide for additional development of both the sensor concept, algorithm suite changes and verification of basic phenomenology including variance based on ammunition type for given weapons platform. Results from testing over the past 3 years have showed that the system would be able to detect and declare a sniper rifle at upwards of 3km, medium machine gun at 5km, and explosive events like hand-grenades at greater than 5km. This paper will outline the development of the sensor systems, algorithms used for detection and classification, and test results from VMWS prototypes as well as outline algorithms used for the VMWS. The Falcon Sentinel Program will be outlined and results shown. Finally, the paper will show the future work for ATD and transition efforts after the Falcon Sentinel program completed.

An agglomerative hierarchical clustering approach to visualisation in Bayesian clustering problems

PubMed Central

Dawson, Kevin J.; Belkhir, Khalid

2009-01-01

Clustering problems (including the clustering of individuals into outcrossing populations, hybrid generations, full-sib families and selfing lines) have recently received much attention in population genetics. In these clustering problems, the parameter of interest is a partition of the set of sampled individuals, - the sample partition. In a fully Bayesian approach to clustering problems of this type, our knowledge about the sample partition is represented by a probability distribution on the space of possible sample partitions. Since the number of possible partitions grows very rapidly with the sample size, we can not visualise this probability distribution in its entirety, unless the sample is very small. As a solution to this visualisation problem, we recommend using an agglomerative hierarchical clustering algorithm, which we call the exact linkage algorithm. This algorithm is a special case of the maximin clustering algorithm that we introduced previously. The exact linkage algorithm is now implemented in our software package Partition View. The exact linkage algorithm takes the posterior co-assignment probabilities as input, and yields as output a rooted binary tree, - or more generally, a forest of such trees. Each node of this forest defines a set of individuals, and the node height is the posterior co-assignment probability of this set. This provides a useful visual representation of the uncertainty associated with the assignment of individuals to categories. It is also a useful starting point for a more detailed exploration of the posterior distribution in terms of the co-assignment probabilities. PMID:19337306

Advanced FIREFLY Assessment Generalized Mechanization Requirements Report

DTIC Science & Technology

1979-06-01

Systems; Fire Control Computers ; Weapon Control 20. ABSTRACT (Continue on reverse side If necessary end tdentify by blockc number) -The requirements for...airborne digital computer which can be specialized to per- form successfully in a variety of tactical aircraft with differing avionics sensors, fire...AGG ........................................... 27 13 Time of Flight Computation Using a Modified (China Lake) Numerical Integration Algorithm

The Sources of Islamic Revolutionary Conduct

DTIC Science & Technology

2005-04-01

the pano- ply of magical powers that religious tradition has always assigned to it.”426 Thus, martyrdom is best seen as what Emile Durkheim once called...wherever they exist.428 As Durkheim described them, they are individuals who “are almost completely absorbed in the group”; who “completely [discard...hinterlands of Pakistan, and the desert landscape stretching across North 428Gould, “Suicide as a Weapon of Mass Destruction.” 429Emile Durkheim quoted

Shaping the U.S. Military for the Global Security Environment of the Year 2000

DTIC Science & Technology

1990-11-19

demonstrated that in certain circumstances, forces equipped with commercial vehicles and the proper mix of light, export-quality arms and equipment...in bad weather. Second-order states have equipment inventories drawn form the world arms market , and thus have selected weapons nearly as capable as...security regimes potentially reducing requirements for assigned and earmarked troops. Technology is perhaps the most mixed blessing of the influences on

Roster of NSAP (Navy Science Assistance Program) Field Team Members, Fiscal Years 1971-1986

DTIC Science & Technology

1985-08-05

CAPTOR Evaluation Program, NSWC. Current Job/Position: Operational Requirements Analyst for a new generation of mines. Current Address: Officer in...to NSAP Field Assignment: General Engineer; combat systems engineering on new ship design concepts, NSWC. Current Job/Position: Electronic Engineer...ADDRESS 12. REPORT DATE Naval Surface Weapons Center (Code D23) 5 August 1985 10901 New Hampshire Avenue 13. NUMBER OF PAGES Silver Spring, MD 20910

Glossary of Terms--Nuclear Weapon Phenomena and Effects

DTIC Science & Technology

1985-02-15

w".: w~*~ combat ineffective. An individual whose injuries are of such nature that he is no longer capable of carrying out his assigned task...significantly harmful result [39]. That dose of ionizing radiation that is not expected to cause appreciable bodily injury to a person at any time during his...art and science of protecting human beings from injury by radia- tion, and promoting better health through beneficial applications of radiation [39

Strategic Deterrence in the Post-Start Era

DTIC Science & Technology

1992-04-15

electricity, and supplies. Allegedly, weapons could be delivered so accurately that electric power plants were struck in such a fashion that repair time would... power plants , but also their relative outputs, then an analyst could construct a plot of electric power production capacity versus number of generating...target values being assigned which may be more appropriate to power plant size. Number of Targets Points per Target Power All sizes 17 58.82 1000 pts

Medicaid beneficiaries in california reported less positive experiences when assigned to a managed care plan.

PubMed

McDonnell, Diana D; Graham, Carrie L

2015-03-01

In 2011 California began transitioning approximately 340,000 seniors and people with disabilities from Medicaid fee-for-service (FFS) to Medicaid managed care plans. When beneficiaries did not actively choose a managed care plan, the state assigned them to one using an algorithm based on their previous FFS primary and specialty care use. When no clear link could be established, beneficiaries were assigned by default to a managed care plan based on weighted randomization. In this article we report the results of a telephone survey of 1,521 seniors and people with disabilities enrolled in Medi-Cal (California Medicaid) and who were recently transitioned to a managed care plan. We found that 48 percent chose their own plan, 11 percent were assigned to a plan by algorithm, and 41 percent were assigned to a plan by default. People in the latter two categories reported being similarly less positive about their experiences compared to beneficiaries who actively chose a plan. Many states in addition to California are implementing mandatory transitions of Medicaid-only beneficiaries to managed care plans. Our results highlight the importance of encouraging beneficiaries to actively choose their health plan; when beneficiaries do not choose, states should employ robust intelligent assignment algorithms. Project HOPE—The People-to-People Health Foundation, Inc.

An Improved SoC Test Scheduling Method Based on Simulated Annealing Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Jingjing; Shen, Zhihang; Gao, Huaien; Chen, Bianna; Zheng, Weida; Xiong, Xiaoming

2017-02-01

In this paper, we propose an improved SoC test scheduling method based on simulated annealing algorithm (SA). It is our first to disorganize IP core assignment for each TAM to produce a new solution for SA, allocate TAM width for each TAM using greedy algorithm and calculate corresponding testing time. And accepting the core assignment according to the principle of simulated annealing algorithm and finally attain the optimum solution. Simultaneously, we run the test scheduling experiment with the international reference circuits provided by International Test Conference 2002(ITC’02) and the result shows that our algorithm is superior to the conventional integer linear programming algorithm (ILP), simulated annealing algorithm (SA) and genetic algorithm(GA). When TAM width reaches to 48,56 and 64, the testing time based on our algorithm is lesser than the classic methods and the optimization rates are 30.74%, 3.32%, 16.13% respectively. Moreover, the testing time based on our algorithm is very close to that of improved genetic algorithm (IGA), which is state-of-the-art at present.

Orientation estimation algorithm applied to high-spin projectiles

NASA Astrophysics Data System (ADS)

Long, D. F.; Lin, J.; Zhang, X. M.; Li, J.

2014-06-01

High-spin projectiles are low cost military weapons. Accurate orientation information is critical to the performance of the high-spin projectiles control system. However, orientation estimators have not been well translated from flight vehicles since they are too expensive, lack launch robustness, do not fit within the allotted space, or are too application specific. This paper presents an orientation estimation algorithm specific for these projectiles. The orientation estimator uses an integrated filter to combine feedback from a three-axis magnetometer, two single-axis gyros and a GPS receiver. As a new feature of this algorithm, the magnetometer feedback estimates roll angular rate of projectile. The algorithm also incorporates online sensor error parameter estimation performed simultaneously with the projectile attitude estimation. The second part of the paper deals with the verification of the proposed orientation algorithm through numerical simulation and experimental tests. Simulations and experiments demonstrate that the orientation estimator can effectively estimate the attitude of high-spin projectiles. Moreover, online sensor calibration significantly enhances the estimation performance of the algorithm.

Flexible Multi agent Algorithm for Distributed Decision Making

DTIC Science & Technology

2015-01-01

How, J. P. Consensus - Based Auction Approaches for Decentralized task Assignment. Proceedings of the AIAA Guidance, Navigation, and Control...G. ; Kim, Y. Market- based Decentralized Task Assignment for Cooperative UA V Mission Including Rendezvous. Proceedings of the AIAA Guidance...scalable and adaptable to a variety of specific mission tasks . Additionally, the algorithm could easily be adapted for use on land or sea- based systems

A circular median filter approach for resolving directional ambiguities in wind fields retrieved from spaceborne scatterometer data

NASA Technical Reports Server (NTRS)

Schultz, Howard

1990-01-01

The retrieval algorithm for spaceborne scatterometry proposed by Schultz (1985) is extended. A circular median filter (CMF) method is presented, which operates on wind directions independently of wind speed, removing any implicit wind speed dependence. A cell weighting scheme is included in the algorithm, permitting greater weights to be assigned to more reliable data. The mathematical properties of the ambiguous solutions to the wind retrieval problem are reviewed. The CMF algorithm is tested on twelve simulated data sets. The effects of spatially correlated likelihood assignment errors on the performance of the CMF algorithm are examined. Also, consideration is given to a wind field smoothing technique that uses a CMF.

Algorithmic Coordination in Robotic Networks

DTIC Science & Technology

2010-11-29

appropriate performance, robustness and scalability properties for various task allocation , surveillance, and information gathering applications is...networking, we envision designing and analyzing algorithms with appropriate performance, robustness and scalability properties for various task ...distributed algorithms for target assignments; based on the classic auction algorithms in static networks, we intend to design efficient algorithms in worst

Adaptive Control Strategies for Flexible Robotic Arm

NASA Technical Reports Server (NTRS)

Bialasiewicz, Jan T.

1996-01-01

The control problem of a flexible robotic arm has been investigated. The control strategies that have been developed have a wide application in approaching the general control problem of flexible space structures. The following control strategies have been developed and evaluated: neural self-tuning control algorithm, neural-network-based fuzzy logic control algorithm, and adaptive pole assignment algorithm. All of the above algorithms have been tested through computer simulation. In addition, the hardware implementation of a computer control system that controls the tip position of a flexible arm clamped on a rigid hub mounted directly on the vertical shaft of a dc motor, has been developed. An adaptive pole assignment algorithm has been applied to suppress vibrations of the described physical model of flexible robotic arm and has been successfully tested using this testbed.

DNABIT Compress - Genome compression algorithm.

PubMed

Rajarajeswari, Pothuraju; Apparao, Allam

2011-01-22

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, "DNABIT Compress" for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that "DNABIT Compress" algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases.

Learning graph matching.

PubMed

Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J

2009-06-01

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.

Individual Combatant’s Weapons Firing Algorithm

DTIC Science & Technology

2010-04-01

target selection prioritization scheme, aim point, mode of fire, and estimates on Phit /Pmiss for a single SME. Also undertaken in this phase of the...5 APPENDIX A: SME FUZZY ESTIMATES ON FACTORS AND ESTIMATES ON PHIT /PMISS.....6...influencing the target selection prioritization scheme, aim point, mode of fire, and estimates on Phit /Pmiss for a single SME. Also undertaken in this

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

PubMed

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

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

NASA Astrophysics Data System (ADS)

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

2016-10-01

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

U.S. FMS (Foreign Military Sales) and ROK (Republic of Korea) Economic Acquisition of Weapon Systems.

DTIC Science & Technology

1987-06-01

of Defense sells military equipment and services to foreign governments and international organizations. DOD may order and buy ( procure ) the... procurement , the U.S. government agency or military department assigned cognizance for this "case" is authorized to enter into a subsequent contractional...the item but are handled in the same way as regular U.S. government procurement , with program directors and systems managers as needed dealing with the

Advanced Weapon System (AWS) Sensor Prediction Techniques Study. Volume I

DTIC Science & Technology

1981-09-01

row and column rather than random. The efficiency of the aigorithm depends on the fact that the grid coordinate system is aligned with the viewray ...pixels. Since the viewscreen is aligned with data base coordinates, the viewray intersections with a row of elevation posts are equally spaced at any...Surface Topography If a viewray strikes but a single terrain face, the viewray will be assigned the color of the face. If the viewray strikes two or

Program Manager: Journal of the Defense Systems Management College. Volume 16, Number 3, May-June 1987

DTIC Science & Technology

1987-06-01

redress a growingstrategic imbalance and provide an en- test pilots conducted a rigorous flight test during capability to penetrate Soviet program...ment career path for rated officers vidual rotates through assignments in ( pilots and navigators) is different from engineering, test and evaluation...pain. Acquiring the B-1B, or any other weapon system for that matter, entails developing, testing ard producing new technology. In any high-tech en

Interactive visual exploration and refinement of cluster assignments.

PubMed

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.

Voltage scheduling for low power/energy

NASA Astrophysics Data System (ADS)

Manzak, Ali

2001-07-01

Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned to lower voltage levels (thus reducing the power consumption). A polynomial time resource and latency constrained scheduling algorithm is developed to distribute the available slack among the nodes such that power consumption is minimum. The algorithm is iterative and utilizes the slack based on the Lagrange multiplier method.

Comparison of four machine learning algorithms for their applicability in satellite-based optical rainfall retrievals

NASA Astrophysics Data System (ADS)

Meyer, Hanna; Kühnlein, Meike; Appelhans, Tim; Nauss, Thomas

2016-03-01

Machine learning (ML) algorithms have successfully been demonstrated to be valuable tools in satellite-based rainfall retrievals which show the practicability of using ML algorithms when faced with high dimensional and complex data. Moreover, recent developments in parallel computing with ML present new possibilities for training and prediction speed and therefore make their usage in real-time systems feasible. This study compares four ML algorithms - random forests (RF), neural networks (NNET), averaged neural networks (AVNNET) and support vector machines (SVM) - for rainfall area detection and rainfall rate assignment using MSG SEVIRI data over Germany. Satellite-based proxies for cloud top height, cloud top temperature, cloud phase and cloud water path serve as predictor variables. The results indicate an overestimation of rainfall area delineation regardless of the ML algorithm (averaged bias = 1.8) but a high probability of detection ranging from 81% (SVM) to 85% (NNET). On a 24-hour basis, the performance of the rainfall rate assignment yielded R2 values between 0.39 (SVM) and 0.44 (AVNNET). Though the differences in the algorithms' performance were rather small, NNET and AVNNET were identified as the most suitable algorithms. On average, they demonstrated the best performance in rainfall area delineation as well as in rainfall rate assignment. NNET's computational speed is an additional advantage in work with large datasets such as in remote sensing based rainfall retrievals. However, since no single algorithm performed considerably better than the others we conclude that further research in providing suitable predictors for rainfall is of greater necessity than an optimization through the choice of the ML algorithm.

PLA realizations for VLSI state machines

NASA Technical Reports Server (NTRS)

Gopalakrishnan, S.; Whitaker, S.; Maki, G.; Liu, K.

1990-01-01

A major problem associated with state assignment procedures for VLSI controllers is obtaining an assignment that produces minimal or near minimal logic. The key item in Programmable Logic Array (PLA) area minimization is the number of unique product terms required by the design equations. This paper presents a state assignment algorithm for minimizing the number of product terms required to implement a finite state machine using a PLA. Partition algebra with predecessor state information is used to derive a near optimal state assignment. A maximum bound on the number of product terms required can be obtained by inspecting the predecessor state information. The state assignment algorithm presented is much simpler than existing procedures and leads to the same number of product terms or less. An area-efficient PLA structure implemented in a 1.0 micron CMOS process is presented along with a summary of the performance for a controller implemented using this design procedure.

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

PubMed Central

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

2015-01-01

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

Single-machine common/slack due window assignment problems with linear decreasing processing times

NASA Astrophysics Data System (ADS)

Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia

2017-08-01

This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.

Willow System Demonstration

DTIC Science & Technology

2003-01-01

possibility of terrorists attempting to breach airport security . If a few terrorists attempt to smuggle weapons at any single airport, most will be...introduction of law- enforcement officials, and so on. For airport security , secu- rity staff would indicate when a banned object was found using a touch...necessary responses could be communicated to the airport security staff. In the Willow architecture, the various components and all of the algorithms

The West Midlands breast cancer screening status algorithm - methodology and use as an audit tool.

PubMed

Lawrence, Gill; Kearins, Olive; O'Sullivan, Emma; Tappenden, Nancy; Wallis, Matthew; Walton, Jackie

2005-01-01

To illustrate the ability of the West Midlands breast screening status algorithm to assign a screening status to women with malignant breast cancer, and its uses as a quality assurance and audit tool. Breast cancers diagnosed between the introduction of the National Health Service [NHS] Breast Screening Programme and 31 March 2001 were obtained from the West Midlands Cancer Intelligence Unit (WMCIU). Screen-detected tumours were identified via breast screening units, and the remaining cancers were assigned to one of eight screening status categories. Multiple primaries and recurrences were excluded. A screening status was assigned to 14,680 women (96% of the cohort examined), 110 cancers were not registered at the WMCIU and the cohort included 120 screen-detected recurrences. The West Midlands breast screening status algorithm is a robust simple tool which can be used to derive data to evaluate the efficacy and impact of the NHS Breast Screening Programme.

DNABIT Compress – Genome compression algorithm

PubMed Central

Rajarajeswari, Pothuraju; Apparao, Allam

2011-01-01

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, “DNABIT Compress” for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that “DNABIT Compress” algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases. PMID:21383923

Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

NASA Astrophysics Data System (ADS)

Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun

2017-07-01

Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

Neutron Capture Measurements on 97Mo with the DANCE Array

NASA Astrophysics Data System (ADS)

Walker, Carrie L.

Neutron capture is a process that is crucial to understanding nucleosynthesis, reactors, and nuclear weapons. Precise knowledge of neutron capture cross-sections and level densities is necessary in order to model these high-flux environments. High-confidence spin and parity assignments for neutron resonances are of critical importance to this end. For nuclei in the A=100 mass region, the p-wave neutron strength function is at a maximum, and the s-wave strength function is at a minimum, producing up to six possible Jpi combinations. Parity determination becomes important to assigning spins in this mass region, and the large number of spin groups adds complexity to the problem. In this work, spins and parities for 97Mo resonances are assigned, and best fit models for photon strength function and level density are determined. The neutron capture-cross section for 97Mo is also determined, as are resonance parameters for neutron energies ranging from 16 eV to 2 keV.

Design Notebook for Naval Air Defense Simulation (NADS). Revision.

DTIC Science & Technology

1986-10-09

OK 304 On Cap 105 Self Assign NoGo *305 TDS Down 106 On Self Control 306 Controller Status Change 107 Red Fighter 307 Reject Control 108 Intercept...range for RED aircraft INTEGER*2 COMTDS, I message delay time between TDS F-19 units COMVCE, I message delay if either unit is F-19 * non- TDS TWAITC...reschedule A/C launch LOGICAL*I NUCREL, I nuclear weapons release for force AUTOESM, I ESM bearing ( jamming strobes) automatically updated in TDS

Centralized Control and Decentralized Execution: A Catchphrase in Crisis?

DTIC Science & Technology

2009-03-01

assignment of control of forces at any level other than that which is able to exploit fully their weapons is contrary to accepted military doctrine. The...between ground and air com- manders. “The CFACC is not supporting me!” complained some ground commanders, while Airmen retorted , “The CFACC cannot...of war had a strategic im- 3 pact. If the losses suffered early in the operation had continued much longer, or if the Taliban had been able to

Taking Off the Wedding Ring: The Consequences of the Netherlands’ Choice to Forgo a Nuclear Capable F-35

DTIC Science & Technology

2015-02-17

F-16. After his commission, flying assignments included duties as Weapons Instructor Pilot, Flight Commander and Operations Officer at Volkel AB ...the Netherlands. He also served a tour at the Tactical Leadership Program (TLP) at Florennes AB , Belgium as a Seminar Leader. He is a command pilot...the glue that keeps NATO together.40 The deepening crisis between Russia, NATO, EU and the United States over Ukraine that has emerged over the last

Virtual Employment Test Bed Operational Research and Systems Analysis to Test Armaments Designs Early in the Life Cycle

DTIC Science & Technology

2014-06-01

motion capture data used to determine position and orientation of a Soldier’s head, turret and the M2 machine gun • Controlling and acquiring user/weapon...data from the M2 simulation machine gun • Controlling paintball guns used to fire at the GPK during an experimental run • Sending and receiving TCP...Mounted, Armor/Cavalry, Combat Engineers, Field Artillery Cannon Crewmember, or MP duty assignment – Currently M2 .50 Caliber Machine Gun qualified

U. S. Naval Forces, Vietnam Monthly Historical Supplement for November 1967

DTIC Science & Technology

1968-03-23

Institute USA Special Warfare School (Attn: USN/MC Liaison Off.), Ft. Bragg, N. C. USMC Kap., U. S. krmy Infantry School, Ft. Banning, Ga . DIA...miles southeast of Can Tho, are attacked by heavy Viet Cong recoillesa-rifle, automatic-weapons and smll-arms fire. PBR 28 is hit by a recoilless...operations. On the 13th the WPB assigned to area IG, ap- proxloately 15 miles southeast of Danang, provided a blocking pa- trol for Operation BADGER

Algorithms for selecting informative marker panels for population assignment.

PubMed

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.

Foliage penetration by using 4-D point cloud data

NASA Astrophysics Data System (ADS)

Méndez Rodríguez, Javier; Sánchez-Reyes, Pedro J.; Cruz-Rivera, Sol M.

2012-06-01

Real-time awareness and rapid target detection are critical for the success of military missions. New technologies capable of detecting targets concealed in forest areas are needed in order to track and identify possible threats. Currently, LAser Detection And Ranging (LADAR) systems are capable of detecting obscured targets; however, tracking capabilities are severely limited. Now, a new LADAR-derived technology is under development to generate 4-D datasets (3-D video in a point cloud format). As such, there is a new need for algorithms that are able to process data in real time. We propose an algorithm capable of removing vegetation and other objects that may obfuscate concealed targets in a real 3-D environment. The algorithm is based on wavelets and can be used as a pre-processing step in a target recognition algorithm. Applications of the algorithm in a real-time 3-D system could help make pilots aware of high risk hidden targets such as tanks and weapons, among others. We will be using a 4-D simulated point cloud data to demonstrate the capabilities of our algorithm.

An efficient randomized algorithm for contact-based NMR backbone resonance assignment.

PubMed

Kamisetty, Hetunandan; Bailey-Kellogg, Chris; Pandurangan, Gopal

2006-01-15

Backbone resonance assignment is a critical bottleneck in studies of protein structure, dynamics and interactions by nuclear magnetic resonance (NMR) spectroscopy. A minimalist approach to assignment, which we call 'contact-based', seeks to dramatically reduce experimental time and expense by replacing the standard suite of through-bond experiments with the through-space (nuclear Overhauser enhancement spectroscopy, NOESY) experiment. In the contact-based approach, spectral data are represented in a graph with vertices for putative residues (of unknown relation to the primary sequence) and edges for hypothesized NOESY interactions, such that observed spectral peaks could be explained if the residues were 'close enough'. Due to experimental ambiguity, several incorrect edges can be hypothesized for each spectral peak. An assignment is derived by identifying consistent patterns of edges (e.g. for alpha-helices and beta-sheets) within a graph and by mapping the vertices to the primary sequence. The key algorithmic challenge is to be able to uncover these patterns even when they are obscured by significant noise. This paper develops, analyzes and applies a novel algorithm for the identification of polytopes representing consistent patterns of edges in a corrupted NOESY graph. Our randomized algorithm aggregates simplices into polytopes and fixes inconsistencies with simple local modifications, called rotations, that maintain most of the structure already uncovered. In characterizing the effects of experimental noise, we employ an NMR-specific random graph model in proving that our algorithm gives optimal performance in expected polynomial time, even when the input graph is significantly corrupted. We confirm this analysis in simulation studies with graphs corrupted by up to 500% noise. Finally, we demonstrate the practical application of the algorithm on several experimental beta-sheet datasets. Our approach is able to eliminate a large majority of noise edges and to uncover large consistent sets of interactions. Our algorithm has been implemented in the platform-independent Python code. The software can be freely obtained for academic use by request from the authors.

Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms.

PubMed

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

2015-10-19

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

Normalized Cut Algorithm for Automated Assignment of Protein Domains

NASA Technical Reports Server (NTRS)

Samanta, M. P.; Liang, S.; Zha, H.; Biegel, Bryan A. (Technical Monitor)

2002-01-01

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Algorithmic Case Pedagogy, Learning and Gender

ERIC Educational Resources Information Center

Bromley, Robert; Huang, Zhenyu

2015-01-01

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

On marker-based parentage verification via non-linear optimization.

PubMed

Boerner, Vinzent

2017-06-15

Parentage verification by molecular markers is mainly based on short tandem repeat markers. Single nucleotide polymorphisms (SNPs) as bi-allelic markers have become the markers of choice for genotyping projects. Thus, the subsequent step is to use SNP genotypes for parentage verification as well. Recent developments of algorithms such as evaluating opposing homozygous SNP genotypes have drawbacks, for example the inability of rejecting all animals of a sample of potential parents. This paper describes an algorithm for parentage verification by constrained regression which overcomes the latter limitation and proves to be very fast and accurate even when the number of SNPs is as low as 50. The algorithm was tested on a sample of 14,816 animals with 50, 100 and 500 SNP genotypes randomly selected from 40k genotypes. The samples of putative parents of these animals contained either five random animals, or four random animals and the true sire. Parentage assignment was performed by ranking of regression coefficients, or by setting a minimum threshold for regression coefficients. The assignment quality was evaluated by the power of assignment (P[Formula: see text]) and the power of exclusion (P[Formula: see text]). If the sample of putative parents contained the true sire and parentage was assigned by coefficient ranking, P[Formula: see text] and P[Formula: see text] were both higher than 0.99 for the 500 and 100 SNP genotypes, and higher than 0.98 for the 50 SNP genotypes. When parentage was assigned by a coefficient threshold, P[Formula: see text] was higher than 0.99 regardless of the number of SNPs, but P[Formula: see text] decreased from 0.99 (500 SNPs) to 0.97 (100 SNPs) and 0.92 (50 SNPs). If the sample of putative parents did not contain the true sire and parentage was rejected using a coefficient threshold, the algorithm achieved a P[Formula: see text] of 1 (500 SNPs), 0.99 (100 SNPs) and 0.97 (50 SNPs). The algorithm described here is easy to implement, fast and accurate, and is able to assign parentage using genomic marker data with a size as low as 50 SNPs.

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

PubMed

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.

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

PubMed

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

2017-08-04

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

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

PubMed Central

Choi, Sangil; Park, Jong Hyuk

2016-01-01

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

UAVs Task and Motion Planning in the Presence of Obstacles and Prioritized Targets

PubMed Central

Gottlieb, Yoav; Shima, Tal

2015-01-01

The intertwined task assignment and motion planning problem of assigning a team of fixed-winged unmanned aerial vehicles to a set of prioritized targets in an environment with obstacles is addressed. It is assumed that the targets’ locations and initial priorities are determined using a network of unattended ground sensors used to detect potential threats at restricted zones. The targets are characterized by a time-varying level of importance, and timing constraints must be fulfilled before a vehicle is allowed to visit a specific target. It is assumed that the vehicles are carrying body-fixed sensors and, thus, are required to approach a designated target while flying straight and level. The fixed-winged aerial vehicles are modeled as Dubins vehicles, i.e., having a constant speed and a minimum turning radius constraint. The investigated integrated problem of task assignment and motion planning is posed in the form of a decision tree, and two search algorithms are proposed: an exhaustive algorithm that improves over run time and provides the minimum cost solution, encoded in the tree, and a greedy algorithm that provides a quick feasible solution. To satisfy the target’s visitation timing constraint, a path elongation motion planning algorithm amidst obstacles is provided. Using simulations, the performance of the algorithms is compared, evaluated and exemplified. PMID:26610522

Absolute Points for Multiple Assignment Problems

ERIC Educational Resources Information Center

Adlakha, V.; Kowalski, K.

2006-01-01

An algorithm is presented to solve multiple assignment problems in which a cost is incurred only when an assignment is made at a given cell. The proposed method recursively searches for single/group absolute points to identify cells that must be loaded in any optimal solution. Unlike other methods, the first solution is the optimal solution. The…

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

NASA Astrophysics Data System (ADS)

Mandrà, Salvatore; Giacomo Guerreschi, Gian; Aspuru-Guzik, Alán

2016-07-01

We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the Exact Satisfiability; while the second part performs a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by O(\\sqrt{{2}n-{M\\prime }}) and O({2}n-{M\\prime }), where n is the number of variables and {M}\\prime the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of Exact Satisfiability. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable Occupation problem. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by O({2}n/4) for 3-regular undirected graphs, where n is the number of nodes. The same worst-case complexity holds for (3,3)-regular bipartite graphs. As a reference, the current best classical algorithm has a (worst-case) running time bounded by O({2}31n/96). Finally, when compared to heuristic techniques for Exact Satisfiability problems, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be straightforwardly extended to the generalized version of the Exact Satisfiability known as Occupation problem. The general version of the algorithm is presented and analyzed.

Soldier detection using unattended acoustic and seismic sensors

NASA Astrophysics Data System (ADS)

Naz, P.; Hengy, S.; Hamery, P.

2012-06-01

During recent military conflicts, as well as for security interventions, the urban zone has taken a preponderant place. Studies have been initiated in national and in international programs to stimulate the technical innovations for these specific scenarios. For example joint field experiments have been organized by the NATO group SET-142 to evaluate the capability for the detection and localization of snipers, mortars or artillery guns using acoustic devices. Another important operational need corresponds to the protection of military sites or buildings. In this context, unattended acoustic and seismic sensors are envisaged to contribute to the survey of specific points by the detection of approaching enemy soldiers. This paper describes some measurements done in an anechoic chamber and in free field to characterize typical sounds generated by the soldier activities (walking, crawling, weapon handling, radio communication, clothing noises...). Footstep, speech and some specific impulsive sounds are detectable at various distances from the source. Such detection algorithms may be easily merged with the existing weapon firing detection algorithms to provide a more generic "battlefield acoustic" early warning system. Results obtained in various conditions (grassy terrain, gravel path, road, forest) will be presented. A method to extrapolate the distances of detection has been developed, based on an acoustic propagation model and applied to the laboratory measurements.

Comparison of neural network applications for channel assignment in cellular TDMA networks and dynamically sectored PCS networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

1997-04-01

The use of artificial neural networks (NNs) to address the channel assignment problem (CAP) for cellular time-division multiple access and code-division multiple access networks has previously been investigated by this author and many others. The investigations to date have been based on a hexagonal cell structure established by omnidirectional antennas at the base stations. No account was taken of the use of spatial isolation enabled by directional antennas to reduce interference between mobiles. Any reduction in interference translates into increased capacity and consequently alters the performance of the NNs. Previous studies have sought to improve the performance of Hopfield- Tank network algorithms and self-organizing feature map algorithms applied primarily to static channel assignment (SCA) for cellular networks that handle uniformly distributed, stationary traffic in each cell for a single type of service. The resulting algorithms minimize energy functions representing interference constraint and ad hoc conditions that promote convergence to optimal solutions. While the structures of the derived neural network algorithms (NNAs) offer the potential advantages of inherent parallelism and adaptability to changing system conditions, this potential has yet to be fulfilled the CAP for emerging mobile networks. The next-generation communication infrastructures must accommodate dynamic operating conditions. Macrocell topologies are being refined to microcells and picocells that can be dynamically sectored by adaptively controlled, directional antennas and programmable transceivers. These networks must support the time-varying demands for personal communication services (PCS) that simultaneously carry voice, data and video and, thus, require new dynamic channel assignment (DCA) algorithms. This paper examines the impact of dynamic cell sectoring and geometric conditioning on NNAs developed for SCA in omnicell networks with stationary traffic to improve the metrics of convergence rate and call blocking. Genetic algorithms (GAs) are also considered in PCS networks as a means to overcome the known weakness of Hopfield NNAs in determining global minima. The resulting GAs for DCA in PCS networks are compared to improved DCA algorithms based on Hopfield NNs for stationary cellular networks. Algorithm performance is compared on the basis of rate of convergence, blocking probability, analytic complexity, and parametric sensitivity to transient traffic demands and channel interference.

Stress-induced cortisol secretion impairs detection performance in x-ray baggage screening for hidden weapons by screening novices.

PubMed

Thomas, Livia; Schwaninger, Adrian; Heimgartner, Nadja; Hedinger, Patrik; Hofer, Franziska; Ehlert, Ulrike; Wirtz, Petra H

2014-09-01

Aviation security strongly depends on screeners' performance in the detection of threat objects in x-ray images of passenger bags. We examined for the first time the effects of stress and stress-induced cortisol increases on detection performance of hidden weapons in an x-ray baggage screening task. We randomly assigned 48 participants either to a stress or a nonstress group. The stress group was exposed to a standardized psychosocial stress test (TSST). Before and after stress/nonstress, participants had to detect threat objects in a computer-based object recognition test (X-ray ORT). We repeatedly measured salivary cortisol and X-ray ORT performance before and after stress/nonstress. Cortisol increases in reaction to psychosocial stress induction but not to nonstress independently impaired x-ray detection performance. Our results suggest that stress-induced cortisol increases at peak reactivity impair x-ray screening performance. Copyright © 2014 Society for Psychophysiological Research.

Strategic Control Algorithm Development : Volume 1. Summary.

DOT National Transportation Integrated Search

1974-08-01

Strategic control is an air traffic management concept wherein a central control authority determines, and assigns to each participating airplane, a conflict-free, four-dimensional route-time profile. The route-time profile assignments are long term ...

West European and East Asian perspectives on defense, deterrence, and strategy. Volume 2. Western European perspectives on defense, deterrence, and strategy. Technical report, 1 December 1982-15 May 1984

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

Pfaltzgraff, R.L.; Davis, J.K.; Dougherty, J.E.

1984-05-16

A survey of contemporary West European perspectives on defense, deterrence, and strategy, with special emphasis on the role of nuclear weapons deployed in, or assigned to, the NATO area. Changes have occurred during the past decade in the relative military strength of NATO and the Warsaw Pact, particularly as a result of the substantial growth in Soviet nuclear-capable systems and conventional forces assigned to Europe, and the momentum manifested by the Soviet Union in its deployments of intercontinental ballistic missiles. There has also been a substantial shift in West European thinking and attitudes about security and strategy. Together, these trendsmore » have created a need to reassess the posture of NATO forces generally, and especially nuclear weapons, both in a broader Euro-strategic framework and on the Central Front in the 1980s. The survey is on such issues as the future of the British and French national strategic nuclear forces; the role of the U.S.-strategic nuclear forces in the deterrence of conflict in Europe; the prospects of raising the nuclear threshold by the deployment of new conventional technologies; the impact of strategic defense initiatives on U.S.-NATO security; and the modernization of NATO intermediate-range nuclear capabilities, especially in light of the continuing deployment of the Soviet Union of new generation Euro-strategic forces targeted against Western Europe.« less

Rule-based support system for multiple UMLS semantic type assignments

PubMed Central

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

2012-01-01

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

Developing an eco-routing application.

DOT National Transportation Integrated Search

2014-01-01

The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...

A Depth Map Generation Algorithm Based on Saliency Detection for 2D to 3D Conversion

NASA Astrophysics Data System (ADS)

Yang, Yizhong; Hu, Xionglou; Wu, Nengju; Wang, Pengfei; Xu, Dong; Rong, Shen

2017-09-01

In recent years, 3D movies attract people's attention more and more because of their immersive stereoscopic experience. However, 3D movies is still insufficient, so estimating depth information for 2D to 3D conversion from a video is more and more important. In this paper, we present a novel algorithm to estimate depth information from a video via scene classification algorithm. In order to obtain perceptually reliable depth information for viewers, the algorithm classifies them into three categories: landscape type, close-up type, linear perspective type firstly. Then we employ a specific algorithm to divide the landscape type image into many blocks, and assign depth value by similar relative height cue with the image. As to the close-up type image, a saliency-based method is adopted to enhance the foreground in the image and the method combine it with the global depth gradient to generate final depth map. By vanishing line detection, the calculated vanishing point which is regarded as the farthest point to the viewer is assigned with deepest depth value. According to the distance between the other points and the vanishing point, the entire image is assigned with corresponding depth value. Finally, depth image-based rendering is employed to generate stereoscopic virtual views after bilateral filter. Experiments show that the proposed algorithm can achieve realistic 3D effects and yield satisfactory results, while the perception scores of anaglyph images lie between 6.8 and 7.8.

Crystal Identification in Dual-Layer-Offset DOI-PET Detectors Using Stratified Peak Tracking Based on SVD and Mean-Shift Algorithm

NASA Astrophysics Data System (ADS)

Wei, Qingyang; Dai, Tiantian; Ma, Tianyu; Liu, Yaqiang; Gu, Yu

2016-10-01

An Anger-logic based pixelated PET detector block requires a crystal position map (CPM) to assign the position of each detected event to a most probable crystal index. Accurate assignments are crucial to PET imaging performance. In this paper, we present a novel automatic approach to generate the CPMs for dual-layer offset (DLO) PET detectors using a stratified peak tracking method. In which, the top and bottom layers are distinguished by their intensity difference and the peaks of the top and bottom layers are tracked based on a singular value decomposition (SVD) and mean-shift algorithm in succession. The CPM is created by classifying each pixel to its nearest peak and assigning the pixel with the crystal index of that peak. A Matlab-based graphical user interface program was developed including the automatic algorithm and a manual interaction procedure. The algorithm was tested for three DLO PET detector blocks. Results show that the proposed method exhibits good performance as well as robustness for all the three blocks. Compared to the existing methods, our approach can directly distinguish the layer and crystal indices using the information of intensity and offset grid pattern.

Quality, Quantity, And Surprise! Trade-Offs In X-Raser ASAT Attrition

NASA Astrophysics Data System (ADS)

Callaham, Michael B.; Scibilia, Frank M.

1984-08-01

In order to characterize the effects of technological superiority, numerical superiority, and pre-emption on space battle outcomes, we have constructed a battle simulation in which "Red" and "Blue" ASATs, each armed with a specified number of x-ray lasers of specified range, move along specified orbits and fire on one another according to a pair of battle management algorithms. The simulated battle proceeds until apparent steady-state force levels are reached. Battle outcomes are characterized by terminal force ratio and by terminal force-exchange ratio as effective weapon range, multiplicity (x-rasers per ASAT), and pre-emptive role are varied parametrically. A major conclusion is that pre-emptive advantage increases with increasing x-raser range and multiplicity (x-rasers per ASAT) and with increasing force size. That is, the "use 'em or lose 'em" dilemma will become more stark as such weapons are refined and proliferated.

Nuclear and Non-Nuclear Airblast Effects.

DTIC Science & Technology

1984-02-14

algorithms. 2 The above methodologr has been applied to a series of test prorlems initiated by a spherical high- explosive (HE) detonation In air . An...used, together with a real- air equation of state, to follow the development of an explosion initialized with the 1-kton standard as it reflects from the...interior. Stage (1) is not contained in our model; since the weapon mass greatly exceeds the ,mass of air contained within the initial explosion radius

The Impact of Emotional Arousal on Learning in Virtual Environments

DTIC Science & Technology

2002-09-01

intelligence (AI) algorithms, weapon fire/hit/miss rate, health of the players , etc.) within the actual code of the game/VE. No other game offered...experiment was conducted to observe learning differences in a low-arousal condition and a high-arousal condition. A first-person shooter videogame ...and a high-arousal condition. A first-person shooter videogame (America’s Army: Operations) was used as the virtual environment. In the low

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

NASA Astrophysics Data System (ADS)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength conversion under the same RWA algorithm.

Nonproliferation Graduate Fellowship Program Annual Report: Class of 2011

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

McMakin, Andrea H.

2012-08-20

Annual report for the Nonproliferation Graduate Fellowship Program (NGFP), which PNNL administers for the National Nuclear Security Administration (NNSA). Features the Class of 2011. The NGFP is a NNSA program with a mission to cultivate future technical and policy leaders in nonproliferation and international security. Through the NGFP, outstanding graduate students with career interests in nonproliferation are appointed to program offices within the Office of Defense Nuclear Nonproliferation (DNN). During their one-year assignment, Fellows participate in programs designed to detect, prevent, and reverse the proliferation of nuclear weapons.

Research on air and missile defense task allocation based on extended contract net protocol

NASA Astrophysics Data System (ADS)

Zhang, Yunzhi; Wang, Gang

2017-10-01

Based on the background of air and missile defense distributed element corporative engagement, the interception task allocation problem of multiple weapon units with multiple targets under network condition is analyzed. Firstly, a mathematical model of task allocation is established by combat task decomposition. Secondly, the initialization assignment based on auction contract and the adjustment allocation scheme based on swap contract were introduced to the task allocation. Finally, through the simulation calculation of typical situation, the model can be used to solve the task allocation problem in complex combat environment.

Acoustic Resonance Spectroscopy (ARS) Munition Classification System enhancements. Final report

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

Vela, O.A.; Huggard, J.C.

Acoustic Resonance Spectroscopy (ARS) is a non-destructive evaluation technology developed at the Los Alamos National Laboratory (LANL). This technology has resulted in three generations of instrumentation, funded by the Defense Special Weapons Agency (DSWA), specifically designed for field identification of chemical weapon (CW) munitions. Each generation of ARS instrumentation was developed with a specific user in mind. The ARS1OO was built for use by the U.N. Inspection Teams going into Iraq immediately after the Persian Gulf War. The ARS200 was built for use in the US-Russia Bilateral Chemical Weapons Treaty (the primary users for this system are the US Onsitemore » Inspection Agency (OSIA) and their Russian counterparts). The ARS300 was built with the requirements of the Organization for the Prohibition of Chemical Weapons (OPCW) in mind. Each successive system is an improved version of the previous system based on learning the weaknesses of each and, coincidentally, on the fact that more time was available to do a requirements analysis and the necessary engineering development. The ARS300 is at a level of development that warrants transferring the technology to a commercial vendor. Since LANL will supply the computer software to the selected vendor, it is possible for LANL to continue to improve the decision algorithms, add features where necessary, and adjust the user interface before the final transfer occurs. This paper describes the current system, ARS system enhancements, and software enhancements. Appendices contain the Operations Manual (software Version 3.01), and two earlier reports on enhancements.« less

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

PubMed Central

Zhang, Xuejun; Lei, Jiaxing

2015-01-01

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

Administrative Data Algorithms Can Describe Ambulatory Physician Utilization

PubMed Central

Shah, Baiju R; Hux, Janet E; Laupacis, Andreas; Zinman, Bernard; Cauch-Dudek, Karen; Booth, Gillian L

2007-01-01

Objective To validate algorithms using administrative data that characterize ambulatory physician care for patients with a chronic disease. Data Sources Seven-hundred and eighty-one people with diabetes were recruited mostly from community pharmacies to complete a written questionnaire about their physician utilization in 2002. These data were linked with administrative databases detailing health service utilization. Study Design An administrative data algorithm was defined that identified whether or not patients received specialist care, and it was tested for agreement with self-report. Other algorithms, which assigned each patient to a primary care and specialist physician, were tested for concordance with self-reported regular providers of care. Principal Findings The algorithm to identify whether participants received specialist care had 80.4 percent agreement with questionnaire responses (κ = 0.59). Compared with self-report, administrative data had a sensitivity of 68.9 percent and specificity 88.3 percent for identifying specialist care. The best administrative data algorithm to assign each participant's regular primary care and specialist providers was concordant with self-report in 82.6 and 78.2 percent of cases, respectively. Conclusions Administrative data algorithms can accurately match self-reported ambulatory physician utilization. PMID:17610448

Two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images.

PubMed

He, Lifeng; Chao, Yuyan; Suzuki, Kenji

2011-08-01

Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.

Detecting non-orthology in the COGs database and other approaches grouping orthologs using genome-specific best hits.

PubMed

Dessimoz, Christophe; Boeckmann, Brigitte; Roth, Alexander C J; Gonnet, Gaston H

2006-01-01

Correct orthology assignment is a critical prerequisite of numerous comparative genomics procedures, such as function prediction, construction of phylogenetic species trees and genome rearrangement analysis. We present an algorithm for the detection of non-orthologs that arise by mistake in current orthology classification methods based on genome-specific best hits, such as the COGs database. The algorithm works with pairwise distance estimates, rather than computationally expensive and error-prone tree-building methods. The accuracy of the algorithm is evaluated through verification of the distribution of predicted cases, case-by-case phylogenetic analysis and comparisons with predictions from other projects using independent methods. Our results show that a very significant fraction of the COG groups include non-orthologs: using conservative parameters, the algorithm detects non-orthology in a third of all COG groups. Consequently, sequence analysis sensitive to correct orthology assignments will greatly benefit from these findings.

Energy-Efficient Routing and Spectrum Assignment Algorithm with Physical-Layer Impairments Constraint in Flexible Optical Networks

NASA Astrophysics Data System (ADS)

Zhao, Jijun; Zhang, Nawa; Ren, Danping; Hu, Jinhua

2017-12-01

The recently proposed flexible optical network can provide more efficient accommodation of multiple data rates than the current wavelength-routed optical networks. Meanwhile, the energy efficiency has also been a hot topic because of the serious energy consumption problem. In this paper, the energy efficiency problem of flexible optical networks with physical-layer impairments constraint is studied. We propose a combined impairment-aware and energy-efficient routing and spectrum assignment (RSA) algorithm based on the link availability, in which the impact of power consumption minimization on signal quality is considered. By applying the proposed algorithm, the connection requests are established on a subset of network topology, reducing the number of transitions from sleep to active state. The simulation results demonstrate that our proposed algorithm can improve the energy efficiency and spectrum resources utilization with the acceptable blocking probability and average delay.

Relabeling exchange method (REM) for learning in neural networks

NASA Astrophysics Data System (ADS)

Wu, Wen; Mammone, Richard J.

1994-02-01

The supervised training of neural networks require the use of output labels which are usually arbitrarily assigned. In this paper it is shown that there is a significant difference in the rms error of learning when `optimal' label assignment schemes are used. We have investigated two efficient random search algorithms to solve the relabeling problem: the simulated annealing and the genetic algorithm. However, we found them to be computationally expensive. Therefore we shall introduce a new heuristic algorithm called the Relabeling Exchange Method (REM) which is computationally more attractive and produces optimal performance. REM has been used to organize the optimal structure for multi-layered perceptrons and neural tree networks. The method is a general one and can be implemented as a modification to standard training algorithms. The motivation of the new relabeling strategy is based on the present interpretation of dyslexia as an encoding problem.

Array distribution in data-parallel programs

NASA Technical Reports Server (NTRS)

Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert; Sheffler, Thomas J.

1994-01-01

We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.

Determination of stores pointing error due to wing flexibility under flight load

NASA Technical Reports Server (NTRS)

Lokos, William A.; Bahm, Catherine M.; Heinle, Robert A.

1995-01-01

The in-flight elastic wing twist of a fighter-type aircraft was studied to provide for an improved on-board real-time computed prediction of pointing variations of three wing store stations. This is an important capability to correct sensor pod alignment variation or to establish initial conditions of iron bombs or smart weapons prior to release. The original algorithm was based upon coarse measurements. The electro-optical Flight Deflection Measurement System measured the deformed wing shape in flight under maneuver loads to provide a higher resolution database from which an improved twist prediction algorithm could be developed. The FDMS produced excellent repeatable data. In addition, a NASTRAN finite-element analysis was performed to provide additional elastic deformation data. The FDMS data combined with the NASTRAN analysis indicated that an improved prediction algorithm could be derived by using a different set of aircraft parameters, namely normal acceleration, stores configuration, Mach number, and gross weight.

IMM tracking of a theater ballistic missile during boost phase

NASA Astrophysics Data System (ADS)

Hutchins, Robert G.; San Jose, Anthony

1998-09-01

Since the SCUD launches in the Gulf War, theater ballistic missile (TBM) systems have become a growing concern for the US military. Detection, tracking and engagement during boost phase or shortly after booster cutoff are goals that grow in importance with the proliferation of weapons of mass destruction. This paper addresses the performance of tracking algorithms for TBMs during boost phase and across the transition to ballistic flight. Three families of tracking algorithms are examined: alpha-beta-gamma trackers, Kalman-based trackers, and the interactive multiple model (IMM) tracker. In addition, a variation on the IMM to include prior knowledge of a booster cutoff parameter is examined. Simulated data is used to compare algorithms. Also, the IMM tracker is run on an actual ballistic missile trajectory. Results indicate that IMM trackers show significant advantage in tracking through the model transition represented by booster cutoff.

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

PubMed

Tolić, Nikola; Liu, Yina; Liyu, Andrey; Shen, Yufeng; Tfaily, Malak M; Kujawinski, Elizabeth B; Longnecker, Krista; Kuo, Li-Jung; Robinson, Errol W; Paša-Tolić, Ljiljana; Hess, Nancy J

2017-12-05

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

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

NASA Astrophysics Data System (ADS)

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.

Predictive Cache Modeling and Analysis

DTIC Science & Technology

2011-11-01

metaheuristic /bin-packing algorithm to optimize task placement based on task communication characterization. Our previous work on task allocation showed...Cache Miss Minimization Technology To efficiently explore combinations and discover nearly-optimal task-assignment algorithms , we extended to our...it was possible to use our algorithmic techniques to decrease network bandwidth consumption by ~25%. In this effort, we adapted these existing

Guidance and control of swarms of spacecraft

NASA Astrophysics Data System (ADS)

Morgan, Daniel James

There has been considerable interest in formation flying spacecraft due to their potential to perform certain tasks at a cheaper cost than monolithic spacecraft. Formation flying enables the use of smaller, cheaper spacecraft that distribute the risk of the mission. Recently, the ideas of formation flying have been extended to spacecraft swarms made up of hundreds to thousands of 100-gram-class spacecraft known as femtosatellites. The large number of spacecraft and limited capabilities of each individual spacecraft present a significant challenge in guidance, navigation, and control. This dissertation deals with the guidance and control algorithms required to enable the flight of spacecraft swarms. The algorithms developed in this dissertation are focused on achieving two main goals: swarm keeping and swarm reconfiguration. The objectives of swarm keeping are to maintain bounded relative distances between spacecraft, prevent collisions between spacecraft, and minimize the propellant used by each spacecraft. Swarm reconfiguration requires the transfer of the swarm to a specific shape. Like with swarm keeping, minimizing the propellant used and preventing collisions are the main objectives. Additionally, the algorithms required for swarm keeping and swarm reconfiguration should be decentralized with respect to communication and computation so that they can be implemented on femtosats, which have limited hardware capabilities. The algorithms developed in this dissertation are concerned with swarms located in low Earth orbit. In these orbits, Earth oblateness and atmospheric drag have a significant effect on the relative motion of the swarm. The complicated dynamic environment of low Earth orbits further complicates the swarm-keeping and swarm-reconfiguration problems. To better develop and test these algorithms, a nonlinear, relative dynamic model with J2 and drag perturbations is developed. This model is used throughout this dissertation to validate the algorithms using computer simulations. The swarm-keeping problem can be solved by placing the spacecraft on J2-invariant relative orbits, which prevent collisions and minimize the drift of the swarm over hundreds of orbits using a single burn. These orbits are achieved by energy matching the spacecraft to the reference orbit. Additionally, these conditions can be repeatedly applied to minimize the drift of the swarm when atmospheric drag has a large effect (orbits with an altitude under 500 km). The swarm reconfiguration is achieved using two steps: trajectory optimization and assignment. The trajectory optimization problem can be written as a nonlinear, optimal control problem. This optimal control problem is discretized, decoupled, and convexified so that the individual femtosats can efficiently solve the optimization. Sequential convex programming is used to generate the control sequences and trajectories required to safely and efficiently transfer a spacecraft from one position to another. The sequence of trajectories is shown to converge to a Karush-Kuhn-Tucker point of the nonconvex problem. In the case where many of the spacecraft are interchangeable, a variable-swarm, distributed auction algorithm is used to determine the assignment of spacecraft to target positions. This auction algorithm requires only local communication and all of the bidding parameters are stored locally. The assignment generated using this auction algorithm is shown to be near optimal and to converge in a finite number of bids. Additionally, the bidding process is used to modify the number of targets used in the assignment so that the reconfiguration can be achieved even when there is a disconnected communication network or a significant loss of agents. Once the assignment is achieved, the trajectory optimization can be run using the terminal positions determined by the auction algorithm. To implement these algorithms in real time a model predictive control formulation is used. Model predictive control uses a finite horizon to apply the most up-to-date control sequence while simultaneously calculating a new assignment and trajectory based on updated state information. Using a finite horizon allows collisions to only be considered between spacecraft that are near each other at the current time. This relaxes the all-to-all communication assumption so that only neighboring agents need to communicate. Experimental validation is done using the formation flying testbed. The swarm-reconfiguration algorithms are tested using multiple quadrotors. Experiments have been performed using sequential convex programming for offline trajectory planning, model predictive control and sequential convex programming for real-time trajectory generation, and the variable-swarm, distributed auction algorithm for optimal assignment. These experiments show that the swarm-reconfiguration algorithms can be implemented in real time using actual hardware. In general, this dissertation presents guidance and control algorithms that maintain and reconfigure swarms of spacecraft while maintaining the shape of the swarm, preventing collisions between the spacecraft, and minimizing the amount of propellant used.

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

DTIC Science & Technology

2008-11-06

Nonproliferation Studies , 2004; Michael Levi, On Nuclear Terrorism, Cambridge, MA, Harvard University Press, 2007; and Carson Mark et al., “Can Terrorists Build...radiation and types of shielding. A DMOA study of real-world data found that the spectra from cargo differed between spring-summer and fall-winter; the study ...Algorithm and Resolution Studies ,” LLNL-TR-401531, December 31, 2007, by Padmini Sokkappa et al., pp. 21-22 This source is a report marked by Lawrence

Applications of Quantum Cascade Laser Scanners for Remote Detection of Chemical and Biological Threats and Weapons of Mass Destruction

DTIC Science & Technology

2014-07-09

Rivera. Highly Sensitive Filter Paper Substrate for SERS Trace Explosives Detection , International Journal of Spectroscopy, (09 2012): 0. doi: 10.1155...Highly Sensitive Filter Paper Substrate for SERS Field Detection of Trace Threat Chemicals”, PITTCON-2013: Forensic Analysis in the Lab and Crime Scene...the surface. In addition, built-in algorithms were used for nearly real-time sample detection . Trace and bulk concentrations of the other substances

A Fully Distributed Approach to the Design of a KBIT/SEC VHF Packet Radio Network,

DTIC Science & Technology

1984-02-01

topological change and consequent out-modea routing data. Algorithm development has been aided by computer simulation using a finite state machine technique...development has been aided by computer simulation using a finite state machine technique to model a realistic network of up to fifty nodes. This is...use of computer based equipments in weapons systems and their associated sensors and command and control elements and the trend from voice to data

Branch point reconstructors for discontinuous light phase functions

NASA Astrophysics Data System (ADS)

Le Bigot, Eric O.; Wild, Walter J.; Kibblewhite, Edward J.

1998-09-01

The study of phase discontinuities caused by atmospheric turbulence is a recent research topic; their study might yield significant improvements in high-quality adaptive optics systems, laser weapons and laser communication. We present in this paper an introduction to discontinuities in the light phase. We also provide a geometrical description of phase discontinuities, a study of their effect on Hartmann-Shack sensor measurements, as well as algorithms for measuring discontinuous light phases and the position of phase discontinuities.

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

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

Weigend, Florian, E-mail: florian.weigend@kit.edu

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

Quantum annealing for combinatorial clustering

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

An analysis of spectral envelope-reduction via quadratic assignment problems

NASA Technical Reports Server (NTRS)

George, Alan; Pothen, Alex

1994-01-01

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

Ant colony optimization for solving university facility layout problem

NASA Astrophysics Data System (ADS)

Mohd Jani, Nurul Hafiza; Mohd Radzi, Nor Haizan; Ngadiman, Mohd Salihin

2013-04-01

Quadratic Assignment Problems (QAP) is classified as the NP hard problem. It has been used to model a lot of problem in several areas such as operational research, combinatorial data analysis and also parallel and distributed computing, optimization problem such as graph portioning and Travel Salesman Problem (TSP). In the literature, researcher use exact algorithm, heuristics algorithm and metaheuristic approaches to solve QAP problem. QAP is largely applied in facility layout problem (FLP). In this paper we used QAP to model university facility layout problem. There are 8 facilities that need to be assigned to 8 locations. Hence we have modeled a QAP problem with n ≤ 10 and developed an Ant Colony Optimization (ACO) algorithm to solve the university facility layout problem. The objective is to assign n facilities to n locations such that the minimum product of flows and distances is obtained. Flow is the movement from one to another facility, whereas distance is the distance between one locations of a facility to other facilities locations. The objective of the QAP is to obtain minimum total walking (flow) of lecturers from one destination to another (distance).

On Channel-Discontinuity-Constraint Routing in Wireless Networks☆

PubMed Central

Sankararaman, Swaminathan; Efrat, Alon; Ramasubramanian, Srinivasan; Agarwal, Pankaj K.

2011-01-01

Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to compute a path with a channel assignment for the links such that the path and link bandwidths are the same. This is achieved when any two consecutive links are assigned different channels, termed as “Channel-Discontinuity-Constraint” (CDC). CDC-paths are also useful in TDMA systems, where, preferably, consecutive links are assigned different time-slots. In the first part of this paper, we develop a t-spanner for CDC-paths using spatial properties; a sub-network containing O(n/θ) links, for any θ > 0, such that CDC-paths increase in cost by at most a factor t = (1−2 sin (θ/2))−2. We propose a novel distributed algorithm to compute the spanner using an expected number of O(n log n) fixed-size messages. In the second part, we present a distributed algorithm to find minimum-cost CDC-paths between two nodes using O(n2) fixed-size messages, by developing an extension of Edmonds’ algorithm for minimum-cost perfect matching. In a centralized implementation, our algorithm runs in O(n2) time improving the previous best algorithm which requires O(n3) running time. Moreover, this running time improves to O(n/θ) when used in conjunction with the spanner developed. PMID:24443646

Tuning and performance evaluation of PID controller for superheater steam temperature control of 200 MW boiler using gain phase assignment algorithm

NASA Astrophysics Data System (ADS)

Begum, A. Yasmine; Gireesh, N.

2018-04-01

In superheater, steam temperature is controlled in a cascade control loop. The cascade control loop consists of PI and PID controllers. To improve the superheater steam temperature control the controller's gains in a cascade control loop has to be tuned efficiently. The mathematical model of the superheater is derived by sets of nonlinear partial differential equations. The tuning methods taken for study here are designed for delay plus first order transfer function model. Hence from the dynamical model of the superheater, a FOPTD model is derived using frequency response method. Then by using Chien-Hrones-Reswick Tuning Algorithm and Gain-Phase Assignment Algorithm optimum controller gains has been found out based on the least value of integral time weighted absolute error.

TH-CD-206-07: Determination of Patient-Specific Myocardial Mass at Risk Using Computed Tomography Angiography

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

Hubbard, L; Ziemer, B; Malkasian, S

Purpose: To evaluate the accuracy of a patient-specific coronary perfusion territory assignment algorithm that uses CT angiography (CTA) and a minimum-cost-path approach to assign coronary perfusion territories on a voxel-by-voxel basis for determination of myocardial mass at risk. Methods: Intravenous (IV) contrast (370 mg/mL iodine, 25 mL, 7 mL/s) was injected centrally into five swine (35–45 kg) and CTA was performed using a 320-slice CT scanner at 100 kVp and 200 mA. Additionally, a 4F catheter was advanced into the left anterior descending (LAD), left circumflex (LCX), and right coronary artery (RCA) and contrast (30 mg/mL iodine, 10 mL, 1.5more » mL/s) was directly injected into each coronary artery for isolation of reference coronary perfusion territories. Semiautomatic myocardial segmentation of the CTA data was then performed and the centerlines of the LAD, LCX, and RCA were digitally extracted through image processing. Individual coronary perfusion territories were then assigned using a minimum-cost-path approach, and were quantitatively compared to the reference coronary perfusion territories. Results: The results of the coronary perfusion territory assignment algorithm were in good agreement with the reference coronary perfusion territories. The average volumetric assignment error from mitral orifice to apex was 5.5 ± 1.1%, corresponding to 2.1 ± 0.7 grams of myocardial mass misassigned for each coronary perfusion territory. Conclusion: The results indicate that accurate coronary perfusion territory assignment is possible on a voxel-by-voxel basis using CTA data and an assignment algorithm based on a minimum-cost-path approach. Thus, the technique can potentially be used to accurately determine patient-specific myocardial mass at risk distal to a coronary stenosis, improving coronary lesion assessment and treatment. Conflict of Interest (only if applicable): Grant funding from Toshiba America Medical Systems.« less

A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem

NASA Astrophysics Data System (ADS)

Jäger, Gerold; Zhang, Weixiong

The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.

Missile signal processing common computer architecture for rapid technology upgrade

NASA Astrophysics Data System (ADS)

Rabinkin, Daniel V.; Rutledge, Edward; Monticciolo, Paul

2004-10-01

Interceptor missiles process IR images to locate an intended target and guide the interceptor towards it. Signal processing requirements have increased as the sensor bandwidth increases and interceptors operate against more sophisticated targets. A typical interceptor signal processing chain is comprised of two parts. Front-end video processing operates on all pixels of the image and performs such operations as non-uniformity correction (NUC), image stabilization, frame integration and detection. Back-end target processing, which tracks and classifies targets detected in the image, performs such algorithms as Kalman tracking, spectral feature extraction and target discrimination. In the past, video processing was implemented using ASIC components or FPGAs because computation requirements exceeded the throughput of general-purpose processors. Target processing was performed using hybrid architectures that included ASICs, DSPs and general-purpose processors. The resulting systems tended to be function-specific, and required custom software development. They were developed using non-integrated toolsets and test equipment was developed along with the processor platform. The lifespan of a system utilizing the signal processing platform often spans decades, while the specialized nature of processor hardware and software makes it difficult and costly to upgrade. As a result, the signal processing systems often run on outdated technology, algorithms are difficult to update, and system effectiveness is impaired by the inability to rapidly respond to new threats. A new design approach is made possible three developments; Moore's Law - driven improvement in computational throughput; a newly introduced vector computing capability in general purpose processors; and a modern set of open interface software standards. Today's multiprocessor commercial-off-the-shelf (COTS) platforms have sufficient throughput to support interceptor signal processing requirements. This application may be programmed under existing real-time operating systems using parallel processing software libraries, resulting in highly portable code that can be rapidly migrated to new platforms as processor technology evolves. Use of standardized development tools and 3rd party software upgrades are enabled as well as rapid upgrade of processing components as improved algorithms are developed. The resulting weapon system will have a superior processing capability over a custom approach at the time of deployment as a result of a shorter development cycles and use of newer technology. The signal processing computer may be upgraded over the lifecycle of the weapon system, and can migrate between weapon system variants enabled by modification simplicity. This paper presents a reference design using the new approach that utilizes an Altivec PowerPC parallel COTS platform. It uses a VxWorks-based real-time operating system (RTOS), and application code developed using an efficient parallel vector library (PVL). A quantification of computing requirements and demonstration of interceptor algorithm operating on this real-time platform are provided.

A learning approach to the bandwidth multicolouring problem

NASA Astrophysics Data System (ADS)

Akbari Torkestani, Javad

2016-05-01

In this article, a generalisation of the vertex colouring problem known as bandwidth multicolouring problem (BMCP), in which a set of colours is assigned to each vertex such that the difference between the colours, assigned to each vertex and its neighbours, is by no means less than a predefined threshold, is considered. It is shown that the proposed method can be applied to solve the bandwidth colouring problem (BCP) as well. BMCP is known to be NP-hard in graph theory, and so a large number of approximation solutions, as well as exact algorithms, have been proposed to solve it. In this article, two learning automata-based approximation algorithms are proposed for estimating a near-optimal solution to the BMCP. We show, for the first proposed algorithm, that by choosing a proper learning rate, the algorithm finds the optimal solution with a probability close enough to unity. Moreover, we compute the worst-case time complexity of the first algorithm for finding a 1/(1-ɛ) optimal solution to the given problem. The main advantage of this method is that a trade-off between the running time of algorithm and the colour set size (colouring optimality) can be made, by a proper choice of the learning rate also. Finally, it is shown that the running time of the proposed algorithm is independent of the graph size, and so it is a scalable algorithm for large graphs. The second proposed algorithm is compared with some well-known colouring algorithms and the results show the efficiency of the proposed algorithm in terms of the colour set size and running time of algorithm.

Intermediary Variables and Algorithm Parameters for an Electronic Algorithm for Intravenous Insulin Infusion

PubMed Central

Braithwaite, Susan S.; Godara, Hemant; Song, Julie; Cairns, Bruce A.; Jones, Samuel W.; Umpierrez, Guillermo E.

2009-01-01

Background Algorithms for intravenous insulin infusion may assign the infusion rate (IR) by a two-step process. First, the previous insulin infusion rate (IRprevious) and the rate of change of blood glucose (BG) from the previous iteration of the algorithm are used to estimate the maintenance rate (MR) of insulin infusion. Second, the insulin IR for the next iteration (IRnext) is assigned to be commensurate with the MR and the distance of the current blood glucose (BGcurrent) from target. With use of a specific set of algorithm parameter values, a family of iso-MR curves is created, each giving IR as a function of MR and BG. Method To test the feasibility of estimating MR from the IRprevious and the previous rate of change of BG, historical hyperglycemic data points were used to compute the “maintenance rate cross step next estimate” (MRcsne). Historical cases had been treated with intravenous insulin infusion using a tabular protocol that estimated MR according to column-change rules. The mean IR on historical stable intervals (MRtrue), an estimate of the biologic value of MR, was compared to MRcsne during the hyperglycemic iteration immediately preceding the stable interval. Hypothetically calculated MRcsne-dependent IRnext was compared to IRnext assigned historically. An expanded theory of an algorithm is developed mathematically. Practical recommendations for computerization are proposed. Results The MRtrue determined on each of 30 stable intervals and the MRcsne during the immediately preceding hyperglycemic iteration differed, having medians with interquartile ranges 2.7 (1.2–3.7) and 3.2 (1.5–4.6) units/h, respectively. However, these estimates of MR were strongly correlated (R2 = 0.88). During hyperglycemia at 941 time points the IRnext assigned historically and the hypothetically calculated MRcsne-dependent IRnext differed, having medians with interquartile ranges 4.0 (3.0–6.0) and 4.6 (3.0–6.8) units/h, respectively, but these paired values again were correlated (R2 = 0.87). This article describes a programmable algorithm for intravenous insulin infusion. The fundamental equation of the algorithm gives the relationship among IR; the biologic parameter MR; and two variables expressing an instantaneous rate of change of BG, one of which must be zero at any given point in time and the other positive, negative, or zero, namely the rate of change of BG from below target (rate of ascent) and the rate of change of BG from above target (rate of descent). In addition to user-definable parameters, three special algorithm parameters discoverable in nature are described: the maximum rate of the spontaneous ascent of blood glucose during nonhypoglycemia, the glucose per daily dose of insulin exogenously mediated, and the MR at given patient time points. User-assignable parameters will facilitate adaptation to different patient populations. Conclusions An algorithm is described that estimates MR prior to the attainment of euglycemia and computes MR-dependent values for IRnext. Design features address glycemic variability, promote safety with respect to hypoglycemia, and define a method for specifying glycemic targets that are allowed to differ according to patient condition. PMID:20144334

Post-processing techniques to enhance reliability of assignment algorithm based performance measures : [technical summary].

DOT National Transportation Integrated Search

2011-01-01

Travel demand modeling plays a key role in the transportation system planning and evaluation process. The four-step sequential travel demand model is the most widely used technique in practice. Traffic assignment is the key step in the conventional f...

Generalised Assignment Matrix Methodology in Linear Programming

ERIC Educational Resources Information Center

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…

Algorithm Analysis of the DSM-5 Alcohol Withdrawal Symptom.

PubMed

Martin, Christopher S; Vergés, Alvaro; Langenbucher, James W; Littlefield, Andrew; Chung, Tammy; Clark, Duncan B; Sher, Kenneth J

2018-06-01

Alcohol withdrawal (AW) is an important clinical and diagnostic feature of alcohol dependence. AW has been found to predict a worsened course of illness in clinical samples, but in some community studies, AW endorsement rates are strikingly high, suggesting false-positive symptom assignments. Little research has examined the validity of the DSM-5 algorithm for AW, which requires either the presence of at least 2 of 8 subcriteria (i.e., autonomic hyperactivity, tremulousness, insomnia, nausea, hallucinations, psychomotor agitation, anxiety, and grand mal seizures), or, the use of alcohol to avoid or relieve these symptoms. We used item and algorithm analyses of data from waves 1 and 2 of the National Epidemiologic Survey on Alcohol and Related Conditions (current drinkers, n = 26,946 at wave 1) to study the validity of DSM-5 AW as operationalized by the Alcohol Use Disorder and Associated Disabilities Interview Schedule-DSM-IV (AUDADIS-IV). A substantial proportion of individuals given the AW symptom reported only modest to moderate levels of alcohol use and alcohol problems. Alternative AW algorithms were superior to DSM-5 in terms of levels of alcohol use and alcohol problem severity among those with AW, group difference effect sizes, and predictive validity at a 3-year follow-up. The superior alternative algorithms included those that excluded the nausea subcriterion; required withdrawal-related distress or impairment; increased the AW subcriteria threshold from 2 to 3 items; and required tremulousness for AW symptom assignment. The results indicate that the DSM-5 definition of AW, as assessed by the AUDADIS-IV, has low specificity. This shortcoming can be addressed by making the algorithm for symptom assignment more stringent. Copyright © 2018 by the Research Society on Alcoholism.

Path Planning Algorithms for the Adaptive Sensor Fleet

NASA Technical Reports Server (NTRS)

Stoneking, Eric; Hosler, Jeff

2005-01-01

The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.

An ensemble approach to protein fold classification by integration of template-based assignment and support vector machine classifier.

PubMed

Xia, Jiaqi; Peng, Zhenling; Qi, Dawei; Mu, Hongbo; Yang, Jianyi

2017-03-15

Protein fold classification is a critical step in protein structure prediction. There are two possible ways to classify protein folds. One is through template-based fold assignment and the other is ab-initio prediction using machine learning algorithms. Combination of both solutions to improve the prediction accuracy was never explored before. We developed two algorithms, HH-fold and SVM-fold for protein fold classification. HH-fold is a template-based fold assignment algorithm using the HHsearch program. SVM-fold is a support vector machine-based ab-initio classification algorithm, in which a comprehensive set of features are extracted from three complementary sequence profiles. These two algorithms are then combined, resulting to the ensemble approach TA-fold. We performed a comprehensive assessment for the proposed methods by comparing with ab-initio methods and template-based threading methods on six benchmark datasets. An accuracy of 0.799 was achieved by TA-fold on the DD dataset that consists of proteins from 27 folds. This represents improvement of 5.4-11.7% over ab-initio methods. After updating this dataset to include more proteins in the same folds, the accuracy increased to 0.971. In addition, TA-fold achieved >0.9 accuracy on a large dataset consisting of 6451 proteins from 184 folds. Experiments on the LE dataset show that TA-fold consistently outperforms other threading methods at the family, superfamily and fold levels. The success of TA-fold is attributed to the combination of template-based fold assignment and ab-initio classification using features from complementary sequence profiles that contain rich evolution information. http://yanglab.nankai.edu.cn/TA-fold/. yangjy@nankai.edu.cn or mhb-506@163.com. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Comparative Analysis of Guidance Algorithms for the Hyper Velocity Missile and AFTI/F-16

DTIC Science & Technology

1991-11-12

concept has matured since T.C. Aden explained it in his Hyper-velocity Missile paper [21, but his work still details the heart of the weapon system. Aden’s...Electro-Optical Guidance System (AEOGS) . The responsibilities of the carrier aircraft and its AEOGS are outlined very well by Aden [2); however, some...the guidance and control concept. The guidance and control concept explained by Aden was abandoned during early development testing according to

Concealed object segmentation and three-dimensional localization with passive millimeter-wave imaging

NASA Astrophysics Data System (ADS)

Yeom, Seokwon

2013-05-01

Millimeter waves imaging draws increasing attention in security applications for weapon detection under clothing. In this paper, concealed object segmentation and three-dimensional localization schemes are reviewed. A concealed object is segmented by the k-means algorithm. A feature-based stereo-matching method estimates the longitudinal distance of the concealed object. The distance is estimated by the discrepancy between the corresponding centers of the segmented objects. Experimental results are provided with the analysis of the depth resolution.

A Situational-Awareness System For Networked Infantry Including An Accelerometer-Based Shot-Identification Algorithm For Direct-Fire Weapons

DTIC Science & Technology

2016-09-01

noise density and temperature sensitivity of these devices are all on the same order of magnitude. Even the worst- case noise density of the GCDC...accelerations from a handgun firing were distinct from other impulsive events on the wrist, such as using a hammer. Loeffler first identified potential shots by...spikes, taking various statistical parameters. He used a logistic regression model on these parameters and was able to classify 98.9% of shots

Individual Combatant’s Weapons Firing Algorithm Phase 1

DTIC Science & Technology

2010-06-01

Z as in zebra...Drilis? 2 - 5 years ago More than 6 years ago 7. ~HOW~ z ~~:::: fire fights have you been In1 3-9 10 or more 8. Of those fights, what percentage were...34, ~ ’~-<’" ;-~/Nr,. ~ ~ "~t’ "X\\’ikJ ~ ,.’ \\1" ’: ’\\ Z ;J;l~~’i/’r.i\\ I " ,.. ..... ’-.-1 . , .. ,~ . \\\\ 1 ;C~"~~~~,~,, ~’",~"",~, ........... ~ f·

SDIO (Strategic Defense Initiative Office) Technical Information Management Center Bibliography of Unclassified Documents: January - December 1988

DTIC Science & Technology

1988-12-01

Statistics to Studies of C3 and Spread Spectrum Communications Author(s): Pawula, R. F. * Date: 05/14/86 Pages:004 Report #: AFOSR-TR-87-0210 Corp. Author...1375 AD #: 0 TITLE: SPSS Statistical Algorithms Author(s): 0 Date: 01/01/85 Pages:230 Report #: CN83-60118 Corp. Author: SPSS Inc. 444 N. Michigan Ave...Assessment Mission Architecture Defense Battle Weapon Target Transitor Space Catastrophic Accession #: 1407 AD #: 0 TITLE: What price space-based interceptors

Joint Aerospace Weapon System Support, Sensors And Simulation Symposium (5th Annual). Held In San Diego, California on 13-18 June 1999

DTIC Science & Technology

1999-06-18

and 1.54 microns and to compute the spectral extinction coefficient. 3. Near IR (1.54 um) Laser rangefinders measure the time-of-flight of a short...quantitative understanding n n Research ( long term) n Encourage research in adaptive systems : evolutionary programming, genetic algorithms, neural nets... measures , such as false alarm rate , are not measurable in field applications. Other measures such as Incremental Fault Resolution, Operational Isolation

High capacity low delay packet broadcasting multiaccess schemes for satellite repeater systems

NASA Astrophysics Data System (ADS)

Bose, S. K.

1980-12-01

Demand assigned packet radio schemes using satellite repeaters can achieve high capacities but often exhibit relatively large delays under low traffic conditions when compared to random access. Several schemes which improve delay performance at low traffic but which have high capacity are presented and analyzed. These schemes allow random acess attempts by users, who are waiting for channel assignments. The performance of these are considered in the context of a multiple point communication system carrying fixed length messages between geographically distributed (ground) user terminals which are linked via a satellite repeater. Channel assignments are done following a BCC queueing discipline by a (ground) central controller on the basis of requests correctly received over a collision type access channel. In TBACR Scheme A, some of the forward message channels are set aside for random access transmissions; the rest are used in a demand assigned mode. Schemes B and C operate all their forward message channels in a demand assignment mode but, by means of appropriate algorithms for trailer channel selection, allow random access attempts on unassigned channels. The latter scheme also introduces framing and slotting of the time axis to implement a more efficient algorithm for trailer channel selection than the former.

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

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

Tolić, Nikola; Liu, Yina; Liyu, Andrey

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

Worldwide Emerging Environmental Issues Affecting the U.S. Military. May 2010

DTIC Science & Technology

2010-05-01

Negotiations…………………………………………………….6 4.2 Recommendations for Strengthening the Convention on Biological Diversity………….7 4.3 The Competition for Rare Earth...8 4.5 New Legal Proceeding over Allegations of Use of Illegal Weapons in Iraq……………..8 4.6 New EU Regulations for Increasing Energy...the human condition to new forms of bioweapons, President Obama assigned the Presidential Commission for the Study of Bioethical Issues to assess the

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

PubMed Central

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

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

PubMed

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.

Multipoint to multipoint routing and wavelength assignment in multi-domain optical networks

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

School Mathematics Study Group, Unit Number Two. Chapter 3 - Informal Algorithms and Flow Charts. Chapter 4 - Applications and Mathematics Models.

ERIC Educational Resources Information Center

Stanford Univ., CA. School Mathematics Study Group.

This is the second unit of a 15-unit School Mathematics Study Group (SMSG) mathematics text for high school students. Topics presented in the first chapter (Informal Algorithms and Flow Charts) include: changing a flat tire; algorithms, flow charts, and computers; assignment and variables; input and output; using a variable as a counter; decisions…

The practical evaluation of DNA barcode efficacy.

PubMed

Spouge, John L; Mariño-Ramírez, Leonardo

2012-01-01

This chapter describes a workflow for measuring the efficacy of a barcode in identifying species. First, assemble individual sequence databases corresponding to each barcode marker. A controlled collection of taxonomic data is preferable to GenBank data, because GenBank data can be problematic, particularly when comparing barcodes based on more than one marker. To ensure proper controls when evaluating species identification, specimens not having a sequence in every marker database should be discarded. Second, select a computer algorithm for assigning species to barcode sequences. No algorithm has yet improved notably on assigning a specimen to the species of its nearest neighbor within a barcode database. Because global sequence alignments (e.g., with the Needleman-Wunsch algorithm, or some related algorithm) examine entire barcode sequences, they generally produce better species assignments than local sequence alignments (e.g., with BLAST). No neighboring method (e.g., global sequence similarity, global sequence distance, or evolutionary distance based on a global alignment) has yet shown a notable superiority in identifying species. Finally, "the probability of correct identification" (PCI) provides an appropriate measurement of barcode efficacy. The overall PCI for a data set is the average of the species PCIs, taken over all species in the data set. This chapter states explicitly how to calculate PCI, how to estimate its statistical sampling error, and how to use data on PCR failure to set limits on how much improvements in PCR technology can improve species identification.

Augmented reality system

NASA Astrophysics Data System (ADS)

Lin, Chien-Liang; Su, Yu-Zheng; Hung, Min-Wei; Huang, Kuo-Cheng

2010-08-01

In recent years, Augmented Reality (AR)[1][2][3] is very popular in universities and research organizations. The AR technology has been widely used in Virtual Reality (VR) fields, such as sophisticated weapons, flight vehicle development, data model visualization, virtual training, entertainment and arts. AR has characteristics to enhance the display output as a real environment with specific user interactive functions or specific object recognitions. It can be use in medical treatment, anatomy training, precision instrument casting, warplane guidance, engineering and distance robot control. AR has a lot of vantages than VR. This system developed combines sensors, software and imaging algorithms to make users feel real, actual and existing. Imaging algorithms include gray level method, image binarization method, and white balance method in order to make accurate image recognition and overcome the effects of light.

Sparse interferometric millimeter-wave array for centimeter-level 100-m standoff imaging

NASA Astrophysics Data System (ADS)

Suen, Jonathan Y.; Lubin, Philip M.; Solomon, Steven L.; Ginn, Robert P.

2013-05-01

We present work on the development of a long range standoff concealed weapons detection system capable of imaging under very heavy clothing at distances exceeding 100 m with a cm resolution. The system is based off a combination of phased array technologies used in radio astronomy and SAR radar by using a coherent, multi-frequency reconstruction algorithm which can run at up to 1000 Hz frame rates and high SNR with a multi-tone transceiver. We show the flexible design space of our system as well as algorithm development, predicted system performance and impairments, and simulated reconstructed images. The system can be used for a variety of purposes including portal applications, crowd scanning and tactical situations. Additional uses include seeing through dust and fog.

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

PubMed

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

2011-05-01

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

Robust vector quantization for noisy channels

NASA Technical Reports Server (NTRS)

Demarca, J. R. B.; Farvardin, N.; Jayant, N. S.; Shoham, Y.

1988-01-01

The paper briefly discusses techniques for making vector quantizers more tolerant to tranmsission errors. Two algorithms are presented for obtaining an efficient binary word assignment to the vector quantizer codewords without increasing the transmission rate. It is shown that about 4.5 dB gain over random assignment can be achieved with these algorithms. It is also proposed to reduce the effects of error propagation in vector-predictive quantizers by appropriately constraining the response of the predictive loop. The constrained system is shown to have about 4 dB of SNR gain over an unconstrained system in a noisy channel, with a small loss of clean-channel performance.

Super-channel oriented routing, spectrum and core assignment under crosstalk limit in spatial division multiplexing elastic optical networks

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Zhu, Ye; Wang, Chunhui; Yu, Xiaosong; Liu, Chuan; Liu, Binglin; Zhang, Jie

2017-07-01

With the capacity increasing in optical networks enabled by spatial division multiplexing (SDM) technology, spatial division multiplexing elastic optical networks (SDM-EONs) attract much attention from both academic and industry. Super-channel is an important type of service provisioning in SDM-EONs. This paper focuses on the issue of super-channel construction in SDM-EONs. Mixed super-channel oriented routing, spectrum and core assignment (MS-RSCA) algorithm is proposed in SDM-EONs considering inter-core crosstalk. Simulation results show that MS-RSCA can improve spectrum resource utilization and reduce blocking probability significantly compared with the baseline RSCA algorithms.

A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments

NASA Astrophysics Data System (ADS)

Eyono Obono, S. D.; Basak, Sujit Kumar

2011-12-01

The general formulation of the assignment problem consists in the optimal allocation of a given set of tasks to a workforce. This problem is covered by existing literature for different domains such as distributed databases, distributed systems, transportation, packets radio networks, IT outsourcing, and teaching allocation. This paper presents a new version of the assignment problem for the allocation of academic tasks to staff members in departments with long leave opportunities. It presents the description of a workload allocation scheme and its algorithm, for the allocation of an equitable number of tasks in academic departments where long leaves are necessary.

Investigation of correlation classification techniques

NASA Technical Reports Server (NTRS)

Haskell, R. E.

1975-01-01

A two-step classification algorithm for processing multispectral scanner data was developed and tested. The first step is a single pass clustering algorithm that assigns each pixel, based on its spectral signature, to a particular cluster. The output of that step is a cluster tape in which a single integer is associated with each pixel. The cluster tape is used as the input to the second step, where ground truth information is used to classify each cluster using an iterative method of potentials. Once the clusters have been assigned to classes the cluster tape is read pixel-by-pixel and an output tape is produced in which each pixel is assigned to its proper class. In addition to the digital classification programs, a method of using correlation clustering to process multispectral scanner data in real time by means of an interactive color video display is also described.

Directed Design of Experiments for Validating Probability of Detection Capability of a Testing System

NASA Technical Reports Server (NTRS)

Generazio, Edward R. (Inventor)

2012-01-01

A method of validating a probability of detection (POD) testing system using directed design of experiments (DOE) includes recording an input data set of observed hit and miss or analog data for sample components as a function of size of a flaw in the components. The method also includes processing the input data set to generate an output data set having an optimal class width, assigning a case number to the output data set, and generating validation instructions based on the assigned case number. An apparatus includes a host machine for receiving the input data set from the testing system and an algorithm for executing DOE to validate the test system. The algorithm applies DOE to the input data set to determine a data set having an optimal class width, assigns a case number to that data set, and generates validation instructions based on the case number.

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

PubMed

Onogi, Yuzo

2007-01-01

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

A demand assignment control in international business satellite communications network

NASA Astrophysics Data System (ADS)

Nohara, Mitsuo; Takeuchi, Yoshio; Takahata, Fumio; Hirata, Yasuo

An experimental system is being developed for use in an international business satellite (IBS) communications network based on demand-assignment (DA) and TDMA techniques. This paper discusses its system design, in particular from the viewpoints of a network configuration, a DA control, and a satellite channel-assignment algorithm. A satellite channel configuration is also presented along with a tradeoff study on transmission rate, HPA output power, satellite resource efficiency, service quality, and so on.

Contact replacement for NMR resonance assignment.

PubMed

Xiong, Fei; Pandurangan, Gopal; Bailey-Kellogg, Chris

2008-07-01

Complementing its traditional role in structural studies of proteins, nuclear magnetic resonance (NMR) spectroscopy is playing an increasingly important role in functional studies. NMR dynamics experiments characterize motions involved in target recognition, ligand binding, etc., while NMR chemical shift perturbation experiments identify and localize protein-protein and protein-ligand interactions. The key bottleneck in these studies is to determine the backbone resonance assignment, which allows spectral peaks to be mapped to specific atoms. This article develops a novel approach to address that bottleneck, exploiting an available X-ray structure or homology model to assign the entire backbone from a set of relatively fast and cheap NMR experiments. We formulate contact replacement for resonance assignment as the problem of computing correspondences between a contact graph representing the structure and an NMR graph representing the data; the NMR graph is a significantly corrupted, ambiguous version of the contact graph. We first show that by combining connectivity and amino acid type information, and exploiting the random structure of the noise, one can provably determine unique correspondences in polynomial time with high probability, even in the presence of significant noise (a constant number of noisy edges per vertex). We then detail an efficient randomized algorithm and show that, over a variety of experimental and synthetic datasets, it is robust to typical levels of structural variation (1-2 AA), noise (250-600%) and missings (10-40%). Our algorithm achieves very good overall assignment accuracy, above 80% in alpha-helices, 70% in beta-sheets and 60% in loop regions. Our contact replacement algorithm is implemented in platform-independent Python code. The software can be freely obtained for academic use by request from the authors.

A new method for solving routing and wavelength assignment problems under inaccurate routing information in optical networks with conversion capability

NASA Astrophysics Data System (ADS)

Luo, Yanting; Zhang, Yongjun; Gu, Wanyi

2009-11-01

In large dynamic networks it is extremely difficult to maintain accurate routing information on all network nodes. The existing studies have illustrated the impact of imprecise state information on the performance of dynamic routing and wavelength assignment (RWA) algorithms. An algorithm called Bypass Based Optical Routing (BBOR) proposed by Xavier Masip-Bruin et al can reduce the effects of having inaccurate routing information in networks operating under the wavelength-continuity constraint. Then they extended the BBOR mechanism (for convenience it's called EBBOR mechanism below) to be applied to the networks with sparse and limited wavelength conversion. But it only considers the characteristic of wavelength conversion in the step of computing the bypass-paths so that its performance may decline with increasing the degree of wavelength translation (this concept will be explained in the section of introduction again). We will demonstrate the issue through theoretical analysis and introduce a novel algorithm which modifies both the lightpath selection and the bypass-paths computation in comparison to EBBOR algorithm. Simulations show that the Modified EBBOR (MEBBOR) algorithm improves the blocking performance significantly in optical networks with Conversion Capability.

Future aircraft networks and schedules

NASA Astrophysics Data System (ADS)

Shu, Yan

2011-07-01

Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents computational results of these large-scale instances. To validate the models and solution algorithms developed, this thesis also compares the daily flight schedules that it designs with the schedules of the existing airlines. Furthermore, it creates instances that represent different economic and fuel-prices conditions and derives schedules under these different conditions. In addition, it discusses the implication of using new aircraft in the future flight schedules. Finally, future research in three areas---model, computational method, and simulation for validation---is proposed.

Manycast routing, modulation level and spectrum assignment over elastic optical networks

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

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

PubMed Central

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

2017-01-01

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

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

PubMed

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

2017-01-17

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

Knowledge-Based Scheduling of Arrival Aircraft in the Terminal Area

NASA Technical Reports Server (NTRS)

Krzeczowski, K. J.; Davis, T.; Erzberger, H.; Lev-Ram, Israel; Bergh, Christopher P.

1995-01-01

A knowledge based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real time simulation. The scheduling system automatically sequences, assigns landing times, and assign runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithm is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reductions, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithm is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper describes the scheduling algorithms, gives examples of their use, and presents data regarding their potential benefits to the air traffic system.

Knowledge-based scheduling of arrival aircraft

NASA Technical Reports Server (NTRS)

Krzeczowski, K.; Davis, T.; Erzberger, H.; Lev-Ram, I.; Bergh, C.

1995-01-01

A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

A scoring algorithm for predicting the presence of adult asthma: a prospective derivation study.

PubMed

Tomita, Katsuyuki; Sano, Hiroyuki; Chiba, Yasutaka; Sato, Ryuji; Sano, Akiko; Nishiyama, Osamu; Iwanaga, Takashi; Higashimoto, Yuji; Haraguchi, Ryuta; Tohda, Yuji

2013-03-01

To predict the presence of asthma in adult patients with respiratory symptoms, we developed a scoring algorithm using clinical parameters. We prospectively analysed 566 adult outpatients who visited Kinki University Hospital for the first time with complaints of nonspecific respiratory symptoms. Asthma was comprehensively diagnosed by specialists using symptoms, signs, and objective tools including bronchodilator reversibility and/or the assessment of bronchial hyperresponsiveness (BHR). Multiple logistic regression analysis was performed to categorise patients and determine the accuracy of diagnosing asthma. A scoring algorithm using the symptom-sign score was developed, based on diurnal variation of symptoms (1 point), recurrent episodes (2 points), medical history of allergic diseases (1 point), and wheeze sound (2 points). A score of >3 had 35% sensitivity and 97% specificity for discriminating between patients with and without asthma and assigned a high probability of having asthma (accuracy 90%). A score of 1 or 2 points assigned intermediate probability (accuracy 68%). After providing additional data of forced expiratory volume in 1 second/forced vital capacity (FEV(1)/FVC) ratio <0.7, the post-test probability of having asthma was increased to 93%. A score of 0 points assigned low probability (accuracy 31%). After providing additional data of positive reversibility, the post-test probability of having asthma was increased to 88%. This pragmatic diagnostic algorithm is useful for predicting the presence of adult asthma and for determining the appropriate time for consultation with a pulmonologist.

A novel algorithm for validating peptide identification from a shotgun proteomics search engine.

PubMed

Jian, Ling; Niu, Xinnan; Xia, Zhonghang; Samir, Parimal; Sumanasekera, Chiranthani; Mu, Zheng; Jennings, Jennifer L; Hoek, Kristen L; Allos, Tara; Howard, Leigh M; Edwards, Kathryn M; Weil, P Anthony; Link, Andrew J

2013-03-01

Liquid chromatography coupled with tandem mass spectrometry (LC-MS/MS) has revolutionized the proteomics analysis of complexes, cells, and tissues. In a typical proteomic analysis, the tandem mass spectra from a LC-MS/MS experiment are assigned to a peptide by a search engine that compares the experimental MS/MS peptide data to theoretical peptide sequences in a protein database. The peptide spectra matches are then used to infer a list of identified proteins in the original sample. However, the search engines often fail to distinguish between correct and incorrect peptides assignments. In this study, we designed and implemented a novel algorithm called De-Noise to reduce the number of incorrect peptide matches and maximize the number of correct peptides at a fixed false discovery rate using a minimal number of scoring outputs from the SEQUEST search engine. The novel algorithm uses a three-step process: data cleaning, data refining through a SVM-based decision function, and a final data refining step based on proteolytic peptide patterns. Using proteomics data generated on different types of mass spectrometers, we optimized the De-Noise algorithm on the basis of the resolution and mass accuracy of the mass spectrometer employed in the LC-MS/MS experiment. Our results demonstrate De-Noise improves peptide identification compared to other methods used to process the peptide sequence matches assigned by SEQUEST. Because De-Noise uses a limited number of scoring attributes, it can be easily implemented with other search engines.

A Probabilistic Framework for Peptide and Protein Quantification from Data-Dependent and Data-Independent LC-MS Proteomics Experiments

PubMed Central

Richardson, Keith; Denny, Richard; Hughes, Chris; Skilling, John; Sikora, Jacek; Dadlez, Michał; Manteca, Angel; Jung, Hye Ryung; Jensen, Ole Nørregaard; Redeker, Virginie; Melki, Ronald; Langridge, James I.; Vissers, Johannes P.C.

2013-01-01

A probability-based quantification framework is presented for the calculation of relative peptide and protein abundance in label-free and label-dependent LC-MS proteomics data. The results are accompanied by credible intervals and regulation probabilities. The algorithm takes into account data uncertainties via Poisson statistics modified by a noise contribution that is determined automatically during an initial normalization stage. Protein quantification relies on assignments of component peptides to the acquired data. These assignments are generally of variable reliability and may not be present across all of the experiments comprising an analysis. It is also possible for a peptide to be identified to more than one protein in a given mixture. For these reasons the algorithm accepts a prior probability of peptide assignment for each intensity measurement. The model is constructed in such a way that outliers of any type can be automatically reweighted. Two discrete normalization methods can be employed. The first method is based on a user-defined subset of peptides, while the second method relies on the presence of a dominant background of endogenous peptides for which the concentration is assumed to be unaffected. Normalization is performed using the same computational and statistical procedures employed by the main quantification algorithm. The performance of the algorithm will be illustrated on example data sets, and its utility demonstrated for typical proteomics applications. The quantification algorithm supports relative protein quantification based on precursor and product ion intensities acquired by means of data-dependent methods, originating from all common isotopically-labeled approaches, as well as label-free ion intensity-based data-independent methods. PMID:22871168

Computer-based coding of free-text job descriptions to efficiently identify occupations in epidemiological studies

PubMed Central

Russ, Daniel E.; Ho, Kwan-Yuet; Colt, Joanne S.; Armenti, Karla R.; Baris, Dalsu; Chow, Wong-Ho; Davis, Faith; Johnson, Alison; Purdue, Mark P.; Karagas, Margaret R.; Schwartz, Kendra; Schwenn, Molly; Silverman, Debra T.; Johnson, Calvin A.; Friesen, Melissa C.

2016-01-01

Background Mapping job titles to standardized occupation classification (SOC) codes is an important step in identifying occupational risk factors in epidemiologic studies. Because manual coding is time-consuming and has moderate reliability, we developed an algorithm called SOCcer (Standardized Occupation Coding for Computer-assisted Epidemiologic Research) to assign SOC-2010 codes based on free-text job description components. Methods Job title and task-based classifiers were developed by comparing job descriptions to multiple sources linking job and task descriptions to SOC codes. An industry-based classifier was developed based on the SOC prevalence within an industry. These classifiers were used in a logistic model trained using 14,983 jobs with expert-assigned SOC codes to obtain empirical weights for an algorithm that scored each SOC/job description. We assigned the highest scoring SOC code to each job. SOCcer was validated in two occupational data sources by comparing SOC codes obtained from SOCcer to expert assigned SOC codes and lead exposure estimates obtained by linking SOC codes to a job-exposure matrix. Results For 11,991 case-control study jobs, SOCcer-assigned codes agreed with 44.5% and 76.3% of manually assigned codes at the 6- and 2-digit level, respectively. Agreement increased with the score, providing a mechanism to identify assignments needing review. Good agreement was observed between lead estimates based on SOCcer and manual SOC assignments (kappa: 0.6–0.8). Poorer performance was observed for inspection job descriptions, which included abbreviations and worksite-specific terminology. Conclusions Although some manual coding will remain necessary, using SOCcer may improve the efficiency of incorporating occupation into large-scale epidemiologic studies. PMID:27102331

ASSURED CLOUD COMPUTING UNIVERSITY CENTER OFEXCELLENCE (ACC UCOE)

DTIC Science & Technology

2018-01-18

average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed...infrastructure security -Design of algorithms and techniques for real- time assuredness in cloud computing -Map-reduce task assignment with data locality...46 DESIGN OF ALGORITHMS AND TECHNIQUES FOR REAL- TIME ASSUREDNESS IN CLOUD COMPUTING

GeoSearcher: Location-Based Ranking of Search Engine Results.

ERIC Educational Resources Information Center

Watters, Carolyn; Amoudi, Ghada

2003-01-01

Discussion of Web queries with geospatial dimensions focuses on an algorithm that assigns location coordinates dynamically to Web sites based on the URL. Describes a prototype search system that uses the algorithm to re-rank search engine results for queries with a geospatial dimension, thus providing an alternative ranking order for search engine…

Fuzzy-logic based Q-Learning interference management algorithms in two-tier networks

NASA Astrophysics Data System (ADS)

Xu, Qiang; Xu, Zezhong; Li, Li; Zheng, Yan

2017-10-01

Unloading from macrocell network and enhancing coverage can be realized by deploying femtocells in the indoor scenario. However, the system performance of the two-tier network could be impaired by the co-tier and cross-tier interference. In this paper, a distributed resource allocation scheme is studied when each femtocell base station is self-governed and the resource cannot be assigned centrally through the gateway. A novel Q-Learning interference management scheme is proposed, that is divided into cooperative and independent part. In the cooperative algorithm, the interference information is exchanged between the cell-edge users which are classified by the fuzzy logic in the same cell. Meanwhile, we allocate the orthogonal subchannels to the high-rate cell-edge users to disperse the interference power when the data rate requirement is satisfied. The resource is assigned directly according to the minimum power principle in the independent algorithm. Simulation results are provided to demonstrate the significant performance improvements in terms of the average data rate, interference power and energy efficiency over the cutting-edge resource allocation algorithms.

Video bandwidth compression system

NASA Astrophysics Data System (ADS)

Ludington, D.

1980-08-01

The objective of this program was the development of a Video Bandwidth Compression brassboard model for use by the Air Force Avionics Laboratory, Wright-Patterson Air Force Base, in evaluation of bandwidth compression techniques for use in tactical weapons and to aid in the selection of particular operational modes to be implemented in an advanced flyable model. The bandwidth compression system is partitioned into two major divisions: the encoder, which processes the input video with a compression algorithm and transmits the most significant information; and the decoder where the compressed data is reconstructed into a video image for display.

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

DTIC Science & Technology

2012-05-16

large size and lack of efficiency of current technology after initial review. In the 1990’s the Air Force designed and produced a high- altitude ...Forden, G.E., "The airborne laser," Spectrum, IEEE , vol.34, no.9, pp.40-49, Sep 1997 10 altitude of 40,000 ft. the atmosphere was much clearer...distance remains the same. OT-5 provides a relative position of beam center on the detector. Two voltage outputs are given corresponding to x-axis location

Novel density-based and hierarchical density-based clustering algorithms for uncertain data.

PubMed

Zhang, Xianchao; Liu, Han; Zhang, Xiaotong

2017-09-01

Uncertain data has posed a great challenge to traditional clustering algorithms. Recently, several algorithms have been proposed for clustering uncertain data, and among them density-based techniques seem promising for handling data uncertainty. However, some issues like losing uncertain information, high time complexity and nonadaptive threshold have not been addressed well in the previous density-based algorithm FDBSCAN and hierarchical density-based algorithm FOPTICS. In this paper, we firstly propose a novel density-based algorithm PDBSCAN, which improves the previous FDBSCAN from the following aspects: (1) it employs a more accurate method to compute the probability that the distance between two uncertain objects is less than or equal to a boundary value, instead of the sampling-based method in FDBSCAN; (2) it introduces new definitions of probability neighborhood, support degree, core object probability, direct reachability probability, thus reducing the complexity and solving the issue of nonadaptive threshold (for core object judgement) in FDBSCAN. Then, we modify the algorithm PDBSCAN to an improved version (PDBSCANi), by using a better cluster assignment strategy to ensure that every object will be assigned to the most appropriate cluster, thus solving the issue of nonadaptive threshold (for direct density reachability judgement) in FDBSCAN. Furthermore, as PDBSCAN and PDBSCANi have difficulties for clustering uncertain data with non-uniform cluster density, we propose a novel hierarchical density-based algorithm POPTICS by extending the definitions of PDBSCAN, adding new definitions of fuzzy core distance and fuzzy reachability distance, and employing a new clustering framework. POPTICS can reveal the cluster structures of the datasets with different local densities in different regions better than PDBSCAN and PDBSCANi, and it addresses the issues in FOPTICS. Experimental results demonstrate the superiority of our proposed algorithms over the existing algorithms in accuracy and efficiency. Copyright © 2017 Elsevier Ltd. All rights reserved.

Improved tissue assignment using dual-energy computed tomography in low-dose rate prostate brachytherapy for Monte Carlo dose calculation

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

Côté, Nicolas; Bedwani, Stéphane; Carrier, Jean-François, E-mail: jean-francois.carrier.chum@ssss.gouv.qc.ca

Purpose: An improvement in tissue assignment for low-dose rate brachytherapy (LDRB) patients using more accurate Monte Carlo (MC) dose calculation was accomplished with a metallic artifact reduction (MAR) method specific to dual-energy computed tomography (DECT). Methods: The proposed MAR algorithm followed a four-step procedure. The first step involved applying a weighted blend of both DECT scans (I {sub H/L}) to generate a new image (I {sub Mix}). This action minimized Hounsfield unit (HU) variations surrounding the brachytherapy seeds. In the second step, the mean HU of the prostate in I {sub Mix} was calculated and shifted toward the mean HUmore » of the two original DECT images (I {sub H/L}). The third step involved smoothing the newly shifted I {sub Mix} and the two original I {sub H/L}, followed by a subtraction of both, generating an image that represented the metallic artifact (I {sub A,(H/L)}) of reduced noise levels. The final step consisted of subtracting the original I {sub H/L} from the newly generated I {sub A,(H/L)} and obtaining a final image corrected for metallic artifacts. Following the completion of the algorithm, a DECT stoichiometric method was used to extract the relative electronic density (ρ{sub e}) and effective atomic number (Z {sub eff}) at each voxel of the corrected scans. Tissue assignment could then be determined with these two newly acquired physical parameters. Each voxel was assigned the tissue bearing the closest resemblance in terms of ρ{sub e} and Z {sub eff}, comparing with values from the ICRU 42 database. A MC study was then performed to compare the dosimetric impacts of alternative MAR algorithms. Results: An improvement in tissue assignment was observed with the DECT MAR algorithm, compared to the single-energy computed tomography (SECT) approach. In a phantom study, tissue misassignment was found to reach 0.05% of voxels using the DECT approach, compared with 0.40% using the SECT method. Comparison of the DECT and SECT D {sub 90} dose parameter (volume receiving 90% of the dose) indicated that D {sub 90} could be underestimated by up to 2.3% using the SECT method. Conclusions: The DECT MAR approach is a simple alternative to reduce metallic artifacts found in LDRB patient scans. Images can be processed quickly and do not require the determination of x-ray spectra. Substantial information on density and atomic number can also be obtained. Furthermore, calcifications within the prostate are detected by the tissue assignment algorithm. This enables more accurate, patient-specific MC dose calculations.« less

American perspectives on security : energy, environment, nuclear weapons, and terrorism : 2010.

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

Herron, Kerry Gale; Jenkins-Smith, Hank C.; Silva, Carol L.

2011-03-01

We report findings from an Internet survey and a subset of questions administered by telephone among the American public in mid-2010 on US energy and environmental security. Key areas of investigation include public perceptions shaping the context for debate about a comprehensive national energy policy, and what levels of importance are assigned to various prospective energy technologies. Additionally, we investigate how public views on global climate change are evolving, how the public assesses the risks and benefits of nuclear energy, preferences for managing used nuclear fuel, and public trust in sources of scientific and technical information. We also report findingsmore » from a national Internet survey and a subset of questions administered by telephone in mid-2010 on public views of the relevance of US nuclear weapons today, support for strategic arms control, and assessments of the potential for nuclear abolition. Additionally, we analyze evolving public views of the threat of terrorism, assessments of progress in the struggle against terrorism, and tolerance for intrusive antiterror policies. Where possible, findings from each survey are compared with previous surveys in this series for analyses of trends.« less

An ontology-based nurse call management system (oNCS) with probabilistic priority assessment

PubMed Central

2011-01-01

Background The current, place-oriented nurse call systems are very static. A patient can only make calls with a button which is fixed to a wall of a room. Moreover, the system does not take into account various factors specific to a situation. In the future, there will be an evolution to a mobile button for each patient so that they can walk around freely and still make calls. The system would become person-oriented and the available context information should be taken into account to assign the correct nurse to a call. The aim of this research is (1) the design of a software platform that supports the transition to mobile and wireless nurse call buttons in hospitals and residential care and (2) the design of a sophisticated nurse call algorithm. This algorithm dynamically adapts to the situation at hand by taking the profile information of staff members and patients into account. Additionally, the priority of a call probabilistically depends on the risk factors, assigned to a patient. Methods The ontology-based Nurse Call System (oNCS) was developed as an extension of a Context-Aware Service Platform. An ontology is used to manage the profile information. Rules implement the novel nurse call algorithm that takes all this information into account. Probabilistic reasoning algorithms are designed to determine the priority of a call based on the risk factors of the patient. Results The oNCS system is evaluated through a prototype implementation and simulations, based on a detailed dataset obtained from Ghent University Hospital. The arrival times of nurses at the location of a call, the workload distribution of calls amongst nurses and the assignment of priorities to calls are compared for the oNCS system and the current, place-oriented nurse call system. Additionally, the performance of the system is discussed. Conclusions The execution time of the nurse call algorithm is on average 50.333 ms. Moreover, the oNCS system significantly improves the assignment of nurses to calls. Calls generally have a nurse present faster and the workload-distribution amongst the nurses improves. PMID:21294860

Solving multiconstraint assignment problems using learning automata.

PubMed

Horn, Geir; Oommen, B John

2010-02-01

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

Diagnostic Performance of SRU and ATA Thyroid Nodule Classification Algorithms as Tested With a 1 Million Virtual Thyroid Nodule Model.

PubMed

Boehnke, Mitchell; Patel, Nayana; McKinney, Kristin; Clark, Toshimasa

The Society of Radiologists in Ultrasound (SRU 2005) and American Thyroid Association (ATA 2009 and ATA 2015) have published algorithms regarding thyroid nodule management. Kwak et al. and other groups have described models that estimate thyroid nodules' malignancy risk. The aim of our study is to use Kwak's model to evaluate the tradeoffs of both sensitivity and specificity of SRU 2005, ATA 2009 and ATA 2015 management algorithms. 1,000,000 thyroid nodules were modeled in MATLAB. Ultrasound characteristics were modeled after published data. Malignancy risk was estimated per Kwak's model and assigned as a binary variable. All nodules were then assessed using the published management algorithms. With the malignancy variable as condition positivity and algorithms' recommendation for FNA as test positivity, diagnostic performance was calculated. Modeled nodule characteristics mimic those of Kwak et al. 12.8% nodules were assigned as malignant (malignancy risk range of 2.0-98%). FNA was recommended for 41% of nodules by SRU 2005, 66% by ATA 2009, and 82% by ATA 2015. Sensitivity and specificity is significantly different (< 0.0001): 49% and 60% for SRU; 81% and 36% for ATA 2009; and 95% and 20% for ATA 2015. SRU 2005, ATA 2009 and ATA 2015 algorithms are used routinely in clinical practice to determine whether thyroid nodule biopsy is indicated. We demonstrate significant differences in these algorithms' diagnostic performance, which result in a compromise between sensitivity and specificity. Copyright © 2017 Elsevier Inc. All rights reserved.

Fast algorithm for automatically computing Strahler stream order

USGS Publications Warehouse

Lanfear, Kenneth J.

1990-01-01

An efficient algorithm was developed to determine Strahler stream order for segments of stream networks represented in a Geographic Information System (GIS). The algorithm correctly assigns Strahler stream order in topologically complex situations such as braided streams and multiple drainage outlets. Execution time varies nearly linearly with the number of stream segments in the network. This technique is expected to be particularly useful for studying the topology of dense stream networks derived from digital elevation model data.

Overcoming an obstacle in expanding a UMLS semantic type extent.

PubMed

Chen, Yan; Gu, Huanying; Perl, Yehoshua; Geller, James

2012-02-01

This paper strives to overcome a major problem encountered by a previous expansion methodology for discovering concepts highly likely to be missing a specific semantic type assignment in the UMLS. This methodology is the basis for an algorithm that presents the discovered concepts to a human auditor for review and possible correction. We analyzed the problem of the previous expansion methodology and discovered that it was due to an obstacle constituted by one or more concepts assigned the UMLS Semantic Network semantic type Classification. A new methodology was designed that bypasses such an obstacle without a combinatorial explosion in the number of concepts presented to the human auditor for review. The new expansion methodology with obstacle avoidance was tested with the semantic type Experimental Model of Disease and found over 500 concepts missed by the previous methodology that are in need of this semantic type assignment. Furthermore, other semantic types suffering from the same major problem were discovered, indicating that the methodology is of more general applicability. The algorithmic discovery of concepts that are likely missing a semantic type assignment is possible even in the face of obstacles, without an explosion in the number of processed concepts. Copyright © 2011 Elsevier Inc. All rights reserved.

Overcoming an Obstacle in Expanding a UMLS Semantic Type Extent

PubMed Central

Chen, Yan; Gu, Huanying; Perl, Yehoshua; Geller, James

2011-01-01

This paper strives to overcome a major problem encountered by a previous expansion methodology for discovering concepts highly likely to be missing a specific semantic type assignment in the UMLS. This methodology is the basis for an algorithm that presents the discovered concepts to a human auditor for review and possible correction. We analyzed the problem of the previous expansion methodology and discovered that it was due to an obstacle constituted by one or more concepts assigned the UMLS Semantic Network semantic type Classification. A new methodology was designed that bypasses such an obstacle without a combinatorial explosion in the number of concepts presented to the human auditor for review. The new expansion methodology with obstacle avoidance was tested with the semantic type Experimental Model of Disease and found over 500 concepts missed by the previous methodology that are in need of this semantic type assignment. Furthermore, other semantic types suffering from the same major problem were discovered, indicating that the methodology is of more general applicability. The algorithmic discovery of concepts that are likely missing a semantic type assignment is possible even in the face of obstacles, without an explosion in the number of processed concepts. PMID:21925287

Relationship auditing of the FMA ontology

PubMed Central

Gu, Huanying (Helen); Wei, Duo; Mejino, Jose L.V.; Elhanan, Gai

2010-01-01

The Foundational Model of Anatomy (FMA) ontology is a domain reference ontology based on a disciplined modeling approach. Due to its large size, semantic complexity and manual data entry process, errors and inconsistencies are unavoidable and might remain within the FMA structure without detection. In this paper, we present computable methods to highlight candidate concepts for various relationship assignment errors. The process starts with locating structures formed by transitive structural relationships (part_of, tributary_of, branch_of) and examine their assignments in the context of the IS-A hierarchy. The algorithms were designed to detect five major categories of possible incorrect relationship assignments: circular, mutually exclusive, redundant, inconsistent, and missed entries. A domain expert reviewed samples of these presumptive errors to confirm the findings. Seven thousand and fifty-two presumptive errors were detected, the largest proportion related to part_of relationship assignments. The results highlight the fact that errors are unavoidable in complex ontologies and that well designed algorithms can help domain experts to focus on concepts with high likelihood of errors and maximize their effort to ensure consistency and reliability. In the future similar methods might be integrated with data entry processes to offer real-time error detection. PMID:19475727

Deep Learning in Intermediate Microeconomics: Using Scaffolding Assignments to Teach Theory and Promote Transfer

ERIC Educational Resources Information Center

Green, Gareth P.; Bean, John C.; Peterson, Dean J.

2013-01-01

Intermediate microeconomics is typically viewed as a theory and tools course that relies on algorithmic problems to help students learn and apply economic theory. However, the authors' assessment research suggests that algorithmic problems by themselves do not encourage students to think about where the theory comes from, why the theory is…

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

NASA Astrophysics Data System (ADS)

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

2011-11-01

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

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

NASA Astrophysics Data System (ADS)

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.

Ultra-wide-band 3D microwave imaging scanner for the detection of concealed weapons

NASA Astrophysics Data System (ADS)

Rezgui, Nacer-Ddine; Andrews, David A.; Bowring, Nicholas J.

2015-10-01

The threat of concealed weapons, explosives and contraband in footwear, bags and suitcases has led to the development of new devices, which can be deployed for security screening. To address known deficiencies of metal detectors and x-rays, an UWB 3D microwave imaging scanning apparatus using FMCW stepped frequency working in the K and Q bands and with a planar scanning geometry based on an x y stage, has been developed to screen suspicious luggage and footwear. To obtain microwave images of the concealed weapons, the targets are placed above the platform and the single transceiver horn antenna attached to the x y stage is moved mechanically to perform a raster scan to create a 2D synthetic aperture array. The S11 reflection signal of the transmitted sweep frequency from the target is acquired by a VNA in synchronism with each position step. To enhance and filter from clutter and noise the raw data and to obtain the 2D and 3D microwave images of the concealed weapons or explosives, data processing techniques are applied to the acquired signals. These techniques include background subtraction, Inverse Fast Fourier Transform (IFFT), thresholding, filtering by gating and windowing and deconvolving with the transfer function of the system using a reference target. To focus the 3D reconstructed microwave image of the target in range and across the x y aperture without using focusing elements, 3D Synthetic Aperture Radar (SAR) techniques are applied to the post-processed data. The K and Q bands, between 15 to 40 GHz, show good transmission through clothing and dielectric materials found in luggage and footwear. A description of the system, algorithms and some results with replica guns and a comparison of microwave images obtained by IFFT, 2D and 3D SAR techniques are presented.

Proliferation of nuclear weapons: opportunities for control and abolition.

PubMed

Sidel, Victor W; Levy, Barry S

2007-09-01

Nuclear weapons pose a particularly destructive threat. Prevention of the proliferation and use of nuclear weapons is urgently important to public health. "Horizontal" proliferation refers to nation-states or nonstate entities that do not have, but are acquiring, nuclear weapons or developing the capability and materials for producing them. "Vertical" proliferation refers to nation-states that do possess nuclear weapons and are increasing their stockpiles of these weapons, improving the technical sophistication or reliability of their weapons, or developing new weapons. Because nation-states or other entities that wish to use or threaten to use nuclear weapons need methods for delivering those weapons, proliferation of delivery mechanisms must also be prevented. Controlling proliferation--and ultimately abolishing nuclear weapons--involves national governments, intergovernmental organizations, nongovernmental and professional organizations, and society at large.

Single machine scheduling with slack due dates assignment

NASA Astrophysics Data System (ADS)

Liu, Weiguo; Hu, Xiangpei; Wang, Xuyin

2017-04-01

This paper considers a single machine scheduling problem in which each job is assigned an individual due date based on a common flow allowance (i.e. all jobs have slack due date). The goal is to find a sequence for jobs, together with a due date assignment, that minimizes a non-regular criterion comprising the total weighted absolute lateness value and common flow allowance cost, where the weight is a position-dependent weight. In order to solve this problem, an ? time algorithm is proposed. Some extensions of the problem are also shown.

Youths carrying a weapon or using a weapon in a fight: what makes the difference?

PubMed

Thurnherr, Judit; Michaud, Pierre-André; Berchtold, André; Akré, Christina; Suris, Joan-Carles

2009-04-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 divided into those who had used it in a fight and those who had not. Individual, family, school and social factors were analyzed using bivariate and stepwise multivariate analysis. For both genders, delinquent behavior and being victim of physical violence were associated with weapon carrying. For males, quarreling while intoxicated, being an apprentice, being sensation seekers, having a tattoo, having a poor relationship with parents and practicing unsafe sex were also related to weapon carrying. Compared with weapon carriers, female weapon users were more likely to be regular smokers. Male weapon users were foreign born, urban and apprentices; had poor school connectedness; practiced unsafe sex and quarreled while intoxicated. Carrying a weapon is a relatively frequent behavior among youths in Switzerland and a sizeable proportion of weapon carriers have used it in a fight. Weapon carrying should be part of the clinical assessment and preventive counseling of adolescents. Preventive programs specific for at-risk youth groups need to be developed.

Research on the control of large space structures

NASA Technical Reports Server (NTRS)

Denman, E. D.

1983-01-01

The research effort on the control of large space structures at the University of Houston has concentrated on the mathematical theory of finite-element models; identification of the mass, damping, and stiffness matrix; assignment of damping to structures; and decoupling of structure dynamics. The objective of the work has been and will continue to be the development of efficient numerical algorithms for analysis, control, and identification of large space structures. The major consideration in the development of the algorithms has been the large number of equations that must be handled by the algorithm as well as sensitivity of the algorithms to numerical errors.

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

ERIC Educational Resources Information Center

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…

Conventional armed forces in Europe: Technology scenario development

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

Houser, G.M.

1990-07-01

In January 1986, the Soviet Union's Mikhail Gorbachev proposed elimination of all nuclear weapons by the year 2000. In April of that year, Mr. Gorbachev proposed substantial reductions of conventional weapons in Europe, from the Atlantic Ocean to the Ural Mountains, including reductions in operational-tactical nuclear weapons. In May 1986, the North Atlantic Treaty Organization (NATO) responded with the Brussels Declaration on Conventional Arms Control,'' which indicated readiness to open East/West discussions on establishing a mandate for negotiating conventional arms control throughout Europe. The Group of 23,'' which met in Vienna beginning in February 1987, concluded the meeting in Januarymore » 1989 with a mandate for the Conventional Armed Forced in Europe (CFE) negotiations. On 6 March 1989, CFE talks began, and these talks have continued through six rounds (as of April 1990). Although US President George Bush, on 30 May 1989, called for agreement within six months to a year, and the Malta meeting of December 1989 called for completion of a CFE agreement by the end of 1990, much remains to be negotiated. This report provides three types of information. First, treaty provisions brought to the table by both sides are compared. Second, on the basis of these provisions, problem areas for each of the provision elements are postulated and possible scenarios for resolving these problem areas are developed. Third, the scenarios are used as requirements for tasks assigned program elements for possible US implementation of a CFE treaty. As progress is achieved during the negotiations, this report could be updated, as necessary, in each of the areas to provide a continuing systematic basis for program implementation and technology development. 8 refs.« less

Deriving flow directions for coarse-resolution (1-4 km) gridded hydrologic modeling

NASA Astrophysics Data System (ADS)

Reed, Seann M.

2003-09-01

The National Weather Service Hydrology Laboratory (NWS-HL) is currently testing a grid-based distributed hydrologic model at a resolution (4 km) commensurate with operational, radar-based precipitation products. To implement distributed routing algorithms in this framework, a flow direction must be assigned to each model cell. A new algorithm, referred to as cell outlet tracing with an area threshold (COTAT) has been developed to automatically, accurately, and efficiently assign flow directions to any coarse-resolution grid cells using information from any higher-resolution digital elevation model. Although similar to previously published algorithms, this approach offers some advantages. Use of an area threshold allows more control over the tendency for producing diagonal flow directions. Analyses of results at different output resolutions ranging from 300 m to 4000 m indicate that it is possible to choose an area threshold that will produce minimal differences in average network flow lengths across this range of scales. Flow direction grids at a 4 km resolution have been produced for the conterminous United States.

Sandia National Laboratories: National Security Missions: Nuclear Weapons:

Science.gov Websites

Safety & Security Sandia National Laboratories Exceptional service in the national interest & Figures Programs Nuclear Weapons About Nuclear Weapons Safety & Security Weapons Science & Twitter YouTube Flickr RSS Top Nuclear Weapons About Nuclear Weapons at Sandia Safety & Security

From Natural Variation to Optimal Policy? The Lucas Critique Meets Peer Effects. NBER Working Paper No. 16865

ERIC Educational Resources Information Center

Carrell, Scott E.; Sacerdote, Bruce I.; West, James E.

2011-01-01

We take cohorts of entering freshmen at the United States Air Force Academy and assign half to peer groups with the goal of maximizing the academic performance of the lowest ability students. Our assignment algorithm uses peer effects estimates from the observational data. We find a negative and significant treatment effect for the students we…

Confirming the Lanchestrian linear-logarithmic model of attrition

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

Hartley, D.S. III.

1990-12-01

This paper is the fourth in a series of reports on the breakthrough research in historical validation of attrition in conflict. Significant defense policy decisions, including weapons acquisition and arms reduction, are based in part on models of conflict. Most of these models are driven by their attrition algorithms, usually forms of the Lanchester square and linear laws. None of these algorithms have been validated. The results of this paper confirm the results of earlier papers, using a large database of historical results. The homogeneous linear-logarithmic Lanchestrian attrition model is validated to the extent possible with current initial and finalmore » force size data and is consistent with the Iwo Jima data. A particular differential linear-logarithmic model is described that fits the data very well. A version of Helmbold's victory predicting parameter is also confirmed, with an associated probability function. 37 refs., 73 figs., 68 tabs.« less

On protecting the planet against cosmic attack: Ultrafast real-time estimate of the asteroid's radial velocity

NASA Astrophysics Data System (ADS)

Zakharchenko, V. D.; Kovalenko, I. G.

2014-05-01

A new method for the line-of-sight velocity estimation of a high-speed near-Earth object (asteroid, meteorite) is suggested. The method is based on the use of fractional, one-half order derivative of a Doppler signal. The algorithm suggested is much simpler and more economical than the classical one, and it appears preferable for use in orbital weapon systems of threat response. Application of fractional differentiation to quick evaluation of mean frequency location of the reflected Doppler signal is justified. The method allows an assessment of the mean frequency in the time domain without spectral analysis. An algorithm structure for the real-time estimation is presented. The velocity resolution estimates are made for typical asteroids in the X-band. It is shown that the wait time can be shortened by orders of magnitude compared with similar value in the case of a standard spectral processing.

Multi-Agent Task Negotiation Among UAVs to Defend Against Swarm Attacks

DTIC Science & Technology

2012-03-01

are based on economic models [39]. Auction methods of task coordination also attempt to deal with agents dealing with noisy, dynamic environments...August 2006. [34] M. Alighanbari, “ Robust and decentralized task assignment algorithms for uavs,” Ph.D. dissertation, Massachusetts Institute of Technology...Implicit Coordination . . . . . . . . . . . . . 12 2.4 Decentralized Algorithm B - Market- Based . . . . . . . . . . . . . . . . 12 2.5 Decentralized

iNJclust: Iterative Neighbor-Joining Tree Clustering Framework for Inferring Population Structure.

PubMed

Limpiti, Tulaya; Amornbunchornvej, Chainarong; Intarapanich, Apichart; Assawamakin, Anunchai; Tongsima, Sissades

2014-01-01

Understanding genetic differences among populations is one of the most important issues in population genetics. Genetic variations, e.g., single nucleotide polymorphisms, are used to characterize commonality and difference of individuals from various populations. This paper presents an efficient graph-based clustering framework which operates iteratively on the Neighbor-Joining (NJ) tree called the iNJclust algorithm. The framework uses well-known genetic measurements, namely the allele-sharing distance, the neighbor-joining tree, and the fixation index. The behavior of the fixation index is utilized in the algorithm's stopping criterion. The algorithm provides an estimated number of populations, individual assignments, and relationships between populations as outputs. The clustering result is reported in the form of a binary tree, whose terminal nodes represent the final inferred populations and the tree structure preserves the genetic relationships among them. The clustering performance and the robustness of the proposed algorithm are tested extensively using simulated and real data sets from bovine, sheep, and human populations. The result indicates that the number of populations within each data set is reasonably estimated, the individual assignment is robust, and the structure of the inferred population tree corresponds to the intrinsic relationships among populations within the data.

A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks

PubMed Central

Camacho-Vallejo, José-Fernando; Mar-Ortiz, Julio; López-Ramos, Francisco; Rodríguez, Ricardo Pedraza

2015-01-01

Local access networks (LAN) are commonly used as communication infrastructures which meet the demand of a set of users in the local environment. Usually these networks consist of several LAN segments connected by bridges. The topological LAN design bi-level problem consists on assigning users to clusters and the union of clusters by bridges in order to obtain a minimum response time network with minimum connection cost. Therefore, the decision of optimally assigning users to clusters will be made by the leader and the follower will make the decision of connecting all the clusters while forming a spanning tree. In this paper, we propose a genetic algorithm for solving the bi-level topological design of a Local Access Network. Our solution method considers the Stackelberg equilibrium to solve the bi-level problem. The Stackelberg-Genetic algorithm procedure deals with the fact that the follower’s problem cannot be optimally solved in a straightforward manner. The computational results obtained from two different sets of instances show that the performance of the developed algorithm is efficient and that it is more suitable for solving the bi-level problem than a previous Nash-Genetic approach. PMID:26102502

Trajectory optimization of spacecraft high-thrust orbit transfer using a modified evolutionary algorithm

NASA Astrophysics Data System (ADS)

Shirazi, Abolfazl

2016-10-01

This article introduces a new method to optimize finite-burn orbital manoeuvres based on a modified evolutionary algorithm. Optimization is carried out based on conversion of the orbital manoeuvre into a parameter optimization problem by assigning inverse tangential functions to the changes in direction angles of the thrust vector. The problem is analysed using boundary delimitation in a common optimization algorithm. A method is introduced to achieve acceptable values for optimization variables using nonlinear simulation, which results in an enlarged convergence domain. The presented algorithm benefits from high optimality and fast convergence time. A numerical example of a three-dimensional optimal orbital transfer is presented and the accuracy of the proposed algorithm is shown.

TaDb: A time-aware diffusion-based recommender algorithm

NASA Astrophysics Data System (ADS)

Li, Wen-Jun; Xu, Yuan-Yuan; Dong, Qiang; Zhou, Jun-Lin; Fu, Yan

2015-02-01

Traditional recommender algorithms usually employ the early and recent records indiscriminately, which overlooks the change of user interests over time. In this paper, we show that the interests of a user remain stable in a short-term interval and drift during a long-term period. Based on this observation, we propose a time-aware diffusion-based (TaDb) recommender algorithm, which assigns different temporal weights to the leading links existing before the target user's collection and the following links appearing after that in the diffusion process. Experiments on four real datasets, Netflix, MovieLens, FriendFeed and Delicious show that TaDb algorithm significantly improves the prediction accuracy compared with the algorithms not considering temporal effects.

32 CFR 234.10 - Weapons.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 2 2012-07-01 2012-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...

32 CFR 234.10 - Weapons.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 2 2013-07-01 2013-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...

32 CFR 234.10 - Weapons.

Code of Federal Regulations, 2010 CFR

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

32 CFR 234.10 - Weapons.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 2 2014-07-01 2014-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...

32 CFR 234.10 - Weapons.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 2 2011-07-01 2011-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...

An adaptive grid algorithm for 3-D GIS landform optimization based on improved ant algorithm

NASA Astrophysics Data System (ADS)

Wu, Chenhan; Meng, Lingkui; Deng, Shijun

2005-07-01

The key technique of 3-D GIS is to realize quick and high-quality 3-D visualization, in which 3-D roaming system based on landform plays an important role. However how to increase efficiency of 3-D roaming engine and process a large amount of landform data is a key problem in 3-D landform roaming system and improper process of the problem would result in tremendous consumption of system resources. Therefore it has become the key of 3-D roaming system design that how to realize high-speed process of distributed data for landform DEM (Digital Elevation Model) and high-speed distributed modulation of various 3-D landform data resources. In the paper we improved the basic ant algorithm and designed the modulation strategy of 3-D GIS landform resources based on the improved ant algorithm. By initially hypothetic road weights σi , the change of the information factors in the original algorithm would transform from ˜τj to ∆τj+σi and the weights was decided by 3-D computative capacity of various nodes in network environment. So during the course of initial phase of task assignment, increasing the resource information factors of high task-accomplishing rate and decreasing ones of low accomplishing rate would make load accomplishing rate approach the same value as quickly as possible, then in the later process of task assignment, the load balanced ability of the system was further improved. Experimental results show by improving ant algorithm, our system not only decreases many disadvantage of the traditional ant algorithm, but also like ants looking for food effectively distributes the complicated landform algorithm to many computers to process cooperatively and gains a satisfying search result.

Identifying Fixed Support Costs in Air Force Visibility and Management of Operating and Support Costs (VAMOSC).

DTIC Science & Technology

1983-04-01

Algorithms I: Overview," Technical Report No. 115-2, Desmatics, Inc., 1983. 6. C. T. Horngren , Cost Accounting : A Managerial Emphasis, Prentice-Hall Inc...CHART NATIONA BUREAUJ OF STAf4DARO-I% 3-A S . . . . . . . . . . I.I i ". ’ 1).N’r1F𔃻I."U FmiXE Sc’pioir COSTS IN A VA,(),C * by Robert L. Gardner Dennis...operations and support (O& S ) costs for Air Force aircraft weapon systems and ground communications-electronics (C-E) systems. Included are fuel, materiel, pay

Total mass difference statistics algorithm: a new approach to identification of high-mass building blocks in electrospray ionization Fourier transform ion cyclotron mass spectrometry data of natural organic matter.

PubMed

Kunenkov, Erast V; Kononikhin, Alexey S; Perminova, Irina V; Hertkorn, Norbert; Gaspar, Andras; Schmitt-Kopplin, Philippe; Popov, Igor A; Garmash, Andrew V; Nikolaev, Evgeniy N

2009-12-15

The ultrahigh-resolution Fourier transform ion cyclotron resonance (FTICR) mass spectrum of natural organic matter (NOM) contains several thousand peaks with dozens of molecules matching the same nominal mass. Such a complexity poses a significant challenge for automatic data interpretation, in which the most difficult task is molecular formula assignment, especially in the case of heavy and/or multielement ions. In this study, a new universal algorithm for automatic treatment of FTICR mass spectra of NOM and humic substances based on total mass difference statistics (TMDS) has been developed and implemented. The algorithm enables a blind search for unknown building blocks (instead of a priori known ones) by revealing repetitive patterns present in spectra. In this respect, it differs from all previously developed approaches. This algorithm was implemented in designing FIRAN-software for fully automated analysis of mass data with high peak density. The specific feature of FIRAN is its ability to assign formulas to heavy and/or multielement molecules using "virtual elements" approach. To verify the approach, it was used for processing mass spectra of sodium polystyrene sulfonate (PSS, M(w) = 2200 Da) and polymethacrylate (PMA, M(w) = 3290 Da) which produce heavy multielement and multiply-charged ions. Application of TMDS identified unambiguously monomers present in the polymers consistent with their structure: C(8)H(7)SO(3)Na for PSS and C(4)H(6)O(2) for PMA. It also allowed unambiguous formula assignment to all multiply-charged peaks including the heaviest peak in PMA spectrum at mass 4025.6625 with charge state 6- (mass bias -0.33 ppm). Application of the TMDS-algorithm to processing data on the Suwannee River FA has proven its unique capacities in analysis of spectra with high peak density: it has not only identified the known small building blocks in the structure of FA such as CH(2), H(2), C(2)H(2)O, O but the heavier unit at 154.027 amu. The latter was identified for the first time and assigned a formula C(7)H(6)O(4) consistent with the structure of dihydroxyl-benzoic acids. The presence of these compounds in the structure of FA has so far been numerically suggested but never proven directly. It was concluded that application of the TMDS-algorithm opens new horizons in unfolding molecular complexity of NOM and other natural products.

3 CFR - Continuation of the National Emergency With Respect to the Proliferation of Weapons of Mass...

Code of Federal Regulations, 2014 CFR

2014-01-01

... to the Proliferation of Weapons of Mass Destruction Presidential Documents Other Presidential... Proliferation of Weapons of Mass Destruction On November 14, 1994, by Executive Order 12938, the President... chemical weapons (weapons of mass destruction) and the means of delivering such weapons. On July 28, 1998...

[Chemical weapons and chemical terrorism].

PubMed

Nakamura, Katsumi

2005-10-01

Chemical Weapons are kind of Weapons of Mass Destruction (WMD). They were used large quantities in WWI. Historically, large quantities usage like WWI was not recorded, but small usage has appeared now and then. Chemical weapons are so called "Nuclear weapon for poor countrys" because it's very easy to produce/possession being possible. They are categorized (1) Nerve Agents, (2) Blister Agents, (3) Cyanide (blood) Agents, (4) Pulmonary Agents, (5) Incapacitating Agents (6) Tear Agents from the viewpoint of human body interaction. In 1997 the Chemical Weapons Convention has taken effect. It prohibits chemical weapons development/production, and Organization for the Prohibition of Chemical Weapons (OPCW) verification regime contributes to the chemical weapons disposal. But possibility of possession/use of weapons of mass destruction by terrorist group represented in one by Matsumoto and Tokyo Subway Sarin Attack, So new chemical terrorism countermeasures are necessary.

Proliferation of Nuclear Weapons: Opportunities for Control and Abolition

PubMed Central

Sidel, Victor W.; Levy, Barry S.

2007-01-01

Nuclear weapons pose a particularly destructive threat. Prevention of the proliferation and use of nuclear weapons is urgently important to public health. “Horizontal” proliferation refers to nation-states or nonstate entities that do not have, but are acquiring, nuclear weapons or developing the capability and materials for producing them. “Vertical” proliferation refers to nation-states that do possess nuclear weapons and are increasing their stockpiles of these weapons, improving the technical sophistication or reliability of their weapons, or developing new weapons. Because nation-states or other entities that wish to use or threaten to use nuclear weapons need methods for delivering those weapons, proliferation of delivery mechanisms must also be prevented. Controlling proliferation—and ultimately abolishing nuclear weapons—involves national governments, intergovernmental organizations, nongovernmental and professional organizations, and society at large. PMID:17666690

A new algorithm using cross-assignment for label-free quantitation with LC-LTQ-FT MS.

PubMed

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

2007-06-01

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

Leveraging search and content exploration by exploiting context in folksonomy systems

NASA Astrophysics Data System (ADS)

Abel, Fabian; Baldoni, Matteo; Baroglio, Cristina; Henze, Nicola; Kawase, Ricardo; Krause, Daniel; Patti, Viviana

2010-04-01

With the advent of Web 2.0 tagging became a popular feature in social media systems. People tag diverse kinds of content, e.g. products at Amazon, music at Last.fm, images at Flickr, etc. In the last years several researchers analyzed the impact of tags on information retrieval. Most works focused on tags only and ignored context information. In this article we present context-aware approaches for learning semantics and improve personalized information retrieval in tagging systems. We investigate how explorative search, initialized by clicking on tags, can be enhanced with automatically produced context information so that search results better fit to the actual information needs of the users. We introduce the SocialHITS algorithm and present an experiment where we compare different algorithms for ranking users, tags, and resources in a contextualized way. We showcase our approaches in the domain of images and present the TagMe! system that enables users to explore and tag Flickr pictures. In TagMe! we further demonstrate how advanced context information can easily be generated: TagMe! allows users to attach tag assignments to a specific area within an image and to categorize tag assignments. In our corresponding evaluation we show that those additional facets of tag assignments gain valuable semantics, which can be applied to improve existing search and ranking algorithms significantly.

Bugs and gas: Agreements banning chemical and biological weapons

NASA Astrophysics Data System (ADS)

Mikulak, Robert P.

2017-11-01

The use of chemical or biological weapons, whether by a State or terrorists, continues to be a serious security concern. Both types of weapons are prohibited by multilateral treaties that have very broad membership, but both the Biological Weapons Convention and the Chemical Weapons Convention are facing major challenges. In particular, the continued use of chemical weapons in the Syrian civil war by government forces risks eroding the norm against the use of such weapons. This paper briefly explore the recent history of efforts to constrain chemical and biological weapons and outlines challenges for the future.

Perceived popularity of adolescents who use weapons in violence and adolescents who only carry weapons.

PubMed

Wallace, Lacey N

2017-01-01

Prior research has found that persistently delinquent youth or more violent youth were less popular than their less delinquent peers (Young, 2013). However, recent research has also found that weapon carrying is associated with being more popular in adolescence (Dijkstra et al., 2010). The present paper examines the perceived popularity of adolescents who carry weapons in comparison to those who both carry and use weapons in acts of violence or threatened violence. Data consist of two waves from the National Longitudinal Study of Adolescent to Adult Health. Analyses use OLS regression with lagged predictors. This paper found no differences in number of friends between weapon carriers and weapon users. However, among both male and female gang members, those who did not use or carry weapons (abstainers) named significantly fewer friends than weapon users. Among females, weapon abstainers both named and were named by significantly more people than weapon users. These differences were not observed for males. Implications of these results and directions for future research are discussed.

Computer-based coding of free-text job descriptions to efficiently identify occupations in epidemiological studies.

PubMed

Russ, Daniel E; Ho, Kwan-Yuet; Colt, Joanne S; Armenti, Karla R; Baris, Dalsu; Chow, Wong-Ho; Davis, Faith; Johnson, Alison; Purdue, Mark P; Karagas, Margaret R; Schwartz, Kendra; Schwenn, Molly; Silverman, Debra T; Johnson, Calvin A; Friesen, Melissa C

2016-06-01

Mapping job titles to standardised occupation classification (SOC) codes is an important step in identifying occupational risk factors in epidemiological studies. Because manual coding is time-consuming and has moderate reliability, we developed an algorithm called SOCcer (Standardized Occupation Coding for Computer-assisted Epidemiologic Research) to assign SOC-2010 codes based on free-text job description components. Job title and task-based classifiers were developed by comparing job descriptions to multiple sources linking job and task descriptions to SOC codes. An industry-based classifier was developed based on the SOC prevalence within an industry. These classifiers were used in a logistic model trained using 14 983 jobs with expert-assigned SOC codes to obtain empirical weights for an algorithm that scored each SOC/job description. We assigned the highest scoring SOC code to each job. SOCcer was validated in 2 occupational data sources by comparing SOC codes obtained from SOCcer to expert assigned SOC codes and lead exposure estimates obtained by linking SOC codes to a job-exposure matrix. For 11 991 case-control study jobs, SOCcer-assigned codes agreed with 44.5% and 76.3% of manually assigned codes at the 6-digit and 2-digit level, respectively. Agreement increased with the score, providing a mechanism to identify assignments needing review. Good agreement was observed between lead estimates based on SOCcer and manual SOC assignments (κ 0.6-0.8). Poorer performance was observed for inspection job descriptions, which included abbreviations and worksite-specific terminology. Although some manual coding will remain necessary, using SOCcer may improve the efficiency of incorporating occupation into large-scale epidemiological studies. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

36 CFR 2.4 - Weapons, traps and nets.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 36 Parks, Forests, and Public Property 1 2011-07-01 2011-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...

36 CFR 2.4 - Weapons, traps and nets.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 36 Parks, Forests, and Public Property 1 2012-07-01 2012-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...

36 CFR 2.4 - Weapons, traps and nets.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 36 Parks, Forests, and Public Property 1 2013-07-01 2013-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...

36 CFR 2.4 - Weapons, traps and nets.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 36 Parks, Forests, and Public Property 1 2014-07-01 2014-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...

36 CFR 2.4 - Weapons, traps and nets.

Code of Federal Regulations, 2010 CFR

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

The weapons effect.

PubMed

Benjamin, Arlin James; Bushman, Brad J

2018-02-01

In some societies, weapons are plentiful and highly visible. This review examines recent trends in research on the weapons effect, which is the finding that the mere presence of weapons can prime people to behave aggressively. The General Aggression Model provides a theoretical framework to explain why the weapons effect occurs. This model postulates that exposure to weapons increases aggressive thoughts and hostile appraisals, thus explaining why weapons facilitate aggressive behavior. Data from meta-analytic reviews are consistent with the General Aggression Model. These findings have important practical as well as theoretical implications. They suggest that the link between weapons and aggression is very strong in semantic memory, and that merely seeing a weapon can make people more aggressive. Copyright © 2017 Elsevier Ltd. All rights reserved.

Development of a job rotation scheduling algorithm for minimizing accumulated work load per body parts.

PubMed

Song, JooBong; Lee, Chaiwoo; Lee, WonJung; Bahn, Sangwoo; Jung, ChanJu; Yun, Myung Hwan

2015-01-01

For the successful implementation of job rotation, jobs should be scheduled systematically so that physical workload is evenly distributed with the use of various body parts. However, while the potential benefits are widely recognized by research and industry, there is still a need for a more effective and efficient algorithm that considers multiple work-related factors in job rotation scheduling. This study suggests a type of job rotation algorithm that aims to minimize musculoskeletal disorders with the approach of decreasing the overall workload. Multiple work characteristics are evaluated as inputs to the proposed algorithm. Important factors, such as physical workload on specific body parts, working height, involvement of heavy lifting, and worker characteristics such as physical disorders, are included in the algorithm. For evaluation of the overall workload in a given workplace, an objective function was defined to aggregate the scores from the individual factors. A case study, where the algorithm was applied at a workplace, is presented with an examination on its applicability and effectiveness. With the application of the suggested algorithm in case study, the value of the final objective function, which is the weighted sum of the workload in various body parts, decreased by 71.7% when compared to a typical sequential assignment and by 84.9% when compared to a single job assignment, which is doing one job all day. An algorithm was developed using the data from the ergonomic evaluation tool used in the plant and from the known factors related to workload. The algorithm was developed so that it can be efficiently applied with a small amount of required inputs, while covering a wide range of work-related factors. A case study showed that the algorithm was beneficial in determining a job rotation schedule aimed at minimizing workload across body parts.

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

ERIC Educational Resources Information Center

Jackson, C. Kirabo

2011-01-01

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

Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

PubMed Central

Wan, Long

2014-01-01

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example. PMID:25147861

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

PubMed Central

Asorey-Cacheda, Rafael; García-Sánchez, Antonio Javier; García-Sánchez, Felipe; García-Haro, Joan; Gonzalez-Castaño, Francisco Javier

2013-01-01

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

Hierarchical auto-configuration addressing in mobile ad hoc networks (HAAM)

NASA Astrophysics Data System (ADS)

Ram Srikumar, P.; Sumathy, S.

2017-11-01

Addressing plays a vital role in networking to identify devices uniquely. A device must be assigned with a unique address in order to participate in the data communication in any network. Different protocols defining different types of addressing are proposed in literature. Address auto-configuration is a key requirement for self organizing networks. Existing auto-configuration based addressing protocols require broadcasting probes to all the nodes in the network before assigning a proper address to a new node. This needs further broadcasts to reflect the status of the acquired address in the network. Such methods incur high communication overheads due to repetitive flooding. To address this overhead, a new partially stateful address allocation scheme, namely Hierarchical Auto-configuration Addressing (HAAM) scheme is extended and proposed. Hierarchical addressing basically reduces latency and overhead caused during address configuration. Partially stateful addressing algorithm assigns addresses without the need for flooding and global state awareness, which in turn reduces the communication overhead and space complexity respectively. Nodes are assigned addresses hierarchically to maintain the graph of the network as a spanning tree which helps in effectively avoiding the broadcast storm problem. Proposed algorithm for HAAM handles network splits and merges efficiently in large scale mobile ad hoc networks incurring low communication overheads.

On maximizing the lifetime of Wireless Sensor Networks by optimally assigning energy supplies.

PubMed

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

2013-08-09

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

QAPgrid: A Two Level QAP-Based Approach for Large-Scale Data Analysis and Visualization

PubMed Central

Inostroza-Ponta, Mario; Berretta, Regina; Moscato, Pablo

2011-01-01

Background The visualization of large volumes of data is a computationally challenging task that often promises rewarding new insights. There is great potential in the application of new algorithms and models from combinatorial optimisation. Datasets often contain “hidden regularities” and a combined identification and visualization method should reveal these structures and present them in a way that helps analysis. While several methodologies exist, including those that use non-linear optimization algorithms, severe limitations exist even when working with only a few hundred objects. Methodology/Principal Findings We present a new data visualization approach (QAPgrid) that reveals patterns of similarities and differences in large datasets of objects for which a similarity measure can be computed. Objects are assigned to positions on an underlying square grid in a two-dimensional space. We use the Quadratic Assignment Problem (QAP) as a mathematical model to provide an objective function for assignment of objects to positions on the grid. We employ a Memetic Algorithm (a powerful metaheuristic) to tackle the large instances of this NP-hard combinatorial optimization problem, and we show its performance on the visualization of real data sets. Conclusions/Significance Overall, the results show that QAPgrid algorithm is able to produce a layout that represents the relationships between objects in the data set. Furthermore, it also represents the relationships between clusters that are feed into the algorithm. We apply the QAPgrid on the 84 Indo-European languages instance, producing a near-optimal layout. Next, we produce a layout of 470 world universities with an observed high degree of correlation with the score used by the Academic Ranking of World Universities compiled in the The Shanghai Jiao Tong University Academic Ranking of World Universities without the need of an ad hoc weighting of attributes. Finally, our Gene Ontology-based study on Saccharomyces cerevisiae fully demonstrates the scalability and precision of our method as a novel alternative tool for functional genomics. PMID:21267077

QAPgrid: a two level QAP-based approach for large-scale data analysis and visualization.

PubMed

Inostroza-Ponta, Mario; Berretta, Regina; Moscato, Pablo

2011-01-18

The visualization of large volumes of data is a computationally challenging task that often promises rewarding new insights. There is great potential in the application of new algorithms and models from combinatorial optimisation. Datasets often contain "hidden regularities" and a combined identification and visualization method should reveal these structures and present them in a way that helps analysis. While several methodologies exist, including those that use non-linear optimization algorithms, severe limitations exist even when working with only a few hundred objects. We present a new data visualization approach (QAPgrid) that reveals patterns of similarities and differences in large datasets of objects for which a similarity measure can be computed. Objects are assigned to positions on an underlying square grid in a two-dimensional space. We use the Quadratic Assignment Problem (QAP) as a mathematical model to provide an objective function for assignment of objects to positions on the grid. We employ a Memetic Algorithm (a powerful metaheuristic) to tackle the large instances of this NP-hard combinatorial optimization problem, and we show its performance on the visualization of real data sets. Overall, the results show that QAPgrid algorithm is able to produce a layout that represents the relationships between objects in the data set. Furthermore, it also represents the relationships between clusters that are feed into the algorithm. We apply the QAPgrid on the 84 Indo-European languages instance, producing a near-optimal layout. Next, we produce a layout of 470 world universities with an observed high degree of correlation with the score used by the Academic Ranking of World Universities compiled in the The Shanghai Jiao Tong University Academic Ranking of World Universities without the need of an ad hoc weighting of attributes. Finally, our Gene Ontology-based study on Saccharomyces cerevisiae fully demonstrates the scalability and precision of our method as a novel alternative tool for functional genomics.

Two Different Approaches to Automated Mark Up of Emotions in Text

NASA Astrophysics Data System (ADS)

Francisco, Virginia; Hervás, Raqucl; Gervás, Pablo

This paper presents two different approaches to automated marking up of texts with emotional labels. For the first approach a corpus of example texts previously annotated by human evaluators is mined for an initial assignment of emotional features to words. This results in a List of Emotional Words (LEW) which becomes a useful resource for later automated mark up. The mark up algorithm in this first approach mirrors closely the steps taken during feature extraction, employing for the actual assignment of emotional features a combination of the LEW resource and WordNet for knowledge-based expansion of words not occurring in LEW. The algorithm for automated mark up is tested against new text samples to test its coverage. The second approach mark up texts during their generation. We have a knowledge base which contains the necessary information for marking up the text. This information is related to actions and characters. The algorithm in this case employ the information of the knowledge database and decides the correct emotion for every sentence. The algorithm for automated mark up is tested against four different texts. The results of the two approaches are compared and discussed with respect to three main issues: relative adequacy of each one of the representations used, correctness and coverage of the proposed algorithms, and additional techniques and solutions that may be employed to improve the results.

Study of parameter identification using hybrid neural-genetic algorithm in electro-hydraulic servo system

NASA Astrophysics Data System (ADS)

Moon, Byung-Young

2005-12-01

The hybrid neural-genetic multi-model parameter estimation algorithm was demonstrated. This method can be applied to structured system identification of electro-hydraulic servo system. This algorithms consist of a recurrent incremental credit assignment(ICRA) neural network and a genetic algorithm. The ICRA neural network evaluates each member of a generation of model and genetic algorithm produces new generation of model. To evaluate the proposed method, electro-hydraulic servo system was designed and manufactured. The experiment was carried out to figure out the hybrid neural-genetic multi-model parameter estimation algorithm. As a result, the dynamic characteristics were obtained such as the parameters(mass, damping coefficient, bulk modulus, spring coefficient), which minimize total square error. The result of this study can be applied to hydraulic systems in industrial fields.

U.S. Army Research Laboratory (ARL) multimodal signatures database

NASA Astrophysics Data System (ADS)

Bennett, Kelly

2008-04-01

The U.S. Army Research Laboratory (ARL) Multimodal Signatures Database (MMSDB) is a centralized collection of sensor data of various modalities that are co-located and co-registered. The signatures include ground and air vehicles, personnel, mortar, artillery, small arms gunfire from potential sniper weapons, explosives, and many other high value targets. This data is made available to Department of Defense (DoD) and DoD contractors, Intel agencies, other government agencies (OGA), and academia for use in developing target detection, tracking, and classification algorithms and systems to protect our Soldiers. A platform independent Web interface disseminates the signatures to researchers and engineers within the scientific community. Hierarchical Data Format 5 (HDF5) signature models provide an excellent solution for the sharing of complex multimodal signature data for algorithmic development and database requirements. Many open source tools for viewing and plotting HDF5 signatures are available over the Web. Seamless integration of HDF5 signatures is possible in both proprietary computational environments, such as MATLAB, and Free and Open Source Software (FOSS) computational environments, such as Octave and Python, for performing signal processing, analysis, and algorithm development. Future developments include extending the Web interface into a portal system for accessing ARL algorithms and signatures, High Performance Computing (HPC) resources, and integrating existing database and signature architectures into sensor networking environments.

Computer program documentation: ISOCLS iterative self-organizing clustering program, program C094

NASA Technical Reports Server (NTRS)

Minter, R. T. (Principal Investigator)

1972-01-01

The author has identified the following significant results. This program implements an algorithm which, ideally, sorts a given set of multivariate data points into similar groups or clusters. The program is intended for use in the evaluation of multispectral scanner data; however, the algorithm could be used for other data types as well. The user may specify a set of initial estimated cluster means to begin the procedure, or he may begin with the assumption that all the data belongs to one cluster. The procedure is initiatized by assigning each data point to the nearest (in absolute distance) cluster mean. If no initial cluster means were input, all of the data is assigned to cluster 1. The means and standard deviations are calculated for each cluster.

Correlates of weapon carrying in school among adolescents in three countries.

PubMed

Stickley, Andrew; Koyanagi, Ai; Koposov, Roman; Blatný, Marek; Hrdlička, Michal; Schwab-Stone, Mary; Ruchkin, Vladislav

2015-01-01

To determine the factors associated with weapon carrying in school among Czech, Russian, and US adolescents. Logistic regression was used to analyze data drawn from the Social and Health Assessment (SAHA). Violent behavior (perpetration / victimization) was linked to adolescent weapon carrying in all countries. Substance use was associated with weapon carrying among boys in all countries. Greater parental warmth reduced the odds for weapon carrying among Czech and Russian adolescents. Associating with delinquent peers was important for weapon carrying only among US adolescents. Factors associated with weapon carrying in school vary among countries although violent behavior and substance use may be associated with weapon carrying across countries.

Analyses of battle casualties by weapon type aboard U.S. Navy warships.

PubMed

Blood, C G

1992-03-01

The number of casualties was determined for 513 incidents involving U.S. Navy warships sunk or damaged during World War II. Ship type and weapon were significant factors in determining the numbers of wounded and killed. Multiple weapon attacks and kamikazes yielded more wounded in action than other weapon types. Multiple weapons and torpedos resulted in a higher incidence of killed in action than other weapons. Penetrating wounds and burns were the most prominent injury types. Kamikaze attacks yielded significantly more burns than incidents involving bombs, gunfire, torpedos, mines, and multiple weapons. Mine explosions were responsible for more strains, sprains, and dislocations than the other weapon types.

Testing three explanations of the emergence of weapon carrying in peer context: the roles of aggression, victimization, and the social network.

PubMed

Dijkstra, Jan Kornelis; Gest, Scott D; Lindenberg, Siegwart; Veenstra, René; Cillessen, Antonius H N

2012-04-01

To examine the relative contribution of weapon carrying of peers, aggression, and victimization to weapon carrying of male and female adolescents over time. Data were derived from a population-based sample of male (N = 224) and female (N = 244) adolescents followed from grade 10 (M age = 15.5) to grade 11 (M age = 16.5). Peer networks were derived from best friend nominations. Self-reports were used to assess weapon carrying. Aggression and victimization were assessed using both self- and peer-reports. Use of dynamic social network modeling (SIENA) allowed prediction of weapon carrying in grade 11 as a function of weapon carrying of befriended peers, aggression, and victimization in grade 10, while selection processes and structural network effects (reciprocity and transitivity) were controlled for. Peer influence processes accounted for changes in weapon carrying over time. Self-reported victimization decreased weapon carrying 1 year later. Peer-reported victimization increased the likelihood of weapon carrying, particularly for highly aggressive adolescents. Boys were more likely to carry weapons than girls, but the processes associated with weapon carrying did not differ for boys and girls. These findings revealed that, in this population-based sample, weapon carrying of best friends, as well as aggression, contributed to the proliferation of weapons in friendship networks, suggesting processes of peer contagion as well as individual vulnerability to weapon carrying. Copyright © 2012 Society for Adolescent Health and Medicine. Published by Elsevier Inc. All rights reserved.

Weapon carrying and psychopathic-like features in a population-based sample of Finnish adolescents.

PubMed

Saukkonen, Suvi; Laajasalo, Taina; Jokela, Markus; Kivivuori, Janne; Salmi, Venla; Aronen, Eeva T

2016-02-01

We investigated the prevalence of juvenile weapon carrying and psychosocial and personality-related risk factors for carrying different types of weapons in a nationally representative, population-based sample of Finnish adolescents. Specifically, we aimed to investigate psychopathic-like personality features as a risk factor for weapon carrying. The participants were 15-16-year-old adolescents from the Finnish self-report delinquency study (n = 4855). Four different groups were formed based on self-reported weapon carrying: no weapon carrying, carrying knife, gun or other weapon. The associations between psychosocial factors, psychopathic-like features and weapon carrying were examined with multinomial logistic regression analysis. 9% of the participants had carried a weapon in the past 12 months. Adolescents with a history of delinquency, victimization and antisocial friends were more likely to carry weapons in general; however, delinquency and victimization were most strongly related to gun carrying, while perceived peer delinquency (antisocial friends) was most strongly related to carrying a knife. Better academic performance was associated with a reduced likelihood of carrying a gun and knife, while feeling secure correlated with a reduced likelihood of gun carrying only. Psychopathic-like features were related to a higher likelihood of weapon carrying, even after adjusting for other risk factors. The findings of the study suggest that adolescents carrying a weapon have a large cluster of problems in their lives, which may vary based on the type of weapon carried. Furthermore, psychopathic-like features strongly relate to a higher risk of carrying a weapon.

Customizing FP-growth algorithm to parallel mining with Charm++ library

NASA Astrophysics Data System (ADS)

Puścian, Marek

2017-08-01

This paper presents a frequent item mining algorithm that was customized to handle growing data repositories. The proposed solution applies Master Slave scheme to frequent pattern growth technique. Efficient utilization of available computation units is achieved by dynamic reallocation of tasks. Conditional frequent trees are assigned to parallel workers basing on their workload. Proposed enhancements have been successfully implemented using Charm++ library. This paper discusses results of the performance of parallelized FP-growth algorithm against different datasets. The approach has been illustrated with many experiments and measurements performed using multiprocessor and multithreaded computer.

A Spiking Neural Network in sEMG Feature Extraction.

PubMed

Lobov, Sergey; Mironov, Vasiliy; Kastalskiy, Innokentiy; Kazantsev, Victor

2015-11-03

We have developed a novel algorithm for sEMG feature extraction and classification. It is based on a hybrid network composed of spiking and artificial neurons. The spiking neuron layer with mutual inhibition was assigned as feature extractor. We demonstrate that the classification accuracy of the proposed model could reach high values comparable with existing sEMG interface systems. Moreover, the algorithm sensibility for different sEMG collecting systems characteristics was estimated. Results showed rather equal accuracy, despite a significant sampling rate difference. The proposed algorithm was successfully tested for mobile robot control.

MATSurv: multisensor air traffic surveillance system

NASA Astrophysics Data System (ADS)

Yeddanapudi, Murali; Bar-Shalom, Yaakov; Pattipati, Krishna R.; Gassner, Richard R.

1995-09-01

This paper deals with the design and implementation of MATSurv 1--an experimental Multisensor Air Traffic Surveillance system. The proposed system consists of a Kalman filter based state estimator used in conjunction with a 2D sliding window assignment algorithm. Real data from two FAA radars is used to evaluate the performance of this algorithm. The results indicate that the proposed algorithm provides a superior classification of the measurements into tracks (i.e., the most likely aircraft trajectories) when compared to the aircraft trajectories obtained using the measurement IDs (squawk or IFF code).

Perceived popularity of adolescents who use weapons in violence and adolescents who only carry weapons

PubMed Central

Wallace, Lacey N.

2017-01-01

Prior research has found that persistently delinquent youth or more violent youth were less popular than their less delinquent peers (Young, 2013). However, recent research has also found that weapon carrying is associated with being more popular in adolescence (Dijkstra et al., 2010). The present paper examines the perceived popularity of adolescents who carry weapons in comparison to those who both carry and use weapons in acts of violence or threatened violence. Data consist of two waves from the National Longitudinal Study of Adolescent to Adult Health. Analyses use OLS regression with lagged predictors. This paper found no differences in number of friends between weapon carriers and weapon users. However, among both male and female gang members, those who did not use or carry weapons (abstainers) named significantly fewer friends than weapon users. Among females, weapon abstainers both named and were named by significantly more people than weapon users. These differences were not observed for males. Implications of these results and directions for future research are discussed. PMID:29104446

Integrated optimization of location assignment and sequencing in multi-shuttle automated storage and retrieval systems under modified 2n-command cycle pattern

NASA Astrophysics Data System (ADS)

Yang, Peng; Peng, Yongfei; Ye, Bin; Miao, Lixin

2017-09-01

This article explores the integrated optimization problem of location assignment and sequencing in multi-shuttle automated storage/retrieval systems under the modified 2n-command cycle pattern. The decision of storage and retrieval (S/R) location assignment and S/R request sequencing are jointly considered. An integer quadratic programming model is formulated to describe this integrated optimization problem. The optimal travel cycles for multi-shuttle S/R machines can be obtained to process S/R requests in the storage and retrieval request order lists by solving the model. The small-sized instances are optimally solved using CPLEX. For large-sized problems, two tabu search algorithms are proposed, in which the first come, first served and nearest neighbour are used to generate initial solutions. Various numerical experiments are conducted to examine the heuristics' performance and the sensitivity of algorithm parameters. Furthermore, the experimental results are analysed from the viewpoint of practical application, and a parameter list for applying the proposed heuristics is recommended under different real-life scenarios.

Air gun wounding and current UK laws controlling air weapons.

PubMed

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.

Centroid tracker and aimpoint selection

NASA Astrophysics Data System (ADS)

Venkateswarlu, Ronda; Sujata, K. V.; Venkateswara Rao, B.

1992-11-01

Autonomous fire and forget weapons have gained importance to achieve accurate first pass kill by hitting the target at an appropriate aim point. Centroid of the image presented by a target in the field of view (FOV) of a sensor is generally accepted as the aimpoint for these weapons. Centroid trackers are applicable only when the target image is of significant size in the FOV of the sensor but does not overflow the FOV. But as the range between the sensor and the target decreases the image of the target will grow and finally overflow the FOV at close ranges and the centroid point on the target will keep on changing which is not desirable. And also centroid need not be the most desired/vulnerable point on the target. For hardened targets like tanks, proper aimpoint selection and guidance up to almost zero range is essential to achieve maximum kill probability. This paper presents a centroid tracker realization. As centroid offers a stable tracking point, it can be used as a reference to select the proper aimpoint. The centroid and the desired aimpoint are simultaneously tracked to avoid jamming by flares and also to take care of the problems arising due to image overflow. Thresholding of gray level image to binary image is a crucial step in centroid tracker. Different thresholding algorithms are discussed and a suitable algorithm is chosen. The real-time hardware implementation of centroid tracker with a suitable thresholding technique is presented including the interfacing to a multimode tracker for autonomous target tracking and aimpoint selection. The hardware uses very high speed arithmetic and programmable logic devices to meet the speed requirement and a microprocessor based subsystem for the system control. The tracker has been evaluated in a field environment.

Effects of Weapons on Aggressive Thoughts, Angry Feelings, Hostile Appraisals, and Aggressive Behavior: A Meta-Analytic Review of the Weapons Effect Literature.

PubMed

Benjamin, Arlin J; Kepes, Sven; Bushman, Brad J

2017-09-01

Guns are associated with aggression. A landmark 1967 study showed that simply seeing a gun can increase aggression-called the "weapons effect." This meta-analysis integrates the findings of weapons effect studies conducted from 1967 to 2017. It includes 162 effect-size estimates from 78 independent studies involving 7,668 participants. The theoretical framework used to explain the weapons effect was the General Aggression Model (GAM), which proposes three routes to aggression-cognitive, affective, and arousal. The GAM also proposes that hostile appraisals can facilitate aggression. As predicted by the GAM, the mere presence of weapons increased aggressive thoughts, hostile appraisals, and aggression, suggesting a cognitive route from weapons to aggression. Weapons did not significantly increase angry feelings. Only one study tested the effects of weapons on arousal. These findings also contribute to the debate about social priming by showing that incidental exposure to a stimulus (weapon) can affect subsequent related behavior (aggression).

Determining the Effectiveness of Incorporating Geographic Information Into Vehicle Performance Algorithms

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

Sera White

2012-04-01

This thesis presents a research study using one year of driving data obtained from plug-in hybrid electric vehicles (PHEV) located in Sacramento and San Francisco, California to determine the effectiveness of incorporating geographic information into vehicle performance algorithms. Sacramento and San Francisco were chosen because of the availability of high resolution (1/9 arc second) digital elevation data. First, I present a method for obtaining instantaneous road slope, given a latitude and longitude, and introduce its use into common driving intensity algorithms. I show that for trips characterized by >40m of net elevation change (from key on to key off), themore » use of instantaneous road slope significantly changes the results of driving intensity calculations. For trips exhibiting elevation loss, algorithms ignoring road slope overestimated driving intensity by as much as 211 Wh/mile, while for trips exhibiting elevation gain these algorithms underestimated driving intensity by as much as 333 Wh/mile. Second, I describe and test an algorithm that incorporates vehicle route type into computations of city and highway fuel economy. Route type was determined by intersecting trip GPS points with ESRI StreetMap road types and assigning each trip as either city or highway route type according to whichever road type comprised the largest distance traveled. The fuel economy results produced by the geographic classification were compared to the fuel economy results produced by algorithms that assign route type based on average speed or driving style. Most results were within 1 mile per gallon ({approx}3%) of one another; the largest difference was 1.4 miles per gallon for charge depleting highway trips. The methods for acquiring and using geographic data introduced in this thesis will enable other vehicle technology researchers to incorporate geographic data into their research problems.« less

Validation of an International Statistical Classification of Diseases and Related Health Problems 10th Revision Coding Algorithm for Hospital Encounters with Hypoglycemia.

PubMed

Hodge, Meryl C; Dixon, Stephanie; Garg, Amit X; Clemens, Kristin K

2017-06-01

To determine the positive predictive value and sensitivity of an International Statistical Classification of Diseases and Related Health Problems, 10th Revision, coding algorithm for hospital encounters concerning hypoglycemia. We carried out 2 retrospective studies in Ontario, Canada. We examined medical records from 2002 through 2014, in which older adults (mean age, 76) were assigned at least 1 code for hypoglycemia (E15, E160, E161, E162, E1063, E1163, E1363, E1463). The positive predictive value of the algorithm was calculated using a gold-standard definition (blood glucose value <4 mmol/L or physician diagnosis of hypoglycemia). To determine the algorithm's sensitivity, we used linked healthcare databases to identify older adults (mean age, 77) with laboratory plasma glucose values <4 mmol/L during a hospital encounter that took place between 2003 and 2011. We assessed how frequently a code for hypoglycemia was present. We also examined the algorithm's performance in differing clinical settings (e.g. inpatient vs. emergency department, by hypoglycemia severity). The positive predictive value of the algorithm was 94.0% (95% confidence interval 89.3% to 97.0%), and its sensitivity was 12.7% (95% confidence interval 11.9% to 13.5%). It performed better in the emergency department and in cases of more severe hypoglycemia (plasma glucose values <3.5 mmol/L compared with ≥3.5 mmol/L). Our hypoglycemia algorithm has a high positive predictive value but is limited in sensitivity. Although we can be confident that older adults who are assigned 1 of these codes truly had a hypoglycemia event, many episodes will not be captured by studies using administrative databases. Copyright © 2017 Diabetes Canada. Published by Elsevier Inc. All rights reserved.

Streaming fragment assignment for real-time analysis of sequencing experiments

PubMed Central

Roberts, Adam; Pachter, Lior

2013-01-01

We present eXpress, a software package for highly efficient probabilistic assignment of ambiguously mapping sequenced fragments. eXpress uses a streaming algorithm with linear run time and constant memory use. It can determine abundances of sequenced molecules in real time, and can be applied to ChIP-seq, metagenomics and other large-scale sequencing data. We demonstrate its use on RNA-seq data, showing greater efficiency than other quantification methods. PMID:23160280

FD/DAMA Scheme For Mobile/Satellite Communications

NASA Technical Reports Server (NTRS)

Yan, Tsun-Yee; Wang, Charles C.; Cheng, Unjeng; Rafferty, William; Dessouky, Khaled I.

1992-01-01

Integrated-Adaptive Mobile Access Protocol (I-AMAP) proposed to allocate communication channels to subscribers in first-generation MSAT-X mobile/satellite communication network. Based on concept of frequency-division/demand-assigned multiple access (FD/DAMA) where partition of available spectrum adapted to subscribers' demands for service. Requests processed, and competing requests resolved according to channel-access protocol, or free-access tree algorithm described in "Connection Protocol for Mobile/Satellite Communications" (NPO-17735). Assigned spectrum utilized efficiently.

32 CFR 552.104 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 3 2014-07-01 2014-07-01 false Disposition of confiscated/seized weapons. 552... RESERVATIONS AND NATIONAL CEMETERIES REGULATIONS AFFECTING MILITARY RESERVATIONS Firearms and Weapons § 552.104 Disposition of confiscated/seized weapons. All weapons, ammunition, explosives or other devices defined in...

32 CFR 552.104 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 3 2013-07-01 2013-07-01 false Disposition of confiscated/seized weapons. 552... RESERVATIONS AND NATIONAL CEMETERIES REGULATIONS AFFECTING MILITARY RESERVATIONS Firearms and Weapons § 552.104 Disposition of confiscated/seized weapons. All weapons, ammunition, explosives or other devices defined in...

32 CFR 552.104 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 32 National Defense 3 2010-07-01 2010-07-01 true Disposition of confiscated/seized weapons. 552... RESERVATIONS AND NATIONAL CEMETERIES REGULATIONS AFFECTING MILITARY RESERVATIONS Firearms and Weapons § 552.104 Disposition of confiscated/seized weapons. All weapons, ammunition, explosives or other devices defined in...

32 CFR 552.104 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 3 2012-07-01 2009-07-01 true Disposition of confiscated/seized weapons. 552... RESERVATIONS AND NATIONAL CEMETERIES REGULATIONS AFFECTING MILITARY RESERVATIONS Firearms and Weapons § 552.104 Disposition of confiscated/seized weapons. All weapons, ammunition, explosives or other devices defined in...

32 CFR 552.104 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 3 2011-07-01 2009-07-01 true Disposition of confiscated/seized weapons. 552... RESERVATIONS AND NATIONAL CEMETERIES REGULATIONS AFFECTING MILITARY RESERVATIONS Firearms and Weapons § 552.104 Disposition of confiscated/seized weapons. All weapons, ammunition, explosives or other devices defined in...

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

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-01

... Request; Chemical Weapons Convention Declaration and Report Handbook and Forms AGENCY: Bureau of Industry.... Abstract The Chemical Weapons Convention Implementation Act of 1998 and Commerce Chemical Weapons... Chemical Weapons Convention (CWC), an international arms control treaty. II. Method of Collection Submitted...

Ontological Problem-Solving Framework for Dynamically Configuring Sensor Systems and Algorithms

PubMed Central

Qualls, Joseph; Russomanno, David J.

2011-01-01

The deployment of ubiquitous sensor systems and algorithms has led to many challenges, such as matching sensor systems to compatible algorithms which are capable of satisfying a task. Compounding the challenges is the lack of the requisite knowledge models needed to discover sensors and algorithms and to subsequently integrate their capabilities to satisfy a specific task. A novel ontological problem-solving framework has been designed to match sensors to compatible algorithms to form synthesized systems, which are capable of satisfying a task and then assigning the synthesized systems to high-level missions. The approach designed for the ontological problem-solving framework has been instantiated in the context of a persistence surveillance prototype environment, which includes profiling sensor systems and algorithms to demonstrate proof-of-concept principles. Even though the problem-solving approach was instantiated with profiling sensor systems and algorithms, the ontological framework may be useful with other heterogeneous sensing-system environments. PMID:22163793

14 CFR 1204.1005 - Unauthorized introduction of firearms or weapons, explosives, or other dangerous materials.

Code of Federal Regulations, 2010 CFR

2010-01-01

... weapons, explosives, or other dangerous materials. 1204.1005 Section 1204.1005 Aeronautics and Space... Weapons or Dangerous Materials § 1204.1005 Unauthorized introduction of firearms or weapons, explosives... or causing to be introduced, or using firearms or other dangerous weapons, explosives or other...

14 CFR 1204.1005 - Unauthorized introduction of firearms or weapons, explosives, or other dangerous materials.

Code of Federal Regulations, 2013 CFR

2013-01-01

... weapons, explosives, or other dangerous materials. 1204.1005 Section 1204.1005 Aeronautics and Space... Weapons or Dangerous Materials § 1204.1005 Unauthorized introduction of firearms or weapons, explosives... or causing to be introduced, or using firearms or other dangerous weapons, explosives or other...

3 CFR - Continuation of the National Emergency With Respect to Weapons of Mass Destruction

Code of Federal Regulations, 2012 CFR

2012-01-01

... to Weapons of Mass Destruction Presidential Documents Other Presidential Documents Notice of November 9, 2011 Continuation of the National Emergency With Respect to Weapons of Mass Destruction On... United States posed by the proliferation of nuclear, biological, and chemical weapons (weapons of mass...

14 CFR 1204.1005 - Unauthorized introduction of firearms or weapons, explosives, or other dangerous materials.

Code of Federal Regulations, 2012 CFR

2012-01-01

... weapons, explosives, or other dangerous materials. 1204.1005 Section 1204.1005 Aeronautics and Space... Weapons or Dangerous Materials § 1204.1005 Unauthorized introduction of firearms or weapons, explosives... or causing to be introduced, or using firearms or other dangerous weapons, explosives or other...

32 CFR 552.130 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 3 2011-07-01 2009-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...

3 CFR - Continuation of the National Emergency With Respect to Weapons of Mass Destruction

Code of Federal Regulations, 2013 CFR

2013-01-01

... to Weapons of Mass Destruction Presidential Documents Other Presidential Documents Notice of November 1, 2012 Continuation of the National Emergency With Respect to Weapons of Mass Destruction On... United States posed by the proliferation of nuclear, biological, and chemical weapons (weapons of mass...

48 CFR 217.173 - Multiyear contracts for weapon systems.

Code of Federal Regulations, 2010 CFR

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

32 CFR 552.130 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2010 CFR

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

32 CFR 552.130 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 3 2013-07-01 2013-07-01 false 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...

14 CFR 1204.1005 - Unauthorized introduction of firearms or weapons, explosives, or other dangerous materials.

Code of Federal Regulations, 2011 CFR

2011-01-01

... weapons, explosives, or other dangerous materials. 1204.1005 Section 1204.1005 Aeronautics and Space... Weapons or Dangerous Materials § 1204.1005 Unauthorized introduction of firearms or weapons, explosives... or causing to be introduced, or using firearms or other dangerous weapons, explosives or other...

32 CFR 552.130 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 3 2012-07-01 2009-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...

32 CFR 552.130 - Disposition of confiscated/seized weapons.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 3 2014-07-01 2014-07-01 false 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...

Nuclear Weapons: Comprehensive Test Ban Treaty

DTIC Science & Technology

2007-07-12

done. Critics raised concerns about the implications of these policies for testing and new weapons. At present, Congress addresses nuclear weapon...future, but there are no plans to do so.’”7 Critics expressed concern about the implications of these policies for testing and new weapons. A statement by...opportunity to design and build new nuclear weapons, and abandon a ten-year-old moratorium on nuclear weapons testing.”8 Another critic felt that

Nuclear weapons modernizations

NASA Astrophysics Data System (ADS)

Kristensen, Hans M.

2014-05-01

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.

SPHINX--an algorithm for taxonomic binning of metagenomic sequences.

PubMed

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

2011-01-01

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

Advanced Techniques for Scene Analysis

DTIC Science & Technology

2010-06-01

robustness prefers a bigger intergration window to handle larger motions. The advantage of pyramidal implementation is that, while each motion vector dL...labeled SAR images. Now the previous algorithm leads to a more dedicated classifier for the particular target; however, our algorithm trades generality for...accuracy is traded for generality. 7.3.2 I-RELIEF Feature weighting transforms the original feature vector x into a new feature vector x′ by assigning each

Hierarchical Learning of Tree Classifiers for Large-Scale Plant Species Identification.

PubMed

Fan, Jianping; Zhou, Ning; Peng, Jinye; Gao, Ling

2015-11-01

In this paper, a hierarchical multi-task structural learning algorithm is developed to support large-scale plant species identification, where a visual tree is constructed for organizing large numbers of plant species in a coarse-to-fine fashion and determining the inter-related learning tasks automatically. For a given parent node on the visual tree, it contains a set of sibling coarse-grained categories of plant species or sibling fine-grained plant species, and a multi-task structural learning algorithm is developed to train their inter-related classifiers jointly for enhancing their discrimination power. The inter-level relationship constraint, e.g., a plant image must first be assigned to a parent node (high-level non-leaf node) correctly if it can further be assigned to the most relevant child node (low-level non-leaf node or leaf node) on the visual tree, is formally defined and leveraged to learn more discriminative tree classifiers over the visual tree. Our experimental results have demonstrated the effectiveness of our hierarchical multi-task structural learning algorithm on training more discriminative tree classifiers for large-scale plant species identification.

The Method for Assigning Priority Levels (MAPLe): A new decision-support system for allocating home care resources

PubMed Central

Hirdes, John P; Poss, Jeff W; Curtin-Telegdi, Nancy

2008-01-01

Background Home care plays a vital role in many health care systems, but there is evidence that appropriate targeting strategies must be used to allocate limited home care resources effectively. The aim of the present study was to develop and validate a methodology for prioritizing access to community and facility-based services for home care clients. Methods Canadian and international data based on the Resident Assessment Instrument – Home Care (RAI-HC) were analyzed to identify predictors for nursing home placement, caregiver distress and for being rated as requiring alternative placement to improve outlook. Results The Method for Assigning Priority Levels (MAPLe) algorithm was a strong predictor of all three outcomes in the derivation sample. The algorithm was validated with additional data from five other countries, three other provinces, and an Ontario sample obtained after the use of the RAI-HC was mandated. Conclusion The MAPLe algorithm provides a psychometrically sound decision-support tool that may be used to inform choices related to allocation of home care resources and prioritization of clients needing community or facility-based services. PMID:18366782

Fuzzy Classification of Ocean Color Satellite Data for Bio-optical Algorithm Constituent Retrievals

NASA Technical Reports Server (NTRS)

Campbell, Janet W.

1998-01-01

The ocean has been traditionally viewed as a 2 class system. Morel and Prieur (1977) classified ocean water according to the dominant absorbent particle suspended in the water column. Case 1 is described as having a high concentration of phytoplankton (and detritus) relative to other particles. Conversely, case 2 is described as having inorganic particles such as suspended sediments in high concentrations. Little work has gone into the problem of mixing bio-optical models for these different water types. An approach is put forth here to blend bio-optical algorithms based on a fuzzy classification scheme. This scheme involves two procedures. First, a clustering procedure identifies classes and builds class statistics from in-situ optical measurements. Next, a classification procedure assigns satellite pixels partial memberships to these classes based on their ocean color reflectance signature. These membership assignments can be used as the basis for a weighting retrievals from class-specific bio-optical algorithms. This technique is demonstrated with in-situ optical measurements and an image from the SeaWiFS ocean color satellite.

Implementation of the Hungarian Algorithm to Account for Ligand Symmetry and Similarity in Structure-Based Design

PubMed Central

2015-01-01

False negative docking outcomes for highly symmetric molecules are a barrier to the accurate evaluation of docking programs, scoring functions, and protocols. This work describes an implementation of a symmetry-corrected root-mean-square deviation (RMSD) method into the program DOCK based on the Hungarian algorithm for solving the minimum assignment problem, which dynamically assigns atom correspondence in molecules with symmetry. The algorithm adds only a trivial amount of computation time to the RMSD calculations and is shown to increase the reported overall docking success rate by approximately 5% when tested over 1043 receptor–ligand systems. For some families of protein systems the results are even more dramatic, with success rate increases up to 16.7%. Several additional applications of the method are also presented including as a pairwise similarity metric to compare molecules during de novo design, as a scoring function to rank-order virtual screening results, and for the analysis of trajectories from molecular dynamics simulation. The new method, including source code, is available to registered users of DOCK6 (http://dock.compbio.ucsf.edu). PMID:24410429

Testing an earthquake prediction algorithm

USGS Publications Warehouse

Kossobokov, V.G.; Healy, J.H.; Dewey, J.W.

1997-01-01

A test to evaluate earthquake prediction algorithms is being applied to a Russian algorithm known as M8. The M8 algorithm makes intermediate term predictions for earthquakes to occur in a large circle, based on integral counts of transient seismicity in the circle. In a retroactive prediction for the period January 1, 1985 to July 1, 1991 the algorithm as configured for the forward test would have predicted eight of ten strong earthquakes in the test area. A null hypothesis, based on random assignment of predictions, predicts eight earthquakes in 2.87% of the trials. The forward test began July 1, 1991 and will run through December 31, 1997. As of July 1, 1995, the algorithm had forward predicted five out of nine earthquakes in the test area, which success ratio would have been achieved in 53% of random trials with the null hypothesis.

Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time

PubMed Central

Zhao, Chuan-Li; Hsu, Hua-Feng

2014-01-01

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

Single machine scheduling and due date assignment with past-sequence-dependent setup time and position-dependent processing time.

PubMed

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

2014-01-01

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

15 CFR 742.18 - Chemical Weapons Convention (CWC or Convention).

Code of Federal Regulations, 2011 CFR

2011-01-01

... 15 Commerce and Foreign Trade 2 2011-01-01 2011-01-01 false Chemical Weapons Convention (CWC or... REGULATIONS CONTROL POLICY-CCL BASED CONTROLS § 742.18 Chemical Weapons Convention (CWC or Convention). States... Use of Chemical Weapons and on Their Destruction, also known as the Chemical Weapons Convention (CWC...

36 CFR 1002.4 - Weapons, traps and nets.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 36 Parks, Forests, and Public Property 3 2012-07-01 2012-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...

3 CFR - Continuation of Emergency With Respect to Weapons of Mass Destruction

Code of Federal Regulations, 2011 CFR

2011-01-01

... 3 The President 1 2011-01-01 2011-01-01 false Continuation of Emergency With Respect to Weapons of... Continuation of Emergency With Respect to Weapons of Mass Destruction On November 14, 1994, by Executive Order... of nuclear, biological, and chemical weapons (weapons of mass destruction) and the means of...

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

Code of Federal Regulations, 2012 CFR

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

32 CFR 552.124 - Transportation of privately owned weapons and ammunition.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 3 2011-07-01 2009-07-01 true Transportation of privately owned weapons and... owned weapons and ammunition. (a) Privately owned firearms and ammunition will be transported in the following manner: (1) Weapons, other than weapons being transported into Fort Lewis for the first time, may...

32 CFR 552.124 - Transportation of privately owned weapons and ammunition.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 3 2012-07-01 2009-07-01 true Transportation of privately owned weapons and... owned weapons and ammunition. (a) Privately owned firearms and ammunition will be transported in the following manner: (1) Weapons, other than weapons being transported into Fort Lewis for the first time, may...

32 CFR 552.124 - Transportation of privately owned weapons and ammunition.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 3 2014-07-01 2014-07-01 false Transportation of privately owned weapons and... owned weapons and ammunition. (a) Privately owned firearms and ammunition will be transported in the following manner: (1) Weapons, other than weapons being transported into Fort Lewis for the first time, may...

3 CFR - Continuation of Emergency With Respect to Weapons of Mass Destruction

Code of Federal Regulations, 2010 CFR

2010-01-01

... 3 The President 1 2010-01-01 2010-01-01 false Continuation of Emergency With Respect to Weapons of... Continuation of Emergency With Respect to Weapons of Mass Destruction On November 14, 1994, by Executive Order... of nuclear, biological, and chemical weapons (weapons of mass destruction) and the means of...

14 CFR § 1204.1005 - Unauthorized introduction of firearms or weapons, explosives, or other dangerous materials.

Code of Federal Regulations, 2014 CFR

2014-01-01

... weapons, explosives, or other dangerous materials. § 1204.1005 Section § 1204.1005 Aeronautics and Space... Weapons or Dangerous Materials § 1204.1005 Unauthorized introduction of firearms or weapons, explosives... description of the consequences for unauthorized introduction of firearms or weapons, explosives, or other...

32 CFR 552.124 - Transportation of privately owned weapons and ammunition.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 3 2013-07-01 2013-07-01 false Transportation of privately owned weapons and... owned weapons and ammunition. (a) Privately owned firearms and ammunition will be transported in the following manner: (1) Weapons, other than weapons being transported into Fort Lewis for the first time, may...

36 CFR 1002.4 - Weapons, traps and nets.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 36 Parks, Forests, and Public Property 3 2014-07-01 2014-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...

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

Code of Federal Regulations, 2013 CFR

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

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

Code of Federal Regulations, 2014 CFR

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

32 CFR 552.124 - Transportation of privately owned weapons and ammunition.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 32 National Defense 3 2010-07-01 2010-07-01 true Transportation of privately owned weapons and... owned weapons and ammunition. (a) Privately owned firearms and ammunition will be transported in the following manner: (1) Weapons, other than weapons being transported into Fort Lewis for the first time, may...

76 FR 30280 - Public Meeting To Discuss the Proposed Rule on Enhanced Weapons, Firearms Background Checks, and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-25

... Proposed Rule on Enhanced Weapons, Firearms Background Checks, and Security Event Notifications AGENCY... the proposed enhanced weapons rule, the two draft regulatory guides, and the draft weapons safety.... No formal comments on the proposed enhanced weapons rule or the draft guidance documents will be...

15 CFR 742.18 - Chemical Weapons Convention (CWC or Convention).

Code of Federal Regulations, 2013 CFR

2013-01-01

... 15 Commerce and Foreign Trade 2 2013-01-01 2013-01-01 false Chemical Weapons Convention (CWC or... REGULATIONS CONTROL POLICY-CCL BASED CONTROLS § 742.18 Chemical Weapons Convention (CWC or Convention). States... Use of Chemical Weapons and on Their Destruction, also known as the Chemical Weapons Convention (CWC...

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

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-03

... holders, and other stakeholders on a draft guidance document entitled ``Weapons Safety Assessment'' (WSA... weapons under the NRC's proposed rule titled ``Enhanced Weapons, Firearms Background Checks, and Security.... You should not include any site-specific security information in your comments. Federal rulemaking Web...

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

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-10

... proliferation of nuclear, biological, and chemical weapons (weapons of mass destruction) and the means of...--Continuation of the National Emergency With Respect to Weapons of Mass Destruction #0; #0; #0; Presidential... the National Emergency With Respect to Weapons of Mass Destruction On November 14, 1994, by Executive...

77 FR 66513 - Continuation of the National Emergency With Respect to Weapons of Mass Destruction

Federal Register 2010, 2011, 2012, 2013, 2014

2012-11-05

... proliferation of nuclear, biological, and chemical weapons (weapons of mass destruction) and the means of delivering such weapons. On July 28, 1998, the President issued Executive Order 13094 amending Executive... the National Emergency With Respect to Weapons of Mass Destruction On November 14, 1994, by Executive...

Fleet Assignment Using Collective Intelligence

NASA Technical Reports Server (NTRS)

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

2004-01-01

Airline fleet assignment involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of an agent-based integer optimization algorithm to a "cold start" fleet assignment problem. Results show that the optimizer can successfully solve such highly- constrained problems (129 variables, 184 constraints).

Cloud classification from satellite data using a fuzzy sets algorithm: A polar example

NASA Technical Reports Server (NTRS)

Key, J. R.; Maslanik, J. A.; Barry, R. G.

1988-01-01

Where spatial boundaries between phenomena are diffuse, classification methods which construct mutually exclusive clusters seem inappropriate. The Fuzzy c-means (FCM) algorithm assigns each observation to all clusters, with membership values as a function of distance to the cluster center. The FCM algorithm is applied to AVHRR data for the purpose of classifying polar clouds and surfaces. Careful analysis of the fuzzy sets can provide information on which spectral channels are best suited to the classification of particular features, and can help determine likely areas of misclassification. General agreement in the resulting classes and cloud fraction was found between the FCM algorithm, a manual classification, and an unsupervised maximum likelihood classifier.

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

NASA Astrophysics Data System (ADS)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Nonrigid synthetic aperture radar and optical image coregistration by combining local rigid transformations using a Kohonen network.

PubMed

Salehpour, Mehdi; Behrad, Alireza

2017-10-01

This study proposes a new algorithm for nonrigid coregistration of synthetic aperture radar (SAR) and optical images. The proposed algorithm employs point features extracted by the binary robust invariant scalable keypoints algorithm and a new method called weighted bidirectional matching for initial correspondence. To refine false matches, we assume that the transformation between SAR and optical images is locally rigid. This property is used to refine false matches by assigning scores to matched pairs and clustering local rigid transformations using a two-layer Kohonen network. Finally, the thin plate spline algorithm and mutual information are used for nonrigid coregistration of SAR and optical images.

Use of apparent thickness for preprocessing of low-frequency electromagnetic data in inversion-based multibarrier evaluation workflow

NASA Astrophysics Data System (ADS)

Omar, Saad; Omeragic, Dzevat

2018-04-01

The concept of apparent thicknesses is introduced for the inversion-based, multicasing evaluation interpretation workflow using multifrequency and multispacing electromagnetic measurements. A thickness value is assigned to each measurement, enabling the development of two new preprocessing algorithms to remove casing collar artifacts. First, long-spacing apparent thicknesses are used to remove, from the pipe sections, artifacts ("ghosts") caused by the transmitter crossing a casing collar or corrosion. Second, a collar identification, localization, and assignment algorithm is developed to enable robust inversion in collar sections. Last, casing eccentering can also be identified on the basis of opposite deviation of short-spacing phase and magnitude apparent thicknesses from the nominal value. The proposed workflow can handle an arbitrary number of nested casings and has been validated on synthetic and field data.

Enhancing Energy in Future Conventional Munition

NASA Astrophysics Data System (ADS)

Peiris, Suhithi

2017-06-01

Future conventional weapons are envisioned to contain more energy per volume than current weapons. Current weapons comprise of inert steel outer case, with inner volume for energetic materials, fuzing, sensor package, propulsion system, etc. Recent research on reactive materials (RM) & new energetics, and exploiting additive manufacturing can optimize the use of both mass and volume to achieve much higher energy in future weapons. For instance, replacing inert steel with RM of similar strength, additively manufacturing fuzing packages within the weapon form factor, and combing the whole with new energetics, will enable the same lethality effects from smaller weapons as obtained from today's larger weapons. This paper will elaborate on reactive materials and properties necessary for optimal utilization in various weapon features, and touch on other aspects of enhancing energy in future conventional munition.

Why Sexually Selected Weapons Are Not Ornaments.

PubMed

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.

Nuclear weapons modernizations

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

Kristensen, Hans M.

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 concludesmore » that new limits on nuclear modernizations are needed.« less

Circumstances around weapon injury in Cambodia after departure of a peacekeeping force: prospective cohort study

PubMed Central

Meddings, David R; O’Connor, Stephanie M

1999-01-01

Objective To examine the circumstances surrounding weapon injury and combatant status of those injured by weapons. Design Prospective cohort study. Setting Northwestern Cambodia after departure of United Nations peacekeeping force. Subjects 863 people admitted to hospital for weapon injuries over 12 months. Main outcome measures Annual incidence of weapon injury by time period; proportions of injuries inflicted as a result of interfactional combat (combat injuries) and outside such combat (non-combat injuries) by combatant status and weapon type. Results The annual incidence of weapon injuries was higher than the rate observed before the peacekeeping operation. 30% of weapon injuries occurred in contexts other than interfactional combat. Most commonly these were firearm injuries inflicted intentionally on civilians. Civilians accounted for 71% of those with non-combat injuries, 42% of those with combat related injuries, and 51% of those with weapon injuries of either type. Conclusions The incidence of weapon injuries remained high when the disarmament component of a peacekeeping operation achieved only limited success. Furthermore, injuries occurring outside the context of interfactional combat accounted for a substantial proportion of all weapon injuries, were experienced disproportionately by civilians, and were most likely to entail the intentional use of a firearm against a civilian. Key messagesThe study took place in Cambodia after a United Nations peacekeeping operation that achieved only limited success in disarmamentA substantial proportion of weapon injuries was inflicted in contexts unrelated to interfactional combatThese injuries were most commonly firearm injuries inflicted intentionally on civiliansWidespread availability of weapons can facilitate social violence PMID:10445922

Personnel Attrition Rates in Historical Land Combat Operations: Susceptibility and Vulnerability of Major Anatomical Regions

DTIC Science & Technology

1993-08-01

effectiveness , estimate personnel attr;i"on, perform studies and analyses. or assess protective equipment for personnel. i II CAA-RP-93-3 DEPARTMENT OF THE...weapons or weapons effects that are difficult to localize are excluded from the 1-1 CAA-RP-93-3 scope of this paper Some examples of the types of weapons...or weapon effects excluded atr" .;i,nical weapons (encompassing war gases and other toxic substances, flame weapons. and biological agents), nuclear

Research and Development for Technology Evolution Potential Forecasting System

NASA Astrophysics Data System (ADS)

Gao, Changqing; Cao, Shukun; Wang, Yuzeng; Ai, Changsheng; Ze, Xiangbo

Technology forecasting is a powerful weapon for many enterprises to gain an animate future. Evolutionary potential radar plot is a necessary step of some valuable methods to help the technology managers with right technical strategy. A software system for Technology Evolution Potential Forecasting (TEPF) with automatic radar plot drawing is introduced in this paper. The framework of the system and the date structure describing the concrete evolution pattern are illustrated in details. And the algorithm for radar plot drawing is researched. It is proved that the TEPF system is an effective tool during the technology strategy analyzing process with a referenced case study.

Transmit Designs for the MIMO Broadcast Channel With Statistical CSI

NASA Astrophysics Data System (ADS)

Wu, Yongpeng; Jin, Shi; Gao, Xiqi; McKay, Matthew R.; Xiao, Chengshan

2014-09-01

We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a near-optimal linear assignment matrix is derived. This reveals an interesting construction analogous to that of dirty-paper coding. In light of this, a low complexity transmission scheme is provided. Numerical examples illustrate the significant performance of the proposed low complexity scheme.

Target recognition in passive terahertz image of human body

NASA Astrophysics Data System (ADS)

Zhao, Ran; Zhao, Yuan-meng; Deng, Chao; Zhang, Cun-lin; Li, Yue

2014-11-01

THz radiation can penetrate through many nonpolar dielectric materials and can be used for nondestructive/noninvasive sensing and imaging of targets under nonpolar, nonmetallic covers or containers. Thus using THz systems to "see through" concealing barriers (i.e. packaging, corrugated cardboard, clothing) has been proposed as a new security screening method. Objects that can be detected by THz include concealed weapons, explosives, and chemical agents under clothing. Passive THz imaging system can detect THz wave from human body without transmit any electromagnetic wave, and the suspicious objects will become visible because the THz wave is blocked by this items. We can find out whether or not someone is carrying dangerous objects through this image. In this paper, the THz image enhancement, segmentation and contour extraction algorithms were studied to achieve effective target image detection. First, the terahertz images are enhanced and their grayscales are stretched. Then we apply global threshold segmentation to extract the target, and finally the targets are marked on the image. Experimental results showed that the algorithm proposed in this paper can extract and mark targets effectively, so that people can identify suspicious objects under clothing quickly. The algorithm can significantly improve the usefulness of the terahertz security apparatus.

Texture generation for use in synthetic infrared scenes

NASA Astrophysics Data System (ADS)

Ota, Clem Z.; Rollins, John M.; Bleiweiss, Max P.

1996-06-01

In the process of creating synthetic scenes for use in simulations/visualizations, texture is used as a surrogate to 'high' spatial definition. For example, if one were to measure the location of every blade of grass and all of the characteristics of each blade of grass in a lawn, then in the process of composing a scene of the lawn, it would be expected that the result would appear 'real;' however, because this process is excruciatingly laborious, various techniques have been devised to place the required details in the scene through the use of texturing. Experience gained during the recent Smart Weapons Operability Enhancement Joint Test and Evaluation (SWOE JT&E) has shown the need for higher fidelity texturing algorithms and a better parameterization of those that are in use. In this study, four aspects of the problem have been analyzed: texture extraction, texture insertion, texture metrics, and texture creation algorithms. The results of extracting real texture from an image, measuring it with a variety of metrics, and generating similar texture with three different algorithms is presented. These same metrics can be used to define clutter and to make comparisons between 'real' and synthetic (or artificial) scenes in an objective manner.

An evaluation of voice stress analysis techniques in a simulated AWACS environment

NASA Astrophysics Data System (ADS)

Jones, William A., Jr.

1990-08-01

The purpose was to determine if voice analysis algorithms are an effective measure of stress resulting from high workload. Fundamental frequency, frequency jitter, and amplitude shimmer algorithms were employed to measure the effects of stress in crewmember communications data in simulated AWACS mission scenarios. Two independent workload measures were used to identify levels of stress: a predictor model developed by the simulation author based upon scenario generated stimulus events; and the duration of communication for each weapons director, representative of the individual's response to the induced stress. Between eight and eleven speech samples were analyzed for each of the sixteen Air Force officers who participated in the study. Results identified fundamental frequency and frequency jitter as statistically significant vocal indicators of stress, while amplitude shimmer showed no signs of any significant relationship with workload or stress. Consistent with previous research, the frequency algorithm was identified as the most reliable measure. However, the results did not reveal a sensitive discrimination measure between levels of stress, but rather, did distinguish between the presence or absence of stress. The results illustrate a significant relationship between fundamental frequency and the effects of stress and also a significant inverse relationship with jitter, though less dramatic.

A Poor Man's Nuclear Deterrent: Assessing the Value of Radiological Weapons for State Actors

NASA Astrophysics Data System (ADS)

Donohue, Nathan

The threat of weapons of mass destruction is an issue which remains at the forefront on national security. Nuclear, chemical, and biological weapons are all considered very dangerous by both state and non-state actors. Radiological weapons exist in that same category yet are not held in the same regard; the reason that is given is that these types of weapons are not the weapons of mass destruction that the other three are. Instead, radiological weapons are better considered weapons of mass disruption. Accordingly, in the academic and policy literature there has been very little perceived value associated with such weapons for use by state actors. However the historical focus on the military efficacy of radiological weapons has obscured the obvious truth that they may pose significant value for state actors. What this research shows is that the explosion of a radiological weapon could disrupt a target area in ways which could cripple the economy of an adversary state and promote widespread fear concerning exposure to radiation. Any such attack would not only necessitate large scale evacuation, but cleanup, decontamination, demolition, territory exclusion, and relocation. Moreover, the effects of such an attack would be unlikely to remain an isolated event as evacuated and displaced citizens spread across the nation carrying both fear and residual radiation. All of these factors would only be compounded by a state actor's ability to not only develop such weapons, but to manufacture them in such a composition that contemporary examples of such weapons grossly underestimate their impact. Accordingly, radiological weapons could hold great value for any state actor wishing to pursue their development and to threaten their use. Moreover, "while RDDs may not be well suited as "military weapons" in the classic sense, the use of RDDs could be powerfully coercive."1 In that sense, state actors could even acquire radiological weapons for their deterrent value. 1James L. Ford, "Radiological Dispersal Devices: Assessing the Transnational Threat," Strategic Forum, No. 136, (March 1998), March 29, 2012, http://www.au.af.mil/au/awc/awcgate/ndu/forum136.htm.

36 CFR § 1002.4 - Weapons, traps and nets.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 36 Parks, Forests, and Public Property 3 2013-07-01 2012-07-01 true Weapons, traps and nets. Â... USE 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...

Environmental Effects of Weapons Technology, A Scientists' Institute for Public Information Workbook.

ERIC Educational Resources Information Center

McClintock, Michael; And Others

This collection of articles includes a general account of the environmental effects of modern weapons technology, a selection of news reports demonstrating the peacetime hazards of chemical and biological weapons, data on the physiological effects of the most common chemical weapons, a discussion of the hazards of biological weapons, a report of…

78 FR 67289 - Continuation of the National Emergency With Respect to the Proliferation of Weapons of Mass...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-12

... economy of the United States posed by the proliferation of nuclear, biological, and chemical weapons (weapons of mass destruction) and the means of delivering such weapons. On July 28, 1998, the President... November 7, 2013 Continuation of the National Emergency With Respect to the Proliferation of Weapons of...

Frequency Assignments for HFDF Receivers in a Search and Rescue Network

DTIC Science & Technology

1990-03-01

SAR problem where whether or not a signal is detected by RS or HFDF at the various stations is described by probabilities. Daskin assumes the...allows the problem to be formulated with a linear objective function (6:52-53). Daskin also developed a heuristic solution algorithm to solve this...en CM in o CM CM < I Q < - -.~- -^ * . . . ■ . ,■ . :ST.-.r . 5 Frequency Assignments for HFDF Receivers in a Search and

Macro-Scale Reactive Flow Model for High-Explosive Detonation in Support of ASCI Weapon Safety Milepost

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

Reaugh, J E

2002-01-03

Explosive grain-scale simulations are not practical for weapon safety simulations. Indeed for nearly ideal explosives with reaction zones of order 500 {micro}m, even reactive flow models are not practical for weapon safety simulations. By design, reactive flow models must resolve the reaction zone, which implies computational cells with dimension of order 50 {micro}m for such explosives. The desired result for a simulation in which the reaction zone is not resolved is that the explosive behaves as an ideal one. The pressure at the shock front rises to the Chapman-Jouget (CJ) pressure with a reaction zone dimension that is like thatmore » of a shock propagating in an unreactive medium, on the order of a few computational cells. It should propagate with the detonation velocity that is determined by the equation of state of the products. In the past, this was achieved in one dimensional simulations with ''beta-burn'', a method in which the extent of conversion to final product is proportional to the approach of the specific volume in the shock front to the specific volume of the CJ state. One drawback with this method is that there is a relatively long build-up to steady detonation that is typically 50 to 100 computational cells. The need for relatively coarsely zoned simulations in two dimensions lead to ''program-burn'' by which the time to detonation can be determined by a simple ray-tracing algorithm when there are no barriers or shadows. Complications arise in two and three dimensions to the extent that some calculations of the lighting time in complex geometry can give incorrect results. We sought to develop a model based on reactive flow that might help the needs of the Weapon Safety Simulation milepost. Important features of the model are: (1) That it be useable with any equation of state description of the explosive product gases including both JWL and LEOS table forms. (2) That it exhibits the desired dependence on zone size. We believe that the model described here does exhibit these features.« less

The role of charity care and primary care physician assignment on ED use in homeless patients.

PubMed

Wang, Hao; Nejtek, Vicki A; Zieger, Dawn; Robinson, Richard D; Schrader, Chet D; Phariss, Chase; Ku, Jocelyn; Zenarosa, Nestor R

2015-08-01

Homeless patients are a vulnerable population with a higher incidence of using the emergency department (ED) for noncrisis care. Multiple charity programs target their outreach toward improving the health of homeless patients, but few data are available on the effectiveness of reducing ED recidivism. The aim of this study is to determine whether inappropriate ED use for nonemergency care may be reduced by providing charity insurance and assigning homeless patients to a primary care physician (PCP) in an outpatient clinic setting. A retrospective medical records review of homeless patients presenting to the ED and receiving treatment between July 2013 and June 2014 was completed. Appropriate vs inappropriate use of the ED was determined using the New York University ED Algorithm. The association between patients with charity care coverage, PCP assignment status, and appropriate vs inappropriate ED use was analyzed and compared. Following New York University ED Algorithm standards, 76% of all ED visits were deemed inappropriate with approximately 77% of homeless patients receiving charity care and 74% of patients with no insurance seeking noncrisis health care in the ED (P=.112). About 50% of inappropriate ED visits and 43.84% of appropriate ED visits occurred in patients with a PCP assignment (P=.019). Both charity care homeless patients and those without insurance coverage tend to use the ED for noncrisis care resulting in high rates of inappropriate ED use. Simply providing charity care and/or PCP assignment does not seem to sufficiently reduce inappropriate ED use in homeless patients. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

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

NASA Astrophysics Data System (ADS)

Kwok, Kwan S.; Driessen, Brian J.; Phillips, Cynthia A.; Tovey, Craig A.

1997-09-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. We 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 we 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. Solution 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. We have found these mobile robot problems to be a very interesting application of network optimization methods, and we expect this to be a fruitful area for future research.

Multiple exaggerated weapon morphs: a novel form of male polymorphism in harvestmen.

PubMed

Painting, Christina J; Probert, Anna F; Townsend, Daniel J; Holwell, Gregory I

2015-11-06

Alternative reproductive tactics in animals are commonly associated with distinct male phenotypes resulting in polymorphism of sexually selected weapons such as horns and spines. Typically, morphs are divided between small (unarmed) and large (armed) males according to one or more developmental thresholds in association with body size. Here, we describe remarkable weapon trimorphism within a single species, where two exaggerated weapon morphs and a third morph with reduced weaponry are present. Male Pantopsalis cheliferoides harvestmen display exaggerated chelicerae (jaws) which are highly variable in length among individuals. Across the same body size spectrum, however, some males belong to a distinct second exaggerated morph which possesses short, broad chelicerae. Multiple weapon morphs in a single species is a previously unknown phenomenon and our findings have significant implications for understanding weapon diversity and maintenance of polymorphism. Specifically, this species will be a valuable model for testing how weapons diverge by being able to test directly for the circumstances under which a certain weapon type is favoured and how weapon shape relates to performance.

Results of field testing with the FightSight infrared-based projectile tracking and weapon-fire characterization technology

NASA Astrophysics Data System (ADS)

Snarski, Steve; Menozzi, Alberico; Sherrill, Todd; Volpe, Chris; Wille, Mark

2010-04-01

This paper describes experimental results from recent live-fire data collects that demonstrate the capability of a prototype system for projectile detection and tracking. This system, which is being developed at Applied Research Associates, Inc., under the FightSight program, consists of a high-speed thermal camera and sophisticated image processing algorithms to detect and track projectiles. The FightSight operational vision is automated situational intelligence to detect, track, and graphically map large-scale firefights and individual shooting events onto command and control (C2) systems in real time (shot location and direction, weapon ID, movements and trends). Gaining information on enemy-fire trajectories allows educated inferences on the enemy's intent, disposition, and strength. Our prototype projectile detection and tracking system has been tested at the Joint Readiness Training Center (Ft Polk, LA) during live-fire convoy and mortar registration exercises, in the summer of 2009. It was also tested during staged military-operations- on-urban-terrain (MOUT) firefight events at Aberdeen Test Center (Aberdeen, MD) under the Hostile Fire Defeat Army Technology Objective midterm experiment, also in the summer of 2009, where we introduced fusion with acoustic and EO sensors to provide 3D localization and near-real time display of firing events. Results are presented in this paper that demonstrate effective and accurate detection and localization of weapon fire (5.56mm, 7.62mm, .50cal, 81/120mm mortars, 40mm) in diverse and challenging environments (dust, heat, day and night, rain, arid open terrain, urban clutter). FightSight's operational capabilities demonstrated under these live-fire data collects can support closecombat scenarios. As development continues, FightSight will be able to feed C2 systems with a symbolic map of enemy actions.

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

PubMed

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.

An algorithm for the arithmetic classification of multilattices.

PubMed

Indelicato, Giuliana

2013-01-01

A procedure for the construction and the classification of monoatomic multilattices in arbitrary dimension is developed. The algorithm allows one to determine the location of the points of all monoatomic multilattices with a given symmetry, or to determine whether two assigned multilattices are arithmetically equivalent. This approach is based on ideas from integral matrix theory, in particular the reduction to the Smith normal form, and can be coded to provide a classification software package.

Your Career and Nuclear Weapons: A Guide for Young Scientists and Engineers.

ERIC Educational Resources Information Center

Albrecht, Andreas; And Others

This four-part booklet examines various issues related to nuclear weapons and how they will affect an individual working as a scientist or engineer. It provides information about the history of nuclear weapons, about the weapons industry which produces them, and about new weapons programs. Issues are raised so that new or future graduates may make…

The Association Between Weapon Carrying and Health Risk Behaviors Among Adolescent Students in Bangkok, Thailand.

PubMed

Saiphoklang, On-Anong; Wongboonsin, Kua; Wongboonsin, Patcharawalai; Perngparn, Usaneya; Cottler, Linda B

2015-07-30

Carrying weapons is a significant social and public health problem worldwide, especially among adolescents. The present study examined the association between weapon carrying and related risk behaviors among Thai adolescents. A cross-sectional study of 2,588 high school and vocational school students aged 11 to 19 years from 26 schools in Bangkok, Thailand, was conducted in 2014. This study found that 7.8% of youth reported having carried a weapon in the past 12 months. The high prevalence of weapon carrying was reported by male students, and males were more likely to have reported carrying a weapon than females. The association between weapon carrying and the health risk behaviors like drinking, smoking, any drug use, and physical fighting were significant with higher odds of weapon carrying in all models. Among males, weapon carrying was related to drinking and smoking, any drug use, physical fighting, and school type. Among females, suicidal thoughts were significantly related along with drinking and smoking, any drug use, and physical fighting. Having a mother who used substances was significant only among females. These data could be used for further interventions about weapon carrying to reduce violence. © The Author(s) 2015.

A method of operation scheduling based on video transcoding for cluster equipment

NASA Astrophysics Data System (ADS)

Zhou, Haojie; Yan, Chun

2018-04-01

Because of the cluster technology in real-time video transcoding device, the application of facing the massive growth in the number of video assignments and resolution and bit rate of diversity, task scheduling algorithm, and analyze the current mainstream of cluster for real-time video transcoding equipment characteristics of the cluster, combination with the characteristics of the cluster equipment task delay scheduling algorithm is proposed. This algorithm enables the cluster to get better performance in the generation of the job queue and the lower part of the job queue when receiving the operation instruction. In the end, a small real-time video transcode cluster is constructed to analyze the calculation ability, running time, resource occupation and other aspects of various algorithms in operation scheduling. The experimental results show that compared with traditional clustering task scheduling algorithm, task delay scheduling algorithm has more flexible and efficient characteristics.

Weapon use increases the severity of domestic violence but neither weapon use nor firearm access increases the risk or severity of recidivism.

PubMed

Folkes, Stephanie E F; Hilton, N Zoe; Harris, Grant T

2013-04-01

Use of weapons is a risk factor for domestic violence severity, especially lethality. It is not clear, however, whether access to firearms itself increases assault severity, or whether it is characteristic of a subgroup of offenders who are more likely to commit severe and repeated domestic assault. This reanalysis of 1,421 police reports of domestic violence by men found that 6% used a weapon during the assault and 8% had access to firearms. We expected that firearm use would be rare compared to other weapons and that actual weapon use rather than firearm access would increase the severity of domestic assaults. Firearm access was associated with assault severity, but this was mostly attributable to use of nonfirearm weapons. Weapon use was associated with older age, lower education, and relationship history as well as to assault severity. Victims were most concerned about future assaults following threats and actual injuries. Although firearm access and weapon use were related to actuarial risk of domestic violence recidivism, neither predicted the occurrence or severity of recidivism. We conclude that, consistent with previous research in the United States and Canada, firearm use in domestic violence is uncommon even among offenders with known firearm access. Weapon use is characteristic of a subgroup of offenders who commit more severe domestic violence, and seizure of weapons may be an effective intervention.

The weapon focus effect is weaker with Black versus White male perpetrators.

PubMed

Pickel, Kerri L; Sneyd, Danielle E

2018-01-01

We compared the influence of a weapon's presence on eyewitnesses' memory for a White versus a Black male perpetrator. Prior data indicate that unusual objects in visual scenes attract attention and that a weapon's effect depends on how unusual it seems within the context in which it appears. Therefore, given the stereotype linking Black men and weapons, we predicted a weaker weapon focus effect with the Black perpetrator. The results of Experiment 1 supported this hypothesis using White and Black witnesses. Moreover, in Experiment 2 the weapon focus effect became nonsignificant when the Black perpetrator wore a style of clothing that is strongly associated with Black men. We propose that observing an armed Black perpetrator automatically activates a stereotype linking Black men with weapons and crime, which in turn reduces the perceived unusualness of the weapon and thus its ability to attract attention.

Weapon Possession Among College Students: A Study From a Midwestern University.

PubMed

Jang, Hyunseok; Kang, Ji Hyon; Dierenfeldt, Rick; Lindsteadt, Greg

2015-10-01

Weapon possession on college campuses causes great concern, but there remains a lack of research examining the determinants of this phenomenon. Previous studies addressing weapon possession have primarily focused on either K-12 or the general adult population. Unlike previous studies, this study examined the weapon possession among college students using data collected from a mid-sized university in Missouri, and 451 students participated. Weapon possession and other theoretical factors were measured through the self-administered survey. Logistical regression analysis revealed that weapon socialization was the most significant factor in predicting student weapon carrying. Also, gender and age were significant factors in explaining campus-based weapon possession. This research has a limitation with generalizability because the data were collected from only a single university with convenient sampling. Future studies need to cover a wider range of college students from a variety of different universities with random sampling. © The Author(s) 2014.

Weapons used by juveniles and adult offenders in U.S. parricide cases.

PubMed

Heide, Kathleen M; Petee, Thomas A

2007-11-01

In recent decades, attention has focused on juveniles who kill their parents. Research has indicated that increases in juvenile homicide have been associated with the availability of firearms, but little is known about the weapons juveniles use to kill their parents and whether their weapon usage is different from that of adult children who kill their parents. This article uses Supplementary Homicide Report data for the 24-year period 1976 to 1999 to investigate weapons selected by parricide offenders to kill biological mothers and fathers. Significant differences were found in the weapons used in matricide and patricide incidents and in the weapons selected by juvenile and adult offenders. A comparison with an earlier study by Heide revealed that weapon usage in parricide events is stable. Differences found in both studies between weapons used to kill parents and offender age are consistent with a physical strength hypothesis proposed by Heide in 1993.

Towards a tactical nuclear weapons treaty? Is There a Role of IAEA Tools of Safeguards?

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

Saunders, Emily C.; Rowberry, Ariana N.; Fearey, Bryan L.

2012-07-12

In recent years, there is growing interest in formal negotiations on non-strategic or tactical nuclear weapons. With the negotiations of New START, there has been much speculation that a tactical nuclear weapons treaty should be included in the follow on to New START. This paper examines the current policy environment related to tactical weapons and some of the issues surrounding the definition of tactical nuclear weapons. We then map out the steps that would need to be taken in order to begin discussions on a tactical nuclear weapons treaty. These steps will review the potential role of the IAEA inmore » verification of a tactical nuclear weapons treaty. Specifically, does IAEA involvement in various arms control treaties serve as a useful roadmap on how to overcome some of the issues pertaining to a tactical nuclear weapons treaty?« less

Vertical nuclear proliferation.

PubMed

Sidel, Victor W

2007-01-01

All the nuclear-weapon states are working to develop new nuclear-weapon systems and upgrade their existing ones. Although the US Congress has recently blocked further development of small nuclear weapons and earth-penetrating nuclear weapons, the United States is planning a range of new warheads under the Reliable Replacement Warhead programme, and renewing its nuclear weapons infrastructure. The United Kingdom is spending 1 billion pounds sterling on updating the Atomic Weapons Establishment at Aldermaston, and about 20 billion pounds sterling on replacing its Vanguard submarines and maintaining its Trident warhead stockpile. The US has withdrawn from the Anti-Ballistic Missile Treaty and plans to install missile defence systems in Poland and the Czech Republic; Russia threatens to upgrade its nuclear countermeasures. The nuclear-weapon states should comply with their obligations under Article VI of the Non-Proliferation Treaty, as summarised in the 13-point plan agreed at the 2000 NPT Review Conference, and they should negotiate a Nuclear Weapons Convention.

NCTR using a polarization-agile coherent radar system

NASA Astrophysics Data System (ADS)

Walton, E. K.; Moffatt, D. L.; Garber, F. D.; Kamis, A.; Lai, C. Y.

1986-01-01

This report describes the results of the first year of a research project performed by the Ohio State University ElectroScience Laboratory (OSU/ESL) for the Naval Weapons Center (NWC). The goal of this project is to explore the use of the polarization properties of the signal scattered from a radar target for the purpose of radar target identification. Various radar target identification algorithms were applied to the case of a full polarization coherent radar system, and were tested using a specific data base and noise model. The data base used to test the performance of the radar target identification algorithms developed here is a unique set of measurements made on scale models of aircraft. Measurements were made using the OSU/ESL Compact Radar Measurement Range. The range was operated in a broad-band (1-12 GHZ) mode and the full polarization matrix was measured. Calibrated values (amplitude and phase) of the RCS for the three polarization states were thus available. The polarization states are listed below.

Optimized passive sonar placement to allow improved interdiction

NASA Astrophysics Data System (ADS)

Johnson, Bruce A.; Matthews, Cameron

2016-05-01

The Art Gallery Problem (AGP) is the name given to a constrained optimization problem meant to determine the maximum amount of sensor coverage while utilizing the minimum number of resources. The AGP is significant because a common issue among surveillance and interdiction systems is obtaining an understanding of the optimal position of sensors and weapons in advance of enemy combatant maneuvers. The implication that an optimal position for a sensor to observe an event or for a weapon to engage a target autonomously is usually very clear after the target has passed, but for autonomous systems the solution must at least be conjectured in advance for deployment purposes. This abstract applies the AGP as a means to solve where best to place underwater sensor nodes such that the amount of information acquired about a covered area is maximized while the number of resources used to gain that information is minimized. By phrasing the ISR/interdiction problem this way, the issue is addressed as an instance of the AGP. The AGP is a member of a set of computational problems designated as nondeterministic polynomial-time (NP)-hard. As a member of this set, the AGP shares its members' defining feature, namely that no one has proven that there exists a deterministic algorithm providing a computationally-tractable solution to the AGP within a finite amount of time. At best an algorithm meant to solve the AGP can asymptotically approach perfect coverage with minimal resource usage but providing perfect coverage would either break the minimal resource usage constraint or require an exponentially-growing amount of time. No perfectly-optimal solution yet exists to the AGP, however, approximately optimal solutions to the AGP can approach complete area or barrier coverage while simultaneously minimizing the number of sensors and weapons utilized. A minimal number of underwater sensor nodes deployed can greatly increase the Mean Time Between Operational Failure (MTBOF) and logistical footprint. The resulting coverage optimizes the likelihood of encounter given an arbitrary sensor profile and threat from a free field statistical model approach. The free field statistical model is particularly applicable to worst case scenario modeling in open ocean operational profiles where targets to do not follow a particular pattern in any of the modeled dimensions. We present an algorithmic testbed which shows how to achieve approximately optimal solutions to the AGP for a network of underwater sensor nodes with or without effector systems for engagement while operating under changing environmental circumstances. The means by which we accomplish this goal are three-fold: 1) Develop a 3D model for the sonar signal propagating through the underwater environment 2) Add rigorous physics-based modeling of environmental events which can affect sensor information acquisition 3) Provide innovative solutions to the AGP which account for the environmental circumstances affecting sensor performance.

Integration of Irma tactical scene generator into directed-energy weapon system simulation

NASA Astrophysics Data System (ADS)

Owens, Monte A.; Cole, Madison B., III; Laine, Mark R.

2003-08-01

Integrated high-fidelity physics-based simulations that include engagement models, image generation, electro-optical hardware models and control system algorithms have previously been developed by Boeing-SVS for various tracking and pointing systems. These simulations, however, had always used images with featureless or random backgrounds and simple target geometries. With the requirement to engage tactical ground targets in the presence of cluttered backgrounds, a new type of scene generation tool was required to fully evaluate system performance in this challenging environment. To answer this need, Irma was integrated into the existing suite of Boeing-SVS simulation tools, allowing scene generation capabilities with unprecedented realism. Irma is a US Air Force research tool used for high-resolution rendering and prediction of target and background signatures. The MATLAB/Simulink-based simulation achieves closed-loop tracking by running track algorithms on the Irma-generated images, processing the track errors through optical control algorithms, and moving simulated electro-optical elements. The geometry of these elements determines the sensor orientation with respect to the Irma database containing the three-dimensional background and target models. This orientation is dynamically passed to Irma through a Simulink S-function to generate the next image. This integrated simulation provides a test-bed for development and evaluation of tracking and control algorithms against representative images including complex background environments and realistic targets calibrated using field measurements.

Tactical Nuclear Weapons: Their Purpose and Placement

DTIC Science & Technology

2015-06-01

War II, nuclear scientists argued against the development of fusion weapons .3 In the 1970s, politicians debated the use of neutron bombs, weapons ...Tactical Nuclear Weapons : Their Purpose and Placement BY EDWARD G. FERGUSON A THESIS SUBMITTED TO THE FACULTY OF THE...This study answers the question -- Why does America have tactical nuclear weapons (TNWs) in Europe today? – treating America and the North

Performance calculation and simulation system of high energy laser weapon

NASA Astrophysics Data System (ADS)

Wang, Pei; Liu, Min; Su, Yu; Zhang, Ke

2014-12-01

High energy laser weapons are ready for some of today's most challenging military applications. Based on the analysis of the main tactical/technical index and combating process of high energy laser weapon, a performance calculation and simulation system of high energy laser weapon was established. Firstly, the index decomposition and workflow of high energy laser weapon was proposed. The entire system was composed of six parts, including classical target, platform of laser weapon, detect sensor, tracking and pointing control, laser atmosphere propagation and damage assessment module. Then, the index calculation modules were designed. Finally, anti-missile interception simulation was performed. The system can provide reference and basis for the analysis and evaluation of high energy laser weapon efficiency.

75 FR 68671 - Continuation of Emergency With Respect to Weapons of Mass Destruction

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-08

... the United States posed by the proliferation of nuclear, biological, and chemical weapons (weapons of... Weapons of Mass Destruction #0; #0; #0; Presidential Documents #0; #0; #0;#0;Federal Register / Vol. 75... [[Page 68673

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

PubMed

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.

Aggression and attitudes to time and risk in weapon-using violent offenders.

PubMed

Brennan, Iain R; Moore, Simon C; Shepherd, Jonathan P

2010-08-15

The use of weapons in violence increases both the severity of harm to victims and the severity of legal consequences for offenders, but little is known of the characteristics of violent offenders who choose to use weapons. Levels of anger, attitude to risk, time discounting, and antisocial history among a sample of weapon-using violent offenders (n=15) were compared to violent offenders who had not used a weapon (n=10) and nonviolent offenders (n=15). Results showed that weapon-using violent offenders displayed greater trait aggression and were more risk seeking than other offender types. In addition, weapon-using violent offenders were first convicted at an earlier age and truanted from school more frequently compared to other offender types. The results indicate that weapon users are more aggressive and more risk taking, but no more present focused than other violent and nonviolent offenders. Further research into the cognitive and social factors that influence weapon use is required if this dangerous behavior is to be reduced. Copyright (c) 2009 Elsevier Ireland Ltd. All rights reserved.

Multiple exaggerated weapon morphs: a novel form of male polymorphism in harvestmen

PubMed Central

Painting, Christina J.; Probert, Anna F.; Townsend, Daniel J.; Holwell, Gregory I.

2015-01-01

Alternative reproductive tactics in animals are commonly associated with distinct male phenotypes resulting in polymorphism of sexually selected weapons such as horns and spines. Typically, morphs are divided between small (unarmed) and large (armed) males according to one or more developmental thresholds in association with body size. Here, we describe remarkable weapon trimorphism within a single species, where two exaggerated weapon morphs and a third morph with reduced weaponry are present. Male Pantopsalis cheliferoides harvestmen display exaggerated chelicerae (jaws) which are highly variable in length among individuals. Across the same body size spectrum, however, some males belong to a distinct second exaggerated morph which possesses short, broad chelicerae. Multiple weapon morphs in a single species is a previously unknown phenomenon and our findings have significant implications for understanding weapon diversity and maintenance of polymorphism. Specifically, this species will be a valuable model for testing how weapons diverge by being able to test directly for the circumstances under which a certain weapon type is favoured and how weapon shape relates to performance. PMID:26542456

Testing the accuracy of redshift-space group-finding algorithms

NASA Astrophysics Data System (ADS)

Frederic, James J.

1995-04-01

Using simulated redshift surveys generated from a high-resolution N-body cosmological structure simulation, we study algorithms used to identify groups of galaxies in redshift space. Two algorithms are investigated; both are friends-of-friends schemes with variable linking lengths in the radial and transverse dimenisons. The chief difference between the algorithms is in the redshift linking length. The algorithm proposed by Huchra & Geller (1982) uses a generous linking length designed to find 'fingers of god,' while that of Nolthenius & White (1987) uses a smaller linking length to minimize contamination by projection. We find that neither of the algorithms studied is intrinsically superior to the other; rather, the ideal algorithm as well as the ideal algorithm parameters depends on the purpose for which groups are to be studied. The Huchra & Geller algorithm misses few real groups, at the cost of including some spurious groups and members, while the Nolthenius & White algorithm misses high velocity dispersion groups and members but is less likely to include interlopers in its group assignments. Adjusting the parameters of either algorithm results in a trade-off between group accuracy and completeness. In a companion paper we investigate the accuracy of virial mass estimates and clustering properties of groups identified using these algorithms.

An Overview of Major Terrestrial, Celestial, and Temporal Coordinate Systems for Target Tracking

DTIC Science & Technology

2016-08-10

interp and Subroutines) http://hpiers.obspm.fr/eop-pc/index.php?index=models General Software for Astronomy and Time Conversions The IAU’s Standards...of Fundamental Astronomy Software [146] http://www.iausofa.org Software for Optimal 2D Assignment An overview of 2D assignment algorithms; the... Astronomy (SOFA) library were used to change the epoch of the data. The points in red are at the epoch of the Hipparcos catalog (1994.25 TT), and 20

A Genetic Algorithm Approach to Door Assignment in Breakbulk Terminals

DOT National Transportation Integrated Search

2001-08-23

Commercial vehicle regulation and enforcement is a necessary and important function of state governments. Through regulation, states promote highway safety, ensure that motor carriers have the proper licenses and operating permits, and collect taxes ...

DESIGNING PROCESSES FOR ENVIRONMENTAL PROBLEMS

EPA Science Inventory

Designing for the environment requires consideration of environmental impacts. The Generalized WAR Algorithm is the methodology that allows the user to evaluate the potential environmental impact of the design of a chemical process. In this methodology, chemicals are assigned val...

Virtual optical network mapping and core allocation in elastic optical networks using multi-core fibers

NASA Astrophysics Data System (ADS)

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

2017-11-01

Virtualization technology can greatly improve the efficiency of the networks by allowing the virtual optical networks to share the resources of the physical networks. However, it will face some challenges, such as finding the efficient strategies for virtual nodes mapping, virtual links mapping and spectrum assignment. It is even more complex and challenging when the physical elastic optical networks using multi-core fibers. To tackle these challenges, we establish a constrained optimization model to determine the optimal schemes of optical network mapping, core allocation and spectrum assignment. To solve the model efficiently, tailor-made encoding scheme, crossover and mutation operators are designed. Based on these, an efficient genetic algorithm is proposed to obtain the optimal schemes of the virtual nodes mapping, virtual links mapping, core allocation. The simulation experiments are conducted on three widely used networks, and the experimental results show the effectiveness of the proposed model and algorithm.

Constant Communities in Complex Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Tanmoy; Srinivasan, Sriram; Ganguly, Niloy; Bhowmick, Sanjukta; Mukherjee, Animesh

2013-05-01

Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.

Performance tradeoffs in static and dynamic load balancing strategies

NASA Technical Reports Server (NTRS)

Iqbal, M. A.; Saltz, J. H.; Bokhart, S. H.

1986-01-01

The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but sub-optimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the other three strategies.

Random synaptic feedback weights support error backpropagation for deep learning

NASA Astrophysics Data System (ADS)

Lillicrap, Timothy P.; Cownden, Daniel; Tweed, Douglas B.; Akerman, Colin J.

2016-11-01

The brain processes information through multiple layers of neurons. This deep architecture is representationally powerful, but complicates learning because it is difficult to identify the responsible neurons when a mistake is made. In machine learning, the backpropagation algorithm assigns blame by multiplying error signals with all the synaptic weights on each neuron's axon and further downstream. However, this involves a precise, symmetric backward connectivity pattern, which is thought to be impossible in the brain. Here we demonstrate that this strong architectural constraint is not required for effective error propagation. We present a surprisingly simple mechanism that assigns blame by multiplying errors by even random synaptic weights. This mechanism can transmit teaching signals across multiple layers of neurons and performs as effectively as backpropagation on a variety of tasks. Our results help reopen questions about how the brain could use error signals and dispel long-held assumptions about algorithmic constraints on learning.

Hierarchical planning for a surface mounting machine placement.

PubMed

Zeng, You-jiao; Ma, Deng-ze; Jin, Ye; Yan, Jun-qi

2004-11-01

For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.

Random synaptic feedback weights support error backpropagation for deep learning

PubMed Central

Lillicrap, Timothy P.; Cownden, Daniel; Tweed, Douglas B.; Akerman, Colin J.

2016-01-01

The brain processes information through multiple layers of neurons. This deep architecture is representationally powerful, but complicates learning because it is difficult to identify the responsible neurons when a mistake is made. In machine learning, the backpropagation algorithm assigns blame by multiplying error signals with all the synaptic weights on each neuron's axon and further downstream. However, this involves a precise, symmetric backward connectivity pattern, which is thought to be impossible in the brain. Here we demonstrate that this strong architectural constraint is not required for effective error propagation. We present a surprisingly simple mechanism that assigns blame by multiplying errors by even random synaptic weights. This mechanism can transmit teaching signals across multiple layers of neurons and performs as effectively as backpropagation on a variety of tasks. Our results help reopen questions about how the brain could use error signals and dispel long-held assumptions about algorithmic constraints on learning. PMID:27824044

Project on Advanced Systems and Concepts for Countering Weapons of Mass Destruction (PASCC)

DTIC Science & Technology

2015-09-01

Proliferation of weapons of mass destruction (WMD, defined as nuclear, chemical , and biological) and weapons of mass effect (WME, defined as other high... Chemical Weapons • Scoping Study for a U.S.-Israel Strategic Dialogued 5 • U.S.-India Strategic Dialogue • Implications of Indian Tactical...of Chemical Weapons : Strategic Dialogue, Research, and Report Performer: Arizona State University (ASU) Principal Investigator: Orde Kittrie Cost

Do Weapons Facilitate Adolescent Delinquency? An Examination of Weapon Carrying and Delinquency Among Adolescents.

PubMed

Emmert, Amanda D; Hall, Gina Penly; Lizotte, Alan J

2018-03-01

This article examines whether weapon carrying influences the frequency and variety of violent, property, and drug delinquency adolescents commit through fixed-effects analyses of data from the Rochester Youth Development Study (RYDS). We conclude that weapon carrying contributes to violent, substance, and property delinquency, and delinquent behaviors learned during weapon carrying continue to affect substance and property delinquency long after carrying has ceased.

Victimization and health risk factors among weapon-carrying youth.

PubMed

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

2011-11-01

To compare health risks of 2 subgroups of weapon carriers: victimized and nonvictimized youth. 2003-2007 NYC Youth Risk Behavior Surveys were analyzed using bivariate analyses and multinomial logistic regression. Among NYC teens, 7.5% reported weapon carrying without victimization; 6.9% reported it with victimization. Both subgroups were more likely than non-weapon carriers to binge drink, use marijuana, smoke, fight, and have multiple sex partners; weapon carriers with victimization also experienced persistent sadness and attempted suicide. Subgroups of weapon carriers have distinct profiles. Optimal response should pair disciplinary action with screening for behavioral and mental health concerns and victimization.

Chemical weapons: documented use and compounds on the horizon.

PubMed

Bismuth, Chantal; Borron, Stephen W; Baud, Frederic J; Barriot, Patrick

2004-04-01

Man's inhumanity to man is expressed through a plethora of tools of modern warfare and terror. The use of chemical and biological weapons with the goals of assault, demoralisation and lethality has been documented in recent history, both on the battlefield and in urban terror against civilians. A general review of a few of the currently employed chemical weapons and biological toxins, along with a look at potential chemical weapons and tools of counter-terrorism, follows. While these weapons are fearsome elements, the dangers should be viewed in the context of the widespread availability and efficacy of conventional weapons.

Is this the time for a high-energy laser weapon program?

NASA Astrophysics Data System (ADS)

Kiel, David H.

2013-02-01

The U.S. Department of Defense (DoD) has made large investments weaponizing laser technology for air defense. Despite billions of dollars spent, there has not been a successful transition of a high-energy laser (HEL) weapon from the lab to the field. Is the dream of a low-cost-per-shot, deep-magazine, speed-of-light HEL weapon an impossible dream or a set of technologies that are ready to emerge on the modern battlefield? Because of the rapid revolution taking place in modern warfare that is making conventional defensive weapons very expensive relative to the offensive weapons systems, the pull for less expensive air defense may necessitate a HEL weapon system. Also, due to the recent technological developments in solid-state lasers (SSL), especially fiber lasers, used throughout manufacturing for cutting and welding, a HEL weapon finally may be able to meet all the requirements of ease of use, sustainability, and reliability. Due to changes in warfare and SSL technology advances, the era of HEL weapons isn't over; it may be just starting if DoD takes an evolutionary approach to fielding a HEL weapon. The U.S. Navy, with its large ships and their available electric power, should lead the way.

Community Detection on the GPU

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

Naim, Md; Manne, Fredrik; Halappanavar, Mahantesh

We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune the load balance when processing networks with nodes of highly varying degrees. This is achieved by scaling the number of threads assigned to each node according to its degree. Extensive experiments show that we obtain speedups up to a factor of 270 compared to the sequential algorithm. The algorithm consistently outperforms other recent shared memory implementations and is only one order ofmore » magnitude slower than the current fastest parallel Louvain method running on a Blue Gene/Q supercomputer using more than 500K threads.« less

DNATCO: assignment of DNA conformers at dnatco.org.

PubMed

Černý, Jiří; Božíková, Paulína; Schneider, Bohdan

2016-07-08

The web service DNATCO (dnatco.org) classifies local conformations of DNA molecules beyond their traditional sorting to A, B and Z DNA forms. DNATCO provides an interface to robust algorithms assigning conformation classes called NTC: to dinucleotides extracted from DNA-containing structures uploaded in PDB format version 3.1 or above. The assigned dinucleotide NTC: classes are further grouped into DNA structural alphabet NTA: , to the best of our knowledge the first DNA structural alphabet. The results are presented at two levels: in the form of user friendly visualization and analysis of the assignment, and in the form of a downloadable, more detailed table for further analysis offline. The website is free and open to all users and there is no login requirement. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Girls and Weapons: An International Study of the Perpetration of Violence

PubMed Central

Butters, Jennifer E.; Cousineau, Marie-Marthe; Harrison, Lana; Korf, Dirk

2006-01-01

The purpose of this study was to describe delinquent girls' weapons preferences where and how often they carried weapons and to identify the most important factors that explained four different weapon-related violent outcomes. A large, high-risk sample of female adolescents consisting of 510 girls aged 14–17 in four cities were interviewed using the same questionnaire and methods. Tabular and logistic regression analyses were applied. Knives emerged as the most frequently reported weapon in all cities. Rates of both lifetime victimization and perpetration of violence with weapons were high in all sites. Starting to carry a weapon as a result of violence was reported by 40% of the girls in Toronto, 28% in Philadelphia, 25% in Amsterdam, and 16% in Montreal. The major predictors of weapon perpetrated violent behaviours included ethnic origin, early onset of delinquent activities, participation in delinquent acts in the past 12 months, gang fighting and carrying a weapon as a result of violence. Site, age and heavy alcohol consumption had a minor impact, and drug use, drug selling, and neighborhood features, none. Despite numerous differences in weapons' prevalence across cities, the logistic regression found that site was only significant in use of an object (Toronto) and not significant in threatening or hurting someone with either a knife or a gun or actually hurting others with a weapon. These findings suggest commonality in serious female violence that extends beyond borders and cultures. PMID:16937086

75 FR 2482 - Submission for OMB Review; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2010-01-15

...: Bureau of Industry and Security (BIS). Title: Chemical Weapons Convention Declaration and Report Handbook... the Chemical Weapons Convention (CWC), an international arms control treaty. The Chemical Weapons Convention Implementation Act of 1998 and Commerce Chemical Weapons Convention Regulations (CWCR) specify the...

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

NASA Astrophysics Data System (ADS)

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.

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

PubMed

Ceberio, Josu; Calvo, Borja; Mendiburu, Alexander; Lozano, Jose A

2018-02-15

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function. Under this framework, each of the elementary landscapes obtained from the decomposition is considered as an independent objective function to optimise. In order to illustrate this general methodology, we consider four problems from different domains: the quadratic assignment problem and the linear ordering problem (permutation domain), the 0-1 unconstrained quadratic optimisation problem (binary domain), and the frequency assignment problem (integer domain). We implemented two widely known multi-objective algorithms, NSGA-II and SPEA2, and compared their performance with that of a single-objective GA. The experiments conducted on a large benchmark of instances of the four problems show that the multi-objective algorithms clearly outperform the single-objective approaches. Furthermore, a discussion on the results suggests that the multi-objective space generated by this decomposition enhances the exploration ability, thus permitting NSGA-II and SPEA2 to obtain better results in the majority of the tested instances.

Alternative World Scenarios for a New Order of Nations.

DTIC Science & Technology

1993-01-01

chemical, biological and nuclear weapons continues. Despite the reduction of world tensions, almost every industrial nation will be armed with a range...of conventional, chemical, and biological weapons. Most of these weapons will have been supplied to them by the EC, the United States, and China before...weapons and delivery systems as well as chemical and biological weapons to build or increase their arsenals. The combined effect of new found economic

48 CFR 25.301-3 - Weapons.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 48 Federal Acquisition Regulations System 1 2013-10-01 2013-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...

22 CFR 103.2 - Definitions.

Code of Federal Regulations, 2013 CFR

2013-04-01

... WEAPONS CONVENTION AND THE CHEMICAL WEAPONS CONVENTION IMPLEMENTATION ACT OF 1998 ON THE TAKING OF SAMPLES... Office of Export Administration and the Office of Export Enforcement. Chemical Weapons Convention (CWC or... Chemical Weapons and on Their Destruction, and its annexes opened for signature on January 13, 1993, and...

48 CFR 25.301-3 - Weapons.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 48 Federal Acquisition Regulations System 1 2011-10-01 2011-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...

22 CFR 103.2 - Definitions.

Code of Federal Regulations, 2014 CFR

2014-04-01

... WEAPONS CONVENTION AND THE CHEMICAL WEAPONS CONVENTION IMPLEMENTATION ACT OF 1998 ON THE TAKING OF SAMPLES... Office of Export Administration and the Office of Export Enforcement. Chemical Weapons Convention (CWC or... Chemical Weapons and on Their Destruction, and its annexes opened for signature on January 13, 1993, and...

48 CFR 25.301-3 - Weapons.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 48 Federal Acquisition Regulations System 1 2012-10-01 2012-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...

48 CFR 25.301-3 - Weapons.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 48 Federal Acquisition Regulations System 1 2014-10-01 2014-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...

48 CFR 25.301-3 - Weapons.

Code of Federal Regulations, 2010 CFR

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

Combating the Proliferation of Weapons of Mass Destruction.

ERIC Educational Resources Information Center

Jenkins, Bonnie

1997-01-01

Reveals the growing threat posed to all countries by the proliferation of weapons of mass destruction. Discusses the international effort combating this proliferation including the Nuclear Non-Proliferation Treaty, Strategic Arms Reduction Treaties, Biological Weapons Convention, and Chemical Weapons Convention. Also considers regional arms…

Threat is in the sex of the beholder: men find weapons faster than do women.

PubMed

Sulikowski, Danielle; Burke, Darren

2014-10-29

In visual displays, people locate potentially threatening stimuli, such as snakes, spiders, and weapons, more quickly than similar benign stimuli, such as beetles and gadgets. Such biases are likely adaptive, facilitating fast responses to potential threats. Currently, and historically, men have engaged in more weapons-related activities (fighting and hunting) than women. If biases of visual attention for weapons result from selection pressures related to these activities, then we would predict such biases to be stronger in men than in women. The current study reports the results of two visual search experiments, in which men showed a stronger bias of attention toward guns and knives than did women, whether the weapons were depicted wielded or not. When the weapons were depicted wielded, both sexes searched for them with more caution than when they were not. Neither of these effects extended reliably to syringes, a non-weapon-yet potentially threatening-object. The findings are discussed with respect to the "weapons effect" and social coercion theory.

BB and pellet guns--toys or deadly weapons?

PubMed

Harris, W; Luterman, A; Curreri, P W

1983-07-01

BB and pellet weapons are not included in gun control laws and are often sold as children's toys. Injuries caused by these weapons have been considered trivial unless they involve vulnerable surface organs such as the eye. The purpose of this study was to review the management of six cases of pellet or BB gun injuries that required abdominal exploration at the University of South Alabama Medical Center from January 1980 through June 1982. Five of the six patients had significant internal injuries including perforations of the stomach, jejunum, liver, and pancreas. The ballistics of pneumatic weapons are reviewed. The muzzle velocities of many of these weapons necessitate that wounds caused by these weapons be handled with the same principles as for any small-caliber, low-velocity (less than 1,200 feet/second) weapons. Public education programs are urgently needed to educate parents as to the potential danger involved in purchasing these weapons for unsupervised use as toys by children.

Towards Automated Structure-Based NMR Resonance Assignment

NASA Astrophysics Data System (ADS)

Jang, Richard; Gao, Xin; Li, Ming

We propose a general framework for solving the structure-based NMR backbone resonance assignment problem. The core is a novel 0-1 integer programming model that can start from a complete or partial assignment, generate multiple assignments, and model not only the assignment of spins to residues, but also pairwise dependencies consisting of pairs of spins to pairs of residues. It is still a challenge for automated resonance assignment systems to perform the assignment directly from spectra without any manual intervention. To test the feasibility of this for structure-based assignment, we integrated our system with our automated peak picking and sequence-based resonance assignment system to obtain an assignment for the protein TM1112 with 91% recall and 99% precision without manual intervention. Since using a known structure has the potential to allow one to use only N-labeled NMR data and avoid the added expense of using C-labeled data, we work towards the goal of automated structure-based assignment using only such labeled data. Our system reduced the assignment error of Xiong-Pandurangan-Bailey-Kellogg's contact replacement (CR) method, which to our knowledge is the most error-tolerant method for this problem, by 5 folds on average. By using an iterative algorithm, our system has the added capability of using the NOESY data to correct assignment errors due to errors in predicting the amino acid and secondary structure type of each spin system. On a publicly available data set for Ubiquitin, where the type prediction accuracy is 83%, we achieved 91% assignment accuracy, compared to the 59% accuracy that was obtained without correcting for typing errors.

Automated and assisted RNA resonance assignment using NMR chemical shift statistics

PubMed Central

Aeschbacher, Thomas; Schmidt, Elena; Blatter, Markus; Maris, Christophe; Duss, Olivier; Allain, Frédéric H.-T.; Güntert, Peter; Schubert, Mario

2013-01-01

The three-dimensional structure determination of RNAs by NMR spectroscopy relies on chemical shift assignment, which still constitutes a bottleneck. In order to develop more efficient assignment strategies, we analysed relationships between sequence and 1H and 13C chemical shifts. Statistics of resonances from regularly Watson–Crick base-paired RNA revealed highly characteristic chemical shift clusters. We developed two approaches using these statistics for chemical shift assignment of double-stranded RNA (dsRNA): a manual approach that yields starting points for resonance assignment and simplifies decision trees and an automated approach based on the recently introduced automated resonance assignment algorithm FLYA. Both strategies require only unlabeled RNAs and three 2D spectra for assigning the H2/C2, H5/C5, H6/C6, H8/C8 and H1′/C1′ chemical shifts. The manual approach proved to be efficient and robust when applied to the experimental data of RNAs with a size between 20 nt and 42 nt. The more advanced automated assignment approach was successfully applied to four stem-loop RNAs and a 42 nt siRNA, assigning 92–100% of the resonances from dsRNA regions correctly. This is the first automated approach for chemical shift assignment of non-exchangeable protons of RNA and their corresponding 13C resonances, which provides an important step toward automated structure determination of RNAs. PMID:23921634

Multicriteria meta-heuristics for AGV dispatching control based on computational intelligence.

PubMed

Naso, David; Turchiano, Biagio

2005-04-01

In many manufacturing environments, automated guided vehicles are used to move the processed materials between various pickup and delivery points. The assignment of vehicles to unit loads is a complex problem that is often solved in real-time with simple dispatching rules. This paper proposes an automated guided vehicles dispatching approach based on computational intelligence. We adopt a fuzzy multicriteria decision strategy to simultaneously take into account multiple aspects in every dispatching decision. Since the typical short-term view of dispatching rules is one of the main limitations of such real-time assignment heuristics, we also incorporate in the multicriteria algorithm a specific heuristic rule that takes into account the empty-vehicle travel on a longer time-horizon. Moreover, we also adopt a genetic algorithm to tune the weights associated to each decision criteria in the global decision algorithm. The proposed approach is validated by means of a comparison with other dispatching rules, and with other recently proposed multicriteria dispatching strategies also based on computational Intelligence. The analysis of the results obtained by the proposed dispatching approach in both nominal and perturbed operating conditions (congestions, faults) confirms its effectiveness.

Parallel processing considerations for image recognition tasks

NASA Astrophysics Data System (ADS)

Simske, Steven J.

2011-01-01

Many image recognition tasks are well-suited to parallel processing. The most obvious example is that many imaging tasks require the analysis of multiple images. From this standpoint, then, parallel processing need be no more complicated than assigning individual images to individual processors. However, there are three less trivial categories of parallel processing that will be considered in this paper: parallel processing (1) by task; (2) by image region; and (3) by meta-algorithm. Parallel processing by task allows the assignment of multiple workflows-as diverse as optical character recognition [OCR], document classification and barcode reading-to parallel pipelines. This can substantially decrease time to completion for the document tasks. For this approach, each parallel pipeline is generally performing a different task. Parallel processing by image region allows a larger imaging task to be sub-divided into a set of parallel pipelines, each performing the same task but on a different data set. This type of image analysis is readily addressed by a map-reduce approach. Examples include document skew detection and multiple face detection and tracking. Finally, parallel processing by meta-algorithm allows different algorithms to be deployed on the same image simultaneously. This approach may result in improved accuracy.

A model of cloud application assignments in software-defined storages

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

A new mutually reinforcing network node and link ranking algorithm

PubMed Central

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-01-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity. PMID:26492958

A Comparison of Several Techniques to Assign Heights to Cloud Tracers.

NASA Astrophysics Data System (ADS)

Nieman, Steven J.; Schmetz, Johannes; Menzel, W. Paul

1993-09-01

Satellite-derived cloud-motion vector (CMV) production has been troubled by inaccurate height assignment of cloud tracers, especially in thin semitransparent clouds. This paper presents the results of an intercomparison of current operational height assignment techniques. Currently, heights are assigned by one of three techniques when the appropriate spectral radiance measurements are available. The infrared window (IRW) technique compares measured brightness temperatures to forecast temperature profiles and thus infers opaque cloud levels. In semitransparent or small subpixel clouds, the carbon dioxide (CO2) technique uses the ratio of radiances from different layers of the atmosphere to infer the correct cloud height. In the water vapor (H2O) technique, radiances influenced by upper-tropospheric moisture and IRW radiances are measured for several pixels viewing different cloud amounts, and their linear relationship is used to extrapolate the correct cloud height. The results presented in this paper suggest that the H2O technique is a viable alternative to the CO2 technique for inferring the heights of semitransparent cloud elements. This is important since future National Environmental Satellite, Data, and Information Service (NESDIS) operations will have to rely on H20-derived cloud-height assignments in the wind field determinations with the next operational geostationary satellite. On a given day, the heights from the two approaches compare to within 60 110 hPa rms; drier atmospheric conditions tend to reduce the effectiveness of the H2O technique. By inference one can conclude that the present height algorithms used operationally at NESDIS (with the C02 technique) and at the European Satellite Operations Center (ESOC) (with their version of the H20 technique) are providing similar results. Sample wind fields produced with the ESOC and NESDIS algorithms using Meteosat-4 data show good agreement.

Storage assignment optimization in a multi-tier shuttle warehousing system

NASA Astrophysics Data System (ADS)

Wang, Yanyan; Mou, Shandong; Wu, Yaohua

2016-03-01

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

[Modern pneumatic weapons and injuries they cause].

PubMed

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.

Automated mapping of pharmacy orders from two electronic health record systems to RxNorm within the STRIDE clinical data warehouse.

PubMed

Hernandez, Penni; Podchiyska, Tanya; Weber, Susan; Ferris, Todd; Lowe, Henry

2009-11-14

The Stanford Translational Research Integrated Database Environment (STRIDE) clinical data warehouse integrates medication information from two Stanford hospitals that use different drug representation systems. To merge this pharmacy data into a single, standards-based model supporting research we developed an algorithm to map HL7 pharmacy orders to RxNorm concepts. A formal evaluation of this algorithm on 1.5 million pharmacy orders showed that the system could accurately assign pharmacy orders in over 96% of cases. This paper describes the algorithm and discusses some of the causes of failures in mapping to RxNorm.

Using recurrence plot analysis for software execution interpretation and fault detection

NASA Astrophysics Data System (ADS)

Mosdorf, M.

2015-09-01

This paper shows a method targeted at software execution interpretation and fault detection using recurrence plot analysis. In in the proposed approach recurrence plot analysis is applied to software execution trace that contains executed assembly instructions. Results of this analysis are subject to further processing with PCA (Principal Component Analysis) method that simplifies number coefficients used for software execution classification. This method was used for the analysis of five algorithms: Bubble Sort, Quick Sort, Median Filter, FIR, SHA-1. Results show that some of the collected traces could be easily assigned to particular algorithms (logs from Bubble Sort and FIR algorithms) while others are more difficult to distinguish.

Online ranking by projecting.

PubMed

Crammer, Koby; Singer, Yoram

2005-01-01

We discuss the problem of ranking instances. In our framework, each instance is associated with a rank or a rating, which is an integer in 1 to k. Our goal is to find a rank-prediction rule that assigns each instance a rank that is as close as possible to the instance's true rank. We discuss a group of closely related online algorithms, analyze their performance in the mistake-bound model, and prove their correctness. We describe two sets of experiments, with synthetic data and with the EachMovie data set for collaborative filtering. In the experiments we performed, our algorithms outperform online algorithms for regression and classification applied to ranking.

Computing Role Assignments of Proper Interval Graphs in Polynomial Time

NASA Astrophysics Data System (ADS)

Heggernes, Pinar; van't Hof, Pim; Paulusma, Daniël

A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The Role Assignment problem has as input a pair of graphs (G,R) and asks whether G has an R-role assignment. This problem is NP-complete already on input pairs (G,R) where R is a path on three vertices. So far, the only known non-trivial tractable case consists of input pairs (G,R) where G is a tree. We present a polynomial time algorithm that solves Role Assignment on all input pairs (G,R) where G is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is Graph Isomorphism-hard on chordal graphs, a superclass of proper interval graphs and trees.

Post-processing techniques to enhance reliability of assignment algorithm based performance measures.

DOT National Transportation Integrated Search

2011-01-01

This study develops an enhanced transportation planning framework by augmenting the sequential four-step : planning process with post-processing techniques. The post-processing techniques are incorporated through a feedback : mechanism and aim to imp...

Finding minimum-quotient cuts in planar graphs

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

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v {element_of} V is assigned a weight w(v) and each edge e {element_of} E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and {bar S} is c(S, {bar S})/min{l_brace}w(S), w(S){r_brace}, where c(S, {bar S}) is the sum of the costs of the edges crossing the cut and w(S) and w({bar S}) are the sum of the weights of the vertices in S and {bar S}, respectively. The problem of finding a cut whose quotient is minimum for a graph hasmore » in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,{bar S}) minimizing c(S,{bar S}) subject to the constraint bW {le} w(S) {le} (1 {minus} b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b {le} {1/2}. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao`s algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao`s most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

Finding minimum-quotient cuts in planar graphs

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

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v [element of] V is assigned a weight w(v) and each edge e [element of] E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and [bar S] is c(S, [bar S])/min[l brace]w(S), w(S)[r brace], where c(S, [bar S]) is the sum of the costs of the edges crossing the cut and w(S) and w([bar S]) are the sum of the weights of the vertices in S and [bar S], respectively. The problem of finding a cut whose quotient is minimummore » for a graph has in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,[bar S]) minimizing c(S,[bar S]) subject to the constraint bW [le] w(S) [le] (1 [minus] b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b [le] [1/2]. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao's algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao's most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

77 FR 75145 - Impact of the Implementation of the Chemical Weapons Convention (CWC) on Commercial Activities...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-19

... the Implementation of the Chemical Weapons Convention (CWC) on Commercial Activities Involving ``Schedule 1'' Chemicals (Including Schedule 1 Chemicals Produced as Intermediates) Through Calendar Year... Chemical Weapons Convention (CWC), through the Chemical Weapons Convention Implementation Act (CWCIA) and...

32 CFR 552.125 - Disposition of confiscated weapons.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 3 2012-07-01 2009-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...

32 CFR 552.125 - Disposition of confiscated weapons.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 3 2014-07-01 2014-07-01 false 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...

32 CFR 552.125 - Disposition of confiscated weapons.

Code of Federal Regulations, 2010 CFR

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

32 CFR 552.125 - Disposition of confiscated weapons.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 3 2011-07-01 2009-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...

32 CFR 552.125 - Disposition of confiscated weapons.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 3 2013-07-01 2013-07-01 false 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...

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

Canavan, G.H.

At low force levels stability indices depend primarily on the number of vulnerable missiles and the number of weapons on them. The index reduces to a product of the number of vulnerable missiles and the differences between normalized second and first strikes by vulnerable weapons. As the number of weapons per vulnerable missile decreases, the index rapidly approaches stability. Further reductions in vulnerable and survivable missiles and weapons do not affect stability, although they do reduce first and second strikes. Modest weapon reconstitution degrades stability significantly.

Responding to chemical weapons violations in Syria: legal, health, and humanitarian recommendations.

PubMed

Brooks, Julia; Erickson, Timothy B; Kayden, Stephanie; Ruiz, Raul; Wilkinson, Stephen; Burkle, Frederick M

2018-01-01

The repeated use of prohibited chemical weapons in the Syrian conflict poses serious health, humanitarian, and security threats to civilians, healthcare personnel, and first responders. Moreover, the use of chemical weapons constitutes a clear and egregious violation of international law-likely amounting to a war crime-for which continued impunity is setting a dangerous precedent in relation to current and future conflicts. This debate article calls upon concerned states, organizations, and individuals to respond urgently and unequivocally to this serious breach of international legal and humanitarian norms. Based on health, humanitarian, and legal findings, this article calls for concrete action to: 1) reduce the risk of chemical weapons being used in current and future conflicts; 2) review and support the preparedness equipment and antidote supplies of first responders, humanitarian organizations, and military forces operating in Syria; 3) support international mechanisms for monitoring and enforcing the prohibition on chemical weapons, including through criminal accountability; 4) support civilian victims of chemical weapons attacks, including refugees; and 5) re-commit to the complete elimination of chemical weapons in compliance with the Chemical Weapons Convention (1993), a comprehensive treaty that bans chemical weapons and requires their complete destruction. All involved states and organizations should take urgent steps to ensure the protection of the most vulnerable victims of conflict, including victims of chemical weapons attacks in Syria, and to reinforce international law in the face of such serious violations.

Emergency department evaluation after conducted energy weapon use: review of the literature for the clinician.

PubMed

Vilke, Gary M; Bozeman, William P; Chan, Theodore C

2011-05-01

Conductive energy weapons (CEWs) are used daily by law enforcement, and patients are often brought to an emergency department (ED) for medical clearance. To review the medical literature on the topic of CEWs and to offer evidence-based recommendations to Emergency Physicians for evaluation and treatment of patients who have received a CEW exposure. A MEDLINE literature search from 1988 to 2010 was performed and limited to human studies published from January 1988 to January 20, 2010 for English language articles with the following keywords: TASER, conductive energy device(s), electronic weapon(s), conductive energy weapon(s), non-lethal weapon(s), conducted energy device(s), conducted energy weapon(s), conductive electronic device(s), and electronic control device(s). Studies identified then underwent a structured review from which results could be evaluated. There were 140 articles on CEWs screened, and 20 appropriate articles were rigorously reviewed and recommendations given. These studies did not report any evidence of dangerous laboratory abnormalities, physiologic changes, or immediate or delayed cardiac ischemia or dysrhythmias after exposure to CEW electrical discharges of up to 15 s. The current medical literature does not support routine performance of laboratory studies, electrocardiograms, or prolonged ED observation or hospitalization for ongoing cardiac monitoring after CEW exposure in an otherwise asymptomatic awake and alert patient. Copyright © 2011 Elsevier Inc. All rights reserved.

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

PubMed

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.

Vulnerability assessment of a space based weapon platform electronic system exposed to a thermonuclear weapon detonation

NASA Astrophysics Data System (ADS)

Perez, C. L.; Johnson, J. O.

Rapidly changing world events, the increased number of nations with inter-continental ballistic missile capability, and the proliferation of nuclear weapon technology will increase the number of nuclear threats facing the world today. Monitoring these nation's activities and providing an early warning and/or intercept system via reconnaissance and surveillance satellites and space based weapon platforms is a viable deterrent against a surprise nuclear attack. However, the deployment of satellite and weapon platform assets in space will subject the sensitive electronic equipment to a variety of natural and man-made radiation environments. These include Van Allen Belt protons and electrons; galactic and solar flare protons; and neutrons, gamma rays, and x-rays from intentionally detonated fission and fusion weapons. In this paper, the MASH vl.0 code system is used to estimate the dose to the critical electronics components of an idealized space based weapon platform from neutron and gamma-ray radiation emitted from a thermonuclear weapon detonation in space. Fluence and dose assessments were performed for the platform fully loaded, and in several stages representing limited engagement scenarios. The results indicate vulnerabilities to the Command, Control, and Communication bay instruments from radiation damage for a nuclear weapon detonation for certain source/platform orientations. The distance at which damage occurs will depend on the weapon yield (n,(gamma)/kiloton) and size (kilotons).

A modeling of dynamic storage assignment for order picking in beverage warehousing with Drive-in Rack system

NASA Astrophysics Data System (ADS)

Hadi, M. Z.; Djatna, T.; Sugiarto

2018-04-01

This paper develops a dynamic storage assignment model to solve storage assignment problem (SAP) for beverages order picking in a drive-in rack warehousing system to determine the appropriate storage location and space for each beverage products dynamically so that the performance of the system can be improved. This study constructs a graph model to represent drive-in rack storage position then combine association rules mining, class-based storage policies and an arrangement rule algorithm to determine an appropriate storage location and arrangement of the product according to dynamic orders from customers. The performance of the proposed model is measured as rule adjacency accuracy, travel distance (for picking process) and probability a product become expiry using Last Come First Serve (LCFS) queue approach. Finally, the proposed model is implemented through computer simulation and compare the performance for different storage assignment methods as well. The result indicates that the proposed model outperforms other storage assignment methods.

Protein assignments without peak lists using higher-order spectra.

PubMed

Benison, Gregory; Berkholz, Donald S; Barbar, Elisar

2007-12-01

Despite advances in automating the generation and manipulation of peak lists for assigning biomolecules, there are well-known advantages to working directly with spectra: the eye is still superior to computer algorithms when it comes to picking out peak relationships from contour plots in the presence of confounding factors such as noise, overlap, and spectral artifacts. Here, we present constructs called higher-order spectra for identifying, through direct visual examination, many of the same relationships typically identified by searching peak lists, making them another addition to the set of tools (alongside peak picking and automated assignment) that can be used to solve the assignment problem. The technique is useful for searching for correlated peaks in any spectrum type. Application of this technique to novel, complete sequential assignment of two proteins (AhpFn and IC74(84-143)) is demonstrated. The program "burrow-owl" for the generation and display of higher-order spectra is available at (http://sourceforge.net/projects/burrow-owl) or from the authors.

Identification of nuclear weapons

DOEpatents

Mihalczo, J.T.; King, W.T.

1987-04-10

A method and apparatus for non-invasively indentifying different types of nuclear weapons is disclosed. A neutron generator is placed against the weapon to generate a stream of neutrons causing fissioning within the weapon. A first detects the generation of the neutrons and produces a signal indicative thereof. A second particle detector located on the opposite side of the weapon detects the fission particles and produces signals indicative thereof. The signals are converted into a detected pattern and a computer compares the detected pattern with known patterns of weapons and indicates which known weapon has a substantially similar pattern. Either a time distribution pattern or noise analysis pattern, or both, is used. Gamma-neutron discrimination and a third particle detector for fission particles adjacent the second particle detector are preferably used. The neutrons are generated by either a decay neutron source or a pulled neutron particle accelerator.

Structural adaptations to diverse fighting styles in sexually selected weapons

PubMed Central

McCullough, Erin L.; Tobalske, Bret W.; Emlen, Douglas J.

2014-01-01

The shapes of sexually selected weapons differ widely among species, but the drivers of this diversity remain poorly understood. Existing explanations suggest weapon shapes reflect structural adaptations to different fighting styles, yet explicit tests of this hypothesis are lacking. We constructed finite element models of the horns of different rhinoceros beetle species to test whether functional specializations for increased performance under species-specific fighting styles could have contributed to the diversification of weapon form. We find that horns are both stronger and stiffer in response to species-typical fighting loads and that they perform more poorly under atypical fighting loads, which suggests weapons are structurally adapted to meet the functional demands of fighting. Our research establishes a critical link between weapon form and function, revealing one way male–male competition can drive the diversification of animal weapons. PMID:25201949

Structural adaptations to diverse fighting styles in sexually selected weapons.

PubMed

McCullough, Erin L; Tobalske, Bret W; Emlen, Douglas J

2014-10-07

The shapes of sexually selected weapons differ widely among species, but the drivers of this diversity remain poorly understood. Existing explanations suggest weapon shapes reflect structural adaptations to different fighting styles, yet explicit tests of this hypothesis are lacking. We constructed finite element models of the horns of different rhinoceros beetle species to test whether functional specializations for increased performance under species-specific fighting styles could have contributed to the diversification of weapon form. We find that horns are both stronger and stiffer in response to species-typical fighting loads and that they perform more poorly under atypical fighting loads, which suggests weapons are structurally adapted to meet the functional demands of fighting. Our research establishes a critical link between weapon form and function, revealing one way male-male competition can drive the diversification of animal weapons.

King has no clothes: The role of the military in responding to a terrorist chemical/biological attack. Final report

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

Osterman, J.L.

1996-06-14

The United States has begun a program of counterproliferation in order to preempt the use of WMD by such elements, however, the ability to respond to the terrorist employment of biological/chemical weapons is absent. Given the structure, capability and technical expertise in the Federal Emergency Management Agency (FEMA) and the Federal Bureau of Investigation (FBI), the Department of Defense (DoD) will be tasked to conduct the response to such an incident. The geographical Commander in Chief (CINC) and the appointed Joint Task Force (JTF) commander will ultimately be assigned the response mission. Planning, training and coordination is required to developmore » a force capable of responding in a timely and coordinated manner.« less

Weapon Involvement in the Victimization of Children.

PubMed

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.

Weapons Retrieved After the Implementation of Emergency Department Metal Detection.

PubMed

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.

7 CFR 502.13 - Weapons and explosives.

Code of Federal Regulations, 2010 CFR

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

49 CFR 1544.219 - Carriage of accessible weapons.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 49 Transportation 9 2012-10-01 2012-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...

36 CFR 520.15 - Weapons and explosives.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 36 Parks, Forests, and Public Property 3 2012-07-01 2012-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...

36 CFR § 504.14 - Weapons and explosives.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 36 Parks, Forests, and Public Property 3 2013-07-01 2012-07-01 true Weapons and explosives. § 504... REGULATIONS 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...

31 CFR 700.11 - Weapons and explosives.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 31 Money and Finance:Treasury 3 2011-07-01 2011-07-01 false Weapons and explosives. 700.11 Section... 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, either openly or...

Adolescents Who Carry Weapons to School: A Review of Cases

ERIC Educational Resources Information Center

Finkenbine, Ryan D.; Dwyer, R. Gregg

2006-01-01

Multiple self-report surveys have collected data about weapons in school. This record review study considers characteristics of 47 adolescents adjudicated for carrying weapons at school and provides a descriptive analysis against a comparison group of 37 juveniles with other offenses. Demographics, weapon type, legal history, prior school…

7 CFR 501.12 - Weapons and explosives.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 6 2014-01-01 2014-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...

7 CFR 501.12 - Weapons and explosives.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 6 2012-01-01 2012-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...

31 CFR 700.11 - Weapons and explosives.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 31 Money and Finance:Treasury 3 2013-07-01 2013-07-01 false Weapons and explosives. 700.11 Section... 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, either openly or...

36 CFR 504.14 - Weapons and explosives.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 36 Parks, Forests, and Public Property 3 2011-07-01 2011-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...

49 CFR 1544.219 - Carriage of accessible weapons.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 49 Transportation 9 2011-10-01 2011-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...

49 CFR 1544.219 - Carriage of accessible weapons.

Code of Federal Regulations, 2010 CFR

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

36 CFR 520.15 - Weapons and explosives.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 36 Parks, Forests, and Public Property 3 2011-07-01 2011-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...

27 CFR 478.133 - Records of transactions in semiautomatic assault weapons.

Code of Federal Regulations, 2012 CFR

2012-04-01

... semiautomatic assault weapons. 478.133 Section 478.133 Alcohol, Tobacco Products, and Firearms BUREAU OF ALCOHOL... AMMUNITION Records § 478.133 Records of transactions in semiautomatic assault weapons. The evidence specified in § 478.40(c), relating to transactions in semiautomatic assault weapons, shall be retained in the...

7 CFR 503.13 - Weapons and explosives.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 6 2013-01-01 2013-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...