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.

MILP model for integrated balancing and sequencing mixed-model two-sided assembly line with variable launching interval and assignment restrictions

NASA Astrophysics Data System (ADS)

Azmi, N. I. L. Mohd; Ahmad, R.; Zainuddin, Z. M.

2017-09-01

This research explores the Mixed-Model Two-Sided Assembly Line (MMTSAL). There are two interrelated problems in MMTSAL which are line balancing and model sequencing. In previous studies, many researchers considered these problems separately and only few studied them simultaneously for one-sided line. However in this study, these two problems are solved simultaneously to obtain more efficient solution. The Mixed Integer Linear Programming (MILP) model with objectives of minimizing total utility work and idle time is generated by considering variable launching interval and assignment restriction constraint. The problem is analysed using small-size test cases to validate the integrated model. Throughout this paper, numerical experiment was conducted by using General Algebraic Modelling System (GAMS) with the solver CPLEX. Experimental results indicate that integrating the problems of model sequencing and line balancing help to minimise the proposed objectives function.

Federal Aviation Administration's Runway Incursion Program

DOT National Transportation Integrated Search

1997-12-08

To reverse the upward trend in runway incursions, FAA must have a strong : Runway Incursion Program to solve systemwide problems and expedite : solutions. The Office of Inspector General report recommends that FAA (1) assign specific responsibility f...

Overcoming an obstacle in expanding a UMLS semantic type extent.

PubMed

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

2012-02-01

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

Overcoming an Obstacle in Expanding a UMLS Semantic Type Extent

PubMed Central

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

2011-01-01

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

DESIGNING PROCESSES FOR ENVIRONMENTAL PROBLEMS

EPA Science Inventory

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

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

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

NASA Astrophysics Data System (ADS)

Barnawi, Waleed T.

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

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

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

ERIC Educational Resources Information Center

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

2011-01-01

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

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 solving the fleet assignment problem over a periodic schedule in the case where there is a flexibility on the flight departure times and the fleet size must be minimized. Moreover, the objective of this model includes the impact on the passenger demand for each flight of the variation of the flight departure times and the closing of the departure times of consecutive flights connecting the same pairs of stations. (Abstract shortened by UMI.)

Simulated annealing algorithm for solving chambering student-case assignment problem

NASA Astrophysics Data System (ADS)

Ghazali, Saadiah; Abdul-Rahman, Syariza

2015-12-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-07-01

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

Causal Responsibility and Counterfactuals

ERIC Educational Resources Information Center

Lagnado, David A.; Gerstenberg, Tobias; Zultan, Ro'i

2013-01-01

How do people attribute responsibility in situations where the contributions of multiple agents combine to produce a joint outcome? The prevalence of over-determination in such cases makes this a difficult problem for counterfactual theories of causal responsibility. In this article, we explore a general framework for assigning responsibility in…

Discrete Mathematics Course Supported by CAS MATHEMATICA

ERIC Educational Resources Information Center

Ivanov, O. A.; Ivanova, V. V.; Saltan, A. A.

2017-01-01

In this paper, we discuss examples of assignments for a course in discrete mathematics for undergraduate students majoring in business informatics. We consider several problems with computer-based solutions and discuss general strategies for using computers in teaching mathematics and its applications. In order to evaluate the effectiveness of our…

Adaptive Control Strategies for Flexible Robotic Arm

NASA Technical Reports Server (NTRS)

Bialasiewicz, Jan T.

1996-01-01

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

Experiences with general practitioners described by families of children with intellectual disabilities and challenging behaviour: a qualitative study

PubMed Central

Lien, Lars; Danbolt, Lars J; Kjønsberg, Kari; Haavet, Ole R

2011-01-01

Objective To investigate parents' experiences of follow-up by general practitioners (GPs) of children with intellectual disabilities (ID) and comorbid behavioural and/or psychological problems. Design Qualitative study based on in-depth interviews with parents of children with ID and a broad range of accompanying health problems. Setting County centred study in Norway involving primary and specialist care. Participants Nine parents of seven children with ID, all received services from an assigned GP and a specialist hospital department. Potential participants were identified by the specialist hospital department and purposefully selected by the authors to represent both genders and a range of diagnoses, locations and assigned GPs. Results Three clusters of experiences emerged from the analysis: expectations, relationships and actual use. The participants had low expectations of the GPs' competence and involvement with their child, and primarily used the GP for the treatment of simple somatic problems. Only one child regularly visited their GP for general and mental health check-ups. The participants' experience of their GPs was that they did not have time and were not interested in the behavioural and mental problems of these children. Conclusions Families with children with ID experience a complex healthcare system in situations where they are vulnerable to lack of information, involvement and competence. GPs are part of a stable service system and are in a position to provide security, help and support to these families. Parents' experiences could be improved by regular health checks for their children and GPs being patient, taking time and showing interest in challenging behaviour. PMID:22123921

Navigating complex decision spaces: Problems and paradigms in sequential choice

PubMed Central

Walsh, Matthew M.; Anderson, John R.

2015-01-01

To behave adaptively, we must learn from the consequences of our actions. Doing so is difficult when the consequences of an action follow a delay. This introduces the problem of temporal credit assignment. When feedback follows a sequence of decisions, how should the individual assign credit to the intermediate actions that comprise the sequence? Research in reinforcement learning provides two general solutions to this problem: model-free reinforcement learning and model-based reinforcement learning. In this review, we examine connections between stimulus-response and cognitive learning theories, habitual and goal-directed control, and model-free and model-based reinforcement learning. We then consider a range of problems related to temporal credit assignment. These include second-order conditioning and secondary reinforcers, latent learning and detour behavior, partially observable Markov decision processes, actions with distributed outcomes, and hierarchical learning. We ask whether humans and animals, when faced with these problems, behave in a manner consistent with reinforcement learning techniques. Throughout, we seek to identify neural substrates of model-free and model-based reinforcement learning. The former class of techniques is understood in terms of the neurotransmitter dopamine and its effects in the basal ganglia. The latter is understood in terms of a distributed network of regions including the prefrontal cortex, medial temporal lobes cerebellum, and basal ganglia. Not only do reinforcement learning techniques have a natural interpretation in terms of human and animal behavior, but they also provide a useful framework for understanding neural reward valuation and action selection. PMID:23834192

Cheating on Multiple-Choice Exams: Monitoring, Assessment, and an Optional Assignment

ERIC Educational Resources Information Center

Nath, Leda; Lovaglia, Michael

2009-01-01

Academic dishonesty is unethical. Exam cheating is viewed as more serious than most other forms (Pincus and Schmelkin 2003). The authors review the general cheating problem, introduce a program to conservatively identify likely cheaters on multiple-choice exams, and offer a procedure for handling likely cheaters. Feedback from students who confess…

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

PubMed

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

2018-02-15

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function. Under this framework, each of the elementary landscapes obtained from the decomposition is considered as an independent objective function to optimise. In order to illustrate this general methodology, we consider four problems from different domains: the quadratic assignment problem and the linear ordering problem (permutation domain), the 0-1 unconstrained quadratic optimisation problem (binary domain), and the frequency assignment problem (integer domain). We implemented two widely known multi-objective algorithms, NSGA-II and SPEA2, and compared their performance with that of a single-objective GA. The experiments conducted on a large benchmark of instances of the four problems show that the multi-objective algorithms clearly outperform the single-objective approaches. Furthermore, a discussion on the results suggests that the multi-objective space generated by this decomposition enhances the exploration ability, thus permitting NSGA-II and SPEA2 to obtain better results in the majority of the tested instances.

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, combining term-strength, FCA, and information retrieval techniques, significantly improved recall and performed well according to example-based metrics.

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 new multi-topic assignment method, combining term-strength, FCA, and information retrieval techniques, significantly improved recall and performed well according to example-based metrics. PMID:25086916

Program Helps To Determine Chemical-Reaction Mechanisms

NASA Technical Reports Server (NTRS)

Bittker, D. A.; Radhakrishnan, K.

1995-01-01

General Chemical Kinetics and Sensitivity Analysis (LSENS) computer code developed for use in solving complex, homogeneous, gas-phase, chemical-kinetics problems. Provides for efficient and accurate chemical-kinetics computations and provides for sensitivity analysis for variety of problems, including problems involving honisothermal conditions. Incorporates mathematical models for static system, steady one-dimensional inviscid flow, reaction behind incident shock wave (with boundary-layer correction), and perfectly stirred reactor. Computations of equilibrium properties performed for following assigned states: enthalpy and pressure, temperature and pressure, internal energy and volume, and temperature and volume. Written in FORTRAN 77 with exception of NAMELIST extensions used for input.

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.

On designing for quality

NASA Technical Reports Server (NTRS)

Vajingortin, L. D.; Roisman, W. P.

1991-01-01

The problem of ensuring the required quality of products and/or technological processes often becomes more difficult due to the fact that there is not general theory of determining the optimal sets of value of the primary factors, i.e., of the output parameters of the parts and units comprising an object and ensuring the correspondence of the object's parameters to the quality requirements. This is the main reason for the amount of time taken to finish complex vital article. To create this theory, one has to overcome a number of difficulties and to solve the following tasks: the creation of reliable and stable mathematical models showing the influence of the primary factors on the output parameters; finding a new technique of assigning tolerances for primary factors with regard to economical, technological, and other criteria, the technique being based on the solution of the main problem; well reasoned assignment of nominal values for primary factors which serve as the basis for creating tolerances. Each of the above listed tasks is of independent importance. An attempt is made to give solutions for this problem. The above problem dealing with quality ensuring an mathematically formalized aspect is called the multiple inverse problem.

Solving multiconstraint assignment problems using learning automata.

PubMed

Horn, Geir; Oommen, B John

2010-02-01

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

Off-road vehicle trends

Treesearch

Garrell E. Nicholes

1980-01-01

Today I would like to start this part of my program by generally describing the vehicles, the users, and the current problems. Later on I will break out specifically motorcycles and snowmobiles to discuss. When I was asked, approximately a year ago, to fill this assignment, I began by telephoning those I knew in public and private ORV management positions. I sent...

Comparison of the Effects of Computer-Based Practice and Conceptual Understanding Interventions on Mathematics Fact Retention and Generalization

ERIC Educational Resources Information Center

Kanive, Rebecca; Nelson, Peter M.; Burns, Matthew K.; Ysseldyke, James

2014-01-01

The authors' purpose was to determine the effects of computer-based practice and conceptual interventions on computational fluency and word-problem solving of fourth- and fifth-grade students with mathematics difficulties. A randomized pretest-posttest control group design found that students assigned to the computer-based practice intervention…

School Finance Case Study: Dealing with a School District Budget Deficit

ERIC Educational Resources Information Center

Kersten, Thomas

2007-01-01

This case study-based class assignment (see Appendix A) is designed as a culminating course activity through which students demonstrate not only their understanding of school finance basics but also show how to apply their knowledge to solving a problem impacting many public school administrators today. Because the case study is general in design,…

Unifying Temporal and Structural Credit Assignment Problems

NASA Technical Reports Server (NTRS)

Agogino, Adrian K.; Tumer, Kagan

2004-01-01

Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the structural credit assignment problem of determining the contributions of a particular agent to a common task. Instead, time-extended single-agent systems have the temporal credit assignment problem of determining the contribution of a particular action to the quality of the full sequence of actions. Traditionally these two problems are considered different and are handled in separate ways. In this article we show how these two forms of the credit assignment problem are equivalent. In this unified frame-work, a single-agent Markov decision process can be broken down into a single-time-step multi-agent process. Furthermore we show that Monte-Carlo estimation or Q-learning (depending on whether the values of resulting actions in the episode are known at the time of learning) are equivalent to different agent utility functions in a multi-agent system. This equivalence shows how an often neglected issue in multi-agent systems is equivalent to a well-known deficiency in multi-time-step learning and lays the basis for solving time-extended multi-agent problems, where both credit assignment problems are present.

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.

A Multiple Ant Colony Metahuristic for the Air Refueling Tanker Assignment Problem

DTIC Science & Technology

2002-03-01

Problem The tanker assignment problem can be modeled as a job shop scheduling problem ( JSSP ). The JSSP is made up of n jobs, composed of m ordered...points) to be processed on all the machines (tankers). The problem with using JSSP is that the tanker assignment problem has multiple objectives... JSSP will minimize the time it takes for all jobs, but this may take an inordinate number of tankers. Thus using JSSP alone is not necessarily a good

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.

Evolutionary squeaky wheel optimization: a new framework for analysis.

PubMed

Li, Jingpeng; Parkes, Andrew J; Burke, Edmund K

2011-01-01

Squeaky wheel optimization (SWO) is a relatively new metaheuristic that has been shown to be effective for many real-world problems. At each iteration SWO does a complete construction of a solution starting from the empty assignment. Although the construction uses information from previous iterations, the complete rebuilding does mean that SWO is generally effective at diversification but can suffer from a relatively weak intensification. Evolutionary SWO (ESWO) is a recent extension to SWO that is designed to improve the intensification by keeping the good components of solutions and only using SWO to reconstruct other poorer components of the solution. In such algorithms a standard challenge is to understand how the various parameters affect the search process. In order to support the future study of such issues, we propose a formal framework for the analysis of ESWO. The framework is based on Markov chains, and the main novelty arises because ESWO moves through the space of partial assignments. This makes it significantly different from the analyses used in local search (such as simulated annealing) which only move through complete assignments. Generally, the exact details of ESWO will depend on various heuristics; so we focus our approach on a case of ESWO that we call ESWO-II and that has probabilistic as opposed to heuristic selection and construction operators. For ESWO-II, we study a simple problem instance and explicitly compute the stationary distribution probability over the states of the search space. We find interesting properties of the distribution. In particular, we find that the probabilities of states generally, but not always, increase with their fitness. This nonmonotonocity is quite different from the monotonicity expected in algorithms such as simulated annealing.

CONNJUR R: An annotation strategy for fostering reproducibility in bio-NMR: protein spectral assignment

PubMed Central

Fenwick, Matthew; Hoch, Jeffrey C.; Ulrich, Eldon; Gryk, Michael R.

2015-01-01

Reproducibility is a cornerstone of the scientific method, essential for validation of results by independent laboratories and the sine qua non of scientific progress. A key step toward reproducibility of biomolecular NMR studies was the establishment of public data repositories (PDB and BMRB). Nevertheless, bio-NMR studies routinely fall short of the requirement for reproducibility that all the data needed to reproduce the results are published. A key limitation is that considerable metadata goes unpublished, notably manual interventions that are typically applied during the assignment of multidimensional NMR spectra. A general solution to this problem has been elusive, in part because of the wide range of approaches and software packages employed in the analysis of protein NMR spectra. Here we describe an approach for capturing missing metadata during the assignment of protein NMR spectra that can be generalized to arbitrary workflows, different software packages, other biomolecules, or other stages of data analysis in bio-NMR. We also present extensions to the NMR-STAR data dictionary that enable machine archival and retrieval of the “missing” metadata. PMID:26253947

The petroleum explorationist's guide to contracts used in oil and gas operations

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

Mosburg, L.G. Jr.

This volume provides articles and current sample forms of contract negotiation and drafting. The contents include: An introduction to oil and gas contracts; Effective deal negotiation; General principles of contract law and negotiation; Problems and pitfalls in support agreements; Sample support agreements; Basic concept of farmout agreements; Farmout negotiation checklist; ''Area of mutual interest'' provisions, Problems and pitfalls in 'contract (minimum) depth' and 'farmout (earned) depth' provisions; Options in interests assigned and reserved; Sample 'AMI' provision; ''conventional'' and ''revenue ruling 77-176'' farmout agreement forms; the AAPL model from operating agreement; 1982 revisions to the model form; Side-by-side comparisons of themore » 1956, 1977 and 1982 model forms, 1984 (1985) COPAS accounting procedure; Tax consequences of oil and gas exploration and development, revenue ruling 77-176; Use of tax partnerships and present assignments; Also materials on gas balancing agreements: Seismic options; and Structuring considerations.« less

Relabeling exchange method (REM) for learning in neural networks

NASA Astrophysics Data System (ADS)

Wu, Wen; Mammone, Richard J.

1994-02-01

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

An Efficacy Study of Interleaved Mathematics Practice. Revised

ERIC Educational Resources Information Center

Rohrer, Doug; Dedrick, Robert F.; Burgess, Kaleena

2013-01-01

In a typical mathematics course, the material is divided into many lessons, and each lesson is followed by an assignment consisting of practice problems. Most commonly, each assignment consists solely of problems on the preceding lesson. For example, a lesson on ratios might be followed by an assignment with 12 problems on ratios. In other words,…

The value of physical examination in mental health nursing.

PubMed

Martin, Carolyn T

2016-03-01

This article explores the use of a physical examination assignment in a mental health general nursing clinical placement course that addresses the poor physical health of people with mental illness and the barriers traditionally impeding health care provision for this population. A descriptive qualitative approach utilizes inductive content analysis to investigate 145 student survey responses. The assignment assists student nurses in understanding that physical and mental well-being are intrinsically linked. Students report increased comfort performing a physical examination on patients with mental illness post assignment. Students' initial bias towards this population was minimized post the clinical assignment. Poor physical health is common among people with mental health problems. Many view the provision of care as a major public health issue. Nurses are the front line caregivers of mental health service consumers and are well positioned to assess their physical needs. Their assessment may be the first step in recognizing health care issues in this population. Copyright © 2015 Elsevier Ltd. All rights reserved.

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.

QUICR-learning for Multi-Agent Coordination

NASA Technical Reports Server (NTRS)

Agogino, Adrian K.; Tumer, Kagan

2006-01-01

Coordinating multiple agents that need to perform a sequence of actions to maximize a system level reward requires solving two distinct credit assignment problems. First, credit must be assigned for an action taken at time step t that results in a reward at time step t > t. Second, credit must be assigned for the contribution of agent i to the overall system performance. The first credit assignment problem is typically addressed with temporal difference methods such as Q-learning. The second credit assignment problem is typically addressed by creating custom reward functions. To address both credit assignment problems simultaneously, we propose the "Q Updates with Immediate Counterfactual Rewards-learning" (QUICR-learning) designed to improve both the convergence properties and performance of Q-learning in large multi-agent problems. QUICR-learning is based on previous work on single-time-step counterfactual rewards described by the collectives framework. Results on a traffic congestion problem shows that QUICR-learning is significantly better than a Q-learner using collectives-based (single-time-step counterfactual) rewards. In addition QUICR-learning provides significant gains over conventional and local Q-learning. Additional results on a multi-agent grid-world problem show that the improvements due to QUICR-learning are not domain specific and can provide up to a ten fold increase in performance over existing methods.

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.

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.

The airport gate assignment problem: a survey.

PubMed

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

2014-01-01

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

The Airport Gate Assignment Problem: A Survey

PubMed Central

Ghaleb, Mageed A.; Salem, Ahmed M.

2014-01-01

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

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

Estimation of sex-specific survival from capture-recapture data when sex is not always known

USGS Publications Warehouse

Nichols, J.D.; Kendall, W.L.; Hines, J.E.; Spendelow, J.A.

2004-01-01

Many animals lack obvious sexual dimorphism, making assignment of sex difficult even for observed or captured animals. For many such species it is possible to assign sex with certainty only at some occasions; for example, when they exhibit certain types of behavior. A common approach to handling this situation in capture-recapture studies has been to group capture histories into those of animals eventually identified as male and female and those for which sex was never known. Because group membership is dependent on the number of occasions at which an animal was caught or observed (known sex animals, on average, will have been observed at more occasions than unknown-sex animals), survival estimates for known-sex animals will be positively biased, and those for unknown animals will be negatively biased. In this paper, we develop capture-recapture models that incorporate sex ratio and sex assignment parameters that permit unbiased estimation in the face of this sampling problem. We demonstrate the magnitude of bias in the traditional capture-recapture approach to this sampling problem, and we explore properties of estimators from other ad hoc approaches. The model is then applied to capture-recapture data for adult Roseate Terns (Sterna dougallii) at Falkner Island, Connecticut, 1993-2002. Sex ratio among adults in this population favors females, and we tested the hypothesis that this population showed sex-specific differences in adult survival. Evidence was provided for higher survival of adult females than males, as predicted. We recommend use of this modeling approach for future capture-recapture studies in which sex cannot always be assigned to captured or observed animals. We also place this problem in the more general context of uncertainty in state classification in multistate capture-recapture models.

Effects of a Multitier Support System on Calculation, Word Problem, and Prealgebraic Performance Among At-Risk Learners.

PubMed

Powell, Sarah R; Fuchs, Lynn S; Cirino, Paul T; Fuchs, Douglas; Compton, Donald L; Changas, Paul C

2015-07-01

The focus of the present study was enhancing word-problem and calculation achievement in ways that support pre-algebraic thinking among 2 nd -grade students at risk for mathematics difficulty. Intervention relied on a multi-tier support system (i.e., responsiveness-to-intervention or RTI) in which at-risk students participate in general classroom instruction and receive supplementary small-group tutoring. Participants were 265 students in 110 classrooms in 25 schools. Teachers were randomly assigned to 3 conditions: calculation RTI, word-problem RTI, and business-as-usual control. Intervention lasted 17 weeks. Multilevel modeling indicated that calculation RTI improved calculation but not word-problem outcomes; word-problem RTI enhanced proximal word-problem outcomes as well as performance on some calculation outcomes; and word-problem RTI provided a stronger route than calculation RTI to pre-algebraic knowledge.

Effects of a Multitier Support System on Calculation, Word Problem, and Prealgebraic Performance Among At-Risk Learners

PubMed Central

Powell, Sarah R.; Fuchs, Lynn S.; Cirino, Paul T.; Fuchs, Douglas; Compton, Donald L.; Changas, Paul C.

2014-01-01

The focus of the present study was enhancing word-problem and calculation achievement in ways that support pre-algebraic thinking among 2nd-grade students at risk for mathematics difficulty. Intervention relied on a multi-tier support system (i.e., responsiveness-to-intervention or RTI) in which at-risk students participate in general classroom instruction and receive supplementary small-group tutoring. Participants were 265 students in 110 classrooms in 25 schools. Teachers were randomly assigned to 3 conditions: calculation RTI, word-problem RTI, and business-as-usual control. Intervention lasted 17 weeks. Multilevel modeling indicated that calculation RTI improved calculation but not word-problem outcomes; word-problem RTI enhanced proximal word-problem outcomes as well as performance on some calculation outcomes; and word-problem RTI provided a stronger route than calculation RTI to pre-algebraic knowledge. PMID:26097244

A biologically inspired neural network for dynamic programming.

PubMed

Francelin Romero, R A; Kacpryzk, J; Gomide, F

2001-12-01

An artificial neural network with a two-layer feedback topology and generalized recurrent neurons, for solving nonlinear discrete dynamic optimization problems, is developed. A direct method to assign the weights of neural networks is presented. The method is based on Bellmann's Optimality Principle and on the interchange of information which occurs during the synaptic chemical processing among neurons. The neural network based algorithm is an advantageous approach for dynamic programming due to the inherent parallelism of the neural networks; further it reduces the severity of computational problems that can occur in methods like conventional methods. Some illustrative application examples are presented to show how this approach works out including the shortest path and fuzzy decision making problems.

Prevalence of the Wish to be of the Opposite Gender in Adolescents and Adults with Autism Spectrum Disorder.

PubMed

van der Miesen, Anna I R; Hurley, Hannah; Bal, Anneloes M; de Vries, Annelou L C

2018-05-07

Several studies have suggested an overrepresentation of (symptoms of) autism spectrum disorder (ASD) among individuals with gender dysphoria. Three studies have taken the inverse approach in children with ASD and showed increased parent report of the wish to be of the opposite gender in this group. This study compared the self-reported wish to be of the opposite gender (one item of the Youth Self-Report [YSR] and the Adult Self-Report [ASR]) of 573 adolescents (469 assigned boys and 104 assigned girls) and 807 adults (616 assigned males and 191 assigned females) with ASD to 1016 adolescents and 846 adults from the general population. Emotional and behavioral problems were measured by the DSM-oriented scales of the YSR and ASR. In addition, the Children's Social Behavior Questionnaire and the Adult Social Behavior Questionnaire were used to measure specific subdomains of the ASD spectrum to test whether specific subdomains of ASD were particularly involved. Significantly more adolescents (6.5%) and adults (11.4%) with ASD endorsed this item as compared to the general population (3-5%). In adolescents, assigned girls endorsed this item more than assigned boys. No significant gender differences were found in the adults with ASD. In addition, on all DSM-oriented scales of both the YSR and ASR, adolescents and adults with ASD who endorsed the gender item had significantly higher scores compared to those without. There were no significant associations between endorsement of the gender item and any specific subdomain of ASD, providing no evidence for a sole role of one of the ASD subdomains and endorsement of the wish to be the opposite gender.

Decision Making In Assignment Problem With Multiple Attributes Under Intuitionistic Fuzzy Environment

NASA Astrophysics Data System (ADS)

Mukherjee, Sathi; Basu, Kajla

2010-10-01

In this paper we develop a methodology to solve the multiple attribute assignment problems where the attributes are considered to be Intuitionistic Fuzzy Sets (IFS). We apply the concept of similarity measures of IFS to solve the Intuitionistic Fuzzy Multi-Attribute Assignment Problem (IFMAAP). The weights of the attributes are determined from expert opinion. An illustrative example is solved to verify the developed approach and to demonstrate its practicality.

A randomized controlled trial of a Dutch version of systems training for emotional predictability and problem solving for borderline personality disorder.

PubMed

Bos, Elisabeth H; van Wel, E Bas; Appelo, Martin T; Verbraak, Marc J P M

2010-04-01

Systems Training for Emotional Predictability and Problem Solving (STEPPS) is a group treatment for persons with borderline personality disorder (BPD) that is relatively easy to implement. We investigated the efficacy of a Dutch version of this treatment (VERS). Seventy-nine DSM-IV BPD patients were randomly assigned to STEPPS plus an adjunctive individual therapy, or to treatment as usual. Assessments took place before and after the intervention, and at a 6-month follow-up. STEPPS recipients showed a significantly greater reduction in general psychiatric and BPD-specific symptomatology than subjects assigned to treatment as usual; these differences remained significant at follow-up. STEPPS also led to greater improvement in quality of life, especially at follow-up. No differences in impulsive or parasuicidal behavior were observed. Effect sizes for the differences between the treatments were moderate to large. The results suggest that the brief STEPPS program combined with limited individual therapy can improve BPD-treatment in a number of ways.

Some Muirhead Mean Operators for Intuitionistic Fuzzy Numbers and Their Applications to Group Decision Making.

PubMed

Liu, Peide; Li, Dengfeng

2017-01-01

Muirhead mean (MM) is a well-known aggregation operator which can consider interrelationships among any number of arguments assigned by a variable vector. Besides, it is a universal operator since it can contain other general operators by assigning some special parameter values. However, the MM can only process the crisp numbers. Inspired by the MM' advantages, the aim of this paper is to extend MM to process the intuitionistic fuzzy numbers (IFNs) and then to solve the multi-attribute group decision making (MAGDM) problems. Firstly, we develop some intuitionistic fuzzy Muirhead mean (IFMM) operators by extending MM to intuitionistic fuzzy information. Then, we prove some properties and discuss some special cases with respect to the parameter vector. Moreover, we present two new methods to deal with MAGDM problems with the intuitionistic fuzzy information based on the proposed MM operators. Finally, we verify the validity and reliability of our methods by using an application example, and analyze the advantages of our methods by comparing with other existing methods.

TREDI: A self consistent three-dimensional integration scheme for RF-gun dynamics based on the Lienard-Wiechert potentials formalism

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

Giannessi, Luca; Quattromini, Marcello

1997-06-01

We describe the model for the simulation of charged beam dynamics in radiofrequency injectors used in the three dimensional code TREDI, where the inclusion of space charge fields is obtained by means of the Lienard-Wiechert retarded potentials. The problem of charge screening is analyzed in covariant form and some general recipes for charge assignment and noise reduction are given.

What causes addiction problems? Environmental, biological and constitutional explanations in press portrayals from four European welfare societies.

PubMed

Hellman, Matilda; Majamäki, Maija; Rolando, Sara; Bujalski, Michał; Lemmens, Paul

2015-03-01

Press items (N = 1327) about addiction related problems were collected from politically independent daily newspapers in Finland, Italy, the Netherlands, and Poland from 1991, 1998, and 2011. A synchronized qualitative coding was performed for discerning the descriptions of the genesis to the problems in terms of described causes to and reasons for why they occur. Environmental explanations were by far the most common and they varied most between the materials. The analysis documents how the portrayals include traces of their contextual origin, relating to different media tasks and welfare cultural traditions. Meaning-based differences were also assigned to the kind of problems that held the most salience in the press reporting. A general worry over societal change is tied into the explanations of accumulating addiction problems and underpins the press reporting in all countries.

Sequential /sup 1/H NMR assignments and secondary structure of hen egg white lysozyme in solution

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

Redfield, C.; Dobson, C.M.

Assignments of /sup 1/H NMR resonances of 121 of the 129 residues of hen egg white lysozyme have been obtained by sequence-specific methods. Spin systems were identified with phase-sensitive two-dimensional (2-D) correlated spectroscopy and single and double relayed coherence transfer spectroscopy. For key types of amino acid residues, particularly alanine, threonine, valine, and glycine, complete spin systems were identified. For other residues a less complete definition of the spin system was found to be adequate for the purpose of sequential assignment. Sequence-specific assignments were achieved by phase-sensitive 2-D nuclear Overhauser enhancement spectroscopy (NOESY). Exploitation of the wide range of hydrogenmore » exchange rates found in lysozyme was a useful approach to overcoming the problem of spectral overlap. The sequential assignment was built up from 21 peptide segments ranging in length from 2 to 13 residues. The NOESY spectra were also used to provide information about the secondary structure of the protein in solution. Three helical regions and two regions of ..beta..-sheet were identified from the NOESY data; these regions are identical with those found in the X-ray structure of hen lysozyme. Slowly exchanging amides are generally correlated with hydrogen bonding identified in the X-ray structure; a number of exceptions to this general trend were, however, found. The results presented in this paper indicate that highly detailed information can be obtained from 2-D NMR spectra of a protein that is significantly larger than those studies previously.« less

