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

PubMed

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

2015-10-23

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

Problem-Based Assignments as a Trigger for Developing Ethical and Reflective Competencies

ERIC Educational Resources Information Center

Euler, Dieter; Kühner, Patrizia

2017-01-01

The following research question serves as the starting point of this research and development project: How, in the context of a didactic design, can problem-based assignments trigger learning activities for the development of ethical and reflective competencies in students in economics courses? This paper focuses on the design of problem-based…

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

PubMed Central

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

2015-01-01

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

Solving the Credit Assignment Problem With the Prefrontal Cortex

PubMed Central

Stolyarova, Alexandra

2018-01-01

In naturalistic multi-cue and multi-step learning tasks, where outcomes of behavior are delayed in time, discovering which choices are responsible for rewards can present a challenge, known as the credit assignment problem. In this review, I summarize recent work that highlighted a critical role for the prefrontal cortex (PFC) in assigning credit where it is due in tasks where only a few of the multitude of cues or choices are relevant to the final outcome of behavior. Collectively, these investigations have provided compelling support for specialized roles of the orbitofrontal (OFC), anterior cingulate (ACC), and dorsolateral prefrontal (dlPFC) cortices in contingent learning. However, recent work has similarly revealed shared contributions and emphasized rich and heterogeneous response properties of neurons in these brain regions. Such functional overlap is not surprising given the complexity of reciprocal projections spanning the PFC. In the concluding section, I overview the evidence suggesting that the OFC, ACC and dlPFC communicate extensively, sharing the information about presented options, executed decisions and received rewards, which enables them to assign credit for outcomes to choices on which they are contingent. This account suggests that lesion or inactivation/inhibition experiments targeting a localized PFC subregion will be insufficient to gain a fine-grained understanding of credit assignment during learning and instead poses refined questions for future research, shifting the focus from focal manipulations to experimental techniques targeting cortico-cortical projections. PMID:29636659

Knowledge-based design of generate-and-patch problem solvers that solve global resource assignment problems

NASA Technical Reports Server (NTRS)

Voigt, Kerstin

1992-01-01

We present MENDER, a knowledge based system that implements software design techniques that are specialized to automatically compile generate-and-patch problem solvers that satisfy global resource assignments problems. We provide empirical evidence of the superior performance of generate-and-patch over generate-and-test: even with constrained generation, for a global constraint in the domain of '2D-floorplanning'. For a second constraint in '2D-floorplanning' we show that even when it is possible to incorporate the constraint into a constrained generator, a generate-and-patch problem solver may satisfy the constraint more rapidly. We also briefly summarize how an extended version of our system applies to a constraint in the domain of 'multiprocessor scheduling'.

Process-based Assignment-Setting Change for Support of Overcoming Bottlenecks in Learning by Problem-Posing in Arithmetic Word Problems

NASA Astrophysics Data System (ADS)

Supianto, A. A.; Hayashi, Y.; Hirashima, T.

2017-02-01

Problem-posing is well known as an effective activity to learn problem-solving methods. Monsakun is an interactive problem-posing learning environment to facilitate arithmetic word problems learning for one operation of addition and subtraction. The characteristic of Monsakun is problem-posing as sentence-integration that lets learners make a problem of three sentences. Monsakun provides learners with five or six sentences including dummies, which are designed through careful considerations by an expert teacher as a meaningful distraction to the learners in order to learn the structure of arithmetic word problems. The results of the practical use of Monsakun in elementary schools show that many learners have difficulties in arranging the proper answer at the high level of assignments. The analysis of the problem-posing process of such learners found that their misconception of arithmetic word problems causes impasses in their thinking and mislead them to use dummies. This study proposes a method of changing assignments as a support for overcoming bottlenecks of thinking. In Monsakun, the bottlenecks are often detected as a frequently repeated use of a specific dummy. If such dummy can be detected, it is the key factor to support learners to overcome their difficulty. This paper discusses how to detect the bottlenecks and to realize such support in learning by problem-posing.

Optimizing a realistic large-scale frequency assignment problem using a new parallel evolutionary approach

NASA Astrophysics Data System (ADS)

Chaves-González, José M.; Vega-Rodríguez, Miguel A.; Gómez-Pulido, Juan A.; Sánchez-Pérez, Juan M.

2011-08-01

This article analyses the use of a novel parallel evolutionary strategy to solve complex optimization problems. The work developed here has been focused on a relevant real-world problem from the telecommunication domain to verify the effectiveness of the approach. The problem, known as frequency assignment problem (FAP), basically consists of assigning a very small number of frequencies to a very large set of transceivers used in a cellular phone network. Real data FAP instances are very difficult to solve due to the NP-hard nature of the problem, therefore using an efficient parallel approach which makes the most of different evolutionary strategies can be considered as a good way to obtain high-quality solutions in short periods of time. Specifically, a parallel hyper-heuristic based on several meta-heuristics has been developed. After a complete experimental evaluation, results prove that the proposed approach obtains very high-quality solutions for the FAP and beats any other result published.

Some insights on hard quadratic assignment problem instances

NASA Astrophysics Data System (ADS)

Hussin, Mohamed Saifullah

2017-11-01

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

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

PubMed Central

Qualls, Joseph; Russomanno, David J.

2011-01-01

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

Solution of the determinantal assignment problem using the Grassmann matrices

NASA Astrophysics Data System (ADS)

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.

Principles for problem aggregation and assignment in medium scale multiprocessors

NASA Technical Reports Server (NTRS)

Nicol, David M.; Saltz, Joel H.

1987-01-01

One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior.

PROBABILISTIC CROSS-IDENTIFICATION IN CROWDED FIELDS AS AN ASSIGNMENT PROBLEM

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

Budavári, Tamás; Basu, Amitabh, E-mail: budavari@jhu.edu, E-mail: basu.amitabh@jhu.edu

2016-10-01

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

Probabilistic Cross-identification in Crowded Fields as an Assignment Problem

NASA Astrophysics Data System (ADS)

Budavári, Tamás; Basu, Amitabh

2016-10-01

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

Automated bond order assignment as an optimization problem.

PubMed

Dehof, Anna Katharina; Rurainski, Alexander; Bui, Quang Bao Anh; Böcker, Sebastian; Lenhof, Hans-Peter; Hildebrandt, Andreas

2011-03-01

Numerous applications in Computational Biology process molecular structures and hence strongly rely not only on correct atomic coordinates but also on correct bond order information. For proteins and nucleic acids, bond orders can be easily deduced but this does not hold for other types of molecules like ligands. For ligands, bond order information is not always provided in molecular databases and thus a variety of approaches tackling this problem have been developed. In this work, we extend an ansatz proposed by Wang et al. that assigns connectivity-based penalty scores and tries to heuristically approximate its optimum. In this work, we present three efficient and exact solvers for the problem replacing the heuristic approximation scheme of the original approach: an A*, an ILP and an fixed-parameter approach (FPT) approach. We implemented and evaluated the original implementation, our A*, ILP and FPT formulation on the MMFF94 validation suite and the KEGG Drug database. We show the benefit of computing exact solutions of the penalty minimization problem and the additional gain when computing all optimal (or even suboptimal) solutions. We close with a detailed comparison of our methods. The A* and ILP solution are integrated into the open-source C++ LGPL library BALL and the molecular visualization and modelling tool BALLView and can be downloaded from our homepage www.ball-project.org. The FPT implementation can be downloaded from http://bio.informatik.uni-jena.de/software/.

The solution of target assignment problem in command and control decision-making behaviour simulation

NASA Astrophysics Data System (ADS)

Li, Ni; Huai, Wenqing; Wang, Shaodan

2017-08-01

C2 (command and control) has been understood to be a critical military component to meet an increasing demand for rapid information gathering and real-time decision-making in a dynamically changing battlefield environment. In this article, to improve a C2 behaviour model's reusability and interoperability, a behaviour modelling framework was proposed to specify a C2 model's internal modules and a set of interoperability interfaces based on the C-BML (coalition battle management language). WTA (weapon target assignment) is a typical C2 autonomous decision-making behaviour modelling problem. Different from most WTA problem descriptions, here sensors were considered to be available resources of detection and the relationship constraints between weapons and sensors were also taken into account, which brought it much closer to actual application. A modified differential evolution (MDE) algorithm was developed to solve this high-dimension optimisation problem and obtained an optimal assignment plan with high efficiency. In case study, we built a simulation system to validate the proposed C2 modelling framework and interoperability interface specification. Also, a new optimisation solution was used to solve the WTA problem efficiently and successfully.

Planning Nurses in Maternity Care: a Stochastic Assignment Problem

NASA Astrophysics Data System (ADS)

Phillipson, Frank

2015-05-01

With 23 percent of all births taking place at home, The Netherlands have the highest rate of home births in the world. Also if the birth did not take place at home, it is not unusual for the mother and child to be out of hospital in a few hours after the baby was born. The explanation for both is the very well organised maternity care system. However, getting the right maternity care nurse available on time introduces a complex planning issue that can be recognized as a Stochastic Assignment Problem. In this paper an expert rule based approach is combined with scenario analysis to support the planner of the maternity care agency in his work.

Comparing Looping Teacher-Assigned and Traditional Teacher-Assigned Student Achievement Scores

ERIC Educational Resources Information Center

Lloyd, Melissa C.

2014-01-01

A problem in many elementary schools is determining which teacher assignment strategy best promotes the academic progress of students. To find and implement educational practices that address the academic needs of all learners, schools need research-based data focusing on the 2 teacher assignment strategies: looping assignment (LA) and traditional…

High-grading bias: subtle problems with assessing power of selected subsets of loci for population assignment.

PubMed

Waples, Robin S

2010-07-01

Recognition of the importance of cross-validation ('any technique or instance of assessing how the results of a statistical analysis will generalize to an independent dataset'; Wiktionary, en.wiktionary.org) is one reason that the U.S. Securities and Exchange Commission requires all investment products to carry some variation of the disclaimer, 'Past performance is no guarantee of future results.' Even a cursory examination of financial behaviour, however, demonstrates that this warning is regularly ignored, even by those who understand what an independent dataset is. In the natural sciences, an analogue to predicting future returns for an investment strategy is predicting power of a particular algorithm to perform with new data. Once again, the key to developing an unbiased assessment of future performance is through testing with independent data--that is, data that were in no way involved in developing the method in the first place. A 'gold-standard' approach to cross-validation is to divide the data into two parts, one used to develop the algorithm, the other used to test its performance. Because this approach substantially reduces the sample size that can be used in constructing the algorithm, researchers often try other variations of cross-validation to accomplish the same ends. As illustrated by Anderson in this issue of Molecular Ecology Resources, however, not all attempts at cross-validation produce the desired result. Anderson used simulated data to evaluate performance of several software programs designed to identify subsets of loci that can be effective for assigning individuals to population of origin based on multilocus genetic data. Such programs are likely to become increasingly popular as researchers seek ways to streamline routine analyses by focusing on small sets of loci that contain most of the desired signal. Anderson found that although some of the programs made an attempt at cross-validation, all failed to meet the 'gold standard' of using

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

NASA Astrophysics Data System (ADS)

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

2009-09-01

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

Optimal processor assignment for pipeline computations

NASA Technical Reports Server (NTRS)

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

1991-01-01

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

Space Power Engineering Problems

NASA Astrophysics Data System (ADS)

Senkevich, V. P.

2002-01-01

Development of space power engineering in the first half of XXI century shall be aimed at preventing the forthcoming energy crisis and ecological catastrophes. The problem can be solved through using solar energy being perpetual, endless, and ecologically safe. As of now, issues on the development and employment of solar power stations and its beaming to the ground stations in the SHF band are put on the agenda. The most pressing problem is to develop orbital solar reflectors to illuminate towns in the polar regions, agricultural regions, and areas of processing sea products. Space-based technologies can be used to deal with typhoons, green house effects, and "ozone holes". Recently, large, frameless film structures formed by centrifugal forces offer the promise of structures for orbital power plants, reflectors, and solar sails. A big success is achieved in the development of power generating solar array elements of amorphous silicon. These innovations would make the development of orbital solar power plants dozens of times cheaper. Such solar arrays shall be used in the nearest future on heavy communication satellites and the Earth remote sensing platforms for generation of 140-160 kW at a specific power beyond 300 W/kg. The cargo traffic needed to develop and maintain the orbital power plants and reflector systems could be equipped with solar sails as the future low thrust propulsion. In 2000, the mankind witnessed an unexpected beginning of energy crisis along with strong hydro- meteorological events (typhoons, floods) that shocked the USA, the Western Europe, England, Japan, and other countries. The total damage is estimated as 90 billions of dollars. The mankind is approaching a boundary beyond which its further existence would depend on how people would learn to control weather and use ecologically safe power sources. Space technology base on the research potential accumulated in the previous century could serve for the solution of this problem.

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

..., AUXILIARY, SPECIAL BROADCAST AND OTHER PROGRAM DISTRIBUTIONAL SERVICES Low Power TV, TV Translator, and TV Booster Stations § 74.702 Channel assignments. (a) An applicant for a new low power TV or TV translator... standard VHF Channels (2 to 13 inclusive) may be assigned to a VHF low power TV or TV translator station...

An up-link power control for demand assignment International Business Satellite Communications Network

NASA Astrophysics Data System (ADS)

Nohara, Mitsuo; Takeuchi, Yoshio; Takahata, Fumio

Up-link power control (UPC) is one of the essential technologies to provide efficient satellite communication systems operated at frequency bands above 10 GHz. A simple and cost-effective UPC scheme applicable to a demand assignment international business satellite communications system has been developed. This paper presents the UPC scheme, including the hardware implementation and its performance.

Computer Power. Part 2: Electrical Power Problems and Their Amelioration.

ERIC Educational Resources Information Center

Price, Bennett J.

1989-01-01

Describes electrical power problems that affect computer users, including spikes, sags, outages, noise, frequency variations, and static electricity. Ways in which these problems may be diagnosed and cured are discussed. Sidebars consider transformers; power distribution units; surge currents/linear and non-linear loads; and sizing the power…

Using sound to solve syntactic problems: the role of phonology in grammatical category assignments.

PubMed

Kelly, M H

1992-04-01

One ubiquitous problem in language processing involves the assignment of words to the correct grammatical category, such as noun or verb. In general, semantic and syntactic cues have been cited as the principal information for grammatical category assignment, to the neglect of possible phonological cues. This neglect is unwarranted, and the following claims are made: (a) Numerous correlations between phonology and grammatical class exist, (b) some of these correlations are large and can pervade the entire lexicon of a language and hence can involve thousands of words, (c) experiments have repeatedly found that adults and children have learned these correlations, and (d) explanations for how these correlations arose can be proposed and evaluated. Implications of these phenomena for language representation and processing are discussed.

Neural-network dedicated processor for solving competitive assignment problems

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P. (Inventor)

1993-01-01

A neural-network processor for solving first-order competitive assignment problems consists of a matrix of N x M processing units, each of which corresponds to the pairing of a first number of elements of (R sub i) with a second number of elements (C sub j), wherein limits of the first number are programmed in row control superneurons, and limits of the second number are programmed in column superneurons as MIN and MAX values. The cost (weight) W sub ij of the pairings is programmed separately into each PU. For each row and column of PU's, a dedicated constraint superneuron insures that the number of active neurons within the associated row or column fall within a specified range. Annealing is provided by gradually increasing the PU gain for each row and column or increasing positive feedback to each PU, the latter being effective to increase hysteresis of each PU or by combining both of these techniques.

Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)

NASA Astrophysics Data System (ADS)

Ramdhani, M. N.; Baihaqi, I.; Siswanto, N.

2018-04-01

Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle’s assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter’s has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result’s model has the maximum of two journeys for each route.

On the problem of resonance assignments in solid state NMR of uniformly 15N, 13C-labeled proteins

NASA Astrophysics Data System (ADS)

Tycko, Robert

2015-04-01

Determination of accurate resonance assignments from multidimensional chemical shift correlation spectra is one of the major problems in biomolecular solid state NMR, particularly for relative large proteins with less-than-ideal NMR linewidths. This article investigates the difficulty of resonance assignment, using a computational Monte Carlo/simulated annealing (MCSA) algorithm to search for assignments from artificial three-dimensional spectra that are constructed from the reported isotropic 15N and 13C chemical shifts of two proteins whose structures have been determined by solution NMR methods. The results demonstrate how assignment simulations can provide new insights into factors that affect the assignment process, which can then help guide the design of experimental strategies. Specifically, simulations are performed for the catalytic domain of SrtC (147 residues, primarily β-sheet secondary structure) and the N-terminal domain of MLKL (166 residues, primarily α-helical secondary structure). Assuming unambiguous residue-type assignments and four ideal three-dimensional data sets (NCACX, NCOCX, CONCA, and CANCA), uncertainties in chemical shifts must be less than 0.4 ppm for assignments for SrtC to be unique, and less than 0.2 ppm for MLKL. Eliminating CANCA data has no significant effect, but additionally eliminating CONCA data leads to more stringent requirements for chemical shift precision. Introducing moderate ambiguities in residue-type assignments does not have a significant effect.

47 CFR 74.786 - Digital channel assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Translator, and TV Booster Stations § 74.786 Digital channel assignments. (a) An applicant for a new low power television or television translator digital station or for changes in the facilities of an... VHF digital low power television or television translator station. Channels 5 and 6 assigned in Alaska...

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

ERIC Educational Resources Information Center

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…

Using the Same Problem with Different Techniques in Programming Assignments: An Empirical Study of Its Effectiveness

ERIC Educational Resources Information Center

Newby, Michael; Nguyen, ThuyUyen H.

2010-01-01

This paper examines the effectiveness of a technique that first appeared as a Teaching Tip in the Journal of Information Systems Education. In this approach the same problem is used in every programming assignment within a course, but the students are required to use different programming techniques. This approach was used in an intermediate C++…

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

NASA Astrophysics Data System (ADS)

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

2011-11-01

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

47 CFR 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

Code of Federal Regulations, 2010 CFR

2010-10-01

...-470 MHz band for low power use. 90.267 Section 90.267 Telecommunication FEDERAL COMMUNICATIONS... Special Frequencies or Frequency Bands § 90.267 Assignment and use of frequencies in the 450-470 MHz band... medical radio telemetry device with an output power not to exceed 20 milliwatts without specific...

A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems.

PubMed

Horio, Yoshihiko; Ikeguchi, Tohru; Aihara, Kazuyuki

2005-01-01

We construct a mixed analog/digital chaotic neuro-computer prototype system for quadratic assignment problems (QAPs). The QAP is one of the difficult NP-hard problems, and includes several real-world applications. Chaotic neural networks have been used to solve combinatorial optimization problems through chaotic search dynamics, which efficiently searches optimal or near optimal solutions. However, preliminary experiments have shown that, although it obtained good feasible solutions, the Hopfield-type chaotic neuro-computer hardware system could not obtain the optimal solution of the QAP. Therefore, in the present study, we improve the system performance by adopting a solution construction method, which constructs a feasible solution using the analog internal state values of the chaotic neurons at each iteration. In order to include the construction method into our hardware, we install a multi-channel analog-to-digital conversion system to observe the internal states of the chaotic neurons. We show experimentally that a great improvement in the system performance over the original Hopfield-type chaotic neuro-computer is obtained. That is, we obtain the optimal solution for the size-10 QAP in less than 1000 iterations. In addition, we propose a guideline for parameter tuning of the chaotic neuro-computer system according to the observation of the internal states of several chaotic neurons in the network.

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

PubMed Central

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

2016-01-01

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

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

PubMed

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

2016-01-01

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

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

PubMed Central

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

2011-01-01

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

Imprint of DESI fiber assignment on the anisotropic power spectrum of emission line galaxies

NASA Astrophysics Data System (ADS)

Pinol, Lucas; Cahn, Robert N.; Hand, Nick; Seljak, Uroš; White, Martin

2017-04-01

The Dark Energy Spectroscopic Instrument (DESI), a multiplexed fiber-fed spectrograph, is a Stage-IV ground-based dark energy experiment aiming to measure redshifts for 29 million Emission-Line Galaxies (ELG), 4 million Luminous Red Galaxies (LRG), and 2 million Quasi-Stellar Objects (QSO). The survey design includes a pattern of tiling on the sky, the locations of the fiber positioners in the focal plane of the telescope, and an observation strategy determined by a fiber assignment algorithm that optimizes the allocation of fibers to targets. This strategy allows a given region to be covered on average five times for a five-year survey, with a typical variation of about 1.5 about the mean, which imprints a spatially-dependent pattern on the galaxy clustering. We investigate the systematic effects of the fiber assignment coverage on the anisotropic galaxy clustering of ELGs and show that, in the absence of any corrections, it leads to discrepancies of order ten percent on large scales for the power spectrum multipoles. We introduce a method where objects in a random catalog are assigned a coverage, and the mean density is separately computed for each coverage factor. We show that this method reduces, but does not eliminate the effect. We next investigate the angular dependence of the contaminated signal, arguing that it is mostly localized to purely transverse modes. We demonstrate that the cleanest way to remove the contaminating signal is to perform an analysis of the anisotropic power spectrum P(k,μ) and remove the lowest μ bin, leaving μ > 0 modes accurate at the few-percent level. Here, μ is the cosine of the angle between the line-of-sight and the direction of vec k. We also investigate two alternative definitions of the random catalog and show that they are comparable but less effective than the coverage randoms method.

NEPA assignment training PowerPoints and quizzes.

DOT National Transportation Integrated Search

2016-10-01

The objective of these training materials is to provide National Environmental : Policy Act (NEPA) Assignment information to all professionals involved in the NEPA : process. This training is not intended to be a replication of existing NEPA training...

White Matter Tract Segmentation as Multiple Linear Assignment Problems

PubMed Central

Sharmin, Nusrat; Olivetti, Emanuele; Avesani, Paolo

2018-01-01

Diffusion magnetic resonance imaging (dMRI) allows to reconstruct the main pathways of axons within the white matter of the brain as a set of polylines, called streamlines. The set of streamlines of the whole brain is called the tractogram. Organizing tractograms into anatomically meaningful structures, called tracts, is known as the tract segmentation problem, with important applications to neurosurgical planning and tractometry. Automatic tract segmentation techniques can be unsupervised or supervised. A common criticism of unsupervised methods, like clustering, is that there is no guarantee to obtain anatomically meaningful tracts. In this work, we focus on supervised tract segmentation, which is driven by prior knowledge from anatomical atlases or from examples, i.e., segmented tracts from different subjects. We present a supervised tract segmentation method that segments a given tract of interest in the tractogram of a new subject using multiple examples as prior information. Our proposed tract segmentation method is based on the idea of streamline correspondence i.e., on finding corresponding streamlines across different tractograms. In the literature, streamline correspondence has been addressed with the nearest neighbor (NN) strategy. Differently, here we formulate the problem of streamline correspondence as a linear assignment problem (LAP), which is a cornerstone of combinatorial optimization. With respect to the NN, the LAP introduces a constraint of one-to-one correspondence between streamlines, that forces the correspondences to follow the local anatomical differences between the example and the target tract, neglected by the NN. In the proposed solution, we combined the Jonker-Volgenant algorithm (LAPJV) for solving the LAP together with an efficient way of computing the nearest neighbors of a streamline, which massively reduces the total amount of computations needed to segment a tract. Moreover, we propose a ranking strategy to merge correspondences

White Matter Tract Segmentation as Multiple Linear Assignment Problems.

PubMed

Sharmin, Nusrat; Olivetti, Emanuele; Avesani, Paolo

2017-01-01

Diffusion magnetic resonance imaging (dMRI) allows to reconstruct the main pathways of axons within the white matter of the brain as a set of polylines, called streamlines. The set of streamlines of the whole brain is called the tractogram. Organizing tractograms into anatomically meaningful structures, called tracts, is known as the tract segmentation problem, with important applications to neurosurgical planning and tractometry. Automatic tract segmentation techniques can be unsupervised or supervised. A common criticism of unsupervised methods, like clustering, is that there is no guarantee to obtain anatomically meaningful tracts. In this work, we focus on supervised tract segmentation, which is driven by prior knowledge from anatomical atlases or from examples, i.e., segmented tracts from different subjects. We present a supervised tract segmentation method that segments a given tract of interest in the tractogram of a new subject using multiple examples as prior information. Our proposed tract segmentation method is based on the idea of streamline correspondence i.e., on finding corresponding streamlines across different tractograms. In the literature, streamline correspondence has been addressed with the nearest neighbor (NN) strategy. Differently, here we formulate the problem of streamline correspondence as a linear assignment problem (LAP), which is a cornerstone of combinatorial optimization. With respect to the NN, the LAP introduces a constraint of one-to-one correspondence between streamlines, that forces the correspondences to follow the local anatomical differences between the example and the target tract, neglected by the NN. In the proposed solution, we combined the Jonker-Volgenant algorithm (LAPJV) for solving the LAP together with an efficient way of computing the nearest neighbors of a streamline, which massively reduces the total amount of computations needed to segment a tract. Moreover, we propose a ranking strategy to merge correspondences

A multi-period capacitated school location problem with modular equipment and closest assignment considerations

NASA Astrophysics Data System (ADS)

Delmelle, Eric M.; Thill, Jean-Claude; Peeters, Dominique; Thomas, Isabelle

2014-07-01

In rapidly growing urban areas, it is deemed vital to expand (or contract) an existing network of public facilities to meet anticipated changes in the level of demand. We present a multi-period capacitated median model for school network facility location planning that minimizes transportation costs, while functional costs are subject to a budget constraint. The proposed Vintage Flexible Capacitated Location Problem (ViFCLP) has the flexibility to account for a minimum school-age closing requirement, while the maximum capacity of each school can be adjusted by the addition of modular units. Non-closest assignments are controlled by the introduction of a parameter penalizing excess travel. The applicability of the ViFCLP is illustrated on a large US school system (Charlotte-Mecklenburg, North Carolina) where high school demand is expected to grow faster with distance to the city center. Higher school capacities and greater penalty on travel impedance parameter reduce the number of non-closest assignments. The proposed model is beneficial to policy makers seeking to improve the provision and efficiency of public services over a multi-period planning horizon.

Fair Package Assignment

NASA Astrophysics Data System (ADS)

Lahaie, Sébastien; Parkes, David C.

We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with quasi-linear utilities. A fair assignment is one that is efficient and envy-free. We consider a model where bidders have superadditive valuations, meaning that items are pure complements. Our central result is that core outcomes are fair and even coalition-fair over this domain, while fair distributions may not even exist for general valuations. Of relevance to auction design, we also establish that the core is equivalent to the set of anonymous-price competitive equilibria, and that superadditive valuations are a maximal domain that guarantees the existence of anonymous-price competitive equilibrium. Our results are analogs of core equivalence results for linear prices in the standard assignment model, and for nonlinear, non-anonymous prices in the package assignment model with general valuations.

A two-stage approach to the depot shunting driver assignment problem with workload balance considerations.

PubMed

Wang, Jiaxi; Gronalt, Manfred; Sun, Yan

2017-01-01

Due to its environmentally sustainable and energy-saving characteristics, railway transportation nowadays plays a fundamental role in delivering passengers and goods. Emerged in the area of transportation planning, the crew (workforce) sizing problem and the crew scheduling problem have been attached great importance by the railway industry and the scientific community. In this paper, we aim to solve the two problems by proposing a novel two-stage optimization approach in the context of the electric multiple units (EMU) depot shunting driver assignment problem. Given a predefined depot shunting schedule, the first stage of the approach focuses on determining an optimal size of shunting drivers. While the second stage is formulated as a bi-objective optimization model, in which we comprehensively consider the objectives of minimizing the total walking distance and maximizing the workload balance. Then we combine the normalized normal constraint method with a modified Pareto filter algorithm to obtain Pareto solutions for the bi-objective optimization problem. Furthermore, we conduct a series of numerical experiments to demonstrate the proposed approach. Based on the computational results, the regression analysis yield a driver size predictor and the sensitivity analysis give some interesting insights that are useful for decision makers.

