WorldWideScience

Sample records for assignments

  1. Historical WBAN ID Assignments

    Data.gov (United States)

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

  2. My Favorite Assignment.

    Science.gov (United States)

    Post, Robert E.; Johnson, Jack E.

    1982-01-01

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

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

    Science.gov (United States)

    2010-10-01

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

  4. Random Cell Identifiers Assignment

    Directory of Open Access Journals (Sweden)

    Robert Bestak

    2012-01-01

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

  5. NR 512 All Assignments

    OpenAIRE

    Laynebaril1

    2017-01-01

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

  6. Task assignment and coaching

    NARCIS (Netherlands)

    Dominguez-Martinez, S.

    2009-01-01

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

  7. Scaffolding students’ assignments

    DEFF Research Database (Denmark)

    Slot, Marie Falkesgaard

    2013-01-01

    This article discusses scaffolding in typical student assignments in mother tongue learning materials in upper secondary education in Denmark and the United Kingdom. It has been determined that assignments do not have sufficient scaffolding end features to help pupils understand concepts and build...... objects. The article presents the results of empirical research on tasks given in Danish and British learning materials. This work is based on a further development of my PhD thesis: “Learning materials in the subject of Danish” (Slot 2010). The main focus is how cognitive models (and subsidiary explicit...... learning goals) can help students structure their argumentative and communica-tive learning processes, and how various multimodal representations can give more open-ended learning possibilities for collaboration. The article presents a short introduction of the skills for 21st century learning and defines...

  8. Job Assignments under Moral Hazard

    DEFF Research Database (Denmark)

    Koch, Alexander; Nafziger, Julia

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

  9. Interactive Assignments for Online Students

    Directory of Open Access Journals (Sweden)

    Pam Lowry

    2009-04-01

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

  10. Optimizing Marine Security Guard Assignments

    Science.gov (United States)

    2011-06-01

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

  11. Balanced input-output assignment

    Science.gov (United States)

    Gawronski, W.; Hadaegh, F. Y.

    1989-01-01

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

  12. Job assignment with multivariate skills

    OpenAIRE

    Brilon, Stefanie

    2010-01-01

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

  13. A Statistical Programme Assignment Model

    DEFF Research Database (Denmark)

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

    When treatment effects of active labour market programmes are heterogeneous in an observable way  across the population, the allocation of the unemployed into different programmes becomes a particularly  important issue. In this paper, we present a statistical model designed to improve the present...... assignment  mechanism, which is based on the discretionary choice of case workers. This is done in a duration model context, using the timing-of-events framework to identify causal effects. We compare different assignment  mechanisms, and the results suggest that a significant reduction in the average...... duration of unemployment spells may result if a statistical programme assignment model is introduced. We discuss several issues regarding the  plementation of such a system, especially the interplay between the statistical model and  case workers....

  14. AC410 Unit 9 Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

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

  15. Assigning agents to a line

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  16. Who Benefits from Homework Assignments?

    Science.gov (United States)

    Ronning, Marte

    2011-01-01

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

  17. Assessing Contributions to Group Assignments

    Science.gov (United States)

    Johnston, Lucy; Miles, Lynden

    2004-01-01

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

  18. CONTRACT ASSIGNMENT – THEORETICAL ASPECTS

    Directory of Open Access Journals (Sweden)

    Bogdan NAZAT

    2016-12-01

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

  19. A note on ranking assignments using reoptimization

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  20. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

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

    2008-01-01

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

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

    Science.gov (United States)

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

    2011-01-01

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

  2. More General Optimal Offset Assignment

    Directory of Open Access Journals (Sweden)

    Sven Mallach

    2015-06-01

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

  3. The Random Quadratic Assignment Problem

    Science.gov (United States)

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

    2011-11-01

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

  4. 5 CFR 351.705 - Administrative assignment.

    Science.gov (United States)

    2010-01-01

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

  5. Competition Based Neural Networks for Assignment Problems

    Institute of Scientific and Technical Information of China (English)

    李涛; LuyuanFang

    1991-01-01

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

  6. A polyhedral approach to quadratic assignment problem

    OpenAIRE

    Köksaldı, Ahmet Sertaç Murat

    1994-01-01

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

  7. The Mechanism Design Approach to Student Assignment

    Science.gov (United States)

    Pathak, Parag A.

    2011-01-01

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

  8. 5 CFR 870.901 - Assignments permitted.

    Science.gov (United States)

    2010-01-01

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

  9. Integrated assignment and path planning

    Science.gov (United States)

    Murphey, Robert A.

    2005-11-01

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

  10. Stereospecific assignments in proteins using exact NOEs

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-10-18

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

  11. Automatic Assessment of Programming assignment

    Directory of Open Access Journals (Sweden)

    Surendra Gupta

    2012-01-01

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

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

    Science.gov (United States)

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

    2011-01-01

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

  13. Job assignments, intrinsic motivation and explicit incentives

    OpenAIRE

    Nafziger, Julia

    2008-01-01

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

  14. 33 CFR 401.61 - Assigned frequencies.

    Science.gov (United States)

    2010-07-01

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

  15. Optimization of Rated Officer Staff Assignments

    Science.gov (United States)

    2007-06-01

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

  16. A Role-Based Fuzzy Assignment Model

    Institute of Scientific and Technical Information of China (English)

    ZUO Bao-he; FENG Shan

    2002-01-01

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

  17. Stress Assignment in Reading Italian Polysyllabic Pseudowords

    Science.gov (United States)

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

    2013-01-01

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

  18. Effects of Individualized Assignments on Biology Achievement.

    Science.gov (United States)

    Kremer, Philip L.

    1983-01-01

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

  19. Online Discussion Assignments Improve Students' Class Preparation

    Science.gov (United States)

    Lineweaver, Tara T.

    2010-01-01

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

  20. 48 CFR 208.7002 - Assignment authority.

    Science.gov (United States)

    2010-10-01

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

  1. 7 CFR 601.1 - Functions assigned.

    Science.gov (United States)

    2010-01-01

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

  2. A Model of Hierarchical Key Assignment Scheme

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhigang; ZHAO Jing; XU Maozhi

    2006-01-01

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

  3. Detecting Plagiarism in MS Access Assignments

    Science.gov (United States)

    Singh, Anil

    2013-01-01

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

  4. Airport Gate Assignment: New Model and Implementation

    CERN Document Server

    Li, Chendong

    2008-01-01

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

  5. The Assignment Game : The Reduced Game

    OpenAIRE

    Owen, Guillermo

    1992-01-01

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

  6. Dynamic Assignment in Microsimulations of Pedestrians

    CERN Document Server

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

    2014-01-01

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

  7. 5 CFR 870.902 - Making an assignment.

    Science.gov (United States)

    2010-01-01

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

  8. A new routing assignment model for Internet

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

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

  9. Crosstalk-Aware Routing Resource Assignment

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

  10. Competitive Traffic Assignment in Road Networks

    Directory of Open Access Journals (Sweden)

    Krylatov Alexander Y.

    2016-09-01

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

  11. Flexible taxonomic assignment of ambiguous sequencing reads

    Directory of Open Access Journals (Sweden)

    Jansson Jesper

    2011-01-01

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

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

    Directory of Open Access Journals (Sweden)

    de Brevern Alexandre G

    2005-09-01

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

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

    OpenAIRE

    Laynebaril

    2017-01-01

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

  14. Improving active eigenvector assignment through passive modifications

    Science.gov (United States)

    Belotti, R.; Richiedei, D.

    2016-09-01

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

  15. Competition assignment problem algorithm based on Hungarian method

    Institute of Scientific and Technical Information of China (English)

    KONG Chao; REN Yongtai; GE Huiling; DENG Hualing

    2007-01-01

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

  16. Demand assignment in the ACTS LBR system

    Science.gov (United States)

    Palmer, Larry C.; White, Lawrence W.

    1990-05-01

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

  17. From course assignment paper to publishable manuscript.

    Science.gov (United States)

    Rew, Lynn

    2012-12-01

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

  18. Assignment of fields from particles to mesh

    CERN Document Server

    Duque, Daniel

    2016-01-01

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

  19. Writing Assignments that Promote Active Learning

    Science.gov (United States)

    Narayanan, M.

    2014-12-01

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

  20. The Wiener maximum quadratic assignment problem

    CERN Document Server

    Cela, Eranda; Woeginger, Gerhard J

    2011-01-01

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

  1. AC410 Unit 2 Homework Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

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

  2. Evolving Networks with Nonlinear Assignment of Weight

    Institute of Scientific and Technical Information of China (English)

    TANG Chao; TANG Yi

    2006-01-01

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

  3. Experimenting with Request Assignment Simulator (RAS

    Directory of Open Access Journals (Sweden)

    R. Arokia Paul Rajan

    2014-11-01

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

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

    Science.gov (United States)

    2010-10-01

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

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

    Science.gov (United States)

    2010-09-10

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

  6. Feedback for Web-based Assignments.

    Science.gov (United States)

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

    2001-01-01

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

  7. Assignment procedure biases in randomized policy experiments

    DEFF Research Database (Denmark)

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

    2017-01-01

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

  8. Accounting for Sustainability: An Active Learning Assignment

    Science.gov (United States)

    Gusc, Joanna; van Veen-Dirks, Paula

    2017-01-01

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

  9. Tabu search for target-radar assignment

    DEFF Research Database (Denmark)

    Hindsberger, Magnus; Vidal, Rene Victor Valqui

    2000-01-01

    In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued...... that tabu search could be used in near real-time decision making systems...

  10. Politics, Internet Assignments, and Civic Knowledge.

    Science.gov (United States)

    May, Vaughn

    2000-01-01

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

  11. 12 CFR 25.28 - Assigned ratings.

    Science.gov (United States)

    2010-01-01

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

  12. On Online Assignments in a Calculus Class

    Science.gov (United States)

    Jungic, Veselin; Kent, Deborah; Menz, Petra

    2012-01-01

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

  13. A Literature Assignment with a Civic Emphasis.

    Science.gov (United States)

    Brough, Barbara L.

    1989-01-01

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

  14. Writing Assignments Based on Literary Works.

    Science.gov (United States)

    Matthews, Dorothy, Ed.

    1985-01-01

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

  15. Dynamic traffic assignment on parallel computers

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-12-01

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

  16. Test-assignment: a quadratic coloring problem

    NARCIS (Netherlands)

    Duives, Jelle; Lodi, Andrea; Malaguti, Enrico

    2013-01-01

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

  17. Experimental results on quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    N.P. Nikolov

    1999-08-01

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

  18. School Assignment, School Choice and Social Mobility

    Science.gov (United States)

    Burgess, Simon; Briggs, Adam

    2010-01-01

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

  19. Radio labeling with pre-assigned frequencies

    NARCIS (Netherlands)

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

    2007-01-01

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

  20. Assessing the Assignment Policy for Army Women

    Science.gov (United States)

    2007-01-01

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

  1. Improving Marine Corps Assignment of SDAP Levels

    Science.gov (United States)

    2013-03-01

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

  2. Incentivized optimal advert assignment via utility decomposition

    NARCIS (Netherlands)

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

    2014-01-01

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

  3. Generalised Assignment Matrix Methodology in Linear Programming

    Science.gov (United States)

    Jerome, Lawrence

    2012-01-01

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

  4. Teaching Historical Analysis through Creative Writing Assignments

    Science.gov (United States)

    Peterson, Janine Larmon; Graham, Lea

    2015-01-01

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

  5. Semi-infinite assignment and transportation games

    NARCIS (Netherlands)

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

    2001-01-01

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

  6. Democratization of Learning through Thematic Assignment

    Science.gov (United States)

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

    2015-01-01

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

  7. Pole Assignment for Second-Order Systems

    Science.gov (United States)

    CHU, E. K.

    2002-01-01

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

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

    Data.gov (United States)

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

  9. Assigning cause for sudden unexpected infant death.

    Science.gov (United States)

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

    2015-06-01

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

  10. Pole assignment in descriptor periodic systems

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

  11. Weekly Fleet Assignment Model and Algorithm

    Institute of Scientific and Technical Information of China (English)

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

    2007-01-01

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

  12. Online Assignment Algorithms for Dynamic Bipartite Graphs

    CERN Document Server

    Sahai, Ankur

    2011-01-01

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

  13. Assignation of limited resources in pediatrics

    Directory of Open Access Journals (Sweden)

    Garduño Espinosa Armando

    2014-07-01

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

  14. Capacity constrained assignment in spatial databases

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  15. Adaptive Task Assignment in Online Learning Environments

    OpenAIRE

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

    2016-01-01

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

  16. Online Assignment Algorithms for Dynamic Bipartite Graphs

    OpenAIRE

    Sahai, Ankur

    2011-01-01

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

  17. Online Ad Assignment with an Ad Exchange

    OpenAIRE

    Dvořák, Wolfgang; Henzinger, Monika

    2016-01-01

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

  18. Protein secondary structure: category assignment and predictability

    DEFF Research Database (Denmark)

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

    2001-01-01

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

  19. Elementary Components of the Quadratic Assignment Problem

    CERN Document Server

    Chicano, Francisco; Alba, Enrique

    2011-01-01

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

  20. File Assignment Policy in Network Storage System

    Institute of Scientific and Technical Information of China (English)

    Cao Qiang; Xie Chang-sheng

    2003-01-01

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

  1. File Assignment Policy in Network Storage System

    Institute of Scientific and Technical Information of China (English)

    CaoQiang; XieChang-sheng

    2003-01-01

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

  2. Students' Achievement and Homework Assignment Strategies

    Science.gov (United States)

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

    2017-01-01

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

  3. Accurate taxonomic assignment of short pyrosequencing reads.

    Science.gov (United States)

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

    2010-01-01

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

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

    Science.gov (United States)

    Shibata, Kazuaki; Horio, Yoshihiko; Aihara, Kazuyuki

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

  5. 38 CFR 19.3 - Assignment of proceedings.

    Science.gov (United States)

    2010-07-01

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

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

    Science.gov (United States)

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

    2014-01-01

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

  7. Colony location algorithm for assignment problems

    Institute of Scientific and Technical Information of China (English)

    Dingwei WANG

    2004-01-01

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

  8. An Aggregation Approach for Group Multicriteria Assignment

    Directory of Open Access Journals (Sweden)

    George Rigopoulos

    2008-01-01

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

  9. Strategy-Proof Assignment Of Multiple Resources

    DEFF Research Database (Denmark)

    Erlanson, Albin; Szwagrzak, Karol

    2015-01-01

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

  10. Assignments, Details, and Transfers: Overseas Service

    Science.gov (United States)

    2001-08-30

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

  11. Constrained neural approaches to quadratic assignment problems.

    Science.gov (United States)

    Ishii, S; Sato, M

    1998-08-01

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

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

    Directory of Open Access Journals (Sweden)

    Fang Ye

    2011-06-01

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

  13. Gene family assignment-free comparative genomics

    Directory of Open Access Journals (Sweden)

    Doerr Daniel

    2012-12-01

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

  14. Equitable traffic assignment with environmental cost functions

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-01-01

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

  15. Dynamic assignment: there is an equilibrium !

    CERN Document Server

    Meunier, Frédéric

    2008-01-01

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

  16. INDEXING WORKSHOP: HOW TO ASSIGN KEYWORDS

    Energy Technology Data Exchange (ETDEWEB)

    Sternberg, Virginia

    1979-09-01

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

  17. Improving load balance with flexibly assignable tasks

    Energy Technology Data Exchange (ETDEWEB)

    Pinar, Ali; Hendrickson, Bruce

    2003-09-09

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

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

    Science.gov (United States)

    2010-01-01

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

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

    Science.gov (United States)

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

    2010-01-01

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

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

    Science.gov (United States)

    2010-09-10

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

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

    Science.gov (United States)

    Ward, Joe H., Jr.; And Others

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

  2. Solving the k-cardinality assignment problem by transformation

    NARCIS (Netherlands)

    Volgenant, A.

    2004-01-01

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

  3. 7 CFR 762.160 - Assignment of guarantee.

    Science.gov (United States)

    2010-01-01

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

  4. 46 CFR 387.5 - Surplus property assignment recommendation.

    Science.gov (United States)

    2010-10-01

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

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

    Science.gov (United States)

    Cavdar, Gamze; Doe, Sue

    2012-01-01

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

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

    Science.gov (United States)

    Gallicano, Tiffany Derville; Stansberry, Kathleen

    2012-01-01

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

  7. Evolutionary algorithm based index assignment algorithm for noisy channel

    Institute of Scientific and Technical Information of China (English)

    李天昊; 余松煜

    2004-01-01

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

  8. 28 CFR 524.72 - CIM assignment categories.

    Science.gov (United States)

    2010-07-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2010-10-07

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2009-01-01

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

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

    Science.gov (United States)

    2010-07-01

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

  12. Traffic-Aware Channel Assignment in Wireless Sensor Networks

    Science.gov (United States)

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

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

  13. Computational Aspects of Assigning Agents to a Line

    DEFF Research Database (Denmark)

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

    2017-01-01

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

  14. Regulatory focus and the assignment of punishment

    Directory of Open Access Journals (Sweden)

    Chloe Carmichael

    2007-06-01

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

  15. Reference databases for taxonomic assignment in metagenomics.

    Science.gov (United States)

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

    2012-11-01

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

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

    Directory of Open Access Journals (Sweden)

    Rick Bennett

    2014-03-01

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

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

    Science.gov (United States)

    2005-08-18

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

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

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

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

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

    OpenAIRE

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

    2013-01-01

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

  20. Toll modeling in context of road network assignment

    OpenAIRE

    2008-01-01

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

  1. Strategies for Effective Comments on Students’ Written Assignments

    Institute of Scientific and Technical Information of China (English)

    任永东

    2014-01-01

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

  2. CYCLE TIMES ASSIGNMENT OF NONLINEAR DISCRETE EVENT DYNAMIC SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    CHEN Wende

    2000-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Hui Zhao

    2014-01-01

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

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

    CERN Document Server

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

    2016-01-01

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

  5. Personnel shift assignment: Existence conditions and network models

    NARCIS (Netherlands)

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

    1994-01-01

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

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

    Science.gov (United States)

    Maling, Joan; Kim, Soowon

    1992-01-01

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

  7. A Poster Assignment Connects Information Literacy and Writing Skills

    Science.gov (United States)

    Waters, Natalie

    2015-01-01

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

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

    Science.gov (United States)

    Polegato, Rosemary

    2014-01-01

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

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

    Science.gov (United States)

    2010-10-01

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

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

    Science.gov (United States)

    Procidano, Mary E.

    1991-01-01

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

  11. 25 CFR 212.34 - Individual tribal assignments excluded.

    Science.gov (United States)

    2010-04-01

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

  12. The Transformative Potential of Creative Assignments in Higher Education

    Science.gov (United States)

    Duenkel, Nicky

    2013-01-01

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

  13. Automating Formative and Summative Feedback for Individualised Assignments

    Science.gov (United States)

    Hamilton, Ian Robert

    2009-01-01

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

  14. Graduate Writing Assignments across Faculties in a Canadian University

    Science.gov (United States)

    Shi, Ling; Dong, Yanning

    2015-01-01

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

  15. Assigning Grammatical Relations with a Back-off Model

    CERN Document Server

    De Lima, E F

    1997-01-01

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

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

    Science.gov (United States)

    2010-01-01

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

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

    Science.gov (United States)

    Kiernan, Julia; Meier, Joyce; Wang, Xiqiao

    2016-01-01

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

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

    Science.gov (United States)

    2010-01-01

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

  19. New Heuristic Rounding Approaches to the Quadratic Assignment Problem

    CERN Document Server

    Gharibi, Wajeb

    2011-01-01

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

  20. Genetics of traffic assignment models for strategic transport planning

    NARCIS (Netherlands)

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

    2016-01-01

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

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

    NARCIS (Netherlands)

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

    2010-01-01

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

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

    Science.gov (United States)

    2010-10-01

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

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

    Science.gov (United States)

    O'Neill, Patrick B.

    2009-01-01

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

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

    Science.gov (United States)

    2010-07-01

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

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

    Science.gov (United States)

    Leonard, Valorie; LeBrasseur, Rolland

    2008-01-01

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

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

    Science.gov (United States)

    2010-10-01

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

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

    Science.gov (United States)

    2010-10-01

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

  8. 48 CFR 1442.202 - Assignment of contract administration.

    Science.gov (United States)

    2010-10-01

    ... Assignment of contract administration. (a) The decision to withhold normal individual contract administration... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Assignment of contract administration. 1442.202 Section 1442.202 Federal Acquisition Regulations System DEPARTMENT OF THE...

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

    Directory of Open Access Journals (Sweden)

    Yu Jiang

    2013-01-01

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

  10. Multiobjective controller synthesis via eigenstructure assignment with state feedback

    Science.gov (United States)

    Li, Zhao; Lam, James

    2016-10-01

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

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

    Science.gov (United States)

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

    2007-10-11

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

  12. Fast assignment reduction in inconsistent incomplete decision systems

    Institute of Scientific and Technical Information of China (English)

    Min Li; Shaobo Deng; Shengzhong Feng; Jianping Fan

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Wipawee Tharmmaphornphilas

    2010-04-01

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

  14. A New Approach to Pointer Analysis for Assignments

    Institute of Scientific and Technical Information of China (English)

    HUANG Bo; ZANG Binyu; LI Jing; ZHU Chuanqi

    2001-01-01

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

  15. Assignments of autoionization states of O2-asterisk

    Science.gov (United States)

    Wu, C. Y. Robert

    1987-01-01

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

  16. Feeder assignment optimization algorithm for multi-head mounter

    Institute of Scientific and Technical Information of China (English)

    Peng YUAN; Yueming HU; Haiming LIU; Hongxia GAO

    2006-01-01

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

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

    CERN Document Server

    Jiménez, Andrea

    2011-01-01

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

  18. Linear assignment maps for correlated system-environment states

    Energy Technology Data Exchange (ETDEWEB)

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

    2010-01-20

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

  19. Localized Algorithm for Channel Assignment in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Harpreet Kaur

    2015-12-01

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

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

    Science.gov (United States)

    Wu, C. Y. R.

    1982-01-01

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

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

    Science.gov (United States)

    2007-03-30

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

  2. A singular value sensitivity approach to robust eigenstructure assignment

    DEFF Research Database (Denmark)

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

    1986-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Hao Liu

    2010-01-01

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

  4. Task Assignment Problem Solved by Continuous Hopfield Network

    Directory of Open Access Journals (Sweden)

    Ettaouil Mohamed

    2012-03-01

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

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

    Directory of Open Access Journals (Sweden)

    Yavuz OZDEMIR

    2012-01-01

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

  6. Recommender Systems for the Conference Paper Assignment Problem

    CERN Document Server

    Conry, Don; Ramakrishnan, Naren

    2009-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Munaretto Anelise

    2011-01-01

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

  8. Calibrated peer review assignments for the earth sciences

    Science.gov (United States)

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

    2009-01-01

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

  9. wrtg391 full course [ all discussions and all assignments

    OpenAIRE

    Laynebaril

    2017-01-01

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

  10. HSA 505 Week 3 Assignment 1  Product Development

    OpenAIRE

    Laynebaril1

    2017-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Lei Li

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

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

    Science.gov (United States)

    2016-02-01

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

  14. Locomotive assignment problem with train precedence using genetic algorithm

    OpenAIRE

    Noori, Siamak; Ghannadpour, Seyed

    2012-01-01

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

  15. A parametric visualization software for the assignment problem

    Directory of Open Access Journals (Sweden)

    Papamanthou Charalampos

    2005-01-01

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

  16. The challenge of expenditure-assignment reform in Russia

    OpenAIRE

    1994-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    S. Prakash

    2012-01-01

    Full Text Available

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

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

  19. A New Approach to Pointer Analysis for Assignments

    Institute of Scientific and Technical Information of China (English)

    黄波; 臧斌宇; 等

    2001-01-01

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

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

    Science.gov (United States)

    Jackson, Justin Patrick

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

  1. Socially-assigned race, healthcare discrimination and preventive healthcare services.

    Directory of Open Access Journals (Sweden)

    Tracy Macintosh

    Full Text Available BACKGROUND: Race and ethnicity, typically defined as how individuals self-identify, are complex social constructs. Self-identified racial/ethnic minorities are less likely to receive preventive care and more likely to report healthcare discrimination than self-identified non-Hispanic whites. However, beyond self-identification, these outcomes may vary depending on whether racial/ethnic minorities are perceived by others as being minority or white; this perception is referred to as socially-assigned race. PURPOSE: To examine the associations between socially-assigned race and healthcare discrimination and receipt of selected preventive services. METHODS: Cross-sectional analysis of the 2004 Behavioral Risk Factor Surveillance System "Reactions to Race" module. Respondents from seven states and the District of Columbia were categorized into 3 groups, defined by a composite of self-identified race/socially-assigned race: Minority/Minority (M/M, n = 6,837, Minority/White (M/W, n = 929, and White/White (W/W, n = 25,913. Respondents were 18 years or older, with 61.7% under age 60; 51.8% of respondents were female. Measures included reported healthcare discrimination and receipt of vaccinations and cancer screenings. RESULTS: Racial/ethnic minorities who reported being socially-assigned as minority (M/M were more likely to report healthcare discrimination compared with those who reported being socially-assigned as white (M/W (8.9% vs. 5.0%, p = 0.002. Those reporting being socially-assigned as white (M/W and W/W had similar rates for past-year influenza (73.1% vs. 74.3% and pneumococcal (69.3% vs. 58.6% vaccinations; however, rates were significantly lower among M/M respondents (56.2% and 47.6%, respectively, p-values<0.05. There were no significant differences between the M/M and M/W groups in the receipt of cancer screenings. CONCLUSIONS: Racial/ethnic minorities who reported being socially-assigned as white are more likely to receive

  2. An integer programming model for assigning students to elective courses

    Directory of Open Access Journals (Sweden)

    Ivo Beroš

    2015-10-01

    Full Text Available This paper deals with the problem of assigning students to elective courses according to their preferences. This process of assigning students to elective courses according to their preferences often places before academic institutions numerous obstacles, the most typical being a limited number of students who can be assigned to any particular class. Furthermore, due to financial or technical reasons, the maximum number of the elective courses is determined in advance, meaning that the institution decides which courses to conduct. Therefore, the expectation that all the students will be assigned to their first choice of courses is not realistic (perfect satisfaction. This paper presents an integer programming model that maximizes the total student satisfaction in line with a number of different constraints. The measure of student satisfaction is based on a student's order of preference according to the principle: the more a choice is met the higher the satisfaction. Following the basic model, several versions of the models are generated to cover possible real-life situations, while taking into consideration the manner student satisfaction is measured, as well as the preference of academic institution within set technical and financial constraints. The main contribution of the paper is introducing the concept of the minimal student satisfaction level that reduces the number of students dissatised with the courses to which they were assigned.

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

    Directory of Open Access Journals (Sweden)

    Galina Kavaliauskiené

    2007-10-01

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

  4. Wildlife forensic science: A review of genetic geographic origin assignment.

    Science.gov (United States)

    Ogden, Rob; Linacre, Adrian

    2015-09-01

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

  5. Channel assignment under a conflict-free allocation policy

    Science.gov (United States)

    Stavrakakis, Ioannis

    1994-02-01

    In this paper, a random, conflict-free slot assignment policy is adopted for the allocation of a common channel between two (non-communicating) stations. Although this policy is inferior to the optimal periodic, fixed slot assignment policy, it is shown than it achieves the performance of that optimal policy as the variance of the packet arrival process increases. The main advantage of the random, conflict-free slot assignment policy is that it is simple and always feasible unlike the optimal, periodic, fixed slot assignment policy. Furthermore, the proposed policy is easily implemented in a dynamically changing environment; the optimal of such a policy is derived, and a simple strategy based on a threshold test is developed for the identification of the optimal such policy, when estimates of the traffic parameters are available. No such strategy is known for the adaptation of the parameters of the optimal periodic, fixed slot assignment policy. The developed analysis approach can be applied, to a great extent, to a system with more than two stations.

  6. Raman vapor spectrum and vibrational assignment for pyridine

    Science.gov (United States)

    Klots, T. D.

    1998-09-01

    Assignment modifications for the pyridine fundamentals are proposed, based on first time Raman vapor measurements, and a more complete set of infrared and Raman spectra for the gas and liquid. Raman polarization measurements are newly given for some 70 lines between 1600 and 3000 cm -1. The Kakiuti et al. (Kakiuti et al., J. Mol. Spectrosc. 61 (1976) 164) assignment for the nonplanar modes in CS 2 solution is shown to be the only previous correct assignment. Planar assignment modifications, though generally small, are warranted because of the benchmark nature of pyridine. A previous set of vibrational frequencies, derived from a scaled 4-21G force field calculation (Pongor et al., J. Am. Chem. Soc. 106 (1984) 2765; Pongor et al., J. Mol. Spectrosc. 114 (1985) 445), is in excellent agreement with the observed fundamentals, and in fact, tips the balance in favor of assigning ν22 to 1053 cm -1. Ideal-gas entropies derived from spectroscopic constants are also seen to be in excellent agreement with those from calorimetry (Chirico et al., J. Chem. Thermodyn. 28 (1996) 797; Chirico and Steele, J. Chem. Thermodyn. 28 (1996) 819).

  7. Simulation Optimization of the Crossdock Door Assignment Problem

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

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

  8. The ICAP (Interactive Course Assignment Pages Publishing System

    Directory of Open Access Journals (Sweden)

    Kim Griggs

    2008-03-01

    Full Text Available The ICAP publishing system is an open source custom content management system that enables librarians to easily and quickly create and manage library help pages for course assignments (ICAPs, without requiring knowledge of HTML or other web technologies. The system's unique features include an emphasis on collaboration and content reuse and an easy-to-use interface that includes in-line help, simple forms and drag and drop functionality. The system generates dynamic, attractive course assignment pages that blend Web 2.0 features with traditional library resources, and makes the pages easier to find by providing a central web page for the course assignment pages. As of December 2007, the code is available as free, open-source software under the GNU General Public License.

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

    DEFF Research Database (Denmark)

    Barth, Torben C.

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

  10. Assignment of sex in neonates with ambiguous genitalia.

    Science.gov (United States)

    Reiner, W G

    1999-08-01

    Sex assignment in the newborn with ambiguous genitalia has been based on the adequacy of the phallus in the male, potential fertility in the female, and cosmetic appearance of the reconstructed genitalia. Recent data from both the neurosciences and from clinical research, however, casts doubt on the validity of such criteria for clinical decision making. Current knowledge suggests a need to shift away from the current clinical approach and to incorporate these new data into decisions based on a broader understanding of the etiology of gender identity. Recognition of the primacy of psychosocial and psychosexual developmental outcomes for children with ambiguous genitalia is lending direction to longitudinal outcomes research. New approaches to sex assignment have been suggested, and the paradigm for sex assignment in the newborn period is in transition.

  11. A Stone Resource Assignment Model under the Fuzzy Environment

    Directory of Open Access Journals (Sweden)

    Liming Yao

    2012-01-01

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

  12. Assigning on-ramp flows to maximize highway capacity

    Science.gov (United States)

    Wang, Qiao-Ming; Jiang, Rui; Sun, Xiao-Yan; Wang, Bing-Hong

    2009-09-01

    In this paper, we study the capacity of a highway with two on-ramps by using a cellular automata traffic flow model. We investigate how to improve the system capacity by assigning traffic flow to the two ramps. The system phase diagram is presented and different regions are classified. It is shown that in region I, in which both ramps are in free flow and the main road upstream of the ramps is in congestion, assigning a higher proportion of the demand to the upstream on-ramp could improve the overall flow, which is consistent with previous studies. This is explained through studying the spatiotemporal patterns and analytical investigations. In contrast, optimal assignment has not been observed in other regions. We point out that our result is robust and model independent under certain conditions.

  13. Quality control test for sequence-phenotype assignments.

    Directory of Open Access Journals (Sweden)

    Maria Teresa Lara Ortiz

    Full Text Available Relating a gene mutation to a phenotype is a common task in different disciplines such as protein biochemistry. In this endeavour, it is common to find false relationships arising from mutations introduced by cells that may be depurated using a phenotypic assay; yet, such phenotypic assays may introduce additional false relationships arising from experimental errors. Here we introduce the use of high-throughput DNA sequencers and statistical analysis aimed to identify incorrect DNA sequence-phenotype assignments and observed that 10-20% of these false assignments are expected in large screenings aimed to identify critical residues for protein function. We further show that this level of incorrect DNA sequence-phenotype assignments may significantly alter our understanding about the structure-function relationship of proteins. We have made available an implementation of our method at http://bis.ifc.unam.mx/en/software/chispas.

  14. Quality Control Test for Sequence-Phenotype Assignments

    Science.gov (United States)

    Ortiz, Maria Teresa Lara; Rosario, Pablo Benjamín Leon; Luna-Nevarez, Pablo; Gamez, Alba Savin; Martínez-del Campo, Ana; Del Rio, Gabriel

    2015-01-01

    Relating a gene mutation to a phenotype is a common task in different disciplines such as protein biochemistry. In this endeavour, it is common to find false relationships arising from mutations introduced by cells that may be depurated using a phenotypic assay; yet, such phenotypic assays may introduce additional false relationships arising from experimental errors. Here we introduce the use of high-throughput DNA sequencers and statistical analysis aimed to identify incorrect DNA sequence-phenotype assignments and observed that 10–20% of these false assignments are expected in large screenings aimed to identify critical residues for protein function. We further show that this level of incorrect DNA sequence-phenotype assignments may significantly alter our understanding about the structure-function relationship of proteins. We have made available an implementation of our method at http://bis.ifc.unam.mx/en/software/chispas. PMID:25700273

  15. Quality control test for sequence-phenotype assignments.

    Science.gov (United States)

    Ortiz, Maria Teresa Lara; Rosario, Pablo Benjamín Leon; Luna-Nevarez, Pablo; Gamez, Alba Savin; Martínez-del Campo, Ana; Del Rio, Gabriel

    2015-01-01

    Relating a gene mutation to a phenotype is a common task in different disciplines such as protein biochemistry. In this endeavour, it is common to find false relationships arising from mutations introduced by cells that may be depurated using a phenotypic assay; yet, such phenotypic assays may introduce additional false relationships arising from experimental errors. Here we introduce the use of high-throughput DNA sequencers and statistical analysis aimed to identify incorrect DNA sequence-phenotype assignments and observed that 10-20% of these false assignments are expected in large screenings aimed to identify critical residues for protein function. We further show that this level of incorrect DNA sequence-phenotype assignments may significantly alter our understanding about the structure-function relationship of proteins. We have made available an implementation of our method at http://bis.ifc.unam.mx/en/software/chispas.

  16. CAPA-An integrated computer-assisted personalized assignment system

    Science.gov (United States)

    Kashy, E.; Sherrill, B. M.; Tsai, Y.; Thaler, D.; Weinshank, D.; Engelmann, M.; Morrissey, D. J.

    1993-12-01

    A new integrated computer-assisted personalized assignment (CAPA) system that creates individual assignments for each student has been developed and found to be a powerful motivator. The CAPA system allows students to enter their answers to personalized assignments directly via networked terminals, gives immediate feedback and hints (allowing challenging questions), while providing the instructor with on-line performance information. The students are encouraged to study together which is known to be an effective learning strategy, but each must still obtain his/her own correct answers. Students are allowed to re-enter solutions to the problems before the due date without penalty, thus providing students with different skills levels the opportunity and incentive to understand the material without being judged during the learning process. The features and operation of the system are described, observations on its use in an introductory general physics class are reported, and some of the highly favorable student reactions are included.

  17. Graphical interpretation of Boolean operators for protein NMR assignments

    Energy Technology Data Exchange (ETDEWEB)

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

    2008-09-15

    We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies 'AND'-, 'OR'- and 'NOT'-like operations on planes pulled out of the classical three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal.

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

    Science.gov (United States)

    Cho, Hsun-Jung; Huang, Heng

    2007-12-01

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  20. Regional pole assignment for uncertain delta-operator systems

    Institute of Scientific and Technical Information of China (English)

    Man LIU; Yuanwei JING; Siying ZHANG

    2004-01-01

    The pole assignment in a specified disk by state feedback for uncertain delta-operator systems is studied.By making use of algebra Riccati equations,a sufficient and necessary condition of pole assignment for a kind of parameter uncertain delta-operator system in a specified disk by state feedback is presented.And the design method of state feedback controller is also developed.The proposed method can unify some previous related results of continuous and discrete time systems into the delta framework.The efficiency of the design method is illustrated by a numerical example.

  1. Selection and Assignment of Machines: a Parallel Aproach

    OpenAIRE

    Francisco Ribeiro, José

    2003-01-01

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

  2. MAT 300  Assignment 1: Bottling Company Case Study

    OpenAIRE

    Laynebaril

    2017-01-01

     MAT 300  Assignment 1: Bottling Company Case Study Click Link Below To Buy: http://hwcampus.com/shop/mat-300-assignment-1-bottling-company-case-study/   Due Week 10 and worth 140 points Imagine you are a manager at a major bottling company. Customers have begun to complain that the bottles of the brand of soda produced in your company contain less than the advertised sixteen (16) ounces of product. Your boss wants to solve the problem at hand and has asked you to investig...

  3. AC 410 AC410 AC410 Unit 7 Homework Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

    AC 410 AC410 AC410 Unit 7 Homework Assignment Click Link Below To Buy: http://hwcampus.com/shop/ac410-unit-7-homework-assignment/    Questions Requiring Analysis 14-30   Early in your first audit of Star Corporation, you notice that sales and year-end inventory are almost unchanged from the prior year. However, cost of goods sold is less than in the preceding year, and accounts payable also are down substantially. Gross profit has increased, but this increase has not c...

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

    OpenAIRE

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

    2011-01-01

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

  5. Convergence properties of the softassign quadratic assignment algorithm.

    Science.gov (United States)

    Rangarajan, A; Vuille, A; Mjolsness, E

    1999-08-15

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

  6. Routing and wavelength assignment in hierarchical WDM networks

    Institute of Scientific and Technical Information of China (English)

    Yiyi LU; Ruxiang JIN; Chen HE

    2008-01-01

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

  7. New Method for Spin Assignment of Superdeformed Rotational Bands

    Institute of Scientific and Technical Information of China (English)

    MU Liang-Zhu; WU Chong-Shi

    2005-01-01

    A new method for spin assignment of superdeformed rotational bands is proposed and it turns out to be more efficient than other methods used before. The application is made to superdeformed bands in A ~ 190 and A ~ 150 mass regions. By analyzing the standard deviation of the fixed γ-ray energies of an SD band in different methods,the advantage of the present method over the other methods is presented. This method brings then a comprehensive interpretation of the methods used in spin assignment.

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

    Science.gov (United States)

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

    2015-11-24

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

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

    Directory of Open Access Journals (Sweden)

    Enrique de la Hoz

    2015-11-01

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

  10. A Competitive and Experiential Assignment in Search Engine Optimization Strategy

    Science.gov (United States)

    Clarke, Theresa B.; Clarke, Irvine, III

    2014-01-01

    Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be…

  11. 48 CFR 1552.211-74 - Work assignments.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 6 2010-10-01 2010-10-01 true Work assignments. 1552.211-74 Section 1552.211-74 Federal Acquisition Regulations System ENVIRONMENTAL PROTECTION AGENCY CLAUSES... not allow for any change to the terms or conditions of the contract. Where any language in the...

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

    Institute of Scientific and Technical Information of China (English)

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

    2004-01-01

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

  13. Developing Team Skills through a Collaborative Writing Assignment

    Science.gov (United States)

    Thomas, Theda Ann

    2014-01-01

    Employers want students who are able to work effectively as members of a team, and expect universities to develop this ability in their graduates. This paper proposes a framework for a collaborative writing assignment that specifically develops students' ability to work in teams. The framework has been tested using two iterations of an action…

  14. 48 CFR 552.232-23 - Assignment of Claims.

    Science.gov (United States)

    2010-10-01

    ... following is substituted therefor: In order to prevent confusion and delay in making payment, the Contractor..., including any Federal lending agency, under the provisions of the Assignment of Claims Act, as amended, 31 U.S.C. 3727, 41 U.S.C. 15 (hereinafter referred to as “the Act”), all amounts due or to become...

  15. Using Clouds for MapReduce Measurement Assignments

    Science.gov (United States)

    Rabkin, Ariel; Reiss, Charles; Katz, Randy; Patterson, David

    2013-01-01

    We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services and the standard Hadoop API. Using the standard API, students directly experienced the quality of industrial big-data tools. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware,…

  16. Unintended Cognitive, Affective, and Behavioral Consequences of Group Assignments

    Science.gov (United States)

    Neu, Wayne A.

    2012-01-01

    Pedagogical strategies can be thought of as a set of stimuli placed in students' environment to influence their cognition, affect, and behavior. The design of strategies such as group assignments and a comprehensive understanding of their consequences for students should then include an analysis of all three of these elements and the…

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

    Institute of Scientific and Technical Information of China (English)

    Xiaoxuan Hu; Huawei Ma; Qingsong Ye; He Luo

    2015-01-01

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

  18. Integrating Video Documentary into the Classroom: A Community Assessment Assignment

    Science.gov (United States)

    Levinson, Samantha G.; Caldwell, Keith; Petracchi, Helen E.; Wexler, Sandra; Engel, Rafael

    2016-01-01

    Community assessment is a strategy commonly taught to social work students to identify a community's strengths and challenges. This article describes the value of using video documentary as part of a community assessment assignment. We identify the advantages of using video documentary in the assessment process and the reporting of findings. We…

  19. UAV Cooperative Multiple Task Assignments using Genetic Algorithms

    Science.gov (United States)

    2005-06-01

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

  20. A Competitive and Experiential Assignment in Search Engine Optimization Strategy

    Science.gov (United States)

    Clarke, Theresa B.; Clarke, Irvine, III

    2014-01-01

    Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be new…

  1. 75 FR 55355 - Delegation of Authority and Assignment of Responsibility

    Science.gov (United States)

    2010-09-10

    ... the meaning of the Migrant and Seasonal Agricultural Worker Protection Act, 29 U.S.C. 1802(3... Occupational Safety and Health. 1. Purpose. To delegate authority and assign responsibility to the Assistant Secretary for Occupational Safety and Health. 2. Authorities and Directives Affected. A. Authorities....

  2. Assigning Main Orientation to an EOH Descriptor on Multispectral Images.

    Science.gov (United States)

    Li, Yong; Shi, Xiang; Wei, Lijun; Zou, Junwei; Chen, Fang

    2015-07-01

    This paper proposes an approach to compute an EOH (edge-oriented histogram) descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform) on multispectral images, but does not assign a main orientation to keypoints. Alternatively, it tends to assign the same main orientation to every keypoint, e.g., zero degrees. This limits EOH to matching keypoints between images of translation misalignment only. Observing this limitation, we propose assigning to keypoints the main orientation that is computed with PIIFD (partial intensity invariant feature descriptor). In the proposed method, SIFT keypoints are detected from images as the extrema of difference of Gaussians, and every keypoint is assigned to the main orientation computed with PIIFD. Then, EOH is computed for every keypoint with respect to its main orientation. In addition, an implementation variant is proposed for fast computation of the EOH descriptor. Experimental results show that the proposed approach performs more robustly than the original EOH on image pairs that have a rotation misalignment.

  3. The Complexity of Approximately Counting Stable Roommate Assignments

    CERN Document Server

    Chebolu, Prasad; Martin, Russell

    2010-01-01

    We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the $k$-attribute model, in which the preference lists are determined by dot products of "preference vectors" with "attribute vectors" and (ii) the $k$-Euclidean model, in which the preference lists are determined by the closeness of the "positions" of the people to their "preferred positions". Exactly counting the number of assignments is #P-complete, since Irving and Leather demonstrated #P-completeness for the special case of the stable marriage problem. We show that counting the number of stable roommate assignments in the $k$-attribute model ($k \\geq 4$) and the $3$-Euclidean model($k \\geq 3$) is interreducible, in an approximation-preserving sense, with counting independent sets (of all sizes) (#IS) in a graph, or counting the number of satisfying assignments of a Boolean formula (#SAT). This means that there can be no FPRAS for any of these problems unless NP=RP. As a consequence, we infer that there ...

  4. 46 CFR 42.13-10 - Freeboards assigned vessels.

    Science.gov (United States)

    2010-10-01

    ..., inclusive. (b) Vessels carrying timber deck cargoes may be assigned, in addition to the freeboards required by paragraph (a) of this section, timber freeboards in accordance with the provisions of §§ 42.25-1... Commandant under the procedure of paragraph (f) of this section. (d) Vessels of wood or of...

  5. Challenges and Dilemmas in Implementing Random Assignment in Educational Research

    Science.gov (United States)

    Ong-Dean, Colin; Hofstetter, Carolyn Huie; Strick, Betsy R.

    2011-01-01

    In the contentious debate over the use of randomized clinical trials (RCTs) in education research, little attention has been given to how methodological issues arise and/or are resolved in the implementation of random assignment. Following a review of the methodological-theoretical literature on RCTs and alternative research designs, this article…

  6. Assigning Main Orientation to an EOH Descriptor on Multispectral Images

    Directory of Open Access Journals (Sweden)

    Yong Li

    2015-07-01

    Full Text Available This paper proposes an approach to compute an EOH (edge-oriented histogram descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform on multispectral images, but does not assign a main orientation to keypoints. Alternatively, it tends to assign the same main orientation to every keypoint, e.g., zero degrees. This limits EOH to matching keypoints between images of translation misalignment only. Observing this limitation, we propose assigning to keypoints the main orientation that is computed with PIIFD (partial intensity invariant feature descriptor. In the proposed method, SIFT keypoints are detected from images as the extrema of difference of Gaussians, and every keypoint is assigned to the main orientation computed with PIIFD. Then, EOH is computed for every keypoint with respect to its main orientation. In addition, an implementation variant is proposed for fast computation of the EOH descriptor. Experimental results show that the proposed approach performs more robustly than the original EOH on image pairs that have a rotation misalignment.

  7. Wavelength and fiber assignment problems on avionic networks

    DEFF Research Database (Denmark)

    Zhang, Jiang; An, Yi; Berger, Michael Stübert;

    2011-01-01

    This paper solves the wavelength and fiber assignment problems with systems' isolation requirements on the avionic ring networks. The experiment results give a general glace of the numbers of the wavelengths and fibers are required under certain scale of networks. At the beginning of increasing...

  8. A Randomized Experiment Comparing Random and Cutoff-Based Assignment

    Science.gov (United States)

    Shadish, William R.; Galindo, Rodolfo; Wong, Vivian C.; Steiner, Peter M.; Cook, Thomas D.

    2011-01-01

    In this article, we review past studies comparing randomized experiments to regression discontinuity designs, mostly finding similar results, but with significant exceptions. The latter might be due to potential confounds of study characteristics with assignment method or with failure to estimate the same parameter over methods. In this study, we…

  9. Effect of Sex Identification on Instrument Assignment by Band Directors

    Science.gov (United States)

    Johnson, Christopher M.; Stewart, Erin E.

    2004-01-01

    The purpose of this study was to investigate the effect of sex identification on the assignment of instruments to beginning band students. Participants were band directors solicited at music conferences and music education students solicited from major universities across the United States. Participants completed an online survey about instrument…

  10. The Rescue Mission: Assigning Guilt to a Chaotic Scene.

    Science.gov (United States)

    Procter, David E.

    1987-01-01

    Seeks to identify rhetorical distinctiveness of the rescue mission as a form of belligerency--examining presidential discourse justifying the 1985 Lebanon intervention, the 1965 Dominican intervention, and the 1983 Grenada intervention. Argues that the distinction is in guilt narrowly assigned to a chaotic scene and the concomitant call for…

  11. Understanding and Supporting the Career Implications of International Assignments

    Science.gov (United States)

    Collings, David G.; Doherty, Noeleen; Luethy, Madeleine; Osborn, Derek

    2011-01-01

    International assignments represent an important form of migration in the global economy. In contrast to most other migrants, international assignees enjoy a relatively privileged position in the labor market. Authored by a diverse team of academics and practitioners, this paper draws on insights from empirical research and unpublished examples…

  12. Derandomization of Online Assignment Algorithms for Dynamic Graphs

    CERN Document Server

    Sahai, Ankur

    2011-01-01

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

  13. Concept Maps as Cognitive Visualizations of Writing Assignments

    Science.gov (United States)

    Villalon, Jorge; Calvo, Rafael A.

    2011-01-01

    Writing assignments are ubiquitous in higher education. Writing develops not only communication skills, but also higher-level cognitive processes that facilitate deep learning. Cognitive visualizations, such as concept maps, can also be used as part of learning activities including as a form of scaffolding, or to trigger reflection by making…

  14. Connecting Student and Subject Matter: The Cultural Artifact Discussion Assignment

    Science.gov (United States)

    Smith-Sanders, Alane K.

    2008-01-01

    This article presents a class activity where students work in dyads to select an artifact related to a course topic and, using this artifact, develop discussion questions to engage their classmates. This cultural artifact assignment is intended to, in part, answer John Dewey's call to cultivate connections between subject matter and life…

  15. Single Assignment C (SAC): High Productivity meets High Performance

    NARCIS (Netherlands)

    Grelck, C.; Zsók, V; Horváth, Z; Plasmeijer, R

    2012-01-01

    We present the ins and outs of the purely functional, data parallel programming language SaC (Single Assignment C). SaC defines state- and side-effect-free semantics on top of a syntax resembling that of imperative languages like C/C++/C# or Java: functional programming with curly brackets. In contr

  16. 48 CFR 208.7003-2 - Assignments under coordinated acquisition.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignments under coordinated acquisition. 208.7003-2 Section 208.7003-2 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE ACQUISITION PLANNING REQUIRED SOURCES OF SUPPLIES...

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

    Science.gov (United States)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman

    2009-08-01

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

  18. A new heuristic for the quadratic assignment problem

    OpenAIRE

    Zvi Drezner

    2002-01-01

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

  19. Nursing Distance Learning Course Comparison of Assignments and Examination Scores

    Science.gov (United States)

    Mundine, Jennifer

    2016-01-01

    Nursing programs have embraced distance learning in their curricula, but discussion is ongoing about course assignments and grading criteria to increase examination scores in nursing distance learning courses. Because course examinations are a predictor of success on the postgraduate licensing examination (NCLEX-RN), the purpose of this study was…

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

    Institute of Scientific and Technical Information of China (English)

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

    2009-01-01

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

  1. 34 CFR 682.508 - Assignment of a loan.

    Science.gov (United States)

    2010-07-01

    ... 34 Education 3 2010-07-01 2010-07-01 false Assignment of a loan. 682.508 Section 682.508 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION FEDERAL FAMILY EDUCATION LOAN (FFEL) PROGRAM Federal Guaranteed Student Loan...

  2. Undergraduates Improve upon Published Crystal Structure in Class Assignment

    Science.gov (United States)

    Horowitz, Scott; Koldewey, Philipp; Bardwell, James C.

    2014-01-01

    Recently, 57 undergraduate students at the University of Michigan were assigned the task of solving a crystal structure, given only the electron density map of a 1.3 Å crystal structure from the electron density server, and the position of the N-terminal amino acid. To test their knowledge of amino acid chemistry, the students were not given the…

  3. Mental reconstruction:Semantic property assignment of 'along'

    Institute of Scientific and Technical Information of China (English)

    苏都

    2010-01-01

    This article is an attempt to discuss the semantic properties of the word 'along'in the context of general syntax. It reveals that the meaning of it covers two parts of speechin the process of mental reconstruction while interacting with adjacent syntactic components.In this process semantic property assignment does concerns some distinct principles,such asforegrounding and the like.

  4. 37 CFR 1.46 - Assigned inventions and patents.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Assigned inventions and patents. 1.46 Section 1.46 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES National Processing Provisions Who May...

  5. A Research-Based Narrative Assignment for Global Health Education

    Science.gov (United States)

    Lencucha, Raphael

    2014-01-01

    There is a paucity of research on novel approaches to classroom-based global health education despite the growing popularity of this topic in health professional curricula. The purpose of the following paper is to (1) describe the rationale underlying the use of a research-based narrative assignment for global health education, and (2) describe…

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

    NARCIS (Netherlands)

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

    2013-01-01

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

  7. The Quadratic Assignment Problem is Easy for Robinsonian Matrices

    NARCIS (Netherlands)

    Laurent, M.; Seminaroti, M.

    2014-01-01

    We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A;B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson (dis)

  8. A bilinear programming solution to the quadratic assignment problem

    NARCIS (Netherlands)

    J.F. Kaashoek (Johan); J.H.P. Paelinck (Jean)

    1999-01-01

    textabstractThe quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and Wolkowicz, 1994). One of the authors has published some material, in which it was tried, by structuring the problem additionally, to bring it as closely as possible in the

  9. The quadratic assignment problem is easy for robinsonian matrices

    NARCIS (Netherlands)

    Laurent, M.; Seminaroti, M.

    2015-01-01

    We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans–Beckman form QAP(A,B), by showing that the identity permutation is optimal when AA and BB are respectively a Robinson similarity and dissimilarity matrix and one of AA or BB is a Toeplitz matrix. A Robinson (

  10. Preconditions of origin, essence and assignment of strategic managerial accounting

    OpenAIRE

    Boiko, I

    2010-01-01

    The article is devoted to the research of preconditions and necessity of creation strategic managerial accounting in the accounting system of enterprise. There are investigated economic essence and assignment of strategic managerial accounting and substantiated its importance for making strategic decisions on an enterprise.

  11. 31 CFR 306.40 - Execution of assignments.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Execution of assignments. 306.40 Section 306.40 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE TREASURY BUREAU OF THE PUBLIC DEBT GENERAL REGULATIONS GOVERNING...

  12. 31 CFR 306.41 - Form of assignment.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Form of assignment. 306.41 Section 306.41 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE TREASURY BUREAU OF THE PUBLIC DEBT GENERAL REGULATIONS GOVERNING...

  13. 31 CFR 306.43 - Voidance of assignments.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Voidance of assignments. 306.43 Section 306.43 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE TREASURY BUREAU OF THE PUBLIC DEBT GENERAL REGULATIONS GOVERNING...

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  15. Assignment of circadian function for the Neurospora clock gene frequency

    NARCIS (Netherlands)

    Merrow, Martha; Brunner, Michael; Roenneberg, Till

    1999-01-01

    Circadian clocks consist of three elements: entrainment pathways (inputs), the mechanism generating the rhythmicity (oscillator), and the output pathways that control the circadian rhythms. It is difficult to assign molecular clock components to any one of these elements. Experiments show that input

  16. Probabilistic assignment of formulas to mass peaks in metabolomics experiments

    NARCIS (Netherlands)

    Rogers, Simon; Scheltema, Richard A.; Girolami, Mark; Breitling, Rainer

    2009-01-01

    Motivation: High-accuracy mass spectrometry is a popular technology for high-throughput measurements of cellular metabolites (metabolomics). One of the major challenges is the correct identification of the observed mass peaks, including the assignment of their empirical formula, based on the measure

  17. Comparison of Categorical Assignments of the BSRI and the PAQ.

    Science.gov (United States)

    Gaa, John P.; Liberman, Dov

    The degree of agreement between the Bem Sex Role Inventory (BSRI) and the Personality Attributes Questionnaire (PAQ) in assigning sex role categories was investigated by administering both instruments to undergraduate education majors. As a result of scoring, subjects were classified as androgynous, masculine, feminine, or undifferentiated. It was…

  18. Comparing User-Assigned Terms with Indexer-Assigned Terms for Storage and Retrieval of Moving Images: Research Results.

    Science.gov (United States)

    Turner, James M.

    1995-01-01

    Discussion of indexing moving image documents at the shot level focuses on a study conducted at the National Film Board of Canada. Popular terms supplied by users were compared with terms assigned by professional indexers in the source stockshot collection. Results suggest that indexing images using preiconographic (ofness) and iconographic…

  19. Systematic assignment of thermodynamic constraints in metabolic network models

    Directory of Open Access Journals (Sweden)

    Heinemann Matthias

    2006-11-01

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

  20. An Example of Yak Paternity Assignment by Microsatellite Genotyping

    Institute of Scientific and Technical Information of China (English)

    王敏强

    2005-01-01

    12 cattle microsatellite DNA markers were used for establishing the paternity of 4 Datong Yak calves.The results indicated that paternity can be assigned by use of exclusion method directely when the mother is clearly known and data of all likely sires were obtained. The more the alleles of a locus possessed, the more effectively the paternity can be assigned. Not only the microsatellite DNA marker is a promising tool in establishment of yak detail pedigrees, but also can provide us information of reproductive efficiency of the bull(s) based on the numbers of calves it produced in the herd, which will be useful in speeding up the processes of yak genetics improvement.

  1. An Assignment Method for IPUs in Distributed Systems

    Institute of Scientific and Technical Information of China (English)

    LI Liang; YANG Guowei

    1999-01-01

    In a distributed system, one of themost important things is to establish an assignment method fordistributing tasks. It is assumed that a distributed system does nothave a central administrator, all independent processing units in this systemwant to cooperate for the best results, but they cannot know theconditions of one another. So in order to undertake the tasks inadmirable proportions, they have to adjust their undertaking tasks onlyby self-learning. In this paper, the performance of thissystem is analyzed by Markov chains, and a robust method of self-learningfor independent processing units in this kind of systems is presented.This method can lead the tasks of the system to be distributed very wellamong all the independent processing units, and can also be used tosolve the general assignment problem.

  2. Mapping Learning Outcomes and Assignment Tasks for SPIDER Activities

    Directory of Open Access Journals (Sweden)

    Lyn Brodie

    2011-05-01

    Full Text Available Modern engineering programs have to address rapidly changing technical content and have to enable students to develop transferable skills such as critical evaluation, communication skills and lifelong learning. This paper introduces a combined learning and assessment activity that provides students with opportunities to develop and practice their soft skills, but also extends their theoretical knowledge base. Key tasks included self directed inquiry, oral and written communication as well as peer assessment. To facilitate the SPIDER activities (Select, Prepare and Investigate, Discuss, Evaluate, Reflect, a software tool has been implemented in the learning management system Moodle. Evidence shows increased student engagement and better learning outcomes for both transferable as well as technical skills. The study focuses on generalising the relationship between learning outcomes and assignment tasks as well as activities that drive these tasks. Trail results inform the approach. Staff evaluations and their views of assignments and intended learning outcomes also supported this analysis.

  3. Special secret sharing scheme with the function of assignment

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    A concept of secret sharing scheme with the function of assignment is proposed. It provides great capabilities for many practical applications. In this scheme, the dealer can randomly assign one or more than one participant to get the secret at any time, but these participants can get nothing about the secret before that moment. At the same time, the other participants cannot get any-thing about the secret by stealing the secret value when it is transferred. However, if the dealer is lost, a certain number or more participants of them can reconstruct the secret by cooperating. In order to clear this concept, an illustrating scheme with geometry method and a practical scheme with algebra method is given.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-06-15

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

  5. Equilibrium Assignment Model with Uncertainties in Traffic Demands

    Directory of Open Access Journals (Sweden)

    Aiwu Kuang

    2013-01-01

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

  6. Master station control and capacity assignment for Italsat network

    Science.gov (United States)

    Morris, Adrian; Sampson, Nicholas; Lopes, Antonino; di Martino, Roberto; Saitto, Antonio

    1990-11-01

    The design approach to developing a network-controller and capacity-assignment software package for the Italsat satellite switched/time division multiple-access (SS/TDMA) network is covered. The network consists of TDMA traffic stations (TS) allowing a full mesh connectivity between all sites; one of the TSs is designated as a control station (CS). The major processing elements of the network, the functions of the master station, and database configurations are discussed, along with TDMA-station control and traffic reconfiguration, the assignment of satellite capacity on demand, and interactions among these network elements. Emphasis is placed on the traffic reconfiguration process, and it is pointed out that the satellite network control processor and the CS overhead burst processor work together to provide the system with the necessary support to operate the network.

  7. Method for assigning sites to projected generic nuclear power plants

    Energy Technology Data Exchange (ETDEWEB)

    Holter, G.M.; Purcell, W.L.; Shutz, M.E.; Young, J.R.

    1986-07-01

    Pacific Northwest Laboratory developed a method for forecasting potential locations and startup sequences of nuclear power plants that will be required in the future but have not yet been specifically identified by electric utilities. Use of the method results in numerical ratings for potential nuclear power plant sites located in each of the 10 federal energy regions. The rating for each potential site is obtained from numerical factors assigned to each of 5 primary siting characteristics: (1) cooling water availability, (2) site land area, (3) power transmission land area, (4) proximity to metropolitan areas, and (5) utility plans for the site. The sequence of plant startups in each federal energy region is obtained by use of the numerical ratings and the forecasts of generic nuclear power plant startups obtained from the EIA Middle Case electricity forecast. Sites are assigned to generic plants in chronological order according to startup date.

  8. Application of Neutrosophic Set Theory in Generalized Assignment Problem

    Directory of Open Access Journals (Sweden)

    Supriya Kar

    2015-09-01

    Full Text Available This paper presents the application of Neutrosophic Set Theory (NST in solving Generalized Assignment Problem (GAP. GAP has been solved earlier under fuzzy environment. NST is a generalization of the concept of classical set, fuzzy set, interval-valued fuzzy set, intuitionistic fuzzy set. Elements of Neutrosophic set are characterized by a truth-membership function, falsity and also indeterminacy which is a more realistic way of expressing the parameters in real life problem. Here the elements of the cost matrix for the GAP are considered as neutrosophic elements which have not been considered earlier by any other author. The problem has been solved by evaluating score function matrix and then solving it by Extremum Difference Method (EDM [1] to get the optimal assignment. The method has been demonstrated by a suitable numerical example.

  9. Value-of-information aware active task assignment

    Science.gov (United States)

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

    2013-05-01

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

  10. Scalable Task Assignment for Heterogeneous Multi-Robot Teams

    Directory of Open Access Journals (Sweden)

    Paula García

    2013-02-01

    Full Text Available This work deals with the development of a dynamic task assignment strategy for heterogeneous multi‐robot teams in typical real world scenarios. The strategy must be efficiently scalable to support problems of increasing complexity with minimum designer intervention. To this end, we have selected a very simple auction‐based strategy, which has been implemented and analysed in a multi‐robot cleaning problem that requires strong coordination and dynamic complex subtask organization. We will show that the selection of a simple auction strategy provides a linear computational cost increase with the number of robots that make up the team and allows the solving of highly complex assignment problems in dynamic conditions by means of a hierarchical sub‐auction policy. To coordinate and control the team, a layered behaviour‐based architecture has been applied that allows the reusing of the auction‐based strategy to achieve different coordination levels.

  11. Block-decoupling vibration control using eigenstructure assignment

    Science.gov (United States)

    Wei, Xiaojun; Mottershead, John E.

    2016-06-01

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

  12. Pole assignment for stochastic systems with unknown coefficients

    Institute of Scientific and Technical Information of China (English)

    陈翰馥[1; 曹希仁[2

    2000-01-01

    This paper solves the exact pole assignment problem for the single-input stochastic systems with unknown coefficients under the controllability assumption which is necessary and sufficient for the arbitrary pole assignment for systems with known coefficients. The system noise is required to be mutually independent with zero mean and bounded second moment. Two approaches to solving the problem are proposed: One is the iterative learning approach which can be applied when the state at a fixed time can be repeatedly observed with different feedback gains; the other is the adaptive control approach which works when the trajectories satisfy a nondegeneracy condition. Both methods are essentially based on stochastic approximation, and the feedback gains are recursively given without invoking the certainty-equivalency-principle.

  13. Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

    Science.gov (United States)

    2015-06-24

    CONTRACT NUMBER 5b. GRANT NUMBER FA9550-12-1-0153 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Mittelmann, Hans D 5d. PROJECT NUMBER 5e. TASK NUMBER 5f...problems. The size 16 three-dimensional quadratic assignment problem Q3AP from wireless communications was solved using a sophisticated approach...placement of the sensors. However, available MINLP solvers are not sufficiently effective, even in the convex case, and a hybrid Benders

  14. Flight Control Design for a Tailless Aircraft Using Eigenstructure Assignment

    OpenAIRE

    Clara Nieto-Wire; Kenneth Sobel

    2011-01-01

    We apply eigenstructure assignment to the design of a flight control system for a wind tunnel model of a tailless aircraft. The aircraft, known as the innovative control effectors (ICEs) aircraft, has unconventional control surfaces plus pitch and yaw thrust vectoring. We linearize the aircraft in straight and level flight at an altitude of 15,000 feet and Mach number 0.4. Then, we separately design flight control systems for the longitudinal and lateral dynamics. We use a control allocation ...

  15. UPMASK: Unsupervised Photometric Membership Assignment in Stellar Clusters

    Science.gov (United States)

    Krone-Martins, Alberto; Moitinho, Andre

    2015-04-01

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

  16. Molecular cloning and chromosome assignment of murine N-ras.

    OpenAIRE

    Ryan, J.; Hart, C P; Ruddle, F H

    1984-01-01

    The murine N-ras gene was cloned by screening an EMBL-3 recombinant phage library with a human N-ras specific probe. Hybridization of two separate unique sequence N-ras probes, isolated from the 5' and 3' flanking sequences of the murine gene, to a mouse-Chinese hamster hybrid mapping panel assigns the N-ras locus to mouse chromosome three.

  17. Mass spectrometry based protein identification with accurate statistical significance assignment

    OpenAIRE

    Alves, Gelio; Yu, Yi-Kuo

    2014-01-01

    Motivation: Assigning statistical significance accurately has become increasingly important as meta data of many types, often assembled in hierarchies, are constructed and combined for further biological analyses. Statistical inaccuracy of meta data at any level may propagate to downstream analyses, undermining the validity of scientific conclusions thus drawn. From the perspective of mass spectrometry based proteomics, even though accurate statistics for peptide identification can now be ach...

  18. Zero assignment and loop transfer recovery in LQG design

    Science.gov (United States)

    Shafai, B.; Beale, S.; Keel, L. H.

    1990-01-01

    The problem of loop transfer recovery (LTR) in linear quadratic Gaussian (LQG) design via observers is discussed. The LTR for both minimum and nonminimum phase systems is considered. For minimum phase systems, perfect recovery approaches are provided based on Luenberger proportional observer and proportional integral observer. For nonminimum phase systems, recent LTR approaches are summarized and the possibility of a new technique based on zero assignment is examined.

  19. Assignment of Isodoublet of 23S1 Meson Nonet

    Institute of Scientific and Technical Information of China (English)

    FENG Xue-Chao; JIANG Feng-Chun

    2007-01-01

    Inserting the masses of some states, which have been established in the experiments or the theory of lattice QCD, we investigate the mass of the isodoublet of the 23S1 meson nonet. The agreement results, 1567 ± 22.6 MeV and 1576.8 MeV, are given by two different approaches. We suggest that the assignment of 23S1 meson nonet should be re-examined in future experiments.

  20. Solving the Quadratic Assignment Problem by a Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Aldy Gunawan

    2011-01-01

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

  1. A new genetic representation for quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    Kratica Jozef

    2011-01-01

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

  2. Binary Assignments of Amino Acids from Pattern Conservation

    CERN Document Server

    Irbäck, A; Irb\\"ack, Anders; Potthast, Frank

    1997-01-01

    We develop a simple optimization procedure for assigning binary values to the amino acids. The binary values are determined by a maximization of the degree of pattern conservation in groups of closely related protein sequences. The maximization is carried out at fixed composition. For compositions approximately corresponding to an equipartition of the residues, the optimal encoding is found to be strongly correlated with hydrophobicity. The stability of the procedure is demonstrated. Our calculations are based upon sequences in the SWISS-PROT database.

  3. Shape Assignment by Genetic Algorithm towards Designing Optimal Areas

    Directory of Open Access Journals (Sweden)

    Ismadi Md Badarudin

    2010-07-01

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

  4. Correction of spin diffusion during iterative automated NOE assignment.

    Science.gov (United States)

    Linge, Jens P; Habeck, Michael; Rieping, Wolfgang; Nilges, Michael

    2004-04-01

    Indirect magnetization transfer increases the observed nuclear Overhauser enhancement (NOE) between two protons in many cases, leading to an underestimation of target distances. Wider distance bounds are necessary to account for this error. However, this leads to a loss of information and may reduce the quality of the structures generated from the inter-proton distances. Although several methods for spin diffusion correction have been published, they are often not employed to derive distance restraints. This prompted us to write a user-friendly and CPU-efficient method to correct for spin diffusion that is fully integrated in our program ambiguous restraints for iterative assignment (ARIA). ARIA thus allows automated iterative NOE assignment and structure calculation with spin diffusion corrected distances. The method relies on numerical integration of the coupled differential equations which govern relaxation by matrix squaring and sparse matrix techniques. We derive a correction factor for the distance restraints from calculated NOE volumes and inter-proton distances. To evaluate the impact of our spin diffusion correction, we tested the new calibration process extensively with data from the Pleckstrin homology (PH) domain of Mus musculus beta-spectrin. By comparing structures refined with and without spin diffusion correction, we show that spin diffusion corrected distance restraints give rise to structures of higher quality (notably fewer NOE violations and a more regular Ramachandran map). Furthermore, spin diffusion correction permits the use of tighter error bounds which improves the distinction between signal and noise in an automated NOE assignment scheme.

  5. Assigning ethical weights to clinical signs observed during toxicity testing.

    Science.gov (United States)

    Ringblom, Joakim; Törnqvist, Elin; Hansson, Sven Ove; Rudén, Christina; Öberg, Mattias

    2017-01-01

    Reducing the number of laboratory animals used and refining experimental procedures to enhance animal welfare are fundamental questions to be considered in connection with animal experimentation. Here, we explored the use of cardinal ethical weights for clinical signs and symptoms in rodents by conducting trade-off interviews with members of Swedish Animal Ethics Committees in order to derive such weights for nine typical clinical signs of toxicity. The participants interviewed represent researchers, politically nominated political nominees and representatives of animal welfare organizations. We observed no statistically significant differences between these groups with respect to the magnitude of the ethical weights assigned, though the political nominees tended to assign lower weights. Overall, hunched posture was considered the most severe clinical sign and body weight loss the least severe. The ethical weights assigned varied considerably between individuals, from zero to infinite value, indicating discrepancies in prioritization of reduction and refinement. Cardinal ethical weights may be utilized to include both animal welfare refinement and reduction of animal use in designing as well as in retrospective assessment of animal experiments. Such weights may also be used to estimate ethical costs of animal experiments.

  6. Band head spin assignment of superdeformed bands in 86Zr

    Science.gov (United States)

    Dadwal, Anshul; Mittal, H. M.

    2016-11-01

    Two parameter expressions for rotational spectra viz. variable moment of inertia (VMI), ab formula and three parameter Harris ω 2 expansion are used to assign the band head spins (I 0) of four rotational superdeformed bands in 86Zr. The least-squares fitting method is employed to obtain the band head spins of these four bands in the A ∼ 80 mass region. Model parameters are extracted by fitting of intraband γ-ray energies, so as to obtain a minimum root-mean-square (rms) deviation between the calculated and the observed transition energies. The calculated transition energies are found to depend sensitively on the assigned spins. Whenever an accurate band head spin is assigned, the calculated transition energies are in agreement with the experimental transition energies. The dynamic moment of inertia is also extracted and its variation with rotational frequency is investigated. Since a better agreement of band head spin with experimental results is found using the VMI model, it is a more powerful tool than the ab formula and Harris ω 2 expansion.

  7. Locomotive assignment problem with train precedence using genetic algorithm

    Science.gov (United States)

    Noori, Siamak; Ghannadpour, Seyed Farid

    2012-07-01

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

  8. 30 CFR 256.62 - Assignment of lease or interest in lease.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Assignment of lease or interest in lease. 256... § 256.62 Assignment of lease or interest in lease. This section explains how to assign record title and other interests in OCS oil and gas or sulphur leases. (a) MMS may approve the assignment to you of...

  9. 47 CFR 24.839 - Transfer of control or assignment of license.

    Science.gov (United States)

    2010-10-01

    ... eligibility requirements of § 24.709 will be granted unless: (1) The application for assignment or transfer of... 47 Telecommunication 2 2010-10-01 2010-10-01 false Transfer of control or assignment of license... Broadband PCS § 24.839 Transfer of control or assignment of license. (a) Restrictions on Assignments...

  10. BDDCS Predictions, Self-Correcting Aspects of BDDCS Assignments, BDDCS Assignment Corrections, and Classification for more than 175 Additional Drugs.

    Science.gov (United States)

    Hosey, Chelsea M; Chan, Rosa; Benet, Leslie Z

    2016-01-01

    The biopharmaceutics drug disposition classification system was developed in 2005 by Wu and Benet as a tool to predict metabolizing enzyme and drug transporter effects on drug disposition. The system was modified from the biopharmaceutics classification system and classifies drugs according to their extent of metabolism and their water solubility. By 2010, Benet et al. had classified over 900 drugs. In this paper, we incorporate more than 175 drugs into the system and amend the classification of 13 drugs. We discuss current and additional applications of BDDCS, which include predicting drug-drug and endogenous substrate interactions, pharmacogenomic effects, food effects, elimination routes, central nervous system exposure, toxicity, and environmental impacts of drugs. When predictions and classes are not aligned, the system detects an error and is able to self-correct, generally indicating a problem with initial class assignment and/or measurements determining such assignments.

  11. A Survey of the Routing and Wavelength Assignment Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    When transmitting data in an all-optical network, data connections must be established in such a way that two or more connections never share a wavelength on the same fi ber. The NP-hard Routing and Wavelength Assignment (RWA) problem consists of finding paths and wavelengths for a set of data...... connections. This survey introduces the RWA and gives an overview of heuristic, metaheuristic and exact solution methods from the literature. Running times for the heuristic methods are presented and computational results are discussed....

  12. DNA barcode data accurately assign higher spider taxa

    Directory of Open Access Journals (Sweden)

    Jonathan A. Coddington

    2016-07-01

    Full Text Available The use of unique DNA sequences as a method for taxonomic identification is no longer fundamentally controversial, even though debate continues on the best markers, methods, and technology to use. Although both existing databanks such as GenBank and BOLD, as well as reference taxonomies, are imperfect, in best case scenarios “barcodes” (whether single or multiple, organelle or nuclear, loci clearly are an increasingly fast and inexpensive method of identification, especially as compared to manual identification of unknowns by increasingly rare expert taxonomists. Because most species on Earth are undescribed, a complete reference database at the species level is impractical in the near term. The question therefore arises whether unidentified species can, using DNA barcodes, be accurately assigned to more inclusive groups such as genera and families—taxonomic ranks of putatively monophyletic groups for which the global inventory is more complete and stable. We used a carefully chosen test library of CO1 sequences from 49 families, 313 genera, and 816 species of spiders to assess the accuracy of genus and family-level assignment. We used BLAST queries of each sequence against the entire library and got the top ten hits. The percent sequence identity was reported from these hits (PIdent, range 75–100%. Accurate assignment of higher taxa (PIdent above which errors totaled less than 5% occurred for genera at PIdent values >95 and families at PIdent values ≥ 91, suggesting these as heuristic thresholds for accurate generic and familial identifications in spiders. Accuracy of identification increases with numbers of species/genus and genera/family in the library; above five genera per family and fifteen species per genus all higher taxon assignments were correct. We propose that using percent sequence identity between conventional barcode sequences may be a feasible and reasonably accurate method to identify animals to family/genus. However

  13. ISOLATION AND NMR SPECTRAL ASSIGNMENTS OF STEVIOLBIOSIDE AND STEVIOSIDE

    Directory of Open Access Journals (Sweden)

    Venkata Sai Prakash Chaturvedula

    2011-04-01

    Full Text Available The complete 1H and 13C NMR assignments of the two diterpene glycosides, 13-[(2-O--D-glucopyranosyl--D-glucopyranosyloxy]-ent-kaur-16-en-19-oic acid (steviolbioside and 3-[(2-O--D-glucopyranosyl--D-glucopyranosyloxy]-ent-kaur-16-en-19-oic acid β-D-glucopyranosyl ester (stevioside isolated from Stevia rebaudiana were achieved on the basis of extensive NMR (1H and 13C, COSY, HMQC, HMBC and MS spectral data. The structures of steviolbioside and stevioside were further supported by acid and enzymatic hydrolysis studies by identifying their corresponding aglycone and sugar residues.

  14. TDMA demand assignment operation in Telecom 1 business services network

    Science.gov (United States)

    Lombard, D.; Rancy, F.

    Telecom 1 is a French domestic satellite whose main function is the establishment of an intracompany network carrying a wide range of digital services, including digital data, voice, and images, among a large number of earth stations located on the subscriber's premises. This satellite system is to begin operations in 1983 from a geostationary orbit, using five 6-MHz bandwidth transponders in the 14/12 GHz band. TDMA with Demand Assignment will be employed, and the system is designed to provide additional, link-by-link cryptographic or error correction encoding facilities when a high degree of privacy or transmission quality are desired.

  15. Symmetric reconfigurable capacity assignment in a bidirectional DWDM access network.

    Science.gov (United States)

    Ortega, Beatriz; Mora, José; Puerto, Gustavo; Capmany, José

    2007-12-10

    This paper presents a novel architecture for DWDM bidirectional access networks providing symmetric dynamic capacity allocation for both downlink and uplink signals. A foldback arrayed waveguide grating incorporating an optical switch enables the experimental demonstration of flexible assignment of multiservice capacity. Different analog and digital services, such as CATV, 10 GHz-tone, 155Mb/s PRBS and UMTS signals have been transmitted in order to successfully test the system performance under different scenarios of total capacity distribution from the Central Station to different Base Stations with two reconfigurable extra channels for each down and upstream direction.

  16. ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    M. Salamah

    2016-03-01

    Full Text Available Transmitter range assignment in clustered wireless networks is the bottleneck of the balance between energy conservation and the connectivity to deliver data to the sink or gateway node. The aim of this research is to optimize the energy consumption through reducing the transmission ranges of the nodes, while maintaining high probability to have end-to-end connectivity to the network’s data sink. We modified the approach given in [1] to achieve more than 25% power saving through reducing cluster head (CH transmission range of the backbone nodes in a multihop wireless sensor network with ensuring at least 95% end-to-end connectivity probability.

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

    Science.gov (United States)

    Nissen, V

    1994-01-01

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

  18. Two Reformulations for the Dynamic Quadratic Assignment Problem

    Directory of Open Access Journals (Sweden)

    Sirirat Muenvanichakul

    2010-01-01

    Full Text Available Problem statement: The Dynamic Quadratic Assignment Problem (DQAP, an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both proposed models are more simplified leading to possible hybrid adaptations of existing techniques for more practical approaches.

  19. Robust quadratic assignment problem with budgeted uncertain flows

    Directory of Open Access Journals (Sweden)

    Mohammad Javad Feizollahi

    2015-12-01

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

  20. Bi-objective network equilibrium, traffic assignment and road pricing

    OpenAIRE

    Wang, JYT; Ehrgott, M

    2014-01-01

    Multi-objective equilibrium models of traffic assignment state that users of road networks travel on routes that are efficient with respect to several objectives, such as travel time and toll. This concept provides a general framework for modelling traffic flow in tolled road networks. We present the concept of time surplus maximisation as a way of handling user preferences. Given a toll, users have a maximum time they are willing to spend for a trip. Time surplus is this maximum time minus a...

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

    Science.gov (United States)

    Misevicius, Alfonsas

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

  2. Gilmore-Lawler bound of quadratic assignment problem

    Institute of Scientific and Technical Information of China (English)

    Yong XIA

    2008-01-01

    The Gilmore-Lawler bound (GLB) is one of the well-known lower bound of quadratic assignment problem (QAP). Checking whether GLB is tight is an NP-complete problem. In this article, based on Xia and Yuan linearization technique, we provide an upper bound of the complexity of this problem, which makes it pseudo-polynomial solvable. We also pseudo-polynomially solve a class of QAP whose GLB is equal to the optimal objec-tive function value, which was shown to remain NP-hard.

  3. ECON305 FULL COURSE [ ALL DISCUSSIONS AND ALL ASSIGNMENTS

    OpenAIRE

    Laynebaril

    2017-01-01

      ECON305 FULL COURSE [ ALL DISCUSSIONS AND ALL ASSIGNMENTS ] Click Link Below To Buy:   http://hwcampus.com/shop/econ305-full-course/   WEEK 1   GDP and Per Capita GDP are two of the basic and most widely used economic measures. They are broad measures that provide interesting and useful information about a nation's economy as a whole. And Per Capita GDP is the standard measure of the Standard of Living. But they are often criticized for not being a mea...

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

    Directory of Open Access Journals (Sweden)

    Soheil Rostami

    2016-01-01

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

  5. Sensor assignment to mission in AI-TECD

    Science.gov (United States)

    Ganger, Robert; de Mel, Geeth; Pham, Tien; Rudnicki, Ronald; Schreiber, Yonatan

    2016-05-01

    Sensor-mission assignment involves the allocation of sensors and other information-providing resources to missions in order to cover the information needs of the individual tasks within each mission. The importance of efficient and effective means to find appropriate resources for tasks is exacerbated in the coalition context where the operational environment is dynamic and a multitude of critically important tasks need to achieve their collective goals to meet the objectives of the coalition. The Sensor Assignment to Mission (SAM) framework—a research product of the International Technology Alliance in Network and Information Sciences (NIS-ITA) program—provided the first knowledge intensive resource selection approach for the sensor network domain so that contextual information could be used to effectively select resources for tasks in coalition environments. Recently, CUBRC, Inc. was tasked with operationalizing the SAM framework through the use of the I2WD Common Core Ontologies for the Communications-Electronics Research, Development and Engineering Center (CERDEC) sponsored Actionable Intelligence Technology Enabled Capabilities Demonstration (AI-TECD). The demonstration event took place at Fort Dix, New Jersey during July 2015, and this paper discusses the integration and the successful demonstration of the SAM framework within the AI-TECD, lessons learned, and its potential impact in future operations.

  6. Bayesian selection of nucleotide substitution models and their site assignments.

    Science.gov (United States)

    Wu, Chieh-Hsi; Suchard, Marc A; Drummond, Alexei J

    2013-03-01

    Probabilistic inference of a phylogenetic tree from molecular sequence data is predicated on a substitution model describing the relative rates of change between character states along the tree for each site in the multiple sequence alignment. Commonly, one assumes that the substitution model is homogeneous across sites within large partitions of the alignment, assigns these partitions a priori, and then fixes their underlying substitution model to the best-fitting model from a hierarchy of named models. Here, we introduce an automatic model selection and model averaging approach within a Bayesian framework that simultaneously estimates the number of partitions, the assignment of sites to partitions, the substitution model for each partition, and the uncertainty in these selections. This new approach is implemented as an add-on to the BEAST 2 software platform. We find that this approach dramatically improves the fit of the nucleotide substitution model compared with existing approaches, and we show, using a number of example data sets, that as many as nine partitions are required to explain the heterogeneity in nucleotide substitution process across sites in a single gene analysis. In some instances, this improved modeling of the substitution process can have a measurable effect on downstream inference, including the estimated phylogeny, relative divergence times, and effective population size histories.

  7. Asymptotically Optimal Assignments In Ordinal Evaluations of Proposals

    CERN Document Server

    Oruc, A Yavuz

    2009-01-01

    In ordinal evaluations of proposals in peer review systems, a set of proposals is assigned to a fixed set of referees so as to maximize the number of pairwise comparisons of proposals under certain referee capacity and proposal subject constraints. In this paper, the following two related problems are considered: (1) Assuming that each referee has a capacity to review k out of n proposals, 2 < k < n, determine the minimum number of referees needed to ensure that each pair of proposals is reviewed by at least one referee, (2) Find an assignment that meets the lower bound determined in (1). It is easy to see that one referee is both necessary and sufficient when k = n, and n(n-1)/2 referees are both necessary and sufficient when k = 2. We show that 6 referees are both necessary and sufficient when k = n/2. We further show that 11 referees are necessary and 12 are sufficient when k = n/3, and 18 referees are necessary and 20 referees are sufficient when k = n/4. A more general lower bound of n(n-1)/k(k-1) ...

  8. Credit assignment in movement-dependent reinforcement learning.

    Science.gov (United States)

    McDougle, Samuel D; Boggess, Matthew J; Crossley, Matthew J; Parvin, Darius; Ivry, Richard B; Taylor, Jordan A

    2016-06-14

    When a person fails to obtain an expected reward from an object in the environment, they face a credit assignment problem: Did the absence of reward reflect an extrinsic property of the environment or an intrinsic error in motor execution? To explore this problem, we modified a popular decision-making task used in studies of reinforcement learning, the two-armed bandit task. We compared a version in which choices were indicated by key presses, the standard response in such tasks, to a version in which the choices were indicated by reaching movements, which affords execution failures. In the key press condition, participants exhibited a strong risk aversion bias; strikingly, this bias reversed in the reaching condition. This result can be explained by a reinforcement model wherein movement errors influence decision-making, either by gating reward prediction errors or by modifying an implicit representation of motor competence. Two further experiments support the gating hypothesis. First, we used a condition in which we provided visual cues indicative of movement errors but informed the participants that trial outcomes were independent of their actual movements. The main result was replicated, indicating that the gating process is independent of participants' explicit sense of control. Second, individuals with cerebellar degeneration failed to modulate their behavior between the key press and reach conditions, providing converging evidence of an implicit influence of movement error signals on reinforcement learning. These results provide a mechanistically tractable solution to the credit assignment problem.

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

    CERN Document Server

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

    2011-01-01

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

  10. Channel Assignment Algorithms for MRMC Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Mohammad A Hoque

    2011-11-01

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

  11. Optimal Relay Assignment and Power Allocation for Cooperative Communications

    Institute of Scientific and Technical Information of China (English)

    Kun Xie; Jian-Nong Cao; Ji-Gang Wen

    2013-01-01

    Cooperative communication for wireless networks has gained a lot of recent interest due to its ability to mitigate fading with exploration of spatial diversity.In this paper,we study a joint optimization problem of jointly considering transmission mode selection,relay assignment and power allocation to maximize the capacity of the network through cooperative wireless communications.This problem is much more challenging than relay assignment considered in literature work which simply targets to maximize the transmission capacity for a single transmission pair.We formulate the problem as a variation of the maximum weight matching problem where the weight is a function over power values which must meet power constraints (VMWMC).Although VMWMC is a non-convex problem whose complexity increases exponentially with the number of relay nodes,we show that the duality gap of VMWMC is virtual zero.Based on this result,we propose a solution using Lagrange dual decomposition to reduce the computation complexity.We do simulations to evaluate the performance of the proposed solution.The results show that our solution can achieve maximum network capacity with much less computation time compared with exhaustive search,and our solution outperforms existing sub-optimal solutions that can only achieve much lower network capacity.

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

    Directory of Open Access Journals (Sweden)

    Jamal Elhachmi

    2011-06-01

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

  13. An Eigenstructure Assignment for a Static Synchronous Compensator

    Directory of Open Access Journals (Sweden)

    Ahmad N. Al-Husban

    2009-01-01

    Full Text Available Problem statement: Power flow through an AC transmission line is influenced by three basic electrical parameters, which are line impedance, magnitudes and phase-shift angle between the sending and receiving voltages. Therefore, the change in any of the three basic parameters means a change in the power flow through the transmission line. The aims of this research paper are: increase the power transfer capability of transmission systems, minimize the transmission losses, support a good voltage profile and retain system stability under large disturbances. Study the use of eigenstructure techniques for state feedback control of the power system static compensator. Therefore, the mathematical analysis was performed for eigenvector assignment, power flow transmission line and for the static compensator analysis based on the transformation of the three-phase into d-q frame. Approach: A novel control method for regulating the power system in case of abnormal conditions was carried out. The system considered is a static synchronous compensator. The study includes a detailed mathematical analysis of the impact of the shunt compensator on the power flow; investigation of the system constraints and their effects on the static compensator control; in addition simulation of static compensator to control a transmitted active power flow on the transmission line. The conducted method provides a way of constructing the state feedback gain matrix to satisfy a certain prescribed performance. Results: The solutions of the obtained equation were conducted using the computer simulation method for both open-loop and static compensator techniques. The result shows fast tracking of the power flow transient response when using the static compensator technique comparing with open-loop technique. However, the same trend of the behavior was observed for all cases. Conclusion: A new method for developing a parameterized feedback matrix that assigns a closed-loop prespecified

  14. Java bytecode verification via static single assignment form

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  15. Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation

    Directory of Open Access Journals (Sweden)

    Ümit Çiftçi

    2010-03-01

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

  16. Semantic role assignment in Danish children and adults

    DEFF Research Database (Denmark)

    Boeg Thomsen, Ditte; Kristensen, Line Burholt

    2014-01-01

    in Danish sentence comprehension. Comparing corpus data with recent act-out and reading experiments involving Danish sentences with conflicting formal cues, we argue that context plays an important role in the resolution of semantic role distribution. Children and adults weigh morphosyntactic cues....... Previous experiments in a variety of languages have shown that sentences with conflicting formal cues are habitually miscomprehended by preschool children. For adults, they continue to be more difficult to read and comprehend, often being shallowly processed on the basis of heuristics. However, most...... differently, but we find a striking continuity in attention to context across development: when interpreting conflict clauses with object-before-subject structure, both children and adults systematically integrate intra- and extrasentential cues to assign semantic roles....

  17. Learning to assign binary weights to binary descriptor

    Science.gov (United States)

    Huang, Zhoudi; Wei, Zhenzhong; Zhang, Guangjun

    2016-10-01

    Constructing robust binary local feature descriptors are receiving increasing interest due to their binary nature, which can enable fast processing while requiring significantly less memory than their floating-point competitors. To bridge the performance gap between the binary and floating-point descriptors without increasing the computational cost of computing and matching, optimal binary weights are learning to assign to binary descriptor for considering each bit might contribute differently to the distinctiveness and robustness. Technically, a large-scale regularized optimization method is applied to learn float weights for each bit of the binary descriptor. Furthermore, binary approximation for the float weights is performed by utilizing an efficient alternatively greedy strategy, which can significantly improve the discriminative power while preserve fast matching advantage. Extensive experimental results on two challenging datasets (Brown dataset and Oxford dataset) demonstrate the effectiveness and efficiency of the proposed method.

  18. A focused assignment encouraging deep reading in undergraduate biochemistry.

    Science.gov (United States)

    Spiegelberg, Bryan D

    2014-01-01

    Encouraging undergraduate students to access, read, and analyze current primary literature can positively impact learning, especially in advanced courses. The incorporation of literature into coursework typically involves reading and responding to full research reports. Such exercises have clear value as students make connections between experiments and are able to probe and critique scientific logic. The exclusive use of full papers, though, may reinforce certain students' tendencies to rely on textual clues rather than a critical analysis of the actual data presented. I propose that structured activities requiring students to focus on individual parts of research papers, even on a single figure, are beneficial in a literature-centered advanced undergraduate course, because they promote the deep reading that is critical to scientific discourse. In addition, I describe how one such focused assignment boosted learning and was well received by students in a second-semester biochemistry course.

  19. Online Prelectures: An Alternative to Textbook Reading Assignments

    Science.gov (United States)

    Sadaghiani, Homeyra R.

    2012-05-01

    To engage students in a more meaningful discussion of course material and prompt their higher thinking skills, most instructors expect students to read the course textbook for initial exposure to the course content before class. However, as many instructors are aware, most students do not read their textbook throughout the quarter.1,2 At California State Polytechnic University, Pomona (Cal Poly Pomona) we have adopted web-based multimedia learning modules (MLMs) as prelecture assignments to help students to prepare for the class activities. The MLMs place lecture contents into the hands and control of the learners; similar to "flipped"3 or "inverted"4 classroom approaches, this method allows students to receive key course content outside of class and apply and analyze the content actively during class. In addition to initial exposure to basic principle, the MLMs provide additional worked examples that cannot be thoroughly covered in class.

  20. Predicting Assignment Submissions in a Multiclass Classification Problem

    Directory of Open Access Journals (Sweden)

    Bogdan Drăgulescu

    2015-08-01

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

  1. Online Learning of Assignments that Maximize Submodular Functions

    CERN Document Server

    Golovin, Daniel; Streeter, Matthew

    2009-01-01

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

  2. Evaluation of embedded audio feedback on writing assignments.

    Science.gov (United States)

    Graves, Janet K; Goodman, Joely T; Hercinger, Maribeth; Minnich, Margo; Murcek, Christina M; Parks, Jane M; Shirley, Nancy

    2015-01-01

    The purpose of this pilot study was to compare embedded audio feedback (EAF), which faculty provided using the iPad(®) application iAnnotate(®) PDF to insert audio comments and written feedback (WF), inserted electronically on student papers in a series of writing assignments. Goals included determining whether EAF provides more useful guidance to students than WF and whether EAF promotes connectedness among students and faculty. An additional goal was to ascertain the efficiency and acceptance of EAF as a grading tool by nursing faculty. The pilot study was a quasi-experimental, cross-over, posttest-only design. The project was completed in an Informatics in Health Care course. Faculty alternated the two feedback methods on four papers written by each student. Results of surveys and focus groups revealed that students and faculty had mixed feelings about this technology. Student preferences were equally divided between EAF and WF, with 35% for each, and 28% were undecided.

  3. Electre tri method used to storage location assignment into categories

    Directory of Open Access Journals (Sweden)

    Marcele Elisa Fontana

    2013-08-01

    Full Text Available Day after day, the importance of a company having an efficient storage location assignment system increases. Moreover, since products have different warehouse costs and customers' requirements are also different, it is important to sort products in order to adopt strategies for inventory management that are appropriate for each product. However, adopting a policy for each product is not applicable in the real world. Therefore, companies usually categorize products into classes and thereafter adopt specific inventory management policies. Given this situation, this paper puts forward the arguments for adopting a multi-criteria method, Electre TRI, to sort products that both considers criteria relating to the characteristics of a product as to its physical location in the warehouse and the criteria that are important for inventory strategies, such as, for example, the profitability of each unit held in storage.

  4. Practical Homework Assignments As Part Of Chemistry Teaching And Learning

    Directory of Open Access Journals (Sweden)

    Dragica Trivic

    2010-12-01

    Full Text Available The paper presents two examples of classroom practices when practical research tasks in primary and secondary school are assigned as homework. The task for primary school students was aimed at developing divergent thinking, which is evidenced and illustrated by some examples of students’ solutions. The task for secondary school students illustrates how these students are able to apply their classroom knowledge of acids, bases and indicators on the substances they can find in everyday life. The students performed the following activities: problem analysis, action planning, and equipment selection/assembling, performing the experiment, measuring (mass, volume, data recording, and drawing conclusions. The results of both tasks served as a basis for introducing new contents in the classroom and stimulated active participation of a larger number of students.Keywords:

  5. UPMASK: unsupervised photometric membership assignment in stellar clusters

    CERN Document Server

    Krone-Martins, A

    2013-01-01

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

  6. Recognizing the "Transformational" in Preservice Digital Literacy Assignments

    Science.gov (United States)

    Robertson, Lorayne; Hughes, Janette

    The authors review and evaluate a Teaching Methods course in Language and Literacy, one which focuses on multiple literacies, including digital literacy and critical literacy. The course is offered in a laptop-based university program. In this article, the authors outline the context of the multiple literacies course, its resources and assignments as well as their instructional goals. Their qualitative data sources include student-created digital artifacts such as digital literacy stories and digital book talks. The researchers draw from cross-program data based on hundreds of student reflections and one-on-one interviews. The authors conclude that there are indications from their data analysis that suggest that digital literacy supports the development of "transformative elements" that can extend beyond the teacher training program.

  7. State assignment approach to asynchronous CMOS circuit design

    Science.gov (United States)

    Kantabutra, Vitit; Andreou, Andreas G.

    1994-04-01

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

  8. Assigning Task by Parallel Genetic Algorithm Based on PVM

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

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

  9. Study on Fleet Assignment Problem Model and Algorithm

    Directory of Open Access Journals (Sweden)

    Yaohua Li

    2013-01-01

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

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

    Science.gov (United States)

    Iordache, Serban

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

  11. Local Optima Networks of the Quadratic Assignment Problem

    CERN Document Server

    Daolio, Fabio; Ochoa, Gabriela; Tomassini, Marco

    2011-01-01

    Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Problem (QAP). This network model is a reduction of the landscape in which the nodes correspond to the local optima, and the edges account for the notion of adjacency between their basins of attraction. The model was inspired by the notion of 'inherent network' of potential energy surfaces proposed in physical-chemistry. The local optima networks extracted from the so called uniform and real-like QAP instances, show features clearly distinguishing these two types of instances. Apart from a clear confirmation that the search difficulty increases with the problem dimension, the analysis provides new confirming evidence explaining why the real-like instances are easier to solve exactly using heuristic search, while the uniform instances are easier to solve approximately. Although the local optima network model is still under development, w...

  12. Rate Adaptive Selective Segment Assignment for Reliable Wireless Video Transmission

    Directory of Open Access Journals (Sweden)

    Sajid Nazir

    2012-01-01

    Full Text Available A reliable video communication system is proposed based on data partitioning feature of H.264/AVC, used to create a layered stream, and LT codes for erasure protection. The proposed scheme termed rate adaptive selective segment assignment (RASSA is an adaptive low-complexity solution to varying channel conditions. The comparison of the results of the proposed scheme is also provided for slice-partitioned H.264/AVC data. Simulation results show competitiveness of the proposed scheme compared to optimized unequal and equal error protection solutions. The simulation results also demonstrate that a high visual quality video transmission can be maintained despite the adverse effect of varying channel conditions and the number of decoding failures can be reduced.

  13. The storage location assignment problem: application in an agribusiness company

    Directory of Open Access Journals (Sweden)

    Helton C. Gomes

    2015-09-01

    Full Text Available The goal of this work is propose an efficient storage scheme for a company in the agribusiness sector. The company studied herein is located in the Alto Paranaíba region of Minas Gerais, and exports coffee beans. Efficient storage can provide improvements in the use of space, operational resources, and staff time, as well as facilitating the order picking process. To accomplish this, the problem was mathematically modeled as a Storage Location Assignment Problem (SLAP, aimed at minimizing handling costs and maximizing space utilization and storage efficiency. The mathematical model using the company data was solved using the CPLEX solver, version 12.1. The results obtained were compared with the actual company scenario, and several advantages were observed.

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

    Science.gov (United States)

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

    2012-01-01

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

  15. Assigning probability distributions to input parameters of performance assessment models

    Energy Technology Data Exchange (ETDEWEB)

    Mishra, Srikanta [INTERA Inc., Austin, TX (United States)

    2002-02-01

    This study presents an overview of various approaches for assigning probability distributions to input parameters and/or future states of performance assessment models. Specifically,three broad approaches are discussed for developing input distributions: (a) fitting continuous distributions to data, (b) subjective assessment of probabilities, and (c) Bayesian updating of prior knowledge based on new information. The report begins with a summary of the nature of data and distributions, followed by a discussion of several common theoretical parametric models for characterizing distributions. Next, various techniques are presented for fitting continuous distributions to data. These include probability plotting, method of moments, maximum likelihood estimation and nonlinear least squares analysis. The techniques are demonstrated using data from a recent performance assessment study for the Yucca Mountain project. Goodness of fit techniques are also discussed, followed by an overview of how distribution fitting is accomplished in commercial software packages. The issue of subjective assessment of probabilities is dealt with in terms of the maximum entropy distribution selection approach, as well as some common rules for codifying informal expert judgment. Formal expert elicitation protocols are discussed next, and are based primarily on the guidance provided by the US NRC. The Bayesian framework for updating prior distributions (beliefs) when new information becomes available is discussed. A simple numerical approach is presented for facilitating practical applications of the Bayes theorem. Finally, a systematic framework for assigning distributions is presented: (a) for the situation where enough data are available to define an empirical CDF or fit a parametric model to the data, and (b) to deal with the situation where only a limited amount of information is available.

  16. Solution of the determinantal assignment problem using the Grassmann matrices

    Science.gov (United States)

    Karcanias, Nicos; Leventides, John

    2016-02-01

    The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation ? where ? is an n -dimensional vector space over ? which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of ?, and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector ? are given in terms of the rank properties of the Grassmann matrix, ? of the vector ?, which is constructed by the coordinates of ?. It is shown that the exterior equation is solvable (? is decomposable), if and only if ? where ?; the solution space for a decomposable ?, is the space ?. This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist.

  17. Flight control synthesis for flexible aircraft using Eigenspace assignment

    Science.gov (United States)

    Davidson, J. B.; Schmidt, D. K.

    1986-01-01

    The use of eigenspace assignment techniques to synthesize flight control systems for flexible aircraft is explored. Eigenspace assignment techniques are used to achieve a specified desired eigenspace, chosen to yield desirable system impulse residue magnitudes for selected system responses. Two of these are investigated. The first directly determines constant measurement feedback gains that will yield a close-loop system eigenspace close to a desired eigenspace. The second technique selects quadratic weighting matrices in a linear quadratic control synthesis that will asymptotically yield the close-loop achievable eigenspace. Finally, the possibility of using either of these techniques with state estimation is explored. Application of the methods to synthesize integrated flight-control and structural-mode-control laws for a large flexible aircraft is demonstrated and results discussed. Eigenspace selection criteria based on design goals are discussed, and for the study case it would appear that a desirable eigenspace can be obtained. In addition, the importance of state-space selection is noted along with problems with reduced-order measurement feedback. Since the full-state control laws may be implemented with dynamic compensation (state estimation), the use of reduced-order measurement feedback is less desirable. This is especially true since no change in the transient response from the pilot's input results if state estimation is used appropriately. The potential is also noted for high actuator bandwidth requirements if the linear quadratic synthesis approach is utilized. Even with the actuator pole location selected, a problem with unmodeled modes is noted due to high bandwidth. Some suggestions for future research include investigating how to choose an eigenspace that will achieve certain desired dynamics and stability robustness, determining how the choice of measurements effects synthesis results, and exploring how the phase relationships between desired

  18. 77 FR 70484 - Preoperational Testing of Onsite Electric Power Systems To Verify Proper Load Group Assignments...

    Science.gov (United States)

    2012-11-26

    ... COMMISSION Preoperational Testing of Onsite Electric Power Systems To Verify Proper Load Group Assignments... Power Systems to Verify Proper Load Group Assignments, Electrical Separation, and Redundancy.'' DG-1294... encompass preoperational testing of electrical power systems used to meet current Station...

  19. Assigning the NMR Spectrum of Glycidol: An Advanced Organic Chemistry Exercise

    Science.gov (United States)

    Helms, Eric; Arpaia, Nicholas; Widener, Melissa

    2007-01-01

    Various one- and two-dimensional NMR experiments have been found to be extremely useful for assigning the proton and carbon NMR spectra of glycidol. The technique provides extremely valuable information aiding in the complete assignment of the peaks.

  20. 30 CFR 256.68 - Effect of assignment of a particular tract.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Effect of assignment of a particular tract. 256.68 Section 256.68 Mineral Resources MINERALS MANAGEMENT SERVICE, DEPARTMENT OF THE INTERIOR OFFSHORE... § 256.68 Effect of assignment of a particular tract. (a) When an assignment is made of all the...

  1. Effects of an Explicit Assignment on Task Identification in College Students with Writing Difficulties

    Science.gov (United States)

    Schwilk, Christopher L.

    2010-01-01

    Understanding writing assignments is critical to college students' success as they transition from high school to postsecondary environments, but students with writing difficulties struggle to extrapolate required tasks from assignments presented in narrative form. The researcher examined the ability of students to identify assignment tasks when…

  2. 47 CFR 90.173 - Policies governing the assignment of frequencies.

    Science.gov (United States)

    2010-10-01

    ... assignment to base stations or mobile stations in the Industrial/Business Pool are also available for... SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Policies Governing the Assignment of Frequencies... this part, frequencies assigned to land mobile stations are available on a shared basis only and...

  3. 49 CFR 173.129 - Class 5, Division 5.2-Assignment of packing group.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 2 2010-10-01 2010-10-01 false Class 5, Division 5.2-Assignment of packing group... SHIPPERS-GENERAL REQUIREMENTS FOR SHIPMENTS AND PACKAGINGS Definitions Classification, Packing Group... 5.2—Assignment of packing group. All Division 5.2 materials are assigned to Packing Group II...

  4. 49 CFR 173.145 - Other Regulated Materials-Assignment of packing group.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 2 2010-10-01 2010-10-01 false Other Regulated Materials-Assignment of packing... SHIPPERS-GENERAL REQUIREMENTS FOR SHIPMENTS AND PACKAGINGS Definitions Classification, Packing Group... Materials—Assignment of packing group. Packing groups are not assigned to ORM-D materials....

  5. 49 CFR 173.125 - Class 4-Assignment of packing group.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 2 2010-10-01 2010-10-01 false Class 4-Assignment of packing group. 173.125...-GENERAL REQUIREMENTS FOR SHIPMENTS AND PACKAGINGS Definitions Classification, Packing Group Assignments... packing group. (a) The packing group of a Class 4 material is assigned in column (5) of the §...

  6. 49 CFR 173.121 - Class 3-Assignment of packing group.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 2 2010-10-01 2010-10-01 false Class 3-Assignment of packing group. 173.121...-GENERAL REQUIREMENTS FOR SHIPMENTS AND PACKAGINGS Definitions Classification, Packing Group Assignments... packing group. (a) The packing group of a Class 3 material is as assigned in column 5 of the §...

  7. Moving beyond "Bookish Knowledge": Using Film-Based Assignments to Promote Deep Learning

    Science.gov (United States)

    Olson, Joann S.; Autry, Linda; Moe, Jeffry

    2016-01-01

    This article investigates the effectiveness of a film-based assignment given to adult learners in a graduate-level group counseling class. Semi-structured interviews were conducted with four students; data analysis suggested film-based assignments may promote deep approaches to learning (DALs). Participants indicated the assignment helped them…

  8. Analyzing Regression-Discontinuity Designs with Multiple Assignment Variables: A Comparative Study of Four Estimation Methods

    Science.gov (United States)

    Wong, Vivian C.; Steiner, Peter M.; Cook, Thomas D.

    2013-01-01

    In a traditional regression-discontinuity design (RDD), units are assigned to treatment on the basis of a cutoff score and a continuous assignment variable. The treatment effect is measured at a single cutoff location along the assignment variable. This article introduces the multivariate regression-discontinuity design (MRDD), where multiple…

  9. Writing in Science and Technology: An Analysis of Assignments from Ten Undergraduate Courses.

    Science.gov (United States)

    Braine, George

    1989-01-01

    A study classified 61 writing assignments from 10 undergraduate science and technology courses on the basis of audience and task specifications. Most assignments emphasized reporting on specific participatory experiences, and 25 percent of assignments specified an audience other than the course instructor. Pedagogical implications for…

  10. An Implementation of Active Learning: Assessing the Effectiveness of the Team Infomercial Assignment

    Science.gov (United States)

    Matveev, Alexei V.; Milter, Richard G.

    2010-01-01

    This article examines the effectiveness of the team infomercial assignment as an active learning tool in undergraduate courses. The structure and three phases of the team infomercial assignment, as well as student evaluations and feedback, are presented. We investigated student experiences working on the team infomercial assignment, the common…

  11. Gender Differences in the Determinants of the Willingness to Accept an International Assignment

    Science.gov (United States)

    van der Velde, Mandy E. G.; Bossink, Carin J. H.; Jansen, Paul G. W.

    2005-01-01

    Multinational organisations experience difficulties in finding managers willing to accept international assignments. This study has therefore focused on factors that can predict males' and females' willingness to accept international assignments, or to follow their partners on international assignments. Hypotheses were formulated based on the…

  12. 28 CFR 0.153 - Selection and assignment of employees for training.

    Science.gov (United States)

    2010-07-01

    ... Selection and assignment of employees for training. The Director of the Federal Bureau of Investigation, the....S.C. 4109, with respect to the selection and assignment of employees for training by, in, or through... 28 Judicial Administration 1 2010-07-01 2010-07-01 false Selection and assignment of employees...

  13. Using Computer-Based Writing Software to Facilitate Writing Assignments in Large Political Science Classes

    Science.gov (United States)

    Ishiyama, John; Watson, Wendy L.

    2014-01-01

    It is generally accepted in the literature that writing assignments, even short ones, increase both student writing ability and comprehension of the material covered in the assignments. As class enrollments increase, particularly at the introductory level, however, instructors often sacrifice writing assignments because of the difficulty in…

  14. 76 FR 42706 - Amendment of Inspector General Operations & Reporting System Audit, Assignment, and Timesheet...

    Science.gov (United States)

    2011-07-19

    ... Inspector General Operations & Reporting (IGOR) System Audit, Assignment, and Timesheet Files (EPA-42) to... & Reporting (IGOR) System Audit, Assignment, and Timesheet Files (EPA-42) will be changed to Inspector General... AGENCY Amendment of Inspector General Operations & Reporting System Audit, Assignment, and...

  15. Planning for Productive College-Level Work: Using the Course Assignment Framework.

    Science.gov (United States)

    Mohr, Kathleen A. J.

    2002-01-01

    Asserts that well-designed course assignments are a critical component of effective teaching and learning processes. Discusses the Course Assignment Framework, which delineates 10 assignment categories, their rationales, and their advantages for faculty and students. States that the framework promotes combining tasks so that instructors can…

  16. 10 CFR Appendix A to Part 20 - Assigned Protection Factors for Respirators a

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 1 2010-01-01 2010-01-01 false Assigned Protection Factors for Respirators a A Appendix A..., App. A Appendix A to Part 20—Assigned Protection Factors for Respirators a Operating mode AssignedProtection Factors I. Air Purifying Respirators c: Filtering facepiece disposable d Negative Pressure...

  17. A Comparative Analysis of Pair-Work and Individual Assignments in Two ELT Grammar Classes

    Science.gov (United States)

    Sert, Olcay

    2005-01-01

    Assignments prepared in pair-work have long been evaluated to be more successful when compared to individually prepared assignments in many respects in foreign language learning contexts. However, there is not much research conducted to reveal the advantages of pair-work in preparing assignments and the linguistic characteristics of the finished…

  18. 42 CFR 433.145 - Assignment of rights to benefits-State plan requirements.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits-State plan... Liability Assignment of Rights to Benefits § 433.145 Assignment of rights to benefits—State plan..., cooperation in establishing paternity and obtaining support, and cooperation in identifying and...

  19. 42 CFR 421.114 - Assignment and reassignment of providers by CMS.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 3 2010-10-01 2010-10-01 false Assignment and reassignment of providers by CMS. 421.114 Section 421.114 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH... Assignment and reassignment of providers by CMS. CMS may assign or reassign any provider to any...

  20. Integrating Academic Journal Review Assignments into a Graduate Business Leadership Course

    Science.gov (United States)

    Schultz, Jennifer L.; Agrimonti, Lisa M.; Higbee, Jeanne L.

    2016-01-01

    Graduate course assignments that are pragmatic, challenging, scaffold prior learning, and support academic career aspirations can be difficult to create and even more problematic to assess for even the most experienced faculty. This paper presents a class assignment that incorporated a real-world journal reviewing assignment into an elective…

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

    Directory of Open Access Journals (Sweden)

    Yona Golan

    2005-08-01

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

  2. Assigning glycemic index to foods in a recent Australian food composition database.

    Science.gov (United States)

    Louie, J C Y; Barclay, A W; Brand-Miller, J C

    2016-02-01

    This paper describes the compilation of a special edition of the AUSNUT2011-2013 food composition database that includes glycemic index (GI) values. A 6-step, systematic methodology was used to assign GI to 5644 foods included in AUSNUT2011-2013. A total of 1752 (31%) foods were assigned a GI of 0 owing to low carbohydrate content; 363 (6%) had a direct match in 1 of the 4 data tables used; 1738 (31%) were assigned the GI of a 'closely related' food item; 1526 (27%) were assigned the weighted mean GI of ingredients; 205 (4%) were assigned the median GI of their corresponding food subgroup; 49 (<1%) were assigned a GI of 0 because they were not a significant source of carbohydrate in typical diets; and 5 (<1%) were assigned a default GI. We propose that this database should be used for all future Australian GI research until a subsequent version/update is compiled.

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

    Institute of Scientific and Technical Information of China (English)

    JIANG He; ZHANG XianChao; CHEN GuoLiang; LI MingChu

    2008-01-01

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

  4. Backbone Assignment of the MALT1 Paracaspase by Solution NMR.

    Science.gov (United States)

    Unnerståle, Sofia; Nowakowski, Michal; Baraznenok, Vera; Stenberg, Gun; Lindberg, Jimmy; Mayzel, Maxim; Orekhov, Vladislav; Agback, Tatiana

    2016-01-01

    Mucosa-associated lymphoid tissue lymphoma translocation protein 1 (MALT1) is a unique paracaspase protein whose protease activity mediates oncogenic NF-κB signalling in activated B cell-like diffuse large B cell lymphomas (ABC-DLBCLs). ABC-DLBCLs are aggressive lymphomas with high resistance to current chemotherapies. Low survival rate among patients emphasizes the urgent need for alternative treatment options. The characterization of the MALT1 will be an essential tool for developing new target-directed drugs against MALT1 dependent disorders. As the first step in the atomic-level NMR studies of the system, here we report, the (15)N/(13)C/(1)H backbone assignment of the apo form of the MALT1 paracaspase region together with the third immunoglobulin-like (Ig3) domain, 44 kDa, by high resolution NMR. In addition, the non-uniform sampling (NUS) based targeted acquisition procedure is evaluated as a mean of decreasing acquisition and analysis time for larger proteins.

  5. Backbone Assignment of the MALT1 Paracaspase by Solution NMR.

    Directory of Open Access Journals (Sweden)

    Sofia Unnerståle

    Full Text Available Mucosa-associated lymphoid tissue lymphoma translocation protein 1 (MALT1 is a unique paracaspase protein whose protease activity mediates oncogenic NF-κB signalling in activated B cell-like diffuse large B cell lymphomas (ABC-DLBCLs. ABC-DLBCLs are aggressive lymphomas with high resistance to current chemotherapies. Low survival rate among patients emphasizes the urgent need for alternative treatment options. The characterization of the MALT1 will be an essential tool for developing new target-directed drugs against MALT1 dependent disorders. As the first step in the atomic-level NMR studies of the system, here we report, the (15N/(13C/(1H backbone assignment of the apo form of the MALT1 paracaspase region together with the third immunoglobulin-like (Ig3 domain, 44 kDa, by high resolution NMR. In addition, the non-uniform sampling (NUS based targeted acquisition procedure is evaluated as a mean of decreasing acquisition and analysis time for larger proteins.

  6. ERROR ANALYSIS ON INFORMATION AND TECHNOLOGY STUDENTS’ SENTENCE WRITING ASSIGNMENTS

    Directory of Open Access Journals (Sweden)

    Rentauli Mariah Silalahi

    2015-03-01

    Full Text Available Students’ error analysis is very important for helping EFL teachers to develop their teaching materials, assessments and methods. However, it takes much time and effort from the teachers to do such an error analysis towards their students’ language. This study seeks to identify the common errors made by 1 class of 28 freshmen students studying English in their first semester in an IT university. The data is collected from their writing assignments for eight consecutive weeks. The errors found were classified into 24 types and the top ten most common errors committed by the students were article, preposition, spelling, word choice, subject-verb agreement, auxiliary verb, plural form, verb form, capital letter, and meaningless sentences. The findings about the students’ frequency of committing errors were, then, contrasted to their midterm test result and in order to find out the reasons behind the error recurrence; the students were given some questions to answer in a questionnaire format. Most of the students admitted that careless was the major reason for their errors and lack understanding came next. This study suggests EFL teachers to devote their time to continuously check the students’ language by giving corrections so that the students can learn from their errors and stop committing the same errors.

  7. Assigning and combining probabilities in single-case studies.

    Science.gov (United States)

    Manolov, Rumen; Solanas, Antonio

    2012-12-01

    There is currently a considerable diversity of quantitative measures available for summarizing the results in single-case studies. Given that the interpretation of some of them is difficult due to the lack of established benchmarks, the current article proposes an approach for obtaining further numerical evidence on the importance of the results, complementing the substantive criteria, visual analysis, and primary summary measures. This additional evidence consists of obtaining the statistical significance of the outcome when referred to the corresponding sampling distribution. This sampling distribution is formed by the values of the outcomes (expressed as data nonoverlap, R2, etc.) in case the intervention is ineffective. The approach proposed here is intended to offer the outcome's probability of being as extreme when there is no treatment effect without the need for some assumptions that cannot be checked with guarantees. Following this approach, researchers would compare their outcomes to reference values rather than constructing the sampling distributions themselves. The integration of single-case studies is problematic when different metrics are used across primary studies and not all raw data are available. Via the approach for assigning p values it is possible to combine the results of similar studies regardless of the primary effect size indicator. The alternatives for combining probabilities are discussed in the context of single-case studies, pointing out 2 potentially useful methods-one based on a weighted average and the other on the binomial test.

  8. DRUG REGULATORY STATUS ASSIGNMENT CRITERIA: A CONTRAST AMONG 2 COUNTRIES

    Directory of Open Access Journals (Sweden)

    Anoop Paruchuri*, Vini Pavithran , M. Pavani , S. Selvamuthukumaran and G. P. Mohanta

    2013-01-01

    Full Text Available After a laborious and extravagant procedure the drug finally enters the market for use. But who determines the new drug status as a prescription only or an OTC? There is a clear cut contrast between the US and India with respect to their assignment guidelines and the future prospect of a new drug. In the US the regulatory status of the approved drug is determined as per the FDA guidelines (FDCA of 1938 in accordance with the Durham-Humphrey act of 1951 which depicts the criteria required for a pharmaceutical product to be marketed as a prescription drug or an OTC product. CDSCO headed by the DCGI is the authority responsible for determining the regulatory status which acts as per the regulations listed in Drugs and Cosmetics Act of 1940 in India. The US regulatory system stipulates the malleability for the inter conversion of the drugs regulatory status known as “Rx to OTC switch” which is deficient in India. Perfect implementation of regulations in India will promote effective use of OTC’s and forestall illicit sale of prescription drugs as OTC’s.

  9. Traffic Route Modelling and Assignment with Intelligent Transport System

    Directory of Open Access Journals (Sweden)

    Kunicina Nadezhda

    2014-12-01

    Full Text Available The development of signal transmitting environment for multimodal traffic control will enhance the integration of emergency and specialized transport routing tools in usual traffic control paradigms - it is one of the opportunities offered by modern intelligent traffic control systems. The improvement of effective electric power use in public transport system is an advantage of Intelligent Transport System (ITS. The research is connected with the improvement of on-line traffic control and adaptation of special traffic lighting alternatives by ITS. The assignment of the nearest appropriate transport will be done by passenger request, but unlike information system, the transport planning is done on demand. The task can be solved with the help of modern technical methods and equipment, as well as by applying control paradigms of the distributed systems. The problem is solved with the help of calculations hyper-graph and scheduling theory. The goal of the research is to develop methods, which support scheduling of the emergency transport, using high performance computing.

  10. DESIGN SAMPLING AND REPLICATION ASSIGNMENT UNDER FIXED COMPUTING BUDGET

    Institute of Scientific and Technical Information of China (English)

    Loo Hay LEE; Ek Peng CHEW

    2005-01-01

    For many real world problems, when the design space is huge and unstructured, and time consuming simulation is needed to estimate the performance measure, it is important to decide how many designs to sample and how long to run for each design alternative given that we have only a fixed amount of computing time. In this paper, we present a simulation study on how the distribution of the performance measures and distribution of the estimation errors/noises will affect the decision.From the analysis, it is observed that when the underlying distribution of the noise is bounded and if there is a high chance that we can get the smallest noise, then the decision will be to sample as many as possible, but if the noise is unbounded, then it will be important to reduce the noise level first by assigning more replications for each design. On the other hand, if the distribution of the performance measure indicates that we will have a high chance of getting good designs, the suggestion is also to reduce the noise level, otherwise, we need to sample more designs so as to increase the chances of getting good designs. For the special case when the distributions of both the performance measures and noise are normal, we are able to estimate the number of designs to sample, and the number of replications to run in order to obtain the best performance.

  11. Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube

    Science.gov (United States)

    Mittelmann, Hans; Peng, Jiming; Wu, Xiaolin

    2009-07-01

    In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs. Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n3 log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.

  12. Priority-Based Routing Resource Assignment Considering Crosstalk

    Institute of Scientific and Technical Information of China (English)

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

    2006-01-01

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

  13. Methods of using the quadratic assignment problem solution

    Directory of Open Access Journals (Sweden)

    Izabela Kudelska

    2012-09-01

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

  14. Implementation of an agile maintenance mechanic assignment methodology

    Science.gov (United States)

    Jimenez, Jesus A.; Quintana, Rolando

    2000-10-01

    The objective of this research was to develop a decision support system (DSS) to study the impact of introducing new equipment into a medical apparel plant from a maintenance organizational structure perspective. This system will enable the company to determine if their capacity is sufficient to meet current maintenance challenges. The DSS contains two database sets that describe equipment and maintenance resource profiles. The equipment profile specifies data such as mean time to failures, mean time to repairs, and minimum mechanic skill level required to fix each machine group. Similarly, maintenance-resource profile reports information about the mechanic staff, such as number and type of certifications received, education level, and experience. The DSS will then use this information to minimize machine downtime by assigning the highest skilled mechanics to machines with higher complexity and product value. A modified version of the simplex method, the transportation problem, was used to perform the optimization. The DSS was built using the Visual Basic for Applications (VBA) language contained in the Microsoft Excel environment. A case study was developed from current existing data. The analysis consisted of forty-two machine groups and six mechanic categories with ten skill levels. Results showed that only 56% of the mechanic workforce was utilized. Thus, the company had available resources for meeting future maintenance requirements.

  15. ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMS BASED ON EQUIVALENT NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Qi Xiaogang; Liu Lifang; Lin Sanyang

    2006-01-01

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

  16. Uncommonly isolated clinical Pseudomonas: identification and phylogenetic assignation.

    Science.gov (United States)

    Mulet, M; Gomila, M; Ramírez, A; Cardew, S; Moore, E R B; Lalucat, J; García-Valdés, E

    2017-02-01

    Fifty-two Pseudomonas strains that were difficult to identify at the species level in the phenotypic routine characterizations employed by clinical microbiology laboratories were selected for genotypic-based analysis. Species level identifications were done initially by partial sequencing of the DNA dependent RNA polymerase sub-unit D gene (rpoD). Two other gene sequences, for the small sub-unit ribosonal RNA (16S rRNA) and for DNA gyrase sub-unit B (gyrB) were added in a multilocus sequence analysis (MLSA) study to confirm the species identifications. These sequences were analyzed with a collection of reference sequences from the type strains of 161 Pseudomonas species within an in-house multi-locus sequence analysis database. Whole-cell matrix-assisted laser-desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) analyses of these strains complemented the DNA sequenced-based phylogenetic analyses and were observed to be in accordance with the results of the sequence data. Twenty-three out of 52 strains were assigned to 12 recognized species not commonly detected in clinical specimens and 29 (56 %) were considered representatives of at least ten putative new species. Most strains were distributed within the P. fluorescens and P. aeruginosa lineages. The value of rpoD sequences in species-level identifications for Pseudomonas is emphasized. The correct species identifications of clinical strains is essential for establishing the intrinsic antibiotic resistance patterns and improved treatment plans.

  17. An ambiguity principle for assigning protein structural domains.

    Science.gov (United States)

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

    2017-01-01

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

  18. An ambiguity principle for assigning protein structural domains

    Science.gov (United States)

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

    2017-01-01

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

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

    Science.gov (United States)

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

    2015-10-23

    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

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

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

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

  1. Spin assignment of the first discovered superdeformed band 152Dy(1)

    Institute of Scientific and Technical Information of China (English)

    雷奕安; 曾谨言

    1996-01-01

    Using the several criteria for the spin assignment of a rotational band based on very general argument,the spin of the lowest level observed in the yrast SD band 152Dy(1) is assigned to be I0=26(Eγ(I0+2→I0)=602.4keV),and it is demonstrated that spin assignments of I0≤25 as well as I-≥27 are in contradiction with these criteria.

  2. FAN EMPIRICAL STUDY OF THE RELATIONSHIP BETWEEN ASSIGNMENT PRACTICES IN TRAINING PROGRAMS AND TRAINING MOTIVATION

    OpenAIRE

    AZMAN Ismail; MUHAMMAD ZULFADHLIZAM Ghazali; YUSOF Ismail; MOHD HASBULLAH Mohamad Faudzi; MOHD MURSYID Arshad

    2012-01-01

    The purpose of this study was to measure the relationship between training assignment and training motivation using self-report questionnaires collected from cadet officers in a military training academy, Malaysia. The outcomes of testing hypothesis using a stepwise regression analysis showed two important findings: firstly, mandatory assignment is significantly correlated with training motivation. Secondly, voluntary assignment is also significantly correlated with training motivation. This ...

  3. Preference in random assignment: implications for the interpretation of randomized trials.

    Science.gov (United States)

    Macias, Cathaleene; Gold, Paul B; Hargreaves, William A; Aronson, Elliot; Bickman, Leonard; Barreira, Paul J; Jones, Danson R; Rodican, Charles F; Fisher, William H

    2009-09-01

    Random assignment to a preferred experimental condition can increase service engagement and enhance outcomes, while assignment to a less-preferred condition can discourage service receipt and limit outcome attainment. We examined randomized trials for one prominent psychiatric rehabilitation intervention, supported employment, to gauge how often assignment preference might have complicated the interpretation of findings. Condition descriptions, and greater early attrition from services-as-usual comparison conditions, suggest that many study enrollees favored assignment to new rapid-job-placement supported employment, but no study took this possibility into account. Reviews of trials in other service fields are needed to determine whether this design problem is widespread.

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

    Science.gov (United States)

    Karimzadehgan, Maryam; Zhai, Chengxiang

    2012-07-01

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

  5. New systematic assignments in Gonyleptoidea (Arachnida, Opiliones, Laniatores

    Directory of Open Access Journals (Sweden)

    Ricardo Pinto-da-Rocha

    2012-05-01

    Full Text Available As part of an ongoing revision of the family Gonyleptidae, we have identified many species that are synonyms of previously described species or misplaced in this family. This article summarizes these findings, adding previously unavailable information or correcting imprecise observations to justify the presented taxonomic changes.The following new familial or subfamilial assignments are proposed: Nemastygnus Roewer, 1929 and Taulisa Roewer, 1956 are transferred to Agoristenidae, Agoristeninae; Napostygnus Roewer, 1929 to Cranaidae; Ceropachylinus peruvianus Roewer, 1956 and Pirunipygus Roewer, 1936 are transferred to Gonyleptidae, Ampycinae; Gyndesops Roewer, 1943, Haversia Roewer, 1913 and Oxapampeus Roewer, 1963 are transferred to Gonyleptidae, Pachylinae.The following generic synonymies are proposed for the family Gonyleptidae: Acanthogonyleptes Mello-Leitão, 1922 = Centroleptes Roewer, 1943; Acrographinotus Roewer, 1929 = Unduavius Roewer, 1929; Gonyleptes Kirby, 1819 = Collonychium Bertkau, 1880; Mischonyx Bertkau, 1880 = Eugonyleptes Roewer, 1913 and Gonazula Roewer, 1930; Parampheres Roewer, 1913 = Metapachyloides Roewer, 1917; Pseudopucrolia Roewer, 1912 = Meteusarcus Roewer, 1913; Haversia Roewer, 1913 = Hoggellula Roewer, 1930.The following specific synonymies are proposed for the family Gonyleptidae: Acanthogonyleptes singularis (Mello-Leitão, 1935 = Centroleptes flavus Roewer, 1943, syn. n.; Geraeocormobius sylvarum Holmberg, 1887 = Discocyrtus serrifemur Roewer, 1943, syn. n.; Gonyleptellus bimaculatus (Sørensen, 1884 = Gonyleptes cancellatus Roewer, 1917, syn. n.; Gonyleptes atrus Mello-Leitão, 1923 = Weyhia brieni Giltay, 1928, syn. n.; Gonyleptes fragilis Mello-Leitão, 1923 = Gonyleptes banana Kury, 2003, syn. n.; Gonyleptes horridus Kirby, 1819 = Collonychium bicuspidatum Bertkau, 1880, syn. n., Gonyleptes borgmeyeri Mello-Leitão, 1932, syn. n., Gonyleptes curvicornis Mello-Leitão, 1932, syn. n., Metagonyleptes hamatus

  6. Fixed channel assignment in cellular communication systems considering the whole set of packed patterns

    DEFF Research Database (Denmark)

    Borges, Pedro Manuel F. C.; Vidal, Rene Victor Valqui

    2000-01-01

    This paper addresses the problem of fixed channel assignment in cellular communication systems with nonuniform traffic distribution. The objective of the channel assignment is to minimise the average blocking probability. Methods for finding a good allocation can be based on first building a numb...

  7. A Student-Led Feedback Protocol on Writing Assignments in a History of Mathematics Course

    Science.gov (United States)

    White, Diana

    2014-01-01

    History of math courses are commonly offered in mathematics departments. Such courses naturally lend themselves to writing assignments, and a growing body of research supports writing as a means to learn mathematics. This article details two such assignments, providing an overview of the course in which they are situated, and a student-led…

  8. An Empirical Examination of the Roles of Ability and Gender in Collaborative Homework Assignments

    Science.gov (United States)

    Parker, Jeffrey

    2010-01-01

    The author investigates how ability and gender affect grades on homework projects performed by assigned pairs of students in an undergraduate macroeconomics course. The assignment grade is found to depend on the ability of both students, and the relative importance of the stronger and weaker student differs in predictable ways depending on the…

  9. Investigating Expectations and Experiences of Audio and Written Assignment Feedback in First-Year Undergraduate Students

    Science.gov (United States)

    Fawcett, Hannah; Oldfield, Jeremy

    2016-01-01

    Previous research suggests that audio feedback may be an important mechanism for facilitating effective and timely assignment feedback. The present study examined expectations and experiences of audio and written feedback provided through "turnitin for iPad®" from students within the same cohort and assignment. The results showed that…

  10. Integrating the Liberal Arts and Chemistry: A Series of General Chemistry Assignments to Develop Science Literacy

    Science.gov (United States)

    Miller, Diane M.; Chengelis Czegan, Demetra A.

    2016-01-01

    This paper describes assignments that have been implemented in a General Chemistry I course to promote science literacy. This course was chosen in particular because it reaches a broad audience, which includes nonscience majors. The assignment series begins with several discussions and tasks to develop information literacy, in which students find…

  11. The Role of the Verb in Grammatical Function Assignment in English and Korean

    Science.gov (United States)

    Hwang, Heeju; Kaiser, Elsi

    2014-01-01

    One of the central questions in speech production is how speakers decide which entity to assign to which grammatical function. According to the lexical hypothesis (e.g., Bock & Levelt, 1994), verbs play a key role in this process (e.g., "send" and "receive" result in different entities being assigned to the subject…

  12. 47 CFR 73.504 - Channel assignments in the Mexican border area.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Channel assignments in the Mexican border area... assignments in the Mexican border area. (a) NCE-FM stations within 199 miles (320 km) of the United States-Mexican border shall comply with the separation requirements and other provisions of the...

  13. 47 CFR 1.9055 - Assignment of file numbers to spectrum leasing notifications and applications.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Assignment of file numbers to spectrum leasing... GENERAL PRACTICE AND PROCEDURE Spectrum Leasing General Policies and Procedures § 1.9055 Assignment of file numbers to spectrum leasing notifications and applications. Spectrum leasing notifications...

  14. Optimal Assignment Methods in Three-Form Planned Missing Data Designs for Longitudinal Panel Studies

    Science.gov (United States)

    Jorgensen, Terrence D.; Rhemtulla, Mijke; Schoemann, Alexander; McPherson, Brent; Wu, Wei; Little, Todd D.

    2014-01-01

    Planned missing designs are becoming increasingly popular, but because there is no consensus on how to implement them in longitudinal research, we simulated longitudinal data to distinguish between strategies of assigning items to forms and of assigning forms to participants across measurement occasions. Using relative efficiency as the criterion,…

  15. Organic Chemistry YouTube Writing Assignment for Large Lecture Classes

    Science.gov (United States)

    Franz, Annaliese K.

    2012-01-01

    This work describes efforts to incorporate and evaluate the use of a YouTube writing assignment in large lecture classes to personalize learning and improve conceptual understanding of chemistry through peer- and self-explanation strategies. Although writing assignments can be a method to incorporate peer- and self-explanation strategies, this…

  16. The Generalized Regression Discontinuity Design: Using Multiple Assignment Variables and Cutoffs to Estimate Treatment Effects

    Science.gov (United States)

    Wong, Vivian C.; Steiner, Peter M.; Cook, Thomas D.

    2009-01-01

    This paper introduces a generalization of the regression-discontinuity design (RDD). Traditionally, RDD is considered in a two-dimensional framework, with a single assignment variable and cutoff. Treatment effects are measured at a single location along the assignment variable. However, this represents a specialized (and straight-forward)…

  17. Analyzing Regression-Discontinuity Designs with Multiple Assignment Variables: A Comparative Study of Four Estimation Methods

    Science.gov (United States)

    Wong, Vivian C.; Steiner, Peter M.; Cook, Thomas D.

    2012-01-01

    In a traditional regression-discontinuity design (RDD), units are assigned to treatment and comparison conditions solely on the basis of a single cutoff score on a continuous assignment variable. The discontinuity in the functional form of the outcome at the cutoff represents the treatment effect, or the average treatment effect at the cutoff.…

  18. 49 CFR 173.141 - Class 9-Assignment of packing group.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 2 2010-10-01 2010-10-01 false Class 9-Assignment of packing group. 173.141...-GENERAL REQUIREMENTS FOR SHIPMENTS AND PACKAGINGS Definitions Classification, Packing Group Assignments... packing group. The packing group of a Class 9 material is as indicated in column 5 of the § 172.101 table....

  19. 49 CFR 173.137 - Class 8-Assignment of packing group.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 2 2010-10-01 2010-10-01 false Class 8-Assignment of packing group. 173.137...-GENERAL REQUIREMENTS FOR SHIPMENTS AND PACKAGINGS Definitions Classification, Packing Group Assignments... packing group. The packing group of a Class 8 material is indicated in Column 5 of the § 172.101...

  20. 19 CFR 142.46 - Presentation of invoice and assignment of entry number.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 2 2010-04-01 2010-04-01 false Presentation of invoice and assignment of entry... SECURITY; DEPARTMENT OF THE TREASURY (CONTINUED) ENTRY PROCESS Line Release § 142.46 Presentation of invoice and assignment of entry number. (a) Presentation of invoice. When merchandise that has...

  1. 32 CFR 154.6 - Standards for access to classified information or assignment to sensitive duties.

    Science.gov (United States)

    2010-07-01

    ...) General. Only U.S. citizens shall be granted a personnel security clearance, assigned to sensitive duties... OF THE SECRETARY OF DEFENSE SECURITY DEPARTMENT OF DEFENSE PERSONNEL SECURITY PROGRAM REGULATION... Department of Defense mission, including, special expertise, to assign an individual who is not a citizen...

  2. Written Assignments for Abnormal Psychology at Howard Community College, Fall 1988.

    Science.gov (United States)

    Bell, James

    Designed for students enrolled in an Abnormal Psychology course at Howard Community College (Maryland), this booklet explains the requirements for the course's writing assignments, which are designed to teach the skills of comparison and contrast, analysis, critical thinking, and synthesis. Following an overview of class assignments and…

  3. Kiva Microloans in a Learning Community: An Assignment for Interdisciplinary Synthesis

    Science.gov (United States)

    Staats, Susan; Sintjago, Alfonso; Fitzpatrick, Renata

    2013-01-01

    Learning communities can strengthen early undergraduates' learning, but planning them can be daunting for instructors. Learning communities usually rely on integrative assignments that encourage interdisciplinary analysis. This article reports on our experiences using microloans as an interdisciplinary assignment in a learning community that…

  4. Optimisation of timetable-based, stochastic transit assignment models based on MSA

    DEFF Research Database (Denmark)

    Nielsen, Otto Anker; Frederiksen, Rasmus Dyhr

    2006-01-01

    (CRM), such a large-scale transit assignment model was developed and estimated. The Stochastic User Equilibrium problem was solved by the Method of Successive Averages (MSA). However, the model suffered from very large calculation times. The paper focuses on how to optimise transit assignment models...

  5. 47 CFR 1.2111 - Assignment or transfer of control: unjust enrichment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Assignment or transfer of control: unjust...: unjust enrichment. (a) Reporting requirement. An applicant seeking approval for a transfer of control or... consideration that the applicant would receive in return for the transfer or assignment of its license (see §...

  6. Teaching Random Assignment: A Classroom Demonstration Using a Deck of Playing Cards

    Science.gov (United States)

    Enders, Craig K.; Laurenceau, Jean-Philippe; Stuetzle, Rick

    2006-01-01

    Despite its apparent simplicity, random assignment is an abstract concept for many students. This article describes a classroom demonstration that uses a standard deck of playing cards. In small groups, students randomly assign playing cards (i.e., participants) to 2 treatment groups. Following randomization, students compare the relative…

  7. Incorporating Women and Crime Topics into Criminology Classes: Assignments, Exercises, and Projects.

    Science.gov (United States)

    Wright, Richard A.

    1987-01-01

    Recommends a variety of books, assignments, exercises, and projects which can be incorporated into introductory criminology classes to compensate for the omission of topics on women and crime in textbooks and curricula. Includes a list of potential topics for writing assignments and a selection of films covering such topics as sexual harassment,…

  8. Effect of Sex and Race Identification on Instrument Assignment by Music Educators

    Science.gov (United States)

    Johnson, Christopher M.; Stewart, Erin E.

    2005-01-01

    The purpose of this study was to investigate the effect of sex and race identification on the assignment of instruments to beginning band students. Participants (N = 201) were music educators solicited by university professors across the United States. Participants completed an online survey about instrument assignments. Half the participants were…

  9. Increasing Student Involvement through Residence Hall Lifestyle Assignments and Developmental Programming.

    Science.gov (United States)

    Warner, Mark J.; Noftsinger, John B.

    1994-01-01

    This study investigated the usefulness of three dormitory lifestyle assignments (male-only, female-only, co-ed) in promoting student participation in residence hall activities at James Madison University (Virginia). Results showed assignment to coeducational dormitories fostered more and varied student involvement than did male-only or female-only…

  10. Combining Collision Avoidance and Operator Workload Reduction with Cooperative Task Assignment and Path Planning (Preprint)

    Science.gov (United States)

    2006-10-01

    Proceedings of the American Control Conference , 2002. [5] P. Chandler, M. Pachter, S. Rasmussen, and C. Schumacher, “Multiple task assignment for a uav...assign- ing cooperating uavs to multiple tasks,” Proceedings of the American Control Conference , 2006. [7] T. shima, S. Rasmussen, and D. Gross

  11. Effects of choosing academic assignments on a student with attention deficit hyperactivity disorder.

    OpenAIRE

    1997-01-01

    The effects of choosing academic assignments on the undesirable behaviors manifested by a second-grade student with attention deficit hyperactivity disorder were analyzed. This study extended Dunlap et al.'s (1994) research on choice making as a form of antecedent control. A reversal design showed that undesirable behaviors decreased when the student was given a choice of academic assignments.

  12. Ways of Writing: Linguistic Analysis of Self-Assessment and Traditional Assignments

    Science.gov (United States)

    Peden, Blaine F.; Carroll, David W.

    2008-01-01

    Scholars of teaching and learning have endorsed self-assessment assignments as a way to encourage greater reflection by students. However, no studies to date have compared writing in self-assessment with traditional academic assignments. We performed a quantitative text analysis of students' language in self-assessment versus traditional…

  13. The (digital) natives are restless: designing and implementing an interactive digital media assignment.

    Science.gov (United States)

    Voge, Catherine; Hirvela, Kari; Jarzemsky, Paula

    2012-01-01

    To create an opportunity for students to connect with the Quality and Safety Education for Nurses competencies and demonstrate learning via knowledge transference, the authors piloted a digital media assignment. Students worked in small groups to create an unfolding patient care scenario with embedded decision points, using presentation software. The authors discuss the assignment and its outcomes.

  14. The "Post-Racial" Politics of Race: Changing Student Assignment Policy in Three School Districts

    Science.gov (United States)

    McDermott, Kathryn A.; Frankenberg, Erica; Diem, Sarah

    2015-01-01

    Many school districts have recently revised, or tried to revise, their policies for assigning students to schools, because the legal and political status of racial and other kinds of diversity is uncertain, and the districts are facing fiscal austerity. This article presents case studies of politics and student assignment policy in three large…

  15. 42 CFR 424.84 - Final determination on revocation of right to receive assigned benefits.

    Science.gov (United States)

    2010-10-01

    ... receive assigned benefits. (a) Basis of final determination—(1) Final determination without a hearing. If... 42 Public Health 3 2010-10-01 2010-10-01 false Final determination on revocation of right to receive assigned benefits. 424.84 Section 424.84 Public Health CENTERS FOR MEDICARE & MEDICAID...

  16. High Stakes and Low Stakes in Assigning and Responding to Writing.

    Science.gov (United States)

    Elbow, Peter

    1997-01-01

    Argues that college teachers will have an easier and more productive experience with student writing if they make and communicate the distinction between high-stakes and low-stakes assignments and between high- and low-stakes ways of responding to student writing. Specific suggestions are made for communicating assignments and commenting on them.…

  17. NEW CRITERIA FOR ASSIGNING WASTE CONTAINING TECH-NOGENIC RADIONUCLIDES TO THE RADIOACTIVE WASTE

    Directory of Open Access Journals (Sweden)

    I. K. Romanovich

    2010-01-01

    Full Text Available The article contains detailed description of criteria for assigning of liquid and gaseous industrial waste containing technogenicradionuclides to the radioactive waste, presented in the new Basic Sanitary Rulesof Radiation Safety (OSPORB-99/2010. The analysisof shortcomings and discrepancies of the previously used in Russia system of criteria for assigning waste to the radioactive waste is given.

  18. Toward Technology Integration in Mathematics Education: A Technology-Integration Course Planning Assignment

    Science.gov (United States)

    Kersaint, Gladis

    2007-01-01

    This article describes a technology integration course planning assignment that was developed to enhance preservice teachers' technological pedagogical content knowledge (TPCK). This assignment required preservice teachers work with peers to integrate various technological tools (e.g., graphing calculators, web-based mathematics applets, etc) in a…

  19. Does Career Timing of Challenging Job Assignments Influence the Relationship with In-Role Job Performance?

    Science.gov (United States)

    Carette, Bernd; Anseel, Frederik; Lievens, Filip

    2013-01-01

    To prevent the potential threats of career plateauing for mid-career employees, it has been suggested to give them challenging assignments. This approach is inspired by empirical findings demonstrating that challenging job assignments generally have positive effects on job performance and career development. However, these studies have…

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

    Directory of Open Access Journals (Sweden)

    R.Mohan

    2014-06-01

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

  1. The Automatic Sweetheart: An Assignment in a History of Psychology Course

    Science.gov (United States)

    Sibicky, Mark E.

    2007-01-01

    This article describes an assignment in a History of Psychology course used to enhance student retention of material and increase student interest and discussion of the long-standing debate between humanistic and mechanistic models in psychology. Adapted from William James's (1955) automatic sweetheart question, the assignment asks students to…

  2. Disentangling Mathematics Target and Access Skills: Implications for Accommodation Assignment Practices

    Science.gov (United States)

    Ketterlin-Geller, Leanne R.; Jamgochian, Elisa M.; Nelson-Walker, Nancy J.; Geller, Joshua P.

    2012-01-01

    Appropriate assignment of accommodations is predicated on a clear distinction between target skills and access skills. In this study, we examine the agreement between test developer/researchers' and educators' classification of target and access skills as a possible explanatory mechanism for assigning accommodations. Findings indicate that…

  3. A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives

    NARCIS (Netherlands)

    de Klerk, E.; Sotirov, R.; Truetsch, U.

    2015-01-01

    Recent progress in solving quadratic assignment problems (QAPs) from the QAPLIB (Quadratic Assignment Problem Library) test set has come from mixed-integer linear or quadratic programming models that are solved in a branch-and-bound framework. Semidefinite programming (SDP) bounds for QAPs have also

  4. 8 CFR 337.7 - Information and assignment of individuals under exclusive jurisdiction.

    Science.gov (United States)

    2010-01-01

    ... 8 Aliens and Nationality 1 2010-01-01 2010-01-01 false Information and assignment of individuals under exclusive jurisdiction. 337.7 Section 337.7 Aliens and Nationality DEPARTMENT OF HOMELAND SECURITY NATIONALITY REGULATIONS OATH OF ALLEGIANCE § 337.7 Information and assignment of individuals under...

  5. 8 CFR 1337.7 - Information and assignment of individuals under exclusive jurisdiction.

    Science.gov (United States)

    2010-01-01

    ... 8 Aliens and Nationality 1 2010-01-01 2010-01-01 false Information and assignment of individuals... assignment of individuals under exclusive jurisdiction. (a) No later than at the time of the examination on the application pursuant to § 335.2 of 8 CFR chapter I, an employee of the Service shall advise...

  6. Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem

    NARCIS (Netherlands)

    de Klerk, E.; Sotirov, R.

    2007-01-01

    We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.

  7. NEW CRITERIA FOR ASSIGNING WASTE CONTAINING TECH-NOGENIC RADIONUCLIDES TO THE RADIOACTIVE WASTE

    OpenAIRE

    I. K. Romanovich; M. I. Balonov; A. N. Barkovsky

    2010-01-01

    The article contains detailed description of criteria for assigning of liquid and gaseous industrial waste containing technogenicradionuclides to the radioactive waste, presented in the new Basic Sanitary Rulesof Radiation Safety (OSPORB-99/2010). The analysisof shortcomings and discrepancies of the previously used in Russia system of criteria for assigning waste to the radioactive waste is given.

  8. Assessing an Information Literacy Assignment and Workshop Using a Quasi-Experimental Design

    Science.gov (United States)

    Fitzpatrick, Maureen J.; Meulemans, Yvonne Nalani

    2011-01-01

    To determine the impact of an assignment and workshop intended to increase students' information literacy skills, we conducted a quasi-experiment using a pretest-posttest assessment with undergraduate students in four sections of an introduction to developmental psychology course. Two sections (N = 81) received the assignment and instructions…

  9. Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic

    DEFF Research Database (Denmark)

    Bloch, Søren; Christiansen, Christian Holk

    This paper addresses the Two-level Storage Location Assignment Problem (TSLAP) for two level low-level picker-to-part warehouses. The first level consists of a forward area from which all picking is done. The second level consists of a reserve storage area, from which the forward area is replenis......This paper addresses the Two-level Storage Location Assignment Problem (TSLAP) for two level low-level picker-to-part warehouses. The first level consists of a forward area from which all picking is done. The second level consists of a reserve storage area, from which the forward area...... is replenished. A large part of the cost of operating the warehouse is a function of the assignment of items to locations at both the reserve storage and the forward area. The cost of the storage location assignment at the forward area is dependent on the storage location assignment at the reserve area and visa...

  10. An integer programming model for gate assignment problem at airline terminals

    Science.gov (United States)

    Chun, Chong Kok; Nordin, Syarifah Zyurina

    2015-05-01

    In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.

  11. Simultaneous active and passive control for eigenstructure assignment in lightly damped systems

    Science.gov (United States)

    Richiedei, Dario; Trevisani, Alberto

    2017-02-01

    The assignment of the eigenstructure (i.e. eigenvalues and eigenvectors) in vibrating systems is an effective way to improve their dynamic performances. System controllability ensures that the poles of the controlled system are exactly assigned but it does not allow to assign arbitrary desired eigenvectors. To this purpose, this paper proposes a novel method for vibration control in lightly damped systems through the concurrent synthesis of passive structural modifications and active state (or state derivative) feedback control gains. Indeed, the suitable modification of the inertial and elastic parameters allows to enlarge the range of assignable eigenvectors. The problem is formulated as an optimization problem, where constraints are introduced to assure the feasibility of the physical system modifications while avoiding spillover phenomena. The experimental application to the eigenstructure assignment on a manipulator proves the method effectiveness.

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

    Directory of Open Access Journals (Sweden)

    Omar M. Zakaria

    2016-01-01

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Avtar Singh Buttar

    2013-03-01

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

  15. Automatic assignment of protein backbone resonances by direct spectrum inspection in targeted acquisition of NMR data.

    Science.gov (United States)

    Wong, Leo E; Masse, James E; Jaravine, Victor; Orekhov, Vladislav; Pervushin, Konstantin

    2008-10-01

    The necessity to acquire large multidimensional datasets, a basis for assignment of NMR resonances, results in long data acquisition times during which substantial degradation of a protein sample might occur. Here we propose a method applicable for such a protein for automatic assignment of backbone resonances by direct inspection of multidimensional NMR spectra. In order to establish an optimal balance between completeness of resonance assignment and losses of cross-peaks due to dynamic processes/degradation of protein, assignment of backbone resonances is set as a stirring criterion for dynamically controlled targeted nonlinear NMR data acquisition. The result is demonstrated with the 12 kDa (13)C,(15) N-labeled apo-form of heme chaperone protein CcmE, where hydrolytic cleavage of 29 C-terminal amino acids is detected. For this protein, 90 and 98% of manually assignable resonances are automatically assigned within 10 and 40 h of nonlinear sampling of five 3D NMR spectra, respectively, instead of 600 h needed to complete the full time domain grid. In addition, resonances stemming from degradation products are identified. This study indicates that automatic resonance assignment might serve as a guiding criterion for optimal run-time allocation of NMR resources in applications to proteins prone to degradation.

  16. Automatic assignment of protein backbone resonances by direct spectrum inspection in targeted acquisition of NMR data

    Energy Technology Data Exchange (ETDEWEB)

    Wong, Leo E. [Nanyang Technological University, School of Biological Sciences (Singapore); Masse, James E. [National Institutes of Health (United States); Jaravine, Victor [J. W. Goethe-University Frankfurt, Institute of Biophysical Chemistry (Germany); Orekhov, Vladislav [Gothenburg University, Swedish NMR Centre (Sweden); Pervushin, Konstantin [Nanyang Technological University, School of Biological Sciences (Singapore)], E-mail: kpervushin@ntu.edu.sg

    2008-10-15

    The necessity to acquire large multidimensional datasets, a basis for assignment of NMR resonances, results in long data acquisition times during which substantial degradation of a protein sample might occur. Here we propose a method applicable for such a protein for automatic assignment of backbone resonances by direct inspection of multidimensional NMR spectra. In order to establish an optimal balance between completeness of resonance assignment and losses of cross-peaks due to dynamic processes/degradation of protein, assignment of backbone resonances is set as a stirring criterion for dynamically controlled targeted nonlinear NMR data acquisition. The result is demonstrated with the 12 kDa {sup 13}C,{sup 15} N-labeled apo-form of heme chaperone protein CcmE, where hydrolytic cleavage of 29 C-terminal amino acids is detected. For this protein, 90 and 98% of manually assignable resonances are automatically assigned within 10 and 40 h of nonlinear sampling of five 3D NMR spectra, respectively, instead of 600 h needed to complete the full time domain grid. In addition, resonances stemming from degradation products are identified. This study indicates that automatic resonance assignment might serve as a guiding criterion for optimal run-time allocation of NMR resources in applications to proteins prone to degradation.

  17. [Rapid assessment of critical quality attributes of Chinese materia medica (II): strategy of NIR assignment].

    Science.gov (United States)

    Pei, Yan-Ling; Wu, Zhi-Sheng; Shi, Xin-Yuan; Zhou, Lu-Wei; Qiao, Yan-Jiang

    2014-09-01

    The present paper firstly reviewed the research progress and main methods of NIR spectral assignment coupled with our research results. Principal component analysis was focused on characteristic signal extraction to reflect spectral differences. Partial least squares method was concerned with variable selection to discover characteristic absorption band. Two-dimensional correlation spectroscopy was mainly adopted for spectral assignment. Autocorrelation peaks were obtained from spectral changes, which were disturbed by external factors, such as concentration, temperature and pressure. Density functional theory was used to calculate energy from substance structure to establish the relationship between molecular energy and spectra change. Based on the above reviewed method, taking a NIR spectral assignment of chlorogenic acid as example, a reliable spectral assignment for critical quality attributes of Chinese materia medica (CMM) was established using deuterium technology and spectral variable selection. The result demonstrated the assignment consistency according to spectral features of different concentrations of chlorogenic acid and variable selection region of online NIR model in extract process. Although spectral assignment was initial using an active pharmaceutical ingredient, it is meaningful to look forward to the futurity of the complex components in CMM. Therefore, it provided methodology for NIR spectral assignment of critical quality attributes in CMM.

  18. Interactive Level Design for iOS Assignment Delivery: A Case Study

    Directory of Open Access Journals (Sweden)

    Anson Brown

    2014-02-01

    Full Text Available This paper presents an application of an iOS-based online gaming assignment in a real classroom. The core concept of the project is a gameplay environment involving two players that have full control over creation and modification of levels. This level design mechanism was implemented in an iOS-based game in the area of genetics and based on an existing written assignment. The game includes support for both instructors, who have the ability to create and post assignments and students, who can take the assignments. Two trials of the iOS application consisted of in-class testing of twenty- one students. Students first took the original paper assignment, followed by the iOS version. Start times, end times, and grades were recorded for both versions. A comprehensive study of the grades and times for the iOS version of the assignment versus the paper version was conducted and is presented in this paper. Our Study showed that the iOS version was completed much faster in nearly every case while a strong delivery mechanism is needed to ensure student grades and completion of the assignment will not be affected. These results are not unexpected due to some major difference between the two formats. Future updates and additions will address any currently existing issues.

  19. Neurodynamics-Based Robust Pole Assignment for High-Order Descriptor Systems.

    Science.gov (United States)

    Le, Xinyi; Wang, Jun

    2015-11-01

    In this paper, a neurodynamic optimization approach is proposed for synthesizing high-order descriptor linear systems with state feedback control via robust pole assignment. With a new robustness measure serving as the objective function, the robust eigenstructure assignment problem is formulated as a pseudoconvex optimization problem. A neurodynamic optimization approach is applied and shown to be capable of maximizing the robust stability margin for high-order singular systems with guaranteed optimality and exact pole assignment. Two numerical examples and vehicle vibration control application are discussed to substantiate the efficacy of the proposed approach.

  20. BUS 320 Assignment 2: Case Study: Michael Dell—The Man Behind Dell

    OpenAIRE

    Laynebaril

    2017-01-01

    BUS 320 Assignment 2: Case Study: Michael Dell—The Man Behind Dell   Click Link Below To Buy: http://hwcampus.com/shop/bus-320-assignment-2-case-study-michael-dell-the-man-behind-dell/ Or Visit www.hwcampus.com   Assignment 2: Case Study: Michael Dell—The Man Behind Dell Presentation (Change Management) Michael Dell began building and selling computers from his dorm room at age 19. He dropped out of the University of Texas when his sales hit $60 million and has nev...

  1. post pfa304 ull course [ all assignments and all unit discussions latest 2015 [ all 8 units

    OpenAIRE

    Laynebaril

    2017-01-01

     post pfa304 ull course [ all assignments and all unit discussions latest 2015 [ all 8 units ] Click Link Below To Buy: http://hwcampus.com/shop/pfa304-ull-course/   unit 1     Just as a reminder, this assignment should be between 400 and 750 words long. It's due anytime before Sunday at 11:59pm, as is every assignment for each week of this course. Watch the trailer for just one in a long line of Cohen brothers masterpieces, 2010's True Grit: http://www.yout...

  2. A Web Support System for Submission and Handling of Programming Assignments

    DEFF Research Database (Denmark)

    Nørmark, Kurt

    2011-01-01

    Individual submission of programming assignments should be considered in all introductory programming courses. We describe a custom web support system for submission and management of programming assignments in an introductory C programming course. Experience from the first time use of the system...... is reported. In addition, we compare the pattern of use with the results of the final exam in order to reveal a possible impact of the programming assignments. We summarize the lessons learned in preparation for improving the system prior to the next round of use in the fall of 2011....

  3. The Analysis of Braess’ Paradox and Robustness Based on Dynamic Traffic Assignment Models

    Directory of Open Access Journals (Sweden)

    Bai-Bai Fu

    2013-01-01

    Full Text Available The investigation of the paradox and robustness about the traffic network is an important branch of the traffic assignment. In this paper, Braess’ paradox and robustness of the dynamic traffic network are analyzed by the dynamic traffic assignment models. In addition, the relationship of total costs with different traffic assignment models is discussed. The results show that the paradox only occurs in certain range; the robustness of the network and the relationship of total traffic costs are changed as the traffic demand changes, which provides theoretical guidance for the urban transportation planning.

  4. Danish Public Construction Counselling Selection and Assignment Criteria in European Tendering

    DEFF Research Database (Denmark)

    Larsen, Jesper Kranker; Ussing, Lene Faber; Brunø, Thomas Ditlev

    2014-01-01

    One of the largest customers in the Danish construction industry is public agencies that own and develop projects. For some of the counselling services, they recur to be put out in European tendering. The aim is to find which selection and assignment criteria are used most in public tendering. How...... projects use selection and assignment criteria for counselling services and finally if there is significant use of selection and assignment methods in public counselling. The method is based on 74 public counselling tenders from the European Tenders Electronic Daily database from January 2010 to March 2013...

  5. Validation of an efficient method of assigning material properties in finite element analysis of pelvic bone.

    Science.gov (United States)

    Shim, Vickie B; Battley, Mark; Anderson, Iain A; Munro, Jacob T

    2015-01-01

    Bone in the pelvis is a composite material with a complex anatomical structure that is difficult to model computationally. Rather than assigning material properties to increasingly smaller elements to capture detail in three-dimensional finite element (FE) models, properties can be assigned to Gauss points within larger elements. As part of a validation process, we compared experimental and analytical results from a composite beam under four-point load to FE models with material properties assigned to refined elements and Gauss points within larger elements. Both FE models accurately predicted deformation and the analytical predictions of internal shear stress.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-07-15

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

  7. 75 FR 1683 - Financial Management Service; Proposed Collection of Information: Assignment Form

    Science.gov (United States)

    2010-01-12

    ... Fiscal Service Financial Management Service; Proposed Collection of Information: Assignment Form AGENCY: Financial Management Service, Fiscal Service, Treasury. ACTION: Notice and request for comments. SUMMARY: The Financial Management Service, as part of its continuing effort to reduce paperwork and...

  8. Jumping on Thin Ice: Values Argument Writing Assignment for a Large Enrollment Plant Science Class.

    Science.gov (United States)

    Grabau, Larry J.; Wilson, Patricia S.

    1995-01-01

    Documents an evolving attempt to manage a values argument writing assignment in a large enrollment plant science class. Explores how developing library skills improved students' writing. Contains 22 references. (DDR)

  9. A Review on Quantitative Approaches for Dock Door Assignment in Cross-Docking

    Directory of Open Access Journals (Sweden)

    Adibah Shuib

    2012-01-01

    Full Text Available Cross docking is a relatively new technique in supply chain operations. It offers limited storage time to maximize the efficiency of goods transshipment. Efficient operation of a cross docking system requires an appropriate coordination of inbound and outbound flows, accurate planning and dynamic scheduling.  The planning strategies at cross docking terminals, which are receiving growing attention today, are the truck-to-door assignment and destination to door assignment problems. This paper provides a comprehensive literature review of quantitative approaches in dock door assignment problems of cross docking planning. The contributions of this paper are to identify the gap of knowledge in operational levels mainly in dock door assignment and to point out the future research direction in cross docking.

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

    Science.gov (United States)

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

    2014-09-01

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

  11. Ex-vivo HRMAS of adult brain tumours: metabolite quantification and assignment of tumour biomarkers.

    NARCIS (Netherlands)

    Wright, A.J.; Fellows, G.A.; Griffiths, J.R.; Wilson, M.; Bell, B.A.; Howe, F.A.

    2010-01-01

    BACKGROUND: High-resolution magic angle spinning (HRMAS) NMR spectroscopy allows detailed metabolic analysis of whole biopsy samples for investigating tumour biology and tumour classification. Accurate biochemical assignment of small molecule metabolites that are "NMR visible" will improve our inter

  12. Description and Evaluation of a Short Writing Assignment in Historical Geology.

    Science.gov (United States)

    Macdonald, R. Heather; Purdy, Renee Ann

    1989-01-01

    Students write a short paper in which they describe and interpret the history of a geologic feature. Provides an introduction, logistics of the assignment, background and rationale for the writing process, suggestions for change, and conclusions. (RT)

  13. Neural Networks Based Physical Cell Identity Assignment for Self Organized 3GPP Long Term Evolution

    Directory of Open Access Journals (Sweden)

    Muhammad Basit Shahab

    2013-10-01

    Full Text Available This paper proposes neural networks based graph coloring technique to assign Physical Cell Identities throughout the self-organized 3GPP Long Term Evolution Networks. PCIs are allocated such that no two cells in the vicinity of each other or with a common neighbor get the same identity. Efficiency of proposed methodology resides in the fact that minimum number of identities is utilized in the network wise assignment. Simulations are performed on a very large scale network, where initially all the cells are without any PCIs assigned. Results of simulations are demonstrated to analyze the performance of the proposed technique. Discussions about the presence of femto cells and PCI assignment in them are also presented at the end.

  14. Modeling multiple visual words assignment for bag-of-features based medical image retrieval

    KAUST Repository

    Wang, Jim Jing-Yan

    2012-01-01

    In this paper, we investigate the bag-of-features based medical image retrieval methods, which represent an image as a collection of local features, such as image patch and key points with SIFT descriptor. To improve the bag-of-features method, we first model the assignment of local descriptor as contribution functions, and then propose a new multiple assignment strategy. By assuming the local feature can be reconstructed by its neighboring visual words in vocabulary, we solve the reconstruction weights as a QP problem and then use the solved weights as contribution functions, which results in a new assignment method called the QP assignment. We carry our experiments on ImageCLEFmed datasets. Experiments\\' results show that our proposed method exceeds the performances of traditional solutions and works well for the bag-of-features based medical image retrieval tasks.

  15. How can we assign real-life communication activities in class?

    Institute of Scientific and Technical Information of China (English)

    吴西

    2014-01-01

    Speaking has always been an important part of English teaching. With the real example from teaching experience and prac-tice, this passage discussed about different ways to gather material and assign tasks in the speaking class.

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

    Science.gov (United States)

    Zhang, Lei

    2016-05-01

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

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

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

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

  18. The Kinetics of Chirality Assignment in Catalytic Single Walled Carbon Nanotube Growth

    OpenAIRE

    Xu, Ziwei; Yan, Tianying; Ding, Feng

    2014-01-01

    Chirality-selected single-walled carbon nanotubes (SWCNTs) ensure a great potential of building ~1 nm sized electronics. However, the reliable method for chirality-selected SWCNT is still pending. Here we present a theoretical study on the SWCNT's chirality assignment and control during the catalytic growth. This study reveals that the chirality of a SWCNT is determined by the kinetic incorporation of the pentagon formation during SWCNT nucleation. Therefore, chirality is randomly assigned on...

  19. Motion Planning and Task Assignment for Unmanned Aerial Vehicles Cooperating with Unattended Ground Sensors

    Science.gov (United States)

    2014-10-24

    However, the minimum-time function for the Dubins dynamics is discontinuous (in other words, an infinitesimal change of the value of a heading can...of the look-ahead horizon k, however the calculations need to account for a varying k and, hence, are more involved. Once headings have been assigned...i prior to stage m. The assignment history is used to obtain the initial condition (position and orientation) required to calculate the vehicle’s path

  20. Bag-of-features based medical image retrieval via multiple assignment and visual words weighting

    KAUST Repository

    Wang, Jingyan

    2011-11-01

    Bag-of-features based approaches have become prominent for image retrieval and image classification tasks in the past decade. Such methods represent an image as a collection of local features, such as image patches and key points with scale invariant feature transform (SIFT) descriptors. To improve the bag-of-features methods, we first model the assignments of local descriptors as contribution functions, and then propose a novel multiple assignment strategy. Assuming the local features can be reconstructed by their neighboring visual words in a vocabulary, reconstruction weights can be solved by quadratic programming. The weights are then used to build contribution functions, resulting in a novel assignment method, called quadratic programming (QP) assignment. We further propose a novel visual word weighting method. The discriminative power of each visual word is analyzed by the sub-similarity function in the bin that corresponds to the visual word. Each sub-similarity function is then treated as a weak classifier. A strong classifier is learned by boosting methods that combine those weak classifiers. The weighting factors of the visual words are learned accordingly. We evaluate the proposed methods on medical image retrieval tasks. The methods are tested on three well-known data sets, i.e., the ImageCLEFmed data set, the 304 CT Set, and the basal-cell carcinoma image set. Experimental results demonstrate that the proposed QP assignment outperforms the traditional nearest neighbor assignment, the multiple assignment, and the soft assignment, whereas the proposed boosting based weighting strategy outperforms the state-of-the-art weighting methods, such as the term frequency weights and the term frequency-inverse document frequency weights. © 2011 IEEE.

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

    Science.gov (United States)

    Nguyen, Charles C.

    1987-01-01

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

  2. Optimal Pole Assignment of Linear Systems by the Sylvester Matrix Equations

    Directory of Open Access Journals (Sweden)

    Hua-Feng He

    2014-01-01

    class of linear matrix equations, necessary and sufficient conditions for the existence of a solution to the optimal pole assignment problem are proposed in this paper. By properly choosing the free parameters in the parametric solutions to this class of linear matrix equations, complete solutions to the optimal pole assignment problem can be obtained. A numerical example is used to illustrate the effectiveness of the proposed approach.

  3. "Failure to assign failing grades": issues with grading the unsafe student.

    Science.gov (United States)

    Luhanga, Florence; Yonge, Olive J; Myrick, Florence

    2008-01-01

    In a grounded theory study examining the process of precepting an unsafe student, it was found that preceptors assigned passing grades to students who in fact should not have passed. Although preceptors perceived their role as gatekeepers for the profession, by not assigning failing grades to students who should not have passed a course, essentially they were abdicating their responsibility. Indeed, the simple act of assuming responsibility for precepting a student implies professional as well as pedagogical accountability.

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

    Science.gov (United States)

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

    2011-05-01

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

  5. mgt660 full course [ all discussion all assignments and all case study

    OpenAIRE

    Laynebaril

    2017-01-01

    mgt660 full course [ all discussion all assignments and all case study ] Click Link Below To Buy: http://hwcampus.com/shop/mgt660-full-course/   MGT 660 Capstone Project Overview Creation of a market entry plan, or creation of a market expansion plan, or an M&A plan The structure of this assignment is comprehensive and integrative. It requires synthesis and evaluation of information, skills and knowledge developed throughout your degree program. This final ...

  6. Devry NR447 full course latest 2015 october [ all Week Discussion and all assignments

    OpenAIRE

    Laynebaril

    2017-01-01

     Devry NR447 full course latest 2015 october [ all Week Discussion and all assignments ] Click Link Below To Buy: http://hwcampus.com/shop/nr447-full-course-latest/   Devry NR447 Week 1 Discussion 1 & 2 Latest 2015 October Discussion 1 Review the Huston (2010) article listed under reading assignments. Which skills described for the Nurse Leader in the year 2020 are important now? Explain your rationale and provide an example from your practice setting (or from y...

  7. Synthesis, chiral HPLC resolution and configuration assignment of 1-phenylglyceryl trinitrate stereomers.

    Science.gov (United States)

    Chegaev, Konstantin; Lazzarato, Loretta; Tron, Gian Cesare; Marabello, Domenica; Stilo, Antonella Di; Cena, Clara; Fruttero, Roberta; Gasco, Alberto; Vanthuyne, Nicolas; Roussel, Christian

    2006-06-01

    As an introductory study of in vitro vasodilating activity, the access to the four stereomers of 1-phenylglyceryl trinitrate is described using achiral and chiral chromatography. For semi-preparative separation of the enantiomers, a Chiralcel OD (250 x 10 mm, 10 microm) was used. Catalytic reduction leading to the corresponding stereomers of 1-phenylglycerol allowed absolute configuration assignments. The same methods were used for the separation and configuration assignment of the enantiomers of 3-phenylpropane-1,2-diyl dinitrate.

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

    Science.gov (United States)

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

    2014-06-01

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

  9. Characteristic polynomial assignment in F-M model Ⅱ of 2-D systems

    Institute of Scientific and Technical Information of China (English)

    唐万生; 亢京力

    2004-01-01

    The problems of characteristic polynomial assignment in Fornasini-Marchesini (F-M) model Ⅱ of 2-D systems are investigated. The corresponding closed-loop systems described by F-M model Ⅱ are obtained via the state feedback.Using the algebraic geometry method, the characteristic polynomial assignment in the closed-loop systems is discussed. In terms of the theory of algebraic geometry, the problem of characteristic polynomial assignment is transferred to the one whether a rational mapping is onto. Sufficient conditions for almost arbitrary assignment coefficients of characteristic polynomial in F-M model Ⅱ of 2-D systems via state feedback are derived, and they are available for multi-input cases. It also has been shown that this method can be applied to assign the characteristic polynomial with output feedback. The sufficient conditions for almost arbitrary assignment coefficients of characteristic polynomial of multi-input 2-D systems described by F-M model Ⅱ with output feedback are established.

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

    Directory of Open Access Journals (Sweden)

    Yee Shin Chia

    2012-12-01

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

  11. Design and Evaluation of Digital Assignments on Research Experiments within Food Chemistry

    Science.gov (United States)

    Diederen, Julia; Gruppen, Harry; Hartog, Rob; Voragen, Alphons G. J.

    2006-10-01

    Laboratory classes are regarded as an important learning activity, but they also have shortcomings: laboratory classes are often an inefficient learning activity for students and often do not sufficiently support students in developing research specific cognitive skills. It is hypothesized that some of such skills can be achieved more effectively with digital assignments than with laboratory classes. Therefore, three digital assignments have been designed, developed and evaluated. The assignments have three goals: (1) providing a situation in which students can practice research specific cognitive skills and (2) offering a research method which students can also use in a real laboratory situation and (3) providing the possibility to come across a number of common pitfalls. The assignments are described in detail. Results of a first evaluation of the use of the assignments indicate that the students consider the assignments challenging and valuable. The examination results demonstrate that students are quite capable of making a research design. Although students indicate to have learned a useful research method, students do not apply the method in the laboratory classes.

  12. The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres

    Science.gov (United States)

    Ming-Huang Chiang, David; Lin, Chia-Ping; Chen, Mu-Chen

    2011-05-01

    Among distribution centre operations, order picking has been reported to be the most labour-intensive activity. Sophisticated storage assignment policies adopted to reduce the travel distance of order picking have been explored in the literature. Unfortunately, previous research has been devoted to locating entire products from scratch. Instead, this study intends to propose an adaptive approach, a Data Mining-based Storage Assignment approach (DMSA), to find the optimal storage assignment for newly delivered products that need to be put away when there is vacant shelf space in a distribution centre. In the DMSA, a new association index (AIX) is developed to evaluate the fitness between the put away products and the unassigned storage locations by applying association rule mining. With AIX, the storage location assignment problem (SLAP) can be formulated and solved as a binary integer programming. To evaluate the performance of DMSA, a real-world order database of a distribution centre is obtained and used to compare the results from DMSA with a random assignment approach. It turns out that DMSA outperforms random assignment as the number of put away products and the proportion of put away products with high turnover rates increase.

  13. Bacteria as bullies: effects of linguistic agency assignment in health message.

    Science.gov (United States)

    Bell, Robert A; McGlone, Matthew S; Dragojevic, Marko

    2014-01-01

    When describing health threats, communicators can assign agency to the threat (e.g., "Hepatitis C has infected 4 million Americans") or to humans (e.g., "Four million Americans have contracted hepatitis C"). In an online experiment, the authors explored how assignment of agency affects perceptions of susceptibility and severity of a health threat, response efficacy, self-efficacy, fear arousal, and intentions to adopt health-protective recommendations. Participants were 719 individuals recruited through Mechanical Turk ( www.mturk.com ), a crowdsource labor market run by Amazon ( www.amazon.com ). The participants were assigned randomly to read 1 of 8 flyers defined by a 2×4 (Agency Assignment×Topic) factorial design. Each flyer examined 1 health threat (E. coli, necrotizing fasciitis, salmonella, or Carbapenem-resistant Klebsiella pneumoniae) and was written in language that emphasized bacterial or human agency. Perceived susceptibility and severity were highest when bacterial agency language was used. Response efficacy, self-efficacy, and fear arousal were not significantly affected by agency assignment. Participants reported stronger intentions to adopt recommendations when bacteria agency language was used, but this effect did not reach conventional standards of significance (p < .051). The authors concluded that health communicators can increase target audiences' perceptions of susceptibility and severity by assigning agency to the threat in question when devising health messages.

  14. Automation of block assignment planning using a diagram-based scenario modeling method

    Science.gov (United States)

    Hwang, In Hyuck; Kim, Youngmin; Lee, Dong Kun; Shin, Jong Gye

    2014-03-01

    Most shipbuilding scheduling research so far has focused on the load level on the dock plan. This is be¬cause the dock is the least extendable resource in shipyards, and its overloading is difficult to resolve. However, once dock scheduling is completed, making a plan that makes the best use of the rest of the resources in the shipyard to minimize any additional cost is also important. Block assignment planning is one of the midterm planning tasks; it assigns a block to the facility (factory/shop or surface plate) that will actually manufacture the block according to the block characteristics and current situation of the facility. It is one of the most heavily loaded midterm planning tasks and is carried out manu¬ally by experienced workers. In this study, a method of representing the block assignment rules using a diagram was su¬ggested through analysis of the existing manual process. A block allocation program was developed which automated the block assignment process according to the rules represented by the diagram. The planning scenario was validated through a case study that compared the manual assignment and two automated block assignment results.

  15. Stereospecific assignments of glycine in proteins by stereospecific deuteration and {sup 15}N labeling

    Energy Technology Data Exchange (ETDEWEB)

    Hansen, A.P.; Curley, R.W. Jr.; Panigot, M.J.; Fesik, S.W. [Ohio State Univ., Columbus, OH (United States)

    1994-12-01

    Stereospecific assignments are important for accurately determining the three-dimensional structures of proteins through the use of multidimensional NMR techniques. It is especially important to stereospecifically assign the glycine {alpha}-protons in proteins because of the potential for different backbone conformations of this residue. These stereospecific assignments are critical for interpreting the {sup 3}J{sub NH,{alpha}H} coupling constants and NOEs involving the glycine {alpha}-protons that determine the conformation of this part of the protein. However, it is often difficult to unambiguously obtain the stereospecific assignments for glycine residues by using only NOE data. In this poster, we present a method for unambiguous, stereospecific assignment of the {alpha}-protons of glycine residues. This method involves synthesis of stereo-specifically deuterated and {sup 15}N-labeled Gly using a slightly modified procedure originally described by Woodard and coworkers for the stereoselective deuteration of glycine. The stereospecifically deuterated and {sup 15}N-labeled Gy has been incorporated into recombinant proteins expressed in both bacterial systems (FKBP) and mammalian cells (u-PA). Two- and three-dimensional isotope-filtered and isotope-edited NMR experiments were used to obtain the stereospecific assignments of the glycine {alpha}-protons for these proteins.

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

    Science.gov (United States)

    Li, Zhao; Lam, James

    2016-09-01

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

  17. Design of Constant Gain Dissipative Controllers for Eigensystem Assignment in Passive Systems

    Science.gov (United States)

    Maghami, Peiman G.; Gupta, Sandeep

    1998-01-01

    Partial eigensystem assignment with output feedback can lead to an unstable closed-loop system. However, output feedback with passive linear time-invariant systems, such as flexible space structures, is guaranteed to be stable if the controller is dissipative. This paper presents a novel approach for synthesis of dissipative output feedback gain matrices for assigning a selected number of closed-loop poles. Dissipativity of a gain matrix is known to be equivalent to positive semidefiniteness of the symmetric part of the matrix. A sequential procedure is presented to assign one self-conjugate pair of closed-loop eigenvalues at each step using dissipative output feedback gain matrices, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The problem of assigning one closed-loop pair is reduced to a constrained solution of a system of quadratic equations, and necessary and sufficient conditions for the existence of a solution are presented. A minimax approach is presented for determining parameters which satisfy these conditions. This method can assign as many closed-loop system poles as the number of control inputs. A numerical example of damping enhancement for a flexible structure is presented to demonstrate the approach.

  18. Automation of block assignment planning using a diagram-based scenario modeling method

    Directory of Open Access Journals (Sweden)

    Hwang In Hyuck

    2014-03-01

    Full Text Available Most shipbuilding scheduling research so far has focused on the load level on the dock plan. This is be¬cause the dock is the least extendable resource in shipyards, and its overloading is difficult to resolve. However, once dock scheduling is completed, making a plan that makes the best use of the rest of the resources in the shipyard to minimize any additional cost is also important. Block assignment planning is one of the midterm planning tasks; it assigns a block to the facility (factory/shop or surface plate that will actually manufacture the block according to the block characteristics and current situation of the facility. It is one of the most heavily loaded midterm planning tasks and is carried out manu¬ally by experienced workers. In this study, a method of representing the block assignment rules using a diagram was su¬ggested through analysis of the existing manual process. A block allocation program was developed which automated the block assignment process according to the rules represented by the diagram. The planning scenario was validated through a case study that compared the manual assignment and two automated block assignment results.

  19. A code reviewer assignment model incorporating the competence differences and participant preferences

    Directory of Open Access Journals (Sweden)

    Wang Yanqing

    2016-03-01

    Full Text Available A good assignment of code reviewers can effectively utilize the intellectual resources, assure code quality and improve programmers’ skills in software development. However, little research on reviewer assignment of code review has been found. In this study, a code reviewer assignment model is created based on participants’ preference to reviewing assignment. With a constraint of the smallest size of a review group, the model is optimized to maximize review outcomes and avoid the negative impact of “mutual admiration society”. This study shows that the reviewer assignment strategies incorporating either the reviewers’ preferences or the authors’ preferences get much improvement than a random assignment. The strategy incorporating authors’ preference makes higher improvement than that incorporating reviewers’ preference. However, when the reviewers’ and authors’ preference matrixes are merged, the improvement becomes moderate. The study indicates that the majority of the participants have a strong wish to work with reviewers and authors having highest competence. If we want to satisfy the preference of both reviewers and authors at the same time, the overall improvement of learning outcomes may be not the best.

  20. Targeting Type 2: Linguistic Agency Assignment in Diabetes Prevention Policy Messaging.

    Science.gov (United States)

    Glowacki, Elizabeth M; McGlone, Matthew S; Bell, Robert A

    2016-01-01

    We explored the effects of linguistic agency assignment on the persuasive impact of a fictitious medical journal editorial about Type 2 diabetes. Participants (N = 422) read 1 of 4 versions of an editorial that differed in the language used to describe the health threat posed by the disease (threat agency) and to outline a program for preventing it (prevention agency). Threat agency was assigned either to the disease (e.g., diabetes puts individuals' lives at risk) or to humans (e.g., individuals who acquire diabetes put their lives at risk). Prevention agency was assigned either to the recommended prevention behaviors (e.g., a healthy diet and regular exercise protect children from Type 2) or to humans (e.g., children who eat a healthy diet and exercise regularly protect themselves from Type 2). Respondents' perceptions of disease severity were higher when threat agency was assigned to diabetes rather than humans. However, attitudes toward the proposed prevention program were higher when prevention agency was assigned to humans rather than to the recommended behaviors. The latter finding contrasts with agency effects observed in previous research on a viral threat, suggesting that the optimal pattern of agency assignment in prevention messaging may be different for acute and chronic lifestyle diseases.