Finding minimum-quotient cuts in planar graphs

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

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v {element_of} V is assigned a weight w(v) and each edge e {element_of} E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and {bar S} is c(S, {bar S})/min{l_brace}w(S), w(S){r_brace}, where c(S, {bar S}) is the sum of the costs of the edges crossing the cut and w(S) and w({bar S}) are the sum of the weights of the vertices in S and {bar S}, respectively. The problem of finding a cut whose quotient is minimum for a graph hasmore » in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,{bar S}) minimizing c(S,{bar S}) subject to the constraint bW {le} w(S) {le} (1 {minus} b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b {le} {1/2}. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao`s algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao`s most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

Finding minimum-quotient cuts in planar graphs

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

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v [element of] V is assigned a weight w(v) and each edge e [element of] E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and [bar S] is c(S, [bar S])/min[l brace]w(S), w(S)[r brace], where c(S, [bar S]) is the sum of the costs of the edges crossing the cut and w(S) and w([bar S]) are the sum of the weights of the vertices in S and [bar S], respectively. The problem of finding a cut whose quotient is minimummore » for a graph has in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,[bar S]) minimizing c(S,[bar S]) subject to the constraint bW [le] w(S) [le] (1 [minus] b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b [le] [1/2]. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao's algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao's most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

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.

Evaluation of a Brief Homework Assignment Designed to Reduce Citation Problems

ERIC Educational Resources Information Center

Schuetze, Pamela

2004-01-01

I evaluated a brief homework assignment designed to reduce citation problems in research-based term papers. Students in 2 developmental psychology classes received a brief presentation and handout defining plagiarism with tips on how to cite sources to avoid plagiarizing. In addition, students in 1 class completed 2 brief homework assignments in…

Absolute Points for Multiple Assignment Problems

ERIC Educational Resources Information Center

Adlakha, V.; Kowalski, K.

2006-01-01

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

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.

Discrimination of fish populations using parasites: Random Forests on a 'predictable' host-parasite system.

PubMed

Pérez-Del-Olmo, A; Montero, F E; Fernández, M; Barrett, J; Raga, J A; Kostadinova, A

2010-10-01

We address the effect of spatial scale and temporal variation on model generality when forming predictive models for fish assignment using a new data mining approach, Random Forests (RF), to variable biological markers (parasite community data). Models were implemented for a fish host-parasite system sampled along the Mediterranean and Atlantic coasts of Spain and were validated using independent datasets. We considered 2 basic classification problems in evaluating the importance of variations in parasite infracommunities for assignment of individual fish to their populations of origin: multiclass (2-5 population models, using 2 seasonal replicates from each of the populations) and 2-class task (using 4 seasonal replicates from 1 Atlantic and 1 Mediterranean population each). The main results are that (i) RF are well suited for multiclass population assignment using parasite communities in non-migratory fish; (ii) RF provide an efficient means for model cross-validation on the baseline data and this allows sample size limitations in parasite tag studies to be tackled effectively; (iii) the performance of RF is dependent on the complexity and spatial extent/configuration of the problem; and (iv) the development of predictive models is strongly influenced by seasonal change and this stresses the importance of both temporal replication and model validation in parasite tagging studies.

Web-Based Problem-Solving Assignment and Grading System

NASA Astrophysics Data System (ADS)

Brereton, Giles; Rosenberg, Ronald

2014-11-01

In engineering courses with very specific learning objectives, such as fluid mechanics and thermodynamics, it is conventional to reinforce concepts and principles with problem-solving assignments and to measure success in problem solving as an indicator of student achievement. While the modern-day ease of copying and searching for online solutions can undermine the value of traditional assignments, web-based technologies also provide opportunities to generate individualized well-posed problems with an infinite number of different combinations of initial/final/boundary conditions, so that the probability of any two students being assigned identical problems in a course is vanishingly small. Such problems can be designed and programmed to be: single or multiple-step, self-grading, allow students single or multiple attempts; provide feedback when incorrect; selectable according to difficulty; incorporated within gaming packages; etc. In this talk, we discuss the use of a homework/exam generating program of this kind in a single-semester course, within a web-based client-server system that ensures secure operation.

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 approaches and final models we achieved 98.57% average accuracy over all segments for the I2S assignment task (100% when excluding left/right switches) and an average median angle error over all segments and axes of 2.91° for the I2S alignment task. PMID:29351262

LSENS: A General Chemical Kinetics and Sensitivity Analysis Code for homogeneous gas-phase reactions. Part 1: Theory and numerical solution procedures

NASA Technical Reports Server (NTRS)

Radhakrishnan, Krishnan

1994-01-01

LSENS, the Lewis General Chemical Kinetics and Sensitivity Analysis Code, has been developed for solving complex, homogeneous, gas-phase chemical kinetics problems and contains sensitivity analysis for a variety of problems, including nonisothermal situations. This report is part 1 of a series of three reference publications that describe LENS, provide a detailed guide to its usage, and present many example problems. Part 1 derives the governing equations and describes the numerical solution procedures for the types of problems that can be solved. The accuracy and efficiency of LSENS are examined by means of various test problems, and comparisons with other methods and codes are presented. LSENS is a flexible, convenient, accurate, and efficient solver for chemical reaction problems such as static system; steady, one-dimensional, inviscid flow; reaction behind incident shock wave, including boundary layer correction; and perfectly stirred (highly backmixed) reactor. In addition, the chemical equilibrium state can be computed for the following assigned states: temperature and pressure, enthalpy and pressure, temperature and volume, and internal energy and volume. For static problems the code computes the sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of the dependent variables and/or the three rate coefficient parameters of the chemical reactions.

Temporal Codes for Memories: Issues and Problems.

DTIC Science & Technology

1977-04-01

for specific dates they were quite unable to reconstruct the dates. It has been reported (Gibson & Levin, 197S) that children afflicted with dyslexia ...used. Two answers predominated. First, a verbal label was used for the first item, and a "last" label was used by some subjects for the last item...this being assigned when the list terminated. Some subjects indicated that more general labels were used for several items, such phrases as the

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

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-19

... Operations & Reporting System Audit, Assignment, and Timesheet Files (EPA-42) AGENCY: Environmental... (IGOR) System Audit, Assignment, and Timesheet Files (EPA-42) to the Inspector General Enterprise Management System (IGEMS) Audit, Assignment, and Timesheet Modules. DATES: Effective Dates: Persons wishing...

Proposal for Land Consolidation Project Solutions for Selected Problem Areas

NASA Astrophysics Data System (ADS)

Wojcik-Len, Justyna; Strek, Zanna

2017-12-01

One of the economic tools for supporting agricultural policy are the activities implemented under the Rural Development Program (RDP). By encouraging agricultural activities and creating equal opportunities for development of farms, among others in areas with unfavourable environmental conditions characterized by low productivity of soils exposed to degradation, decision makers can contribute to improving the spatial structure of rural areas. In Poland, one of the major concerns are agricultural problem areas (regions). In view of this situation, the aim of this article was to characterize the problem areas in question and propose land consolidation project solutions for selected fragments of those areas. This paper presents the results of a review of literature and an analysis of geodetic and cartographic data regarding the problem areas. The process of land consolidation, which is one of the technical and legal instruments supporting the development of rural areas, was characterized. The study allowed the present authors to establish criteria for selecting agricultural problem areas for land consolidation. To develop a proposal for rational management of the problem areas, key general criteria (location, topography, soil quality and usefulness) and specific criteria were defined and assigned weights. A conception of alternative development of the agricultural problem areas was created as part of a land consolidation project. The results were used to create a methodology for the development of agricultural problem areas to be employed during land consolidation in rural areas. Every agricultural space includes areas with unfavourable environmental and soil conditions determined by natural or anthropogenic factors. Development of agricultural problem areas through land consolidation should take into account the specific functions assigned to these areas in land use plans, as well as to comply with legal regulations.

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

PubMed Central

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

2017-01-01

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

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

PubMed

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

2017-01-17

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

LSENS: A General Chemical Kinetics and Sensitivity Analysis Code for homogeneous gas-phase reactions. Part 3: Illustrative test problems

NASA Technical Reports Server (NTRS)

Bittker, David A.; Radhakrishnan, Krishnan

1994-01-01

LSENS, the Lewis General Chemical Kinetics and Sensitivity Analysis Code, has been developed for solving complex, homogeneous, gas-phase chemical kinetics problems and contains sensitivity analysis for a variety of problems, including nonisothermal situations. This report is part 3 of a series of three reference publications that describe LSENS, provide a detailed guide to its usage, and present many example problems. Part 3 explains the kinetics and kinetics-plus-sensitivity analysis problems supplied with LSENS and presents sample results. These problems illustrate the various capabilities of, and reaction models that can be solved by, the code and may provide a convenient starting point for the user to construct the problem data file required to execute LSENS. LSENS is a flexible, convenient, accurate, and efficient solver for chemical reaction problems such as static system; steady, one-dimensional, inviscid flow; reaction behind incident shock wave, including boundary layer correction; and perfectly stirred (highly backmixed) reactor. In addition, the chemical equilibrium state can be computed for the following assigned states: temperature and pressure, enthalpy and pressure, temperature and volume, and internal energy and volume. For static problems the code computes the sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of the dependent variables and/or the three rate coefficient parameters of the chemical reactions.

Network community-detection enhancement by proper weighting

NASA Astrophysics Data System (ADS)

Khadivi, Alireza; Ajdari Rad, Ali; Hasler, Martin

2011-04-01

In this paper, we show how proper assignment of weights to the edges of a complex network can enhance the detection of communities and how it can circumvent the resolution limit and the extreme degeneracy problems associated with modularity. Our general weighting scheme takes advantage of graph theoretic measures and it introduces two heuristics for tuning its parameters. We use this weighting as a preprocessing step for the greedy modularity optimization algorithm of Newman to improve its performance. The result of the experiments of our approach on computer-generated and real-world data networks confirm that the proposed approach not only mitigates the problems of modularity but also improves the modularity optimization.

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

NASA Astrophysics Data System (ADS)

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

2017-08-01

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

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.

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…

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.

Secondary prevention of work-related disability in nonspecific low back pain: does problem-solving therapy help? A randomized clinical trial.

PubMed

van den Hout, Johanna H C; Vlaeyen, Johan W S; Heuts, Peter H T G; Zijlema, Johan H L; Wijnen, Joseph A G

2003-01-01

Given the individual and economic burden of chronic work disability in low back pain patients, there is a need for effective preventive interventions. The aim of the present study was to investigate whether problem-solving therapy had a supplemental value when added to behavioral graded activity, regarding days of sick leave and work status. Randomized controlled trial. Employees who were recently on sick leave as a result of nonspecific low back pain were referred to the rehabilitation center by general practitioner, occupational physician, or rehabilitation physician. Forty-five employees had been randomly assigned to the experimental treatment condition that included behavioral graded activity and problem-solving therapy (GAPS), and 39 employees had been randomly assigned to behavioral graded activity and group education (GAGE). Days of sick leave and work status. Data were retrieved from occupational health services. Data analyses showed that employees in the GAPS group had significantly fewer days of sick leave in the second half-year after the intervention. Moreover, work status was more favorable for employees in this condition, in that more employees had a 100% return-to-work and fewer patients ended up receiving disability pensions one year after the intervention. Sensitivity analyses confirmed these results. The addition of problem-solving therapy to behavioral graded activity had supplemental value in employees with nonspecific low back pain.

Enabling Next-Generation Multicore Platforms in Embedded Applications

DTIC Science & Technology

2014-04-01

mapping to sets 129 − 256 ) to the second page in memory, color 2 (sets 257 − 384) to the third page, and so on. Then, after the 32nd page, all 212 sets...the Real-Time Nested Locking Protocol (RNLP) [56], a recently developed multiprocessor real-time locking protocol that optimally supports the...RELEASE; DISTRIBUTION UNLIMITED 15 In general, the problems of optimally assigning tasks to processors and colors to tasks are both NP-hard in the

Critical Problems in Very Large Scale Computer Systems

DTIC Science & Technology

1989-03-31

253-6043 Srinivas Devadas (617) 253-0454 Thomas F. Knight, Jr. (617) 253-7807 F. Thomson Leighton (617) 253-3662 Charles E. Leiserson (617) 253-5833...VLSI Memo No. 88-477, October 1988. S. Devadas , "General Decomposition of Sequential Machines: Relationships to State Assignment," to appear in...Perspective, C. Hewitt and G. Agha editors, MIT Press, 1989. Also MIT VLSI Memo No. 88-491, December 1988. * T. Leighton, B . Maggs, and S. Rao, "Universal

Discrete mathematics course supported by CAS MATHEMATICA

NASA Astrophysics Data System (ADS)

Ivanov, O. A.; Ivanova, V. V.; Saltan, A. A.

2017-08-01

In this paper, we discuss examples of assignments for a course in discrete mathematics for undergraduate students majoring in business informatics. We consider several problems with computer-based solutions and discuss general strategies for using computers in teaching mathematics and its applications. In order to evaluate the effectiveness of our approach, we conducted an anonymous survey. The results of the survey provide evidence that our approach contributes to high outcomes and aligns with the course aims and objectives.

Effects of Preventative Tutoring on the Mathematical Problem Solving of Third-Grade Students With Math and Reading Difficulties.

PubMed

Fuchs, Lynn S; Seethaler, Pamela M; Powell, Sarah R; Fuchs, Douglas; Hamlett, Carol L; Fletcher, Jack M

2008-01-01

This study assessed the effects of preventative tutoring on the math problem solving of third-grade students with math and reading difficulties. Students (n = 35) were assigned randomly to continue in their general education math program or to receive secondary preventative tutoring 3 times per week, 30 min per session, for 12 weeks. Schema-broadening tutoring taught students to (a) focus on the mathematical structure of 3 problem types; (b) recognize problems as belonging to those 3 problem-type schemas; (c) solve the 3 word-problem types; and (d) transfer solution methods to problems that include irrelevant information, 2-digit operands, missing information in the first or second positions in the algebraic equation, or relevant information in charts, graphs, and pictures. Also, students were taught to perform the calculation and algebraic skills foundational for problem solving. Analyses of variance revealed statistically significant effects on a wide range of word problems, with large effect sizes. Findings support the efficacy of the tutoring protocol for preventing word-problem deficits among third-grade students with math and reading deficits.

Effects of Preventative Tutoring on the Mathematical Problem Solving of Third-Grade Students With Math and Reading Difficulties

PubMed Central

Fuchs, Lynn S.; Seethaler, Pamela M.; Powell, Sarah R.; Fuchs, Douglas; Hamlett, Carol L.; Fletcher, Jack M.

2009-01-01

This study assessed the effects of preventative tutoring on the math problem solving of third-grade students with math and reading difficulties. Students (n = 35) were assigned randomly to continue in their general education math program or to receive secondary preventative tutoring 3 times per week, 30 min per session, for 12 weeks. Schema-broadening tutoring taught students to (a) focus on the mathematical structure of 3 problem types; (b) recognize problems as belonging to those 3 problem-type schemas; (c) solve the 3 word-problem types; and (d) transfer solution methods to problems that include irrelevant information, 2-digit operands, missing information in the first or second positions in the algebraic equation, or relevant information in charts, graphs, and pictures. Also, students were taught to perform the calculation and algebraic skills foundational for problem solving. Analyses of variance revealed statistically significant effects on a wide range of word problems, with large effect sizes. Findings support the efficacy of the tutoring protocol for preventing word-problem deficits among third-grade students with math and reading deficits. PMID:20209074

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.

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

Vonach, H.; Tagesen, S.

Starting with a discussion of the requirements and goals for high quality general-purpose evaluations the paper will describe the procedures chosen in our evaluation work for JEFF for producing new general evaluations with complete covariance information for all cross sections (file 3 data). Key problems essential for the goal of making the best possible use of the existing theoretical and experimental knowledge on neutron interactions with the respective nuclide will be addressed, especially the problem of assigning covariances to calculated cross sections, necessary checking procedures for all experimental data and various possibilities to amend the experimental database beyond the obviousmore » use of EXFOR data for the respective cross sections. In this respect both, the use of elemental cross sections in isotopic evaluations and the use of implicit cross-section data (that is data which can be converted into cross sections by simple methods) will be discussed in some detail.« less

A general system for automatic biomedical image segmentation using intensity neighborhoods.

PubMed

Chen, Cheng; Ozolek, John A; Wang, Wei; Rohde, Gustavo K

2011-01-01

Image segmentation is important with applications to several problems in biology and medicine. While extensively researched, generally, current segmentation methods perform adequately in the applications for which they were designed, but often require extensive modifications or calibrations before being used in a different application. We describe an approach that, with few modifications, can be used in a variety of image segmentation problems. The approach is based on a supervised learning strategy that utilizes intensity neighborhoods to assign each pixel in a test image its correct class based on training data. We describe methods for modeling rotations and variations in scales as well as a subset selection for training the classifiers. We show that the performance of our approach in tissue segmentation tasks in magnetic resonance and histopathology microscopy images, as well as nuclei segmentation from fluorescence microscopy images, is similar to or better than several algorithms specifically designed for each of these applications.

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…

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…

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

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…

Probabilistic reasoning in data analysis.

PubMed

Sirovich, Lawrence

2011-09-20

This Teaching Resource provides lecture notes, slides, and a student assignment for a lecture on probabilistic reasoning in the analysis of biological data. General probabilistic frameworks are introduced, and a number of standard probability distributions are described using simple intuitive ideas. Particular attention is focused on random arrivals that are independent of prior history (Markovian events), with an emphasis on waiting times, Poisson processes, and Poisson probability distributions. The use of these various probability distributions is applied to biomedical problems, including several classic experimental studies.

Emerging Role of the Army Family Physician in Primary Health Care Delivery.

DTIC Science & Technology

1976-12-13

practice in the civilian community and had handled a variety of primary care problems. They volunteered to come into the Army , joined training pro ...the end of the draft came and with it the reality that adequate numbers of General Medical Officers ( GMO ’s) were no longer available. The typical... GMO , a product of the draft, came into the Army at the end of his year of internship. He was usually assigned all the unpleasant and mundane duties that

Significant Figures in Measurements with Uncertainty: A Working Criterion

NASA Astrophysics Data System (ADS)

Vilchis, Abraham

2017-03-01

Generally speaking, students have difficulty reporting out measurements and estimates of quantities used in the laboratory, and with handling the significant figures associated with them. When required to make calculation involving quantities with different numbers of significant figures, they have difficulty in assigning the corresponding digits to the final result. When in addition, the quantities have uncertainty, the operations entailed pose an even greater challenge. The article advocates for some working rules for students (and teachers) in an effort to combat this problem.

Quicker Q-Learning in Multi-Agent Systems

NASA Technical Reports Server (NTRS)

Agogino, Adrian K.; Tumer, Kagan

2005-01-01

Multi-agent learning in Markov Decisions Problems is challenging because of the presence ot two credit assignment problems: 1) How to credit an action taken at time step t for rewards received at t' greater than t; and 2) How to credit an action taken by agent i considering the system reward is a function of the actions of all the agents. The first credit assignment problem is typically addressed with temporal difference methods such as Q-learning OK TD(lambda) The second credit assi,onment problem is typically addressed either by hand-crafting reward functions that assign proper credit to an agent, or by making certain independence assumptions about an agent's state-space and reward function. To address both credit assignment problems simultaneously, we propose the Q Updates with Immediate Counterfactual Rewards-learning (QUICR-learning) designed to improve both the convergence properties and performance of Q-learning in large multi-agent problems. Instead of assuming that an agent s value function can be made independent of other agents, this method suppresses the impact of other agents using counterfactual rewards. Results on multi-agent grid-world problems over multiple topologies show that QUICR-learning can achieve up to thirty fold improvements in performance over both conventional and local Q-learning in the largest tested systems.

A review on simple assembly line balancing type-e problem

NASA Astrophysics Data System (ADS)

Jusop, M.; Rashid, M. F. F. Ab

2015-12-01

Simple assembly line balancing (SALB) is an attempt to assign the tasks to the various workstations along the line so that the precedence relations are satisfied and some performance measure are optimised. Advanced approach of algorithm is necessary to solve large-scale problems as SALB is a class of NP-hard. Only a few studies are focusing on simple assembly line balancing of Type-E problem (SALB-E) since it is a general and complex problem. SALB-E problem is one of SALB problem which consider the number of workstation and the cycle time simultaneously for the purpose of maximising the line efficiency. This paper review previous works that has been done in order to optimise SALB -E problem. Besides that, this paper also reviewed the Genetic Algorithm approach that has been used to optimise SALB-E. From the reviewed that has been done, it was found that none of the existing works are concern on the resource constraint in the SALB-E problem especially on machine and tool constraints. The research on SALB-E will contribute to the improvement of productivity in real industrial application.

Meta-cognitive student reflections

NASA Astrophysics Data System (ADS)

Barquist, Britt; Stewart, Jim

2009-05-01

We have recently concluded a project testing the effectiveness of a weekly assignment designed to encourage awareness and improvement of meta-cognitive skills. The project is based on the idea that successful problem solvers implement a meta-cognitive process in which they identify the specific concept they are struggling with, and then identify what they understand, what they don't understand, and what they need to know in order to resolve their problem. The assignment required the students to write an email assessing the level of completion of a weekly workbook assignment and to examine in detail their experiences regarding a specific topic they struggled with. The assignment guidelines were designed to coach them through this meta-cognitive process. We responded to most emails with advice for next week's assignment. Our data follow 12 students through a quarter consisting of 11 email assignments which were scored using a rubric based on the assignment guidelines. We found no correlation between rubric scores and final grades. We do have anecdotal evidence that the assignment was beneficial.

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.

University course timetabling and the requirements: Survey in several universities in the east-coast of Malaysia

NASA Astrophysics Data System (ADS)

Aziz, Nurul Liyana Abdul; Aizam, Nur Aidya Hanum

2017-08-01

Course timetabling problem receives the highlight at the beginning of every semester. The problem is mainly on assigning courses to timeslot, rooms and lecturers which involving a set of rules and policies constraints. Generally, researchers present different features to signify their own universities' timetable according to the structure and behavior of their institution. However, the gap between theory and real-world applications that can be seen in the resulted timetable is the lacking of acknowledging human preferences. As to overcome this, it is very important to consider all the demands and preferences from timetabling community. This research therefore tries to accommodate the problem by investigating through surveys to several universities in the east coast of Malaysia the demands and preferences of individuals involved directly. Results from the questionnaires will be analyzed by using SPSS and all current issues regarding the demands will be included into our existing general university course timetabling mathematical model. The new university course timetabling mathematical model could best represent universities and be useful, especially in universities in Malaysia.

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

A Non-parametric Cutout Index for Robust Evaluation of Identified Proteins*

PubMed Central

Serang, Oliver; Paulo, Joao; Steen, Hanno; Steen, Judith A.

2013-01-01

This paper proposes a novel, automated method for evaluating sets of proteins identified using mass spectrometry. The remaining peptide-spectrum match score distributions of protein sets are compared to an empirical absent peptide-spectrum match score distribution, and a Bayesian non-parametric method reminiscent of the Dirichlet process is presented to accurately perform this comparison. Thus, for a given protein set, the process computes the likelihood that the proteins identified are correctly identified. First, the method is used to evaluate protein sets chosen using different protein-level false discovery rate (FDR) thresholds, assigning each protein set a likelihood. The protein set assigned the highest likelihood is used to choose a non-arbitrary protein-level FDR threshold. Because the method can be used to evaluate any protein identification strategy (and is not limited to mere comparisons of different FDR thresholds), we subsequently use the method to compare and evaluate multiple simple methods for merging peptide evidence over replicate experiments. The general statistical approach can be applied to other types of data (e.g. RNA sequencing) and generalizes to multivariate problems. PMID:23292186

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

Fucose Migration in Intact Protonated Glycan Ions: A Universal Phenomenon in Mass Spectrometry.

PubMed

Mucha, Eike; Lettow, Maike; Marianski, Mateusz; Thomas, Daniel A; Struwe, Weston B; Harvey, David J; Meijer, Gerard; Seeberger, Peter H; von Helden, Gert; Pagel, Kevin

2018-06-18

Fucose is an essential deoxysugar that is found in a wide range of biologically relevant glycans and glycoconjugates. A recurring problem in mass spectrometric analyses of fucosylated glycans is the intramolecular migration of fucose units, which can lead to erroneous sequence assignments. This migration reaction is typically assigned to activation during collision-induced dissociation (CID) in tandem mass spectrometry (MS). In this work, we utilized cold-ion spectroscopy and show for the first time that fucose migration is not limited to fragments obtained in tandem MS and can also be observed in intact glycan ions. This observation suggests a possible low-energy barrier for this transfer reaction and generalizes fucose migration to an issue that may universally occur in any type of mass spectrometry experiment. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

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…

Intervention for the bereaved: gender differences in the efficacy of two counselling programmes.

PubMed

Schut, H A; Stroebe, M S; van den Bout, J; de Keijser, J

1997-02-01

This article describes an investigation of emotion-focused versus problem-focused intervention for widowers (N = 23) and widowers (N = 23) who were suffering elevated levels of distress 11 months after their loss. They were randomly assigned to an intervention condition and improvement (on the General Health Questionnaire) was compared with non-intervention controls (N = 59). Two alternative hypotheses were considered: (1) men, since they focus less on their emotions, would benefit from problem-focused counselling, while women, focusing more on their emotions, would benefit from emotion-focused intervention; (2) each gender, having been comparatively unsuccessful in coping through these usual strategies, would benefit more from intervention directed towards the less familiar strategy. Results supported the second hypothesis: widowers benefited more from emotion-focused, widows from problem-focused interventions. Implications for supporting widows and widowers are discussed.

Capacity planning of link restorable optical networks under dynamic change of traffic

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2005-11-01

Future backbone networks shall require full-survivability and support dynamic changes of traffic demands. The Generalized Survivable Networks (GSN) was proposed to meet these challenges. GSN is fully-survivable under dynamic traffic demand changes, so it offers a practical and guaranteed characterization framework for ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation 4. The basic idea of GSN is to incorporate the non-blocking network concept into the survivable network models. In GSN, each network node must specify its I/O capacity bound which is taken as constraints for any allowable traffic demand matrix. In this paper, we consider the following generic GSN network design problem: Given the I/O bounds of each network node, find a routing scheme (and the corresponding rerouting scheme under failure) and the link capacity assignment (both working and spare) which minimize the cost, such that any traffic matrix consistent with the given I/O bounds can be feasibly routed and it is single-fault tolerant under the link restoration scheme. We first show how the initial, infeasible formal mixed integer programming formulation can be transformed into a more feasible problem using the duality transformation of the linear program. Then we show how the problem can be simplified using the Lagrangian Relaxation approach. Previous work has outlined a two-phase approach for solving this problem where the first phase optimizes the working capacity assignment and the second phase optimizes the spare capacity assignment. In this paper, we present a jointly optimized framework for dimensioning the survivable optical network with the GSN model. Experiment results show that the jointly optimized GSN can bring about on average of 3.8% cost savings when compared with the separate, two-phase approach. Finally, we perform a cost comparison and show that GSN can be deployed with a reasonable cost.

Topological numbering of features on a mesh

NASA Technical Reports Server (NTRS)

Atallah, Mikhail J.; Hambrusch, Susanne E.; Tewinkel, Lynn E.

1988-01-01

Assume a nxn binary image is given containing horizontally convex features; i.e., for each feature, each of its row's pixels form an interval on that row. The problem of assigning topological numbers to such features is considered; i.e., assign a number to every feature f so that all features to the left of f have a smaller number assigned to them. This problem arises in solutions to the stereo matching problem. A parallel algorithm to solve the topological numbering problem in O(n) time on an nxn mesh of processors is presented. The key idea of the solution is to create a tree from which the topological numbers can be obtained even though the tree does not uniquely represent the to the left of relationship of the features.

LSENS, a general chemical kinetics and sensitivity analysis code for homogeneous gas-phase reactions. 2: Code description and usage

NASA Technical Reports Server (NTRS)

Radhakrishnan, Krishnan; Bittker, David A.

1994-01-01

LSENS, the Lewis General Chemical Kinetics Analysis Code, has been developed for solving complex, homogeneous, gas-phase chemical kinetics problems and contains sensitivity analysis for a variety of problems, including nonisothermal situations. This report is part 2 of a series of three reference publications that describe LSENS, provide a detailed guide to its usage, and present many example problems. Part 2 describes the code, how to modify it, and its usage, including preparation of the problem data file required to execute LSENS. Code usage is illustrated by several example problems, which further explain preparation of the problem data file and show how to obtain desired accuracy in the computed results. LSENS is a flexible, convenient, accurate, and efficient solver for chemical reaction problems such as static system; steady, one-dimensional, inviscid flow; reaction behind incident shock wave, including boundary layer correction; and perfectly stirred (highly backmixed) reactor. In addition, the chemical equilibrium state can be computed for the following assigned states: temperature and pressure, enthalpy and pressure, temperature and volume, and internal energy and volume. For static problems the code computes the sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of the dependent variables and/or the three rate coefficient parameters of the chemical reactions. Part 1 (NASA RP-1328) derives the governing equations describes the numerical solution procedures for the types of problems that can be solved by lSENS. Part 3 (NASA RP-1330) explains the kinetics and kinetics-plus-sensitivity-analysis problems supplied with LSENS and presents sample results.

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

Code of Federal Regulations, 2012 CFR

2012-10-01

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

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

Code of Federal Regulations, 2013 CFR

2013-10-01

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

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

Code of Federal Regulations, 2011 CFR

2011-10-01

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

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

Code of Federal Regulations, 2014 CFR

2014-10-01

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

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

Code of Federal Regulations, 2010 CFR

2010-10-01

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

Effects of AlcoholEdu for College on Alcohol-Related Problems Among Freshmen: A Randomized Multicampus Trial*

PubMed Central

Paschall, Mallie J.; Antin, Tamar; Ringwalt, Christopher L.; Saltz, Robert F.

2011-01-01

Objective: AlcoholEdu for College is a 2- to 3-hour online course for incoming college freshmen. This study was the first multicampus trial to examine effects of AlcoholEdu for College on alcohol-related problems among freshmen. Method: Thirty universi participated in the study. Fifteen were randomly assigned to receive AlcoholEdu, and the other 15 were assigned to the control condition. AlcoholEdu was implemented by intervention schools during the summer and/or fall semester. Cross-sectional surveys of freshmen were conducted at each university beginning before the intervention in spring 2008/2009; post-intervention surveys were administered in fall 2008/2009 and spring 2009/2010. The surveys included questions about the past-30-day frequency of 28 alcohol-related problems, from which we created indices for the total number of problems and problems in seven domains: physiological, academic, social, driving under the influence/riding with drinking drivers, aggression, sexual risk taking, and victimization. Multilevel Poisson regression analyses were conducted to examine intent-to-treat and dosage effects of AlcoholEdu for College on these outcomes. Results: Multilevel intent-to-treat analyses indicated significant reductions in the risk for past-30-day alcohol problems in general and problems in the physiological, social, and victimization domains during the fall semester immediately after completion of the course. However, these effects did not persist in the spring semester. Additional analyses suggested stronger AlcoholEdu effects on these outcomes at colleges with higher rates of student course completion. No AlcoholEdu effects were observed for alcohol-related problems in the other four domains. Conclusions: AlcoholEdu for College appears to have beneficial short-term effects on victimization and the most common types of alcohol-related problems among freshmen. Universities may benefit the most by mandating AlcoholEdu for College for all incoming freshmen and by implementing this online course along with environmental prevention strategies. PMID:21683046

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.

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.