The generalized pole assignment problem. [dynamic output feedback problems

NASA Technical Reports Server (NTRS)

Djaferis, T. E.; Mitter, S. K.

1979-01-01

Two dynamic output feedback problems for a linear, strictly proper system are considered, along with their interrelationships. The problems are formulated in the frequency domain and investigated in terms of linear equations over rings of polynomials. Necessary and sufficient conditions are expressed using genericity.

Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment

PubMed Central

Karimzadehgan, Maryam; Zhai, ChengXiang

2011-01-01

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

Fleet Assignment Using Collective Intelligence

NASA Technical Reports Server (NTRS)

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

2004-01-01

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

Towards Automated Structure-Based NMR Resonance Assignment

NASA Astrophysics Data System (ADS)

Jang, Richard; Gao, Xin; Li, Ming

We propose a general framework for solving the structure-based NMR backbone resonance assignment problem. The core is a novel 0-1 integer programming model that can start from a complete or partial assignment, generate multiple assignments, and model not only the assignment of spins to residues, but also pairwise dependencies consisting of pairs of spins to pairs of residues. It is still a challenge for automated resonance assignment systems to perform the assignment directly from spectra without any manual intervention. To test the feasibility of this for structure-based assignment, we integrated our system with our automated peak picking and sequence-based resonance assignment system to obtain an assignment for the protein TM1112 with 91% recall and 99% precision without manual intervention. Since using a known structure has the potential to allow one to use only N-labeled NMR data and avoid the added expense of using C-labeled data, we work towards the goal of automated structure-based assignment using only such labeled data. Our system reduced the assignment error of Xiong-Pandurangan-Bailey-Kellogg's contact replacement (CR) method, which to our knowledge is the most error-tolerant method for this problem, by 5 folds on average. By using an iterative algorithm, our system has the added capability of using the NOESY data to correct assignment errors due to errors in predicting the amino acid and secondary structure type of each spin system. On a publicly available data set for Ubiquitin, where the type prediction accuracy is 83%, we achieved 91% assignment accuracy, compared to the 59% accuracy that was obtained without correcting for typing errors.

Imprint of DESI fiber assignment on the anisotropic power spectrum of emission line galaxies

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

Pinol, Lucas; Cahn, Robert N.; Hand, Nick

The Dark Energy Spectroscopic Instrument (DESI), a multiplexed fiber-fed spectrograph, is a Stage-IV ground-based dark energy experiment aiming to measure redshifts for 29 million Emission-Line Galaxies (ELG), 4 million Luminous Red Galaxies (LRG), and 2 million Quasi-Stellar Objects (QSO). The survey design includes a pattern of tiling on the sky, the locations of the fiber positioners in the focal plane of the telescope, and an observation strategy determined by a fiber assignment algorithm that optimizes the allocation of fibers to targets. This strategy allows a given region to be covered on average five times for a five-year survey, with amore » typical variation of about 1.5 about the mean, which imprints a spatially-dependent pattern on the galaxy clustering. We investigate the systematic effects of the fiber assignment coverage on the anisotropic galaxy clustering of ELGs and show that, in the absence of any corrections, it leads to discrepancies of order ten percent on large scales for the power spectrum multipoles. We introduce a method where objects in a random catalog are assigned a coverage, and the mean density is separately computed for each coverage factor. We show that this method reduces, but does not eliminate the effect. We next investigate the angular dependence of the contaminated signal, arguing that it is mostly localized to purely transverse modes. We demonstrate that the cleanest way to remove the contaminating signal is to perform an analysis of the anisotropic power spectrum P ( k ,μ) and remove the lowest μ bin, leaving μ > 0 modes accurate at the few-percent level. Here, μ is the cosine of the angle between the line-of-sight and the direction of k-vector . We also investigate two alternative definitions of the random catalog and show that they are comparable but less effective than the coverage randoms method.« less

A two-stage approach to the depot shunting driver assignment problem with workload balance considerations

PubMed Central

Gronalt, Manfred; Sun, Yan

2017-01-01

Due to its environmentally sustainable and energy-saving characteristics, railway transportation nowadays plays a fundamental role in delivering passengers and goods. Emerged in the area of transportation planning, the crew (workforce) sizing problem and the crew scheduling problem have been attached great importance by the railway industry and the scientific community. In this paper, we aim to solve the two problems by proposing a novel two-stage optimization approach in the context of the electric multiple units (EMU) depot shunting driver assignment problem. Given a predefined depot shunting schedule, the first stage of the approach focuses on determining an optimal size of shunting drivers. While the second stage is formulated as a bi-objective optimization model, in which we comprehensively consider the objectives of minimizing the total walking distance and maximizing the workload balance. Then we combine the normalized normal constraint method with a modified Pareto filter algorithm to obtain Pareto solutions for the bi-objective optimization problem. Furthermore, we conduct a series of numerical experiments to demonstrate the proposed approach. Based on the computational results, the regression analysis yield a driver size predictor and the sensitivity analysis give some interesting insights that are useful for decision makers. PMID:28704489

Efficient Credit Assignment through Evaluation Function Decomposition

NASA Technical Reports Server (NTRS)

Agogino, Adrian; Turner, Kagan; Mikkulainen, Risto

2005-01-01

Evolutionary methods are powerful tools in discovering solutions for difficult continuous tasks. When such a solution is encoded over multiple genes, a genetic algorithm faces the difficult credit assignment problem of evaluating how a single gene in a chromosome contributes to the full solution. Typically a single evaluation function is used for the entire chromosome, implicitly giving each gene in the chromosome the same evaluation. This method is inefficient because a gene will get credit for the contribution of all the other genes as well. Accurately measuring the fitness of individual genes in such a large search space requires many trials. This paper instead proposes turning this single complex search problem into a multi-agent search problem, where each agent has the simpler task of discovering a suitable gene. Gene-specific evaluation functions can then be created that have better theoretical properties than a single evaluation function over all genes. This method is tested in the difficult double-pole balancing problem, showing that agents using gene-specific evaluation functions can create a successful control policy in 20 percent fewer trials than the best existing genetic algorithms. The method is extended to more distributed problems, achieving 95 percent performance gains over tradition methods in the multi-rover domain.

Fleet Assignment Using Collective Intelligence

NASA Technical Reports Server (NTRS)

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

2004-01-01

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

Computing Role Assignments of Proper Interval Graphs in Polynomial Time

NASA Astrophysics Data System (ADS)

Heggernes, Pinar; van't Hof, Pim; Paulusma, Daniël

A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The Role Assignment problem has as input a pair of graphs (G,R) and asks whether G has an R-role assignment. This problem is NP-complete already on input pairs (G,R) where R is a path on three vertices. So far, the only known non-trivial tractable case consists of input pairs (G,R) where G is a tree. We present a polynomial time algorithm that solves Role Assignment on all input pairs (G,R) where G is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is Graph Isomorphism-hard on chordal graphs, a superclass of proper interval graphs and trees.

Single machine scheduling with slack due dates assignment

NASA Astrophysics Data System (ADS)

Liu, Weiguo; Hu, Xiangpei; Wang, Xuyin

2017-04-01

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

Computing the Feasible Spaces of Optimal Power Flow Problems

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

Molzahn, Daniel K.

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE PAGES

Molzahn, Daniel K.

2017-03-15

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2012 CFR

2012-10-01

..., all motions, requests and documents shall be addressed to that law judge. The authority of the... filed, the Board will, on motion of a party, determine whether the law judge should have withdrawn and... SAFETY BOARD RULES OF PRACTICE IN AIR SAFETY PROCEEDINGS Law Judges § 821.35 Assignment, duties and...

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2011 CFR

2011-10-01

..., all motions, requests and documents shall be addressed to that law judge. The authority of the... filed, the Board will, on motion of a party, determine whether the law judge should have withdrawn and... SAFETY BOARD RULES OF PRACTICE IN AIR SAFETY PROCEEDINGS Law Judges § 821.35 Assignment, duties and...

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2014 CFR

2014-10-01

..., all motions, requests and documents shall be addressed to that law judge. The authority of the... initial decision is filed, the Board will, on motion of a party, determine whether the law judge should... SAFETY BOARD RULES OF PRACTICE IN AIR SAFETY PROCEEDINGS Law Judges § 821.35 Assignment, duties and...

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2010 CFR

2010-10-01

..., all motions, requests and documents shall be addressed to that law judge. The authority of the... filed, the Board will, on motion of a party, determine whether the law judge should have withdrawn and... SAFETY BOARD RULES OF PRACTICE IN AIR SAFETY PROCEEDINGS Law Judges § 821.35 Assignment, duties and...

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2013 CFR

2013-10-01

..., all motions, requests and documents shall be addressed to that law judge. The authority of the... initial decision is filed, the Board will, on motion of a party, determine whether the law judge should... SAFETY BOARD RULES OF PRACTICE IN AIR SAFETY PROCEEDINGS Law Judges § 821.35 Assignment, duties and...

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

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

Dall-Anese, Emiliano; Zhao, Changhong; Zamzam, Admed S.

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successivemore » convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.« less

Evaluation of assigned-value uncertainty for complex calibrator value assignment processes: a prealbumin example.

PubMed

Middleton, John; Vaks, Jeffrey E

2007-04-01

Errors of calibrator-assigned values lead to errors in the testing of patient samples. The ability to estimate the uncertainties of calibrator-assigned values and other variables minimizes errors in testing processes. International Organization of Standardization guidelines provide simple equations for the estimation of calibrator uncertainty with simple value-assignment processes, but other methods are needed to estimate uncertainty in complex processes. We estimated the assigned-value uncertainty with a Monte Carlo computer simulation of a complex value-assignment process, based on a formalized description of the process, with measurement parameters estimated experimentally. This method was applied to study uncertainty of a multilevel calibrator value assignment for a prealbumin immunoassay. The simulation results showed that the component of the uncertainty added by the process of value transfer from the reference material CRM470 to the calibrator is smaller than that of the reference material itself (<0.8% vs 3.7%). Varying the process parameters in the simulation model allowed for optimizing the process, while keeping the added uncertainty small. The patient result uncertainty caused by the calibrator uncertainty was also found to be small. This method of estimating uncertainty is a powerful tool that allows for estimation of calibrator uncertainty for optimization of various value assignment processes, with a reduced number of measurements and reagent costs, while satisfying the requirements to uncertainty. The new method expands and augments existing methods to allow estimation of uncertainty in complex processes.

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

PubMed

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

2005-03-01

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

A new approach on auxiliary vehicle assignment in capacitated location routing problem

NASA Astrophysics Data System (ADS)

Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan

2016-03-01

The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.

Game theory and traffic assignment.

DOT National Transportation Integrated Search

2013-09-01

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

Neural Mechanisms of Credit Assignment in a Multicue Environment

PubMed Central

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

2016-01-01

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

Projected power iteration for network alignment

NASA Astrophysics Data System (ADS)

Onaran, Efe; Villar, Soledad

2017-08-01

The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein interactions) and it is very closely related to the quadratic assignment problem which has graph isomorphism, traveling salesman and minimum bisection problems as particular cases. The graph matching problem is NP-hard in general. However, under some restrictive models for the graphs, algorithms can approximate the alignment efficiently. In that spirit the recent work by Feizi and collaborators introduce EigenAlign, a fast spectral method with convergence guarantees for Erd-s-Renyí graphs. In this work we propose the algorithm Projected Power Alignment, which is a projected power iteration version of EigenAlign. We numerically show it improves the recovery rates of EigenAlign and we describe the theory that may be used to provide performance guarantees for Projected Power Alignment.

Supervising Unsuccessful Student Teaching Assignments: Two Terminator's Tales.

ERIC Educational Resources Information Center

St. Maurice, Henry

2001-01-01

Discusses problems that arise when there is a conflict between a student teacher and the supervising teacher and when a student teacher does not perform satisfactorily. Focuses on how supervisors deal with failed assignments and how beginning teachers improve their teaching and learn from failed assignments. (Contains 21 references.) (JOW)

33 CFR 3.01-5 - Assignment of functions.

Code of Federal Regulations, 2010 CFR

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

PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem

PubMed Central

Schmidhuber, Jürgen

2013-01-01

Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. Given a general problem-solving architecture, at any given time, the novel algorithmic framework PowerPlay (Schmidhuber, 2011) searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Newly invented tasks may require to achieve a wow-effect by making previously learned skills more efficient such that they require less time and space. New skills may (partially) re-use previously learned skills. The greedy search of typical PowerPlay variants uses time-optimal program search to order candidate pairs of tasks and solver modifications by their conditional computational (time and space) complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. This biases the search toward pairs that can be described compactly and validated quickly. The computational costs of validating new tasks need not grow with task repertoire size. Standard problem solver architectures of personal computers or neural networks tend to generalize by solving numerous tasks outside the self-invented training set; PowerPlay’s ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Gödel’s sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Booster Stations § 74.702 Channel assignments. (a) An applicant for a new low power TV or TV translator... pursuant to § 73.3572 of this chapter. (c) A television broadcast booster station will be authorized on the...

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Booster Stations § 74.702 Channel assignments. (a) An applicant for a new low power TV or TV translator... pursuant to § 73.3572 of this chapter. (c) A television broadcast booster station will be authorized on the...

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Booster Stations § 74.702 Channel assignments. (a) An applicant for a new low power TV or TV translator... pursuant to § 73.3572 of this chapter. (c) A television broadcast booster station will be authorized on the...

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Booster Stations § 74.702 Channel assignments. (a) An applicant for a new low power TV or TV translator... pursuant to § 73.3572 of this chapter. (c) A television broadcast booster station will be authorized on the...

Generalised Assignment Matrix Methodology in Linear Programming

ERIC Educational Resources Information Center

Jerome, Lawrence

2012-01-01

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

Robotics and STEM Learning: Students' Achievements in Assignments According to the P3 Task Taxonomy--Practice, Problem Solving, and Projects

ERIC Educational Resources Information Center

Barak, Moshe; Assal, Muhammad

2018-01-01

This study presents the case of development and evaluation of a STEM-oriented 30-h robotics course for junior high school students (n = 32). Class activities were designed according to the P3 Task Taxonomy, which included: (1) practice-basic closed-ended tasks and exercises; (2) problem solving--small-scale open-ended assignments in which the…

Using ant colony optimization on the quadratic assignment problem to achieve low energy cost in geo-distributed data centers

NASA Astrophysics Data System (ADS)

Osei, Richard

There are many problems associated with operating a data center. Some of these problems include data security, system performance, increasing infrastructure complexity, increasing storage utilization, keeping up with data growth, and increasing energy costs. Energy cost differs by location, and at most locations fluctuates over time. The rising cost of energy makes it harder for data centers to function properly and provide a good quality of service. With reduced energy cost, data centers will have longer lasting servers/equipment, higher availability of resources, better quality of service, a greener environment, and reduced service and software costs for consumers. Some of the ways that data centers have tried to using to reduce energy costs include dynamically switching on and off servers based on the number of users and some predefined conditions, the use of environmental monitoring sensors, and the use of dynamic voltage and frequency scaling (DVFS), which enables processors to run at different combinations of frequencies with voltages to reduce energy cost. This thesis presents another method by which energy cost at data centers could be reduced. This method involves the use of Ant Colony Optimization (ACO) on a Quadratic Assignment Problem (QAP) in assigning user request to servers in geo-distributed data centers. In this paper, an effort to reduce data center energy cost involves the use of front portals, which handle users' requests, were used as ants to find cost effective ways to assign users requests to a server in heterogeneous geo-distributed data centers. The simulation results indicate that the ACO for Optimal Server Activation and Task Placement algorithm reduces energy cost on a small and large number of users' requests in a geo-distributed data center and its performance increases as the input data grows. In a simulation with 3 geo-distributed data centers, and user's resource request ranging from 25,000 to 25,000,000, the ACO algorithm was able

42 CFR 433.146 - Rights assigned; assignment method.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 42 Public Health 4 2013-10-01 2013-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 in...

42 CFR 433.146 - Rights assigned; assignment method.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 42 Public Health 4 2011-10-01 2011-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 in...

42 CFR 433.146 - Rights assigned; assignment method.

Code of Federal Regulations, 2010 CFR

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

Global Optimization of Emergency Evacuation Assignments

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

Han, Lee; Yuan, Fang; Chin, Shih-Miao

2006-01-01

Conventional emergency evacuation plans often assign evacuees to fixed routes or destinations based mainly on geographic proximity. Such approaches can be inefficient if the roads are congested, blocked, or otherwise dangerous because of the emergency. By not constraining evacuees to prespecified destinations, a one-destination evacuation approach provides flexibility in the optimization process. We present a framework for the simultaneous optimization of evacuation-traffic distribution and assignment. Based on the one-destination evacuation concept, we can obtain the optimal destination and route assignment by solving a one-destination traffic-assignment problem on a modified network representation. In a county-wide, large-scale evacuation case study, the one-destinationmore » model yields substantial improvement over the conventional approach, with the overall evacuation time reduced by more than 60 percent. More importantly, emergency planners can easily implement this framework by instructing evacuees to go to destinations that the one-destination optimization process selects.« less

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Mitigation of Power Quality Problems in Grid-Interactive Distributed Generation System

NASA Astrophysics Data System (ADS)

Bhende, C. N.; Kalam, A.; Malla, S. G.

2016-04-01

Having an inter-tie between low/medium voltage grid and distributed generation (DG), both exposes to power quality (PQ) problems created by each other. This paper addresses various PQ problems arise due to integration of DG with grid. The major PQ problems are due to unbalanced and non-linear load connected at DG, unbalanced voltage variations on transmission line and unbalanced grid voltages which severely affect the performance of the system. To mitigate the above mentioned PQ problems, a novel integrated control of distribution static shunt compensator (DSTATCOM) is presented in this paper. DSTATCOM control helps in reducing the unbalance factor of PCC voltage. It also eliminates harmonics from line currents and makes them balanced. Moreover, DSTATCOM supplies the reactive power required by the load locally and hence, grid need not to supply the reactive power. To show the efficacy of the proposed controller, several operating conditions are considered and verified through simulation using MATLAB/SIMULINK.

47 CFR 73.865 - Assignment and transfer of LPFM licenses.

Code of Federal Regulations, 2012 CFR

2012-10-01

... transfer an LPFM construction permit at any time. (e) Transfers of control involving a sudden change of... 47 Telecommunication 4 2012-10-01 2012-10-01 false Assignment and transfer of LPFM licenses. 73... SERVICES RADIO BROADCAST SERVICES Low Power FM Broadcast Stations (LPFM) § 73.865 Assignment and transfer...

Silica problem in the design of geothermal power plants

NASA Astrophysics Data System (ADS)

Dipippo, R.

1985-02-01

The silica problem is examined from the perspective of the power plant designer to develop a procedure to enable a quick estimate to be made of the potential seriousness of the silica deposition problem for a wide variety of resources and for selected types of power plant. The method employs correlations for the equilibrium solubilities of quartz and amorphous silica and for the saturated liquid enthalpy and the latent heat of water substance. Single- and double-flash plants optimized for highest thermodynamic efficiency are considered. Binary-type plants are included generically without mention of cycle specifics. The results are presented both graphically and in tabular form, and the governing equations will be given in an easily-programmable form.

Static assignment of complex stochastic tasks using stochastic majorization

NASA Technical Reports Server (NTRS)

Nicol, David; Simha, Rahul; Towsley, Don

1992-01-01

We consider the problem of statically assigning many tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, and all tasks are assumed to have identical behavior. We show how the theory of majorization can be used to obtain a partial order among possible task assignments. Our results show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, we show how measurements of finishing time, resource utilization, and reliability are all captured by the theory. We also show how the theory may be applied to the problem of partitioning a pool of processors for distribution among parallelizable tasks.

Negotiating Assignment Pathways: Students and Academic Assignments

ERIC Educational Resources Information Center

McDowell, Liz

2008-01-01

Existing research identifies that students' approaches to assignments are related to their general approaches to study. It is suggested that students need to better understand the requirements of assignments and acquire new concepts such as "argument". This fine-grained study proposes four qualitatively distinct assignment pathways: gathering,…

Voltage scheduling for low power/energy

NASA Astrophysics Data System (ADS)

Manzak, Ali

2001-07-01

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

Approximation algorithms for the min-power symmetric connectivity problem

NASA Astrophysics Data System (ADS)

Plotnikov, Roman; Erzin, Adil; Mladenovic, Nenad

2016-10-01

We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing the total transmission power consumptions. We propose several new heuristics based on the variable neighborhood search metaheuristic for the approximation solution of the problem. We have performed a numerical experiment where all proposed algorithms have been executed on the randomly generated test samples. For these instances, on average, our algorithms outperform the previously known heuristics.

Task Assignment Heuristics for Parallel and Distributed CFD Applications

NASA Technical Reports Server (NTRS)

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

2003-01-01

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

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

NASA Astrophysics Data System (ADS)

Barnawi, Waleed T.

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

Assessment and mitigation of power quality problems for PUSPATI TRIGA Reactor (RTP)

NASA Astrophysics Data System (ADS)

Zakaria, Mohd Fazli; Ramachandaramurthy, Vigna K.

2017-01-01

An electrical power systems are exposed to different types of power quality disturbances. Investigation and monitoring of power quality are necessary to maintain accurate operation of sensitive equipment especially for nuclear installations. This paper will discuss the power quality problems observed at the electrical sources of PUSPATI TRIGA Reactor (RTP). Assessment of power quality requires the identification of any anomalous behavior on a power system, which adversely affects the normal operation of electrical or electronic equipment. A power quality assessment involves gathering data resources; analyzing the data (with reference to power quality standards) then, if problems exist, recommendation of mitigation techniques must be considered. Field power quality data is collected by power quality recorder and analyzed with reference to power quality standards. Normally the electrical power is supplied to the RTP via two sources in order to keep a good reliability where each of them is designed to carry the full load. The assessment of power quality during reactor operation was performed for both electrical sources. There were several disturbances such as voltage harmonics and flicker that exceeded the thresholds. To reduce these disturbances, mitigation techniques have been proposed, such as to install passive harmonic filters to reduce harmonic distortion, dynamic voltage restorer (DVR) to reduce voltage disturbances and isolate all sensitive and critical loads.

Extension of modified power method to two-dimensional problems

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

Zhang, Peng; Ulsan National Institute of Science and Technology, 50 UNIST-gil, Ulsan 44919; Lee, Hyunsuk

2016-09-01

In this study, the generalized modified power method was extended to two-dimensional problems. A direct application of the method to two-dimensional problems was shown to be unstable when the number of requested eigenmodes is larger than a certain problem dependent number. The root cause of this instability has been identified as the degeneracy of the transfer matrix. In order to resolve this instability, the number of sub-regions for the transfer matrix was increased to be larger than the number of requested eigenmodes; and a new transfer matrix was introduced accordingly which can be calculated by the least square method. Themore » stability of the new method has been successfully demonstrated with a neutron diffusion eigenvalue problem and the 2D C5G7 benchmark problem. - Graphical abstract:.« less

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

NASA Astrophysics Data System (ADS)

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

1997-09-01

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

Optimal assignment of workers to supporting services in a hospital

NASA Astrophysics Data System (ADS)

Sawik, Bartosz; Mikulik, Jerzy

2008-01-01

Supporting services play an important role in health care institutions such as hospitals. This paper presents an application of operations research model for optimal allocation of workers among supporting services in a public hospital. The services include logistics, inventory management, financial management, operations management, medical analysis, etc. The optimality criterion of the problem is to minimize operations costs of supporting services subject to some specific constraints. The constraints represent specific conditions for resource allocation in a hospital. The overall problem is formulated as an integer program in the literature known as the assignment problem, where the decision variables represent the assignment of people to various jobs. The results of some computational experiments modeled on a real data from a selected Polish hospital are reported.

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

PubMed

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. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Variable Generation Power Forecasting as a Big Data Problem

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

Haupt, Sue Ellen; Kosovic, Branko

To blend growing amounts of power from renewable resources into utility operations requires accurate forecasts. For both day ahead planning and real-time operations, the power from the wind and solar resources must be predicted based on real-time observations and a series of models that span the temporal and spatial scales of the problem, using the physical and dynamical knowledge as well as computational intelligence. Accurate prediction is a Big Data problem that requires disparate data, multiple models that are each applicable for a specific time frame, and application of computational intelligence techniques to successfully blend all of the model andmore » observational information in real-time and deliver it to the decision makers at utilities and grid operators. This paper describes an example system that has been used for utility applications and how it has been configured to meet utility needs while addressing the Big Data issues.« less

Variable Generation Power Forecasting as a Big Data Problem

DOE PAGES

Haupt, Sue Ellen; Kosovic, Branko

2016-10-10

To blend growing amounts of power from renewable resources into utility operations requires accurate forecasts. For both day ahead planning and real-time operations, the power from the wind and solar resources must be predicted based on real-time observations and a series of models that span the temporal and spatial scales of the problem, using the physical and dynamical knowledge as well as computational intelligence. Accurate prediction is a Big Data problem that requires disparate data, multiple models that are each applicable for a specific time frame, and application of computational intelligence techniques to successfully blend all of the model andmore » observational information in real-time and deliver it to the decision makers at utilities and grid operators. This paper describes an example system that has been used for utility applications and how it has been configured to meet utility needs while addressing the Big Data issues.« less

A demand assignment control in international business satellite communications network

NASA Astrophysics Data System (ADS)

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

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

Preference in Random Assignment: Implications for the Interpretation of Randomized Trials

PubMed Central

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

2009-01-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. PMID:19434489

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

PubMed Central

Zhao, Chuan-Li; Hsu, Hua-Feng

2014-01-01

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

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

PubMed

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

2014-01-01

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

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

NASA Astrophysics Data System (ADS)

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

Nuclear magnetic resonance (NMR) spectroscopy plays a critical role in structural genomics, and serves as a primary tool for determining protein structures, dynamics and interactions in physiologically-relevant solution conditions. The current speed of protein structure determination via NMR is limited by the lengthy time required in resonance assignment, which maps spectral peaks to specific atoms and residues in the primary sequence. Although numerous algorithms have been developed to address the backbone resonance assignment problem [68,2,10,37,14,64,1,31,60], little work has been done to automate side-chain resonance assignment [43, 48, 5]. Most previous attempts in assigning side-chain resonances depend on a set of NMR experiments that record through-bond interactions with side-chain protons for each residue. Unfortunately, these NMR experiments have low sensitivity and limited performance on large proteins, which makes it difficult to obtain enough side-chain resonance assignments. On the other hand, it is essential to obtain almost all of the side-chain resonance assignments as a prerequisite for high-resolution structure determination. To overcome this deficiency, we present a novel side-chain resonance assignment algorithm based on alternative NMR experiments measuring through-space interactions between protons in the protein, which also provide crucial distance restraints and are normally required in high-resolution structure determination. We cast the side-chain resonance assignment problem into a Markov Random Field (MRF) framework, and extend and apply combinatorial protein design algorithms to compute the optimal solution that best interprets the NMR data. Our MRF framework captures the contact map information of the protein derived from NMR spectra, and exploits the structural information available from the backbone conformations determined by orientational restraints and a set of discretized side-chain conformations (i.e., rotamers). A Hausdorff

A Stochastic Employment Problem

ERIC Educational Resources Information Center

Wu, Teng

2013-01-01

The Stochastic Employment Problem(SEP) is a variation of the Stochastic Assignment Problem which analyzes the scenario that one assigns balls into boxes. Balls arrive sequentially with each one having a binary vector X = (X[subscript 1], X[subscript 2],...,X[subscript n]) attached, with the interpretation being that if X[subscript i] = 1 the ball…

A task scheduler framework for self-powered wireless sensors.

PubMed

Nordman, Mikael M

2003-10-01

The cost and inconvenience of cabling is a factor limiting widespread use of intelligent sensors. Recent developments in short-range, low-power radio seem to provide an opening to this problem, making development of wireless sensors feasible. However, for these sensors the energy availability is a main concern. The common solution is either to use a battery or to harvest ambient energy. The benefit of harvested ambient energy is that the energy feeder can be considered as lasting a lifetime, thus it saves the user from concerns related to energy management. The problem is, however, the unpredictability and unsteady behavior of ambient energy sources. This becomes a main concern for sensors that run multiple tasks at different priorities. This paper proposes a new scheduler framework that enables the reliable assignment of task priorities and scheduling in sensors powered by ambient energy. The framework being based on environment parameters, virtual queues, and a state machine with transition conditions, dynamically manages task execution according to priorities. The framework is assessed in a test system powered by a solar panel. The results show the functionality of the framework and how task execution reliably is handled without violating the priority scheme that has been assigned to it.

The direct assignment option as a modular design component: an example for the setting of two predefined subgroups.

PubMed

An, Ming-Wen; Lu, Xin; Sargent, Daniel J; Mandrekar, Sumithra J

2015-01-01

A phase II design with an option for direct assignment (stop randomization and assign all patients to experimental treatment based on interim analysis, IA) for a predefined subgroup was previously proposed. Here, we illustrate the modularity of the direct assignment option by applying it to the setting of two predefined subgroups and testing for separate subgroup main effects. We power the 2-subgroup direct assignment option design with 1 IA (DAD-1) to test for separate subgroup main effects, with assessment of power to detect an interaction in a post-hoc test. Simulations assessed the statistical properties of this design compared to the 2-subgroup balanced randomized design with 1 IA, BRD-1. Different response rates for treatment/control in subgroup 1 (0.4/0.2) and in subgroup 2 (0.1/0.2, 0.4/0.2) were considered. The 2-subgroup DAD-1 preserves power and type I error rate compared to the 2-subgroup BRD-1, while exhibiting reasonable power in a post-hoc test for interaction. The direct assignment option is a flexible design component that can be incorporated into broader design frameworks, while maintaining desirable statistical properties, clinical appeal, and logistical simplicity.

Capacity-constrained traffic assignment in networks with residual queues

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

Lam, W.H.K.; Zhang, Y.

2000-04-01

This paper proposes a capacity-constrained traffic assignment model for strategic transport planning in which the steady-state user equilibrium principle is extended for road networks with residual queues. Therefore, the road-exit capacity and the queuing effects can be incorporated into the strategic transport model for traffic forecasting. The proposed model is applicable to the congested network particularly when the traffic demands exceeds the capacity of the network during the peak period. An efficient solution method is proposed for solving the steady-state traffic assignment problem with residual queues. Then a simple numerical example is employed to demonstrate the application of the proposedmore » model and solution method, while an example of a medium-sized arterial highway network in Sioux Falls, South Dakota, is used to test the applicability of the proposed solution to real problems.« less

Protein assignments without peak lists using higher-order spectra.

PubMed

Benison, Gregory; Berkholz, Donald S; Barbar, Elisar

2007-12-01