From Bhopal to Cold Fusion: A Case-Study Approach to Writing Assignments in Honors General Chemistry

ERIC Educational Resources Information Center

Chamely-Wiik, Donna M.; Haky, Jerome E.; Galin, Jeffrey R.

2012-01-01

Faculty from the chemistry and English departments have developed a combined second-semester honors general chemistry and college writing course that fosters critical thinking through challenging writing assignments. Examples of case-study writing assignments and guidelines are provided that faculty at other institutions can adapt in similar…

Application of desktop computers in nuclear engineering education

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

Graves, H.W. Jr.

1990-01-01

Utilization of desktop computers in the academic environment is based on the same objectives as in the industrial environment - increased quality and efficiency. Desktop computers can be extremely useful teaching tools in two general areas: classroom demonstrations and homework assignments. Although differences in emphasis exist, tutorial programs share many characteristics with interactive software developed for the industrial environment. In the Reactor Design and Fuel Management course at the University of Maryland, several interactive tutorial programs provided by Energy analysis Software Service have been utilized. These programs have been designed to be sufficiently structured to permit an orderly, disciplined solutionmore » to the problem being solved, and yet be flexible enough to accommodate most problem solution options.« less

Show, Don't Tell: Using Photographic "Snapsignments" to Advance and Assess Creative Problem Solving

ERIC Educational Resources Information Center

Machin, Jane E.

2016-01-01

Traditional assignments that aim to develop and evaluate creative problem solving skills are frequently foregone in large marketing classes due to the daunting grading prospect they present. Here, a new assessment method is introduced: the "snapsignment." Through photography, individual projects can be assigned that promote higher order…

Autonomous Guidance Strategy for Spacecraft Formations and Reconfiguration Maneuvers

NASA Astrophysics Data System (ADS)

Wahl, Theodore P.

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

Quantitative description of realistic wealth distributions by kinetic trading models

NASA Astrophysics Data System (ADS)

Lammoglia, Nelson; Muñoz, Víctor; Rogan, José; Toledo, Benjamín; Zarama, Roberto; Valdivia, Juan Alejandro

2008-10-01

Data on wealth distributions in trading markets show a power law behavior x-(1+α) at the high end, where, in general, α is greater than 1 (Pareto’s law). Models based on kinetic theory, where a set of interacting agents trade money, yield power law tails if agents are assigned a saving propensity. In this paper we are solving the inverse problem, that is, in finding the saving propensity distribution which yields a given wealth distribution for all wealth ranges. This is done explicitly for two recently published and comprehensive wealth datasets.

Constant Communities in Complex Networks

NASA Astrophysics Data System (ADS)

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

2013-05-01

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

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

ERIC Educational Resources Information Center

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

2016-01-01

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

General method and thermodynamic tables for computation of equilibrium composition and temperature of chemical reactions

NASA Technical Reports Server (NTRS)

Huff, Vearl N; Gordon, Sanford; Morrell, Virginia E

1951-01-01

A rapidly convergent successive approximation process is described that simultaneously determines both composition and temperature resulting from a chemical reaction. This method is suitable for use with any set of reactants over the complete range of mixture ratios as long as the products of reaction are ideal gases. An approximate treatment of limited amounts of liquids and solids is also included. This method is particularly suited to problems having a large number of products of reaction and to problems that require determination of such properties as specific heat or velocity of sound of a dissociating mixture. The method presented is applicable to a wide variety of problems that include (1) combustion at constant pressure or volume; and (2) isentropic expansion to an assigned pressure, temperature, or Mach number. Tables of thermodynamic functions needed with this method are included for 42 substances for convenience in numerical computations.

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

Effects of Smart-Tablet-Based Neurofeedback Training on Cognitive Function in Children with Attention Problems.

PubMed

Shin, Min-Sup; Jeon, Hyejin; Kim, Miyoung; Hwang, Taeho; Oh, Seo Jin; Hwangbo, Minsu; Kim, Ki Joong

2016-05-01

We sought to determine whether smart-tablet-based neurofeedback could improve executive function-including attention, working memory, and self-regulation-in children with attention problems. Forty children (10-12 years old) with attention problems, as determined by ratings on the Conners Parent Rating Scale, were assigned to either a neurofeedback group that received 16 sessions or a control group. A comprehensive test battery that assessed general intelligence, visual and auditory attention, attentional shifting, response inhibition and behavior rating scales were administered to both groups before neurofeedback training. Several neuropsychological tests were conducted at posttraining and follow-up assessment. Scores on several neuropsychological tests and parent behavior rating scales showed significant improvement in the training group but not in the controls. The improvements remained through the follow-up assessment. This study suggests that the smart-tablet-based neurofeedback training program might improve cognitive function in children with attention problems. © The Author(s) 2015.

WWC Review of the Report "Effects of Problem Based Economics on High School Economics Instruction"

ERIC Educational Resources Information Center

What Works Clearinghouse, 2012

2012-01-01

The study described in this report included 128 high school economics teachers from 106 schools in Arizona and California, half of whom were randomly assigned to the "Problem Based Economics Instruction" condition and half of whom were randomly assigned to the comparison condition. High levels of teacher attrition occurred after…

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

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.

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.

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

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

LSENS, A General Chemical Kinetics and Sensitivity Analysis Code for Homogeneous Gas-Phase Reactions. Part 2; Code Description and Usage

NASA Technical Reports Server (NTRS)

Radhakrishnan, Krishnan; Bittker, David A.

1994-01-01

LSENS, the Lewis General Chemical Kinetics and Sensitivity Analysis Code, has been developed for solving complex, homogeneous, gas-phase chemical kinetics problems and contains sensitivity analysis for a variety of problems, including nonisothermal situations. This report is part II of a series of three reference publications that describe LSENS, provide a detailed guide to its usage, and present many example problems. Part II describes the code, how to modify it, and its usage, including preparation of the problem data file required to execute LSENS. Code usage is illustrated by several example problems, which further explain preparation of the problem data file and show how to obtain desired accuracy in the computed results. LSENS is a flexible, convenient, accurate, and efficient solver for chemical reaction problems such as static system; steady, one-dimensional, inviscid flow; reaction behind incident shock wave, including boundary layer correction; and perfectly stirred (highly backmixed) reactor. In addition, the chemical equilibrium state can be computed for the following assigned states: temperature and pressure, enthalpy and pressure, temperature and volume, and internal energy and volume. For static problems the code computes the sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of the dependent variables and/or the three rate coefficient parameters of the chemical reactions. Part I (NASA RP-1328) derives the governing equations and describes the numerical solution procedures for the types of problems that can be solved by LSENS. Part III (NASA RP-1330) explains the kinetics and kinetics-plus-sensitivity-analysis problems supplied with LSENS and presents sample results.

Association between lung function and mental health problems among adults in the United States: findings from the First National Health and Nutrition Examination Survey.

PubMed

Goodwin, Renee D; Chuang, Shirley; Simuro, Nicole; Davies, Mark; Pine, Daniel S

2007-02-15

The objective of this study was to determine the association between lung function and mental health problems among adults in the United States. Data were drawn from the First National Health and Nutrition Examination Survey (1971-1975), with available information on a representative sample of US adults aged 25-74 years. Lung function was assessed by spirometry, and provisional diagnoses of restrictive and obstructive airway disease were assigned based on percentage of expected forced expiratory volume. Mental health problems were assessed with the General Well-Being scales. Restrictive lung function and obstructive lung function, compared with normal lung function, were each associated with a significantly increased likelihood of mental health problems. After adjustment for differences in demographic characteristics, obstructive lung function was associated with significantly lower overall well-being (p = 0.025), and restrictive lung function was associated with significantly lower overall well-being (p < 0.001), general health (p < 0.0001), vitality (p < 0.0001), and self-control (p = 0.001) and with higher depression (p = 0.002) subscale scores compared with no lung function problems. Consistent with previous findings from clinical and community-based studies, these results extend available data by providing evidence of a link between objectively measured lung function and self-reported mental health problems in a representative sample of community adults. Future studies are needed to determine the mechanisms of these associations.

An analysis of spectral envelope-reduction via quadratic assignment problems

NASA Technical Reports Server (NTRS)

George, Alan; Pothen, Alex

1994-01-01

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

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.

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.

78 FR 14791 - Notice of Issuance of Exposure Draft on Implementation Guidance on General Property, Plant, and...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-07

... FEDERAL ACCOUNTING STANDARDS ADVISORY BOARD Notice of Issuance of Exposure Draft on Implementation Guidance on General Property, Plant, and Equipment Cost Accumulation, Assignment, and Allocation AGENCY... Guidance on General Property, Plant, and Equipment Cost Accumulation, Assignment, and Allocation. The...

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

NASA Astrophysics Data System (ADS)

Hernawati, Tri; Suliawati; Sari Gumay, Vita

2018-03-01

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

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.

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

PubMed Central

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

2011-01-01

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

A trust-based sensor allocation algorithm in cooperative space search problems

NASA Astrophysics Data System (ADS)

Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

2011-06-01

Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

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.

Problem-based writing with peer review improves academic performance in physiology.

PubMed

Pelaez, Nancy J

2002-12-01

The aim of this study was to determine whether problem-based writing with peer review (PW-PR) improves undergraduate student performance on physiology exams. Didactic lectures were replaced with assignments to give students practice explaining their reasoning while solving qualitative problems, thus transferring the responsibility for abstraction and generalization to the students. Performance on exam items about concepts taught using PW-PR was compared with performance on concepts taught using didactic lectures followed by group work. Calibrated Peer Review, a Web-delivered program, was used to collect student essays and to manage anonymous peer review after students "passed" three calibration peer reviews. Results show that the students had difficulty relating concepts. Relationship errors were categorized as (1) problems recognizing levels of organization, (2) problems with cause/effect, and (3) overgeneralizations. For example, some described cells as molecules; others thought that vesicles transport materials through the extracellular fluid. With PW-PR, class discussion was used to confront and resolve such difficulties. Both multiple-choice and essay exam results were better with PW-PR instead of lecture.

Validity of the Addiction Severity Index (adapted version) in a Costa Rican population group.

PubMed

Sandí Esquivel, L E; Avila Corrales, K

1990-01-01

Until recently, no adapted and validated instrument was available for assessing the alcohol and drug problems of individuals in Costa Rica. This article reports the results of a study performed by Costa Rica's Institute on Alcoholism and Drug Dependence in order to test an adapted version of one such instrument, the Addiction Severity Index (ASI), in a Costa Rican setting. The instrument was used to interview 100 male subjects 18 to 64 years old (51 with diagnosed alcohol or drug problems and 49 controls). In general, the subjects with previously diagnosed alcohol or drug problems were assigned substantially higher scores. More specifically, statistical analysis indicated highly significant correlations (p less than 0.001) between the type of subject (test subject or control) and the likelihood that noteworthy problems would be found in the areas of alcohol use, family/social relations, work/finances, and psychological status. Overall, the study demonstrated that the instrument was capable of distinguishing between the affected and unaffected populations, and also of gauging the severity of the problems involved and the patients' treatment needs.

How to improve mental health competency in general practice training?--a SWOT analysis.

PubMed

van Marwijk, Harm

2004-06-01

It is quite evident there is room for improvement in the primary care management of common mental health problems. Patients respond positively when GPs adopt a more proactive role in this respect. The Dutch general practice curriculum is currently being renewed. The topics discussed here include the Strengths, Weaknesses, Opportunities and Threats (SWOT) of present primary mental healthcare teaching. What works well and what needs improving? Integrated teaching packages are needed to help general practice trainees manage various presentations of psychological distress. Such packages comprise training videotapes, in which models such as problem-solving treatment (PST) are demonstrated, as well as roleplaying material for new skills, self-report questionnaires for patients, and small-group video feedback of consultations. While GP trainees can effectively master such skills, it is important to query the level of proficiency required by registrars. Are these skills of use only to connoisseur GPs, or to all? More room for specialisation and differentiation among trainees may be the way forward. We have just developed a new curriculum for the obligatory three-month psychiatry housemanship. It is competency oriented, self-directed and assignment driven. This new curriculum will be evaluated in due course.

Evaluation of a controlled drinking minimal intervention for problem drinkers in general practice (the DRAMS scheme)

PubMed Central

Heather, Nick; Campion, Peter D.; Neville, Ronald G.; Maccabe, David

1987-01-01

Sixteen general practitioners participated in a controlled trial of the Scottish Health Education Group's DRAMS (drinking reasonably and moderately with self-control) scheme. The scheme was evaluated by randomly assigning 104 heavy or problem drinkers to three groups – a group participating in the DRAMS scheme (n = 34), a group given simple advice only (n = 32) and a non-intervention control group (n = 38). Six month follow-up information was obtained for 91 subjects (87.5% of initial sample). There were no significant differences between the groups in reduction in alcohol consumption, but patients in the DRAMS group showed a significantly greater reduction in a logarithmic measure of serum gamma-glutamyl-transpeptidase than patients in the group receiving advice only. Only 14 patients in the DRAMS group completed the full DRAMS procedure. For the sample as a whole, there was a significant reduction in alcohol consumption, a significant improvement on a measure of physical health and well-being, and significant reductions in the logarithmic measure of serum gamma-glutamyl transpeptidase and in mean corpuscular volume. The implications of these findings for future research into controlled drinking minimal interventions in general practice are discussed. PMID:3448228

Maternal education preferences moderate the effects of mandatory employment and education programs on child positive and problem behaviors

PubMed Central

Gassman-Pines, Anna; Godfrey, Erin B.; Yoshikawa, Hirokazu

2012-01-01

Grounded in Person-Environment Fit Theory, this study examined whether low-income mothers' preferences for education moderated the effects of employment- and education-focused welfare programs on children's positive and problem behaviors. The sample included 1,365 families with children between ages 3 and 5 at study entry. Results 5 years after random assignment, when children were ages 8 to 10, indicated that mothers' education preferences did moderate program impacts on teacher-reported child behavior problems and positive behavior. Children whose mothers were assigned to the education program were rated by teachers to have less externalizing behavior and more positive behavior than children whose mothers were assigned to the employment program, but only when mothers had strong preferences for education. PMID:22861169

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)

Multicasting for all-optical multifiber networks

NASA Astrophysics Data System (ADS)

Kã¶Ksal, Fatih; Ersoy, Cem

2007-02-01

All-optical wavelength-routed WDM WANs can support the high bandwidth and the long session duration requirements of the application scenarios such as interactive distance learning or on-line diagnosis of patients simultaneously in different hospitals. However, multifiber and limited sparse light splitting and wavelength conversion capabilities of switches result in a difficult optimization problem. We attack this problem using a layered graph model. The problem is defined as a k-edge-disjoint degree-constrained Steiner tree problem for routing and fiber and wavelength assignment of k multicasts. A mixed integer linear programming formulation for the problem is given, and a solution using CPLEX is provided. However, the complexity of the problem grows quickly with respect to the number of edges in the layered graph, which depends on the number of nodes, fibers, wavelengths, and multicast sessions. Hence, we propose two heuristics layered all-optical multicast algorithm [(LAMA) and conservative fiber and wavelength assignment (C-FWA)] to compare with CPLEX, existing work, and unicasting. Extensive computational experiments show that LAMA's performance is very close to CPLEX, and it is significantly better than existing work and C-FWA for nearly all metrics, since LAMA jointly optimizes routing and fiber-wavelength assignment phases compared with the other candidates, which attack the problem by decomposing two phases. Experiments also show that important metrics (e.g., session and group blocking probability, transmitter wavelength, and fiber conversion resources) are adversely affected by the separation of two phases. Finally, the fiber-wavelength assignment strategy of C-FWA (Ex-Fit) uses wavelength and fiber conversion resources more effectively than the First Fit.

30 CFR 774.17 - Transfer, assignment, or sale of permit rights.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 30 Mineral Resources 3 2010-07-01 2010-07-01 false Transfer, assignment, or sale of permit rights... SYSTEMS UNDER REGULATORY PROGRAMS REVISION; RENEWAL; TRANSFER, ASSIGNMENT, OR SALE OF PERMIT RIGHTS; POST... § 774.17 Transfer, assignment, or sale of permit rights. (a) General. No transfer, assignment, or sale...

30 CFR 774.17 - Transfer, assignment, or sale of permit rights.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 30 Mineral Resources 3 2011-07-01 2011-07-01 false Transfer, assignment, or sale of permit rights... SYSTEMS UNDER REGULATORY PROGRAMS REVISION; RENEWAL; TRANSFER, ASSIGNMENT, OR SALE OF PERMIT RIGHTS; POST... § 774.17 Transfer, assignment, or sale of permit rights. (a) General. No transfer, assignment, or sale...

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

Statistics of equivalent width data and new oscillator strengths for Si II, Fe II, and Mn II. [in interstellar medium

NASA Technical Reports Server (NTRS)

Van Buren, Dave

1986-01-01

Equivalent width data from Copernicus and IUE appear to have an exponential, rather than a Gaussian distribution of errors. This is probably because there is one dominant source of error: the assignment of the background continuum shape. The maximum likelihood method of parameter estimation is presented for the case of exponential statistics, in enough generality for application to many problems. The method is applied to global fitting of Si II, Fe II, and Mn II oscillator strengths and interstellar gas parameters along many lines of sight. The new values agree in general with previous determinations but are usually much more tightly constrained. Finally, it is shown that care must be taken in deriving acceptable regions of parameter space because the probability contours are not generally ellipses whose axes are parallel to the coordinate axes.

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.

Multi Objective Decision Analysis for Assignment Problems

DTIC Science & Technology

2011-03-01

needed data or try to get data from related databases. 2.3.8 Deterministic Analysis In order to determine an overall score for each...The views expressed in this thesis are those of the author and do not reflect the official policy or position of the Turkish Air...DECISION ANALYSIS FOR ASSIGNMENT PROBLEMS THESIS Presented to the Faculty Department of Operational Sciences Graduate School of

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

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.

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

Learner-Centered Teaching and Improving Learning by Writing Down the Statement of Problems in an Introductory Physics Course

NASA Astrophysics Data System (ADS)

Aurora, Tarlok

2005-04-01

In a calculus-based introductory physics course, students were assigned to write the statements of word problems (along with the accompanying diagrams if any), analyze these, identify important concepts/equations and try to solve these end-of- chapter homework problems. They were required to bring to class their written assignment until the chapter was completed in lecture. These were quickly checked at the beginning of the class. In addition, re-doing selected solved examples in the textbook were assigned as homework. Where possible, students were asked to look for similarities between the solved-examples and the end-of-the-chapter problems, or occasionally these were brought to the students' attention. It was observed that many students were able to solve several of the solved-examples on the test even though the instructor had not solved these in class. This was seen as an improvement over the previous years. It made the students more responsible for their learning. Another benefit was that it alleviated the problems previously created by many students not bringing the textbooks to class. It allowed more time for problem solving/discussions in class.

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.

A Theory of Hospital Financial Analysis

PubMed Central

Elnicki, Richard A.

1969-01-01

The problem of determining the financial status of a group of hospitals was posed by the Connecticut Regional Medical Program in 1967 with the question: Are Connecticut's general hospitals financially healthy? The economist assigned to explore the question here describes the economic concepts and the methodology from which models applicable to voluntary hospitals were developed, utilizing the accepted modes of analysis and standards of for-profit business. The basic index of financial health investigated is self-sufficiency, with plant liquidation, revenue control and the role of private payors, and cost control studied as factors affecting the financial status of hospitals. PMID:5799485

Preparing for fieldwork: Students' perceptions of their readiness to provide evidence-based practice.

PubMed

Evenson, Mary E

2013-01-01

The purpose of this study was to explore students' perceptions of their confidence to use research evidence to complete a client case analysis assignment in preparation for participation in fieldwork and future practice. A convenience sample of 42 entry-level occupational therapy Masters students, included 41 females and one male, ages 24 to 35. A quasi-experimental pretest-posttest design was used. Students participated in a problem-based learning approach supported by educational technology. Measures included a pre- and post-semester confidence survey, a post-semester satisfaction survey, and an assignment rubric. Based on paired t-tests and Wilcoxin Signed Ranks Tests, statistically significant differences in pre- and post-test scores were noted for all 18 items on the confidence survey (p< 0.001). Significant increases in students' confidence were noted for verbal and written communication of descriptive, assessment, and intervention evidence, along with increased confidence to effectively use assessment evidence. Results suggest that problem-based learning methods were significantly associated with students' perceptions of their confidence to use research evidence to analyze a client case. These results cannot necessarily be generalized due to the limitations of using non-standardized measures with a convenience sample, without a control group, within the context of a single course as part of one academic program curriculum.

Some Properties and Uses of Torsional Overlap Integrals

NASA Astrophysics Data System (ADS)

Mekhtiev, Mirza A.; Hougen, Jon T.

1998-01-01

The first diagonalization step in a rho-axis-method treatment of methyl-top internal rotation problems involves finding eigenvalues and eigenvectors of a torsional Hamiltonian, which depends on the rotational projection quantum numberKas a parameter. Traditionally the torsional quantum numbervt= 0, 1, 2···is assigned to eigenfunctions of givenKin order of increasing energy. In this paper we propose an alternative labeling scheme, using the torsional quantum numbervT, which is based on properties of theK-dependent torsional overlap integrals . In particular, the quantum numbervTis assigned in such a way that torsional wavefunctions |vT,K> vary as slowly as possible whenKchanges by unity. Roughly speaking,vT=vtfor torsional levels below the barrier, whereasvTis more closely related to the free-rotor quantum number for levels above the barrier. Because of the latter fact, we believevTwill in general be a physically more meaningful torsional quantum number for levels above the barrier. The usefulness of overlap integrals for qualitative prediction of torsion-rotation band intensities and for rationalizing the magnitudes of perturbations involving some excitation of the small-amplitude vibrations in an internal rotor problem is also discussed.

A randomized trial of standardized nursing patient assessment using wireless devices.

PubMed

Dykes, Patricia C; Carroll, Diane L; Benoit, Angela; Coakley, Amanda; Chang, Frank; Empoliti, Joanne; Gallagher, Joan; Lasala, Cynthia; O'Malley, Rosemary; Rath, Greg; Silva, Judy; Li, Qi

2007-10-11

A complete and accurate patient assessment database is essential for effective communication, problem identification, planning and evaluation of patient status. When employed consistently for point-of-care documentation, information systems are associated with completeness and quality of documentation. The purpose of this paper is to report on the findings of a randomized, cross-over study conducted to evaluate the adequacy of a standard patient assessment module to support problem identification, care planning and tracking of nursing sensitive patient outcomes. The feasibility of wireless devices to support patient assessment data collection at the point-of-care was evaluated using wireless PDAs and tablet PCs. Seventy-nine (79) nurses from two patient care units at Massachusetts General Hospital (Boston, MA) were recruited into the study and randomized to complete patient assessment using wireless or paper devices. At the end of six weeks, nurses who where randomized to the paper assessment module were assigned to a device and those who used a device were assigned to paper for an additional six weeks. Impact was evaluated with regard to data capture, workflow implications and nurse satisfaction. Findings suggest that a standard patient assessment set promotes patient sensitive and quality data capture, which is augmented by the use of wireless devices.

A Randomized Trial of Standardized Nursing Patient Assessment Using Wireless Devices

PubMed Central

Dykes, Patricia C.; Carroll, Diane L.; Benoit, Angela; Coakley, Amanda; Chang, Frank; Empoliti, Joanne; Gallagher, Joan; Lasala, Cynthia; O’Malley, Rosemary; Rath, Greg; Silva, Judy; Li, Qi

2007-01-01

A complete and accurate patient assessment database is essential for effective communication, problem identification, planning and evaluation of patient status. When employed consistently for point-of-care documentation, information systems are associated with completeness and quality of documentation. The purpose of this paper is to report on the findings of a randomized, cross-over study conducted to evaluate the adequacy of a standard patient assessment module to support problem identification, care planning and tracking of nursing sensitive patient outcomes. The feasibility of wireless devices to support patient assessment data collection at the point-of-care was evaluated using wireless PDAs and tablet PCs. Seventy-nine (79) nurses from two patient care units at Massachusetts General Hospital (Boston, MA) were recruited into the study and randomized to complete patient assessment using wireless or paper devices. At the end of six weeks, nurses who where randomized to the paper assessment module were assigned to a device and those who used a device were assigned to paper for an additional six weeks. Impact was evaluated with regard to data capture, workflow implications and nurse satisfaction. Findings suggest that a standard patient assessment set promotes patient sensitive and quality data capture, which is augmented by the use of wireless devices. PMID:18693827

Efficient partitioning and assignment on programs for multiprocessor execution

NASA Technical Reports Server (NTRS)

Standley, Hilda M.

1993-01-01

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

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

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

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…

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…

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

[Nursing care priorities and problems: the nurses point of view].

PubMed

Piccoli, Michele; Di Giulio, Paola; Ruffino, Emanuele; Zollesi, Germana; Dello Russo, Carolina

2006-01-01

An experience of a tentative contribution of the nurses to the health policy planning is described. Fifty one focus groups were organized, with nurses from different contexts (hospital, district, free lance nurses; caring for paediatric, geriatric surgical and medical patients) and nurses were asked to identify problems encountered in patients care, select one, discuss contributing causes assign a weight (from 1 to 100) and define the nurses' contribution to the resolution/improvement of each cause. The problems were discussed in groups and possible solutions identified, with specific attention to the potential implications of regional health policies. The main difficulties identified were the lack of continuity in patients care (for geriatric and paediatrics patients), 12 groups, and the management of chronic patients (7 groups); the lack of information to patients, 6 groups; the appropriateness of care, from hospital admissions to waiting lists, 5 groups; the management of surgical patients, 5 groups; the lack of nursing personnel, 5 groups; the safety of patients and health personnel, 4 groups; and other problems reported by less than 3 groups. This experience allowed nurses to reflect on health care problems throughout the trajectory from the specific problem to its general implications, also for the health care policies. The solutions identified in fact, encompass a dimension relevant for health policy planning. It is also an experience of opportunity (and feasibility) of involvement of the "general nurses" and not only nurse managers, to reflect on practice and propose a specific and original contribution to the development of regional and local policies.

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

Assignment Procedures in the Air Force Procurement Management Information System.

ERIC Educational Resources Information Center

Ward, Joe H., Jr.; And Others

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

Primal-dual techniques for online algorithms and mechanisms

NASA Astrophysics Data System (ADS)

Liaghat, Vahid

An offline algorithm is one that knows the entire input in advance. An online algorithm, however, processes its input in a serial fashion. In contrast to offline algorithms, an online algorithm works in a local fashion and has to make irrevocable decisions without having the entire input. Online algorithms are often not optimal since their irrevocable decisions may turn out to be inefficient after receiving the rest of the input. For a given online problem, the goal is to design algorithms which are competitive against the offline optimal solutions. In a classical offline scenario, it is often common to see a dual analysis of problems that can be formulated as a linear or convex program. Primal-dual and dual-fitting techniques have been successfully applied to many such problems. Unfortunately, the usual tricks come short in an online setting since an online algorithm should make decisions without knowing even the whole program. In this thesis, we study the competitive analysis of fundamental problems in the literature such as different variants of online matching and online Steiner connectivity, via online dual techniques. Although there are many generic tools for solving an optimization problem in the offline paradigm, in comparison, much less is known for tackling online problems. The main focus of this work is to design generic techniques for solving integral linear optimization problems where the solution space is restricted via a set of linear constraints. A general family of these problems are online packing/covering problems. Our work shows that for several seemingly unrelated problems, primal-dual techniques can be successfully applied as a unifying approach for analyzing these problems. We believe this leads to generic algorithmic frameworks for solving online problems. In the first part of the thesis, we show the effectiveness of our techniques in the stochastic settings and their applications in Bayesian mechanism design. In particular, we introduce new techniques for solving a fundamental linear optimization problem, namely, the stochastic generalized assignment problem (GAP). This packing problem generalizes various problems such as online matching, ad allocation, bin packing, etc. We furthermore show applications of such results in the mechanism design by introducing Prophet Secretary, a novel Bayesian model for online auctions. In the second part of the thesis, we focus on the covering problems. We develop the framework of "Disk Painting" for a general class of network design problems that can be characterized by proper functions. This class generalizes the node-weighted and edge-weighted variants of several well-known Steiner connectivity problems. We furthermore design a generic technique for solving the prize-collecting variants of these problems when there exists a dual analysis for the non-prize-collecting counterparts. Hence, we solve the online prize-collecting variants of several network design problems for the first time. Finally we focus on designing techniques for online problems with mixed packing/covering constraints. We initiate the study of degree-bounded graph optimization problems in the online setting by designing an online algorithm with a tight competitive ratio for the degree-bounded Steiner forest problem. We hope these techniques establishes a starting point for the analysis of the important class of online degree-bounded optimization on graphs.

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.

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…

47 CFR 2.102 - Assignment of frequencies.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 1 2010-10-01 2010-10-01 false Assignment of frequencies. 2.102 Section 2.102 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL... authorized the use of any frequency or frequency band not exclusively allocated to the passive services...

Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

NASA Astrophysics Data System (ADS)

Cheng, Bayi; Yang, Shanlin; Hu, Xiaoxuan; Li, Kai

2014-03-01

This article considers the problem of scheduling two batch-processing machines in flow shop where the jobs have arbitrary sizes and the machines have limited capacity. The jobs are processed in batches and the total size of jobs in each batch cannot exceed the machine capacity. Once a batch is being processed, no interruption is allowed until all the jobs in it are completed. The problem of minimising makespan is NP-hard in the strong sense. First, we present a mathematical model of the problem using integer programme. We show the scale of feasible solutions of the problem and provide optimality properties. Then, we propose a polynomial time algorithm with running time in O(nlogn). The jobs are first assigned in feasible batches and then scheduled on machines. For the general case, we prove that the proposed algorithm has a performance guarantee of 4. For the special case where the processing times of each job on the two machines satisfy p 1 j = ap 2 j , the performance guarantee is ? for a > 0.

Preschool children with externalizing behaviors: experience of fathers and mothers.

PubMed

Baker, B L; Heller, T L

1996-08-01

Childhood behavior disorders are related to family stress and maladjustment. Little is known, however, about the adjustment of families with preschool-aged children at risk for subsequent behavior disorders. Moreover, fathers' perceptions of child problem behavior and their reactions to it generally have been neglected. Subjects were mothers and fathers of 52 preschool-aged children assigned to one of three groups: control, moderate externalizing, and high externalizing. Higher child externalizing behavior was associated with greater negative family impact, lowered parenting sense of efficacy, and child-rearing practices that were more authoritarian and less authoritative. Mothers and fathers did not differ in actual perceived level of child behavior problems, although both believed that mothers saw more problems. Child Group x Parent interactions indicated that mothers experienced increased stress and a need for help with moderate as well as high child externalizing behaviors, whereas fathers were not elevated on these measures unless the child's externalizing behaviors were high. Implications of these findings for early family intervention are considered.

Prefrontal Neurons Encode a Solution to the Credit-Assignment Problem

PubMed Central

Perge, János A.; Eskandar, Emad N.

2017-01-01

To adapt successfully to our environments, we must use the outcomes of our choices to guide future behavior. Critically, we must be able to correctly assign credit for any particular outcome to the causal features which preceded it. In some cases, the causal features may be immediately evident, whereas in others they may be separated in time or intermingled with irrelevant environmental stimuli, creating a potentially nontrivial credit-assignment problem. We examined the neuronal representation of information relevant for credit assignment in the dorsolateral prefrontal cortex (dlPFC) of two male rhesus macaques performing a task that elicited key aspects of this problem. We found that neurons conveyed the information necessary for credit assignment. Specifically, neuronal activity reflected both the relevant cues and outcomes at the time of feedback and did so in a manner that was stable over time, in contrast to prior reports of representational instability in the dlPFC. Furthermore, these representations were most stable early in learning, when credit assignment was most needed. When the same features were not needed for credit assignment, these neuronal representations were much weaker or absent. These results demonstrate that the activity of dlPFC neurons conforms to the basic requirements of a system that performs credit assignment, and that spiking activity can serve as a stable mechanism that links causes and effects. SIGNIFICANCE STATEMENT Credit assignment is the process by which we infer the causes of our successes and failures. We found that neuronal activity in the dorsolateral prefrontal cortex conveyed the necessary information for performing credit assignment. Importantly, while there are various potential mechanisms to retain a “trace” of the causal events over time, we observed that spiking activity was sufficiently stable to act as the link between causes and effects, in contrast to prior reports that suggested spiking representations were unstable over time. In addition, we observed that this stability varied as a function of learning, such that the neural code was more reliable over time during early learning, when it was most needed. PMID:28634307

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

Distributed resource allocation under communication constraints

NASA Astrophysics Data System (ADS)

Dodin, Pierre; Nimier, Vincent

2001-03-01

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

Multisystemic Therapy and Functional Family Therapy Compared on their Effectiveness Using the Propensity Score Method.

PubMed

Eeren, Hester V; Goossens, Lucas M A; Scholte, Ron H J; Busschbach, Jan J V; van der Rijken, Rachel E A

2018-01-09

Multisystemic Therapy (MST) and Functional Family Therapy (FFT) have overlapping target populations and treatment goals. In this study, these interventions were compared on their effectiveness using a quasi-experimental design. Between October, 2009 and June, 2014, outcome data were collected from 697 adolescents (mean age 15.3 (SD 1.48), 61.9% male) assigned to either MST or FFT (422 MST; 275 FFT). Data were gathered during Routine Outcome Monitoring. The primary outcome was externalizing problem behavior (Child Behavior Checklist and Youth Self Report). Secondary outcomes were the proportion of adolescents living at home, engaged in school or work, and who lacked police contact during treatment. Because of the non-random assignment, a propensity score method was used to control for observed pre-treatment differences. Because the risk-need-responsivity (RNR) model guided treatment assignment, effectiveness was also estimated in youth with and without a court order as an indicator of their risk level. Looking at the whole sample, no difference in effect was found with regard to externalizing problems. For adolescents without a court order, effects on externalizing problems were larger after MST. Because many more adolescents with a court order were assigned to MST compared to FFT, the propensity score method could not balance the treatment groups in this subsample. In conclusion, few differences between MST and FFT were found. In line with the RNR model, higher risk adolescents were assigned to the more intensive treatment, namely MST. In the group with lower risk adolescents, this more intensive treatment was more effective in reducing externalizing problems.

Maternal education preferences moderate the effects of mandatory employment and education programs on child positive and problem behaviors.

PubMed

Gassman-Pines, Anna; Godfrey, Erin B; Yoshikawa, Hirokazu

2013-01-01

Grounded in person-environment fit theory, this study examined whether low-income mothers' preferences for education moderated the effects of employment- and education-focused welfare programs on children's positive and problem behaviors. The sample included 1,365 families with children between ages 3 and 5 years at study entry. Results 5 years after random assignment, when children were ages 8-10 years, indicated that mothers' education preferences did moderate program impacts on teacher-reported child behavior problems and positive behavior. Children whose mothers were assigned to the education program were rated by teachers to have less externalizing behavior and more positive behavior than children whose mothers were assigned to the employment program but only when mothers had strong preferences for education. © 2012 The Authors. Child Development © 2012 Society for Research in Child Development, Inc.

Mining Stable Roles in RBAC

NASA Astrophysics Data System (ADS)

Colantonio, Alessandro; di Pietro, Roberto; Ocello, Alberto; Verde, Nino Vincenzo

In this paper we address the problem of generating a candidate role-set for an RBAC configuration that enjoys the following two key features: it minimizes the administration cost; and, it is a stable candidate role-set. To achieve these goals, we implement a three steps methodology: first, we associate a weight to roles; second, we identify and remove the user-permission assignments that cannot belong to a role that have a weight exceeding a given threshold; third, we restrict the problem of finding a candidate role-set for the given system configuration using only the user-permission assignments that have not been removed in the second step—that is, user-permission assignments that belong to roles with a weight exceeding the given threshold. We formally show—proof of our results are rooted in graph theory—that this methodology achieves the intended goals. Finally, we discuss practical applications of our approach to the role mining problem.

26 CFR 1.401(a)-13 - Assignment or alienation of benefits.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 26 Internal Revenue 5 2010-04-01 2010-04-01 false Assignment or alienation of benefits. 1.401(a...)-13 Assignment or alienation of benefits. (a) Scope of the regulations. This section applies only to..., provided for employer contributions. (b) No assignment or alienation—(1) General rule. Under section 401(a...

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

Model and algorithm for container ship stowage planning based on bin-packing problem

NASA Astrophysics Data System (ADS)

Zhang, Wei-Ying; Lin, Yan; Ji, Zhuo-Shang

2005-09-01

In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem (CSSP) is regarded as “packing problem”, ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics (homogeneous containers group) are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows. The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.

Predicting category intuitiveness with the rational model, the simplicity model, and the generalized context model.

PubMed

Pothos, Emmanuel M; Bailey, Todd M

2009-07-01

Naïve observers typically perceive some groupings for a set of stimuli as more intuitive than others. The problem of predicting category intuitiveness has been historically considered the remit of models of unsupervised categorization. In contrast, this article develops a measure of category intuitiveness from one of the most widely supported models of supervised categorization, the generalized context model (GCM). Considering different category assignments for a set of instances, the authors asked how well the GCM can predict the classification of each instance on the basis of all the other instances. The category assignment that results in the smallest prediction error is interpreted as the most intuitive for the GCM-the authors refer to this way of applying the GCM as "unsupervised GCM." The authors systematically compared predictions of category intuitiveness from the unsupervised GCM and two models of unsupervised categorization: the simplicity model and the rational model. The unsupervised GCM compared favorably with the simplicity model and the rational model. This success of the unsupervised GCM illustrates that the distinction between supervised and unsupervised categorization may need to be reconsidered. However, no model emerged as clearly superior, indicating that there is more work to be done in understanding and modeling category intuitiveness.

An automated system for reduction of the firm's employees under maximal overall efficiency

NASA Astrophysics Data System (ADS)

Yonchev, Yoncho; Nikolov, Simeon; Baeva, Silvia

2012-11-01

Achieving maximal overall efficiency is a priority in all companies. This problem is formulated as a knap-sack problem and afterwards as a linear assignment problem. An automated system is created for solving of this problem.

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

14 CFR 385.1 - Definitions.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 4 2014-01-01 2014-01-01 false Definitions. 385.1 Section 385.1...) ORGANIZATION STAFF ASSIGNMENTS AND REVIEW OF ACTION UNDER ASSIGNMENTS General Provisions § 385.1 Definitions... subject matter under review, but not with regard to Deputy General Counsel and Administrative Law Judge...

47 CFR 1.948 - Assignment of authorization or transfer of control, notification of consummation.

Code of Federal Regulations, 2011 CFR

2011-10-01

... COMMISSION GENERAL PRACTICE AND PROCEDURE Wireless Radio Services Applications and Proceedings Application... consummation. (a) General. Except as provided in this section, authorizations in the Wireless Radio Services... involuntary assignment or transfer. (d) Notification of consummation. In all Wireless Radio Services...

47 CFR 1.948 - Assignment of authorization or transfer of control, notification of consummation.

Code of Federal Regulations, 2010 CFR

2010-10-01

... COMMISSION GENERAL PRACTICE AND PROCEDURE Wireless Radio Services Applications and Proceedings Application... consummation. (a) General. Except as provided in this section, authorizations in the Wireless Radio Services... involuntary assignment or transfer. (d) Notification of consummation. In all Wireless Radio Services...

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.

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…

Exact semi-separation of variables in waveguides with non-planar boundaries

NASA Astrophysics Data System (ADS)

Athanassoulis, G. A.; Papoutsellis, Ch. E.

2017-05-01

Series expansions of unknown fields Φ =∑φn Zn in elongated waveguides are commonly used in acoustics, optics, geophysics, water waves and other applications, in the context of coupled-mode theories (CMTs). The transverse functions Zn are determined by solving local Sturm-Liouville problems (reference waveguides). In most cases, the boundary conditions assigned to Zn cannot be compatible with the physical boundary conditions of Φ, leading to slowly convergent series, and rendering CMTs mild-slope approximations. In the present paper, the heuristic approach introduced in Athanassoulis & Belibassakis (Athanassoulis & Belibassakis 1999 J. Fluid Mech. 389, 275-301) is generalized and justified. It is proved that an appropriately enhanced series expansion becomes an exact, rapidly convergent representation of the field Φ, valid for any smooth, non-planar boundaries and any smooth enough Φ. This series expansion can be differentiated termwise everywhere in the domain, including the boundaries, implementing an exact semi-separation of variables for non-separable domains. The efficiency of the method is illustrated by solving a boundary value problem for the Laplace equation, and computing the corresponding Dirichlet-to-Neumann operator, involved in Hamiltonian equations for nonlinear water waves. The present method provides accurate results with only a few modes for quite general domains. Extensions to general waveguides are also discussed.

Impaired Processing of Serial Order Determines Working Memory Impairments in Alzheimer's Disease.

PubMed

De Belder, Maya; Santens, Patrick; Sieben, Anne; Fias, Wim

2017-01-01

Working memory (WM) problems are commonly observed in Alzheimer's disease (AD), but the affected mechanisms leading to impaired WM are still insufficiently understood. The ability to efficiently process serial order in WM has been demonstrated to be fundamental to fluent daily life functioning. The decreased capability to mentally process serial position in WM has been put forward as the underlying explanation for generally compromised WM performance. Determine which mechanisms, such as order processing, are responsible for deficient WM functioning in AD. A group of AD patients (n = 32) and their partners (n = 25), assigned to the control group, were submitted to an extensive battery of neuropsychological and experimental tasks, assessing general cognitive state and functioning of several aspects related to serial order WM. The results revealed an impaired ability to bind item information to serial position within WM in AD patients compared to controls. It was additionally observed that AD patients experienced specific difficulties with directing spatial attention when searching for item information stored in WM. The processing of serial order and the allocation of attentional resources are both disrupted, explaining the generally reduced WM functioning in AD patients. Further studies should now clarify whether this observation could explain disease-related problems for other cognitive functions such as verbal expression, auditory comprehension, or planning.

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

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.

Gendered Responses to Online Homework Use in General Chemistry

ERIC Educational Resources Information Center

Richards-Babb, Michelle; Jackson, Jennifer Kasi

2011-01-01

Online homework assignments have been shown to enhance student performance. Our research on gendered responses to these assignments adds new and useful information. We investigated differences between male and female students' responses to online homework in large-enrollment general chemistry courses. Replacing in class quizzes with online…

37 CFR 1.12 - Assignment records open to public inspection.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Assignment records open to public inspection. 1.12 Section 1.12 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES General Provisions...

37 CFR 1.12 - Assignment records open to public inspection.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 37 Patents, Trademarks, and Copyrights 1 2013-07-01 2013-07-01 false Assignment records open to public inspection. 1.12 Section 1.12 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES General Provisions...

37 CFR 1.12 - Assignment records open to public inspection.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 37 Patents, Trademarks, and Copyrights 1 2011-07-01 2011-07-01 false Assignment records open to public inspection. 1.12 Section 1.12 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES General Provisions...

37 CFR 1.12 - Assignment records open to public inspection.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 37 Patents, Trademarks, and Copyrights 1 2014-07-01 2014-07-01 false Assignment records open to public inspection. 1.12 Section 1.12 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES General Provisions...

A Simple and Practical Index to Measure Dementia-Related Quality of Life.

PubMed

Arons, Alexander M M; Schölzel-Dorenbos, Carla J M; Olde Rikkert, Marcel G M; Krabbe, Paul F M

2016-01-01

Research on new treatments for dementia is gaining pace worldwide in an effort to alleviate this growing health care problem. The optimal evaluation of such interventions, however, calls for a practical and credible patient-reported outcome measure. To describe the refinement of the Dementia Quality-of-life Instrument (DQI) and present its revised version. A prototype of the DQI was adapted to cover a broader range of health-related quality of life (HRQOL) and to improve consistency in the descriptions of its domains. A valuation study was then conducted to assign meaningful numbers to all DQI health states. Pairs of DQI states were presented to a sample of professionals working with people with dementia and a representative sample of the Dutch population. They had to repeatedly select the best DQI state, and their responses were statistically modeled to obtain values for each health state. In total, 207 professionals working with people with dementia and 631 members of the general population completed the paired comparison tasks. Statistically significant differences between the two samples were found for the domains of social functioning, mood, and memory. Severe problems with physical health and severe memory problems were deemed most important by the general population. In contrast, severe mood problems were considered most important by professionals working with people with dementia. The DQI is a simple and feasible measurement instrument that expresses the overall HRQOL of people suffering from dementia in a single meaningful number. Current results suggest that revisiting the discussion of using values from the general population might be warranted in the dementia context. Copyright © 2016 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by 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

A pilot demonstration project of technology application from the aerospace industry to city management (four cities program)

NASA Technical Reports Server (NTRS)

Ervin, G. F.; Blomeyer, L. S.

1972-01-01

The Four Cities Program has completed the first year of the planned two-year program. At the beginning of the first year, a variety of program initiation activities were accomplished. Contracts were negotiated; science and technology advisors were interviewed, selected and assigned; general indoctrination and integration of the advisors into city affairs occurred; technical needs were identified and related projects pursued; pilot projects for the second year were identified; inter-city coordination on technical problems began to emerge; and the general soundness of the four cities program seems to have been established. Above all, the inter-personal relationships between the advisors and their interfaces in city government appear to be functioning smoothly. The establishment of such mutual respect, trusts, and confidences are believed essential to the success of the program.

Smoking Initiation and the Iron Law of Demand *

PubMed Central

Lillard, Dean R.; Molloy, Eamon; Sfekas, Andrew

2012-01-01

We show, with three longitudinal datasets, that cigarette taxes and prices affect smoking initiation decisions. Previous longitudinal studies have found somewhat mixed results, but generally have not found initiation to be sensitive to increases in price or tax. We show that the lack of statistical significance in previous studies may be at least partially attributed to a lack of policy variation in the time periods studied, truncated behavioral windows, or mis-assignment of price and tax rates in retrospective data (which occurs when one has no information about respondents’ prior state or region of residence in retrospective data). We show how each factor may affect the estimation of initiation models. Our findings suggest several problems that are applicable to initiation behavior generally, particularly those for which individuals’ responses to policy changes may be noisy or small in magnitude. PMID:23220458

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.

On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers

DTIC Science & Technology

2012-08-01

the less exact one is solved later — assigned as step 4 of Algorithm 2 — because at each iteration , the ADM updates the variables in the Gauss - Seidel ...k) and that of an accelerated version descends at O(1/k2). Then, work [14] establishes the same rates on a Gauss - Seidel version and requires only one... iteration Fig. 5.1. Convergence curves of ADM for the elastic net problem. 17 0 50 100 150 200 0.75 0.8 0.85 0.9 0.95 1 Iteration ‖u k + 1 − u ∗ ‖ 2 G / ‖u k

Improving problem solving in primary school students: The effect of a training programme focusing on metacognition and working memory.

PubMed

Cornoldi, Cesare; Carretti, Barbara; Drusi, Silvia; Tencati, Chiara

2015-09-01

Despite doubts voiced on their efficacy, a series of studies has been carried out on the capacity of training programmes to improve academic and reasoning skills by focusing on underlying cognitive abilities and working memory in particular. No systematic efforts have been made, however, to test training programmes that involve both general and specific underlying abilities. If effective, these programmes could help to increase students' motivation and competence. This study examined the feasibility of improving problem-solving skills in school children by means of a training programme that addresses general and specific abilities involved in problem solving, focusing on metacognition and working memory. The project involved a sample of 135 primary school children attending eight classes in the third, fourth, and fifth grades (age range 8-10 years). The classes were assigned to two groups, one attending the training programme in the first 3 months of the study (Training Group 1) and the other serving as a waiting-list control group (Training Group 2). In the second phase of the study, the role of the two groups was reversed, with Training Group 2 attending the training instead of Training Group 1. The training programme led to improvements in both metacognitive and working memory tasks, with positive-related effects on the ability to solve problems. The gains seen in Training Group 1 were also maintained at the second post-test (after 3 months). Specific activities focusing on metacognition and working memory may contribute to modifying arithmetical problem-solving performance in primary school children. © 2015 The British Psychological Society.

Interpersonal Problems Predict Differential Response to Cognitive Versus Behavioral Treatment in a Randomized Controlled Trial

PubMed Central

Newman, Michelle G.; Jacobson, Nicholas C.; Erickson, Thane M.; Fisher, Aaron J.

2016-01-01

Objective We examined dimensional interpersonal problems as moderators of cognitive behavioral therapy (CBT) versus its components (cognitive therapy [CT] and behavioral therapy [BT]). We predicted that people with generalized anxiety disorder (GAD) whose interpersonal problems reflected more dominance and intrusiveness would respond best to a relaxation-based BT compared to CT or CBT, based on studies showing that people with personality features associated with a need for autonomy respond best to treatments that are more experiential, concrete, and self-directed compared to therapies involving abstract analysis of one’s problems (e.g., containing CT). Method This was a secondary analysis of Borkovec, Newman, Pincus, and Lytle (2002). Forty-seven participants with principal diagnoses of GAD were assigned randomly to combined CBT (n = 16), CT (n = 15), or BT (n = 16). Results As predicted, compared to participants with less intrusiveness, those with dimensionally more intrusiveness responded with greater GAD symptom reduction to BT than to CBT at posttreatment and greater change to BT than to CT or CBT across all follow-up points. Similarly, those with more dominance responded better to BT compared to CT and CBT at all follow-up points. Additionally, being overly nurturant at baseline was associated with GAD symptoms at baseline, post, and all follow-up time-points regardless of therapy condition. Conclusions Generally anxious individuals with domineering and intrusive problems associated with higher need for control may respond better to experiential behavioral interventions than to cognitive interventions, which may be perceived as a direct challenge of their perceptions. PMID:28077221

Interpersonal Problems Predict Differential Response to Cognitive Versus Behavioral Treatment in a Randomized Controlled Trial.

PubMed

Newman, Michelle G; Jacobson, Nicholas C; Erickson, Thane M; Fisher, Aaron J

2017-01-01

We examined dimensional interpersonal problems as moderators of cognitive behavioral therapy (CBT) versus its components (cognitive therapy [CT] and behavioral therapy [BT]). We predicted that people with generalized anxiety disorder (GAD) whose interpersonal problems reflected more dominance and intrusiveness would respond best to a relaxation-based BT compared to CT or CBT, based on studies showing that people with personality features associated with a need for autonomy respond best to treatments that are more experiential, concrete, and self-directed compared to therapies involving abstract analysis of one's problems (e.g., containing CT). This was a secondary analysis of Borkovec, Newman, Pincus, and Lytle (2002). Forty-seven participants with principal diagnoses of GAD were assigned randomly to combined CBT (n = 16), CT (n = 15), or BT (n = 16). As predicted, compared to participants with less intrusiveness, those with dimensionally more intrusiveness responded with greater GAD symptom reduction to BT than to CBT at posttreatment and greater change to BT than to CT or CBT across all follow-up points. Similarly, those with more dominance responded better to BT compared to CT and CBT at all follow-up points. Additionally, being overly nurturant at baseline was associated with GAD symptoms at baseline, post, and all follow-up time-points regardless of therapy condition. Generally anxious individuals with domineering and intrusive problems associated with higher need for control may respond better to experiential behavioral interventions than to cognitive interventions, which may be perceived as a direct challenge of their perceptions. Copyright © 2016. Published by Elsevier Ltd.

47 CFR 1.550 - Requests for new or modified call sign assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 1 2010-10-01 2010-10-01 false Requests for new or modified call sign assignments. 1.550 Section 1.550 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL PRACTICE AND... modified call sign assignments. See § 73.3550. ...

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

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Spectrum-to-Spectrum Searching Using a Proteome-wide Spectral Library*

PubMed Central

Yen, Chia-Yu; Houel, Stephane; Ahn, Natalie G.; Old, William M.

2011-01-01

The unambiguous assignment of tandem mass spectra (MS/MS) to peptide sequences remains a key unsolved problem in proteomics. Spectral library search strategies have emerged as a promising alternative for peptide identification, in which MS/MS spectra are directly compared against a reference library of confidently assigned spectra. Two problems relate to library size. First, reference spectral libraries are limited to rediscovery of previously identified peptides and are not applicable to new peptides, because of their incomplete coverage of the human proteome. Second, problems arise when searching a spectral library the size of the entire human proteome. We observed that traditional dot product scoring methods do not scale well with spectral library size, showing reduction in sensitivity when library size is increased. We show that this problem can be addressed by optimizing scoring metrics for spectrum-to-spectrum searches with large spectral libraries. MS/MS spectra for the 1.3 million predicted tryptic peptides in the human proteome are simulated using a kinetic fragmentation model (MassAnalyzer version2.1) to create a proteome-wide simulated spectral library. Searches of the simulated library increase MS/MS assignments by 24% compared with Mascot, when using probabilistic and rank based scoring methods. The proteome-wide coverage of the simulated library leads to 11% increase in unique peptide assignments, compared with parallel searches of a reference spectral library. Further improvement is attained when reference spectra and simulated spectra are combined into a hybrid spectral library, yielding 52% increased MS/MS assignments compared with Mascot searches. Our study demonstrates the advantages of using probabilistic and rank based scores to improve performance of spectrum-to-spectrum search strategies. PMID:21532008

A multi-satellite orbit determination problem in a parallel processing environment

NASA Technical Reports Server (NTRS)

Deakyne, M. S.; Anderle, R. J.

1988-01-01

The Engineering Orbit Analysis Unit at GE Valley Forge used an Intel Hypercube Parallel Processor to investigate the performance and gain experience of parallel processors with a multi-satellite orbit determination problem. A general study was selected in which major blocks of computation for the multi-satellite orbit computations were used as units to be assigned to the various processors on the Hypercube. Problems encountered or successes achieved in addressing the orbit determination problem would be more likely to be transferable to other parallel processors. The prime objective was to study the algorithm to allow processing of observations later in time than those employed in the state update. Expertise in ephemeris determination was exploited in addressing these problems and the facility used to bring a realism to the study which would highlight the problems which may not otherwise be anticipated. Secondary objectives were to gain experience of a non-trivial problem in a parallel processor environment, to explore the necessary interplay of serial and parallel sections of the algorithm in terms of timing studies, to explore the granularity (coarse vs. fine grain) to discover the granularity limit above which there would be a risk of starvation where the majority of nodes would be idle or under the limit where the overhead associated with splitting the problem may require more work and communication time than is useful.

General relativity in upper secondary school: Design and evaluation of an online learning environment using the model of educational reconstruction

NASA Astrophysics Data System (ADS)

Kersting, Magdalena; Henriksen, Ellen Karoline; Bøe, Maria Vetleseter; Angell, Carl

2018-06-01

Because of its abstract nature, Albert Einstein's theory of general relativity is rarely present in school physics curricula. Although the educational community has started to investigate ways of bringing general relativity to classrooms, field-tested educational material is rare. Employing the model of educational reconstruction, we present a collaborative online learning environment that was introduced to final year students (18-19 years old) in six Norwegian upper secondary physics classrooms. Design-based research methods guided the development of the learning resources, which were based on a sociocultural view of learning and a historical-philosophical approach to teaching general relativity. To characterize students' learning from and interaction with the learning environment we analyzed focus group interviews and students' oral and written responses to assigned problems and discussion tasks. Our findings show how design choices on different levels can support or hinder understanding of general relativity, leading to the formulation of design principles that help to foster qualitative understanding and encourage collaborative learning. The results indicate that upper secondary students can obtain a qualitative understanding of general relativity when provided with appropriately designed learning resources and sufficient scaffolding of learning through interaction with teacher and peers.

Consumers as mental health providers: first-person accounts of benefits and limitations.

PubMed

Mowbray, C T; Moxley, D P; Collins, M E

1998-11-01

Community support programs are increasingly establishing paid service positions designated exclusively for consumers. Project WINS (Work Incentives and Needs Study), a hybrid case management-vocational program for individuals with severe mental illness, used consumers as peer support specialists (PSSs) to supplement professional roles. Semistructured interviews were conducted with PSSs about 12 months after their employment ended. They identified substantial personal benefits specific to consumer-designated roles (e.g., a "safe" employment setting with accommodations) and general benefits from employment. Problems described were just as numerous, encompassing attitudes toward assigned peers and costs to their own well-being. Critical commentary addressed program operations (structure, supervision, and training needs) and problems in the mental health system. The authors discuss the changed sense of self that service provider roles can create for consumers and suggest that mental health administrators provide anticipatory socialization for this service innovation throughout their agencies and ongoing supports for consumers in their new roles.

Animal-Assisted Therapies for Youth with or at risk for Mental Health Problems: A Systematic Review.

PubMed

Hoagwood, Kimberly Eaton; Acri, Mary; Morrissey, Meghan; Peth-Pierce, Robin

2017-01-01

To systematically review experimental evidence about animal-assisted therapies (AAT) for children or adolescents with or at risk for mental health conditions, we reviewed all experimental AAT studies published between 2000-2015, and compared studies by animal type, intervention, and outcomes. Studies were included if used therapeutically for children and adolescents (≤21 years) with or at risk for a mental health problem; used random assignment or a waitlist comparison/control group; and included child-specific outcome data. Of 1,535 studies, 24 met inclusion criteria. Of 24 studies identified, almost half were randomized controlled trials, with 9 of 11 published in the past two years. The largest group addresses equine therapies for autism. Findings are generally promising for positive effects associated with equine therapies for autism and canine therapies for childhood trauma. The AAT research base is slim; a more focused research agenda is outlined.

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…

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

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)

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…

Interleaved Practice Improves Mathematics Learning

ERIC Educational Resources Information Center

Rohrer, Doug; Dedrick, Robert F.; Stershic, Sandra

2015-01-01

A typical mathematics assignment consists primarily of practice problems requiring the strategy introduced in the immediately preceding lesson (e.g., a dozen problems that are solved by using the Pythagorean theorem). This means that students know which strategy is needed to solve each problem before they read the problem. In an alternative…

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

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

14 CFR 385.20 - Authority of the Inspector General.

Code of Federal Regulations, 2010 CFR

2010-01-01