Despite advances in automating the generation and manipulation of peak lists for assigning biomolecules, there are well-known advantages to working directly with spectra: the eye is still superior to computer algorithms when it comes to picking out peak relationships from contour plots in the presence of confounding factors such as noise, overlap, and spectral artifacts. Here, we present constructs called higher-order spectra for identifying, through direct visual examination, many of the same relationships typically identified by searching peak lists, making them another addition to the set of tools (alongside peak picking and automated assignment) that can be used to solve the assignment problem. The technique is useful for searching for correlated peaks in any spectrum type. Application of this technique to novel, complete sequential assignment of two proteins (AhpFn and IC74(84-143)) is demonstrated. The program "burrow-owl" for the generation and display of higher-order spectra is available at (http://sourceforge.net/projects/burrow-owl) or from the authors.

Student's Lab Assignments in PDE Course with MAPLE.

ERIC Educational Resources Information Center

Ponidi, B. Alhadi

Computer-aided software has been used intensively in many mathematics courses, especially in computational subjects, to solve initial value and boundary value problems in Partial Differential Equations (PDE). Many software packages were used in student lab assignments such as FORTRAN, PASCAL, MATLAB, MATHEMATICA, and MAPLE in order to accelerate…

Integrated assignment and path planning

NASA Astrophysics Data System (ADS)

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

Covariance NMR Processing and Analysis for Protein Assignment.

PubMed

Harden, Bradley J; Frueh, Dominique P

2018-01-01

During NMR resonance assignment it is often necessary to relate nuclei to one another indirectly, through their common correlations to other nuclei. Covariance NMR has emerged as a powerful technique to correlate such nuclei without relying on error-prone peak peaking. However, false-positive artifacts in covariance spectra have impeded a general application to proteins. We recently introduced pre- and postprocessing steps to reduce the prevalence of artifacts in covariance spectra, allowing for the calculation of a variety of 4D covariance maps obtained from diverse combinations of pairs of 3D spectra, and we have employed them to assign backbone and sidechain resonances in two large and challenging proteins. In this chapter, we present a detailed protocol describing how to (1) properly prepare existing 3D spectra for covariance, (2) understand and apply our processing script, and (3) navigate and interpret the resulting 4D spectra. We also provide solutions to a number of errors that may occur when using our script, and we offer practical advice when assigning difficult signals. We believe such 4D spectra, and covariance NMR in general, can play an integral role in the assignment of NMR signals.

A review of vibration problems in power station boiler feed pumps

NASA Technical Reports Server (NTRS)

France, David

1994-01-01

Boiler feed pump reliability and availability is recognized as important to the overall efficiency of power generation. Vibration monitoring is often used as a part of planned maintenance. This paper reviews a number of different types of boiler feed pump vibration problems describing some methods of solution in the process. It is hoped that this review may assist both designers and users faced with similar problems.

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Frequency assignments for HFDF receivers in a search and rescue network

NASA Astrophysics Data System (ADS)

Johnson, Krista E.

1990-03-01

This thesis applies a multiobjective linear programming approach to the problem of assigning frequencies to high frequency direction finding (HFDF) receivers in a search-and-rescue network in order to maximize the expected number of geolocations of vessels in distress. The problem is formulated as a multiobjective integer linear programming problem. The integrality of the solutions is guaranteed by the totally unimodularity of the A-matrix. Two approaches are taken to solve the multiobjective linear programming problem: (1) the multiobjective simplex method as implemented in ADBASE; and (2) an iterative approach. In this approach, the individual objective functions are weighted and combined in a single additive objective function. The resulting single objective problem is expressed as a network programming problem and solved using SAS NETFLOW. The process is then repeated with different weightings for the objective functions. The solutions obtained from the multiobjective linear programs are evaluated using a FORTRAN program to determine which solution provides the greatest expected number of geolocations. This solution is then compared to the sample mean and standard deviation for the expected number of geolocations resulting from 10,000 random frequency assignments for the network.

Using Portfolio Assignments to Assess Students' Mathematical Thinking

ERIC Educational Resources Information Center

Fukawa-Connelly, Timothy; Buck, Stephen

2010-01-01

Writing in mathematics can improve procedural knowledge and communication skills and may also help students better understand and then remember problems. The majority of mathematics teachers know that they ought to include some writing assignments in their instructional plans, but the challenge of covering the curriculum and the time required to…

Due-Window Assignment Scheduling with Variable Job Processing Times

PubMed Central

Wu, Yu-Bin

2015-01-01

We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time. PMID:25918745

18 CFR 389.101 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2010 CFR

2010-04-01

... assigned pursuant to the Paperwork Reduction Act. 389.101 Section 389.101 Conservation of Power and Water... FOR COMMISSION INFORMATION COLLECTION REQUIREMENTS § 389.101 OMB control numbers assigned pursuant to... citations affecting § 389.101, see the List of CFR Sections Affected, which appears in the Finding Aids...

18 CFR 389.101 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2011 CFR

2011-04-01

... assigned pursuant to the Paperwork Reduction Act. 389.101 Section 389.101 Conservation of Power and Water... FOR COMMISSION INFORMATION COLLECTION REQUIREMENTS § 389.101 OMB control numbers assigned pursuant to... citations affecting § 389.101, see the List of CFR Sections Affected, which appears in the Finding Aids...

BTEC Integrative Assignments.

ERIC Educational Resources Information Center

Foot, G. E.

1992-01-01

To equip electrical engineering students with common and transferable work skills, a program of integrative assignments was created to develop communication and teamwork skills. Discusses assignment components; the log book, a personal account of each assignment; assessment; conversion of "common skills" to competence statements, and…

Numerical Solution of Time-Dependent Problems with a Fractional-Power Elliptic Operator

NASA Astrophysics Data System (ADS)

Vabishchevich, P. N.

2018-03-01

A time-dependent problem in a bounded domain for a fractional diffusion equation is considered. The first-order evolution equation involves a fractional-power second-order elliptic operator with Robin boundary conditions. A finite-element spatial approximation with an additive approximation of the operator of the problem is used. The time approximation is based on a vector scheme. The transition to a new time level is ensured by solving a sequence of standard elliptic boundary value problems. Numerical results obtained for a two-dimensional model problem are presented.

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

PubMed

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.

Storage assignment optimization in a multi-tier shuttle warehousing system

NASA Astrophysics Data System (ADS)

Wang, Yanyan; Mou, Shandong; Wu, Yaohua

2016-03-01

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

Credit assignment in movement-dependent reinforcement learning

PubMed Central

Boggess, Matthew J.; Crossley, Matthew J.; Parvin, Darius; Ivry, Richard B.; Taylor, Jordan A.

2016-01-01

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

Credit assignment in movement-dependent reinforcement learning.

PubMed

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.

Fuel cells provide a revenue-generating solution to power quality problems

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

King, J.M. Jr.

Electric power quality and reliability are becoming increasingly important as computers and microprocessors assume a larger role in commercial, health care and industrial buildings and processes. At the same time, constraints on transmission and distribution of power from central stations are making local areas vulnerable to low voltage, load addition limitations, power quality and power reliability problems. Many customers currently utilize some form of premium power in the form of standby generators and/or UPS systems. These include customers where continuous power is required because of health and safety or security reasons (hospitals, nursing homes, places of public assembly, air trafficmore » control, military installations, telecommunications, etc.) These also include customers with industrial or commercial processes which can`t tolerance an interruption of power because of product loss or equipment damage. The paper discusses the use of the PC25 fuel cell power plant for backup and parallel power supplies for critical industrial applications. Several PC25 installations are described: the use of propane in a PC25; the use by rural cooperatives; and a demonstration of PC25 technology using landfill gas.« less

The SPS interference problem-electronic system effects and mitigation techniques

NASA Technical Reports Server (NTRS)

Juroshek, J. R.

1980-01-01

The potential for interference between solar power satellites (SPS) and other Earth satellite operations was examined along with interference problems involving specific electronic devices. Conclusions indicate that interference is likely in the 2500 MHz to 2690 MHz direct broadcast satellite band adjacent to SPS. Estimates of the adjacent channel noise from SPS in this band are as high as -124 dBc/4 kHz and -100 dBc/MHz, where dBc represents decibels relative to the total power in the fundamental. A second potential problem is the 7350 MHz, 3d harmonic from SPS that falls within the 7300 MHz to 7450 MHz space to Earth, government, satellite assignment. Catastrophic failures can be produced in integrated circuits when the microwave power levels coupled into inputs and power leads reach 1 to 100 watts. The failures are typically due to bonding wire melting, metallization failures, and junction shorting. Nondestructive interaction or interference, however, generally occurs with coupled power levels of the order of 10 milliwatts. This integration is due to the rectification of microwave energy by the numerous pn junctions within these circuits.

Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

DTIC Science & Technology

2015-06-24

WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Arizona State University School of Mathematical & Statistical Sciences 901 S...SUPPLEMENTARY NOTES 14. ABSTRACT The major goals of this project were completed: the exact solution of previously unsolved challenging combinatorial optimization... combinatorial optimization problem, the Directional Sensor Problem, was solved in two ways. First, heuristically in an engineering fashion and second, exactly

Grouping puts figure-ground assignment in context by constraining propagation of edge-assignment

PubMed Central

Brooks, Joseph L.; Driver, Jon

2010-01-01

Figure-ground organization involves assignment of edges to a figural shape on one or the other side of each dividing edge. Established visual cues for edge-assignment primarily concern relatively local rather than contextual factors. Here we show that assignment for a locally-unbiased edge can be affected by assignment of a remote contextual edge that has its own locally-biased assignment. We find that such propagation of edge-assignment from the biased remote context occurs only when the biased and unbiased edges are grouped. This new principle, whereby grouping constrains propagation of figural edge-assignment, emerges from both subjective reports and from an objective short-term edge-matching task. It generalizes from moving displays involving grouping by common fate and collinearity, to static displays with grouping by similarity of edge-contrast polarity, or apparent occlusion. Our results identify a new contextual influence upon edge-assignment. They also identify a new mechanistic relation between grouping and figure-ground processes, whereby grouping between remote elements can constrain propagation of edge-assignment between those elements. PMID:20436200

Automatic Assignment of Methyl-NMR Spectra of Supramolecular Machines Using Graph Theory.

PubMed

Pritišanac, Iva; Degiacomi, Matteo T; Alderson, T Reid; Carneiro, Marta G; Ab, Eiso; Siegal, Gregg; Baldwin, Andrew J

2017-07-19

Methyl groups are powerful probes for the analysis of structure, dynamics and function of supramolecular assemblies, using both solution- and solid-state NMR. Widespread application of the methodology has been limited due to the challenges associated with assigning spectral resonances to specific locations within a biomolecule. Here, we present Methyl Assignment by Graph Matching (MAGMA), for the automatic assignment of methyl resonances. A graph matching protocol examines all possibilities for each resonance in order to determine an exact assignment that includes a complete description of any ambiguity. MAGMA gives 100% accuracy in confident assignments when tested against both synthetic data, and 9 cross-validated examples using both solution- and solid-state NMR data. We show that this remarkable accuracy enables a user to distinguish between alternative protein structures. In a drug discovery application on HSP90, we show the method can rapidly and efficiently distinguish between possible ligand binding modes. By providing an exact and robust solution to methyl resonance assignment, MAGMA can facilitate significantly accelerated studies of supramolecular machines using methyl-based NMR spectroscopy.

Fragment assignment in the cloud with eXpress-D

PubMed Central

2013-01-01

Background Probabilistic assignment of ambiguously mapped fragments produced by high-throughput sequencing experiments has been demonstrated to greatly improve accuracy in the analysis of RNA-Seq and ChIP-Seq, and is an essential step in many other sequence census experiments. A maximum likelihood method using the expectation-maximization (EM) algorithm for optimization is commonly used to solve this problem. However, batch EM-based approaches do not scale well with the size of sequencing datasets, which have been increasing dramatically over the past few years. Thus, current approaches to fragment assignment rely on heuristics or approximations for tractability. Results We present an implementation of a distributed EM solution to the fragment assignment problem using Spark, a data analytics framework that can scale by leveraging compute clusters within datacenters–“the cloud”. We demonstrate that our implementation easily scales to billions of sequenced fragments, while providing the exact maximum likelihood assignment of ambiguous fragments. The accuracy of the method is shown to be an improvement over the most widely used tools available and can be run in a constant amount of time when cluster resources are scaled linearly with the amount of input data. Conclusions The cloud offers one solution for the difficulties faced in the analysis of massive high-thoughput sequencing data, which continue to grow rapidly. Researchers in bioinformatics must follow developments in distributed systems–such as new frameworks like Spark–for ways to port existing methods to the cloud and help them scale to the datasets of the future. Our software, eXpress-D, is freely available at: http://github.com/adarob/express-d. PMID:24314033

Problems in the Development of High-Power Turbogenerators with Superconducting Field Windings,

DTIC Science & Technology

1983-12-05

Both these constructions use a pulsating magnetic flux, which lowers the efficiency of the machine. In the case of rotating armature winding there is...Current pickup is accomplished with the aid of springs or flexible . connections. Calculations showed that with power 500 MW such a generator should...superconducting inductor a number of complicated technical problems appears. The main problem - the provision of strength and perfect heat insulation

Grouping puts figure-ground assignment in context by constraining propagation of edge assignment.

PubMed

Brooks, Joseph L; Brook, Joseph L; Driver, Jon

2010-05-01

Figure-ground organization involves the assignment of edges to a figural shape on one or the other side of each dividing edge. Established visual cues for edge assignment primarily concern relatively local rather than contextual factors. In the present article, we show that an assignment for a locally unbiased edge can be affected by an assignment of a remote contextual edge that has its own locally biased assignment. We find that such propagation of edge assignment from the biased remote context occurs only when the biased and unbiased edges are grouped. This new principle, whereby grouping constrains the propagation of figural edge assignment, emerges from both subjective reports and an objective short-term edge-matching task. It generalizes from moving displays involving grouping by common fate and collinearity, to static displays with grouping by similarity of edge-contrast polarity, or apparent occlusion. Our results identify a new contextual influence on edge assignment. They also identify a new mechanistic relation between grouping and figure-ground processes, whereby grouping between remote elements can constrain the propagation of edge assignment between those elements. Supplemental materials for this article may be downloaded from http://app.psychonomic-journals.org/content/supplemental.

A General Chemistry Assignment Analyzing Environmental Contamination for the Depue, IL, National Superfund Site

ERIC Educational Resources Information Center

Saslow Gomez, Sarah A.; Faurie-Wisniewski, Danielle; Parsa, Arlen; Spitz, Jeff; Spitz, Jennifer Amdur; Loeb, Nancy C.; Geiger, Franz M.

2015-01-01

The classroom exercise outlined here is a self-directed assignment that connects students to the environmental contamination problem surrounding the DePue Superfund site. By connecting chemistry knowledge gained in the classroom with a real-world problem, students are encouraged to personally connect with the problem while simultaneously…

Context-Aware Reviewer Assignment for Trust Enhanced Peer Review

PubMed Central

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

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

ERIC Educational Resources Information Center

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…

Contact replacement for NMR resonance assignment.

PubMed

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

2008-07-01

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

Determining the relationship between students' scores using traditional homework assignments to those who used assignments on a non-traditional interactive CD with tutor helps

NASA Astrophysics Data System (ADS)

Tinney, Charles Evan

2007-12-01

By using the book "Physics for Scientists and Engineers" by Raymond A. Serway as a guide, CD problem sets for teaching a calculus-based physics course were developed, programmed, and evaluated for homework assignments during the 2003-2004 academic year at Utah State University. These CD sets were used to replace the traditionally handwritten and submitted homework sets. They included a research-based format that guided the students through problem-solving techniques using responseactivated helps and suggestions. The CD contents were designed to help the student improve his/her physics problem-solving skills. The analyzed score results showed a direct correlation between the scores obtained on the homework and the students' time spent per problem, as well as the number of helps used per problem.

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

PubMed Central

Zhang, Meiyan; Zheng, Yahong Rosa

2017-01-01

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

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

PubMed

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

2017-07-11

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

Dispatching power system for preventive and corrective voltage collapse problem in a deregulated power system

NASA Astrophysics Data System (ADS)

Alemadi, Nasser Ahmed

Deregulation has brought opportunities for increasing efficiency of production and delivery and reduced costs to customers. Deregulation has also bought great challenges to provide the reliability and security customers have come to expect and demand from the electrical delivery system. One of the challenges in the deregulated power system is voltage instability. Voltage instability has become the principal constraint on power system operation for many utilities. Voltage instability is a unique problem because it can produce an uncontrollable, cascading instability that results in blackout for a large region or an entire country. In this work we define a system of advanced analytical methods and tools for secure and efficient operation of the power system in the deregulated environment. The work consists of two modules; (a) contingency selection module and (b) a Security Constrained Optimization module. The contingency selection module to be used for voltage instability is the Voltage Stability Security Assessment and Diagnosis (VSSAD). VSSAD shows that each voltage control area and its reactive reserve basin describe a subsystem or agent that has a unique voltage instability problem. VSSAD identifies each such agent. VS SAD is to assess proximity to voltage instability for each agent and rank voltage instability agents for each contingency simulated. Contingency selection and ranking for each agent is also performed. Diagnosis of where, why, when, and what can be done to cure voltage instability for each equipment outage and transaction change combination that has no load flow solution is also performed. A security constrained optimization module developed solves a minimum control solvability problem. A minimum control solvability problem obtains the reactive reserves through action of voltage control devices that VSSAD determines are needed in each agent to obtain solution of the load flow. VSSAD makes a physically impossible recommendation of adding reactive

An efficient protocol for providing integrated voice/data services to mobiles over power-limited satellite channels

NASA Astrophysics Data System (ADS)

Bose, Sanjay K.

1991-02-01

Various mobile satellite communication systems are being developed for providing integrated voice/data services over a shared satellite transponder which is power-limited in nature. A common strategy is to use slotted ALOHA request channels to request channel assignments for voice/data calls from a network management station. To maximize efficiency in a system with a power-limited satellite transponder, it is proposed that the bursty nature of voice sources be exploited by the NMS to 'over-assign' channels. This may cause problems of inefficiency and potential instability, as well as a degradation in the quality of service. Augmenting this with the introduction of simple state-dependent control procedures provides systems which exhibit more desirable operational features.

Gamification for Non-Majors Mathematics: An Innovative Assignment Model

ERIC Educational Resources Information Center

Leong, Siow Hoo; Tang, Howe Eng

2017-01-01

The most important ingredient of the pedagogy for teaching non-majors is getting their engagement. This paper proposes to use gamification to engage non-majors. An innovative game termed as Cover the Hungarian's Zeros is designed to tackle the common weakness of non-majors mathematics in solving the assignment problem using the Hungarian Method.…

Measuring Conceptual Gains and Benefits of Student Problem Designs

NASA Astrophysics Data System (ADS)

Mandell, Eric; Snyder, Rachel; Oswald, Wayne

2011-10-01

Writing assignments can be an effective way of getting students to practice higher-order learning skills in physics. One example of such an assignment is that of problem design. One version of the problem design assignment asks the student to evaluate the material from a chapter, after all instruction and other activities are complete. The student is to decide what concepts and ideas are most central, or critical in the chapter, and construct a problem that he or she feels best encompasses the major themes. Here, we use two concept surveys (FCI and EMCS) to measure conceptual gains for students completing the problem design assignment and present the preliminary results, comparing across several categories including gender, age, degree program, and class standing.

Neural reactivations during sleep determine network credit assignment

PubMed Central

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

2018-01-01

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

Power factor of power educators. [Undergraduate and graduate programs

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

Barthold, L.O.

1979-01-01

Undergraduate engineering schools are doing an excellent job in offering technical material and preparing students for careers in industry or graduate schools. At the undergraduate level, the burden of adequately covering a widening range of engineering fundamentals precludes offering industry-oriented undergraduate courses. The lack of communication skills is a serious handicap to many graduates. Furthermore, the ability to identify problems and structure approaches to their solutions needs more attention in undergraduate education. The quality of graduate programs in power is closely linked to the accuracy and realism with which graduate faculty perceive the industry and its problems as well asmore » their skill in teaching. It is important for graduate faculty to maintain close working ties with industry. Part-time assignments with utilities, manufacturers, or consultants are the best way to do so. Doing so through research grants can also help but can likewise be counterproductive if faculty are not discriminating in the subject matter pursued.« less

Multiple-step relayed correlation spectroscopy: sequential resonance assignments in oligosaccharides.

PubMed Central

Homans, S W; Dwek, R A; Fernandes, D L; Rademacher, T W

1984-01-01

A general property of the high-resolution proton NMR spectra of oligosaccharides is the appearance of low-field well-resolved resonances corresponding to the anomeric (H1) and H2 protons. The remaining skeletal protons resonate in the region 3-4 ppm, giving rise to an envelope of poorly resolved resonances. Assignments can be made from the H1 and H2 protons to their J-coupled neighbors (H2 and H3) within this main envelope by using 1H-1H correlated spectroscopy. However, the tight coupling (J congruent to delta) between further protons results in poor spectral dispersion with consequent assignment ambiguities. We describe here three-step two-dimensional relayed correlation spectroscopy and show how it can be used to correlate the resolved anomeric (H1) and H2 protons with remote (H4, H5) protons directly through a linear network of couplings using sequential magnetization transfer around the oligosaccharide rings. Resonance assignments are then obtained by inspection of cross-peaks that appear in well-resolved regions of the two-dimensional spectrum. This offers a general solution to the assignment problem in oligosaccharides and, importantly, these assignments will subsequently allow for the three-dimensional solution conformation to be determined by using one-dimensional and two-dimensional nuclear Overhauser experiments. PMID:6593701

"Ask Ernö": a self-learning tool for assignment and prediction of nuclear magnetic resonance spectra.

PubMed

Castillo, Andrés M; Bernal, Andrés; Dieden, Reiner; Patiny, Luc; Wist, Julien

2016-01-01

We present "Ask Ernö", a self-learning system for the automatic analysis of NMR spectra, consisting of integrated chemical shift assignment and prediction tools. The output of the automatic assignment component initializes and improves a database of assigned protons that is used by the chemical shift predictor. In turn, the predictions provided by the latter facilitate improvement of the assignment process. Iteration on these steps allows Ask Ernö to improve its ability to assign and predict spectra without any prior knowledge or assistance from human experts. This concept was tested by training such a system with a dataset of 2341 molecules and their (1)H-NMR spectra, and evaluating the accuracy of chemical shift predictions on a test set of 298 partially assigned molecules (2007 assigned protons). After 10 iterations, Ask Ernö was able to decrease its prediction error by 17 %, reaching an average error of 0.265 ppm. Over 60 % of the test chemical shifts were predicted within 0.2 ppm, while only 5 % still presented a prediction error of more than 1 ppm. Ask Ernö introduces an innovative approach to automatic NMR analysis that constantly learns and improves when provided with new data. Furthermore, it completely avoids the need for manually assigned spectra. This system has the potential to be turned into a fully autonomous tool able to compete with the best alternatives currently available.Graphical abstractSelf-learning loop. Any progress in the prediction (forward problem) will improve the assignment ability (reverse problem) and vice versa.

Rate and power efficient image compressed sensing and transmission

NASA Astrophysics Data System (ADS)

Olanigan, Saheed; Cao, Lei; Viswanathan, Ramanarayanan

2016-01-01

This paper presents a suboptimal quantization and transmission scheme for multiscale block-based compressed sensing images over wireless channels. The proposed method includes two stages: dealing with quantization distortion and transmission errors. First, given the total transmission bit rate, the optimal number of quantization bits is assigned to the sensed measurements in different wavelet sub-bands so that the total quantization distortion is minimized. Second, given the total transmission power, the energy is allocated to different quantization bit layers based on their different error sensitivities. The method of Lagrange multipliers with Karush-Kuhn-Tucker conditions is used to solve both optimization problems, for which the first problem can be solved with relaxation and the second problem can be solved completely. The effectiveness of the scheme is illustrated through simulation results, which have shown up to 10 dB improvement over the method without the rate and power optimization in medium and low signal-to-noise ratio cases.

An Examination of Problems and Solutions Related to the Chronic "Revolving Door" Alcohol Abuser. DHSS Planning Guideline #1, Task Assignment #1.11. Long-Term Support, Chronic Alcoholism and Other Drug Abuse.

ERIC Educational Resources Information Center

Vick, John W.; Houden, Dorothy

This report contains recommendations of a Wisconsin Task Assignment Steering Committee created to explore solutions to some significant problems facing adult chronic "revolving-detox-door" alcohol abusers (CRA's), persons with repeated admissions for detoxification services; and to examine the system that serves and funds them. This…

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

PubMed

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

2011-05-01

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

Assigning Oxidation States to Some Metal Dioxygen Complexes of Biological Interest.

ERIC Educational Resources Information Center

Summerville, David A.; And Others

1979-01-01

The bonding of dioxygen in metal-dioxygen complexes is discussed, paying particular attention to the problems encountered in assigning conventional oxidation numbers to both the metal center and coordinated dioxygen. Complexes of iron, cobalt, chromium, and manganese are considered. (BB)

7 CFR 760.31 - Assignment.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

7 CFR 760.31 - Assignment.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

7 CFR 760.31 - Assignment.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

7 CFR 760.31 - Assignment.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

7 CFR 760.31 - Assignment.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

Assignment Problem for the U.S. Marine Corps: Regional, Culture, and Language Familiarization Program

DTIC Science & Technology

2013-12-01

patients. The top trading cycle is popular in market design because it can be Pareto efficient and strategy proof when making assignments such as...29 1. Results for Group 1: Platoons 1 and 2 .............................................29 2...Results for Group 2: Platoons 3 and 4 .............................................31 3. Results for Group 3: Platoons 5 and 6

Listener Reliability in Assigning Utterance Boundaries in Children's Spontaneous Speech

ERIC Educational Resources Information Center

Stockman, Ida J.

2010-01-01

Research and clinical practices often rely on an utterance unit for spoken language analysis. This paper calls attention to the problems encountered when identifying utterance boundaries in young children's spontaneous conversational speech. The results of a reliability study of utterance boundary assignment are described for 20 females with…

Teaching Case: A Systems Analysis Role-Play Exercise and Assignment

ERIC Educational Resources Information Center

Mitri, Michel; Cole, Carey; Atkins, Laura

2017-01-01

This paper presents a role-play exercise and assignment that provides an active learning experience related to the system investigation phase of an SDLC. Whether using waterfall or agile approaches, the first SDLC step usually involves system investigation activities, including problem identification, feasibility study, cost-benefit analysis, and…

Separation anxiety among birth-assigned male children in a specialty gender identity service.

PubMed

VanderLaan, Doug P; Santarossa, Alanna; Nabbijohn, A Natisha; Wood, Hayley; Owen-Anderson, Allison; Zucker, Kenneth J

2018-01-01

Previous research suggested that separation anxiety disorder (SAD) is overrepresented among birth-assigned male children clinic-referred for gender dysphoria (GD). The present study examined maternally reported separation anxiety of birth-assigned male children assessed in a specialty gender identity service (N = 360). SAD was determined in relation to DSM-III and DSM-IV criteria, respectively. A dimensional metric of separation anxiety was examined in relation to several additional factors: age, ethnicity, parental marital status and social class, IQ, gender nonconformity, behavioral and emotional problems, and poor peer relations. When defined in a liberal fashion, 55.8% were classified as having SAD. When using a more conservative criterion, 5.3% were classified as having SAD, which was significantly greater than the estimated general population prevalence for boys, but not for girls. Dimensionally, separation anxiety was associated with having parents who were not married or cohabitating as well as with elevations in gender nonconformity; however, the association with gender nonconformity was no longer significant when statistically controlling for internalizing problems. Thus, SAD appears to be common among birth-assigned males clinic-referred for GD when defined in a liberal fashion, and more common than in boys, but not girls, from the general population even when more stringent criteria were applied. Also, the degree of separation anxiety appears to be linked to generic risk factors (i.e., parental marital status, internalizing problems). As such, although separation anxiety is common among birth-assigned male children clinic-referred for GD, it seems unlikely to hold unique significance for this population based on the current data.

Increased alpha band activity indexes inhibitory competition across a border during figure assignment.

PubMed

Sanguinetti, Joseph L; Trujillo, Logan T; Schnyer, David M; Allen, John J B; Peterson, Mary A

2016-09-01

Figure-ground assignment is thought to entail inhibitory competition between potential objects on opposite sides of a shared border; the winner is perceived as the figure, and the loser as the shapeless ground. Computational models and response time measures support this understanding but to date no online measure of inhibitory competition during figure-ground assignment has been reported. The current study assays electroencephalogram (EEG) alpha power as a measure of inhibitory competition during figure-ground assignment. Activity in the EEG alpha band has been linked to functional inhibition in the brain, and it has been proposed that increased alpha power reflects increased inhibition. In 2 experiments participants viewed silhouettes designed so that the insides would be perceived as figures. Real-world silhouettes depicted namable objects. Novel silhouettes depicted novel objects on the insides of their borders, but varied in the amount of hypothesized cross-border competition for figural status: In "Low-Competition" silhouettes, the borders suggested novel objects on the outside as well as on the inside. In "High-Competition" silhouettes the borders suggested portions of real-world objects on the outside; these compete with the figural properties favoring the inside as figure. Participants accurately categorized both types of novel silhouettes as "novel" objects and were unaware of the real world objects suggested on the outside of the High-Competition silhouettes. In both experiments, we observed more alpha power while participants viewed High- rather than Low-Competition novel silhouettes. These are the first results to show via an online index of neural activity that figure assignment entails inhibitory competition. Copyright © 2015 Elsevier Ltd. All rights reserved.

Autonomous power expert system

NASA Technical Reports Server (NTRS)

Ringer, Mark J.; Quinn, Todd M.

1990-01-01

The goal of the Autonomous Power System (APS) program is to develop and apply intelligent problem solving and control technologies to the Space Station Freedom Electrical Power Systems (SSF/EPS). The objectives of the program are to establish artificial intelligence/expert system technology paths, to create knowledge based tools with advanced human-operator interfaces, and to integrate and interface knowledge-based and conventional control schemes. This program is being developed at the NASA-Lewis. The APS Brassboard represents a subset of a 20 KHz Space Station Power Management And Distribution (PMAD) testbed. A distributed control scheme is used to manage multiple levels of computers and switchgear. The brassboard is comprised of a set of intelligent switchgear used to effectively switch power from the sources to the loads. The Autonomous Power Expert System (APEX) portion of the APS program integrates a knowledge based fault diagnostic system, a power resource scheduler, and an interface to the APS Brassboard. The system includes knowledge bases for system diagnostics, fault detection and isolation, and recommended actions. The scheduler autonomously assigns start times to the attached loads based on temporal and power constraints. The scheduler is able to work in a near real time environment for both scheduling and dynamic replanning.

Autonomous power expert system

NASA Technical Reports Server (NTRS)

Ringer, Mark J.; Quinn, Todd M.

1990-01-01

The goal of the Autonomous Power System (APS) program is to develop and apply intelligent problem solving and control technologies to the Space Station Freedom Electrical Power Systems (SSF/EPS). The objectives of the program are to establish artificial intelligence/expert system technology paths, to create knowledge based tools with advanced human-operator interfaces, and to integrate and interface knowledge-based and conventional control schemes. This program is being developed at the NASA-Lewis. The APS Brassboard represents a subset of a 20 KHz Space Station Power Management And Distribution (PMAD) testbed. A distributed control scheme is used to manage multiple levels of computers and switchgear. The brassboard is comprised of a set of intelligent switchgear used to effectively switch power from the sources to the loads. The Autonomous Power Expert System (APEX) portion of the APS program integrates a knowledge based fault diagnostic system, a power resource scheduler, and an interface to the APS Brassboard. The system includes knowledge bases for system diagnostics, fault detection and isolation, and recommended actions. The scheduler autonomously assigns start times to the attached loads based on temporal and power constraints. The scheduler is able to work in a near real time environment for both scheduling an dynamic replanning.

The benefits of computer-generated feedback for mathematics problem solving.

PubMed

Fyfe, Emily R; Rittle-Johnson, Bethany

2016-07-01

The goal of the current research was to better understand when and why feedback has positive effects on learning and to identify features of feedback that may improve its efficacy. In a randomized experiment, second-grade children received instruction on a correct problem-solving strategy and then solved a set of relevant problems. Children were assigned to receive no feedback, immediate feedback, or summative feedback from the computer. On a posttest the following day, feedback resulted in higher scores relative to no feedback for children who started with low prior knowledge. Immediate feedback was particularly effective, facilitating mastery of the material for children with both low and high prior knowledge. Results suggest that minimal computer-generated feedback can be a powerful form of guidance during problem solving. Copyright © 2016 Elsevier Inc. All rights reserved.

Frequency Assignments for HFDF Receivers in a Search and Rescue Network

DTIC Science & Technology

1990-03-01

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

29 CFR 785.37 - Home to work on special one-day assignment in another city.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 29 Labor 3 2011-07-01 2011-07-01 false Home to work on special one-day assignment in another city... another city. A problem arises when an employee who regularly works at a fixed location in one city is given a special 1-day work assignment in another city. For example, an employee who works in Washington...

29 CFR 785.37 - Home to work on special one-day assignment in another city.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 29 Labor 3 2010-07-01 2010-07-01 false Home to work on special one-day assignment in another city... another city. A problem arises when an employee who regularly works at a fixed location in one city is given a special 1-day work assignment in another city. For example, an employee who works in Washington...

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

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

Failure at the top: How power undermines collaborative performance.

PubMed

Hildreth, John Angus D; Anderson, Cameron

2016-02-01

All too commonly, we see groups of leaders fail to accomplish their stated goals when working together--legislators who cannot agree on a bill, heads of state who cannot draft meaningful environmental policy, or boards of trustees who make disastrous decisions for their school. The current research examines whether groups of leaders fail as often as they do in part because of the power each leader is accustomed to possessing among his or her constituents. In multiple studies we found that high power individuals, when working together in groups, performed worse than did other groups: individuals randomly assigned power in an initial task were less creative when they then worked together in groups on a subsequent task (Studies 1A and 4). Individuals with higher power who worked together in groups were also less likely to reach agreement on a difficult negotiation task, whether these groups comprised actual executives from an extant organization (Study 2) or participants randomly assigned power in the laboratory (Study 3). Mediation analyses suggest that groups of high power individuals performed worse because they fought over their relative status in the group, were less focused on the task, and shared information with each other less effectively. However, high power individuals were more effective when working on tasks that required less coordination: they were more creative (Studies 1B and 4) and persisted longer on a difficult task than other groups. Therefore, group processes are the key problem for groups of high power individuals when they work together. (c) 2016 APA, all rights reserved).

Development of a database for chemical mechanism assignments for volatile organic emissions.

PubMed

Carter, William P L

2015-10-01

The development of a database for making model species assignments when preparing total organic gas (TOG) emissions input for atmospheric models is described. This database currently has assignments of model species for 12 different gas-phase chemical mechanisms for over 1700 chemical compounds and covers over 3000 chemical categories used in five different anthropogenic TOG profile databases or output by two different biogenic emissions models. This involved developing a unified chemical classification system, assigning compounds to mixtures, assigning model species for the mechanisms to the compounds, and making assignments for unknown, unassigned, and nonvolatile mass. The comprehensiveness of the assignments, the contributions of various types of speciation categories to current profile and total emissions data, inconsistencies with existing undocumented model species assignments, and remaining speciation issues and areas of needed work are also discussed. The use of the system to prepare input for SMOKE, the Speciation Tool, and for biogenic models is described in the supplementary materials. The database, associated programs and files, and a users manual are available online at http://www.cert.ucr.edu/~carter/emitdb . Assigning air quality model species to the hundreds of emitted chemicals is a necessary link between emissions data and modeling effects of emissions on air quality. This is not easy and makes it difficult to implement new and more chemically detailed mechanisms in models. If done incorrectly, it is similar to errors in emissions speciation or the chemical mechanism used. Nevertheless, making such assignments is often an afterthought in chemical mechanism development and emissions processing, and existing assignments are usually undocumented and have errors and inconsistencies. This work is designed to address some of these problems.

The use of writing assignments to help students synthesize content in upper-level undergraduate biology courses.

PubMed

Sparks-Thissen, Rebecca L

2017-02-01

Biology education is undergoing a transformation toward a more student-centered, inquiry-driven classroom. Many educators have designed engaging assignments that are designed to help undergraduate students gain exposure to the scientific process and data analysis. One of these types of assignments is use of a grant proposal assignment. Many instructors have used these assignments in lecture-based courses to help students process information in the literature and apply that information to a novel problem such as design of an antiviral drug or a vaccine. These assignments have been helpful in engaging students in the scientific process in the absence of an inquiry-driven laboratory. This commentary discusses the application of these grant proposal writing assignments to undergraduate biology courses. © FEMS 2017. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

An abbreviated SNP panel for ancestry assignment of honeybees (Apis mellifera)

USDA-ARS?s Scientific Manuscript database

This paper examines whether an abbreviated panel of 37 single nucleotide polymorphisms (SNPs) has the same power as a larger and more expensive panel of 95 SNPs to assign ancestry of honeybees (Apis mellifera) to three ancestral lineages. We selected 37 SNPs from the original 95 SNP panel using alle...

A United Framework for Solving Multiagent Task Assignment Problems

DTIC Science & Technology

2007-12-01

Presented to the Faculty Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command in...Member Date Date Accepted: 170-e<.. 01 DateM.V.THOMAS Dean, Graduate School of E,ngineering and Management Air Force Institute of Technology AFIT...actions in two different problem groups: using shame [37] for autonomous robots navigating a minefield, and a waiter - refiller service environment [94

A test of geographic assignment using isotope tracers in feathers of known origin

USGS Publications Warehouse

Wunder, Michael B.; Kester, C.L.; Knopf, F.L.; Rye, R.O.

2005-01-01

We used feathers of known origin collected from across the breeding range of a migratory shorebird to test the use of isotope tracers for assigning breeding origins. We analyzed δD, δ13C, and δ15N in feathers from 75 mountain plover (Charadrius montanus) chicks sampled in 2001 and from 119 chicks sampled in 2002. We estimated parameters for continuous-response inverse regression models and for discrete-response Bayesian probability models from data for each year independently. We evaluated model predictions with both the training data and by using the alternate year as an independent test dataset. Our results provide weak support for modeling latitude and isotope values as monotonic functions of one another, especially when data are pooled over known sources of variation such as sample year or location. We were unable to make even qualitative statements, such as north versus south, about the likely origin of birds using both δD and δ13C in inverse regression models; results were no better than random assignment. Probability models provided better results and a more natural framework for the problem. Correct assignment rates were highest when considering all three isotopes in the probability framework, but the use of even a single isotope was better than random assignment. The method appears relatively robust to temporal effects and is most sensitive to the isotope discrimination gradients over which samples are taken. We offer that the problem of using isotope tracers to infer geographic origin is best framed as one of assignment, rather than prediction.

Encouraging Sixth-Grade Students' Problem-Solving Performance by Teaching through Problem Solving

ERIC Educational Resources Information Center

Bostic, Jonathan D.; Pape, Stephen J.; Jacobbe, Tim

2016-01-01

This teaching experiment provided students with continuous engagement in a problem-solving based instructional approach during one mathematics unit. Three sections of sixth-grade mathematics were sampled from a school in Florida, U.S.A. and one section was randomly assigned to experience teaching through problem solving. Students' problem-solving…

Plagiarism-Proofing Assignments

ERIC Educational Resources Information Center

Johnson, Doug

2004-01-01

Mr. Johnson has discovered that the higher the level of student engagement and creativity, the lower the probability of plagiarism. For teachers who would like to see such desirable results, he describes the characteristics of assignments that are most likely to produce them. Two scenarios of types of assignments that avoid plagiarism are…

Matching School Resources and Student Needs: Scheduling and Assignment Problems in High Schools Serving At-Risk Youth. Final Report.

ERIC Educational Resources Information Center

Natriello, Gary; And Others

By studying the process by which disadvantaged and low-achieving high school students are assigned to classes and special programs, how and why disadvantaged students are placed in inappropriate programs can be understood. Reasons exist to question the assumption that students are assigned to programs rationally on the basis of information about…

Investigation of the Effect of Assignment Projects on Mathematical Activity of Graduating Junior High School Students.

ERIC Educational Resources Information Center

Zehavi, Nurit

This study explored student mathematical activity in open problem-solving situations, derived from the work of Polya on problem solving and Skemp on intelligent learning and teaching. Assignment projects with problems for ninth-grade students were developed, whether they elicit the desired cognitive and cogno-affective goals was investigated, and…

Numerical integration of the N-body ring problem by recurrent power series

NASA Astrophysics Data System (ADS)

Navarro, Juan F.

2018-02-01

The aim of this article is to present a method for the integration of the equations of motion of the N-body ring problem by means of recurrent power series. We prove that the solution is convergent for any set of initial conditions, excluding those corresponding to binary collisions.

The role of a creative "joint assignment" project in biomedical engineering bachelor degree education.

PubMed

Jiehui Jiang; Yuting Zhang; Mi Zhou; Xiaosong Zheng; Zhuangzhi Yan

2017-07-01

Biomedical Engineering (BME) bachelor education aims to train qualified engineers who devote themselves to addressing biological and medical problems by integrating the technological, medical and biological knowledge. Design thinking and teamwork with other disciplines are necessary for biomedical engineers. In the current biomedical engineering education system of Shanghai University (SHU), however, such design thinking and teamwork through a practical project is lacking. This paper describes a creative "joint assignment" project in Shanghai University, China, which has provided BME bachelor students a two-year practical experience to work with students from multidisciplinary departments including sociology, mechanics, computer sciences, business and art, etc. To test the feasibility of this project, a twenty-month pilot project has been carried out from May 2015 to December 2016. The results showed that this pilot project obviously enhanced competitive power of BME students in Shanghai University, both in the capabilities of design thinking and teamwork.

Lights, Camera, Action! Learning about Management with Student-Produced Video Assignments

ERIC Educational Resources Information Center

Schultz, Patrick L.; Quinn, Andrew S.

2014-01-01

In this article, we present a proposal for fostering learning in the management classroom through the use of student-produced video assignments. We describe the potential for video technology to create active learning environments focused on problem solving, authentic and direct experiences, and interaction and collaboration to promote student…

Trends and problems in development of the power plants electrical part

NASA Astrophysics Data System (ADS)

Gusev, Yu. P.

2015-03-01

The article discusses some problems relating to development of the electrical part of modern nuclear and thermal power plants, which are stemming from the use of new process and electrical equipment, such as gas turbine units, power converters, and intellectual microprocessor devices in relay protection and automated control systems. It is pointed out that the failure rates of electrical equipment at Russian and foreign power plants tend to increase. The ongoing power plant technical refitting and innovative development processes generate the need to significantly widen the scope of research works on the electrical part of power plants and rendering scientific support to works on putting in use innovative equipment. It is indicated that one of main factors causing the growth of electrical equipment failures is that some of components of this equipment have insufficiently compatible dynamic characteristics. This, in turn may be due to lack or obsolescence of regulatory documents specifying the requirements for design solutions and operation of electric power equipment that incorporates electronic and microprocessor control and protection devices. It is proposed to restore the system of developing new and updating existing departmental regulatory technical documents that existed in the 1970s, one of the fundamental principles of which was placing long-term responsibility on higher schools and leading design institutions for rendering scientific-technical support to innovative development of components and systems forming the electrical part of power plants. This will make it possible to achieve lower failure rates of electrical equipment and to steadily improve the competitiveness of the Russian electric power industry and energy efficiency of generating companies.

Limit order placement as an utility maximization problem and the origin of power law distribution of limit order prices

NASA Astrophysics Data System (ADS)

Lillo, F.

2007-02-01

I consider the problem of the optimal limit order price of a financial asset in the framework of the maximization of the utility function of the investor. The analytical solution of the problem gives insight on the origin of the recently empirically observed power law distribution of limit order prices. In the framework of the model, the most likely proximate cause of this power law is a power law heterogeneity of traders' investment time horizons.

Environmental Problems Associated With Decommissioning The Chernobyl Nuclear Power Plant Cooling Pond

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

Farfan, E. B.; Jannik, G. T.; Marra, J. C.

2009-11-09

Decommissioning of nuclear power plants and other nuclear fuel cycle facilities has been an imperative issue lately. There exist significant experience and generally accepted recommendations on remediation of lands with residual radioactive contamination; however, there are hardly any such recommendations on remediation of cooling ponds that, in most cases, are fairly large water reservoirs. The literature only describes remediation of minor reservoirs containing radioactive silt (a complete closure followed by preservation) or small water reservoirs resulting in reestablishing natural water flows. Problems associated with remediation of river reservoirs resulting in flooding of vast agricultural areas also have been described. Inmore » addition, the severity of environmental and economic problems related to the remedial activities is shown to exceed any potential benefits of these activities. One of the large, highly contaminated water reservoirs that require either remediation or closure is Karachay Lake near the MAYAK Production Association in the Chelyabinsk Region of Russia where liquid radioactive waste had been deep well injected for a long period of time. Backfilling of Karachay Lake is currently in progress. It should be noted that secondary environmental problems associated with its closure are considered to be of less importance since sustaining Karachay Lake would have presented a much higher radiological risk. Another well-known highly contaminated water reservoir is the Chernobyl Nuclear Power Plant (ChNPP) Cooling Pond, decommissioning of which is planned for the near future. This study summarizes the environmental problems associated with the ChNPP Cooling Pond decommissioning.« less

ENVIRONMENTAL PROBLEMS ASSOCIATED WITH DECOMMISSIONING THE CHERNOBYL NUCLEAR POWER PLANT COOLING POND

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

Farfan, E.

2009-09-30

Decommissioning of nuclear power plants and other nuclear fuel cycle facilities has been an imperative issue lately. There exist significant experience and generally accepted recommendations on remediation of lands with residual radioactive contamination; however, there are hardly any such recommendations on remediation of cooling ponds that, in most cases, are fairly large water reservoirs. The literature only describes remediation of minor reservoirs containing radioactive silt (a complete closure followed by preservation) or small water reservoirs resulting in reestablishing natural water flows. Problems associated with remediation of river reservoirs resulting in flooding of vast agricultural areas also have been described. Inmore » addition, the severity of environmental and economic problems related to the remedial activities is shown to exceed any potential benefits of these activities. One of the large, highly contaminated water reservoirs that require either remediation or closure is Karachay Lake near the MAYAK Production Association in the Chelyabinsk Region of Russia where liquid radioactive waste had been deep well injected for a long period of time. Backfilling of Karachay Lake is currently in progress. It should be noted that secondary environmental problems associated with its closure are considered to be of less importance since sustaining Karachay Lake would have presented a much higher radiological risk. Another well-known highly contaminated water reservoir is the Chernobyl Nuclear Power Plant (ChNPP) Cooling Pond, decommissioning of which is planned for the near future. This study summarizes the environmental problems associated with the ChNPP Cooling Pond decommissioning.« less

Evaluation of Goal Programming for the Optimal Assignment of Inspectors to Construction Projects

DTIC Science & Technology

1988-09-01

Inputs ..... .............. 90 Equation Coefficients . ....... .. 90 Weights, Priorities and the AHP . . 91 Right-Hand Side Values ........ .. 91...the AHP Hierarchy with k Levels . . 36 3. Sample Matrix for Pairwise Comparison ........ .. 37 4. Assignment of I and p for Example Problem...Weights for Example Problem ... 61 3. AHP Weights and Coefficient ci, Values. ........ 63 vii AFIT/GEM/LSM/88S-16 Abstract The purpose of this study was

Problems on Divisibility of Binomial Coefficients

ERIC Educational Resources Information Center

Osler, Thomas J.; Smoak, James

2004-01-01

Twelve unusual problems involving divisibility of the binomial coefficients are represented in this article. The problems are listed in "The Problems" section. All twelve problems have short solutions which are listed in "The Solutions" section. These problems could be assigned to students in any course in which the binomial theorem and Pascal's…

Problems of standardizing and technical regulation in the electric power industry

NASA Astrophysics Data System (ADS)

Grabchak, E. P.

2016-12-01

A mandatory condition to ensure normal operation of a power system and efficiency in the sector is standardization and legal regulation of technological activities of electric power engineering entities and consumers. Compared to the times of USSR, the present-time technical guidance documents are not mandatory to follow in most cases, being of an advisory nature due to the lack of new ones. During the last five years, the industry has been showing a deterioration of the situation in terms of ensuring reliability and engineering controllability as a result of the dominant impact of short-term market stimuli and the differences in basic technological policies. In absence of clear requirements regarding the engineering aspects of such activities, production operation does not contribute to the preserving of technical integrity of the Russian power system, which leads to the loss of performance capability and controllability and causes disturbances in the power supply to consumers. The result of this problem is a high rate of accident incidence. The dynamics of accidents by the type of equipment is given, indicating a persisting trend of growth in the number of accidents, which are of a systematic nature. Several problematic aspects of engineering activities of electric power engineering entities, requiring standardization and legal regulation are pointed out: in the domestic power system, a large number of power electrotechnical and generating equipment operate along with systems of regulation, which do not comply with the principles and technical rules representing a framework where the Energy System of Russia is built and functioning

48 CFR 227.7010 - Assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... OF DEFENSE GENERAL CONTRACTING REQUIREMENTS PATENTS, DATA, AND COPYRIGHTS Infringement Claims, Licenses, and Assignments 227.7010 Assignments. (a) The clause at 252.227-7011 is an example which may be used in contracts of assignment of patent rights to the Government. (b) To facilitate proof of...

Performance evaluation of distributed wavelength assignment in WDM optical networks

NASA Astrophysics Data System (ADS)

Hashiguchi, Tomohiro; Wang, Xi; Morikawa, Hiroyuki; Aoyama, Tomonori

2004-04-01

In WDM wavelength routed networks, prior to a data transfer, a call setup procedure is required to reserve a wavelength path between the source-destination node pairs. A distributed approach to a connection setup can achieve a very high speed, while improving the reliability and reducing the implementation cost of the networks. However, along with many advantages, several major challenges have been posed by the distributed scheme in how the management and allocation of wavelength could be efficiently carried out. In this thesis, we apply a distributed wavelength assignment algorithm named priority based wavelength assignment (PWA) that was originally proposed for the use in burst switched optical networks to the problem of reserving wavelengths of path reservation protocols in the distributed control optical networks. Instead of assigning wavelengths randomly, this approach lets each node select the "safest" wavelengths based on the information of wavelength utilization history, thus unnecessary future contention is prevented. The simulation results presented in this paper show that the proposed protocol can enhance the performance of the system without introducing any apparent drawbacks.

Optimization of orbital assignment and specification of service areas in satellite communications

NASA Technical Reports Server (NTRS)

Wang, Cou-Way; Levis, Curt A.; Buyukdura, O. Merih

1987-01-01

The mathematical nature of the orbital and frequency assignment problem for communications satellites is explored, and it is shown that choosing the correct permutations of the orbit locations and frequency assignments is an important step in arriving at values which satisfy the signal-quality requirements. Two methods are proposed to achieve better spectrum/orbit utilization. The first, called the delta S concept, leads to orbital assignment solutions via either mixed-integer or restricted basis entry linear programming techniques; the method guarantees good single-entry carrier-to-interference ratio results. In the second, a basis for specifying service areas is proposed for the Fixed Satellite Service. It is suggested that service areas should be specified according to the communications-demand density in conjunction with the delta S concept in order to enable the system planner to specify more satellites and provide more communications supply.

Pre-service teachers’ challenges in presenting mathematical problems

NASA Astrophysics Data System (ADS)

Desfitri, R.

2018-01-01

The purpose of this study was to analyzed how pre-service teachers prepare and assigned tasks or assignments in teaching practice situations. This study was also intended to discuss about kind of tasks or assignments they gave to students. Participants of this study were 15 selected pre-service mathematics teachers from mathematics education department who took part on microteaching class as part of teaching preparation program. Based on data obtained, it was occasionally found that there were hidden errors on questions or tasks assigned by pre-service teachers which might lead their students not to be able to reach a logical or correct answer. Although some answers might seem to be true, they were illogical or unfavourable. It is strongly recommended that pre-service teachers be more careful when posing mathematical problems so that students do not misunderstand the problems or the concepts, since both teachers and students were sometimes unaware of errors in problems being worked on.

43 CFR 2521.3 - Assignment.

Code of Federal Regulations, 2011 CFR

2011-10-01

... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused to...

43 CFR 2521.3 - Assignment.

Code of Federal Regulations, 2013 CFR

2013-10-01

... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused to...

43 CFR 2521.3 - Assignment.

Code of Federal Regulations, 2014 CFR

2014-10-01

... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused to...

43 CFR 2521.3 - Assignment.

Code of Federal Regulations, 2012 CFR

2012-10-01

... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused to...

Ant colony optimization for solving university facility layout problem

NASA Astrophysics Data System (ADS)

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

2013-04-01

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

Cell transmission model of dynamic assignment for urban rail transit networks.

PubMed

Xu, Guangming; Zhao, Shuo; Shi, Feng; Zhang, Feilian

2017-01-01

For urban rail transit network, the space-time flow distribution can play an important role in evaluating and optimizing the space-time resource allocation. For obtaining the space-time flow distribution without the restriction of schedules, a dynamic assignment problem is proposed based on the concept of continuous transmission. To solve the dynamic assignment problem, the cell transmission model is built for urban rail transit networks. The priority principle, queuing process, capacity constraints and congestion effects are considered in the cell transmission mechanism. Then an efficient method is designed to solve the shortest path for an urban rail network, which decreases the computing cost for solving the cell transmission model. The instantaneous dynamic user optimal state can be reached with the method of successive average. Many evaluation indexes of passenger flow can be generated, to provide effective support for the optimization of train schedules and the capacity evaluation for urban rail transit network. Finally, the model and its potential application are demonstrated via two numerical experiments using a small-scale network and the Beijing Metro network.

47 CFR 73.3540 - Application for voluntary assignment or transfer of control.

Code of Federal Regulations, 2010 CFR

2010-10-01

... control of a corporate licensee or permittee for an FM or TV translator station, a low power TV station and any associated auxiliary station, such as translator microwave relay stations and UHF translator... Licensee or Permittee, or Assignment of License or Permit for an FM or TV translator Station, or a Low...

Structural Case Assignment in Korean

ERIC Educational Resources Information Center

Koak, Heeshin

2012-01-01

In this dissertation, I aim to provide a theory on the distribution of structural Case in Korean. I propose the following Structural Case Assignment Hypothesis (SCAH) regarding the assignment of structural Case: "Structural Case is assigned by phase heads (C: nominative; v: accusative) to every argument in the c-command domain of the phase…

Tolerance assignment in optical design

NASA Astrophysics Data System (ADS)

Youngworth, Richard Neil

2002-09-01

Tolerance assignment is necessary in any engineering endeavor because fabricated systems---due to the stochastic nature of manufacturing and assembly processes---necessarily deviate from the nominal design. This thesis addresses the problem of optical tolerancing. The work can logically be split into three different components that all play an essential role. The first part addresses the modeling of manufacturing errors in contemporary fabrication and assembly methods. The second component is derived from the design aspect---the development of a cost-based tolerancing procedure. The third part addresses the modeling of image quality in an efficient manner that is conducive to the tolerance assignment process. The purpose of the first component, modeling manufacturing errors, is twofold---to determine the most critical tolerancing parameters and to understand better the effects of fabrication errors. Specifically, mid-spatial-frequency errors, typically introduced in sub-aperture grinding and polishing fabrication processes, are modeled. The implication is that improving process control and understanding better the effects of the errors makes the task of tolerance assignment more manageable. Conventional tolerancing methods do not directly incorporate cost. Consequently, tolerancing approaches tend to focus more on image quality. The goal of the second part of the thesis is to develop cost-based tolerancing procedures that facilitate optimum system fabrication by generating the loosest acceptable tolerances. This work has the potential to impact a wide range of optical designs. The third element, efficient modeling of image quality, is directly related to the cost-based optical tolerancing method. Cost-based tolerancing requires efficient and accurate modeling of the effects of errors on the performance of optical systems. Thus it is important to be able to compute the gradient and the Hessian, with respect to the parameters that need to be toleranced, of the figure

AssignFit: a program for simultaneous assignment and structure refinement from solid-state NMR spectra

PubMed Central

Tian, Ye; Schwieters, Charles D.; Opella, Stanley J.; Marassi, Francesca M.

2011-01-01

AssignFit is a computer program developed within the XPLOR-NIH package for the assignment of dipolar coupling (DC) and chemical shift anisotropy (CSA) restraints derived from the solid-state NMR spectra of protein samples with uniaxial order. The method is based on minimizing the difference between experimentally observed solid-state NMR spectra and the frequencies back calculated from a structural model. Starting with a structural model and a set of DC and CSA restraints grouped only by amino acid type, as would be obtained by selective isotopic labeling, AssignFit generates all of the possible assignment permutations and calculates the corresponding atomic coordinates oriented in the alignment frame, together with the associated set of NMR frequencies, which are then compared with the experimental data for best fit. Incorporation of AssignFit in a simulated annealing refinement cycle provides an approach for simultaneous assignment and structure refinement (SASR) of proteins from solid-state NMR orientation restraints. The methods are demonstrated with data from two integral membrane proteins, one α-helical and one β-barrel, embedded in phospholipid bilayer membranes. PMID:22036904

Improved Evolutionary Programming with Various Crossover Techniques for Optimal Power Flow Problem

NASA Astrophysics Data System (ADS)

Tangpatiphan, Kritsana; Yokoyama, Akihiko

This paper presents an Improved Evolutionary Programming (IEP) for solving the Optimal Power Flow (OPF) problem, which is considered as a non-linear, non-smooth, and multimodal optimization problem in power system operation. The total generator fuel cost is regarded as an objective function to be minimized. The proposed method is an Evolutionary Programming (EP)-based algorithm with making use of various crossover techniques, normally applied in Real Coded Genetic Algorithm (RCGA). The effectiveness of the proposed approach is investigated on the IEEE 30-bus system with three different types of fuel cost functions; namely the quadratic cost curve, the piecewise quadratic cost curve, and the quadratic cost curve superimposed by sine component. These three cost curves represent the generator fuel cost functions with a simplified model and more accurate models of a combined-cycle generating unit and a thermal unit with value-point loading effect respectively. The OPF solutions by the proposed method and Pure Evolutionary Programming (PEP) are observed and compared. The simulation results indicate that IEP requires less computing time than PEP with better solutions in some cases. Moreover, the influences of important IEP parameters on the OPF solution are described in details.

Quality Assurance of UMLS Semantic Type Assignments Using SNOMED CT Hierarchies.

PubMed

Gu, H; Chen, Y; He, Z; Halper, M; Chen, L

2016-01-01

The Unified Medical Language System (UMLS) is one of the largest biomedical terminological systems, with over 2.5 million concepts in its Metathesaurus repository. The UMLS's Semantic Network (SN) with its collection of 133 high-level semantic types serves as an abstraction layer on top of the Metathesaurus. In particular, the SN elaborates an aspect of the Metathesaurus's concepts via the assignment of one or more types to each concept. Due to the scope and complexity of the Metathesaurus, errors are all but inevitable in this semantic-type assignment process. To develop a semi-automated methodology to help assure the quality of semantic-type assignments within the UMLS. The methodology uses a cross-validation strategy involving SNOMED CT's hierarchies in combination with UMLS semantic types. Semantically uniform, disjoint concept groups are generated programmatically by partitioning the collection of all concepts in the same SNOMED CT hierarchy according to their respective semantic-type assignments in the UMLS. Domain experts are then called upon to review the concepts in any group having a small number of concepts. It is our hypothesis that a semantic-type assignment combination applicable only to a very small number of concepts in a SNOMED CT hierarchy is an indicator of potential problems. The methodology was applied to the UMLS 2013AA release along with the SNOMED CT from January 2013. An overall error rate of 33% was found for concepts proposed by the quality-assurance methodology. Supporting our hypothesis, that number was four times higher than the error rate found in control samples. The results show that the quality-assurance methodology can aid in effective and efficient identification of UMLS semantic-type assignment errors.

Congenital adrenal hyperplasia: problems with developmental anomalies of the external genitalia and sex assignment.

PubMed

Al-Maghribi, Hussein

2007-09-01

A retrospective study was performed on all patients with congenital adrenal hyperplasia (CAH) who were followed up at the King Hussein Medical Center (KHMC), Amman, Jordan, during the period from January 1996 to June 2006. The aim was to evaluate the clinical features, special problems, and corrective interventions for these patients. The records of 73 children (39 were genetic females and 34 were genetic males) with CAH were reviewed in the study. The age of the patients at last follow-up was between five months and 18 years. Diagnostic criteria for CAH were typical clinical features of the illness (salt loss, dehydration, virilization, macrogenitosomia, ambiguous genitalia, and accelerated growth) and typical hormonal abnormalities (decreased serum cortisol and elevated serum 17-hydroxyprogesterone). There were 62 patients with classical presentation; among them, salt-wasting (SW) form was seen in 41 patients (66%). There were 5 patients with the nonclassic form, while 6 others had cryptic presentation. Seven patients (9%) had hypertension, mostly due to salt-retaining CAH. Among the 39 females with CAH, 27 had developed mental anomalies of the external genitalia; 20 of them underwent surgical interventions of their external genitalia. Fourteen genetically female patients were wrongly diagnosed as 'male sex' at birth due to severe virilization. Seven of them were reassigned 'female sex' socially, legally, and surgically; the parents of one of them (a four-year-old girl) wanted the surgical intervention postponed for two to three years. Hysterectomy and gonadectomy were carried out for 6 of the other 7 patients who chose to keep the male gender. Our study indicates that newborns with developmental anomalies of the external genitalia should be diagnosed as early as possible so that medical, psychological, and social complications are minimized. A neonatal screening program for such a disorder can identify infants at risk for the development of life

De-Coding Writing Assignments.

ERIC Educational Resources Information Center

Simon, Linda

1991-01-01

Argues that understanding assignments is the first step toward successful college writing. Urges instructors to support students by helping them to decode assignments. Breaks down instructions into individual tasks including (1) writing an essay, (2) examining an issue, (3) reviewing articles and books, and (4) focusing on some texts. Defines each…

Space solar power stations. Problems of energy generation and using its on the earth surface and nearest cosmos

NASA Astrophysics Data System (ADS)

Sinkevich, OA; Gerasimov, DN; Glazkov, VV

2017-11-01

Three important physical and technical problems for solar power stations (SPS) are considered: collection of solar energy and effective conversion of this energy to electricity in space power stations, energy transportation by the microwave beam to the Earth surface and direct utilization of the microwave beam energy for global environmental problems. Effectiveness of solar energy conversion into electricity in space power stations using gas and steam turbines plants, and magneto-hydrodynamic generator (MHDG) are analyzed. The closed cycle MHDG working on non-equilibrium magnetized plasmas of inert gases seeded with the alkaline metal vapors are considered. The special emphases are placed on MHDG and gas-turbine installations that are operating without compressor. Also opportunities for using the produced by space power stations energy for ecological needs on Earth and in Space are discussed.

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel

PubMed Central

Sakin, Sayef Azad; Alamri, Atif; Tran, Nguyen H.

2017-01-01

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies. PMID:29215591

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel.

PubMed

Sakin, Sayef Azad; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Alamri, Atif; Tran, Nguyen H; Fortino, Giancarlo

2017-12-07

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

Mixed pyruvate labeling enables backbone resonance assignment of large proteins using a single experiment.

PubMed

Robson, Scott A; Takeuchi, Koh; Boeszoermenyi, Andras; Coote, Paul W; Dubey, Abhinav; Hyberts, Sven; Wagner, Gerhard; Arthanari, Haribabu

2018-01-24

Backbone resonance assignment is a critical first step in the investigation of proteins by NMR. This is traditionally achieved with a standard set of experiments, most of which are not optimal for large proteins. Of these, HNCA is the most sensitive experiment that provides sequential correlations. However, this experiment suffers from chemical shift degeneracy problems during the assignment procedure. We present a strategy that increases the effective resolution of HNCA and enables near-complete resonance assignment using this single HNCA experiment. We utilize a combination of 2- 13 C and 3- 13 C pyruvate as the carbon source for isotope labeling, which suppresses the one bond ( 1 J αβ ) coupling providing enhanced resolution for the Cα resonance and amino acid-specific peak shapes that arise from the residual coupling. Using this approach, we can obtain near-complete (>85%) backbone resonance assignment of a 42 kDa protein using a single HNCA experiment.

47 CFR 74.1202 - Frequency assignment.

Code of Federal Regulations, 2013 CFR

2013-10-01

... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... broadcast booster station will be assigned the channel assigned to its primary station. [35 FR 15388, Oct. 2...

47 CFR 74.1202 - Frequency assignment.

Code of Federal Regulations, 2011 CFR

2011-10-01

... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... broadcast booster station will be assigned the channel assigned to its primary station. [35 FR 15388, Oct. 2...

47 CFR 74.1202 - Frequency assignment.

Code of Federal Regulations, 2012 CFR

2012-10-01

... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... broadcast booster station will be assigned the channel assigned to its primary station. [35 FR 15388, Oct. 2...

47 CFR 74.1202 - Frequency assignment.

Code of Federal Regulations, 2014 CFR

2014-10-01

... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... broadcast booster station will be assigned the channel assigned to its primary station. [35 FR 15388, Oct. 2...

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

PubMed Central

Wan, Long

2014-01-01

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

Multi-topic assignment for exploratory navigation of consumer health information in NetWellness using formal concept analysis.

PubMed

Cui, Licong; Xu, Rong; Luo, Zhihui; Wentz, Susan; Scarberry, Kyle; Zhang, Guo-Qiang

2014-08-03

Finding quality consumer health information online can effectively bring important public health benefits to the general population. It can empower people with timely and current knowledge for managing their health and promoting wellbeing. Despite a popular belief that search engines such as Google can solve all information access problems, recent studies show that using search engines and simple search terms is not sufficient. Our objective is to provide an approach to organizing consumer health information for navigational exploration, complementing keyword-based direct search. Multi-topic assignment to health information, such as online questions, is a fundamental step for navigational exploration. We introduce a new multi-topic assignment method combining semantic annotation using UMLS concepts (CUIs) and Formal Concept Analysis (FCA). Each question was tagged with CUIs identified by MetaMap. The CUIs were filtered with term-frequency and a new term-strength index to construct a CUI-question context. The CUI-question context and a topic-subject context were used for multi-topic assignment, resulting in a topic-question context. The topic-question context was then directly used for constructing a prototype navigational exploration interface. Experimental evaluation was performed on the task of automatic multi-topic assignment of 99 predefined topics for about 60,000 consumer health questions from NetWellness. Using example-based metrics, suitable for multi-topic assignment problems, our method achieved a precision of 0.849, recall of 0.774, and F₁ measure of 0.782, using a reference standard of 278 questions with manually assigned topics. Compared to NetWellness' original topic assignment, a 36.5% increase in recall is achieved with virtually no sacrifice in precision. Enhancing the recall of multi-topic assignment without sacrificing precision is a prerequisite for achieving the benefits of navigational exploration. Our new multi-topic assignment method

Multi-topic assignment for exploratory navigation of consumer health information in NetWellness using formal concept analysis

PubMed Central

2014-01-01

Background Finding quality consumer health information online can effectively bring important public health benefits to the general population. It can empower people with timely and current knowledge for managing their health and promoting wellbeing. Despite a popular belief that search engines such as Google can solve all information access problems, recent studies show that using search engines and simple search terms is not sufficient. Our objective is to provide an approach to organizing consumer health information for navigational exploration, complementing keyword-based direct search. Multi-topic assignment to health information, such as online questions, is a fundamental step for navigational exploration. Methods We introduce a new multi-topic assignment method combining semantic annotation using UMLS concepts (CUIs) and Formal Concept Analysis (FCA). Each question was tagged with CUIs identified by MetaMap. The CUIs were filtered with term-frequency and a new term-strength index to construct a CUI-question context. The CUI-question context and a topic-subject context were used for multi-topic assignment, resulting in a topic-question context. The topic-question context was then directly used for constructing a prototype navigational exploration interface. Results Experimental evaluation was performed on the task of automatic multi-topic assignment of 99 predefined topics for about 60,000 consumer health questions from NetWellness. Using example-based metrics, suitable for multi-topic assignment problems, our method achieved a precision of 0.849, recall of 0.774, and F1 measure of 0.782, using a reference standard of 278 questions with manually assigned topics. Compared to NetWellness’ original topic assignment, a 36.5% increase in recall is achieved with virtually no sacrifice in precision. Conclusion Enhancing the recall of multi-topic assignment without sacrificing precision is a prerequisite for achieving the benefits of navigational exploration. Our

A design for an intelligent monitor and controller for space station electrical power using parallel distributed problem solving

NASA Technical Reports Server (NTRS)

Morris, Robert A.

1990-01-01

The emphasis is on defining a set of communicating processes for intelligent spacecraft secondary power distribution and control. The computer hardware and software implementation platform for this work is that of the ADEPTS project at the Johnson Space Center (JSC). The electrical power system design which was used as the basis for this research is that of Space Station Freedom, although the functionality of the processes defined here generalize to any permanent manned space power control application. First, the Space Station Electrical Power Subsystem (EPS) hardware to be monitored is described, followed by a set of scenarios describing typical monitor and control activity. Then, the parallel distributed problem solving approach to knowledge engineering is introduced. There follows a two-step presentation of the intelligent software design for secondary power control. The first step decomposes the problem of monitoring and control into three primary functions. Each of the primary functions is described in detail. Suggestions for refinements and embelishments in design specifications are given.

Optimizing Marine Security Guard Assignments

DTIC Science & Technology

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...Marine-billet assignment using similar fit criteria, such as rank and gender . 3. Minimize the amount of movement when filling the billets. That is, their...more than once. Gender Female MSGs will not be assigned to embassies that are not configured for females. DC Only DC-qualified MSGs are assigned to DC

IMU-to-Segment Assignment and Orientation Alignment for the Lower Body Using Deep Learning

PubMed Central

2018-01-01

Human body motion analysis based on wearable inertial measurement units (IMUs) receives a lot of attention from both the research community and the and industrial community. This is due to the significant role in, for instance, mobile health systems, sports and human computer interaction. In sensor based activity recognition, one of the major issues for obtaining reliable results is the sensor placement/assignment on the body. For inertial motion capture (joint kinematics estimation) and analysis, the IMU-to-segment (I2S) assignment and alignment are central issues to obtain biomechanical joint angles. Existing approaches for I2S assignment usually rely on hand crafted features and shallow classification approaches (e.g., support vector machines), with no agreement regarding the most suitable features for the assignment task. Moreover, estimating the complete orientation alignment of an IMU relative to the segment it is attached to using a machine learning approach has not been shown in literature so far. This is likely due to the high amount of training data that have to be recorded to suitably represent possible IMU alignment variations. In this work, we propose online approaches for solving the assignment and alignment tasks for an arbitrary amount of IMUs with respect to a biomechanical lower body model using a deep learning architecture and windows of 128 gyroscope and accelerometer data samples. For this, we combine convolutional neural networks (CNNs) for local filter learning with long-short-term memory (LSTM) recurrent networks as well as generalized recurrent units (GRUs) for learning time dynamic features. The assignment task is casted as a classification problem, while the alignment task is casted as a regression problem. In this framework, we demonstrate the feasibility of augmenting a limited amount of real IMU training data with simulated alignment variations and IMU data for improving the recognition/estimation accuracies. With the proposed

ELECTRICAL AND ELECTRONIC INDUSTRIAL CONTROL. D-C MAGNETIC MOTOR CONTROL, UNIT 7, ASSIGNMENTS.

ERIC Educational Resources Information Center

SUTTON, MACK C.

THIS GUIDE IS FOR INDIVIDUAL STUDENT USE IN STUDYING DIRECT CURRENT MAGNETIC MOTOR CONTROL IN ELECTRICAL-ELECTRONIC PROGRAMS. IT WAS DEVELOPED BY AN INSTRUCTIONAL MATERIALS SPECIALIST AND ADVISERS. EACH OF THE 15 ASSIGNMENT SHEETS PROVIDES THE LESSON SUBJECT, PURPOSE, INTRODUCTORY INFORMATION, STUDY REFERENCES, AND PROBLEMS. SOME OF THE LESSONS…

The Thinnest Path Problem

DTIC Science & Technology

2016-07-22

their corresponding transmission powers . At first glance, one may wonder whether the thinnest path problem is simply a shortest path problem with the...nature of the shortest path problem. Another aspect that complicates the problem is the choice of the transmission power at each node (within a maximum...fixed transmission power at each node (in this case, the resulting hypergraph degenerates to a standard graph), the thinnest path problem is NP

Smart Power Supply for Battery-Powered Systems

NASA Technical Reports Server (NTRS)

Krasowski, Michael J.; Greer, Lawrence; Prokop, Norman F.; Flatico, Joseph M.

2010-01-01

A power supply for battery-powered systems has been designed with an embedded controller that is capable of monitoring and maintaining batteries, charging hardware, while maintaining output power. The power supply is primarily designed for rovers and other remote science and engineering vehicles, but it can be used in any battery alone, or battery and charging source applications. The supply can function autonomously, or can be connected to a host processor through a serial communications link. It can be programmed a priori or on the fly to return current and voltage readings to a host. It has two output power busses: a constant 24-V direct current nominal bus, and a programmable bus for output from approximately 24 up to approximately 50 V. The programmable bus voltage level, and its output power limit, can be changed on the fly as well. The power supply also offers options to reduce the programmable bus to 24 V when the set power limit is reached, limiting output power in the case of a system fault detected in the system. The smart power supply is based on an embedded 8051-type single-chip microcontroller. This choice was made in that a credible progression to flight (radiation hard, high reliability) can be assumed as many 8051 processors or gate arrays capable of accepting 8051-type core presently exist and will continue to do so for some time. To solve the problem of centralized control, this innovation moves an embedded microcontroller to the power supply and assigns it the task of overseeing the operation and charging of the power supply assets. This embedded processor is connected to the application central processor via a serial data link such that the central processor can request updates of various parameters within the supply, such as battery current, bus voltage, remaining power in battery estimations, etc. This supply has a direct connection to the battery bus for common (quiescent) power application. Because components from multiple vendors may have

Adaptable Assignment

DOT National Transportation Integrated Search

1997-01-01

This paper reports on a practical, simple method for adjusting a vehicle trip table so that the resulting assignments more closely match available traffic counts. "Practical" means that this is not purely a research effort - the procedure described h...

Bag-of-features based medical image retrieval via multiple assignment and visual words weighting.

PubMed

Wang, Jingyan; Li, Yongping; Zhang, Ying; Wang, Chao; Xie, Honglan; Chen, Guoling; Gao, Xin

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.

Persistence in Expatriate Academic Assignments in the United Arab Emirates: A Case Study

ERIC Educational Resources Information Center

Ryan, Gerard D.

2012-01-01

This study explored factors that influenced persistence in expatriate academic assignments in the United Arab Emirates (UAE). Specifically, the problem that was addressed was an investigation of the reasons why some expatriate academics declared their intent to leave an academic position within one year of arrival while others choose to extend…

28 CFR 301.103 - Inmate work assignments.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 28 Judicial Administration 2 2014-07-01 2014-07-01 false Inmate work assignments. 301.103 Section... COMPENSATION General § 301.103 Inmate work assignments. The unit team of each inmate, which ordinarily designates work assignments, or whoever makes work assignments, shall review appropriate medical records...

28 CFR 301.103 - Inmate work assignments.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 28 Judicial Administration 2 2012-07-01 2012-07-01 false Inmate work assignments. 301.103 Section... COMPENSATION General § 301.103 Inmate work assignments. The unit team of each inmate, which ordinarily designates work assignments, or whoever makes work assignments, shall review appropriate medical records...

28 CFR 301.103 - Inmate work assignments.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 28 Judicial Administration 2 2011-07-01 2011-07-01 false Inmate work assignments. 301.103 Section... COMPENSATION General § 301.103 Inmate work assignments. The unit team of each inmate, which ordinarily designates work assignments, or whoever makes work assignments, shall review appropriate medical records...

28 CFR 301.103 - Inmate work assignments.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 28 Judicial Administration 2 2013-07-01 2013-07-01 false Inmate work assignments. 301.103 Section... COMPENSATION General § 301.103 Inmate work assignments. The unit team of each inmate, which ordinarily designates work assignments, or whoever makes work assignments, shall review appropriate medical records...

28 CFR 544.74 - Work assignment limitations.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Work assignment limitations. 544.74... EDUCATION Literacy Program § 544.74 Work assignment limitations. These limitations on work assignment... order to be considered for a commissary work assignment above minimum pay level, an institution work...

Interlocked Problem Posing and Children's Problem Posing Performance in Free Structured Situations

ERIC Educational Resources Information Center

Cankoy, Osman

2014-01-01

The aim of this study is to explore the mathematical problem posing performance of students in free structured situations. Two classes of fifth grade students (N = 30) were randomly assigned to experimental and control groups. The categories of the problems posed in free structured situations by the 2 groups of students were studied through…

DSSPcont: continuous secondary structure assignments for proteins

PubMed Central

Carter, Phil; Andersen, Claus A. F.; Rost, Burkhard

2003-01-01

The DSSP program automatically assigns the secondary structure for each residue from the three-dimensional co-ordinates of a protein structure to one of eight states. However, discrete assignments are incomplete in that they cannot capture the continuum of thermal fluctuations. Therefore, DSSPcont (http://cubic.bioc.columbia.edu/services/DSSPcont) introduces a continuous assignment of secondary structure that replaces ‘static’ by ‘dynamic’ states. Technically, the continuum results from calculating weighted averages over 10 discrete DSSP assignments with different hydrogen bond thresholds. A DSSPcont assignment for a particular residue is a percentage likelihood of eight secondary structure states, derived from a weighted average of the ten DSSP assignments. The continuous assignments have two important features: (i) they reflect the structural variations due to thermal fluctuations as detected by NMR spectroscopy; and (ii) they reproduce the structural variation between many NMR models from one single model. Therefore, functionally important variation can be extracted from a single X-ray structure using the continuous assignment procedure. PMID:12824310

24 CFR 221.770 - Assignment option.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment option. 221.770 Section... § 221.770 Assignment option. A mortgagee holding a conditional or firm commitment issued on or before... mortgagee's approved underwriter on or before November 30, 1983) has the option to assign, transfer and...

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

PubMed

Choi, Sangil; Park, Jong Hyuk

2016-12-02

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

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

PubMed Central

Choi, Sangil; Park, Jong Hyuk

2016-01-01

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

24 CFR 221.255 - Assignment option.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment option. 221.255 Section... Assignment option. (a) A mortgagee holding a mortgage insured pursuant to a conditional or firm commitment issued on or before November 30, 1983 has the option to assign, transfer and deliver to the Commissioner...

48 CFR 1552.211-74 - Work assignments.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 48 Federal Acquisition Regulations System 6 2011-10-01 2011-10-01 false Work assignments. 1552.211... Work assignments. As prescribed in 1511.011-74, insert the following contract clause in cost-reimbursement type term form contracts when work assignments are to be used. Work Assignments (APR 1984) (a) The...

"Stroke Your Thoroughbreds and Kick Your Donkeys": Power and the Secondary Administrative Distribution of Teaching Assignments

ERIC Educational Resources Information Center

Lieberman, Daina S.

2017-01-01

There is evidence to suggest that the teaching assignment process affects teacher career decisions and therefore teacher retention (Andrews & Quinn, 2004; Donaldson & Johnson, 2010; Feng, 2010; Gardner, 2010; Loeb, Kalogrides, & Beteille, 2012; Ost & Schiman, 2015). Understanding what administrators believe influences their…

The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres

NASA Astrophysics Data System (ADS)

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.

Source selection problem of competitive power plants under government intervention: a game theory approach

NASA Astrophysics Data System (ADS)

Mahmoudi, Reza; Hafezalkotob, Ashkan; Makui, Ahmad

2014-06-01

Pollution and environmental protection in the present century are extremely significant global problems. Power plants as the largest pollution emitting industry have been the cause of a great deal of scientific researches. The fuel or source type used to generate electricity by the power plants plays an important role in the amount of pollution produced. Governments should take visible actions to promote green fuel. These actions are often called the governmental financial interventions that include legislations such as green subsidiaries and taxes. In this paper, by considering the government role in the competition of two power plants, we propose a game theoretical model that will help the government to determine the optimal taxes and subsidies. The numerical examples demonstrate how government could intervene in a competitive market of electricity to achieve the environmental objectives and how power plants maximize their utilities in each energy source. The results also reveal that the government's taxes and subsidiaries effectively influence the selected fuel types of power plants in the competitive market.

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

NASA Technical Reports Server (NTRS)

Mielke, R. R.; Tung, L. J.; Carraway, P. I., III

1984-01-01

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The full state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system rmain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

NASA Technical Reports Server (NTRS)

Mielke, R. R.; Tung, L. J.; Carraway, P. I., III

1985-01-01

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The fulll state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system remain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

75 FR 9797 - Policies To Promote Rural Radio Service and To Streamline Allotment and Assignment Procedures

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-04

... Media Bureau and the Wireless Telecommunications Bureau (collectively, the ``Bureaus'') delegated... relationship with the federal government as domestic dependent nations with inherent sovereign powers over... suggested by commenters. First, the Commission will allow assignments or transfers within the four-year...

7 CFR 784.15 - Assignments.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 7 2010-01-01 2010-01-01 false Assignments. 784.15 Section 784.15 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS 2004 EWE LAMB REPLACEMENT AND RETENTION PAYMENT PROGRAM § 784.15 Assignments. Any person...

Exogenous spatial attention influences figure-ground assignment.

PubMed

Vecera, Shaun P; Flevaris, Anastasia V; Filapek, Joseph C

2004-01-01

In a hierarchical stage account of vision, figure-ground assignment is thought to be completed before the operation of focal spatial attention. Results of previous studies have supported this account by showing that unpredictive, exogenous spatial precues do not influence figure-ground assignment, although voluntary attention can influence figure-ground assignment. However, in these studies, attention was not summoned directly to a region in a figure-ground display. In three experiments, we addressed the relationship between figure-ground assignment and visuospatial attention. In Experiment 1, we replicated the finding that exogenous precues do not influence figure-ground assignment when they direct attention outside of a figure-ground stimulus. In Experiment 2, we demonstrated that exogenous attention can influence figure-ground assignment if it is directed to one of the regions in a figure-ground stimulus. In Experiment 3, we demonstrated that exogenous attention can influence figure-ground assignment in displays that contain a Gestalt figure-ground cue; this result suggests that figure-ground processes are not entirely completed prior to the operation of focal spatial attention. Exogenous spatial attention acts as a cue for figure-ground assignment and can affect the outcome of figure-ground processes.

Nuclear power supplies: Their potential and the practical problems to their achievement for space missions

NASA Technical Reports Server (NTRS)

Colston, B. W.

1986-01-01

Various issues associated with getting technology development of nuclear power systems moving at a pace which will support the anticipated need for such systems in later years is discussed. The projected power needs of such advanced space elements as growth space stations and lunar and planetary vehicles and bases are addressed briefly, and the relevance of nuclear power systems is discussed. A brief history and status of the U.S. nuclear reactor systems is provided, and some of the problems (real and/or perceived) are dealt with briefly. Key areas on which development attention should be focused in the near future are identified, and a suggested approach is recommended to help accelerate the process.

Guaranteed cost control with poles assignment for a flexible air-breathing hypersonic vehicle

NASA Astrophysics Data System (ADS)

Li, Hongyi; Si, Yulin; Wu, Ligang; Hu, Xiaoxiang; Gao, Huijun

2011-05-01

This article investigates the problem of guaranteed cost control for a flexible air-breathing hypersonic vehicle (FAHV). The FAHV includes intricate coupling between the engine and flight dynamics as well as complex interplay between flexible and rigid modes, which results in an intractable system for the control design. A longitudinal model is adopted for control design due to the complexity of the vehicle. First, for a highly nonlinear and coupled FAHV, a linearised model is established around the trim condition, which includes the state of altitude, velocity, angle of attack, pitch angle and pitch rate, etc. Secondly, by using the Lyapunov approach, performance analysis is carried out for the resulting closed-loop FAHV system, whose criterion with respect to guaranteed performance cost and poles assignment is expressed in the framework of linear matrix inequalities (LMIs). The established criterion exhibits a kind of decoupling between the Lyapunov positive-definite matrices to be determined and the FAHV system matrices, which is enabled by the introduction of additional slack matrix variables. Thirdly, a convex optimisation problem with LMI constraints is formulated for designing an admissible controller, which guarantees a prescribed performance cost with the simultaneous consideration of poles assignment for the resulting closed-loop system. Finally, some simulation results are provided to show that the guaranteed cost controller could assign the poles into the desired regional and achieve excellent reference altitude and velocity tracking performance.

The effect of wind and moisture gradients on the arbitrary assignment of cloud motions to a vertical coordinate system in two Sesame cases

NASA Technical Reports Server (NTRS)

Peslen, C. A.; Koch, S. E.; Uccellini, L. W.

1984-01-01

Satellite-derived cloud motion 'wind' vectors (CMV) are increasingly used in mesoscale and in global analyses, and questions have been raised regarding the uncertainty of the level assignment for the CMV. One of two major problems in selecting a level for the CMV is related to uncertainties in assigning the motion vector to either the cloud top or base. The second problem is related to the inability to transfer the 'wind' derived from the CMV at individually specified heights to a standard coordinated surface. The present investigation has the objective to determine if the arbitrary level assignment represents a serious obstacle to the use of cloud motion wind vectors in the mesoscale analysis of a severe storm environment.

The unassigned distance geometry problem

DOE PAGES

Duxbury, P. M.; Granlund, L.; Gujarathi, S. R.; ...

2015-11-19

Studies of distance geometry problems (DGP) have focused on cases where the vertices at the ends of all or most of the given distances are known or assigned, which we call assigned distance geometry problems (aDGPs). In this contribution we consider the unassigned distance geometry problem (uDGP) where the vertices associated with a given distance are unknown, so the graph structure has to be discovered. uDGPs arises when attempting to find the atomic structure of molecules and nanoparticles using X-ray or neutron diffraction data from non-crystalline materials. Rigidity theory provides a useful foundation for both aDGPs and uDGPs, though itmore » is restricted to generic realizations of graphs, and key results are summarized. Conditions for unique realization are discussed for aDGP and uDGP cases, build-up algorithms for both cases are described and experimental results for uDGP are presented.« less

Consensus Assignments for Water Vapor Lines Not Assigned on the HITRAN Database: 13,200 to 16,500/cm

NASA Technical Reports Server (NTRS)

Giver, Lawerence P.; Chackerian, Charles, Jr.; Freedman, Richard S.; Varanasi, Prasad; Gore, Warren (Technical Monitor)

2000-01-01

There are nearly 800 water Vapor-lines in the 13,200-16,500/cm region that do not have rovibrational assignments in the HITRAN database. The positions and intensities in the database were determined by Mandin et al., but assignments could not be determined at that time. Polyansky, et al. have now assigned over 600 of the unassigned lines in the 11,200-16,500/cm region. Schwenke has also given rovibrational assignments to many of these unassigned lines throughout the visible and near-infrared. Both articles changed the assignments of some HITRAN lines. Carleer et al. extend assignments to some weaker lines measured by them on new spectra with excellent signal/noise. However, some lines measured by Mandin et al. were omitted by Carleer, et al. because of blends due to lower spectral resolution. The rovibrational assignments of Polyansky et al. completely agree with those in Schwenke's article for only about 200 lines. However, Schwenke's ab initio line list is available on his internet site (http://ccf.arc.nasa.gov/-dschwenke). A detailed comparison of the Polyansky et al.line list, the Carleer et al.line list, and Schwenke's ab initio line list shows a larger number of agreements. In many cases the disagreement is only about the vibrational and/or rotational upper level, while there is agreement on the lower state assignment and energy level, "E", which is of primary importance for atmospheric applications. We will present a line list of "consensus" assignments in the 13,200-16,500/cm region for consideration of inclusion on the HITRAN and GEISA databases. This will substantially reduce the number of unassigned lines on the databases in this spectral region.

Comparing Examples: WebAssign versus Textbook

NASA Astrophysics Data System (ADS)

Richards, Evan; Polak, Jeff; Hardin, Ashley; Risley, John, , Dr.

2005-11-01

Research shows students can learn from worked examples.^1 This pilot study compared two groups of students' performance (10 each) in solving physics problems. One group had access to interactive examples^2 released in WebAssign^3, while the other group had access to the counterpart textbook examples. Verbal data from students in problem solving sessions was collected using a think aloud protocol^4 and the data was analyzed using Chi's procedures.^5 An explanation of the methodology and results will be presented. Future phases of this pilot study based upon these results will also be discussed. ^1Atkinson, R.K., Derry, S.J., Renkl A., Wortham, D. (2000). ``Learning from Examples: Instructional Principles from the Worked Examples Research'', Review of Educational Research, vol. 70, n. 2, pp. 181-214. ^2Serway, R.A. & Faughn, J.S. (2006). College Physics (7^th ed.). Belmont, CA: Thomson Brooks/Cole. ^3 see www.webassign.net ^4 Ericsson, K.A. & Simon, H.A. (1984). Protocol Analysis: Verbal Reports as Data. Cambridge, Massachusetts: The MIT Press. ^5 Chi, Michelene T.H. (1997). ``Quantifying Qualitative Analyses of Verbal Data: A Practical Guide,'' The Journal of the Learning Sciences, vol. 6, n. 3, pp. 271-315.

Application of a Modal Approach in Solving the Static Stability Problem for Electric Power Systems

NASA Astrophysics Data System (ADS)

Sharov, J. V.

2017-12-01

Application of a modal approach in solving the static stability problem for power systems is examined. It is proposed to use the matrix exponent norm as a generalized transition function of the power system disturbed motion. Based on the concept of a stability radius and the pseudospectrum of Jacobian matrix, the necessary and sufficient conditions for existence of the static margins were determined. The capabilities and advantages of the modal approach in designing centralized or distributed control and the prospects for the analysis of nonlinear oscillations and rendering the dynamic stability are demonstrated.

25 CFR 535.2 - Assignments.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 25 Indians 2 2010-04-01 2010-04-01 false Assignments. 535.2 Section 535.2 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF THE INTERIOR MANAGEMENT CONTRACT PROVISIONS POST-APPROVAL PROCEDURES... disapprove an assignment applying the standards of, and within the time provided by §§ 535.1(d) and 535.1(e...

5 CFR 351.701 - Assignment involving displacement.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 5 Administrative Personnel 1 2011-01-01 2011-01-01 false Assignment involving displacement. 351.701 Section 351.701 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.701 Assignment involving displacement. (a...

5 CFR 351.701 - Assignment involving displacement.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 5 Administrative Personnel 1 2012-01-01 2012-01-01 false Assignment involving displacement. 351.701 Section 351.701 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.701 Assignment involving displacement. (a...

5 CFR 351.701 - Assignment involving displacement.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 5 Administrative Personnel 1 2013-01-01 2013-01-01 false Assignment involving displacement. 351.701 Section 351.701 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.701 Assignment involving displacement. (a...

5 CFR 351.701 - Assignment involving displacement.

Code of Federal Regulations, 2010 CFR

2010-01-01

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

5 CFR 351.701 - Assignment involving displacement.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 5 Administrative Personnel 1 2014-01-01 2014-01-01 false Assignment involving displacement. 351.701 Section 351.701 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.701 Assignment involving displacement. (a...

When power does not corrupt: superior individuation processes among powerful perceivers.

PubMed

Overbeck, J R; Park, B

2001-10-01

To examine whether powerful people fail to individuate the less powerful, the authors assigned participants to either a high-power or low-power role for a computer E-mail role play. In 3 studies, participants in the high-power role made decisions and determined the outcomes of interactions; low-power role players had no power and relied on high-power targets for outcome decisions. Studies I and 2 found that high-power perceivers better individuated low-power targets. Study 3 demonstrated that high-power role players' superior judgment can be impaired by including a task that directs their responsibility toward organizational rather than interpersonal concerns. In all, results suggest that the effect of power on social judgment may be more complex and multifaceted than has previously been acknowledged.

7 CFR 900.106 - Assignment of mediator.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Assignment of mediator. 900.106 Section 900.106 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing... Assignment of mediator. The Director of the Division shall assign a mediator, from the group designated by...

48 CFR 1511.011-74 - Work assignments.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 48 Federal Acquisition Regulations System 6 2011-10-01 2011-10-01 false Work assignments. 1511.011... ACQUISITION PLANNING DESCRIBING AGENCY NEEDS 1511.011-74 Work assignments. The Contracting Officer shall insert the contract clause at 1552.211-74, Work Assignments, in cost-reimbursement type term form...

48 CFR 1552.211-74 - Work assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

...-reimbursement type term form contracts when work assignments are to be used. Work Assignments (APR 1984) (a) The... assignment or similar tasking document, the Contractor shall provide a conflict of interest certification... directly related to a site, the Contractor is only required to provide a conflict of interest certification...

Contributions au probleme d'affectation des types d'avion

NASA Astrophysics Data System (ADS)

Belanger, Nicolas

In this thesis, we approach the problem of assigning aircraft types to flights (what is called aircraft fleet assignment) in a strategic planning context. The literature mentions many studies considering this problem on a daily flight schedule basis, but the proposed models do no allow to consider many elements that are either necessary to assure the practical feasibility of the solutions, or relevant to get more beneficial solutions. After describing the practical context of the problem (Chapter 1) and presenting the literature on the subject (Chapter 2), we propose new models and solution approaches to improve the quality of' the solutions obtained. The general scheme of the thesis is presented in Chapter 3. We summarize here the models and solution approaches that we propose; and present the main elements of our conclusions. First, in Chapter 4, we consider the problem of aircraft fleet Assignment over a weekly flight schedule, integrating into the objective an homogeneity factor for driving the choice of the aircraft types for the flights with the same flight number over the week. We present an integer linear model based on a time-space multicommodity network. This model includes, among others, decision variables relative to the aircraft type assigned to each flight and to the dominant aircraft type assigned to each flight number. We present in Chapter 5 the results of a research project made in collaboration with Air Canada within a consulting contract. The project aimed at analyzing the relevance for the planners of using an optimization software to help them to first identify non profitable flight legs in the network, and second to efficiently establish the aircraft fleet assignment. In this chapter, we propose an iterative approach to take into account the fact that the passenger demand is not known on a leg basis, but rather on an origin-destination and departure time basis. Finally, in Chapter 6, we propose a model and a solution approach that aim at

Lexical Stress Assignment in Italian Developmental Dyslexia

ERIC Educational Resources Information Center

Paizi, Despina; Zoccolotti, Pierluigi; Burani, Cristina

2011-01-01

Stress assignment to Italian polysyllabic words is unpredictable, because stress is neither marked nor predicted by rule. Stress assignment, especially to low frequency words, has been reported to be a function of stress dominance and stress neighbourhood. Two experiments investigate stress assignment in sixth-grade, skilled and dyslexic, readers.…

29 CFR 1403.4 - Assignment of mediators.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 29 Labor 4 2010-07-01 2010-07-01 false Assignment of mediators. 1403.4 Section 1403.4 Labor Regulations Relating to Labor (Continued) FEDERAL MEDIATION AND CONCILIATION SERVICE FUNCTIONS AND DUTIES § 1403.4 Assignment of mediators. The Federal Service will assign one or more mediators to each labor...

Spectrum and power allocation in cognitive multi-beam satellite communications with flexible satellite payloads

NASA Astrophysics Data System (ADS)

Liu, Zhihui; Wang, Haitao; Dong, Tao; Yin, Jie; Zhang, Tingting; Guo, Hui; Li, Dequan

2018-02-01

In this paper, the cognitive multi-beam satellite system, i.e., two satellite networks coexist through underlay spectrum sharing, is studied, and the power and spectrum allocation method is employed for interference control and throughput maximization. Specifically, the multi-beam satellite with flexible payload reuses the authorized spectrum of the primary satellite, adjusting its transmission band as well as power for each beam to limit its interference on the primary satellite below the prescribed threshold and maximize its own achievable rate. This power and spectrum allocation problem is formulated as a mixed nonconvex programming. For effective solving, we first introduce the concept of signal to leakage plus noise ratio (SLNR) to decouple multiple transmit power variables in the both objective and constraint, and then propose a heuristic algorithm to assign spectrum sub-bands. After that, a stepwise plus slice-wise algorithm is proposed to implement the discrete power allocation. Finally, simulation results show that adopting cognitive technology can improve spectrum efficiency of the satellite communication.

Configurational assignments of conformationally restricted bis-monoterpene hydroquinones: Utility in exploration of endangered plants

Treesearch

Joonseok Oh; John J. Bowling; Amar G. Chittiboyina; Robert J. Doerksen; Daneel Ferreira; Theodor D. Leininger; Mark T. Hamann

2013-01-01

Endangered plant species are an important resource for new chemistry. Lindera melissifolia is native to the Southeastern U.S. and scarcely populates the edges of lakes and ponds. Quantum mechanics (QM) used in combination with NMR/ECD is a powerful tool for the assignment of absolute configuration in lieu of X-ray crystallography. Methods: The EtOAc extract of L....

Assigning statistical significance to proteotypic peptides via database searches

PubMed Central

Alves, Gelio; Ogurtsov, Aleksey Y.; Yu, Yi-Kuo

2011-01-01

Querying MS/MS spectra against a database containing only proteotypic peptides reduces data analysis time due to reduction of database size. Despite the speed advantage, this search strategy is challenged by issues of statistical significance and coverage. The former requires separating systematically significant identifications from less confident identifications, while the latter arises when the underlying peptide is not present, due to single amino acid polymorphisms (SAPs) or post-translational modifications (PTMs), in the proteotypic peptide libraries searched. To address both issues simultaneously, we have extended RAId’s knowledge database to include proteotypic information, utilized RAId’s statistical strategy to assign statistical significance to proteotypic peptides, and modified RAId’s programs to allow for consideration of proteotypic information during database searches. The extended database alleviates the coverage problem since all annotated modifications, even those occurred within proteotypic peptides, may be considered. Taking into account the likelihoods of observation, the statistical strategy of RAId provides accurate E-value assignments regardless whether a candidate peptide is proteotypic or not. The advantage of including proteotypic information is evidenced by its superior retrieval performance when compared to regular database searches. PMID:21055489

Evaluation of Automatically Assigned Job-Specific Interview Modules.

PubMed

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

2016-08-01

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

Medical Image Retrieval Using Multi-Texton Assignment.

PubMed

Tang, Qiling; Yang, Jirong; Xia, Xianfu

2018-02-01

In this paper, we present a multi-texton representation method for medical image retrieval, which utilizes the locality constraint to encode each filter bank response within its local-coordinate system consisting of the k nearest neighbors in texton dictionary and subsequently employs spatial pyramid matching technique to implement feature vector representation. Comparison with the traditional nearest neighbor assignment followed by texton histogram statistics method, our strategies reduce the quantization errors in mapping process and add information about the spatial layout of texton distributions and, thus, increase the descriptive power of the image representation. We investigate the effects of different parameters on system performance in order to choose the appropriate ones for our datasets and carry out experiments on the IRMA-2009 medical collection and the mammographic patch dataset. The extensive experimental results demonstrate that the proposed method has superior performance.

7 CFR 97.130 - Recording of assignments.

Code of Federal Regulations, 2010 CFR

2010-01-01

... PLANT VARIETY AND PROTECTION Assignments and Recording § 97.130 Recording of assignments. (a) Any assignment of an application for a certificate, or of a certificate of plant variety protection, or of any interest in a variety, or any license or grant and conveyance of any right to use of the variety, may be...

A modeling of dynamic storage assignment for order picking in beverage warehousing with Drive-in Rack system

NASA Astrophysics Data System (ADS)

Hadi, M. Z.; Djatna, T.; Sugiarto

2018-04-01

This paper develops a dynamic storage assignment model to solve storage assignment problem (SAP) for beverages order picking in a drive-in rack warehousing system to determine the appropriate storage location and space for each beverage products dynamically so that the performance of the system can be improved. This study constructs a graph model to represent drive-in rack storage position then combine association rules mining, class-based storage policies and an arrangement rule algorithm to determine an appropriate storage location and arrangement of the product according to dynamic orders from customers. The performance of the proposed model is measured as rule adjacency accuracy, travel distance (for picking process) and probability a product become expiry using Last Come First Serve (LCFS) queue approach. Finally, the proposed model is implemented through computer simulation and compare the performance for different storage assignment methods as well. The result indicates that the proposed model outperforms other storage assignment methods.

Theoretical and subjective bit assignments in transform picture

NASA Technical Reports Server (NTRS)

Jones, H. W., Jr.

1977-01-01

It is shown that all combinations of symmetrical input distributions with difference distortion measures give a bit assignment rule identical to the well-known rule for a Gaussian input distribution with mean-square error. Published work is examined to show that the bit assignment rule is useful for transforms of full pictures, but subjective bit assignments for transform picture coding using small block sizes are significantly different from the theoretical bit assignment rule. An intuitive explanation is based on subjective design experience, and a subjectively obtained bit assignment rule is given.

Evaluation of Automatically Assigned Job-Specific Interview Modules

PubMed Central

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

2016-01-01

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

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

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

Bernal, Andrés; Patiny, Luc; Castillo, Andrés M.

2015-02-21

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound method are presented: 1. reduction of the size of the solution space by resort to a condensed structure formula, wherein symmetric nuclei are grouped together; 2. partitioning of the solution space based on symmetry, that becomes the basis for an efficient branching procedure; and 3. a criterion of selection of input restrictions that leads to increased gaps between branches and thus faster pruningmore » of non-viable solutions. Although the examples chosen to illustrate this work focus on small-molecule NMR assignment, the results are generic and might help solving other combinatorial optimization problems.« less

48 CFR 208.7002 - Assignment authority.

Code of Federal Regulations, 2012 CFR

2012-10-01

... activities concerned. (b) Under the Integrated Materiel Management Program, assignments are made by the... 48 Federal Acquisition Regulations System 3 2012-10-01 2012-10-01 false Assignment authority. 208.7002 Section 208.7002 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

48 CFR 208.7002 - Assignment authority.

Code of Federal Regulations, 2013 CFR

2013-10-01

... activities concerned. (b) Under the Integrated Materiel Management Program, assignments are made by the... 48 Federal Acquisition Regulations System 3 2013-10-01 2013-10-01 false Assignment authority. 208.7002 Section 208.7002 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

48 CFR 208.7002 - Assignment authority.

Code of Federal Regulations, 2011 CFR

2011-10-01

... activities concerned. (b) Under the Integrated Materiel Management Program, assignments are made by the... 48 Federal Acquisition Regulations System 3 2011-10-01 2011-10-01 false Assignment authority. 208.7002 Section 208.7002 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

48 CFR 208.7002 - Assignment authority.

Code of Federal Regulations, 2014 CFR

2014-10-01

... activities concerned. (b) Under the Integrated Materiel Management Program, assignments are made by the... 48 Federal Acquisition Regulations System 3 2014-10-01 2014-10-01 false Assignment authority. 208.7002 Section 208.7002 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM...

Phase modulated 2D HSQC-TOCSY for unambiguous assignment of overlapping spin systems

NASA Astrophysics Data System (ADS)

Singh, Amrinder; Dubey, Abhinav; Adiga, Satish K.; Atreya, Hanudatta S.

2018-01-01

We present a new method that allows one to unambiguously resolve overlapping spin systems often encountered in biomolecular systems such as peptides and proteins or in samples containing a mixture of different molecules such as in metabolomics. We address this problem using the recently proposed phase modulation approach. By evolving the 1H chemical shifts in a conventional two dimensional (2D) HSQC-TOCSY experiment for a fixed delay period, the phase/intensity of set of cross peaks belonging to one spin system are modulated differentially relative to those of its overlapping counterpart, resulting in their discrimination and recognition. The method thus accelerates the process of identification and resonance assignment of individual compounds in complex mixtures. This approach facilitated the assignment of molecules in the embryo culture medium used in human assisted reproductive technology.

Joint Inference of Population Assignment and Demographic History

PubMed Central

Choi, Sang Chul; Hey, Jody

2011-01-01

A new approach to assigning individuals to populations using genetic data is described. Most existing methods work by maximizing Hardy–Weinberg and linkage equilibrium within populations, neither of which will apply for many demographic histories. By including a demographic model, within a likelihood framework based on coalescent theory, we can jointly study demographic history and population assignment. Genealogies and population assignments are sampled from a posterior distribution using a general isolation-with-migration model for multiple populations. A measure of partition distance between assignments facilitates not only the summary of a posterior sample of assignments, but also the estimation of the posterior density for the demographic history. It is shown that joint estimates of assignment and demographic history are possible, including estimation of population phylogeny for samples from three populations. The new method is compared to results of a widely used assignment method, using simulated and published empirical data sets. PMID:21775468

Longitudinal Evaluation of the Importance of Homework Assignment Completion for the Academic Performance of Middle School Students with ADHD

PubMed Central

Langberg, Joshua M.; Dvorsky, Melissa R.; Molitor, Stephen J.; Bourchtein, Elizaveta; Eddy, Laura D.; Smith, Zoe; Schultz, Brandon K.; Evans, Steven W.

2016-01-01

The primary goal of this study was to longitudinally evaluate the homework assignment completion patterns of middle school age adolescents with ADHD, their associations with academic performance, and malleable predictors of homework assignment completion. Analyses were conducted on a sample of 104 middle school students comprehensively diagnosed with ADHD and followed for 18 months. Multiple teachers for each student provided information about the percentage of homework assignments turned in at five separate timepoints and school grades were collected quarterly. Results showed that agreement between teachers with respect to students’ assignment completion was high, with an intraclass correlation of .879 at baseline. Students with ADHD were turning in an average of 12% fewer assignments each academic quarter in comparison to teacher-reported classroom averages. Regression analyses revealed a robust association between the percentage of assignments turned in at baseline and school grades 18 months later, even after controlling for baseline grades, achievement (reading and math), intelligence, family income, and race. Cross-lag analyses demonstrated that the association between assignment completion and grades was reciprocal, with assignment completion negatively impacting grades and low grades in turn being associated with decreased future homework completion. Parent ratings of homework materials management abilities at baseline significantly predicted the percentage of assignments turned in as reported by teachers 18 months later. These findings demonstrate that homework assignment completion problems are persistent across time and an important intervention target for adolescents with ADHD. PMID:26931065

28 CFR 548.17 - Work assignments.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 28 Judicial Administration 2 2012-07-01 2012-07-01 false Work assignments. 548.17 Section 548.17 Judicial Administration BUREAU OF PRISONS, DEPARTMENT OF JUSTICE INSTITUTIONAL MANAGEMENT RELIGIOUS PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the...

28 CFR 548.17 - Work assignments.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 28 Judicial Administration 2 2011-07-01 2011-07-01 false Work assignments. 548.17 Section 548.17 Judicial Administration BUREAU OF PRISONS, DEPARTMENT OF JUSTICE INSTITUTIONAL MANAGEMENT RELIGIOUS PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the...

28 CFR 548.17 - Work assignments.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 28 Judicial Administration 2 2014-07-01 2014-07-01 false Work assignments. 548.17 Section 548.17 Judicial Administration BUREAU OF PRISONS, DEPARTMENT OF JUSTICE INSTITUTIONAL MANAGEMENT RELIGIOUS PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the...

28 CFR 548.17 - Work assignments.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 28 Judicial Administration 2 2013-07-01 2013-07-01 false Work assignments. 548.17 Section 548.17 Judicial Administration BUREAU OF PRISONS, DEPARTMENT OF JUSTICE INSTITUTIONAL MANAGEMENT RELIGIOUS PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the...

28 CFR 548.17 - Work assignments.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Work assignments. 548.17 Section 548.17 Judicial Administration BUREAU OF PRISONS, DEPARTMENT OF JUSTICE INSTITUTIONAL MANAGEMENT RELIGIOUS PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the...

Solving optimization problems on computational grids.

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

Wright, S. J.; Mathematics and Computer Science

2001-05-01

infrastructure need to solve these problems on computational grids. This article describes some of the results we have obtained during the first three years of the metaneos project. Our efforts have led to development of the runtime support library MW for implementing algorithms with master-worker control structure on Condor platforms. This work is discussed here, along with work on algorithms and codes for integer linear programming, the quadratic assignment problem, and stochastic linear programmming. Our experiences in the metaneos project have shown that cheap, powerful computational grids can be used to tackle large optimization problems of various types. In an industrial or commercial setting, the results demonstrate that one may not have to buy powerful computational servers to solve many of the large problems arising in areas such as scheduling, portfolio optimization, or logistics; the idle time on employee workstations (or, at worst, an investment in a modest cluster of PCs) may do the job. For the optimization research community, our results motivate further work on parallel, grid-enabled algorithms for solving very large problems of other types. The fact that very large problems can be solved cheaply allows researchers to better understand issues of 'practical' complexity and of the role of heuristics.« less

The reference frame of figure-ground assignment.

PubMed

Vecera, Shaun P

2004-10-01

Figure-ground assignment involves determining which visual regions are foreground figures and which are backgrounds. Although figure-ground processes provide important inputs to high-level vision, little is known about the reference frame in which the figure's features and parts are defined. Computational approaches have suggested a retinally based, viewer-centered reference frame for figure-ground assignment, but figural assignment could also be computed on the basis of environmental regularities in an environmental reference frame. The present research used a newly discovered cue, lower region, to examine the reference frame of figure-ground assignment. Possible reference frames were misaligned by changing the orientation of viewers by having them tilt their heads (Experiments 1 and 2) or turn them upside down (Experiment 3). The results of these experiments indicated that figure-ground perception followed the orientation of the viewer, suggesting a viewer-centered reference frame for figure-ground assignment.

My Favorite Assignment.

ERIC Educational Resources Information Center

Hebert, Margaret; And Others

1991-01-01

Contains seven brief articles which offer assignments designed to help students perform job searches, write job application letters, answer difficult questions, write letters of resignation, alleviate fears of public speaking, use the interview effectively in the business communication, and develop listening skills. (PRA)

Student-Posed Problems

NASA Astrophysics Data System (ADS)

Harper, Kathleen A.; Etkina, Eugenia

2002-10-01

As part of weekly reports,1 structured journals in which students answer three standard questions each week, they respond to the prompt, If I were the instructor, what questions would I ask or problems assign to determine if my students understood the material? An initial analysis of the results shows that some student-generated problems indicate fundamental misunderstandings of basic physical concepts. A further investigation explores the relevance of the problems to the week's material, whether the problems are solvable, and the type of problems (conceptual or calculation-based) written. Also, possible links between various characteristics of the problems and conceptual achievement are being explored. The results of this study spark many more questions for further work. A summary of current findings will be presented, along with its relationship to previous work concerning problem posing.2 1Etkina, E. Weekly Reports;A Two-Way Feedback Tool, Science Education, 84, 594-605 (2000). 2Mestre, J.P., Probing Adults Conceptual Understanding and Transfer of Learning Via Problem Posing, Journal of Applied Developmental Psychology, 23, 9-50 (2002).

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

Code of Federal Regulations, 2010 CFR

2010-07-01

... assigned to two or more persons in the alternative, for example, “John B. Smith or Mrs. Mary J. Smith” or “John B. Smith or Mrs. Mary J. Smith or the survivor,” may be assigned by one of them at maturity or... the names of or assigned to two or more persons jointly, for example, “John B. Smith and Mrs. Mary J...

Personal Reflection: Reflections on a Family Health History Assignment for Undergraduate Public Health and Nursing Students

ERIC Educational Resources Information Center

Rooks, Ronica N.; Ford, Cassandra

2013-01-01

This personal reflection describes our experiences with incorporating the scholarship of teaching and learning and problem-based techniques to facilitate undergraduate student learning and their professional development in the health sciences. We created a family health history assignment to discuss key concepts in our courses, such as health…

Principals' Approaches to Cultivating Teacher Effectiveness: Constraints and Opportunities in Hiring, Assigning, Evaluating, and Developing Teachers

ERIC Educational Resources Information Center

Donaldson, Morgaen L.

2013-01-01

Purpose: How principals hire, assign, evaluate, and provide growth opportunities to teachers likely have major ramifications for teacher effectiveness and student learning. This article reports on the barriers principals encountered when carrying out these functions and variations in the degree to which they identified obstacles and problem-solved…

46 CFR 387.5 - Surplus property assignment recommendation.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 8 2011-10-01 2011-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 Disposal...

46 CFR 387.5 - Surplus property assignment recommendation.

Code of Federal Regulations, 2010 CFR

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

Community-powered problem solving.

PubMed

Gouillart, Francis; Billings, Douglas

2013-04-01

Traditionally, companies have managed their constituencies with specific processes: marketing to customers, procuring from vendors, developing HR policies for employees, and so on. The problem is, such processes focus on repeatability and compliance, so they can lead to stagnation. Inviting your constituencies to collectively help you solve problems and exploit opportunities--"co-creation"--is a better approach. It allows you to continually tap the skills and insights of huge numbers of stakeholders and develop new ways to produce value for all. The idea is to provide stakeholders with platforms (physical and digital forums) on which they can interact, get them to start exploring new experiences and connections, and let the system grow organically. A co-creation initiative by a unit of Becton, Dickinson and Company demonstrates how this works. A global leader in syringes, BD set out to deepen its ties with hospital customers and help them reduce the incidence of infections from unsafe injection and syringe disposal practices. The effort began with a cross-functional internal team, brought in the hospital procurement and supply managers BD had relationships with, and then reached out to hospitals' infection-prevention and occupational health leaders. Eventually product designers, nurses, sustainability staffers, and even hospital CFOs were using the platform, contributing data that generated new best practices and reduced infections.

Budget-based power consumption for application execution on a plurality of compute nodes

DOEpatents

Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

2013-02-05

Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

Budget-based power consumption for application execution on a plurality of compute nodes

DOEpatents

Archer, Charles J; Inglett, Todd A; Ratterman, Joseph D

2012-10-23

Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

Does a booster intervention augment the preventive effects of an abbreviated version of the coping power program for aggressive children?

PubMed

Lochman, John E; Baden, Rachel E; Boxmeyer, Caroline L; Powell, Nicole P; Qu, Lixin; Salekin, Karen L; Windle, Michel

2014-01-01

Booster interventions have been presumed to be important methods for maintaining the effects of evidence-based programs for children with behavioral problems, but there has been remarkably little empirical attention to this assumption. The present study examines the effect of a child-oriented booster preventive intervention with children who had previously received an abbreviated version (24 child sessions, 10 parent sessions) of the Coping Power targeted prevention program. Two hundred and forty-one children (152 boys, 89 girls) were screened as having moderate to high levels of aggressive behavior in 4th grade, then half were randomly assigned to receive the abbreviated Coping Power program in 5th grade, and half of the preventive intervention children were then randomly assigned to a Booster condition in 6th grade. The Booster sessions consisted of brief monthly individual contacts, and were primarily with the children. Five assessments across 4 years were collected from teachers, providing a three-year follow-up for all children who participated in the project. Results indicated that the abbreviated Coping Power program (one-third shorter than the full intervention) had long-term effects in reducing children's externalizing problem behaviors, proactive and reactive aggression, impulsivity traits and callous-unemotional traits. The Booster intervention did not augment these prevention effects. These findings indicate that a briefer and more readily disseminated form of an evidence-based targeted preventive intervention was effective. The findings have potential implications for policy and guidelines about possible intervention length and booster interventions.

Development and Application of ANN Model for Worker Assignment into Virtual Cells of Large Sized Configurations

NASA Astrophysics Data System (ADS)

Murali, R. V.; Puri, A. B.; Fathi, Khalid

2010-10-01

This paper presents an extended version of study already undertaken on development of an artificial neural networks (ANNs) model for assigning workforce into virtual cells under virtual cellular manufacturing systems (VCMS) environments. Previously, the same authors have introduced this concept and applied it to virtual cells of two-cell configuration and the results demonstrated that ANNs could be a worth applying tool for carrying out workforce assignments. In this attempt, three-cell configurations problems are considered for worker assignment task. Virtual cells are formed under dual resource constraint (DRC) context in which the number of available workers is less than the total number of machines available. Since worker assignment tasks are quite non-linear and highly dynamic in nature under varying inputs & conditions and, in parallel, ANNs have the ability to model complex relationships between inputs and outputs and find similar patterns effectively, an attempt was earlier made to employ ANNs into the above task. In this paper, the multilayered perceptron with feed forward (MLP-FF) neural network model has been reused for worker assignment tasks of three-cell configurations under DRC context and its performance at different time periods has been analyzed. The previously proposed worker assignment model has been reconfigured and cell formation solutions available for three-cell configuration in the literature are used in combination to generate datasets for training ANNs framework. Finally, results of the study have been presented and discussed.

Band head spin assignment of superdeformed bands in Hg isotopes through power index formula

NASA Astrophysics Data System (ADS)

Sharma, Honey; Mittal, H. M.

2018-05-01

The power index formula has been used to obtain the band head spin (I 0) of all the superdeformed (SD) bands in Hg isotopes. A least squares fitting approach is used. The root mean square deviations between the determined and the observed transition energies are calculated by extracting the model parameters using the power index formula. Whenever definite spins are available, the determined and the observed transition energies are in accordance with each other. The computed values of dynamic moment of inertia J (2) obtained by using the power index formula and its deviation with the rotational frequency is also studied. Excellent agreement is shown between the calculated and the experimental results for J (2) versus the rotational frequency. Hence, the power index formula works very well for all the SD bands in Hg isotopes expect for 195Hg(2, 3, 4).

Longitudinal evaluation of the importance of homework assignment completion for the academic performance of middle school students with ADHD.

PubMed

Langberg, Joshua M; Dvorsky, Melissa R; Molitor, Stephen J; Bourchtein, Elizaveta; Eddy, Laura D; Smith, Zoe; Schultz, Brandon K; Evans, Steven W

2016-04-01

The primary goal of this study was to longitudinally evaluate the homework assignment completion patterns of middle school age adolescents with ADHD, their associations with academic performance, and malleable predictors of homework assignment completion. Analyses were conducted on a sample of 104 middle school students comprehensively diagnosed with ADHD and followed for 18 months. Multiple teachers for each student provided information about the percentage of homework assignments turned in at five separate time points and school grades were collected quarterly. Results showed that agreement between teachers with respect to students assignment completion was high, with an intraclass correlation of .879 at baseline. Students with ADHD were turning in an average of 12% fewer assignments each academic quarter in comparison to teacher-reported classroom averages. Regression analyses revealed a robust association between the percentage of assignments turned in at baseline and school grades 18 months later, even after controlling for baseline grades, achievement (reading and math), intelligence, family income, and race. Cross-lag analyses demonstrated that the association between assignment completion and grades was reciprocal, with assignment completion negatively impacting grades and low grades in turn being associated with decreased future homework completion. Parent ratings of homework materials management abilities at baseline significantly predicted the percentage of assignments turned in as reported by teachers 18 months later. These findings demonstrate that homework assignment completion problems are persistent across time and an important intervention target for adolescents with ADHD. Copyright © 2015 Society for the Study of School Psychology. Published by Elsevier Ltd. All rights reserved.

Flight control synthesis for flexible aircraft using Eigenspace assignment

NASA Technical Reports Server (NTRS)

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

Power and affordances: when the situation has more power over powerful than powerless individuals.

PubMed

Guinote, Ana

2008-08-01

Six studies examined how power affects responses to situational affordances. Participants were assigned to a powerful or a powerless condition and were exposed to various situations that afford different classes of behavior. Study 1 examined behavior intentions for weekdays and weekends. Studies 2 and 3 focused on responses to imaginary social and work situations. Study 4 examined planned behavior for winter and summer days. Finally, Studies 5 and 6 examined behavior and attention in the presence of situation-relevant and irrelevant information. Consistently across these studies, powerful individuals acted more in situation-consistent ways, and less in situation-inconsistent ways, compared with powerless individuals. These findings are interpreted as a result of the greater tendency for powerful individuals to process information selectively in line with the primary factors that drive cognition, such as affordances. One consequence of these findings is that powerful individuals change behavior across situations more than powerless individuals.

Homework assignments in couple and family therapy.

PubMed

Dattilio, Frank M

2002-05-01

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

Writing Assignments that Promote Active Learning

NASA Astrophysics Data System (ADS)

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.

47 CFR 78.18 - Frequency assignments.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignments. 78.18 Section 78.18... SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... Relay Service stations operating on frequencies in the sub-bands 18.3-18.58 GHz and 19.26-19.3 GHz that...

47 CFR 78.18 - Frequency assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignments. 78.18 Section 78.18... SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... Relay Service stations operating on frequencies in the sub-bands 18.3-18.58 GHz and 19.26-19.3 GHz that...

47 CFR 78.18 - Frequency assignments.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency assignments. 78.18 Section 78.18... SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... Relay Service stations operating on frequencies in the sub-bands 18.3-18.58 GHz and 19.26-19.3 GHz that...

47 CFR 78.18 - Frequency assignments.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency assignments. 78.18 Section 78.18... SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... Relay Service stations operating on frequencies in the sub-bands 18.3-18.58 GHz and 19.26-19.3 GHz that...

47 CFR 78.18 - Frequency assignments.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency assignments. 78.18 Section 78.18... SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... Relay Service stations operating on frequencies in the sub-bands 18.3-18.58 GHz and 19.26-19.3 GHz that...

32 CFR 241.6 - Length of assignments.

Code of Federal Regulations, 2011 CFR

2011-07-01

... Components and private sector organizations. (b) No assignment may commence after September 30, 2013, unless an individual began an assignment by September 30, 2013. This extension may be granted in 3-month...

28 CFR 301.103 - Inmate work assignments.

Code of Federal Regulations, 2010 CFR

2010-07-01

... designates work assignments, or whoever makes work assignments, shall review appropriate medical records... compatible with the inmate's physical ability or condition. [55 FR 9296, Mar. 12, 1990, as amended at 59 FR...

4 CFR 3.1 - Appointment, promotion, and assignment.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 4 Accounts 1 2010-01-01 2010-01-01 false Appointment, promotion, and assignment. 3.1 Section 3.1 Accounts GOVERNMENT ACCOUNTABILITY OFFICE PERSONNEL SYSTEM EMPLOYMENT § 3.1 Appointment, promotion, and assignment. Employees of GAO shall be appointed, promoted and assigned solely on the basis of merit and...

7 CFR 400.305 - Assignment of Nonstandard Classifications.

Code of Federal Regulations, 2011 CFR

2011-01-01

... tables for the county. (b) Nonstandard classification assignment will be made each year, for the year... 7 Agriculture 6 2011-01-01 2011-01-01 false Assignment of Nonstandard Classifications. 400.305... Underwriting Classification System Regulations for the 1991 and Succeeding Crop Years § 400.305 Assignment of...

7 CFR 400.305 - Assignment of Nonstandard Classifications.

Code of Federal Regulations, 2010 CFR

2010-01-01

... tables for the county. (b) Nonstandard classification assignment will be made each year, for the year... 7 Agriculture 6 2010-01-01 2010-01-01 false Assignment of Nonstandard Classifications. 400.305... Underwriting Classification System Regulations for the 1991 and Succeeding Crop Years § 400.305 Assignment of...

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

NASA Astrophysics Data System (ADS)

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

2005-10-01

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

Detecting Plagiarism in MS Access Assignments

ERIC Educational Resources Information Center

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…

Mighty Mathematicians: Using Problem Posing and Problem Solving to Develop Mathematical Power

ERIC Educational Resources Information Center

McGatha, Maggie B.; Sheffield, Linda J.

2006-01-01

This article describes a year-long professional development institute combined with a summer camp for students. Both were designed to help teachers and students develop their problem-solving and problem-posing abilities.

7 CFR 1.77 - Assignment of priorities.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Television Films § 1.77 Assignment of priorities. (a) Authority. (1) The Director of Information or his designee will make assignment of priorities for the U.S. Department of Agriculture for a television film...

7 CFR 1.77 - Assignment of priorities.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Television Films § 1.77 Assignment of priorities. (a) Authority. (1) The Director of Information or his designee will make assignment of priorities for the U.S. Department of Agriculture for a television film...

7 CFR 1.77 - Assignment of priorities.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Television Films § 1.77 Assignment of priorities. (a) Authority. (1) The Director of Information or his designee will make assignment of priorities for the U.S. Department of Agriculture for a television film...

7 CFR 1.77 - Assignment of priorities.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Television Films § 1.77 Assignment of priorities. (a) Authority. (1) The Director of Information or his designee will make assignment of priorities for the U.S. Department of Agriculture for a television film...

Assigning historic responsibility for extreme weather events

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

7 CFR 1.77 - Assignment of priorities.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Television Films § 1.77 Assignment of priorities. (a) Authority. (1) The Director of Information or his designee will make assignment of priorities for the U.S. Department of Agriculture for a television film...

Quantum probability assignment limited by relativistic causality.

PubMed

Han, Yeong Deok; Choi, Taeseung

2016-03-14

Quantum theory has nonlocal correlations, which bothered Einstein, but found to satisfy relativistic causality. Correlation for a shared quantum state manifests itself, in the standard quantum framework, by joint probability distributions that can be obtained by applying state reduction and probability assignment that is called Born rule. Quantum correlations, which show nonlocality when the shared state has an entanglement, can be changed if we apply different probability assignment rule. As a result, the amount of nonlocality in quantum correlation will be changed. The issue is whether the change of the rule of quantum probability assignment breaks relativistic causality. We have shown that Born rule on quantum measurement is derived by requiring relativistic causality condition. This shows how the relativistic causality limits the upper bound of quantum nonlocality through quantum probability assignment.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation.

PubMed

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation

PubMed Central

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality. PMID:26954783

Mathematics Textbooks and the Teaching of Assigned Writing.

ERIC Educational Resources Information Center

Donlan, Dan

This paper initially presents the results of several studies concerning what kind of writing mathematics teachers assign and what kind of writing mathematics textbooks assign. By far, report-research was the most popular type of writing assigned in the surveyed textbooks. The types of reports students were asked to write include biography,…

How the brain assigns a neural tag to arbitrary points in a high-dimensional space

NASA Astrophysics Data System (ADS)

Stevens, Charles

Brains in almost all organisms need to deal with very complex stimuli. For example, most mammals are very good at face recognition, and faces are very complex objects indeed. For example, modern face recognition software represents a face as a point in a 10,000 dimensional space. Every human must be able to learn to recognize any of the 7 billion faces in the world, and can recognize familiar faces after a display of the face is viewed for only a few hundred milliseconds. Because we do not understand how faces are assigned locations in a high-dimensional space by the brain, attacking the problem of how face recognition is accomplished is very difficult. But a much easier problem of the same sort can be studied for odor recognition. For the mouse, each odor is assigned a point in a 1000 dimensional space, and the fruit fly assigns any odor a location in only a 50 dimensional space. A fly has about 50 distinct types of odorant receptor neurons (ORNs), each of which produce nerve impulses at a specific rate for each different odor. This pattern of firing produced across 50 ORNs is called `a combinatorial odor code', and this code assigns every odor a point in a 50 dimensional space that is used to identify the odor. In order to learn the odor, the brain must alter the strength of synapses. The combinatorial code cannot itself by used to change synaptic strength because all odors use same neurons to form the code, and so all synapses would be changed for any odor and the odors could not be distinguished. In order to learn an odor, the brain must assign a set of neurons - the odor tag - that have the property that these neurons (1) should make use of all of the information available about the odor, and (2) insure that any two tags overlap as little as possible (so one odor does not modify synapses used by other odors). In the talk, I will explain how the olfactory system of both the fruit fly and the mouse produce a tag for each odor that has these two properties

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Power oscillation suppression by robust SMES in power system with large wind power penetration

NASA Astrophysics Data System (ADS)

Ngamroo, Issarachai; Cuk Supriyadi, A. N.; Dechanupaprittha, Sanchai; Mitani, Yasunori

2009-01-01

The large penetration of wind farm into interconnected power systems may cause the severe problem of tie-line power oscillations. To suppress power oscillations, the superconducting magnetic energy storage (SMES) which is able to control active and reactive powers simultaneously, can be applied. On the other hand, several generating and loading conditions, variation of system parameters, etc., cause uncertainties in the system. The SMES controller designed without considering system uncertainties may fail to suppress power oscillations. To enhance the robustness of SMES controller against system uncertainties, this paper proposes a robust control design of SMES by taking system uncertainties into account. The inverse additive perturbation is applied to represent the unstructured system uncertainties and included in power system modeling. The configuration of active and reactive power controllers is the first-order lead-lag compensator with single input feedback. To tune the controller parameters, the optimization problem is formulated based on the enhancement of robust stability margin. The particle swarm optimization is used to solve the problem and achieve the controller parameters. Simulation studies in the six-area interconnected power system with wind farms confirm the robustness of the proposed SMES under various operating conditions.

Design evaluation in technology assessment: Illustrated by auditory impedance and sound distribution problems

NASA Technical Reports Server (NTRS)

Halldane, J. F.

1972-01-01

Technology is considered as a culture for changing a physical world and technology assessment questions the inherent cultural capability to modify power and material in support of living organisms. A comprehensive goal-parameter-synthesis-criterion specification is presented as a basis for a rational assessment of technology. The thesis queries the purpose of the assessed problems, the factors considered, the relationships between factors, and the values assigned those factors to accomplish the appropriate purpose. Stationary and sequential evaluation of enviro-organismic systems are delegated to the responsible personalities involved in design; from promoter/designer through contractor to occupant. Discussion includes design goals derived from organismic factors, definitions of human responses which establish viable criteria and relevant correlation models, linking stimulus parameters, and parallel problem-discipline centered design organization. A consistent concept of impedance, as a degradation in the performance of a specified parameter, is introduced to overcome the arbitrary inoperative connotations of terms like noise, discomfort, and glare. Applications of the evaluative specification are illustrated through design problems related to auditory impedance and sound distribution.

Learning to assign binary weights to binary descriptor

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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

2017-01-17

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

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

PubMed Central

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

2017-01-01

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

28 CFR 100.13 - Directly assignable costs.

Code of Federal Regulations, 2011 CFR

2011-07-01

..., COMMUNICATIONS ASSISTANCE FOR LAW ENFORCEMENT ACT OF 1994 § 100.13 Directly assignable costs. (a) A cost is directly assignable to the CALEA compliance effort if it is a plant cost incurred specifically to meet the...

7 CFR 37.16 - OMB assigned numbers.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 2 2014-01-01 2014-01-01 false OMB assigned numbers. 37.16 Section 37.16 Agriculture... ASSESS ORGANIC CERTIFYING AGENCIES § 37.16 OMB assigned numbers. The information collection and... Control Number 0581-0183. ...

Flexible taxonomic assignment of ambiguous sequencing reads

PubMed Central

2011-01-01

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

Reactive Power Compensation Method Considering Minimum Effective Reactive Power Reserve

NASA Astrophysics Data System (ADS)

Gong, Yiyu; Zhang, Kai; Pu, Zhang; Li, Xuenan; Zuo, Xianghong; Zhen, Jiao; Sudan, Teng

2017-05-01

According to the calculation model of minimum generator reactive power reserve of power system voltage stability under the premise of the guarantee, the reactive power management system with reactive power compensation combined generator, the formation of a multi-objective optimization problem, propose a reactive power reserve is considered the minimum generator reactive power compensation optimization method. This method through the improvement of the objective function and constraint conditions, when the system load growth, relying solely on reactive power generation system can not meet the requirement of safe operation, increase the reactive power reserve to solve the problem of minimum generator reactive power compensation in the case of load node.

Solving Man-Induced Large-Scale Conservation Problems: The Spanish Imperial Eagle and Power Lines

PubMed Central

López-López, Pascual; Ferrer, Miguel; Madero, Agustín; Casado, Eva; McGrady, Michael

2011-01-01

Background Man-induced mortality of birds caused by electrocution with poorly-designed pylons and power lines has been reported to be an important mortality factor that could become a major cause of population decline of one of the world rarest raptors, the Spanish imperial eagle (Aquila adalberti). Consequently it has resulted in an increasing awareness of this problem amongst land managers and the public at large, as well as increased research into the distribution of electrocution events and likely mitigation measures. Methodology/Principal Findings We provide information of how mitigation measures implemented on a regional level under the conservation program of the Spanish imperial eagle have resulted in a positive shift of demographic trends in Spain. A 35 years temporal data set (1974–2009) on mortality of Spanish imperial eagle was recorded, including population censuses, and data on electrocution and non-electrocution of birds. Additional information was obtained from 32 radio-tracked young eagles and specific field surveys. Data were divided into two periods, before and after the approval of a regional regulation of power line design in 1990 which established mandatory rules aimed at minimizing or eliminating the negative impacts of power lines facilities on avian populations. Our results show how population size and the average annual percentage of population change have increased between the two periods, whereas the number of electrocuted birds has been reduced in spite of the continuous growing of the wiring network. Conclusions Our results demonstrate that solving bird electrocution is an affordable problem if political interest is shown and financial investment is made. The combination of an adequate spatial planning with a sustainable development of human infrastructures will contribute positively to the conservation of the Spanish imperial eagle and may underpin population growth and range expansion, with positive side effects on other endangered

An empirical comparison of SNPs and microsatellites for parentage and kinship assignment in a wild sockeye salmon (Oncorhynchus nerka) population.

PubMed

Hauser, Lorenz; Baird, Melissa; Hilborn, Ray; Seeb, Lisa W; Seeb, James E

2011-03-01

Because of their high variability, microsatellites are still considered the marker of choice for studies on parentage and kinship in wild populations. Nevertheless, single nucleotide polymorphisms (SNPs) are becoming increasing popular in many areas of molecular ecology, owing to their high-throughput, easy transferability between laboratories and low genotyping error. An ongoing discussion concerns the relative power of SNPs compared to microsatellites-that is, how many SNP loci are needed to replace a panel of microsatellites? Here, we evaluate the assignment power of 80 SNPs (H(E) = 0.30, 80 independent alleles) and 11 microsatellites (H(E) = 0.85, 192 independent alleles) in a wild population of about 400 sockeye salmon with two commonly used software packages (Cervus3, Colony2) and, for SNPs only, a newly developed software (SNPPIT). Assignment success was higher for SNPs than for microsatellites, especially for parent pairs, irrespective of the method used. Colony2 assigned a larger proportion of offspring to at least one parent than the other methods, although Cervus and SNPPIT detected more parent pairs. Identification of full-sib groups without parental information from relatedness measures was possible using both marker systems, although explicit reconstruction of such groups in Colony2 was impossible for SNPs because of computation time. Our results confirm the applicability of SNPs for parentage analyses and refute the predictability of assignment success from the number of independent alleles. © 2011 Blackwell Publishing Ltd.

An Algorithm for Protein Helix Assignment Using Helix Geometry

PubMed Central

Cao, Chen; Xu, Shutan; Wang, Lincong

2015-01-01

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

Review of concentrating solar thermal power industry in China: Status quo, problems, trend and countermeasures

NASA Astrophysics Data System (ADS)

Zou, Jiajun

2018-01-01

Concentrating solar thermal power (CSP) industry is a strategic emerging industry in China. Its further development is of great significance for promoting the energy revolution, achieving energy saving and emission reduction. In this paper, China’s CSP industry is systematically analysed. First of all, the status quo is elaborated from the perspectives of relevant policies and regulations, market and generation technology development. Secondly, the problems and the underlying reasons of China’s CSP industry are deeply studied. On this basis, the future trends of CSP are expounded on the three levels of policy, market and power generation technology. Finally, a series of feasible countermeasures are put forward, designed to promote the development of CSP industry and the transformation of energy structure.

Optimizing and accelerating the assignation of lineages in Mycobacterium tuberculosis using novel alternative single-tube assays

PubMed Central

Carcelén, María; Abascal, Estefanía; Herranz, Marta; Santantón, Sheila; Zenteno, Roberto; Ruiz Serrano, María Jesús; Bouza, Emilio

2017-01-01

The assignation of lineages in Mycobacterium tuberculosis (MTB) provides valuable information for evolutionary and phylogeographic studies and makes for more accurate knowledge of the distribution of this pathogen worldwide. Differences in virulence have also been found for certain lineages. MTB isolates were initially assigned to lineages based on data obtained from genotyping techniques, such as spoligotyping or MIRU-VNTR analysis, some of which are more suitable for molecular epidemiology studies. However, since these methods are subject to a certain degree of homoplasy, other criteria have been chosen to assign lineages. These are based on targeting robust and specific SNPs for each lineage. Here, we propose two newly designed multiplex targeting methods—both of which are single-tube tests—to optimize the assignation of the six main lineages in MTB. The first method is based on ASO-PCR and offers an inexpensive and easy-to-implement assay for laboratories with limited resources. The other, which is based on SNaPshot, enables more refined standardized assignation of lineages for laboratories with better resources. Both methods performed well when assigning lineages from cultured isolates from a control panel, a test panel, and a problem panel from an unrelated population, Mexico, which included isolates in which standard genotyping was not able to classify lineages. Both tests were also able to assign lineages from stored isolates, without the need for subculture or purification of DNA, and even directly from clinical specimens with a medium-high bacilli burden. Our assays could broaden the contexts where information on lineages can be acquired, thus enabling us to quickly update data from retrospective collections and to merge data with those obtained at the time of diagnosis of a new TB case. PMID:29091913

48 CFR 642.602 - Assignment and location.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 48 Federal Acquisition Regulations System 4 2010-10-01 2010-10-01 false Assignment and location. 642.602 Section 642.602 Federal Acquisition Regulations System DEPARTMENT OF STATE CONTRACT MANAGEMENT CONTRACT ADMINISTRATION AND AUDIT SERVICES Corporate Administration Contracting Officer 642.602 Assignment...

47 CFR 74.402 - Frequency assignment.

Code of Federal Regulations, 2011 CFR

2011-10-01

... two of the following 6.25 kHz segments may be stacked to form a channel which may be assigned for use... paragraph (e)(9) of this section. (b) Up to four of the following 7.5 kHz VHF segments and up to eight of the following 6.25 kHz UHF segments may be stacked to form a channel which may be assigned for use by...

47 CFR 74.402 - Frequency assignment.

Code of Federal Regulations, 2014 CFR

2014-10-01

... two of the following 6.25 kHz segments may be stacked to form a channel which may be assigned for use... paragraph (e)(9) of this section. (b) Up to four of the following 7.5 kHz VHF segments and up to eight of the following 6.25 kHz UHF segments may be stacked to form a channel which may be assigned for use by...

47 CFR 74.402 - Frequency assignment.

Code of Federal Regulations, 2012 CFR

2012-10-01

... two of the following 6.25 kHz segments may be stacked to form a channel which may be assigned for use... paragraph (e)(9) of this section. (b) Up to four of the following 7.5 kHz VHF segments and up to eight of the following 6.25 kHz UHF segments may be stacked to form a channel which may be assigned for use by...

47 CFR 74.402 - Frequency assignment.

Code of Federal Regulations, 2013 CFR

2013-10-01

... two of the following 6.25 kHz segments may be stacked to form a channel which may be assigned for use... paragraph (e)(9) of this section. (b) Up to four of the following 7.5 kHz VHF segments and up to eight of the following 6.25 kHz UHF segments may be stacked to form a channel which may be assigned for use by...

47 CFR 215.2 - Assignment of responsibilities.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 5 2013-10-01 2013-10-01 false Assignment of responsibilities. 215.2 Section 215.2 Telecommunication OFFICE OF SCIENCE AND TECHNOLOGY POLICY AND NATIONAL SECURITY COUNCIL FEDERAL GOVERNMENT FOCAL POINT FOR ELECTROMAGNETIC PULSE (EMP) INFORMATION § 215.2 Assignment of responsibilities...

47 CFR 215.2 - Assignment of responsibilities.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Assignment of responsibilities. 215.2 Section 215.2 Telecommunication OFFICE OF SCIENCE AND TECHNOLOGY POLICY AND NATIONAL SECURITY COUNCIL FEDERAL GOVERNMENT FOCAL POINT FOR ELECTROMAGNETIC PULSE (EMP) INFORMATION § 215.2 Assignment of responsibilities...

47 CFR 215.2 - Assignment of responsibilities.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Assignment of responsibilities. 215.2 Section 215.2 Telecommunication OFFICE OF SCIENCE AND TECHNOLOGY POLICY AND NATIONAL SECURITY COUNCIL FEDERAL GOVERNMENT FOCAL POINT FOR ELECTROMAGNETIC PULSE (EMP) INFORMATION § 215.2 Assignment of responsibilities...

47 CFR 215.2 - Assignment of responsibilities.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 5 2014-10-01 2014-10-01 false Assignment of responsibilities. 215.2 Section 215.2 Telecommunication OFFICE OF SCIENCE AND TECHNOLOGY POLICY AND NATIONAL SECURITY COUNCIL FEDERAL GOVERNMENT FOCAL POINT FOR ELECTROMAGNETIC PULSE (EMP) INFORMATION § 215.2 Assignment of responsibilities...

47 CFR 215.2 - Assignment of responsibilities.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Assignment of responsibilities. 215.2 Section 215.2 Telecommunication OFFICE OF SCIENCE AND TECHNOLOGY POLICY AND NATIONAL SECURITY COUNCIL FEDERAL GOVERNMENT FOCAL POINT FOR ELECTROMAGNETIC PULSE (EMP) INFORMATION § 215.2 Assignment of responsibilities...

Stress Assignment in Reading Italian Polysyllabic Pseudowords

ERIC Educational Resources Information Center

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…

Comparisons of node-based and element-based approaches of assigning bone material properties onto subject-specific finite element models.

PubMed

Chen, G; Wu, F Y; Liu, Z C; Yang, K; Cui, F

2015-08-01

Subject-specific finite element (FE) models can be generated from computed tomography (CT) datasets of a bone. A key step is assigning material properties automatically onto finite element models, which remains a great challenge. This paper proposes a node-based assignment approach and also compares it with the element-based approach in the literature. Both approaches were implemented using ABAQUS. The assignment procedure is divided into two steps: generating the data file of the image intensity of a bone in a MATLAB program and reading the data file into ABAQUS via user subroutines. The node-based approach assigns the material properties to each node of the finite element mesh, while the element-based approach assigns the material properties directly to each integration point of an element. Both approaches are independent from the type of elements. A number of FE meshes are tested and both give accurate solutions; comparatively the node-based approach involves less programming effort. The node-based approach is also independent from the type of analyses; it has been tested on the nonlinear analysis of a Sawbone femur. The node-based approach substantially improves the level of automation of the assignment procedure of bone material properties. It is the simplest and most powerful approach that is applicable to many types of analyses and elements. Copyright © 2015 IPEM. Published by Elsevier Ltd. All rights reserved.

Assigning breed origin to alleles in crossbred animals.

PubMed

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

2016-08-22

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

Problem Solution Project: Transforming Curriculum and Empowering Urban Students and Teachers

ERIC Educational Resources Information Center

Jarrett, Olga S.; Stenhouse, Vera

2011-01-01

This article presents findings of 6 years of implementing a Problem Solution Project, an assignment influenced by service learning, problem-based learning, critical theory, and critical pedagogy whereby teachers help children tackle real problems. Projects of 135 teachers in an urban certification/master's program were summarized by cohort year…

A new algorithm for reliable and general NMR resonance assignment.

PubMed

Schmidt, Elena; Güntert, Peter

2012-08-01

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

Does a Booster Intervention Augment the Preventive Effects of an Abbreviated Version of the Coping Power Program for Aggressive Children?

PubMed Central

Lochman, John E.; Baden, Rachel E.; Boxmeyer, Caroline L.; Powell, Nicole P.; Qu, Lixin; Salekin, Karen L.; Windle, Michel

2013-01-01

Booster interventions have been presumed to be important methods for maintaining the effects of evidence-based programs for children with behavioral problems, but there has been remarkably little empirical attention to this assumption. The present study examines the effect of a child-oriented booster preventive intervention with children who had previously received an abbreviated version (24 child sessions, 10 parent sessions) of the Coping Power targeted prevention program. Two hundred and forty-one children (152 boys, 89 girls) were screened as having moderate to high levels of aggressive behavior in 4th grade, then half were randomly assigned to receive the abbreviated Coping Power program in 5th grade, and half of the preventive intervention children were then randomly assigned to a Booster condition in 6th grade. The Booster sessions consisted of brief monthly individual contacts, and were primarily with the children. Five assessments across four years were collected from teachers, providing a three-year follow-up for all children who participated in the project. Results indicated that the abbreviated Coping Power program (one-third shorter than the full intervention) had long-term effects in reducing children’s externalizing problem behaviors, proactive and reactive aggression, impulsivity traits and callous-unemotional traits. The Booster intervention did not augment these prevention effects. These findings indicate that a briefer and more readily disseminated form of an evidence-based targeted preventive intervention was effective. The findings have potential implications for policy and guidelines about possible intervention length and booster interventions. PMID:23417235

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

NASA Astrophysics Data System (ADS)

Wu, Yingying; Wu, Yaohua

2014-07-01

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

Intuitionistic fuzzy evidential power aggregation operator and its application in multiple criteria decision-making

NASA Astrophysics Data System (ADS)

Jiang, Wen; Wei, Boya

2018-02-01

The theory of intuitionistic fuzzy sets (IFS) is widely used for dealing with vagueness and the Dempster-Shafer (D-S) evidence theory has a widespread use in multiple criteria decision-making problems under uncertain situation. However, there are many methods to aggregate intuitionistic fuzzy numbers (IFNs), but the aggregation operator to fuse basic probability assignment (BPA) is rare. Power average (P-A) operator, as a powerful operator, is useful and important in information fusion. Motivated by the idea of P-A power, in this paper, a new operator based on the IFS and D-S evidence theory is proposed, which is named as intuitionistic fuzzy evidential power average (IFEPA) aggregation operator. First, an IFN is converted into a BPA, and the uncertainty is measured in D-S evidence theory. Second, the difference between BPAs is measured by Jousselme distance and a satisfying support function is proposed to get the support degree between each other effectively. Then the IFEPA operator is used for aggregating the original IFN and make a more reasonable decision. The proposed method is objective and reasonable because it is completely driven by data once some parameters are required. At the same time, it is novel and interesting. Finally, an application of developed models to the 'One Belt, One road' investment decision-making problems is presented to illustrate the effectiveness and feasibility of the proposed operator.

7 CFR 762.160 - Assignment of guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 7 2014-01-01 2014-01-01 false Assignment of guarantee. 762.160 Section 762.160 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.160 Assignment of guarantee. (a) The following...

28 CFR 524.72 - CIM assignment categories.

Code of Federal Regulations, 2010 CFR

2010-07-01

... groups (e.g., prison gangs), which have a history of disrupting operations and security in either state... assignment categories. CIM cases are classified according to the following assignments: (a) Witness Security... safety of these individuals. There are two types of Witness Security cases: Department of Justice...

36 CFR 292.22 - Land category assignments.

Code of Federal Regulations, 2013 CFR

2013-07-01

... the following four land categories: (i) Farm/forest/grazing land. (ii) Mining land. (iii) Residential.... Lands assigned to the Commercial, Residential, or Mining category may be reclassified as farm/forest... 36 Parks, Forests, and Public Property 2 2013-07-01 2013-07-01 false Land category assignments...

36 CFR 292.22 - Land category assignments.

Code of Federal Regulations, 2011 CFR

2011-07-01

... the following four land categories: (i) Farm/forest/grazing land. (ii) Mining land. (iii) Residential.... Lands assigned to the Commercial, Residential, or Mining category may be reclassified as farm/forest... 36 Parks, Forests, and Public Property 2 2011-07-01 2011-07-01 false Land category assignments...

36 CFR 292.22 - Land category assignments.

Code of Federal Regulations, 2012 CFR

2012-07-01

... the following four land categories: (i) Farm/forest/grazing land. (ii) Mining land. (iii) Residential.... Lands assigned to the Commercial, Residential, or Mining category may be reclassified as farm/forest... 36 Parks, Forests, and Public Property 2 2012-07-01 2012-07-01 false Land category assignments...

36 CFR 292.22 - Land category assignments.

Code of Federal Regulations, 2014 CFR

2014-07-01

... the following four land categories: (i) Farm/forest/grazing land. (ii) Mining land. (iii) Residential.... Lands assigned to the Commercial, Residential, or Mining category may be reclassified as farm/forest... 36 Parks, Forests, and Public Property 2 2014-07-01 2014-07-01 false Land category assignments...

Maximizing Completion and Comprehension of Reading Assignments

ERIC Educational Resources Information Center

Owen, Leanne R.

2017-01-01

The author presents self-report data from students in three upper-level undergraduate courses to illustrate the comparative effectiveness of different out-of-class assessment approaches in promoting completion and comprehension of reading assignments. Students reported agreeing or strongly agreeing that all three assignments motivated them to…

Optimization of Personnel Assignment Problem Based on Traveling Time by Using Hungarian Methods: Case Study on the Central Post Office Bandung

NASA Astrophysics Data System (ADS)

Supian, Sudradjat; Wahyuni, Sri; Nahar, Julita; Subiyanto

2018-01-01

In this paper, traveling time workers from the central post office Bandung in delivering the package to the destination location was optimized by using Hungarian method. Sensitivity analysis against data changes that may occur was also conducted. The sampled data in this study are 10 workers who will be assigned to deliver mail package to 10 post office delivery centers in Bandung that is Cikutra, Padalarang, Ujung Berung, Dayeuh Kolot, Asia- Africa, Soreang, Situ Saeur, Cimahi, Cipedes and Cikeruh. The result of this research is optimal traveling time from 10 workers to 10 destination locations. The optimal traveling time required by the workers is 387 minutes to reach the destination. Based on this result, manager of the central post office Bandung can make optimal decisions to assign tasks to their workers.

One of My Favorite Assignments: Automated Teller Machine Simulation.

ERIC Educational Resources Information Center

Oberman, Paul S.

2001-01-01

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

7 CFR 1900.5 - Assignment of cases.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 12 2010-01-01 2010-01-01 false Assignment of cases. 1900.5 Section 1900.5 Agriculture Regulations of the Department of Agriculture (Continued) RURAL HOUSING SERVICE, RURAL BUSINESS... REGULATIONS GENERAL Delegations of Authority § 1900.5 Assignment of cases. The State Director may, in writing...

Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound

NASA Astrophysics Data System (ADS)

Saad, Shakila; Wan Jaafar, Wan Nurhadani; Jamil, Siti Jasmida

2013-04-01

The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented.

College Students' Preferences for Psychotherapy across Depression, Anxiety, Relationship, and Academic Problems

ERIC Educational Resources Information Center

Joyce, Aaron W.; Ross, Michael J.; Vander Wal, Jillon S.; Austin, Chammie C.

2009-01-01

The present study examined differences in college students' preferences for processes of change across four kinds of problems: academic, relationship, depression, and anxiety. Two hundred eighteen undergraduates were randomly assigned to complete either an academic problems, relationship problems, depression, or anxiety Processes of Change…

Exact parallel algorithms for some members of the traveling salesman problem family

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

Pekny, J.F.

1989-01-01

The traveling salesman problem and its many generalizations comprise one of the best known combinatorial optimization problem families. Most members of the family are NP-complete problems so that exact algorithms require an unpredictable and sometimes large computational effort. Parallel computers offer hope for providing the power required to meet these demands. A major barrier to applying parallel computers is the lack of parallel algorithms. The contributions presented in this thesis center around new exact parallel algorithms for the asymmetric traveling salesman problem (ATSP), prize collecting traveling salesman problem (PCTSP), and resource constrained traveling salesman problem (RCTSP). The RCTSP is amore » particularly difficult member of the family since finding a feasible solution is an NP-complete problem. An exact sequential algorithm is also presented for the directed hamiltonian cycle problem (DHCP). The DHCP algorithm is superior to current heuristic approaches and represents the first exact method applicable to large graphs. Computational results presented for each of the algorithms demonstrates the effectiveness of combining efficient algorithms with parallel computing methods. Performance statistics are reported for randomly generated ATSPs with 7,500 cities, PCTSPs with 200 cities, RCTSPs with 200 cities, DHCPs with 3,500 vertices, and assignment problems of size 10,000. Sequential results were collected on a Sun 4/260 engineering workstation, while parallel results were collected using a 14 and 100 processor BBN Butterfly Plus computer. The computational results represent the largest instances ever solved to optimality on any type of computer.« less

Geothermal Energy: Prospects and Problems

ERIC Educational Resources Information Center

Ritter, William W.

1973-01-01

An examination of geothermal energy as a means of increasing the United States power resources with minimal pollution problems. Developed and planned geothermal-electric power installations around the world, capacities, installation dates, etc., are reviewed. Environmental impact, problems, etc. are discussed. (LK)

7 CFR 1210.540 - OMB assigned numbers.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 10 2010-01-01 2010-01-01 false OMB assigned numbers. 1210.540 Section 1210.540 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (MARKETING... Management and Budget (OMB) under the provisions of 44 U.S.C. chapter 35 and have been assigned OMB Control...

Angular aberration in the problem of power beaming to geostationary satellites through the atmosphere.

PubMed

Baryshnikov, F F

1995-10-20

The influence of angular aberration of radiation as a result of the difference in speed of a geostationary satellite and the speed of the Earth's surface on laser power beaming to satellites is considered. Angular aberration makes it impossible to direct the energy to the satellite, and additional beam rotation is necessary. Because the Earth's rotation may cause bad phase restoration, we face a serious problem: how to transfer incoherent radiation to remote satellites. In the framework of the Kolmogorov turbulence model simple conditions of energy transfer are derived and discussed.

Impact of an All-or-Nothing Assignment Requirement under Medicare

PubMed Central

Mitchell, Janet B.; Cromwell, Jerry

1983-01-01

In an effort to raise assignment rates, some policymakers have considered dropping Medicare's case-by-case assignment option. Physicians would have to decide whether to accept all of their patients on assignment, or none of them. In a 1976 national survey, over two-thirds of the physicians stated they would take none of their patients on assignment if forced to choose. Simulation analysis showed that in that event, assignment rates nationwide would fall almost 10 percent. The mean supply of assigned visits would actually increase 11 percent for general practitioners, while decreasing 12-25 percent for general surgeons, internists, and obstetricians/gynecologists. PMID:10310000

An agglomerative hierarchical clustering approach to visualisation in Bayesian clustering problems

PubMed Central

Dawson, Kevin J.; Belkhir, Khalid

2009-01-01

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

Testing the Effectiveness of Online Assignments in Theory of Finance

ERIC Educational Resources Information Center

Batu, Michael; Bower, Nancy; Lun, Esmond; Sadanand, Asha

2018-01-01

The authors investigated the effectiveness of online versus paper assignments using final examination scores in three cohorts of theory of finance. In particular, two cohorts were exposed to online assignments while another cohort was exposed to traditional assignments. The central result is that exposure to online assignments robustly leads to…

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

ERIC Educational Resources Information Center

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…

24 CFR 241.895 - Assignment of insured loans.

Code of Federal Regulations, 2010 CFR

2010-04-01

... AUTHORITIES SUPPLEMENTARY FINANCING FOR INSURED PROJECT MORTGAGES Contract Rights and Obligations-Multifamily Projects Without a HUD-Insured or HUD-Held Mortgage Assignments § 241.895 Assignment of insured loans. (a...

Gain weighted eigenspace assignment

NASA Technical Reports Server (NTRS)

Davidson, John B.; Andrisani, Dominick, II

1994-01-01

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

Scalable Effective Approaches for Quadratic Assignment Problems Based on Conic Optimization and Applications

DTIC Science & Technology

2012-02-09

1nclud1ng suggestions for reduc1ng the burden. to the Department of Defense. ExecutiVe Serv1ce D>rectorate (0704-0188) Respondents should be aware...benchmark problem we contacted Bertrand LeCun who in their poject CHOC from 2005-2008 had applied their parallel B&B framework BOB++ to the RLT1

26 CFR 26.2651-1 - Generation assignment.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 26 Internal Revenue 14 2011-04-01 2010-04-01 true Generation assignment. 26.2651-1 Section 26.2651... TAXES GENERATION-SKIPPING TRANSFER TAX REGULATIONS UNDER THE TAX REFORM ACT OF 1986 § 26.2651-1 Generation assignment. (a) Special rule for persons with a deceased parent—(1) In general. This paragraph (a...

26 CFR 26.2651-1 - Generation assignment.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 26 Internal Revenue 14 2012-04-01 2012-04-01 false Generation assignment. 26.2651-1 Section 26... GIFT TAXES GENERATION-SKIPPING TRANSFER TAX REGULATIONS UNDER THE TAX REFORM ACT OF 1986 § 26.2651-1 Generation assignment. (a) Special rule for persons with a deceased parent—(1) In general. This paragraph (a...

26 CFR 26.2651-1 - Generation assignment.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 26 Internal Revenue 14 2014-04-01 2013-04-01 true Generation assignment. 26.2651-1 Section 26.2651... TAXES GENERATION-SKIPPING TRANSFER TAX REGULATIONS UNDER THE TAX REFORM ACT OF 1986 § 26.2651-1 Generation assignment. (a) Special rule for persons with a deceased parent—(1) In general. This paragraph (a...

26 CFR 26.2651-1 - Generation assignment.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 26 Internal Revenue 14 2013-04-01 2013-04-01 false Generation assignment. 26.2651-1 Section 26... GIFT TAXES GENERATION-SKIPPING TRANSFER TAX REGULATIONS UNDER THE TAX REFORM ACT OF 1986 § 26.2651-1 Generation assignment. (a) Special rule for persons with a deceased parent—(1) In general. This paragraph (a...

The Manifesto Assignment: Study with Women Prisoners

ERIC Educational Resources Information Center

Moore, Lisa Jean

2016-01-01

Lisa Jean Moore describes a class assignment for her Social and Cultural Change course in which she was required to accommodate the material limitations of teaching within a highly regulated and restricted environment. This assignment, carried out in a women's prison, could be adapted for traditional college settings and travel abroad programs,…

Selling the Home Territory: Assignments for International MBA Students.

ERIC Educational Resources Information Center

Reep, Diana C.

2000-01-01

Describes the author's approach to a MBA writing course functioning to connect the writing and oral presentation assignments to the students' current jobs. Notes that most international students lack an understanding of American business practices. Develops the assignments around what the students do know. Notes three assignments including a…

FY17 ISCR Scholar End-of-Assignment Report - Robbie Sadre

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

Sadre, R.

2017-10-20

Throughout this internship assignment, I did various tasks that contributed towards the starting of the SASEDS (Safe Active Scanning for Energy Delivery Systems) and CES-21 (California Energy Systems for the 21st Century) projects in the SKYFALL laboratory. The goal of the SKYFALL laboratory is to perform modeling and simulation verification of transmission power system devices, while integrating with high-performance computing. The first thing I needed to do was acquire official Online LabVIEW training from National Instruments. Through these online tutorial modules, I learned the basics of LabVIEW, gaining experience in connecting to NI devices through the DAQmx API as wellmore » as LabVIEW basic programming techniques (structures, loops, state machines, front panel GUI design etc).« less

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Predicting Faculty Intentions to Assign Writing in Their Classes

ERIC Educational Resources Information Center

Trafimow, David; Ruckel, Lindsay M.; Stovall, Shelly; Raut, Yogesh J.

2017-01-01

Teachers who offer undergraduate courses agree widely on the importance of writing assignments to further undergraduate education. And yet, there is a great deal of variance among teachers in their writing assignments; some teachers assign no writing whatsoever. To determine the variables that influence the decisions of teachers about whether to…

47 CFR 78.35 - Assignment or transfer of control.

Code of Federal Regulations, 2013 CFR

2013-10-01

... CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.35 Assignment or transfer of control. (a) No assignment of the license of a cable television relay station or transfer of control of a CARS... 47 Telecommunication 4 2013-10-01 2013-10-01 false Assignment or transfer of control. 78.35...

47 CFR 78.35 - Assignment or transfer of control.

Code of Federal Regulations, 2014 CFR

2014-10-01

... CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.35 Assignment or transfer of control. (a) No assignment of the license of a cable television relay station or transfer of control of a CARS... 47 Telecommunication 4 2014-10-01 2014-10-01 false Assignment or transfer of control. 78.35...

47 CFR 78.35 - Assignment or transfer of control.

Code of Federal Regulations, 2010 CFR

2010-10-01

... CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.35 Assignment or transfer of control. (a) No assignment of the license of a cable television relay station or transfer of control of a CARS... 47 Telecommunication 4 2010-10-01 2010-10-01 false Assignment or transfer of control. 78.35...

47 CFR 78.35 - Assignment or transfer of control.

Code of Federal Regulations, 2011 CFR

2011-10-01

... CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.35 Assignment or transfer of control. (a) No assignment of the license of a cable television relay station or transfer of control of a CARS... 47 Telecommunication 4 2011-10-01 2011-10-01 false Assignment or transfer of control. 78.35...

42 CFR 435.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 42 Public Health 4 2012-10-01 2012-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 legally able applicants and beneficiaries to: (1) Assign rights to the Medicaid agency to medical support...

42 CFR 435.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 42 Public Health 4 2014-10-01 2014-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 legally able applicants and beneficiaries to: (1) Assign rights to the Medicaid agency to medical support...

42 CFR 435.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 42 Public Health 4 2013-10-01 2013-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 legally able applicants and beneficiaries to: (1) Assign rights to the Medicaid agency to medical support...

47 CFR 78.35 - Assignment or transfer of control.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 4 2012-10-01 2012-10-01 false Assignment or transfer of control. 78.35... CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.35 Assignment or transfer of control. (a) No assignment of the license of a cable television relay station or transfer of control of a CARS...

Tenderfooting: Tackling the Problems of Freshman Writers.

ERIC Educational Resources Information Center

Hobbs, Valerie; Rex-Kerish, Lesley

1986-01-01

University of California writing instructors must teach poorly prepared freshmen how to survive English classes and how to adapt the skills they learn to the rest of their university writing assignments. Reading, thinking, organizing, and stylistic problems are discussed. (MLW)

Gapminder: An AP Human Geography Lab Assignment

ERIC Educational Resources Information Center

Keller, Kenneth H.

2012-01-01

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

36 CFR 292.22 - Land category assignments.

Code of Federal Regulations, 2010 CFR

2010-07-01

... availability of this map or maps in the local newspapers of record. (b) Changes in land category assignment.../grazing land so long as the intended use or development is consistent with the standards in § 292.23 and... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Land category assignments...

12 CFR 563e.28 - Assigned ratings.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Assigned ratings. 563e.28 Section 563e.28 Banks... for Assessing Performance § 563e.28 Assigned ratings. (a) Ratings in general. Subject to paragraphs (b... performance under the lending, investment and service tests, the community development test, the small savings...

Genetic assignment methods for gaining insight into the management of infectious disease by understanding pathogen, vector, and host movement.

PubMed

Remais, Justin V; Xiao, Ning; Akullian, Adam; Qiu, Dongchuan; Blair, David

2011-04-01

For many pathogens with environmental stages, or those carried by vectors or intermediate hosts, disease transmission is strongly influenced by pathogen, host, and vector movements across complex landscapes, and thus quantitative measures of movement rate and direction can reveal new opportunities for disease management and intervention. Genetic assignment methods are a set of powerful statistical approaches useful for establishing population membership of individuals. Recent theoretical improvements allow these techniques to be used to cost-effectively estimate the magnitude and direction of key movements in infectious disease systems, revealing important ecological and environmental features that facilitate or limit transmission. Here, we review the theory, statistical framework, and molecular markers that underlie assignment methods, and we critically examine recent applications of assignment tests in infectious disease epidemiology. Research directions that capitalize on use of the techniques are discussed, focusing on key parameters needing study for improved understanding of patterns of disease.

45 CFR 12.8 - Assignment of surplus real property.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 45 Public Welfare 1 2011-10-01 2011-10-01 false Assignment of surplus real property. 12.8 Section... UTILIZATION OF SURPLUS REAL PROPERTY FOR PUBLIC HEALTH PURPOSES § 12.8 Assignment of surplus real property. (a... for assignment of surplus real property to the Department for transfer for public health purposes will...

42 CFR 436.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 42 Public Health 4 2011-10-01 2011-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...) Assign rights to the Medicaid agency to medical support and to payment for medical care from any third...

42 CFR 435.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2010 CFR

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 legally able applicants and recipients to: (1) Assign rights to the Medicaid agency to medical support and...

42 CFR 436.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 42 Public Health 4 2014-10-01 2014-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...) Assign rights to the Medicaid agency to medical support and to payment for medical care from any third...

42 CFR 435.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 42 Public Health 4 2011-10-01 2011-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 legally able applicants and recipients to: (1) Assign rights to the Medicaid agency to medical support and...

42 CFR 436.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 42 Public Health 4 2012-10-01 2012-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...) Assign rights to the Medicaid agency to medical support and to payment for medical care from any third...

42 CFR 436.610 - Assignment of rights to benefits.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 42 Public Health 4 2013-10-01 2013-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...) Assign rights to the Medicaid agency to medical support and to payment for medical care from any third...

47 CFR 90.723 - Selection and assignment of frequencies.

Code of Federal Regulations, 2012 CFR

2012-10-01

... shall specify the number of frequencies requested. All frequencies in this band will be assigned by the... assigned only the number of channels justified to meet their requirements. (d) Phase I base or fixed station receivers utilizing 221-222 MHz frequencies assigned from Sub-band A as designated in § 90.715(b...

47 CFR 90.723 - Selection and assignment of frequencies.

Code of Federal Regulations, 2013 CFR

2013-10-01

... shall specify the number of frequencies requested. All frequencies in this band will be assigned by the... assigned only the number of channels justified to meet their requirements. (d) Phase I base or fixed station receivers utilizing 221-222 MHz frequencies assigned from Sub-band A as designated in § 90.715(b...

47 CFR 90.723 - Selection and assignment of frequencies.

Code of Federal Regulations, 2014 CFR

2014-10-01

... shall specify the number of frequencies requested. All frequencies in this band will be assigned by the... assigned only the number of channels justified to meet their requirements. (d) Phase I base or fixed station receivers utilizing 221-222 MHz frequencies assigned from Sub-band A as designated in § 90.715(b...

Text Summarization Model based on Facility Location Problem

NASA Astrophysics Data System (ADS)

Takamura, Hiroya; Okumura, Manabu

e propose a novel multi-document generic summarization model based on the budgeted median problem, which is a facility location problem. The summarization method based on our model is an extractive method, which selects sentences from the given document cluster and generates a summary. Each sentence in the document cluster will be assigned to one of the selected sentences, where the former sentece is supposed to be represented by the latter. Our method selects sentences to generate a summary that yields a good sentence assignment and hence covers the whole content of the document cluster. An advantage of this method is that it can incorporate asymmetric relations between sentences such as textual entailment. Through experiments, we showed that the proposed method yields good summaries on the dataset of DUC'04.

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

PubMed

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

2013-11-01

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

48 CFR 42.602 - Assignment and location.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Assignment and location. (a) A CACO may be assigned only when (1) the contractor has at least two locations with resident ACO's or (2) the need for a CACO is approved by the agency head or designee (for this... devoted to a single contractor). One of the resident ACO's may be designated to perform the CACO functions...

48 CFR 42.602 - Assignment and location.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Assignment and location. (a) A CACO may be assigned only when (1) the contractor has at least two locations with resident ACO's or (2) the need for a CACO is approved by the agency head or designee (for this... devoted to a single contractor). One of the resident ACO's may be designated to perform the CACO functions...

Student-Created Homework Problems Based on YouTube Videos

ERIC Educational Resources Information Center

Liberatore, Matthew W.; Marr, David W. M.; Herring, Andrew M.; Way, J. Douglas

2013-01-01

Inspired by YouTube videos, students created homework problems as part of a class project. The project has been successful at different parts of the semester and demonstrated learning of course concepts. These new problems were implemented both in class and as part of homework assignments without significant changes. Examples from a material and…

Problems of reliability and economy work of thermal power plants water treatment based on baromembrane technologies

NASA Astrophysics Data System (ADS)

Chichirova, N. D.; Chichirov, A. A.; Saitov, S. R.

2017-11-01

The introduction of baromembrane water treatment technologies for water desalination at Russian thermal power plants was beganed more than 25 years ago. These technologies have demonstrated their definite advantage over the traditional technologies of additional water treatment for steam boilers. However, there are problems associated with the reliability and economy of their work. The first problem is a large volume of waste water (up to 60% of the initial water). The second problem a expensive and unique chemical reagents complex (biocides, antiscalants, washing compositions) is required for units stable and troublefree operation. Each manufacturer develops his own chemical composition for a certain membrane type. This leads to a significant increase in reagents cost, as well as creates dependence of the technology consumer on the certain supplier. The third problem is that the reliability of the baromembrane units depends directly on the water preliminary treatment. The popular pre-cleaning technology with coagulation of aluminum oxychloride proves to be unacceptable during seasonal changes in the quality of the source water at a number of stations. As a result, pollution, poisoning and lesion of the membrane structure or deterioration of their mechanical properties are observed. The report presents ways to solve these problems.

Mothers' power assertion; children's negative, adversarial orientation; and future behavior problems in low-income families: early maternal responsiveness as a moderator of the developmental cascade.

PubMed

Kim, Sanghag; Kochanska, Grazyna

2015-02-01

Parental power assertion, a key dimension of family environment, generally sets in motion detrimental developmental cascades; however, evidence suggests that other qualities of parenting, such as responsiveness, can significantly moderate those processes. Mechanisms that account for such moderating effects are not fully understood. We propose a conceptual model of processes linking parental power assertion, parental responsiveness, children's negative, adversarial, rejecting orientation toward the parent, and behavior problems. We test that model in a short-term longitudinal design involving 186 low-income, ethnically diverse mothers and their toddlers. When children were 30 months, the dyads were observed in multiple, lengthy, naturalistic laboratory interactions to assess behaviorally mothers' responsiveness and their power-assertive control style. At 33 months, we observed behavioral indicators of children's negative, adversarial, rejecting orientation toward the mothers in several naturalistic and standardized paradigms. At 40 months, mothers rated children's behavior problems. The proposed moderated mediation sequence, tested using a new approach, PROCESS (Hayes, 2013), was supported. The indirect effect from maternal power assertion to children's negative, adversarial orientation to future behavior problems was present when mothers' responsiveness was either low or average but absent when mothers were highly responsive. This study elucidates a potential process that may link parental power assertion with behavior problems and highlights how positive aspects of parenting can moderate this process and defuse maladaptive developmental cascades. It also suggests possible targets for parenting intervention and prevention efforts. PsycINFO Database Record (c) 2015 APA, all rights reserved.

Developing a feasible neighbourhood search for solving hub location problem in a communication network

NASA Astrophysics Data System (ADS)

Rakhmawati, Fibri; Mawengkang, Herman; Buulolo, F.; Mardiningsih

2018-01-01

The hub location with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. This paper discusses how to model the polyhedral properties of the problems and develop a feasible neighbourhood search method to solve the model.

38 CFR 21.4146 - Assignments of benefits prohibited.

Code of Federal Regulations, 2011 CFR

2011-07-01

... (CONTINUED) VOCATIONAL REHABILITATION AND EDUCATION Administration of Educational Assistance Programs Payments; Educational Assistance Allowance § 21.4146 Assignments of benefits prohibited. (a) General... authorized by law. No law specifically authorizes assignments of educational assistance allowances payable...

38 CFR 21.4146 - Assignments of benefits prohibited.

Code of Federal Regulations, 2010 CFR

2010-07-01

... (CONTINUED) VOCATIONAL REHABILITATION AND EDUCATION Administration of Educational Assistance Programs Payments; Educational Assistance Allowance § 21.4146 Assignments of benefits prohibited. (a) General... authorized by law. No law specifically authorizes assignments of educational assistance allowances payable...

A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints

NASA Astrophysics Data System (ADS)

Guo, Peng; Cheng, Wenming; Wang, Yi

2014-10-01

The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel's service time is minimized. A number of heuristics or meta-heuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimization (GEO) is adapted to solve the QCSP with respect to various interference constraints. The resulting GEO is termed the modified GEO. A randomized searching method for neighbouring task-to-QC assignments to an incumbent task-to-QC assignment is developed in executing the modified GEO. In addition, a unidirectional search decoding scheme is employed to transform a task-to-QC assignment to an active quay crane schedule. The effectiveness of the developed GEO is tested on a suite of benchmark problems introduced by K.H. Kim and Y.M. Park in 2004 (European Journal of Operational Research, Vol. 156, No. 3). Compared with other well-known existing approaches, the experiment results show that the proposed modified GEO is capable of obtaining the optimal or near-optimal solution in a reasonable time, especially for large-sized problems.

"Why bother so incredibly much?": student perspectives on PISA science assignments

NASA Astrophysics Data System (ADS)

Serder, Margareta; Jakobsson, Anders

2015-09-01

Large-scale assessment, such as the Programme for International Assessment (PISA), plays an increasingly important role in current educational practice and politics. However, many scholars have questioned the validity and reliability of the tests and the extent to which they actually constitute trustworthy representations of students' knowledge. In the light of such critical voices the present article adopts a sociocultural perspective of human knowledge and action in order to explore the encounters between students and the science test assignments with which their knowledge is tested. Of particular interest in this study are the described "real-life situations" presented as the relevant background in which scientific literacy is assessed in PISA. According to the sociocultural theoretical onset the methodology used to approach the students' meaning making of the image of science as portrayed in the test were collaborative situations in which students work in small groups with units of PISA assignments, enabling a study of student-assignment encounters in action. The data we worked with consists of video-recordings from 71 Swedish 15-year-old students working with three released units from the PISA science test. According to our analysis, the "real-life situations" described in the test emerge as problematic in the students' meaning-making. This is demonstrated for instance by the students' positioning themselves as being different from and opposed to the fictional pictured students who appear in the backstories of the test. This article provides examples of how the scientific and academic language used by the fictional students in the assignments mediates distance and resistance among the students. The fictional students' use of strict scientific language and methods in day-to-day life situations leads them to be perceived as "little scientists" and as elite stereotypes of the scientific culture. We conclude that, by using assignments of this type, measurements of

Modeling regional freight flow assignment through intermodal terminals

DOT National Transportation Integrated Search

2005-03-01

An analytical model is developed to assign regional freight across a multimodal highway and railway network using geographic information systems. As part of the regional planning process, the model is an iterative procedure that assigns multimodal fr...

A New Secondary Structure Assignment Algorithm Using Cα Backbone Fragments

PubMed Central

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

2016-01-01

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

How to Integrate Variable Power Source into a Power Grid

NASA Astrophysics Data System (ADS)

Asano, Hiroshi

This paper discusses how to integrate variable power source such as wind power and photovoltaic generation into a power grid. The intermittent renewable generation is expected to penetrate for less carbon intensive power supply system, but it causes voltage control problem in the distribution system, and supply-demand imbalance problem in a whole power system. Cooperative control of customers' energy storage equipment such as water heater with storage tank for reducing inverse power flow from the roof-top PV system, the operation technique using a battery system and the solar radiation forecast for stabilizing output of variable generation, smart charging of plug-in hybrid electric vehicles for load frequency control (LFC), and other methods to integrate variable power source with improving social benefits are surveyed.

The experience of power: examining the effects of power on approach and inhibition tendencies.

PubMed

Anderson, Cameron; Jennifer, Berdahl L

2002-12-01

Two studies of task-focused dyads tested the approach/inhibition theory of power (D. Keltner, D. H. Gruenfeld, & C. Anderson, in press), which posits that having power increases the tendency to approach and decreases the tendency to inhibit. Results provided preliminary support for the theory: Participants higher in personality dominance or assigned control over resources expressed their true attitudes, experienced more positive and less negative emotion, were more likely to perceive rewards (i.e., that their partner liked them), and were less likely to perceive threats (e.g., that their partner felt anger toward them). Most of these effects were mediated by the sense of power, suggesting that subjective feelings of power are an important component in the effects of power.

Mini-Journals: Incorporating Inquiry, Quantitative Skills and Writing into Homework Assignments for Geochemistry and Planetary Science

NASA Astrophysics Data System (ADS)

Whittington, A. G.; Speck, A.; Witzig, S.

2011-12-01

As part of an NSF-funded project, "CUES: Connecting Undergraduates to the Enterprise of Science," new inquiry-based homework materials were developed for two upper-level classes at the University of Missouri: Geochemistry (required for Geology majors, fulfills the computing requirement by having 50% of the grade come from five spreadsheet-based homework assignments), and Solar System Science (open to seniors and graduate students, co-taught and cross-listed between Geology and Physics & Astronomy). Inquiry involves activities where the learner engages in scientifically oriented questions, gives priority to evidence in responding to questions, formulates explanations from evidence, connects explanations to scientific knowledge, and communicates and justifies explanations. We engage students in inquiry-based learning by presenting homework exercises as "mini-journal" articles that follow the format of a scientific journal article, including a title, authors, abstract, introduction, methods, results, discussion and citations to peer-reviewed literature. The mini-journal provides a scaffold and serves as a springboard for students to develop and carry out their own follow-up investigation. They then present their findings in the form of their own mini-journal. Mini-journals replace traditional homework problem sets with a format that more directly reflects and encourages scientific practice. Students are engaged in inquiry-based homework which encompass doing, thinking, and communicating, while the mini-journal allows the instructor to contain lines of inquiry within the limits posed by available resources. In the examples we present, research is conducted via spreadsheet modeling, where the students develop their own spreadsheets. Example assignments from Geochemistry include "Trace Element Partitioning During Mantle Melting and MORB Crystallization" and "Isotopic Investigations of Crustal Evolution in the Midcontinent US". The key differences between the old and new

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

PubMed Central

Zhang, Xuejun; Lei, Jiaxing

2015-01-01

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

Incorporating Inquiry into Upper-Level Undergraduate Homework Assignments: The Mini-Journal

NASA Astrophysics Data System (ADS)

Whittington, Alan; Speck, Angela; Witzig, Stephen; Abell, Sandra

2010-05-01

The US National Science Education Standards (2000) state that science should be taught through inquiry. The five essential features of classroom inquiry are that the leaner (i) engages in scientifically oriented questions, (ii) gives priority to evidence in responding to questions, (iii) formulates explanations from evidence, (iv) connects explanations to scientific knowledge, and (v) communicates and justifies explanations. One difficulty in achieving this vision at the university level lies in the common perception that inquiry be fully open and unstructured, and that its implementation will be impractical due to time and material constraints. In an NSF-funded project, "CUES: Connecting Undergraduates to the Enterprise of Science," faculty developed new inquiry-based laboratory curriculum materials using a "mini-journal" approach, which is designed as an alternative to the cookbook laboratory and represents the way that scientists do science. Here we adapt this approach to a homework assignment in an upper-level Planetary Science class, and show that inquiry is achievable in this setting. Traditional homeworks in this class consisted of problem sets requiring algebraic manipulation, computation, and in most cases an appraisal of the result Longer questions are broken down into chunks worth 1 to 4 points. In contrast, the mini-journal is a short article that is modeled in the way that scientists do and report science. It includes a title, abstract, introduction (with clear statement of the problem to be tackled), a description of the methods, results (presented as both tables and graphs), a discussion (with suggestions for future work) and a list of cited work. Students devise their research questions and hypothesis from the paper based on a logical next step in the investigation. Guiding questions in the discussion can assist the students ("it would be interesting to evaluate the effect of ..."). Students submit their own minijournal, using the same journal

Understanding Test-Type Assignment: Why Do Special Educators Make Unexpected Test-Type Assignments?

ERIC Educational Resources Information Center

Cho, Hyun-Jeong; Kingston, Neal

2014-01-01

We interviewed special educators (a) whose students with disabilities (SWDs) were proficient on the 2008 general education assessment but were assigned to the 2009 alternate assessment based on modified achievement standards (AA-MAS), and (b) whose students with mild disabilities took the 2008 alternate assessment based on alternate achievement…

Formative feedback and scaffolding for developing complex problem solving and modelling outcomes

NASA Astrophysics Data System (ADS)

Frank, Brian; Simper, Natalie; Kaupp, James

2018-07-01

This paper discusses the use and impact of formative feedback and scaffolding to develop outcomes for complex problem solving in a required first-year course in engineering design and practice at a medium-sized research-intensive Canadian university. In 2010, the course began to use team-based, complex, open-ended contextualised problems to develop problem solving, communications, teamwork, modelling, and professional skills. Since then, formative feedback has been incorporated into: task and process-level feedback on scaffolded tasks in-class, formative assignments, and post-assignment review. Development in complex problem solving and modelling has been assessed through analysis of responses from student surveys, direct criterion-referenced assessment of course outcomes from 2013 to 2015, and an external longitudinal study. The findings suggest that students are improving in outcomes related to complex problem solving over the duration of the course. Most notably, the addition of new feedback and scaffolding coincided with improved student performance.

The assignment of scores procedure for ordinal categorical data.

PubMed

Chen, Han-Ching; Wang, Nae-Sheng

2014-01-01

Ordinal data are the most frequently encountered type of data in the social sciences. Many statistical methods can be used to process such data. One common method is to assign scores to the data, convert them into interval data, and further perform statistical analysis. There are several authors who have recently developed assigning score methods to assign scores to ordered categorical data. This paper proposes an approach that defines an assigning score system for an ordinal categorical variable based on underlying continuous latent distribution with interpretation by using three case study examples. The results show that the proposed score system is well for skewed ordinal categorical data.

Consistent assignment of nurse aides: association with turnover and absenteeism.

PubMed

Castle, Nicholas G

2013-01-01

Consistent assignment refers to the same caregivers consistently caring for the same residents almost every time caregivers are on duty. This article examines the association of consistent assignment of nurse aides with turnover and absenteeism. Data came from a survey of nursing home administrators, the Online Survey Certification and Reporting data, and the Area Resource File. The measures were from 2007 and came from 3,941 nursing homes. Multivariate logistic regression models were used to examine turnover and absenteeism. An average of 68% of nursing homes reported using consistent assignment, with 28% of nursing homes using nurse aides consistent assignment at the often recommended level of 85% (or more). Nursing homes using recommended levels of consistent assignment had significantly lower rates of turnover and of absenteeism. In the multivariate analyses, consistent assignment was significantly associated with both lower turnover and lower absenteeism (p < .01). Consistent assignment is a practice recommended by many policy makers, government agencies, and industry advocates. The findings presented here provide some evidence that the use of this staffing practice can be beneficial.

77 FR 8174 - EPAAR Prescription for Work Assignments

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-14

...: EPA will amend the EPA Acquisition Regulation (EPAAR) prescription for the work assignment clause. This final rule provides revised language to the prescription for the work assignment clause, incorporating prescriptive language that provides further instructions on the use of the related clause. DATES...

Calibrated peer review assignments for the earth sciences

USGS Publications Warehouse

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.

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

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

Developing Foram-AMBI for biomonitoring in the Mediterranean: Species assignments to ecological categories

USGS Publications Warehouse

Jorissen, Frans; Nardelli, Maria P.; Almogi-Labin, Ahuva; Barras, Christine; Bergamin, Luisa; Bicchi, Erica; El Kateb, Akram; Ferraro, Luciana; McGann, Mary; Morigi, Caterina; Romano, Elena; Sabattini, Anna; Schweizer, Magali; Spezzaferri, Silvia

2018-01-01

Most environmental bio-monitoring methods using the species composition of marine faunas define the Ecological Quality Status of soft bottom ecosystems based on the relative proportions of species assigned to a limited number of ecological categories. In this study we analyse the distribution patterns of benthic foraminifera in the Mediterranean as a function of organic carbon gradients on the basis of 15 publications and assign the individual species to five ecological categories. Our categories (of sensitive, indifferent and 3rd, 2nd and 1st order opportunists) are very similar to the ecological categories commonly used for macrofauna, but show some minor differences. In the 15 analysed publications, we considered the numerical data of 493 taxa, of which 199 could be assigned. In all 79 taxa were classified as sensitive, 60 as indifferent, 46 as 3rd order, 12 as 2nd order and 2 as 1st order opportunists. The remaining 294 taxa are all accessory, and will only marginally contribute to biotic indices based on relative species proportions. In this paper we wanted also to explain the methodology we used for these species assignments, paying particular attention to all complications and problems encountered. We think that the species list proposed here will constitute a highly useful tool for foraminiferal bio-monitoring of soft bottoms in the Mediterranean Sea, which can be used in different ecological indices (Foram-AMBI and similar methods). With additional information becoming available in the next few years, it will be possible to expand the list, and, if necessary, to apply some minor corrections. As a next step, we intend to test this species list using several biotic indices, in a number of independent data sets, as soon as these will become available.

Undertaking an International Assignment.

ERIC Educational Resources Information Center

Kitinoja, Lisa; And Others

Agricultural and extension educators interested in international agricultural development must answer several questions to become oriented within the field before undertaking an international assignment. The questions are as follows: (1) why do you want to work internationally? (2) what do you have to offer as a professional? and (3) what is your…

From course assignment paper to publishable manuscript.