... PROCEEDINGS) ORGANIZATION STAFF ASSIGNMENTS AND REVIEW OF ACTION UNDER ASSIGNMENTS Assignment of Functions to... examinations of carrier facilities, operations, and accounting and statistical records. (b)(1) For accounting... statements necessary to an explanation of any carrier accounting practice. [Docket No. T-1, 49 FR 50985, Dec...

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.

GCSE Assessment Notes: Six GCSE Assessment Assignments.

ERIC Educational Resources Information Center

Graham, Stephen

1988-01-01

Provided are copy masters, instructions for use, and grading criteria for six problems used as part of the practical assessment for a modular science course. Each problem gives a narrative and a list of materials necessary to complete the problem. (CW)

Real life working shift assignment problem

NASA Astrophysics Data System (ADS)

Sze, San-Nah; Kwek, Yeek-Ling; Tiong, Wei-King; Chiew, Kang-Leng

2017-07-01

This study concerns about the working shift assignment in an outlet of Supermarket X in Eastern Mall, Kuching. The working shift assignment needs to be solved at least once in every month. Current approval process of working shifts is too troublesome and time-consuming. Furthermore, the management staff cannot have an overview of manpower and working shift schedule. Thus, the aim of this study is to develop working shift assignment simulation and propose a working shift assignment solution. The main objective for this study is to fulfill manpower demand at minimum operation cost. Besides, the day off and meal break policy should be fulfilled accordingly. Demand based heuristic is proposed to assign working shift and the quality of the solution is evaluated by using the real data.

Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities

ERIC Educational Resources Information Center

Brusco, Michael J.

2007-01-01

The study of human performance on discrete optimization problems has a considerable history that spans various disciplines. The two most widely studied problems are the Euclidean traveling salesperson problem and the quadratic assignment problem. The purpose of this paper is to outline a program of study for the measurement of human performance on…

Optimal distribution of medical backpacks and health surveillance assistants in Malawi.

PubMed

Kunkel, Amber G; Van Itallie, Elizabeth S; Wu, Duo

2014-09-01

Despite recent progress, Malawi continues to perform poorly on key health indicators such as child mortality and life expectancy. These problems are exacerbated by a severe lack of access to health care. Health Surveillance Assistants (HSAs) help bridge this gap by providing community-level access to basic health care services. However, the success of these HSAs is limited by a lack of supplies and long distances between HSAs and patients. To address this issue, we used large-scale weighted p-median and capacitated facility location problems to create a scalable, three-tiered plan for optimal allocation of HSAs, HSA designated medical backpacks, and backpack resupply centers. Our analysis uses real data on the location and characteristics of hospitals, health centers, and the general population. In addition to offering specific recommendations for HSA, backpack, and resupply center locations, it provides general insights into the scope of the proposed HSA backpack program scale-up. In particular, it demonstrates the importance of local health centers to the resupply network. The proposed assignments are robust to changes in the underlying population structure, and could significantly improve access to medical supplies for both HSAs and patients.

46 CFR 148.01-13 - Assignment and certification.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 5 2010-10-01 2010-10-01 false Assignment and certification. 148.01-13 Section 148.01-13 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DANGEROUS CARGOES CARRIAGE OF SOLID HAZARDOUS MATERIALS IN BULK General § 148.01-13 Assignment and certification. (a) The National...

31 CFR 306.87 - Partnerships (including nominee partnerships).

Code of Federal Regulations, 2010 CFR

2010-07-01

... (including nominee partnerships). An assignment of a security registered in the name of or assigned to a... appropriate for winding up partnership affairs. In those cases where assignments by or in behalf of all... dissolution. Upon voluntary dissolution, for any jurisdiction where a general partner may not act in winding...

14 CFR 1214.105 - Apportionment and/or assignment of services.

Code of Federal Regulations, 2011 CFR

2011-01-01

... FLIGHT General Provisions Regarding Space Shuttle Flights of Payloads for Non-U.S. Government, Reimbursable Customers § 1214.105 Apportionment and/or assignment of services. (a) Subject to NASA approval, a customer may apportion and/or assign Shuttle services to third parties within the payload. No apportionment...

14 CFR 1214.105 - Apportionment and/or assignment of services.

Code of Federal Regulations, 2012 CFR

2012-01-01

... FLIGHT General Provisions Regarding Space Shuttle Flights of Payloads for Non-U.S. Government, Reimbursable Customers § 1214.105 Apportionment and/or assignment of services. (a) Subject to NASA approval, a customer may apportion and/or assign Shuttle services to third parties within the payload. No apportionment...

14 CFR 1214.105 - Apportionment and/or assignment of services.

Code of Federal Regulations, 2013 CFR

2013-01-01

... FLIGHT General Provisions Regarding Space Shuttle Flights of Payloads for Non-U.S. Government, Reimbursable Customers § 1214.105 Apportionment and/or assignment of services. (a) Subject to NASA approval, a customer may apportion and/or assign Shuttle services to third parties within the payload. No apportionment...

47 CFR 1.948 - Assignment of authorization or transfer of control, notification of consummation.

Code of Federal Regulations, 2013 CFR

2013-10-01

... COMMISSION GENERAL PRACTICE AND PROCEDURE Grants by Random Selection Wireless Radio Services Applications and... involuntary assignment or transfer. (d) Notification of consummation. In all Wireless Radio Services... radio station in the Wireless Radio Services is assigned to another party, voluntarily or involuntarily...

47 CFR 1.948 - Assignment of authorization or transfer of control, notification of consummation.

Code of Federal Regulations, 2014 CFR

2014-10-01

... COMMISSION GENERAL PRACTICE AND PROCEDURE Grants by Random Selection Wireless Radio Services Applications and... involuntary assignment or transfer. (d) Notification of consummation. In all Wireless Radio Services... radio station in the Wireless Radio Services is assigned to another party, voluntarily or involuntarily...

47 CFR 1.948 - Assignment of authorization or transfer of control, notification of consummation.

Code of Federal Regulations, 2012 CFR

2012-10-01

... COMMISSION GENERAL PRACTICE AND PROCEDURE Grants by Random Selection Wireless Radio Services Applications and... involuntary assignment or transfer. (d) Notification of consummation. In all Wireless Radio Services... radio station in the Wireless Radio Services is assigned to another party, voluntarily or involuntarily...

Student Perceptions of Online Homework in Introductory Finance Courses

ERIC Educational Resources Information Center

Smolira, Joseph C.

2008-01-01

The author examined student perceptions concerning online homework assignments in an introductory finance class. In general, students felt that online homework was preferable to traditional homework assignments that are turned in to the instructor. In addition, students reported that the homework assignments increased their understanding of the…

48 CFR 49.108-8 - Assignment of rights under subcontracts.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Assignment of rights under subcontracts. 49.108-8 Section 49.108-8 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION CONTRACT MANAGEMENT TERMINATION OF CONTRACTS General Principles 49.108-8 Assignment of rights under...

The Eco-Sculpture Assignment: Using Art to Scaffold Metacognition

ERIC Educational Resources Information Center

Polegato, Rosemary

2014-01-01

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

20 CFR 30.15 - May EEOICPA benefits be assigned, transferred or garnished?

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 1 2010-04-01 2010-04-01 false May EEOICPA benefits be assigned, transferred or garnished? 30.15 Section 30.15 Employees' Benefits OFFICE OF WORKERS' COMPENSATION PROGRAMS... General Provisions Rights and Penalties § 30.15 May EEOICPA benefits be assigned, transferred or garnished...

An investigation of the use of temporal decomposition in space mission scheduling

NASA Technical Reports Server (NTRS)

Bullington, Stanley E.; Narayanan, Venkat

1994-01-01

This research involves an examination of techniques for solving scheduling problems in long-duration space missions. The mission timeline is broken up into several time segments, which are then scheduled incrementally. Three methods are presented for identifying the activities that are to be attempted within these segments. The first method is a mathematical model, which is presented primarily to illustrate the structure of the temporal decomposition problem. Since the mathematical model is bound to be computationally prohibitive for realistic problems, two heuristic assignment procedures are also presented. The first heuristic method is based on dispatching rules for activity selection, and the second heuristic assigns performances of a model evenly over timeline segments. These heuristics are tested using a sample Space Station mission and a Spacelab mission. The results are compared with those obtained by scheduling the missions without any problem decomposition. The applicability of this approach to large-scale mission scheduling problems is also discussed.

Parallel, Asynchronous Executive (PAX): System concepts, facilities, and architecture

NASA Technical Reports Server (NTRS)

Jones, W. H.

1983-01-01

The Parallel, Asynchronous Executive (PAX) is a software operating system simulation that allows many computers to work on a single problem at the same time. PAX is currently implemented on a UNIVAC 1100/42 computer system. Independent UNIVAC runstreams are used to simulate independent computers. Data are shared among independent UNIVAC runstreams through shared mass-storage files. PAX has achieved the following: (1) applied several computing processes simultaneously to a single, logically unified problem; (2) resolved most parallel processor conflicts by careful work assignment; (3) resolved by means of worker requests to PAX all conflicts not resolved by work assignment; (4) provided fault isolation and recovery mechanisms to meet the problems of an actual parallel, asynchronous processing machine. Additionally, one real-life problem has been constructed for the PAX environment. This is CASPER, a collection of aerodynamic and structural dynamic problem simulation routines. CASPER is not discussed in this report except to provide examples of parallel-processing techniques.

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.

LSENS, a general chemical kinetics and sensitivity analysis code for gas-phase reactions: User's guide

NASA Technical Reports Server (NTRS)

Radhakrishnan, Krishnan; Bittker, David A.

1993-01-01

A general chemical kinetics and sensitivity analysis code for complex, homogeneous, gas-phase reactions is described. The main features of the code, LSENS, are its flexibility, efficiency and convenience in treating many different chemical reaction models. The models include static system, steady, one-dimensional, inviscid flow, shock initiated reaction, and a perfectly stirred reactor. In addition, equilibrium computations can be performed for several assigned states. An implicit numerical integration method, which works efficiently for the extremes of very fast and very slow reaction, is used for solving the 'stiff' differential equation systems that arise in chemical kinetics. For static reactions, sensitivity coefficients of all dependent variables and their temporal derivatives with respect to the initial values of dependent variables and/or the rate coefficient parameters can be computed. This paper presents descriptions of the code and its usage, and includes several illustrative example 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.

Ecologically-Based Family Therapy Outcome with Substance Abusing Runaway Adolescents

PubMed Central

Slesnick, Natasha; Prestopnik, Jillian L.

2007-01-01

Runaway youth report a broader range and higher severity of substance-related, mental health and family problems relative to non-runaway youth. Most studies to date have collected self-report data on the family and social history; virtually no research has examined treatment effectiveness with this population. This study is a treatment development project in which 124 runaway youth were randomly assigned to 1) Ecologically-Based Family Therapy (EBFT) or 2) Service as Usual (SAU) through a shelter. Youth completed an intake, posttreatment, 6 and 12 month follow-up assessment. Youth assigned to EBFT reported greater reductions in overall substance abuse compared to youth assigned to SAU while other problem areas improved in both conditions. Findings suggest that EBFT is an efficacious intervention for this relatively severe population of youth. PMID:15878048

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…

Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network

DTIC Science & Technology

2015-12-24

minimizing a weighted sum ofthe time and control effort needed to collect sensor data. This problem formulation is a modified traveling salesman ...29 2.5 The Shortest Path Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 2.5.1 Traveling Salesman Problem ...48 3.3.1 Initial Guess by Traveling Salesman Problem Solution

American Viticultural Areas: A Problem in Regional Geography.

ERIC Educational Resources Information Center

Macdonald, Gerald M.; Lemaire, Denyse

1995-01-01

Maintains that growing grapes for winemaking has increased dramatically in the United States. Describes a college class assignment in which students analyzed climate and soil type to identify appropriate viticulture areas. Reports high student interest in the assignment and includes four figures illustrating the approach. (CFR)

Lions and Tigers and Bears, Oh My! Children's Conceptions of Forests and Their Inhabitants.

ERIC Educational Resources Information Center

Strommen, Erik

1995-01-01

Interviewed first-grade children (n=40) about forests and living things found in them. Reports that children generally assigned most forest-dwellers to the forests, but also tended to assign almost all other animals, especially carnivores, to the forest as well. Results indicate a general lack of awareness of plant life, insects, water resources,…

Does Empathy Predict Instructional Assignment-Related Stress? A Study in Special and General Education Teachers

ERIC Educational Resources Information Center

Platsidou, Maria; Agaliotis, Ioannis

2017-01-01

The role of empathy in the teaching profession has been vastly investigated in relation to its effect on students, but research on how teachers' empathy affects their own well-being at work is limited. This study investigated empathy and instructional assignment-related stress factors of primary school teachers serving in general or special…

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.

A binary linear programming formulation of the graph edit distance.

PubMed

Justice, Derek; Hero, Alfred

2006-08-01

A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. The new metric is shown to perform quite well in comparison to existing metrics when applied to a database of chemical graphs.

Motion Planning and Task Assignment for Unmanned Aerial Vehicles Cooperating with Unattended Ground Sensors

DTIC Science & Technology

2014-10-24

problem was formalized as the Dubins travelling salesman problem (TSP). In the second phase of the research we have...given constraints on its motion. This problem was formalized as the Dubins travelling salesman problem (TSP). The contributions of the study in the... problem was formalized as the Dubins travelling salesman problem (TSP). The Dubins Travelling Salesperson Problem (DTSP) and its variants [8, 12,

A Computer-Assisted Personalized Approach in an Undergraduate Plant Physiology Class1

PubMed Central

Artus, Nancy N.; Nadler, Kenneth D.

1999-01-01

We used Computer-Assisted Personalized Approach (CAPA), a networked teaching and learning tool that generates computer individualized homework problem sets, in our large-enrollment introductory plant physiology course. We saw significant improvement in student examination performance with regular homework assignments, with CAPA being an effective and efficient substitute for hand-graded homework. Using CAPA, each student received a printed set of similar but individualized problems of a conceptual (qualitative) and/or quantitative nature with quality graphics. Because each set of problems is unique, students were encouraged to work together to clarify concepts but were required to do their own work for credit. Students could enter answers multiple times without penalty, and they were able to obtain immediate feedback and hints until the due date. These features increased student time on task, allowing higher course standards and student achievement in a diverse student population. CAPA handles routine tasks such as grading, recording, summarizing, and posting grades. In anonymous surveys, students indicated an overwhelming preference for homework in CAPA format, citing several features such as immediate feedback, multiple tries, and on-line accessibility as reasons for their preference. We wrote and used more than 170 problems on 17 topics in introductory plant physiology, cataloging them in a computer library for general access. Representative problems are compared and discussed. PMID:10198076

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.

NASA Astrophysics Data System (ADS)

2018-05-01

Eigenvalues and eigenvectors, together, constitute the eigenstructure of the system. The design of vibrating systems aimed at satisfying specifications on eigenvalues and eigenvectors, which is commonly known as eigenstructure assignment, has drawn increasing interest over the recent years. The most natural mathematical framework for such problems is constituted by the inverse eigenproblems, which consist in the determination of the system model that features a desired set of eigenvalues and eigenvectors. Although such a problem is intrinsically challenging, several solutions have been proposed in the literature. The approaches to eigenstructure assignment can be basically divided into passive control and active control.

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.

Computational approaches to protein inference in shotgun proteomics

PubMed Central

2012-01-01

Shotgun proteomics has recently emerged as a powerful approach to characterizing proteomes in biological samples. Its overall objective is to identify the form and quantity of each protein in a high-throughput manner by coupling liquid chromatography with tandem mass spectrometry. As a consequence of its high throughput nature, shotgun proteomics faces challenges with respect to the analysis and interpretation of experimental data. Among such challenges, the identification of proteins present in a sample has been recognized as an important computational task. This task generally consists of (1) assigning experimental tandem mass spectra to peptides derived from a protein database, and (2) mapping assigned peptides to proteins and quantifying the confidence of identified proteins. Protein identification is fundamentally a statistical inference problem with a number of methods proposed to address its challenges. In this review we categorize current approaches into rule-based, combinatorial optimization and probabilistic inference techniques, and present them using integer programing and Bayesian inference frameworks. We also discuss the main challenges of protein identification and propose potential solutions with the goal of spurring innovative research in this area. PMID:23176300

Assessing the Impacts of a Hybrid ``Flipped'' Approach to University Physics.

NASA Astrophysics Data System (ADS)

Hughes, Chris; Paulson, Scott

2015-03-01

Over the course of several years, the physics faculty at James Madison University has been gradually reforming the introductory calculus-based physics sequence to a hybrid model using a ``flipped classroom'' approach. The content traditionally delivered during lecture was divided into approximately 150 short (5-10 minute) videos. For homework, students are assigned 3-5 videos to watch before each class session. These assignments are combined with in-class activities including gouger problem solving and the tutorials developed by the University of Washington group to provide the students with focused guidance on concepts and skills that students traditionally have left our classes not having mastered. For the fall semester course on mechanics, the Force Concept Inventory (FCI) was used to evaluate student outcomes. For the spring semester course on E&M and optics, the Conceptual Survey of Electricity and Magnetism (CSEM) was used. Student reaction to the course structure was generally positive though there were some complaints in the student evaluations at the end of each semester. However, a positive impact on student outcomes was observed based on the Hake gains on the FCI.

More reliable inference for the dissimilarity index of segregation

PubMed Central

Allen, Rebecca; Burgess, Simon; Davidson, Russell; Windmeijer, Frank

2015-01-01

Summary The most widely used measure of segregation is the so‐called dissimilarity index. It is now well understood that this measure also reflects randomness in the allocation of individuals to units (i.e. it measures deviations from evenness, not deviations from randomness). This leads to potentially large values of the segregation index when unit sizes and/or minority proportions are small, even if there is no underlying systematic segregation. Our response to this is to produce adjustments to the index, based on an underlying statistical model. We specify the assignment problem in a very general way, with differences in conditional assignment probabilities underlying the resulting segregation. From this, we derive a likelihood ratio test for the presence of any systematic segregation, and bias adjustments to the dissimilarity index. We further develop the asymptotic distribution theory for testing hypotheses concerning the magnitude of the segregation index and show that the use of bootstrap methods can improve the size and power properties of test procedures considerably. We illustrate these methods by comparing dissimilarity indices across school districts in England to measure social segregation. PMID:27774035

Complete virilization in congenital adrenal hyperplasia: clinical course, medical management and disease-related complications.

PubMed

Woelfle, J; Hoepffner, W; Sippell, W G; Brämswig, J H; Heidemann, P; Deiss, D; Bökenkamp, A; Roth, C; Irle, U; Wollmann, H A; Zachmann, M; Kubini, K; Albers, N

2002-02-01

In girls with congenital adrenal hyperplasia (CAH), genital ambiguity usually leads to a rapid neonatal diagnosis. Rarely, CAH causes complete virilization and male sex assignment with a delayed diagnosis. After being confronted with very specific problems in two of such patients, we collected data of patients with CAH and complete virilization in a nationwide study to delineate specific problems of these rare patients in order to improve their management. Through the German Working Group of Paediatric Endocrinology (Arbeitsgemeinschaft Pädiatrische Endokrinologie, APE), questionnaires were sent to all members caring for patients with CAH and complete virilization in their endocrine clinics. Data from 16 patients from 10 paediatric endocrine centres were assessed by questionnaire. The following problems have been encountered. (1) Sex assignment/gender identity: initially all patients had a male sex assignment. Six patients were diagnosed during the first month of life. Five were reassigned to female sex immediately, one at the age of 19 months. Except in one girl demonstrating some tomboyish behaviour, gender role behaviour in these patients did not differ from unaffected girls. Ten patients were diagnosed late at 3.4--7 years of age. In seven patients with a late diagnosis, male sex assignment was maintained; one of them expressed some concerns about living as a male. In three patients late sex reversal was performed, gender identity is very poor in one and new sex assignment is currently under consideration. (2) SURGERY: irrespective of the sex assigned, all patients had between one and three surgical procedures, including clitoris reduction and (repeated) vaginoplasties in patients with female sex assignment. Hysterectomy and ovarectomy were performed in patients with male sex assignment. (3) Short stature: patients with a late diagnosis of CAH had extremely advanced bone ages of +6.3 to +9.5 years, leading to severely reduced final height of 137 to 150 cm in adult patients. Patients tended to follow height percentiles of genetic females. One pubertal patient was suicidal due to short stature. (4) Central precocious puberty (CPP): prolonged exposition to adrenal androgens led to CPP in one patient. He was treated with GnRH analogues until gonadectomy. Patients with CAH and complete virilization have a high risk of being diagnosed late. There are major problems and uncertainties of the patients' families and the treating physicians concerning gender assignment. Gender identity is disturbed in some patients. In addition, multiple surgical procedures are necessary and short stature as well as central precocious puberty might be important to avoid late sequelae. While some surgical interventions are probably unavoidable, most of these issues could be resolved with an early diagnosis. Thus, especially for these patients, a neonatal screening programme for CAH would be of paramount importance.

46 CFR 147.8 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 5 2011-10-01 2011-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 147.8 Section 147.8 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DANGEROUS CARGOES HAZARDOUS SHIPS' STORES General Provisions § 147.8 OMB control numbers assigned pursuant...

46 CFR 147.8 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 5 2013-10-01 2013-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 147.8 Section 147.8 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DANGEROUS CARGOES HAZARDOUS SHIPS' STORES General Provisions § 147.8 OMB control numbers assigned pursuant...

46 CFR 147.8 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 5 2012-10-01 2012-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 147.8 Section 147.8 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DANGEROUS CARGOES HAZARDOUS SHIPS' STORES General Provisions § 147.8 OMB control numbers assigned pursuant...

46 CFR 147.8 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 5 2014-10-01 2014-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 147.8 Section 147.8 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DANGEROUS CARGOES HAZARDOUS SHIPS' STORES General Provisions § 147.8 OMB control numbers assigned pursuant...

46 CFR 147.8 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 5 2010-10-01 2010-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 147.8 Section 147.8 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) DANGEROUS CARGOES HAZARDOUS SHIPS' STORES General Provisions § 147.8 OMB control numbers assigned pursuant...

46 CFR 107.05 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 4 2014-10-01 2014-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 107.05 Section 107.05 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) A-MOBILE OFFSHORE DRILLING UNITS INSPECTION AND CERTIFICATION General § 107.05 OMB control numbers assigned...

46 CFR 107.05 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 4 2012-10-01 2012-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 107.05 Section 107.05 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) A-MOBILE OFFSHORE DRILLING UNITS INSPECTION AND CERTIFICATION General § 107.05 OMB control numbers assigned...

46 CFR 107.05 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 4 2011-10-01 2011-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 107.05 Section 107.05 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) A-MOBILE OFFSHORE DRILLING UNITS INSPECTION AND CERTIFICATION General § 107.05 OMB control numbers assigned...

46 CFR 107.05 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 4 2013-10-01 2013-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 107.05 Section 107.05 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) A-MOBILE OFFSHORE DRILLING UNITS INSPECTION AND CERTIFICATION General § 107.05 OMB control numbers assigned...

46 CFR 107.05 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 107.05 Section 107.05 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) A-MOBILE OFFSHORE DRILLING UNITS INSPECTION AND CERTIFICATION General § 107.05 OMB control numbers assigned...

20 CFR 422.104 - Who can be assigned a social security number.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 20 Employees' Benefits 2 2011-04-01 2011-04-01 false Who can be assigned a social security number. 422.104 Section 422.104 Employees' Benefits SOCIAL SECURITY ADMINISTRATION ORGANIZATION AND PROCEDURES General Procedures § 422.104 Who can be assigned a social security number. (a) Persons eligible for SSN...

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

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…

14 CFR § 1214.105 - Apportionment and/or assignment of services.

Code of Federal Regulations, 2014 CFR

2014-01-01

... SPACE FLIGHT General Provisions Regarding Space Shuttle Flights of Payloads for Non-U.S. Government, Reimbursable Customers § 1214.105 Apportionment and/or assignment of services. (a) Subject to NASA approval, a customer may apportion and/or assign Shuttle services to third parties within the payload. No apportionment...

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

ERIC Educational Resources Information Center

Carette, Bernd; Anseel, Frederik; Lievens, Filip

2013-01-01

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

20 CFR 422.104 - Who can be assigned a social security number.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 20 Employees' Benefits 2 2012-04-01 2012-04-01 false Who can be assigned a social security number. 422.104 Section 422.104 Employees' Benefits SOCIAL SECURITY ADMINISTRATION ORGANIZATION AND PROCEDURES General Procedures § 422.104 Who can be assigned a social security number. (a) Persons eligible for SSN...

20 CFR 422.104 - Who can be assigned a social security number.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 20 Employees' Benefits 2 2014-04-01 2014-04-01 false Who can be assigned a social security number. 422.104 Section 422.104 Employees' Benefits SOCIAL SECURITY ADMINISTRATION ORGANIZATION AND PROCEDURES General Procedures § 422.104 Who can be assigned a social security number. (a) Persons eligible for SSN...

20 CFR 422.104 - Who can be assigned a social security number.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 20 Employees' Benefits 2 2013-04-01 2013-04-01 false Who can be assigned a social security number. 422.104 Section 422.104 Employees' Benefits SOCIAL SECURITY ADMINISTRATION ORGANIZATION AND PROCEDURES General Procedures § 422.104 Who can be assigned a social security number. (a) Persons eligible for SSN...

20 CFR 422.104 - Who can be assigned a social security number.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Who can be assigned a social security number. 422.104 Section 422.104 Employees' Benefits SOCIAL SECURITY ADMINISTRATION ORGANIZATION AND PROCEDURES General Procedures § 422.104 Who can be assigned a social security number. (a) Persons eligible for SSN...

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

Do emergency medical services dispatch nature and severity codes agree with paramedic field findings?

PubMed

Neely, K W; Eldurkar, J A; Drake, M E

2000-02-01

Emergency medical services (EMS) systems increasingly seek to triage patients to alternative EMS resources. Emergency medical services dispatchers may be asked to perform this triage. New protocols may be necessary. Alternatively, existing protocols may be sufficient for this task. For an existing dispatch protocol to be sufficient, it at least must accurately categorize patient condition and severity based on an external standard. To examine the extent to which nature codes (NCs), or patient condition codes, and severity codes (SCs) currently assigned in one urban 911 center agree with paramedic field findings. The null hypothesis was that there is no routine agreement (75%) between dispatcher-assigned NC or SC and paramedic-assigned NC or SC for the same patient using the same protocol. Emergency medical services dispatch nature and severity code data and matching out-of-hospital data were prospectively gathered over six months. Dispatch data included the NC: caller-identified problem, and the SC: dispatcher-assessed severity. Each NC is modified by one of three SCs (1, 3, or 9): 1 is emergent, 3 is urgent, and 9 is neither. Paramedics verified and/or corrected dispatcher-assigned NCs and SCs using the same dispatch protocol. One thousand forty usable cases fell into 33 unique NC/SC combinations. The designation of SC 1 was assigned 275 times, SC 3 was assigned 736 times, and SC 9 was assigned 24 times. The SC was missing five times. The overall NC agreement was 0.70 (95% CI = 0.697 to 0.703). The overall SC agreement was 0.65 (95% CI = 0.645 to 0.655). The NC agreement exceeded 75% for ten (59%) NC/SC combinations. The SC agreement exceeded 75% for five (29%) NC/SC combinations. There was both NC and SC agreement for four (24%) combinations: urgent breathing problems, urgent diabetic problems, urgent falls, and urgent overdoses. The greatest NC/SC disagreement occurred within emergent and urgent traffic crashes. Paramedics adjusted SC toward lower severity 29% of the time and toward higher severity 5.4% of the time. There was no upward SC adjustment for eight (47%) combinations. Certain dispatcher-assigned NC and SC codes and NC/SC combinations achieved the study threshold. Overall agreement failed to achieve the threshold. The lowest SC level was rarely assigned, preventing a meaningful analysis of all severity levels.

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Three geographic decomposition approaches in transportation network analysis

DOT National Transportation Integrated Search

1980-03-01

This document describes the results of research into the application of geographic decomposition techniques to practical transportation network problems. Three approaches are described for the solution of the traffic assignment problem. One approach ...

Application of Decomposition to Transportation Network Analysis

DOT National Transportation Integrated Search

1976-10-01

This document reports preliminary results of five potential applications of the decomposition techniques from mathematical programming to transportation network problems. The five application areas are (1) the traffic assignment problem with fixed de...

Accelerated Math®. Primary Mathematics. What Works Clearinghouse Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2017

2017-01-01

"Accelerated Math®," published by Renaissance Learning, is a software tool that provides practice problems for students in grades K-12 and provides teachers with reports to monitor student progress. "Accelerated Math®" creates individualized student assignments, scores the assignments, and generates reports on student progress.…

(Explain It) x 3

ERIC Educational Resources Information Center

McGuire, Linda

2014-01-01

This article will describe a writing assignment designed for use in a liberal arts college whose mission stresses effective written communication both within and across disciplines. In this assignment, students write three separate solutions to the same mathematics problem: one for a mathematical peer, a second for a contemporary that does not…

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…

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…

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…

Distributed Collaborative Homework Activities in a Problem-Based Usability Engineering Course

ERIC Educational Resources Information Center

Carroll, John M.; Jiang, Hao; Borge, Marcela

2015-01-01

Teams of students in an upper-division undergraduate Usability Engineering course used a collaborative environment to carry out a series of three distributed collaborative homework assignments. Assignments were case-based analyses structured using a jigsaw design; students were provided a collaborative software environment and introduced to a…

Increasing Student-Learning Team Effectiveness with Team Charters

ERIC Educational Resources Information Center

Hunsaker, Phillip; Pavett, Cynthia; Hunsaker, Johanna

2011-01-01

Because teams are a ubiquitous part of most organizations today, it is common for business educators to use team assignments to help students experientially learn about course concepts and team process. Unfortunately, students frequently experience a number of problems during team assignments. The authors describe the results of their research and…

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…

38 CFR 21.198 - “Discontinued” status.

Code of Federal Regulations, 2011 CFR

2011-07-01

... personal or other problems; or (ii) Inability of the veteran to benefit from rehabilitation services... of entitlement. (4) Medical and related problems. A veteran's case will be discontinued and assigned... program because of a serious physical or emotional problem for an extended period; and (ii) VA medical...

38 CFR 21.198 - “Discontinued” status.

Code of Federal Regulations, 2010 CFR

2010-07-01

... personal or other problems; or (ii) Inability of the veteran to benefit from rehabilitation services... of entitlement. (4) Medical and related problems. A veteran's case will be discontinued and assigned... program because of a serious physical or emotional problem for an extended period; and (ii) VA medical...

Efficacy of an internet-based problem-solving training for teachers: results of a randomized controlled trial.

PubMed

Ebert, David Daniel; Lehr, Dirk; Boß, Leif; Riper, Heleen; Cuijpers, Pim; Andersson, Gerhard; Thiart, Hanne; Heber, Elena; Berking, Matthias

2014-11-01

The primary purpose of this randomized controlled trial (RCT) was to evaluate the efficacy of internet-based problem-solving training (iPST) for employees in the educational sector (teachers) with depressive symptoms. The results of training were compared to those of a waitlist control group (WLC). One-hundred and fifty teachers with elevated depressive symptoms (Center for Epidemiologic Studies Depression Scale, CES-D ≥16) were assigned to either the iPST or WLC group. The iPST consisted of five lessons, including problem-solving and rumination techniques. Symptoms were assessed before the intervention began and in follow-up assessments after seven weeks, three months, and six months. The primary outcome was depressive symptom severity (CES-D). Secondary outcomes included general and work-specific self-efficacy, perceived stress, pathological worries, burnout symptoms, general physical and mental health, and absenteeism. iPST participants displayed a significantly greater reduction in depressive symptoms after the intervention (d=0.59, 95% CI 0.26-0.92), after three months (d=0.37, 95% CI 0.05-0.70) and after six months (d=0.38, 95% CI 0.05-0.70) compared to the control group. The iPST participants also displayed significantly higher improvements in secondary outcomes. However, workplace absenteeism was not significantly affected. iPST is effective in reducing symptoms of depression among teachers. Disseminated on a large scale, iPST could contribute to reducing the burden of stress-related mental health problems among teachers. Future studies should evaluate iPST approaches for use in other working populations.

Medical decision making: guide to improved CPT coding.

PubMed

Holt, Jim; Warsy, Ambreen; Wright, Paula

2010-04-01

The Current Procedural Terminology (CPT) coding system for office visits, which has been in use since 1995, has not been well studied, but it is generally agreed that the system contains much room for error. In fact, the available literature suggests that only slightly more than half of physicians will agree on the same CPT code for a given visit, and only 60% of professional coders will agree on the same code for a particular visit. In addition, the criteria used to assign a code are often related to the amount of written documentation. The goal of this study was to evaluate two novel methods to assess if the most appropriate CPT code is used: the level of medical decision making, or the sum of all problems mentioned by the patient during the visit. The authors-a professional coder, a residency faculty member, and a PGY-3 family medicine resident-reviewed 351 randomly selected visit notes from two residency programs in the Northeast Tennessee region for the level of documentation, the level of medical decision making, and the total number of problems addressed. The authors assigned appropriate CPT codes at each of those three levels. Substantial undercoding occurred at each of the three levels. Approximately 33% of visits were undercoded based on the written documentation. Approximately 50% of the visits were undercoded based on the level of documented medical decision making. Approximately 80% of the visits were undercoded based on the total number of problems which the patient presented during the visit. Interrater agreement was fair, and similar to that noted in other coding studies. Undercoding is not only common in a family medicine residency program but it also occurs at levels that would not be evident from a simple audit of the documentation on the visit note. Undercoding also occurs from not exploring problems mentioned by the patient and not documenting additional work that was performed. Family physicians may benefit from minor alterations in their documentation of office visit notes.

5 CFR Appendix B to 5 Cfr Chapter... - Memorandum Describing the Authority and Assigned Responsibilities of the General Counsel of the...

Code of Federal Regulations, 2013 CFR

2013-01-01

... Assigned Responsibilities of the General Counsel of the Federal Labor Relations Authority B Appendix B to 5... FEDERAL LABOR RELATIONS AUTHORITY AND FEDERAL SERVICE IMPASSES PANEL Ch. XIV, App. B Appendix B to 5 CFR... chapter, (B) file and prosecute complaints under this chapter, and (C) exercise such other powers of the...

5 CFR Appendix B to 5 Cfr Chapter... - Memorandum Describing the Authority and Assigned Responsibilities of the General Counsel of the...

Code of Federal Regulations, 2014 CFR

2014-01-01

... Assigned Responsibilities of the General Counsel of the Federal Labor Relations Authority B Appendix B to 5... FEDERAL LABOR RELATIONS AUTHORITY AND FEDERAL SERVICE IMPASSES PANEL Ch. XIV, App. B Appendix B to 5 CFR... chapter, (B) file and prosecute complaints under this chapter, and (C) exercise such other powers of the...

5 CFR Appendix B to 5 Cfr Chapter... - Memorandum Describing the Authority and Assigned Responsibilities of the General Counsel of the...

Code of Federal Regulations, 2012 CFR

2012-01-01

... Assigned Responsibilities of the General Counsel of the Federal Labor Relations Authority B Appendix B to 5... FEDERAL LABOR RELATIONS AUTHORITY AND FEDERAL SERVICE IMPASSES PANEL Ch. XIV, App. B Appendix B to 5 CFR... chapter, (B) file and prosecute complaints under this chapter, and (C) exercise such other powers of the...

5 CFR Appendix B to 5 Cfr Chapter... - Memorandum Describing the Authority and Assigned Responsibilities of the General Counsel of the...

Code of Federal Regulations, 2011 CFR

2011-01-01

... Assigned Responsibilities of the General Counsel of the Federal Labor Relations Authority B Appendix B to 5... FEDERAL LABOR RELATIONS AUTHORITY AND FEDERAL SERVICE IMPASSES PANEL Ch. XIV, App. B Appendix B to 5 CFR... chapter, (B) file and prosecute complaints under this chapter, and (C) exercise such other powers of the...

Examining the Preparatory Effects of Problem Generation and Solution Generation on Learning from Instruction

ERIC Educational Resources Information Center

Kapur, Manu

2018-01-01

The goal of this paper is to isolate the preparatory effects of problem-generation from solution generation in problem-posing contexts, and their underlying mechanisms on learning from instruction. Using a randomized-controlled design, students were assigned to one of two conditions: (a) problem-posing with solution generation, where they…

Introduction of a Population Balance Based Design Problem in a Particle Science and Technology Course for Chemical Engineers

ERIC Educational Resources Information Center

Ehrman, Sheryl H.; Castellanos, Patricia; Dwivedi, Vivek; Diemer, R. Bertrum

2007-01-01

A particle technology design problem incorporating population balance modeling was developed and assigned to senior and first-year graduate students in a Particle Science and Technology course. The problem focused on particle collection, with a pipeline agglomerator, Cyclone, and baghouse comprising the collection system. The problem was developed…

Investigating the Effect of Complexity Factors in Stoichiometry Problems Using Logistic Regression and Eye Tracking

ERIC Educational Resources Information Center

Tang, Hui; Kirk, John; Pienta, Norbert J.

2014-01-01

This paper includes two experiments, one investigating complexity factors in stoichiometry word problems, and the other identifying students' problem-solving protocols by using eye-tracking technology. The word problems used in this study had five different complexity factors, which were randomly assigned by a Web-based tool that we developed. The…

Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

DTIC Science & Technology

2015-09-03

Traveling Salesman Problem (TSP) and Graph Coloring are elementary. Problems such as MAX-kSAT are a superposition of k elementary landscapes. This...search space. Problems such as the Traveling Salesman Problem (TSP), Graph Coloring, the Frequency Assignment Problem , as well as Min-Cut and Max-Cut...echoing our earlier esults on the Traveling Salesman Problem . Using two locally optimal solutions as “parent” solutions, we have developed a

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

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

NASA Astrophysics Data System (ADS)

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

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

How did you guess? Or, what do multiple-choice questions measure?

PubMed

Cox, K R

1976-06-05

Multiple-choice questions classified as requiring problem-solving skills have been interpreted as measuring problem-solving skills within students, with the implicit hypothesis that questions needing an increasingly complex intellectual process should present increasing difficulty to the student. This hypothesis was tested in a 150-question paper taken by 721 students in seven Australian medical schools. No correlation was observed between difficulty and assigned process. Consequently, the question-answering process was explored with a group of final-year students. Anecdotal recall by students gave heavy weight to knowledge rather than problem solving in answering these questions. Assignment of the 150 questions to the classification by three teachers and six students showed their congruence to be a little above random probability.

46 CFR 110.01-2 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 4 2011-10-01 2011-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 110.01-2 Section 110.01-2 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) ELECTRICAL ENGINEERING GENERAL PROVISIONS Applicability § 110.01-2 OMB control numbers assigned pursuant to...

46 CFR 110.01-2 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 110.01-2 Section 110.01-2 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) ELECTRICAL ENGINEERING GENERAL PROVISIONS Applicability § 110.01-2 OMB control numbers assigned pursuant to...

46 CFR 110.01-2 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 4 2014-10-01 2014-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 110.01-2 Section 110.01-2 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) ELECTRICAL ENGINEERING GENERAL PROVISIONS Applicability § 110.01-2 OMB control numbers assigned pursuant to...

41 CFR 102-79.10 - What basic assignment and utilization of space policy governs an Executive agency?

Code of Federal Regulations, 2011 CFR

2011-01-01

... and utilization of space policy governs an Executive agency? 102-79.10 Section 102-79.10 Public... MANAGEMENT REGULATION REAL PROPERTY 79-ASSIGNMENT AND UTILIZATION OF SPACE General Provisions § 102-79.10 What basic assignment and utilization of space policy governs an Executive agency? Executive agencies...

41 CFR 102-79.10 - What basic assignment and utilization of space policy governs an Executive agency?

Code of Federal Regulations, 2012 CFR

2012-01-01

... and utilization of space policy governs an Executive agency? 102-79.10 Section 102-79.10 Public... MANAGEMENT REGULATION REAL PROPERTY 79-ASSIGNMENT AND UTILIZATION OF SPACE General Provisions § 102-79.10 What basic assignment and utilization of space policy governs an Executive agency? Executive agencies...

41 CFR 102-79.10 - What basic assignment and utilization of space policy governs an Executive agency?

Code of Federal Regulations, 2014 CFR

2014-01-01

... and utilization of space policy governs an Executive agency? 102-79.10 Section 102-79.10 Public... MANAGEMENT REGULATION REAL PROPERTY 79-ASSIGNMENT AND UTILIZATION OF SPACE General Provisions § 102-79.10 What basic assignment and utilization of space policy governs an Executive agency? Executive agencies...

41 CFR 102-79.10 - What basic assignment and utilization of space policy governs an Executive agency?

Code of Federal Regulations, 2013 CFR

2013-07-01

... and utilization of space policy governs an Executive agency? 102-79.10 Section 102-79.10 Public... MANAGEMENT REGULATION REAL PROPERTY 79-ASSIGNMENT AND UTILIZATION OF SPACE General Provisions § 102-79.10 What basic assignment and utilization of space policy governs an Executive agency? Executive agencies...

Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing

NASA Astrophysics Data System (ADS)

Matsumoto, Ryutaroh

The multiple assignment scheme is to assign one or more shares to single participant so that any kind of access structure can be realized by classical secret sharing schemes. We propose its quantum version including ramp secret sharing schemes. Then we propose an integer optimization approach to minimize the average share size.

46 CFR 188.01-15 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 7 2012-10-01 2012-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 188.01-15 Section 188.01-15 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OCEANOGRAPHIC RESEARCH VESSELS GENERAL PROVISIONS Authority and Purpose § 188.01-15 OMB control numbers assigned...

46 CFR 188.01-15 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 7 2014-10-01 2014-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 188.01-15 Section 188.01-15 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OCEANOGRAPHIC RESEARCH VESSELS GENERAL PROVISIONS Authority and Purpose § 188.01-15 OMB control numbers assigned...

46 CFR 188.01-15 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 7 2011-10-01 2011-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 188.01-15 Section 188.01-15 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OCEANOGRAPHIC RESEARCH VESSELS GENERAL PROVISIONS Authority and Purpose § 188.01-15 OMB control numbers assigned...

46 CFR 188.01-15 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 7 2013-10-01 2013-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 188.01-15 Section 188.01-15 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OCEANOGRAPHIC RESEARCH VESSELS GENERAL PROVISIONS Authority and Purpose § 188.01-15 OMB control numbers assigned...

46 CFR 188.01-15 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 7 2010-10-01 2010-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 188.01-15 Section 188.01-15 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OCEANOGRAPHIC RESEARCH VESSELS GENERAL PROVISIONS Authority and Purpose § 188.01-15 OMB control numbers assigned...

46 CFR 110.01-2 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 4 2013-10-01 2013-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 110.01-2 Section 110.01-2 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) ELECTRICAL ENGINEERING GENERAL PROVISIONS Applicability § 110.01-2 OMB control numbers assigned pursuant to...

46 CFR 110.01-2 - OMB control numbers assigned pursuant to the Paperwork Reduction Act.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 4 2012-10-01 2012-10-01 false OMB control numbers assigned pursuant to the Paperwork Reduction Act. 110.01-2 Section 110.01-2 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) ELECTRICAL ENGINEERING GENERAL PROVISIONS Applicability § 110.01-2 OMB control numbers assigned pursuant to...

41 CFR 101-25.202 - Factors to be used to determine assignment of purchase responsibility.

Code of Federal Regulations, 2010 CFR

2010-07-01

... experience of agency purchasing and contracting officials and their operating units with due regard to... determine assignment of purchase responsibility. 101-25.202 Section 101-25.202 Public Contracts and Property... PROCUREMENT 25-GENERAL 25.2-Interagency Purchase Assignments § 101-25.202 Factors to be used to determine...

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.

Maximization of Learning Speed Due to Neuronal Redundancy in Reinforcement Learning

NASA Astrophysics Data System (ADS)

Takiyama, Ken

2016-11-01

Adaptable neural activity contributes to the flexibility of human behavior, which is optimized in situations such as motor learning and decision making. Although learning signals in motor learning and decision making are low-dimensional, neural activity, which is very high dimensional, must be modified to achieve optimal performance based on the low-dimensional signal, resulting in a severe credit-assignment problem. Despite this problem, the human brain contains a vast number of neurons, leaving an open question: what is the functional significance of the huge number of neurons? Here, I address this question by analyzing a redundant neural network with a reinforcement-learning algorithm in which the numbers of neurons and output units are N and M, respectively. Because many combinations of neural activity can generate the same output under the condition of N ≫ M, I refer to the index N - M as neuronal redundancy. Although greater neuronal redundancy makes the credit-assignment problem more severe, I demonstrate that a greater degree of neuronal redundancy facilitates learning speed. Thus, in an apparent contradiction of the credit-assignment problem, I propose the hypothesis that a functional role of a huge number of neurons or a huge degree of neuronal redundancy is to facilitate learning speed.

From Rags to Riches

ERIC Educational Resources Information Center

Sweet, Colleen

2008-01-01

In this article, the author presents the "Rags to Riches" design project she introduced to her students. She assigned each of her students one item from an array to thrift store goods which included old scarves, sweaters, jackets, and even evening gowns. The design problem was to imagine what a clothing tag might look like if the assigned item…

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…

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…

Turnaround Time and Market Capacity in Contract Cheating

ERIC Educational Resources Information Center

Wallace, Melisa J.; Newton, Philip M.

2014-01-01

Contract cheating is the process whereby students auction off the opportunity for others to complete assignments for them. It is an apparently widespread yet under-researched problem. One suggested strategy to prevent contract cheating is to shorten the turnaround time between the release of assignment details and the submission date, thus making…

"Yes, a T-Shirt!": Assessing Visual Composition in the "Writing" Class

ERIC Educational Resources Information Center

Odell, Lee; Katz, Susan M.

2009-01-01

Computer technology is expanding our profession's conception of composing, allowing visual information to play a substantial role in an increasing variety of composition assignments. This expansion, however, creates a major problem: How does one assess student work on these assignments? Current work in assessment provides only partial answers to…

Survival without disability to age 5 years after neonatal caffeine therapy for apnea of prematurity.

PubMed

Schmidt, Barbara; Anderson, Peter J; Doyle, Lex W; Dewey, Deborah; Grunau, Ruth E; Asztalos, Elizabeth V; Davis, Peter G; Tin, Win; Moddemann, Diane; Solimano, Alfonso; Ohlsson, Arne; Barrington, Keith J; Roberts, Robin S

2012-01-18

Very preterm infants are prone to apnea and have an increased risk of death or disability. Caffeine therapy for apnea of prematurity reduces the rates of cerebral palsy and cognitive delay at 18 months of age. To determine whether neonatal caffeine therapy has lasting benefits or newly apparent risks at early school age. Five-year follow-up from 2005 to 2011 in 31 of 35 academic hospitals in Canada, Australia, Europe, and Israel, where 1932 of 2006 participants (96.3%) had been enrolled in the randomized, placebo-controlled Caffeine for Apnea of Prematurity trial between 1999 and 2004. A total of 1640 children (84.9%) with birth weights of 500 to 1250 g had adequate data for the main outcome at 5 years. Combined outcome of death or survival to 5 years with 1 or more of motor impairment (defined as a Gross Motor Function Classification System level of 3 to 5), cognitive impairment (defined as a Full Scale IQ<70), behavior problems, poor general health, deafness, and blindness. The combined outcome of death or disability was not significantly different for the 833 children assigned to caffeine from that for the 807 children assigned to placebo (21.1% vs 24.8%; odds ratio adjusted for center, 0.82; 95% CI, 0.65-1.03; P = .09). The rates of death, motor impairment, behavior problems, poor general health, deafness, and blindness did not differ significantly between the 2 groups. The incidence of cognitive impairment was lower at 5 years than at 18 months and similar in the 2 groups (4.9% vs 5.1%; odds ratio adjusted for center, 0.97; 95% CI, 0.61-1.55; P = .89). Neonatal caffeine therapy was no longer associated with a significantly improved rate of survival without disability in children with very low birth weights who were assessed at 5 years.

Generalized characteristic ratios assignment for commensurate fractional order systems with one zero.

PubMed

Tabatabaei, Mohammad

2017-07-01

In this paper, a new method for determination of the desired characteristic equation and zero location of commensurate fractional order systems is presented. The concept of the characteristic ratio is extended for zero-including commensurate fractional order systems. The generalized version of characteristic ratios is defined such that the time-scaling property of characteristic ratios is also preserved. The monotonicity of the magnitude frequency response is employed to assign the generalized characteristic ratios for commensurate fractional order transfer functions with one zero. A simple pattern for characteristic ratios is proposed to reach a non-overshooting step response. Then, the proposed pattern is revisited to reach a low overshoot (say for example 2%) step response. Finally, zero-including controllers such as fractional order PI or lag (lead) controllers are designed using generalized characteristic ratios assignment method. Numerical simulations are provided to show the efficiency of the so designed controllers. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Optimal Assignment Problem Applications of Finite Mathematics to Business and Economics. [and] Difference Equations with Applications. Applications of Difference Equations to Economics and Social Sciences. [and] Selected Applications of Mathematics to Finance and Investment. Applications of Elementary Algebra to Finance. [and] Force of Interest. Applications of Calculus to Finance. UMAP Units 317, 322, 381, 382.

ERIC Educational Resources Information Center

Gale, David; And Others

Four units make up the contents of this document. The first examines applications of finite mathematics to business and economies. The user is expected to learn the method of optimization in optimal assignment problems. The second module presents applications of difference equations to economics and social sciences, and shows how to: 1) interpret…

Trajectories of Change in University Students' General Views of Group Work Following One Single Group Assignment: Significance of Instructional Context and Multidimensional Aspects of Experience

ERIC Educational Resources Information Center

Wosnitza, Marold; Volet, Simone

2014-01-01

This paper examines how distinct trajectories of change in students' general views of group work over the duration of one single group assignment could be explained by multidimensional aspects of their experience and the overall instructional context. Science (336) and Education (377) students involved in a semester-long group assignment…

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

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

Characterizing the Fundamental Intellectual Steps Required in the Solution of Conceptual Problems

NASA Astrophysics Data System (ADS)

Stewart, John

2010-02-01

At some level, the performance of a science class must depend on what is taught, the information content of the materials and assignments of the course. The introductory calculus-based electricity and magnetism class at the University of Arkansas is examined using a catalog of the basic reasoning steps involved in the solution of problems assigned in the class. This catalog was developed by sampling popular physics textbooks for conceptual problems. The solution to each conceptual problem was decomposed into its fundamental reasoning steps. These fundamental steps are, then, used to quantify the distribution of conceptual content within the course. Using this characterization technique, an exceptionally detailed picture of the information flow and structure of the class can be produced. The intellectual structure of published conceptual inventories is compared with the information presented in the class and the dependence of conceptual performance on the details of coverage extracted. )

Flow assignment model for quantitative analysis of diverting bulk freight from road to railway

PubMed Central

Liu, Chang; Wang, Jiaxi; Xiao, Jie; Liu, Siqi; Wu, Jianping; Li, Jian

2017-01-01

Since railway transport possesses the advantage of high volume and low carbon emissions, diverting some freight from road to railway will help reduce the negative environmental impacts associated with transport. This paper develops a flow assignment model for quantitative analysis of diverting truck freight to railway. First, a general network which considers road transportation, railway transportation, handling and transferring is established according to all the steps in the whole transportation process. Then general functions which embody the factors which the shippers will pay attention to when choosing mode and path are formulated. The general functions contain the congestion cost on road, the capacity constraints of railways and freight stations. Based on the general network and general cost function, a user equilibrium flow assignment model is developed to simulate the flow distribution on the general network under the condition that all shippers choose transportation mode and path independently. Since the model is nonlinear and challenging, we adopt a method that uses tangent lines to constitute envelope curve to linearize it. Finally, a numerical example is presented to test the model and show the method of making quantitative analysis of bulk freight modal shift between road and railway. PMID:28771536

A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

NASA Astrophysics Data System (ADS)

Onut, S.; Kamber, M. R.; Altay, G.

2014-03-01

Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time.

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…

The Benefit of Interleaved Mathematics Practice Is Not Limited to Superficially Similar Kinds of Problems

ERIC Educational Resources Information Center

Rohrer, Doug; Dedrick, Robert F.; Burgess, Kaleena

2014-01-01

Most mathematics assignments consist of a group of problems requiring the same strategy. For example, a lesson on the quadratic formula is typically followed by a block of problems requiring students to use the quadratic formula, which means that students know the appropriate strategy before they read each problem. In an alternative approach,…

The moderating role of child callous-unemotional traits in an Internet-based parent-management training program.

PubMed

Högström, Jens; Enebrink, Pia; Ghaderi, Ata

2013-04-01

Although parent management training (PMT) is generally considered the treatment of choice for children with conduct problems, some specific adaptations might be essential for various subgroups of parents or children to benefit well from PMT. The aim of this study was to examine the influence of child callous-unemotional (CU) traits on the outcome of an Internet-based PMT program for parents of children with conduct problems (n = 57; mean age 6.65). Within a randomized controlled trial of PMT, children assigned to the intervention group were categorized and compared as either "high-CU" (n = 8) or "low-CU" (n = 49) based on a cut-off score on the CU subscale of the Antisocial Process Screening Device (APSD; Frick & Hare, 2001). CU traits in children were associated with more severe conduct problems at baseline, as well as more hyperactivity and peer-related problems. Treatment outcome, in terms of conduct-problem reduction, was poor in the high-CU group compared with the low-CU group, despite the fact that parents in both groups improved equally in parenting skills. The same pattern of results emerged after controlling for initial difficulties of conduct problems and other pretreatment differences between the groups. Elevated levels of CU traits in children seem to contribute to an inferior treatment response in PMT. These findings call for more attention on empathy and emotional patterns in the assessment of children with conduct problems. (PsycINFO Database Record (c) 2013 APA, all rights reserved).

Is extreme learning machine feasible? A theoretical assessment (part II).

PubMed

Lin, Shaobo; Liu, Xia; Fang, Jian; Xu, Zongben

2015-01-01

An extreme learning machine (ELM) can be regarded as a two-stage feed-forward neural network (FNN) learning system that randomly assigns the connections with and within hidden neurons in the first stage and tunes the connections with output neurons in the second stage. Therefore, ELM training is essentially a linear learning problem, which significantly reduces the computational burden. Numerous applications show that such a computation burden reduction does not degrade the generalization capability. It has, however, been open that whether this is true in theory. The aim of this paper is to study the theoretical feasibility of ELM by analyzing the pros and cons of ELM. In the previous part of this topic, we pointed out that via appropriately selected activation functions, ELM does not degrade the generalization capability in the sense of expectation. In this paper, we launch the study in a different direction and show that the randomness of ELM also leads to certain negative consequences. On one hand, we find that the randomness causes an additional uncertainty problem of ELM, both in approximation and learning. On the other hand, we theoretically justify that there also exist activation functions such that the corresponding ELM degrades the generalization capability. In particular, we prove that the generalization capability of ELM with Gaussian kernel is essentially worse than that of FNN with Gaussian kernel. To facilitate the use of ELM, we also provide a remedy to such a degradation. We find that the well-developed coefficient regularization technique can essentially improve the generalization capability. The obtained results reveal the essential characteristic of ELM in a certain sense and give theoretical guidance concerning how to use ELM.

An efficient sequential approach to tracking multiple objects through crowds for real-time intelligent CCTV systems.

PubMed

Li, Liyuan; Huang, Weimin; Gu, Irene Yu-Hua; Luo, Ruijiang; Tian, Qi

2008-10-01

Efficiency and robustness are the two most important issues for multiobject tracking algorithms in real-time intelligent video surveillance systems. We propose a novel 2.5-D approach to real-time multiobject tracking in crowds, which is formulated as a maximum a posteriori estimation problem and is approximated through an assignment step and a location step. Observing that the occluding object is usually less affected by the occluded objects, sequential solutions for the assignment and the location are derived. A novel dominant color histogram (DCH) is proposed as an efficient object model. The DCH can be regarded as a generalized color histogram, where dominant colors are selected based on a given distance measure. Comparing with conventional color histograms, the DCH only requires a few color components (31 on average). Furthermore, our theoretical analysis and evaluation on real data have shown that DCHs are robust to illumination changes. Using the DCH, efficient implementations of sequential solutions for the assignment and location steps are proposed. The assignment step includes the estimation of the depth order for the objects in a dispersing group, one-by-one assignment, and feature exclusion from the group representation. The location step includes the depth-order estimation for the objects in a new group, the two-phase mean-shift location, and the exclusion of tracked objects from the new position in the group. Multiobject tracking results and evaluation from public data sets are presented. Experiments on image sequences captured from crowded public environments have shown good tracking results, where about 90% of the objects have been successfully tracked with the correct identification numbers by the proposed method. Our results and evaluation have indicated that the method is efficient and robust for tracking multiple objects (>or= 3) in complex occlusion for real-world surveillance scenarios.

Combining automated peak tracking in SAR by NMR with structure-based backbone assignment from 15N-NOESY

PubMed Central

2012-01-01

Background Chemical shift mapping is an important technique in NMR-based drug screening for identifying the atoms of a target protein that potentially bind to a drug molecule upon the molecule's introduction in increasing concentrations. The goal is to obtain a mapping of peaks with known residue assignment from the reference spectrum of the unbound protein to peaks with unknown assignment in the target spectrum of the bound protein. Although a series of perturbed spectra help to trace a path from reference peaks to target peaks, a one-to-one mapping generally is not possible, especially for large proteins, due to errors, such as noise peaks, missing peaks, missing but then reappearing, overlapped, and new peaks not associated with any peaks in the reference. Due to these difficulties, the mapping is typically done manually or semi-automatically, which is not efficient for high-throughput drug screening. Results We present PeakWalker, a novel peak walking algorithm for fast-exchange systems that models the errors explicitly and performs many-to-one mapping. On the proteins: hBclXL, UbcH5B, and histone H1, it achieves an average accuracy of over 95% with less than 1.5 residues predicted per target peak. Given these mappings as input, we present PeakAssigner, a novel combined structure-based backbone resonance and NOE assignment algorithm that uses just 15N-NOESY, while avoiding TOCSY experiments and 13C-labeling, to resolve the ambiguities for a one-to-one mapping. On the three proteins, it achieves an average accuracy of 94% or better. Conclusions Our mathematical programming approach for modeling chemical shift mapping as a graph problem, while modeling the errors directly, is potentially a time- and cost-effective first step for high-throughput drug screening based on limited NMR data and homologous 3D structures. PMID:22536902

Learning Science Process Through Data Exploration and Writing

NASA Astrophysics Data System (ADS)

Prothero, W. A.

2007-12-01

One of the most effective ways of teaching science process is to have students take part in the same activities that practicing scientists engage in. These activities include studying the current research in the field, discussing ideas with colleagues, formulating a research problem, making a proposal defining the problem and plan of attack, presenting and writing about the results of the study, and critically reviewing the work of others. An inquiry curriculum can use these activities to guide the scaffolding of assignments and learning experiences that help students learn science process. At UCSB, students in a large general education oceanography class use real Earth data to study plate tectonics, the Indian Monsoon, climate change, and the health of the world fisheries. The end product for each subject has been a science paper based on Earth data. Over a period of approximately 15 years, the scaffolding of activities to prepare each student for the written assignments has been modified and improved, in response to student feedback and their success with the assignments. I have found that the following resources and sequence of activities help the oceanography students write good science papers. 1. Lecture: motivation and the opportunity for feedback and questions. 2. Textbook: background information. It is also possible to get the information from the internet, but unless the scope of reading is strictly defined, students don't know when to stop reading and become unhappy. 3. Online assignments: automatically graded assignments that force the student to keep up with reading. 4. Questions of the day: in-class handouts, with diagrams that the students either complete, or answer questions about. They are handed in and tallied, but not graded. They also inform the instructor of misconceptions. 5. Thought questions: student answers are posted on a threaded discussion list, and are due prior to lecture. The answers provide instructor feedback and guide the lecture. Students see their peers' answers only after entering their own. They can then improve their own answer ("Just In Time Teaching"). 6. Laboratory section activities: these introduce students to the course software, especially the data browsers, and the meaning of the data for the next writing assignment. For each meeting, a group inquiry activity results in a short class presentation by each group. This informs the teaching assistant (who teaches the lab section) of student understanding of the material, helps students become comfortable with the software, and supports students helping each other. 7. Written assignments. The assignments each require an approximately 1100-1600 word paper that includes abstract, introduction, data, interpretation, summary, and references. Images are captured from the data browser and included in the paper. The writing technology has evolved from papers handed in and graded by hand, to fully online hand-in and grading, to calibrated peer review, which was incorporated in the 2005 course. Calibrated peer review has the advantage that students see and evaluate their peers' papers. About 20% of the papers are graded by the instructor, resulting in a much lower instructor grading workload. Also, I suspect that a greater number of very short writing assignments in response to thought questions or min- inquiries might be an effective modification. The new "Learning With Data Workshop" will support many of the inquiry activities described here.

Effect of routine assessment of specific psychosocial problems on personalized communication, counselors’ awareness, and distress levels in cancer genetic counseling practice: a randomized controlled trial.

PubMed

Eijzenga, Willem; Aaronson, Neil K; Hahn, Daniela E E; Sidharta, Grace N; van der Kolk, Lizet E; Velthuizen, Mary E; Ausems, Margreet G E M; Bleiker, Eveline M A

2014-09-20

This study evaluated the efficacy of a cancer genetics–specific questionnaire in facilitating communication about, awareness of, and management of psychosocial problems, as well as in lowering distress levels. Individuals referred to genetic counseling for cancer at two family cancer clinics in The Netherlands were randomly assigned to an intervention or a control group. All participants completed the psychosocial questionnaire before counseling. In the intervention group, the counselors received the results of this questionnaire before the counseling session. All sessions were audiotaped for content analysis. Primary outcomes were the frequency with which psychosocial problems were discussed, the genetic counselors’ awareness of these problems, and their management. Secondary outcomes included cancer worries and psychological distress, duration and dynamics of the counseling, and satisfaction. The frequency with which psychosocial problems were discussed with 246 participating counselees was significantly higher in the intervention group (n = 127) than in the control group (n =119; P = .004), as was the counselors’ awareness of psychosocial problems regarding hereditary predisposition (P < .001), living with cancer (P = .01), and general emotions (P < .001). Counselors initiated more discussion of psychosocial problems in the intervention group (P < .001), without affecting the length of the counseling session. No significant differences were found on management (P = .19). The intervention group reported significantly lower levels of cancer worries (p = .005) and distress (p = .02) after counseling. The routine assessment of psychosocial problems by questionnaire facilitates genetic counselors’ recognition and discussion of their clients’ psychosocial problems and reduces clients’ distress levels.

The safety of addition of nitrous oxide to general anaesthesia in at-risk patients having major non-cardiac surgery (ENIGMA-II): a randomised, single-blind trial.

PubMed

Myles, Paul S; Leslie, Kate; Chan, Matthew T V; Forbes, Andrew; Peyton, Philip J; Paech, Michael J; Beattie, W Scott; Sessler, Daniel I; Devereaux, P J; Silbert, Brendan; Schricker, Thomas; Wallace, Sophie

2014-10-18

Nitrous oxide is commonly used in general anaesthesia but concerns exist that it might increase perioperative cardiovascular risk. We aimed to gather evidence to establish whether nitrous oxide affects perioperative cardiovascular risk. We did an international, randomised, assessor-blinded trial in patients aged at least 45 years with known or suspected coronary artery disease having major non-cardiac surgery. Patients were randomly assigned via automated telephone service, stratified by site, to receive a general anaesthetic with or without nitrous oxide. Attending anaesthetists were aware of patients' group assignments, but patients and assessors were not. The primary outcome measure was a composite of death and cardiovascular complications (non-fatal myocardial infarction, stroke, pulmonary embolism, or cardiac arrest) within 30 days of surgery. Our modified intention-to-treat population included all patients randomly assigned to groups and undergoing induction of general anaesthesia for surgery. This trial is registered at ClinicalTrials.gov, number NCT00430989. Of 10,102 eligible patients, we enrolled 7112 patients between May 30, 2008, and Sept 28, 2013. 3543 were assigned to receive nitrous oxide and 3569 were assigned not to receive nitrous oxide. 3483 patients receiving nitrous oxide and 3509 not receiving nitrous oxide were assessed for the primary outcome. The primary outcome occurred in 283 (8%) patients receiving nitrous oxide and in 296 (8%) patients not receiving nitrous oxide (relative risk 0·96, 95% CI 0·83–1·12; p=0·64). Surgical site infection occurred in 321 (9%) patients assigned to nitrous oxide, and in 311 (9%) patients in the no-nitrous oxide group (p=0·61), and severe nausea and vomiting occurred in 506 patients (15%) assigned to nitrous oxide and 378 patients (11%) not assigned to nitrous oxide (p<0·0001). Our findings support the safety profile of nitrous oxide use in major non-cardiac surgery. Nitrous oxide did not increase the risk of death and cardiovascular complications or surgical-site infection, the emetogenic effect of nitrous oxide can be controlled with antiemetic prophylaxis, and a desired effect of reduced volatile agent use was shown. Australian National Health and Medical Research Council; Australian and New Zealand College of Anaesthetists; Heart and Stroke Foundation of Quebec, Heart and Stroke Foundation of Ontario, Canada; General Research Fund of the Research Grant Council, Hong Kong Special Administrative Region, China.

Cognitive Strategies, Working Memory, and Growth in Word Problem Solving in Children With Math Difficulties.

PubMed

Swanson, H Lee; Lussier, Catherine M; Orosco, Michael J

2015-01-01

This study investigated the role of strategy instruction and working memory capacity (WMC) on word problem solving accuracy in children with (n = 100) and without (n = 92) math difficulties (MD). Within classrooms, children in Grades 2 and 3 were randomly assigned to one of four treatment conditions: verbal-only strategies (e.g., underlining question sentence), verbal + visual strategies, visual-only strategies (e.g., correctly placing numbers in diagrams), or untreated control. Strategy interventions included 20 sessions in both Year 1 and Year 2. The intent-to-treat as well as the "as-treated" analyses showed that treatment effects were significantly moderated by WMC. In general, treatment outcomes were higher when WMC was set to a high rather than low level. When set to a relatively high WMC level, children with MD performed significantly better under visual-only strategy conditions and children without MD performed better under verbal + visual conditions when compared to control conditions. © Hammill Institute on Disabilities 2013.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering.

PubMed

Gao, Shan; Guo, Guibing; Li, Runzhi; Wang, Zongmin

2017-01-01

Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users' preference by exploiting explicit feedbacks (numerical ratings), or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks). Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users' actions), based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users' other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering

PubMed Central

2017-01-01

Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users' preference by exploiting explicit feedbacks (numerical ratings), or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks). Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users' actions), based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users' other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app. PMID:29118963

Alcohol cognitive bias modification training for problem drinkers over the web.

PubMed

Wiers, Reinout W; Houben, Katrijn; Fadardi, Javad S; van Beek, Paul; Rhemtulla, Mijke; Cox, W Miles

2015-01-01

Following successful outcomes of cognitive bias modification (CBM) programs for alcoholism in clinical and community samples, the present study investigated whether different varieties of CBM (attention control training and approach-bias re-training) could be delivered successfully in a fully automated web-based way and whether these interventions would help self-selected problem drinkers to reduce their drinking. Participants were recruited through online advertising, which resulted in 697 interested participants, of whom 615 were screened in. Of the 314 who initiated training, 136 completed a pretest, four sessions of computerized training and a posttest. Participants were randomly assigned to one of four experimental conditions (attention control or one of three varieties of approach-bias re-training) or a sham-training control condition. The general pattern of findings was that participants in all conditions (including participants in the control-training condition) reduced their drinking. It is suggested that integrating CBM with online cognitive and motivational interventions could improve results. Copyright © 2014 Elsevier Ltd. All rights reserved.

Ambiguous genitalia, gender-identity problems, and sex reassignment.

PubMed

Dittmann, R W

1998-01-01

This article discusses general issues with regard to gender-identity problems, sex reassignment, and clinical management in patients with ambiguous genitalia, based on a detailed case history of a patient with penile agenesis who has been followed more than 20 years. After initial uncertainty, the patient began to grow up as a boy, lived from the fourth year of life as a girl and young woman, and lived from late puberty on as a man. Over his lifetime he experienced extensive corrective surgery plus hormonal substitution therapy. Pre- and perinatal hormonal conditions, phenomenology of the genitalia, sex of rearing, timing of sex reassignment and corrective surgery, for example, appear to be important components for the development of gender-role behavior, gender identity, and sexual orientation of intersex patients. Findings and retrospective considerations for this patient suggest the need for careful differential activities in diagnostic workup, approaches to sex assignment and possible reassignment, and the clinical management of patients and families.

Self-Administered Vidoetape Therapy for Families With Conduct-Problem Children: Comparison With Two Cost-Effective Treatments and a Control Group.

ERIC Educational Resources Information Center

Webster-Stratton, Carolyn; And Others

1988-01-01

Assigned parents of 114 conduct-problem young children to either individually administered videotape modeling treatment, group discussion videotape modeling treatment, group discussion treatment, or waiting-list control. Compared with controls, all three treatment groups of mothers reported significantly fewer child behavior problems, more…

Interpersonal Problem-Solving Skills Training in the Treatment of Self-Poisoning Patients.

ERIC Educational Resources Information Center

McLeavey, B. C.; And Others

1994-01-01

Evaluated the effectiveness of interpersonal problem-solving skills training (IPSST) for the treatment of self-poisoning patients. Subjects were assigned randomly either to IPSST or to a control treatment. Although both treatments reduced the number of presenting problems, the IPSST was more effective as determined by other outcome measures. (RJM)

The Effect of Contextual and Conceptual Rewording on Mathematical Problem-Solving Performance

ERIC Educational Resources Information Center

Haghverdi, Majid; Wiest, Lynda R.

2016-01-01

This study shows how separate and combined contextual and conceptual problem rewording can positively influence student performance in solving mathematical word problems. Participants included 80 seventh-grade Iranian students randomly assigned in groups of 20 to three experimental groups involving three types of rewording and a control group. All…

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…

A New Algorithm to Create Balanced Teams Promoting More Diversity

ERIC Educational Resources Information Center

Dias, Teresa Galvão; Borges, José

2017-01-01

The problem of assigning students to teams can be described as maximising their profiles diversity within teams while minimising the differences among teams. This problem is commonly known as the maximally diverse grouping problem and it is usually formulated as maximising the sum of the pairwise distances among students within teams. We propose…

Effect of a "Look-Ahead" Problem on Undergraduate Engineering Students' Concept Comprehension

ERIC Educational Resources Information Center

Goodman, Kevin; Davis, Julian; McDonald, Thomas

2016-01-01

In an effort to motivate undergraduate engineering students to prepare for class by reviewing material before lectures, a "Look-Ahead" problem was utilized. Students from two undergraduate engineering courses; Statics and Electronic Circuits, were assigned problems from course material that had not yet been covered in class. These…

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

Global crop production forecasting: An analysis of the data system problems and their solutions

NASA Technical Reports Server (NTRS)

Neiers, J.; Graf, H.

1978-01-01

Data related problems in the acquisition and use of satellite data necessary for operational forecasting of global crop production are considered for the purpose of establishing a measurable baseline. For data acquisition the world was divided into 37 crop regions in 22 countries. These regions represent approximately 95 percent of the total world production of the selected crops of interest, i.e., wheat, corn, soybeans, and rice. Targets were assigned to each region. Limited time periods during which data could be taken (windows) were assigned to each target. Each target was assigned to a cloud region. The DSDS was used to measure the success of obtaining data for each target during the specified windows for the regional cloud conditions and the specific alternatives being analyzed. The results of this study suggest several approaches for an operational system that will perform satisfactorily with two LANDSAT type satellites.

A multi-state fragment charge difference approach for diabatic states in electron transfer: Extension and automation

NASA Astrophysics Data System (ADS)

Yang, Chou-Hsun; Hsu, Chao-Ping

2013-10-01

The electron transfer (ET) rate prediction requires the electronic coupling values. The Generalized Mulliken-Hush (GMH) and Fragment Charge Difference (FCD) schemes have been useful approaches to calculate ET coupling from an excited state calculation. In their typical form, both methods use two eigenstates in forming the target charge-localized diabatic states. For problems involve three or four states, a direct generalization is possible, but it is necessary to pick and assign the locally excited or charge-transfer states involved. In this work, we generalize the 3-state scheme for a multi-state FCD without the need of manual pick or assignment for the states. In this scheme, the diabatic states are obtained separately in the charge-transfer or neutral excited subspaces, defined by their eigenvalues in the fragment charge-difference matrix. In each subspace, the Hamiltonians are diagonalized, and there exist off-diagonal Hamiltonian matrix elements between different subspaces, particularly the charge-transfer and neutral excited diabatic states. The ET coupling values are obtained as the corresponding off-diagonal Hamiltonian matrix elements. A similar multi-state GMH scheme can also be developed. We test the new multi-state schemes for the performance in systems that have been studied using more than two states with FCD or GMH. We found that the multi-state approach yields much better charge-localized states in these systems. We further test for the dependence on the number of state included in the calculation of ET couplings. The final coupling values are converged when the number of state included is increased. In one system where experimental value is available, the multi-state FCD coupling value agrees better with the previous experimental result. We found that the multi-state GMH and FCD are useful when the original two-state approach fails.

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)

Propagation of Disturbances in Traffic Flow

DOT National Transportation Integrated Search

1977-09-01

The system-optimized static traffic-assignment problem in a freeway corridor network is the problem of choosing a distribution of vehicles in the network to minimize average travel time. It is of interest to know how sensitive the optimal steady-stat...

Guidance and control of swarms of spacecraft

NASA Astrophysics Data System (ADS)

Morgan, Daniel James

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

Pedagogy of the logic model: teaching undergraduates to work together to change their communities.

PubMed

Zimmerman, Lindsey; Kamal, Zohra; Kim, Hannah

2013-01-01

Undergraduate community psychology courses can empower students to address challenging problems in their local communities. Creating a logic model is an experiential way to learn course concepts by "doing." Throughout the semester, students work with peers to define a problem, develop an intervention, and plan an evaluation focused on an issue of concern to them. This report provides an overview of how to organize a community psychology course around the creation of a logic model in order for students to develop this applied skill. Two undergraduate student authors report on their experience with the logic model assignment, describing the community problem they chose to address, what they learned from the assignment, what they found challenging, and what they are doing now in their communities based on what they learned.

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.

Perceptions of U.S. Navy Medical Reservists Recalled for Operation Desert Storm

DTIC Science & Technology

1992-10-01

operational training? .69 your recall assignment in leadership / management training? .69 your recall assignment in general military training? .67 your recall...uniforms, chain of command, etc.) 1 2 3 4 5 21. Leadership / Management Training (LMET, command excellence seminars, etc.) 1 2 3 4 5 22. Based on your recall...through 4" for 4th-highest priority.) Clinical/Professional Skills Training Operational Training _ General Military Training Leadership / Management Training

Evidence-informed recommendations to reduce dissemination bias in clinical research: conclusions from the OPEN (Overcome failure to Publish nEgative fiNdings) project based on an international consensus meeting

PubMed Central

Meerpohl, Joerg J; Schell, Lisa K; Bassler, Dirk; Gallus, Silvano; Kleijnen, Jos; Kulig, Michael; La Vecchia, Carlo; Marušić, Ana; Ravaud, Philippe; Reis, Andreas; Schmucker, Christine; Strech, Daniel; Urrútia, Gerard; Antes, Gerd

2015-01-01

Background Dissemination bias in clinical research severely impedes informed decision-making not only for healthcare professionals and patients, but also for funders, research ethics committees, regulatory bodies and other stakeholder groups that make health-related decisions. Decisions based on incomplete and biased evidence cannot only harm people, but may also have huge financial implications by wasting resources on ineffective or harmful diagnostic and therapeutic measures, and unnecessary research. Owing to involvement of multiple stakeholders, it remains easy for any single group to assign responsibility for resolving the problem to others. Objective To develop evidence-informed general and targeted recommendations addressing the various stakeholders involved in knowledge generation and dissemination to help overcome the problem of dissemination bias on the basis of previously collated evidence. Methods Based on findings from systematic reviews, document analyses and surveys, we developed general and targeted draft recommendations. During a 2-day workshop in summer 2013, these draft recommendations were discussed with external experts and key stakeholders, and refined following a rigorous and transparent methodological approach. Results Four general, overarching recommendations applicable to all or most stakeholder groups were formulated, addressing (1) awareness raising, (2) implementation of targeted recommendations, (3) trial registration and results posting, and (4) systematic approaches to evidence synthesis. These general recommendations are complemented and specified by 47 targeted recommendations tailored towards funding agencies, pharmaceutical and device companies, research institutions, researchers (systematic reviewers and trialists), research ethics committees, trial registries, journal editors and publishers, regulatory agencies, benefit (health technology) assessment institutions and legislators. Conclusions Despite various recent examples of dissemination bias and several initiatives to reduce it, the problem of dissemination bias has not been resolved. Tailored recommendations based on a comprehensive approach will hopefully help increase transparency in biomedical research by overcoming the failure to disseminate negative findings. PMID:25943371

Error Checking and Graphical Representation of Multiple–Complete–Digest (MCD) Restriction-Fragment Maps

PubMed Central

Thayer, Edward C.; Olson, Maynard V.; Karp, Richard M.

1999-01-01

Genetic and physical maps display the relative positions of objects or markers occurring within a target DNA molecule. In constructing maps, the primary objective is to determine the ordering of these objects. A further objective is to assign a coordinate to each object, indicating its distance from a reference end of the target molecule. This paper describes a computational method and a body of software for assigning coordinates to map objects, given a solution or partial solution to the ordering problem. We describe our method in the context of multiple–complete–digest (MCD) mapping, but it should be applicable to a variety of other mapping problems. Because of errors in the data or insufficient clone coverage to uniquely identify the true ordering of the map objects, a partial ordering is typically the best one can hope for. Once a partial ordering has been established, one often seeks to overlay a metric along the map to assess the distances between the map objects. This problem often proves intractable because of data errors such as erroneous local length measurements (e.g., large clone lengths on low-resolution physical maps). We present a solution to the coordinate assignment problem for MCD restriction-fragment mapping, in which a coordinated set of single-enzyme restriction maps are simultaneously constructed. We show that the coordinate assignment problem can be expressed as the solution of a system of linear constraints. If the linear system is free of inconsistencies, it can be solved using the standard Bellman–Ford algorithm. In the more typical case where the system is inconsistent, our program perturbs it to find a new consistent system of linear constraints, close to those of the given inconsistent system, using a modified Bellman–Ford algorithm. Examples are provided of simple map inconsistencies and the methods by which our program detects candidate data errors and directs the user to potential suspect regions of the map. PMID:9927487

Minimizing distortion and internal forces in truss structures by simulated annealing

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.

1989-01-01

Inaccuracies in the length of members and the diameters of joints of large truss reflector backup structures may produce unacceptable levels of surface distortion and member forces. However, if the member lengths and joint diameters can be measured accurately it is possible to configure the members and joints so that root-mean-square (rms) surface error and/or rms member forces is minimized. Following Greene and Haftka (1989) it is assumed that the force vector f is linearly proportional to the member length errors e(sub M) of dimension NMEMB (the number of members) and joint errors e(sub J) of dimension NJOINT (the number of joints), and that the best-fit displacement vector d is a linear function of f. Let NNODES denote the number of positions on the surface of the truss where error influences are measured. The solution of the problem is discussed. To classify, this problem was compared to a similar combinatorial optimization problem. In particular, when only the member length errors are considered, minimizing d(sup 2)(sub rms) is equivalent to the quadratic assignment problem. The quadratic assignment problem is a well known NP-complete problem in operations research literature. Hence minimizing d(sup 2)(sub rms) is is also an NP-complete problem. The focus of the research is the development of a simulated annealing algorithm to reduce d(sup 2)(sub rms). The plausibility of this technique is its recent success on a variety of NP-complete combinatorial optimization problems including the quadratic assignment problem. A physical analogy for simulated annealing is the way liquids freeze and crystallize. All computational experiments were done on a MicroVAX. The two interchange heuristic is very fast but produces widely varying results. The two and three interchange heuristic provides less variability in the final objective function values but runs much more slowly. Simulated annealing produced the best objective function values for every starting configuration and was faster than the two and three interchange heuristic.

Beyond local effective material properties for metamaterials

NASA Astrophysics Data System (ADS)

Mnasri, K.; Khrabustovskyi, A.; Stohrer, C.; Plum, M.; Rockstuhl, C.

2018-02-01

To discuss the properties of metamaterials on physical grounds and to consider them in applications, effective material parameters are usually introduced and assigned to a given metamaterial. In most cases, only weak spatial dispersion is considered. It allows to assign local material properties, e.g., a permittivity and a permeability. However, this turned out to be insufficient. To solve this problem, we study here the effective properties of metamaterials with constitutive relations beyond a local response and take strong spatial dispersion into account. This research requires two contributions. First, bulk properties in terms of eigenmodes need to be studied. We particularly investigate the isofrequency surfaces of their dispersion relation are investigated and compared to those of an actual metamaterial. The significant improvement to effectively describe it provides evidence for the necessity to use nonlocal material laws in the effective description of metamaterials. Second, to be able to capitalize on such constitutive relations, also interface conditions need to be known. They are derived in this contribution for our form of the nonlocality using a generalized (weak) formulation of Maxwell's equations. Based on such interface conditions, Fresnel expressions are obtained that predict the amplitude of the reflected and transmitted plane wave upon illuminating a slab of such a nonlocal metamaterial. This all together offers the necessary means for the in-depth analysis of metamaterials characterized by strong spatial dispersion. The general formulation we choose here renders our approach applicable to a wide class of metamaterials.

Secrets to Writing Great Papers. The Study Smart Series.

ERIC Educational Resources Information Center

Kesselman-Turkel, Judi; Peterson, Franklynn

This book explains how to work with ideas to hone them into words, providing techniques and exercises for brainstorming, choosing the right approach, working with an unknown or boring assigned topic, and selecting the best point of view. It presents 10 steps, noting related problems: (1) "Decide on Size" (no specific length is assigned);…

Integrating Global Learning into a Psychology Course Using an Online Platform

ERIC Educational Resources Information Center

Forden, Carie L.; Carrillo, Amy M.

2014-01-01

There is a demand for the integration of global learning/diversity across the curriculum. A series of cross-cultural assignments was created to facilitate global learning in two social psychology classes, one in Egypt, and one in the USA. In these assignments, students collected data and applied course concepts to real-life problems, then…

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…

Commander, U.S. Pacific Fleet

Science.gov Websites

Us SAN DIEGO (May 22, 2018) Sailors assigned to Coastal Riverine Squadron (CRS) 3 operate a Mark VI patrol boat during a final evaluation problem conducted by Coastal Riverine Group (CRG) 1's training and ./Released) Sailors assigned to Coastal Riverine Squadron 3 operate a Mark VI patrol boat in waters off San

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

Weblogs in Teacher Education Internships: Promoting Reflection and Self-Efficacy While Reducing Stress?

ERIC Educational Resources Information Center

Petko, Dominik; Egger, Nives; Cantieni, Andrea

2017-01-01

The study examines the use of weblogs in teacher education internships and its impact on student stress levels, self-efficacy, and reflective abilities. One hundred and seventy-six student teachers were randomly assigned to five groups. Four groups used weblogs (a) with emotion-focused or with problem-focused writing assignments in combination (b)…

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…

Selections from the ABC 2014 Annual Convention, Philadelphia, Pennsylvania A Well-Stitched Banner of Favorite Assignments: Leadership and Other-Focused Communication and Projects

ERIC Educational Resources Information Center

Whalen, D. Joel

2015-01-01

This article, the second of a two-part series, features 11 teaching innovations presented at the 2014 Association for Business Communication annual conference. These 11 assignments included leadership and other-focused communication--detecting communication style, adaptive communication, personality type, delivering feedback, problem solving, and…

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…

47 CFR 22.107 - General application requirements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... PUBLIC MOBILE SERVICES Licensing Requirements and Procedures Applications and Notifications § 22.107 General application requirements. In general, applications for authorizations, assignments of... 47 Telecommunication 2 2010-10-01 2010-10-01 false General application requirements. 22.107...

Sampled-data consensus in switching networks of integrators based on edge events

NASA Astrophysics Data System (ADS)

Xiao, Feng; Meng, Xiangyu; Chen, Tongwen

2015-02-01

This paper investigates the event-driven sampled-data consensus in switching networks of multiple integrators and studies both the bidirectional interaction and leader-following passive reaction topologies in a unified framework. In these topologies, each information link is modelled by an edge of the information graph and assigned a sequence of edge events, which activate the mutual data sampling and controller updates of the two linked agents. Two kinds of edge-event-detecting rules are proposed for the general asynchronous data-sampling case and the synchronous periodic event-detecting case. They are implemented in a distributed fashion, and their effectiveness in reducing communication costs and solving consensus problems under a jointly connected topology condition is shown by both theoretical analysis and simulation examples.

Deformation of a geo-medium with considering for internal self-balancing stresses

NASA Astrophysics Data System (ADS)

Lavrikov, S. V.; Revuzhenko, A. F.

2016-11-01

Based on the general concept of rock as a medium with inner sources and sinks of energy, the authors consider an approach to mathematical modeling of a geo-medium with account for internal self-balancing stresses. The description of stresses and strains at the level of microstructural elements and macrovolume of the medium uses methods of non-Archimedean analysis. The model allows describing the accumulation of elastic energy in the form of internal self-balancing stresses. A finite element algorithm and a software program for solving plane boundary-value problems have been developed. The calculated data on rock specimen compression are given. It is shown that the behavior of plastic deformation zones depends on the pre-assigned initial microstresses.

Biometric identification

NASA Astrophysics Data System (ADS)

Syryamkim, V. I.; Kuznetsov, D. N.; Kuznetsova, A. S.

2018-05-01

Image recognition is an information process implemented by some information converter (intelligent information channel, recognition system) having input and output. The input of the system is fed with information about the characteristics of the objects being presented. The output of the system displays information about which classes (generalized images) the recognized objects are assigned to. When creating and operating an automated system for pattern recognition, a number of problems are solved, while for different authors the formulations of these tasks, and the set itself, do not coincide, since it depends to a certain extent on the specific mathematical model on which this or that recognition system is based. This is the task of formalizing the domain, forming a training sample, learning the recognition system, reducing the dimensionality of space.

Connected Component Model for Multi-Object Tracking.

PubMed

He, Zhenyu; Li, Xin; You, Xinge; Tao, Dacheng; Tang, Yuan Yan

2016-08-01

In multi-object tracking, it is critical to explore the data associations by exploiting the temporal information from a sequence of frames rather than the information from the adjacent two frames. Since straightforwardly obtaining data associations from multi-frames is an NP-hard multi-dimensional assignment (MDA) problem, most existing methods solve this MDA problem by either developing complicated approximate algorithms, or simplifying MDA as a 2D assignment problem based upon the information extracted only from adjacent frames. In this paper, we show that the relation between associations of two observations is the equivalence relation in the data association problem, based on the spatial-temporal constraint that the trajectories of different objects must be disjoint. Therefore, the MDA problem can be equivalently divided into independent subproblems by equivalence partitioning. In contrast to existing works for solving the MDA problem, we develop a connected component model (CCM) by exploiting the constraints of the data association and the equivalence relation on the constraints. Based upon CCM, we can efficiently obtain the global solution of the MDA problem for multi-object tracking by optimizing a sequence of independent data association subproblems. Experiments on challenging public data sets demonstrate that our algorithm outperforms the state-of-the-art approaches.

Novel approaches for road congestion mitigation.

DOT National Transportation Integrated Search

2012-07-02

Transportation planning is usually aiming to solve two problems: the traffic assignment and the toll pricing problems. The latter one utilizes information from the first one, in order to find the optimal set of tolls that is the set of tolls that lea...

Novel approaches for road congestion minimization.

DOT National Transportation Integrated Search

2012-07-01

Transportation planning is usually aiming to solve two problems: the traffic assignment and the toll pricing problems. The latter one utilizes information from the first one, in order to find the optimal set of tolls that is the set of tolls that lea...

A continuous glucose monitoring and problem-solving intervention to change physical activity behavior in women with type 2 diabetes: a pilot study.

PubMed

Allen, Nancy; Whittemore, Robin; Melkus, Gail

2011-11-01

Diabetes technology has the potential to provide useful data for theory-based behavioral counseling. The aims of this study are to evaluate the feasibility, acceptability, and preliminary efficacy of a continuous glucose monitoring and problem-solving counseling intervention to change physical activity (PA) behavior in women with type 2 diabetes. Women (n=29) with type 2 diabetes were randomly assigned to one of two treatment conditions: continuous glucose counseling and problem-solving skills or continuous glucose monitoring counseling and general diabetes education. Feasibility data were obtained on intervention dose, implementation, and satisfaction. Preliminary efficacy data were collected at baseline and 12 weeks on the following measures: PA amount and intensity, diet, problem-solving skills, self-efficacy for PA, depression, hemogoloin A1c, weight, and blood pressure. Demographic and implementation variables were described using frequency distributions and summary statistics. Satisfaction data were analyzed using Wilcoxon rank. Differences between groups were analyzed using linear mixed-modeling. Women were mostly white/non-Latina with a mean age of 53 years, a 6.5-year history of diabetes, and suboptimal glycemic control. Continuous glucose monitoring plus problem-solving group participants had significantly greater problem-solving skills and had greater, although not statistically significant, dietary adherence, moderate activity minutes, weight loss, and higher intervention satisfaction pre- to post-intervention than did participants in the continuous glucose monitoring plus education group. A continuous glucose monitoring plus problem-solving intervention was feasible and acceptable, and participants had greater problem-solving skills than continuous glucose monitoring plus education group participants.

Effects of the KEEP Foster Parent Intervention on Child and Sibling Behavior Problems and Parental Stress during a Randomized Implementation Trial

PubMed Central

Price, Joseph M.; Roesch, Scott; Walsh, Natalia E.; Landsverk, John

2014-01-01

Children in foster care are at risk for externalizing behavior problems, which can in turn increase the risk of changes in foster care placement. The KEEP (Keeping Foster Parents Trained and Supported) foster parent training intervention was designed to equip foster parents with strategies for managing externalizing behavior problems. The primary goals of this investigation were to (a) examine the effectiveness of the KEEP intervention in reducing child behavior problems, as delivered by a community agency, (b) determine if the effects of the KEEP intervention generalize to more than one child in the same home, and (c) examine the effectiveness of the KEEP intervention in reducing parental stress associated with child behavior problems. The data from 335 foster and kinship families with children between the ages of 5 and 12 years were analyzed to address these objectives. Families were randomly assigned to the intervention or control condition. The results indicated that the KEEP intervention was effective in reducing child behavior problems when delivered by a community agency. These results expanded prior research on the KEEP intervention, revealing that the intervention was effective in reducing behavior problems of more than one child in the same household and in reducing parental stress levels associated with the behavioral issues of the focal child. Thus, the KEEP intervention model holds promise for reducing the behavior problems of children in foster care and reducing stress levels of foster and kinship caregivers as it is disseminated and implemented within similar child welfare settings. PMID:25418812

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

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.

Pre-Service Teacher Scientific Behavior: Comparative Study of Paired Science Project Assignments

ERIC Educational Resources Information Center

Bulunuz, Mizrap; Tapan Broutin, Menekse Seden; Bulunuz, Nermin

2016-01-01

Problem Statement: University students usually lack the skills to rigorously define a multi-dimensional real-life problem and its limitations in an explicit, clear and testable way, which prevents them from forming a reliable method, obtaining relevant results and making balanced judgments to solve a problem. Purpose of the Study: The study…

A Randomized Trial of Brief Interventions for Problem and Pathological Gamblers

ERIC Educational Resources Information Center

Petry, Nancy M.; Weinstock, Jeremiah; Ledgerwood, David M.; Morasco, Benjamin

2008-01-01

Limited research exists regarding methods for reducing problem gambling. Problem gamblers (N = 180) were randomly assigned to assessment only control, 10 min of brief advice, 1 session of motivational enhancement therapy (MET), or 1 session of MET plus 3 sessions of cognitive-behavioral therapy. Gambling was assessed at baseline, at 6 weeks, and…

Can Short Duration Visual Cues Influence Students' Reasoning and Eye Movements in Physics Problems?

ERIC Educational Resources Information Center

Madsen, Adrian; Rouinfar, Amy; Larson, Adam M.; Loschky, Lester C.; Rebello, N. Sanjay

2013-01-01

We investigate the effects of visual cueing on students' eye movements and reasoning on introductory physics problems with diagrams. Participants in our study were randomly assigned to either the cued or noncued conditions, which differed by whether the participants saw conceptual physics problems overlaid with dynamic visual cues. Students in the…

Writing for Business: A Graduate-Level Course in Problem-Solving

ERIC Educational Resources Information Center

Seifert, Christine

2009-01-01

This paper details an assignment sequence that requires graduate students in an applied communication program to identify problems that clients may not be aware of. Good writing and good problem-solving are "inextricably linked to [a student's] ability to frame an issue, gather, and analyze information, and to structure a helpful response" (Musso,…

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.

Two-MILP models for scheduling elective surgeries within a private healthcare facility.

PubMed

Khlif Hachicha, Hejer; Zeghal Mansour, Farah

2016-11-05

This paper deals with an Integrated Elective Surgery-Scheduling Problem (IESSP) that arises in a privately operated healthcare facility. It aims to optimize the resource utilization of the entire surgery process including pre-operative, per-operative and post-operative activities. Moreover, it addresses a specific feature of private facilities where surgeons are independent service providers and may conduct their surgeries in different private healthcare facilities. Thus, the problem requires the assignment of surgery patients to hospital beds, operating rooms and recovery beds as well as their sequencing over a 1-day period while taking into account surgeons' availability constraints. We present two Mixed Integer Linear Programs (MILP) that model the IESSP as a three-stage hybrid flow-shop scheduling problem with recirculation, resource synchronization, dedicated machines, and blocking constraints. To assess the empirical performance of the proposed models, we conducted experiments on real-world data of a Tunisian private clinic: Clinique Ennasr and on randomly generated instances. Two criteria were minimised: the patients' average length of stay and the number of patients' overnight stays. The computational results show that the proposed models can solve instances with up to 44 surgical cases in a reasonable CPU time using a general-purpose MILP solver.

Effectiveness evaluation of the Positive Family Support intervention: A three-tiered public health delivery model for middle schools.

PubMed

Smolkowski, Keith; Seeley, John R; Gau, Jeffery M; Dishion, Tom J; Stormshak, Elizabeth A; Moore, Kevin J; Falkenstein, Corrina A; Fosco, Gregory M; Garbacz, S Andrew

2017-06-01

This article presents the results of an evaluation of Positive Family Support, an ecological family intervention and treatment approach to parent supports and family management training developed from a history of basic and translational research. This effectiveness trial, with 41 public middle schools randomly assigned to intervention or control, examined student-, teacher-, and parent-reported outcomes, as well as math and reading scores and school attendance. Multilevel analyses suggested that for students at risk for behavior problems, immediate-intervention schools outperformed control schools on parent-reported negative school contacts for students at risk for behavior problems. Implementation, however, was hampered by several challenges, including school funding cuts, lack of staff time to provide parenting supports, and staff turnover. Given that preventive interventions are generally cost effective, it is critical that researchers continue their efforts to refine these interventions and find ways to support schools' implementation of evidence-based programs that can reduce problem behavior. This article is part of a special issue "Parental Engagement in School-Based Interventions". Copyright © 2017 Society for the Study of School Psychology. Published by Elsevier Ltd. All rights reserved.

Harnessing the Bethe free energy†

PubMed Central

Bapst, Victor

2016-01-01

ABSTRACT A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few variables and either encourage or discourage certain value combinations. Examples include the k‐SAT problem or the Ising model. Such models naturally induce a Gibbs measure on the set of assignments, which is characterised by its partition function. The present paper deals with the partition function of problems where the interactions between variables and constraints are induced by a sparse random (hyper)graph. According to physics predictions, a generic recipe called the “replica symmetric cavity method” yields the correct value of the partition function if the underlying model enjoys certain properties [Krzkala et al., PNAS (2007) 10318–10323]. Guided by this conjecture, we prove general sufficient conditions for the success of the cavity method. The proofs are based on a “regularity lemma” for probability measures on sets of the form Ωn for a finite Ω and a large n that may be of independent interest. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 694–741, 2016 PMID:28035178

Teaching cross-cultural communication skills online: a multi-method evaluation.

PubMed

Lee, Amy L; Mader, Emily M; Morley, Christopher P

2015-04-01

Cultural competency education is an important and required part of undergraduate medical education. The objective of this study was to evaluate whether an online cross-cultural communication module could increase student use of cross-cultural communication questions that assess the patient's definition of the problem, the way the problem affects their life, their concerns about the problem, and what the treatment should be (PACT). We used multi-method assessment of students assigned to family medicine clerkship blocks that were randomized to receive online cultural competency and PACT training added to their standard curriculum or to a control group receiving the standard curriculum only. Outcomes included comparison, via analysis of variance, of number of PACT questions used during an observed Standardized Patient Exercise, end-of-year OSCE scores, and qualitative analysis of student narratives. Students (n=119) who participated in the online module (n=60) demonstrated increased use of cross-cultural communication PACT questions compared to the control group (n=59) and generally had positive themes emerge from their reflective writing. The module had the biggest impact on students who later went on to match in high communication specialties. Online teaching of cross-cultural communication skills can be effective at changing medical student behavior.

46 CFR 310.59 - Courses of instruction.

Code of Federal Regulations, 2011 CFR

2011-10-01

... science courses prescribed by the Department of the Navy. All curriculums include general education... Academy. Three major curriculums are offered: Nautical Science, for the preparation of deck officers... addition to practical shipboard assignments, midshipmen are required to complete written study assignments...

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

28 CFR 0.164 - Civil claims that may be closed by Assistant Attorneys General.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Assistant Attorneys General. 0.164 Section 0.164 Judicial Administration DEPARTMENT OF JUSTICE ORGANIZATION... General. Assistant Attorneys General are authorized, with respect to matters assigned to their respective... proposed closing should receive the personal attention of the Attorney General, the Deputy Attorney General...

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

Using Public Speaking and Critical Thinking To Increase Self-Esteem in the Multi-Cultural College Prep Composition Classroom.

ERIC Educational Resources Information Center

Weissberg, Michael W.

In an effort to improve the writing performance of non-native English-speaking students in a college preparatory composition course, a project was undertaken to reduce problems of self-esteem caused by communication apprehension through a speech assignment involving critical thinking and peer reviews. To evaluate the effect of the assignment, the…

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

An Alternative Optimization Model and Robust Experimental Design for the Assignment Scheduling Capability for Unmanned Aerial Vehicles (ASC-U) Simulation

DTIC Science & Technology

2007-06-01

introduces ASC-U’s approach for solving the dynamic UAV allocation problem. 26 Christopher J...18 Figure 6. Assignments Dynamics Example (after) .........................................................20 Figure 7. ASC-U Dynamic Cueing...decisions in order to respond to the dynamic environment they face. Thus, to succeed, the Army’s transformation cannot rely

Psychological functioning in adolescents referred to specialist gender identity clinics across Europe: a clinical comparison study between four clinics.

PubMed

de Graaf, Nastasja M; Cohen-Kettenis, Peggy T; Carmichael, Polly; de Vries, Annelou L C; Dhondt, Karlien; Laridaen, Jolien; Pauli, Dagmar; Ball, Juliane; Steensma, Thomas D

2018-07-01

Adolescents seeking professional help with their gender identity development often present with psychological difficulties. Existing literature on psychological functioning of gender diverse young people is limited and mostly bound to national chart reviews. This study examined the prevalence of psychological functioning and peer relationship problems in adolescents across four European specialist gender services (The Netherlands, Belgium, the UK, and Switzerland), using the Child Behavioural Checklist (CBCL) and the Youth Self-Report (YSR). Differences in psychological functioning and peer relationships were found in gender diverse adolescents across Europe. Overall, emotional and behavioural problems and peer relationship problems were most prevalent in adolescents from the UK, followed by Switzerland and Belgium. The least behavioural and emotional problems and peer relationship problems were reported by adolescents from The Netherlands. Across the four clinics, a similar pattern of gender differences was found. Birth-assigned girls showed more behavioural problems and externalising problems in the clinical range, as reported by their parents. According to self-report, internalising problems in the clinical range were more prevalent in adolescent birth-assigned boys. More research is needed to gain a better understanding of the difference in clinical presentations in gender diverse adolescents and to investigate what contextual factors that may contribute to this.

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.

Linear-time reconstruction of zero-recombinant Mendelian inheritance on pedigrees without mating loops.

PubMed

Liu, Lan; Jiang, Tao

2007-01-01

With the launch of the international HapMap project, the haplotype inference problem has attracted a great deal of attention in the computational biology community recently. In this paper, we study the question of how to efficiently infer haplotypes from genotypes of individuals related by a pedigree without mating loops, assuming that the hereditary process was free of mutations (i.e. the Mendelian law of inheritance) and recombinants. We model the haplotype inference problem as a system of linear equations as in [10] and present an (optimal) linear-time (i.e. O(mn) time) algorithm to generate a particular solution (A particular solution of any linear system is an assignment of numerical values to the variables in the system which satisfies the equations in the system.) to the haplotype inference problem, where m is the number of loci (or markers) in a genotype and n is the number of individuals in the pedigree. Moreover, the algorithm also provides a general solution (A general solution of any linear system is denoted by the span of a basis in the solution space to its associated homogeneous system, offset from the origin by a vector, namely by any particular solution. A general solution for ZRHC is very useful in practice because it allows the end user to efficiently enumerate all solutions for ZRHC and performs tasks such as random sampling.) in O(mn2) time, which is optimal because the size of a general solution could be as large as Theta(mn2). The key ingredients of our construction are (i) a fast consistency checking procedure for the system of linear equations introduced in [10] based on a careful investigation of the relationship between the equations (ii) a novel linear-time method for solving linear equations without invoking the Gaussian elimination method. Although such a fast method for solving equations is not known for general systems of linear equations, we take advantage of the underlying loop-free pedigree graph and some special properties of the linear equations.

48 CFR 227.7009 - Patent releases, license agreements, and assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Patent releases, license agreements, and assignments. 227.7009 Section 227.7009 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE GENERAL CONTRACTING REQUIREMENTS PATENTS, DATA, AND...

48 CFR 227.7009 - Patent releases, license agreements, and assignments.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 48 Federal Acquisition Regulations System 3 2011-10-01 2011-10-01 false Patent releases, license agreements, and assignments. 227.7009 Section 227.7009 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE GENERAL CONTRACTING REQUIREMENTS PATENTS, DATA, AND...

48 CFR 227.7009 - Patent releases, license agreements, and assignments.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 48 Federal Acquisition Regulations System 3 2014-10-01 2014-10-01 false Patent releases, license agreements, and assignments. 227.7009 Section 227.7009 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE GENERAL CONTRACTING REQUIREMENTS PATENTS, DATA, AND...

48 CFR 227.7009 - Patent releases, license agreements, and assignments.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 48 Federal Acquisition Regulations System 3 2013-10-01 2013-10-01 false Patent releases, license agreements, and assignments. 227.7009 Section 227.7009 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE GENERAL CONTRACTING REQUIREMENTS PATENTS, DATA, AND...

48 CFR 227.7009 - Patent releases, license agreements, and assignments.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 48 Federal Acquisition Regulations System 3 2012-10-01 2012-10-01 false Patent releases, license... ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE GENERAL CONTRACTING REQUIREMENTS PATENTS, DATA, AND COPYRIGHTS Infringement Claims, Licenses, and Assignments 227.7009 Patent releases, license agreements, and...

Engineering calculations for communications satellite systems planning

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Levis, C. A.; Mount-Campbell, C.; Gonsalvez, D. J.; Wang, C. W.; Yamamura, Y.

1985-01-01

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

About approximation of integer factorization problem by the combination fixed-point iteration method and Bayesian rounding for quantum cryptography

NASA Astrophysics Data System (ADS)

Ogorodnikov, Yuri; Khachay, Michael; Pljonkin, Anton

2018-04-01

We describe the possibility of employing the special case of the 3-SAT problem stemming from the well known integer factorization problem for the quantum cryptography. It is known, that for every instance of our 3-SAT setting the given 3-CNF is satisfiable by a unique truth assignment, and the goal is to find this assignment. Since the complexity status of the factorization problem is still undefined, development of approximation algorithms and heuristics adopts interest of numerous researchers. One of promising approaches to construction of approximation techniques is based on real-valued relaxation of the given 3-CNF followed by minimizing of the appropriate differentiable loss function, and subsequent rounding of the fractional minimizer obtained. Actually, algorithms developed this way differ by the rounding scheme applied on their final stage. We propose a new rounding scheme based on Bayesian learning. The article shows that the proposed method can be used to determine the security in quantum key distribution systems. In the quantum distribution the Shannon rules is applied and the factorization problem is paramount when decrypting secret keys.

Development of occupational exposure limits for the Hanford tank farms.

PubMed

Still, Kenneth R; Gardner, Donald E; Snyder, Robert; Anderson, Thomas J; Honeyman, James O; Timchalk, Charles

2010-04-01

Production of plutonium for the United States' nuclear weapons program from the 1940s to the 1980s generated 53 million gallons of radioactive chemical waste, which is stored in 177 underground tanks at the Hanford site in southeastern Washington State. Recent attempts to begin the retrieval and treatment of these wastes require moving the waste to more modern tanks and result in potential exposure of the workers to unfamiliar odors emanating from headspace in the tanks. Given the unknown risks involved, workers were placed on supplied air respiratory protection. CH2MHILL, the managers of the Hanford site tank farms, asked an Independent Toxicology Panel (ITP) to assist them in issues relating to an industrial hygiene and risk assessment problem. The ITP was called upon to help determine the risk of exposure to vapors from the tanks, and in general develop a strategy for solution of the problem. This paper presents the methods used to determine the chemicals of potential concern (COPCs) and the resultant development of screening values and Acceptable Occupational Exposure Limits (AOELs) for these COPCs. A total of 1826 chemicals were inventoried and evaluated. Over 1500 chemicals were identified in the waste tanks headspaces and more than 600 of these were assigned screening values; 72 of these compounds were recommended for AOEL development. Included in this list of 72 were 57 COPCs identified by the ITP and of these 47 were subsequently assigned AOELs. An exhaustive exposure assessment strategy was developed by the CH2MHILL industrial hygiene department to evaluate these COPCs.

Decision support for hospital bed management using adaptable individual length of stay estimations and shared resources

PubMed Central

2013-01-01

Background Elective patient admission and assignment planning is an important task of the strategic and operational management of a hospital and early on became a central topic of clinical operations research. The management of hospital beds is an important subtask. Various approaches have been proposed, involving the computation of efficient assignments with regard to the patients’ condition, the necessity of the treatment, and the patients’ preferences. However, these approaches are mostly based on static, unadaptable estimates of the length of stay and, thus, do not take into account the uncertainty of the patient’s recovery. Furthermore, the effect of aggregated bed capacities have not been investigated in this context. Computer supported bed management, combining an adaptable length of stay estimation with the treatment of shared resources (aggregated bed capacities) has not yet been sufficiently investigated. The aim of our work is: 1) to define a cost function for patient admission taking into account adaptable length of stay estimations and aggregated resources, 2) to define a mathematical program formally modeling the assignment problem and an architecture for decision support, 3) to investigate four algorithmic methodologies addressing the assignment problem and one base-line approach, and 4) to evaluate these methodologies w.r.t. cost outcome, performance, and dismissal ratio. Methods The expected free ward capacity is calculated based on individual length of stay estimates, introducing Bernoulli distributed random variables for the ward occupation states and approximating the probability densities. The assignment problem is represented as a binary integer program. Four strategies for solving the problem are applied and compared: an exact approach, using the mixed integer programming solver SCIP; and three heuristic strategies, namely the longest expected processing time, the shortest expected processing time, and random choice. A baseline approach serves to compare these optimization strategies with a simple model of the status quo. All the approaches are evaluated by a realistic discrete event simulation: the outcomes are the ratio of successful assignments and dismissals, the computation time, and the model’s cost factors. Results A discrete event simulation of 226,000 cases shows a reduction of the dismissal rate compared to the baseline by more than 30 percentage points (from a mean dismissal ratio of 74.7% to 40.06% comparing the status quo with the optimization strategies). Each of the optimization strategies leads to an improved assignment. The exact approach has only a marginal advantage over the heuristic strategies in the model’s cost factors (≤3%). Moreover,this marginal advantage was only achieved at the price of a computational time fifty times that of the heuristic models (an average computing time of 141 s using the exact method, vs. 2.6 s for the heuristic strategy). Conclusions In terms of its performance and the quality of its solution, the heuristic strategy RAND is the preferred method for bed assignment in the case of shared resources. Future research is needed to investigate whether an equally marked improvement can be achieved in a large scale clinical application study, ideally one comprising all the departments involved in admission and assignment planning. PMID:23289448

Decision support for hospital bed management using adaptable individual length of stay estimations and shared resources.

PubMed

Schmidt, Robert; Geisler, Sandra; Spreckelsen, Cord

2013-01-07

Elective patient admission and assignment planning is an important task of the strategic and operational management of a hospital and early on became a central topic of clinical operations research. The management of hospital beds is an important subtask. Various approaches have been proposed, involving the computation of efficient assignments with regard to the patients' condition, the necessity of the treatment, and the patients' preferences. However, these approaches are mostly based on static, unadaptable estimates of the length of stay and, thus, do not take into account the uncertainty of the patient's recovery. Furthermore, the effect of aggregated bed capacities have not been investigated in this context. Computer supported bed management, combining an adaptable length of stay estimation with the treatment of shared resources (aggregated bed capacities) has not yet been sufficiently investigated. The aim of our work is: 1) to define a cost function for patient admission taking into account adaptable length of stay estimations and aggregated resources, 2) to define a mathematical program formally modeling the assignment problem and an architecture for decision support, 3) to investigate four algorithmic methodologies addressing the assignment problem and one base-line approach, and 4) to evaluate these methodologies w.r.t. cost outcome, performance, and dismissal ratio. The expected free ward capacity is calculated based on individual length of stay estimates, introducing Bernoulli distributed random variables for the ward occupation states and approximating the probability densities. The assignment problem is represented as a binary integer program. Four strategies for solving the problem are applied and compared: an exact approach, using the mixed integer programming solver SCIP; and three heuristic strategies, namely the longest expected processing time, the shortest expected processing time, and random choice. A baseline approach serves to compare these optimization strategies with a simple model of the status quo. All the approaches are evaluated by a realistic discrete event simulation: the outcomes are the ratio of successful assignments and dismissals, the computation time, and the model's cost factors. A discrete event simulation of 226,000 cases shows a reduction of the dismissal rate compared to the baseline by more than 30 percentage points (from a mean dismissal ratio of 74.7% to 40.06% comparing the status quo with the optimization strategies). Each of the optimization strategies leads to an improved assignment. The exact approach has only a marginal advantage over the heuristic strategies in the model's cost factors (≤3%). Moreover,this marginal advantage was only achieved at the price of a computational time fifty times that of the heuristic models (an average computing time of 141 s using the exact method, vs. 2.6 s for the heuristic strategy). In terms of its performance and the quality of its solution, the heuristic strategy RAND is the preferred method for bed assignment in the case of shared resources. Future research is needed to investigate whether an equally marked improvement can be achieved in a large scale clinical application study, ideally one comprising all the departments involved in admission and assignment planning.

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.

The Transitory Phase to the Attainment of Self-Regulatory Skill in Mathematical Problem Solving

ERIC Educational Resources Information Center

Lazakidou, G.; Paraskeva, F.; Retalis, S.

2007-01-01

Three phases of development of self-regulatory skill in the domain of mathematical problem solving were designed to examine students' behaviour and the effects on their problem solving ability. Forty-eight Grade 4 students (10 year olds) participated in this pilot study. The students were randomly assigned to one of three groups, each representing…

Effect of Computer-Presented Organizational/Memory Aids on Problem Solving Behavior.

ERIC Educational Resources Information Center

Steinberg, Esther R.; And Others

This research studied the effects of computer-presented organizational/memory aids on problem solving behavior. The aids were either matrix or verbal charts shown on the display screen next to the problem. The 104 college student subjects were randomly assigned to one of the four conditions: type of chart (matrix or verbal chart) and use of charts…

The Roles of Women in the Army and Their Impact on Military Operations and Organizations.

ERIC Educational Resources Information Center

Batts, John H.; And Others

Problems inherent in the expanded utilization of female soldiers in the U.S. Army are numerous. Attitudes of a wide sample of Army personnel, men and women, enlisted and officer, were surveyed pertaining to those problems. Some problems such as uniforms, billeting, assignments, and training are obvious and with proper planning can and will be…

Using Educational Data Mining Methods to Assess Field-Dependent and Field-Independent Learners' Complex Problem Solving

ERIC Educational Resources Information Center

Angeli, Charoula; Valanides, Nicos

2013-01-01

The present study investigated the problem-solving performance of 101 university students and their interactions with a computer modeling tool in order to solve a complex problem. Based on their performance on the hidden figures test, students were assigned to three groups of field-dependent (FD), field-mixed (FM), and field-independent (FI)…

Work, Productivity, and Human Performance: Practical Case Studies in Ergonomics, Human Factors and Human Engineering.

ERIC Educational Resources Information Center

Fraser, T. M.; Pityn, P. J.

This book contains 12 case histories, each based on a real-life problem, that show how a manager can use common sense, knowledge, and interpersonal skills to solve problems in human performance at work. Each case study describes a worker's problem and provides background information and an assignment; solutions are suggested. The following cases…

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.

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

19 CFR 146.3 - Customs supervision.

Code of Federal Regulations, 2010 CFR

2010-04-01

... (CONTINUED) FOREIGN TRADE ZONES General Provisions § 146.3 Customs supervision. (a) Assignment of Customs officers. Customs officers will be assigned or detailed to a zone as necessary to maintain appropriate Customs supervision of merchandise and records pertaining thereto in the zone, and to protect the revenue...

19 CFR 146.3 - Customs supervision.

Code of Federal Regulations, 2014 CFR

2014-04-01

... (CONTINUED) FOREIGN TRADE ZONES General Provisions § 146.3 Customs supervision. (a) Assignment of Customs officers. Customs officers will be assigned or detailed to a zone as necessary to maintain appropriate Customs supervision of merchandise and records pertaining thereto in the zone, and to protect the revenue...

19 CFR 146.3 - Customs supervision.

Code of Federal Regulations, 2011 CFR

2011-04-01

... (CONTINUED) FOREIGN TRADE ZONES General Provisions § 146.3 Customs supervision. (a) Assignment of Customs officers. Customs officers will be assigned or detailed to a zone as necessary to maintain appropriate Customs supervision of merchandise and records pertaining thereto in the zone, and to protect the revenue...

19 CFR 146.3 - Customs supervision.

Code of Federal Regulations, 2013 CFR

2013-04-01

... (CONTINUED) FOREIGN TRADE ZONES General Provisions § 146.3 Customs supervision. (a) Assignment of Customs officers. Customs officers will be assigned or detailed to a zone as necessary to maintain appropriate Customs supervision of merchandise and records pertaining thereto in the zone, and to protect the revenue...

19 CFR 146.3 - Customs supervision.

Code of Federal Regulations, 2012 CFR

2012-04-01

... (CONTINUED) FOREIGN TRADE ZONES General Provisions § 146.3 Customs supervision. (a) Assignment of Customs officers. Customs officers will be assigned or detailed to a zone as necessary to maintain appropriate Customs supervision of merchandise and records pertaining thereto in the zone, and to protect the revenue...

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.

The evolving market structures of gambling: case studies modelling the socioeconomic assignment of gaming machines in Melbourne and Sydney, Australia.

PubMed

Marshall, David C; Baker, Robert G V

2002-01-01

The expansion of gambling industries worldwide is intertwined with the growing government dependence on gambling revenue for fiscal assignments. In Australia, electronic gaming machines (EGMs) have dominated recent gambling industry growth. As EGMs have proliferated, growing recognition has emerged that EGM distribution closely reflects levels of socioeconomic disadvantage. More machines are located in less advantaged regions. This paper analyses time-series socioeconomic distributions of EGMs in Melbourne, Australia, an immature EGM market, and then compares the findings with the mature market in Sydney. Similar findings in both cities suggest that market assignment of EGMs transcends differences in historical and legislative environments. This indicates that similar underlying structures are evident in both markets. Modelling the spatial structures of gambling markets provides an opportunity to identify regions most at risk of gambling related problems. Subsequently, policies can be formulated which ensure fiscal revenue from gambling can be better targeted towards regions likely to be most afflicted by excessive gambling-related problems.

On the stabilizability of multivariable systems by minimum order compensation

NASA Technical Reports Server (NTRS)

Byrnes, C. I.; Anderson, B. D. O.

1983-01-01

In this paper, a derivation is provided of the necessary condition, mp equal to or greater than n, for stabilizability by constant gain feedback of the generic degree n, p x m system. This follows from another of the main results, which asserts that generic stabilizability is equivalent to generic solvability of a deadbeat control problem, provided mp equal to or less than n. Taken together, these conclusions make it possible to make some sharp statements concerning minimum order stabilization. The techniques are primarily drawn from decision algebra and classical algebraic geometry and have additional consequences for problems of stabilizability and pole-assignability. Among these are the decidability (by a Sturm test) of the equivalence of generic pole-assignability and generic stabilizability, the semi-algebraic nature of the minimum order, q, of a stabilizing compensator, and the nonexistence of formulae involving rational operations and extraction of square roots for pole-assigning gains when they exist, answering in the negative a question raised by Anderson, Bose, and Jury (1975).

Design of a Software Configuration for Real-Time Multimedia Group Communication; HNUMTP

NASA Astrophysics Data System (ADS)

Park, Gil-Cheol

This paper designs transport protocol of multi-session/channel method for real time multimedia group telecommunication and realizes it. The special features of the designed and realized protocol are first, that it solved the sync problem which is the specific character of multimedia telecommunication by using multi-channel method protocol. Usual multimedia telecommunication is assigned one channel by each media data. This paper shortened the phenomenon that waits data for sync of receiving part by assigning more than one channel for the channel that has a lot of data per hour as video data. The problem of intermedia synchronization that happens then could be solved by sending temporal/spacial related data among data assigning extra control channel. Second, that it does integrated management for sessions. Each session is one group telecommunication unit which supports mutual working environment that is independent. Each session communicates the participants in the group independently, the session manager manages all the communication among groups and lets media sources connected with all network be operated efficiently.

Support of NASA quality requirements by defense contract administration services regions

NASA Technical Reports Server (NTRS)

Farrar, Hiram D.

1966-01-01

Defense Contract Administration Services Regions (DCASR) quality assurance personnel performing under NASA Letters of Delegation must work closely with the assigned technical representative of the NASA centers. It is realized that technical personnel from the NASA Centers cannot make on-site visits as frequently as they would like to. However, DCASR quality assurance personnel would know the assigned NASA technical representative and should contact him when problems arise. The technical representative is the expert on the hardware and should be consulted on any problem area. It is important that the DCASR quality assurance personnel recommend to the delegating NASA Center any new or improved methods of which they may be aware which would assist in achieving the desired quality and reliability in NASA hardware. NASA expects assignment of competent personnel in the Quality Assurance functional area and is not only buying the individual's technical skill, but also his experience. Suggestions by field personnel can many times up-grade the quality or the hardware.

Analysis of an Air Conditioning Coolant Solution for Metal Contamination Using Atomic Absorption Spectroscopy: An Undergraduate Instrumental Analysis Exercise Simulating an Industrial Assignment

ERIC Educational Resources Information Center

Baird, Michael J.

2004-01-01

A real-life analytical assignment is presented to students, who had to examine an air conditioning coolant solution for metal contamination using an atomic absorption spectroscopy (AAS). This hands-on access to a real problem exposed the undergraduate students to the mechanism of AAS, and promoted participation in a simulated industrial activity.

Assignment Scheduling Capability for Unmanned Aerial Vehicles - A Discrete Event Simulation with Optimization in the Loop Approach to Solving a Scheduling Problem

DTIC Science & Technology

2006-12-01

APPROACH As mentioned previously, ASCU does not use simulation in the traditional manner. Instead, it uses simulation to transition and capture the state...0 otherwise (by a heuristic discussed below). • Let cja = The reward for a UAV with sensor pack- age j being assigned to mission area a from the

Using Problem-Based Learning with Large Groups.

ERIC Educational Resources Information Center

Buzzelli, Andrew R.

1994-01-01

At the Pennsylvania College of Optometry, a core course in pediatric optometry was revised to use a problem-centered approach and implemented with a class of 147 students. Students were assigned specific roles to distribute work evenly. A survey found students responded positively to this approach. (MSE)

Method for protein structure alignment

DOEpatents

Blankenbecler, Richard; Ohlsson, Mattias; Peterson, Carsten; Ringner, Markus

2005-02-22

This invention provides a method for protein structure alignment. More particularly, the present invention provides a method for identification, classification and prediction of protein structures. The present invention involves two key ingredients. First, an energy or cost function formulation of the problem simultaneously in terms of binary (Potts) assignment variables and real-valued atomic coordinates. Second, a minimization of the energy or cost function by an iterative method, where in each iteration (1) a mean field method is employed for the assignment variables and (2) exact rotation and/or translation of atomic coordinates is performed, weighted with the corresponding assignment variables.

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.

Distributed Method to Optimal Profile Descent

NASA Astrophysics Data System (ADS)

Kim, Geun I.

Current ground automation tools for Optimal Profile Descent (OPD) procedures utilize path stretching and speed profile change to maintain proper merging and spacing requirements at high traffic terminal area. However, low predictability of aircraft's vertical profile and path deviation during decent add uncertainty to computing estimated time of arrival, a key information that enables the ground control center to manage airspace traffic effectively. This paper uses an OPD procedure that is based on a constant flight path angle to increase the predictability of the vertical profile and defines an OPD optimization problem that uses both path stretching and speed profile change while largely maintaining the original OPD procedure. This problem minimizes the cumulative cost of performing OPD procedures for a group of aircraft by assigning a time cost function to each aircraft and a separation cost function to a pair of aircraft. The OPD optimization problem is then solved in a decentralized manner using dual decomposition techniques under inter-aircraft ADS-B mechanism. This method divides the optimization problem into more manageable sub-problems which are then distributed to the group of aircraft. Each aircraft solves its assigned sub-problem and communicate the solutions to other aircraft in an iterative process until an optimal solution is achieved thus decentralizing the computation of the optimization problem.

Convex central configurations for the n-body problem

NASA Astrophysics Data System (ADS)

Xia, Zhihong

We give a simple proof of a classical result of MacMillan and Bartky (Trans. Amer. Math. Soc. 34 (1932) 838) which states that, for any four positive masses and any assigned order, there is a convex planar central configuration. Moreover, we show that the central configurations we find correspond to local minima of the potential function with fixed moment of inertia. This allows us to show that there are at least six local minimum central configurations for the planar four-body problem. We also show that for any assigned order of five masses, there is at least one convex spatial central configuration of local minimum type. Our method also applies to some other cases.

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.

PLA realizations for VLSI state machines

NASA Technical Reports Server (NTRS)

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

1990-01-01

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

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

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.

True and Quasi-Experimental Designs. ERIC/AE Digest.

ERIC Educational Resources Information Center

Gribbons, Barry; Herman, Joan

Among the different types of experimental design are two general categories: true experimental designs and quasi- experimental designs. True experimental designs include more than one purposively created group, common measured outcomes, and random assignment. Quasi-experimental designs are commonly used when random assignment is not practical or…

33 CFR 5.33 - Training, examination, and assignment.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Training, examination, and... GENERAL COAST GUARD AUXILIARY § 5.33 Training, examination, and assignment. The Commandant will prescribe the type of training, qualifications and examinations required before a member of the Auxiliary shall...

45 CFR 2551.12 - Definitions.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SENIOR COMPANION PROGRAM General § 2551.12 Definitions. (a) Act. The Domestic Volunteer Service Act of...-home. The non-institutional assignment of a Senior Companion in a private residence. (i) Letter of... legally responsible for that adult. It authorizes the assignment of a Senior Companion in the clients home...

32 CFR 776.4 - Attorney-client relationships.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 5 2011-07-01 2011-07-01 false Attorney-client relationships. 776.4 Section 776... General § 776.4 Attorney-client relationships. (a) The executive agency to which assigned (DON in most... will not establish attorney-client relationships with any individual unless detailed, assigned, or...