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

PubMed

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

2014-01-01

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

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

PubMed Central

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

2013-01-01

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

Proceedings of the Air Power Symposium on the Role of Airpower in Low Intensity Conflict (9th) Held at Maxwell AFB, Alabama on 11-13 March 1985. Appendix 3. Symposium Papers,

DTIC Science & Technology

1985-05-01

and internal security problems which represent the comtemporary disease. Nicaragua, under Somoza, was one such example. The Somoza family...he was assigned to the Armament * Division, Eglin APB, Florida. He completed a Master’s Degree in Business * Administration in 1983 and then

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

NASA Astrophysics Data System (ADS)

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

2018-07-01

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

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

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

Failure at the top: How power undermines collaborative performance.

PubMed

Hildreth, John Angus D; Anderson, Cameron

2016-02-01

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

Power factor of power educators. [Undergraduate and graduate programs

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

Barthold, L.O.

1979-01-01

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

Rate Adaptive Based Resource Allocation with Proportional Fairness Constraints in OFDMA Systems

PubMed Central

Yin, Zhendong; Zhuang, Shufeng; Wu, Zhilu; Ma, Bo

2015-01-01

Orthogonal frequency division multiple access (OFDMA), which is widely used in the wireless sensor networks, allows different users to obtain different subcarriers according to their subchannel gains. Therefore, how to assign subcarriers and power to different users to achieve a high system sum rate is an important research area in OFDMA systems. In this paper, the focus of study is on the rate adaptive (RA) based resource allocation with proportional fairness constraints. Since the resource allocation is a NP-hard and non-convex optimization problem, a new efficient resource allocation algorithm ACO-SPA is proposed, which combines ant colony optimization (ACO) and suboptimal power allocation (SPA). To reduce the computational complexity, the optimization problem of resource allocation in OFDMA systems is separated into two steps. For the first one, the ant colony optimization algorithm is performed to solve the subcarrier allocation. Then, the suboptimal power allocation algorithm is developed with strict proportional fairness, and the algorithm is based on the principle that the sums of power and the reciprocal of channel-to-noise ratio for each user in different subchannels are equal. To support it, plenty of simulation results are presented. In contrast with root-finding and linear methods, the proposed method provides better performance in solving the proportional resource allocation problem in OFDMA systems. PMID:26426016

A Development Testbed for ALPS-Based Systems

DTIC Science & Technology

1988-10-01

alloted to tile application because of size or power constraints). Given an underlying support ALPS architecture such as the d-ALPS architecture, a...resource on which it is assigned at runtime. A second representation problem is that most graph analysis algorithms treat either graphs with weighted links...subtask) associated with it but is treated like other links. In d-ALPS, as a priority precedence link, it would cause the binding of a pro- cessor: as a

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.

A Scenario-Based Parametric Analysis of Stable Marriage Approaches to the Army Officer Assignment Problem

DTIC Science & Technology

2017-03-23

solutions obtained through their proposed method to comparative instances of a generalized assignment problem with either ordinal cost components or... method flag: Designates the method by which the changed/ new assignment problem instance is solved. methodFlag = 0:SMAWarmstart Returns a matching...of randomized perturbations. We examine the contrasts between these methods in the context of assigning Army Officers among a set of identified

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

Achieving spectrum conservation for the minimum-span and minimum-order frequency assignment problems

NASA Technical Reports Server (NTRS)

Heyward, Ann O.

1992-01-01

Effective and efficient solutions of frequency assignment problems assumes increasing importance as the radiofrequency spectrum experiences ever increasing utilization by diverse communications services, requiring that the most efficient use of this resource be achieved. The research presented explores a general approach to the frequency assignment problem, in which such problems are categorized by the appropriate spectrum conserving objective function, and are each treated as an N-job, M-machine scheduling problem appropriate for the objective. Results obtained and presented illustrate that such an approach presents an effective means of achieving spectrum conserving frequency assignments for communications systems in a variety of environments.

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

PubMed

Fyfe, Emily R; Rittle-Johnson, Bethany

2016-07-01

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

Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment

PubMed Central

Karimzadehgan, Maryam; Zhai, ChengXiang

2011-01-01

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

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

47 CFR 74.786 - Digital channel assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

Performance improvement of optical CDMA networks with stochastic artificial bee colony optimization technique

NASA Astrophysics Data System (ADS)

Panda, Satyasen

2018-05-01

This paper proposes a modified artificial bee colony optimization (ABC) algorithm based on levy flight swarm intelligence referred as artificial bee colony levy flight stochastic walk (ABC-LFSW) optimization for optical code division multiple access (OCDMA) network. The ABC-LFSW algorithm is used to solve asset assignment problem based on signal to noise ratio (SNR) optimization in OCDM networks with quality of service constraints. The proposed optimization using ABC-LFSW algorithm provides methods for minimizing various noises and interferences, regulating the transmitted power and optimizing the network design for improving the power efficiency of the optical code path (OCP) from source node to destination node. In this regard, an optical system model is proposed for improving the network performance with optimized input parameters. The detailed discussion and simulation results based on transmitted power allocation and power efficiency of OCPs are included. The experimental results prove the superiority of the proposed network in terms of power efficiency and spectral efficiency in comparison to networks without any power allocation approach.

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.

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

PubMed

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

2016-01-01

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

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

PubMed Central

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

2016-01-01

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

Research and development studies for MHD/coal power flow train components. Technical progress report, 1 September 1979-31 August 1980

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

Bloom, M. H.

1980-01-01

The aim of this program is to contribute to certain facets of the development of the MHD/coal power system, and particularly the CDIF of DOE with regard to its flow train. Consideration is given specifically to the electrical power take-off, the diagnostic and instrumentation systems, the combustor and MHD channel technology, and electrode alternatives. Within the constraints of the program, high priorities were assigned to the problems of power take-off and the related characteristics of the MHD channel, and to the establishment of a non-intrusive, laser-based diagnostic system. The next priority was given to the combustor modeling and to amore » significantly improved analysis of particle combustion. Separate abstracts were prepared for nine of the ten papers included. One paper was previously included in the data base. (WHK)« less

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

[What hinders the political participation of women?].

PubMed

Ramirez, S

1994-06-01

Forty years after gaining the right to vote, Colombian women comprise scarcely 8% of persons recently elected to the Colombian Congress. At the municipal and departmental level, women occupy even fewer of the positions. Explanations of women's marginal political participation in terms of stereotypes such as their presumed disinterest or emotionalism reflect androcentric prejudices. Their lack of preparation and social conditioning is also a suspect argument, given that there are no objective forms of measuring preparation for political office, such as examinations or specific requirements. Centers for women's studies have sought explanation in terms of aspects of the social and political organization of society that impede access by women to positions of power. Laws assuring women their political rights have not been sufficient to allow them to participate under equal conditions. The assignment of responsibility for domestic labor exclusively to women is a powerful handicap to their full participation. Moreover, public life has become a costly career in terms of resources, time, and energy. The problem is not that women do not participate in politics, but that they are underrepresented in the centers of power. They comprise half of voters and the majority of members of community and civic associations dealing with problems of everyday life. But the number of women declines as the scale of power increases. Feminists suggest that the problem will not be solved by women assuming the behavior patterns of men. Rather, the governmental and civil elites must overcome norms and practices that perpetuate the subordination of women. Women achieving positions of power should maintain a gender perspective and assist in transforming conditions.

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

PubMed

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

2015-01-01

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

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.

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

NASA Astrophysics Data System (ADS)

Jiang, Wen; Wei, Boya

2018-02-01

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

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.

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.

Phylogenetic Relationships within the Opisthokonta Based on Phylogenomic Analyses of Conserved Single-Copy Protein Domains

PubMed Central

Torruella, Guifré; Derelle, Romain; Paps, Jordi; Lang, B. Franz; Roger, Andrew J.; Shalchian-Tabrizi, Kamran; Ruiz-Trillo, Iñaki

2012-01-01

Many of the eukaryotic phylogenomic analyses published to date were based on alignments of hundreds to thousands of genes. Frequently, in such analyses, the most realistic evolutionary models currently available are often used to minimize the impact of systematic error. However, controversy remains over whether or not idiosyncratic gene family dynamics (i.e., gene duplications and losses) and incorrect orthology assignments are always appropriately taken into account. In this paper, we present an innovative strategy for overcoming orthology assignment problems. Rather than identifying and eliminating genes with paralogy problems, we have constructed a data set comprised exclusively of conserved single-copy protein domains that, unlike most of the commonly used phylogenomic data sets, should be less confounded by orthology miss-assignments. To evaluate the power of this approach, we performed maximum likelihood and Bayesian analyses to infer the evolutionary relationships within the opisthokonts (which includes Metazoa, Fungi, and related unicellular lineages). We used this approach to test 1) whether Filasterea and Ichthyosporea form a clade, 2) the interrelationships of early-branching metazoans, and 3) the relationships among early-branching fungi. We also assessed the impact of some methods that are known to minimize systematic error, including reducing the distance between the outgroup and ingroup taxa or using the CAT evolutionary model. Overall, our analyses support the Filozoa hypothesis in which Ichthyosporea are the first holozoan lineage to emerge followed by Filasterea, Choanoflagellata, and Metazoa. Blastocladiomycota appears as a lineage separate from Chytridiomycota, although this result is not strongly supported. These results represent independent tests of previous phylogenetic hypotheses, highlighting the importance of sophisticated approaches for orthology assignment in phylogenomic analyses. PMID:21771718

Autonomous power expert system

NASA Technical Reports Server (NTRS)

Ringer, Mark J.; Quinn, Todd M.

1990-01-01

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

Autonomous power expert system

NASA Technical Reports Server (NTRS)

Ringer, Mark J.; Quinn, Todd M.

1990-01-01

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

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

Code of Federal Regulations, 2010 CFR

2010-10-01

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

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Oliker, Leonid; Sohn, Andrew

1996-01-01

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

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

PubMed

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

2017-07-01

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

Classifying with confidence from incomplete information.

DOE PAGES

Parrish, Nathan; Anderson, Hyrum S.; Gupta, Maya R.; ...

2013-12-01

For this paper, we consider the problem of classifying a test sample given incomplete information. This problem arises naturally when data about a test sample is collected over time, or when costs must be incurred to compute the classification features. For example, in a distributed sensor network only a fraction of the sensors may have reported measurements at a certain time, and additional time, power, and bandwidth is needed to collect the complete data to classify. A practical goal is to assign a class label as soon as enough data is available to make a good decision. We formalize thismore » goal through the notion of reliability—the probability that a label assigned given incomplete data would be the same as the label assigned given the complete data, and we propose a method to classify incomplete data only if some reliability threshold is met. Our approach models the complete data as a random variable whose distribution is dependent on the current incomplete data and the (complete) training data. The method differs from standard imputation strategies in that our focus is on determining the reliability of the classification decision, rather than just the class label. We show that the method provides useful reliability estimates of the correctness of the imputed class labels on a set of experiments on time-series data sets, where the goal is to classify the time-series as early as possible while still guaranteeing that the reliability threshold is met.« less

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.

Learning graph matching.

PubMed

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

2009-06-01

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

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

PubMed

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

2005-03-01

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

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…

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

ERIC Educational Resources Information Center

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

2015-01-01

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

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

DOEpatents

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

2013-02-05

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

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

DOEpatents

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

2012-10-23

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

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

ERIC Educational Resources Information Center

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

2014-01-01

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

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.

Method for assigning sites to projected generic nuclear power plants

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

Holter, G.M.; Purcell, W.L.; Shutz, M.E.

1986-07-01

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

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

18 CFR 301.7 - Average System Cost methodology functionalization.

Code of Federal Regulations, 2010 CFR

2010-04-01

... SYSTEM COST METHODOLOGY FOR SALES FROM UTILITIES TO BONNEVILLE POWER ADMINISTRATION UNDER NORTHWEST POWER... functionalization under its Direct Analysis assigns costs, revenues, debits or credits based upon the actual and/or...) Functionalization methods. (1) Direct analysis, if allowed or required by Table 1, assigns costs, revenues, debits...

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…

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

NASA Astrophysics Data System (ADS)

Gutin, Gregory; Kim, Eun Jung; Soleimanfallah, Arezou; Szeider, Stefan; Yeo, Anders

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given graph is bipartite with partition U ⊎ V, and each vertex in U is assigned the list {1}; this subproblem appears in the context of constraint programming as the consistency problem for the extended global cardinality constraint. We show that this subproblem is fixed-parameter tractable when parameterized by the size of the second partite set V. More generally, we show that the general factor problem for bipartite graphs, parameterized by |V |, is fixed-parameter tractable as long as all vertices in U are assigned lists of length 1, but becomes W[1]-hard if vertices in U are assigned lists of length at most 2. We establish fixed-parameter tractability by reducing the problem instance to a bounded number of acyclic instances, each of which can be solved in polynomial time by dynamic programming.

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.

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.

Principles for designing randomized preventive trials in mental health: an emerging developmental epidemiology paradigm.

PubMed

Brown, C H; Liao, J

1999-10-01

An emerging population-based paradigm is now being used to guide the design of preventive trials used to test developmental models. We discuss elements of the designs of several ongoing randomized preventive trials involving reduction of risk for children of divorce, for children who exhibit behavioral or learning problems, and for children whose parents are being treated for depression. To test developmental models using this paradigm, we introduce three classes of design issues: design for prerandomization, design for intervention, and design for postintervention. For each of these areas, we present quantitative results from power calculations. Both scientific and cost implications of these power calculations are discussed in terms of variation among subjects on preintervention measures, unit of intervention, assignment, balancing, number of pretest and posttest measures, and the examination of moderation effects.

An FDMA system concept for 30/20 GHz high capacity domestic satellite service

NASA Technical Reports Server (NTRS)

Berk, G.; Jean, P. N.; Rotholz, E.; White, B. E.

1982-01-01

The paper summarizes a feasibility study of a multibeam FDMA satellite system operating in the 30/20 GHz band. The system must accommodate a very high volume of traffic within the restrictions of a 5 kW solar cell array and a 2.5 GHz bandwidth. Multibeam satellite operation reduces the DC power demand and allows reuse of the available bandwidth. Interferences among the beams are brought to acceptable levels by appropriate frequency assignments. A transponder design is presented; it is greatly simplified by the application of a regional concept. System analysis shows that MSK modulation is appropriate for a high-capacity system because it conserves the frequency spectrum. Rain attenuation, a serious problem in this frequency band, is combatted with sufficient power margins and with coding. Link budgets, cost analysis, and weight and power calculations are also discussed. A satellite-routed FDMA system compares favorably in performance and cost with a satellite-switched TDMA system.

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

Self-organizing feature maps for dynamic control of radio resources in CDMA microcellular networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

1998-03-01

The application of artificial neural networks to the channel assignment problem for cellular code-division multiple access (CDMA) cellular networks has previously been investigated. CDMA takes advantage of voice activity and spatial isolation because its capacity is only interference limited, unlike time-division multiple access (TDMA) and frequency-division multiple access (FDMA) where capacities are bandwidth-limited. Any reduction in interference in CDMA translates linearly into increased capacity. To satisfy the high demands for new services and improved connectivity for mobile communications, microcellular and picocellular systems are being introduced. For these systems, there is a need to develop robust and efficient management procedures for the allocation of power and spectrum to maximize radio capacity. Topology-conserving mappings play an important role in the biological processing of sensory inputs. The same principles underlying Kohonen's self-organizing feature maps (SOFMs) are applied to the adaptive control of radio resources to minimize interference, hence, maximize capacity in direct-sequence (DS) CDMA networks. The approach based on SOFMs is applied to some published examples of both theoretical and empirical models of DS/CDMA microcellular networks in metropolitan areas. The results of the approach for these examples are informally compared to the performance of algorithms, based on Hopfield- Tank neural networks and on genetic algorithms, for the channel assignment problem.

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…

Assessing the Ability of Chloroplast and Nuclear DNA Gene Markers to Verify the Geographic Origin of Jatoba (Hymenaea courbaril L.) Timber.

PubMed

Chaves, Camila L; Degen, Bernd; Pakull, Birte; Mader, Malte; Honorio, Euridice; Ruas, Paulo; Tysklind, Niklas; Sebbenn, Alexandre M

2018-06-27

Deforestation-reinforced by illegal logging-is a serious problem in many tropical regions and causes pervasive environmental and economic damage. Existing laws that intend to reduce illegal logging need efficient, fraud resistant control methods. We developed a genetic reference database for Jatoba (Hymenaea courbaril), an important, high value timber species from the Neotropics. The data set can be used for controls on declarations of wood origin. Samples from 308 Hymenaea trees from 12 locations in Brazil, Bolivia, Peru, and French Guiana have been collected and genotyped on 10 nuclear microsatellites (nSSRs), 13 chloroplast SNPs (cpSNP), and 1 chloroplast indel marker. The chloroplast gene markers have been developed using Illumina DNA sequencing. Bayesian cluster analysis divided the individuals based on the nSSRs into 8 genetic groups. Using self-assignment tests, the power of the genetic reference database to judge on declarations on the location has been tested for 3 different assignment methods. We observed a strong genetic differentiation among locations leading to high and reliable self-assignment rates for the locations between 50% to 100% (average of 88%). Although all 3 assignment methods came up with similar mean self-assignment rates, there were differences for some locations linked to the level of genetic diversity, differentiation, and heterozygosity. Our results show that the nuclear and chloroplast gene markers are effective to be used for a genetic certification system and can provide national and international authorities with a robust tool to confirm legality of timber.

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.

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Oliker, Leonid; Sohn, Andrew

1996-01-01

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

VLSI neuroprocessors

NASA Technical Reports Server (NTRS)

Kemeny, Sabrina E.

1994-01-01

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques. The concurrent processing architectures developed are derived from a variety of advanced computing paradigms including neural network models, fuzzy logic, and cellular automata. Hardware implementation technologies range from state-of-the-art digital/analog custom-VLSI to advanced optoelectronic devices such as computer-generated holograms and e-beam fabricated Dammann gratings. JPL's concurrent processing devices group has developed a broad technology base in hardware implementable parallel algorithms, low-power and high-speed VLSI designs and building block VLSI chips, leading to application-specific high-performance embeddable processors. Application areas include high throughput map-data classification using feedforward neural networks, terrain based tactical movement planner using cellular automata, resource optimization (weapon-target assignment) using a multidimensional feedback network with lateral inhibition, and classification of rocks using an inner-product scheme on thematic mapper data. In addition to addressing specific functional needs of DOD and NASA, the JPL-developed concurrent processing device technology is also being customized for a variety of commercial applications (in collaboration with industrial partners), and is being transferred to U.S. industries. This viewgraph p resentation focuses on two application-specific processors which solve the computation intensive tasks of resource allocation (weapon-target assignment) and terrain based tactical movement planning using two extremely different topologies. Resource allocation is implemented as an asynchronous analog competitive assignment architecture inspired by the Hopfield network. Hardware realization leads to a two to four order of magnitude speed-up over conventional techniques and enables multiple assignments, (many to many), not achievable with standard statistical approaches. Tactical movement planning (finding the best path from A to B) is accomplished with a digital two-dimensional concurrent processor array. By exploiting the natural parallel decomposition of the problem in silicon, a four order of magnitude speed-up over optimized software approaches has been demonstrated.

Testing the Feasibility of a Briefer School-based Preventive Intervention with Aggressive Children: A Hybrid Intervention with Face-to-Face and Internet Components

PubMed Central

Lochman, John E.; Boxmeyer, Caroline L.; Jones, Shannon; Qu, Lixin; Ewoldsen, David; Nelson, W. Michael

2017-01-01

This study describes the results from a feasibility study of an innovative indicated prevention intervention with hybrid face-to-face and web-based components for preadolescent youth. This intervention includes a considerably briefer set of face-to-face sessions from the evidence-based Coping Power program and a carefully integrated internet component with practice and teaching activities and cartoon videos for children and for parents. The Coping Power — Internet Enhanced (CP-IE) program introduces a set of cognitive-behavioral skills in 12 small group sessions for children delivered during the school day and 7 group sessions for parents. Eight elementary schools were randomly assigned to CP-IE or to Control, and six children at each school were identified each year based on 4th grade teacher ratings of aggressive behavior. Path analyses of teacher-rated disruptive behavior outcomes for 91 fifth grade children, across two annual cohorts, indicated Control children had significantly greater increases in conduct problem behaviors across the 5th grade year than did CP-IE children. This much briefer version of Coping Power provided beneficial preventive effects on children’s behavior in the school setting similar to the effects of the longer version of Coping Power. The website materials appeared to successfully engage children, and parents’ use of the website predicted children’s changes in conduct problems across the year. PMID:28646974

Varieties of centralized intake: the Portland Target Cities Project experience.

PubMed

Barron, Nancy; McFarland, Bentson H; McCamant, Lynn

2002-01-01

To assess the possible influence of centralized intake on client outcomes, initial, six- and twelve-month Addiction Severity Index composite scores (in the alcohol, drug, legal and psychiatric areas) for clients who experienced provider intake were compared with scores for those going through two different models of centralized intake. Centralized intake clients were more likely than provider intake clients to have legal problems, and those legal problems became fewer over time. Clients from in-jail intake, including pretreatment services and accompanied placement, showed a greater initial and lower subsequent prevalence of drug, psychiatric and legal problems than the clients of the freestanding centralized intake. For all clients, psychiatric composite scores were powerful predictors of problems in alcohol, drug medical and legal areas, and psychiatric symptoms decreased over time. Since baseline differences in demographics and service assignment existed among the three groups, it was difficult to identify whether the outcome differences were due to the nature of the participants, the nature of the intake intervention, or both. However, the Portland Target Cities Projects's emphasis on in-jail centralized intake was associated with enhanced client outcomes.

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

NASA Technical Reports Server (NTRS)

Halldane, J. F.

1972-01-01

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

Adapting the neurology area of the Gustavo Fricke Hospital

NASA Astrophysics Data System (ADS)

Ankelen, A.; González, S.; Aguirre, L.

2007-11-01

Within the framework of the subject Clinical Engineering taught at Hospital Dr. Gustavo Fricke of Viña del Mar Chile, we were assigned to undertake a detailed study on the quality of the electrical power main supply of the Neurology Department, on account of reported malfunctioning of some equipment used in this unit. The study results indicated that the problems occurred only in a device for auditory evoked potentials device and, contrary to what was expected, the problem was unrelated to the quality of the electrical main supply. It was also found that the cause for the problem was electromagnetic interference (EMI) emitted from the system's very own components. To solve the problem, we built a Faraday Cage for the signal-processing unit and increased the separating distance among the various system components. This approach enhanced system performance and significantly improved the recorded signals of patients. The solution adopted from this experience was suggested to others health care centers of our country that had been experiencing similar difficulties with the same type of medical equipment.

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.

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

NASA Astrophysics Data System (ADS)

Nohara, Mitsuo; Takeuchi, Yoshio; Takahata, Fumio

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

DO PERIODICITIES IN EXTINCTION-WITH POSSIBLE ASTRONOMICAL CONNECTIONS-SURVIVE A REVISION OF THE GEOLOGICAL TIMESCALE?

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

Melott, Adrian L.; Bambach, Richard K.

A major revision of the geological timescale was published in 2012. We re-examine our past finding of a 27 Myr periodicity in marine extinction rates by re-assigning dates to the extinction data used previously. We find that the spectral power in this period is somewhat increased, and persists at a narrow bandwidth, which supports our previous contention that the Nemesis hypothesis is untenable as an explanation for the periodicity that was first noted by Raup and Sepkoski in the 1980s. We enumerate a number of problems in a recent study comparing extinction rates with time series models.

Do Periodicities in Extinction—with Possible Astronomical Connections—Survive a Revision of the Geological Timescale?

NASA Astrophysics Data System (ADS)

Melott, Adrian L.; Bambach, Richard K.

2013-08-01

A major revision of the geological timescale was published in 2012. We re-examine our past finding of a 27 Myr periodicity in marine extinction rates by re-assigning dates to the extinction data used previously. We find that the spectral power in this period is somewhat increased, and persists at a narrow bandwidth, which supports our previous contention that the Nemesis hypothesis is untenable as an explanation for the periodicity that was first noted by Raup & Sepkoski in the 1980s. We enumerate a number of problems in a recent study comparing extinction rates with time series models.

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…

Implications of clinical trial design on sample size requirements.

PubMed

Leon, Andrew C

2008-07-01

The primary goal in designing a randomized controlled clinical trial (RCT) is to minimize bias in the estimate of treatment effect. Randomized group assignment, double-blinded assessments, and control or comparison groups reduce the risk of bias. The design must also provide sufficient statistical power to detect a clinically meaningful treatment effect and maintain a nominal level of type I error. An attempt to integrate neurocognitive science into an RCT poses additional challenges. Two particularly relevant aspects of such a design often receive insufficient attention in an RCT. Multiple outcomes inflate type I error, and an unreliable assessment process introduces bias and reduces statistical power. Here we describe how both unreliability and multiple outcomes can increase the study costs and duration and reduce the feasibility of the study. The objective of this article is to consider strategies that overcome the problems of unreliability and multiplicity.

Group Matching: Is This a Research Technique to Be Avoided?

ERIC Educational Resources Information Center

Ross, Donald C.; Klein, Donald F.

1988-01-01

The variance of the sample difference and the power of the "F" test for mean differences were studied under group matching on covariates and also under random assignment. Results shed light on systematic assignment procedures advocated to provide more precise estimates of treatment effects than simple random assignment. (TJH)

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.

An MILP-based cross-layer optimization for a multi-reader arbitration in the UHF RFID system.

PubMed

Choi, Jinchul; Lee, Chaewoo

2011-01-01

In RFID systems, the performance of each reader such as interrogation range and tag recognition rate may suffer from interferences from other readers. Since the reader interference can be mitigated by output signal power control, spectral and/or temporal separation among readers, the system performance depends on how to adapt the various reader arbitration metrics such as time, frequency, and output power to the system environment. However, complexity and difficulty of the optimization problem increase with respect to the variety of the arbitration metrics. Thus, most proposals in previous study have been suggested to primarily prevent the reader collision with consideration of one or two arbitration metrics. In this paper, we propose a novel cross-layer optimization design based on the concept of combining time division, frequency division, and power control not only to solve the reader interference problem, but also to achieve the multiple objectives such as minimum interrogation delay, maximum reader utilization, and energy efficiency. Based on the priority of the multiple objectives, our cross-layer design optimizes the system sequentially by means of the mixed-integer linear programming. In spite of the multi-stage optimization, the optimization design is formulated as a concise single mathematical form by properly assigning a weight to each objective. Numerical results demonstrate the effectiveness of the proposed optimization design.

An MILP-Based Cross-Layer Optimization for a Multi-Reader Arbitration in the UHF RFID System

PubMed Central

Choi, Jinchul; Lee, Chaewoo

2011-01-01

In RFID systems, the performance of each reader such as interrogation range and tag recognition rate may suffer from interferences from other readers. Since the reader interference can be mitigated by output signal power control, spectral and/or temporal separation among readers, the system performance depends on how to adapt the various reader arbitration metrics such as time, frequency, and output power to the system environment. However, complexity and difficulty of the optimization problem increase with respect to the variety of the arbitration metrics. Thus, most proposals in previous study have been suggested to primarily prevent the reader collision with consideration of one or two arbitration metrics. In this paper, we propose a novel cross-layer optimization design based on the concept of combining time division, frequency division, and power control not only to solve the reader interference problem, but also to achieve the multiple objectives such as minimum interrogation delay, maximum reader utilization, and energy efficiency. Based on the priority of the multiple objectives, our cross-layer design optimizes the system sequentially by means of the mixed-integer linear programming. In spite of the multi-stage optimization, the optimization design is formulated as a concise single mathematical form by properly assigning a weight to each objective. Numerical results demonstrate the effectiveness of the proposed optimization design. PMID:22163743

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.

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

NASA Astrophysics Data System (ADS)

Guo, Peng; Cheng, Wenming; Wang, Yi

2014-10-01

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

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.

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

Code of Federal Regulations, 2010 CFR

2010-04-01

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

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

Code of Federal Regulations, 2011 CFR

2011-04-01

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

47 CFR 73.865 - Assignment and transfer of LPFM licenses.

Code of Federal Regulations, 2012 CFR

2012-10-01

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

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

Algorithm to solve a chance-constrained network capacity design problem with stochastic demands and finite support

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

Schumacher, Kathryn M.; Chen, Richard Li-Yang; Cohn, Amy E. M.

2016-04-15

Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as amore » foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.« less

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.

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.

Kalai-Smorodinsky bargaining solution for optimal resource allocation over wireless DS-CDMA visual sensor networks

NASA Astrophysics Data System (ADS)

Pandremmenou, Katerina; Kondi, Lisimachos P.; Parsopoulos, Konstantinos E.

2012-01-01

Surveillance applications usually require high levels of video quality, resulting in high power consumption. The existence of a well-behaved scheme to balance video quality and power consumption is crucial for the system's performance. In the present work, we adopt the game-theoretic approach of Kalai-Smorodinsky Bargaining Solution (KSBS) to deal with the problem of optimal resource allocation in a multi-node wireless visual sensor network (VSN). In our setting, the Direct Sequence Code Division Multiple Access (DS-CDMA) method is used for channel access, while a cross-layer optimization design, which employs a central processing server, accounts for the overall system efficacy through all network layers. The task assigned to the central server is the communication with the nodes and the joint determination of their transmission parameters. The KSBS is applied to non-convex utility spaces, efficiently distributing the source coding rate, channel coding rate and transmission powers among the nodes. In the underlying model, the transmission powers assume continuous values, whereas the source and channel coding rates can take only discrete values. Experimental results are reported and discussed to demonstrate the merits of KSBS over competing policies.

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.

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

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.

33 CFR 3.01-5 - Assignment of functions.

Code of Federal Regulations, 2010 CFR

2010-07-01

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

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)

The Biomes of Homewood: Interactive Map Software

ERIC Educational Resources Information Center

Shingles, Richard; Feist, Theron; Brosnan, Rae

2005-01-01

To build a learning community, the General Biology faculty at Johns Hopkins University conducted collaborative, problem-based learning assignments outside of class in which students are assigned to specific areas on campus, and gather and report data about their area. To overcome the logistics challenges presented by conducting such assignments in…

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

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.

A mobile communication system providing integrated voice/data services over power limited satellite channels

NASA Astrophysics Data System (ADS)

Bose, Sanjay K.; Gordon, J. J.

The modeling and analysis of a system providing integrated voice/data services to mobile terminals over a power-limited satellite channel are discussed. The mobiles use slotted Aloha random access to send requests for channel assignments to a central station. For successful requests, the actual transmission of voice/data within a call is done using the channel assigned for this purpose by the central station. The satellite channel is assumed to be power limited. Taking into account the known burstiness of voice sources (which use a voice-activated switch), the central station overassigns channels so that the average total power is below the power limit of the satellite transponder. The performance of this model is analyzed. Certain simple, static control strategies for improving performance are also proposed.

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

Load Balancing Unstructured Adaptive Grids for CFD Problems

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Oliker, Leonid

1996-01-01

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that balances the workload across all processors with a global view. After each parallel tetrahedral mesh adaption, the method first determines if the new mesh is sufficiently unbalanced to warrant a repartitioning. If so, the adapted mesh is repartitioned, with new partitions assigned to processors so that the redistribution cost is minimized. The new partitions are accepted only if the remapping cost is compensated by the improved load balance. Results indicate that this strategy is effective for large-scale scientific computations on distributed-memory multiprocessors.

Fast Laplace solver approach to pore-scale permeability

NASA Astrophysics Data System (ADS)

Arns, C. H.; Adler, P. M.

2018-02-01

We introduce a powerful and easily implemented method to calculate the permeability of porous media at the pore scale using an approximation based on the Poiseulle equation to calculate permeability to fluid flow with a Laplace solver. The method consists of calculating the Euclidean distance map of the fluid phase to assign local conductivities and lends itself naturally to the treatment of multiscale problems. We compare with analytical solutions as well as experimental measurements and lattice Boltzmann calculations of permeability for Fontainebleau sandstone. The solver is significantly more stable than the lattice Boltzmann approach, uses less memory, and is significantly faster. Permeabilities are in excellent agreement over a wide range of porosities.

76 FR 75539 - Combined Notice of Filings #1

Federal Register 2010, 2011, 2012, 2013, 2014

2011-12-02

..., Assignment, or Transfer of BPA Trans. Rights to be effective 11/22/2011. Filed Date: 11/21/11. Accession...: Hermiston Power, LLC. Description: Revision to Tariff for the Sale, Assignment, or Transfer of BPA Trans...

Acquisition of ICU data: concepts and demands.

PubMed

Imhoff, M

1992-12-01

As the issue of data overload is a problem in critical care today, it is of utmost importance to improve acquisition, storage, integration, and presentation of medical data, which appears only feasible with the help of bedside computers. The data originates from four major sources: (1) the bedside medical devices, (2) the local area network (LAN) of the ICU, (3) the hospital information system (HIS) and (4) manual input. All sources differ markedly in quality and quantity of data and in the demands of the interfaces between source of data and patient database. The demands for data acquisition from bedside medical devices, ICU-LAN and HIS concentrate on technical problems, such as computational power, storage capacity, real-time processing, interfacing with different devices and networks and the unmistakable assignment of data to the individual patient. The main problem of manual data acquisition is the definition and configuration of the user interface that must allow the inexperienced user to interact with the computer intuitively. Emphasis must be put on the construction of a pleasant, logical and easy-to-handle graphical user interface (GUI). Short response times will require high graphical processing capacity. Moreover, high computational resources are necessary in the future for additional interfacing devices such as speech recognition and 3D-GUI. Therefore, in an ICU environment the demands for computational power are enormous. These problems are complicated by the urgent need for friendly and easy-to-handle user interfaces. Both facts place ICU bedside computing at the vanguard of present and future workstation development leaving no room for solutions based on traditional concepts of personal computers.(ABSTRACT TRUNCATED AT 250 WORDS)

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

Fully Parallel MHD Stability Analysis Tool

NASA Astrophysics Data System (ADS)

Svidzinski, Vladimir; Galkin, Sergei; Kim, Jin-Soo; Liu, Yueqiang

2014-10-01

Progress on full parallelization of the plasma stability code MARS will be reported. MARS calculates eigenmodes in 2D axisymmetric toroidal equilibria in MHD-kinetic plasma models. It is a powerful tool for studying MHD and MHD-kinetic instabilities and it is widely used by fusion community. Parallel version of MARS is intended for simulations on local parallel clusters. It will be an efficient tool for simulation of MHD instabilities with low, intermediate and high toroidal mode numbers within both fluid and kinetic plasma models, already implemented in MARS. Parallelization of the code includes parallelization of the construction of the matrix for the eigenvalue problem and parallelization of the inverse iterations algorithm, implemented in MARS for the solution of the formulated eigenvalue problem. Construction of the matrix is parallelized by distributing the load among processors assigned to different magnetic surfaces. Parallelization of the solution of the eigenvalue problem is made by repeating steps of the present MARS algorithm using parallel libraries and procedures. Initial results of the code parallelization will be reported. Work is supported by the U.S. DOE SBIR program.

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

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

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

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

NEPA assignment training PowerPoints and quizzes.

DOT National Transportation Integrated Search

2016-10-01

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

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2013 CFR

2013-10-01

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

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2014 CFR

2014-10-01

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

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2012 CFR

2012-10-01

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

47 CFR 74.702 - Channel assignments.

Code of Federal Regulations, 2011 CFR

2011-10-01

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

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.

40 CFR 305.4 - Powers and duties of the Review Officer and the Presiding Officer; disqualification.

Code of Federal Regulations, 2010 CFR

2010-07-01

... notify the parties of his assignment pursuant to § 305.4(c). The Presiding Officer shall conduct a fair... findings of fact, conclusions of law, and a final order; (11) Assess costs of the proceeding pursuant to... assignment of the Presiding Officer, make any objection to his assignment. Otherwise, any objections to the...

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.

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

Dinh, Nam; Athe, Paridhi; Jones, Christopher

The Virtual Environment for Reactor Applications (VERA) code suite is assessed in terms of capability and credibility against the Consortium for Advanced Simulation of Light Water Reactors (CASL) Verification and Validation Plan (presented herein) in the context of three selected challenge problems: CRUD-Induced Power Shift (CIPS), Departure from Nucleate Boiling (DNB), and Pellet-Clad Interaction (PCI). Capability refers to evidence of required functionality for capturing phenomena of interest while capability refers to the evidence that provides confidence in the calculated results. For this assessment, each challenge problem defines a set of phenomenological requirements against which the VERA software is assessed. Thismore » approach, in turn, enables the focused assessment of only those capabilities relevant to the challenge problem. The evaluation of VERA against the challenge problem requirements represents a capability assessment. The mechanism for assessment is the Sandia-developed Predictive Capability Maturity Model (PCMM) that, for this assessment, evaluates VERA on 8 major criteria: (1) Representation and Geometric Fidelity, (2) Physics and Material Model Fidelity, (3) Software Quality Assurance and Engineering, (4) Code Verification, (5) Solution Verification, (6) Separate Effects Model Validation, (7) Integral Effects Model Validation, and (8) Uncertainty Quantification. For each attribute, a maturity score from zero to three is assigned in the context of each challenge problem. The evaluation of these eight elements constitutes the credibility assessment for VERA.« less

Quantum annealing for combinatorial clustering

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

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

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

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.

When dispositional and role power fit: implications for self-expression and self-other congruence.

PubMed

Chen, Serena; Langner, Carrie A; Mendoza-Denton, Rodolfo

2009-03-01

Integrating and extending the literatures on social power and person-environment fit, 4 studies tested the hypothesis that when people's dispositional beliefs about their capacity to influence others fit their assigned role power, they are more likely to engage in self-expression-that is, behave in line with their states and traits-thereby increasing their likelihood of being perceived by others in a manner congruent with their own self-judgments (i.e., self-other congruence). In Studies 1-3, dispositionally high- and low-power participants were randomly assigned to play a high- or low-power role in an interaction with a confederate. When participants' dispositional and role power fit (vs. conflicted), they reported greater self-expression (Study 1). Furthermore, under dispositional-role power fit conditions, the confederate's ratings of participants' emotional experiences (Study 2) and personality traits (Study 3) were more congruent with participants' self-reported emotions and traits. Study 4's results replicated Study 3's results using an implicit manipulation of power and outside observers' (rather than a confederate's) ratings of participants. Implications for research on power and person perception are discussed.

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…

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

Electric Grid Expansion Planning with High Levels of Variable Generation

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

Hadley, Stanton W.; You, Shutang; Shankar, Mallikarjun

2016-02-01

Renewables are taking a large proportion of generation capacity in U.S. power grids. As their randomness has increasing influence on power system operation, it is necessary to consider their impact on system expansion planning. To this end, this project studies the generation and transmission expansion co-optimization problem of the US Eastern Interconnection (EI) power grid with a high wind power penetration rate. In this project, the generation and transmission expansion problem for the EI system is modeled as a mixed-integer programming (MIP) problem. This study analyzed a time series creation method to capture the diversity of load and wind powermore » across balancing regions in the EI system. The obtained time series can be easily introduced into the MIP co-optimization problem and then solved robustly through available MIP solvers. Simulation results show that the proposed time series generation method and the expansion co-optimization model and can improve the expansion result significantly after considering the diversity of wind and load across EI regions. The improved expansion plan that combines generation and transmission will aid system planners and policy makers to maximize the social welfare. This study shows that modelling load and wind variations and diversities across balancing regions will produce significantly different expansion result compared with former studies. For example, if wind is modeled in more details (by increasing the number of wind output levels) so that more wind blocks are considered in expansion planning, transmission expansion will be larger and the expansion timing will be earlier. Regarding generation expansion, more wind scenarios will slightly reduce wind generation expansion in the EI system and increase the expansion of other generation such as gas. Also, adopting detailed wind scenarios will reveal that it may be uneconomic to expand transmission networks for transmitting a large amount of wind power through a long distance in the EI system. Incorporating more details of renewables in expansion planning will inevitably increase the computational burden. Therefore, high performance computing (HPC) techniques are urgently needed for power system operation and planning optimization. As a scoping study task, this project tested some preliminary parallel computation techniques such as breaking down the simulation task into several sub-tasks based on chronology splitting or sample splitting, and then assigning these sub-tasks to different cores. Testing results show significant time reduction when a simulation task is split into several sub-tasks for parallel execution.« less

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

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.

Adaptive protection algorithm and system

DOEpatents

Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA

2009-04-28

An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.

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.

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.

18 CFR 11.12 - Determination of section 10(f) costs.

Code of Federal Regulations, 2010 CFR

2010-04-01

... costs of the project. (2) If power is not an authorized function of the headwater project, the section... costs designated as the joint-use power cost, derived by deeming a power function at the project. The value of the benefits assigned to the deemed power function, for purposes of determining the value of...

18 CFR 11.12 - Determination of section 10(f) costs.

Code of Federal Regulations, 2012 CFR

2012-04-01

... costs of the project. (2) If power is not an authorized function of the headwater project, the section... costs designated as the joint-use power cost, derived by deeming a power function at the project. The value of the benefits assigned to the deemed power function, for purposes of determining the value of...

18 CFR 11.12 - Determination of section 10(f) costs.

Code of Federal Regulations, 2011 CFR

2011-04-01

... costs of the project. (2) If power is not an authorized function of the headwater project, the section... costs designated as the joint-use power cost, derived by deeming a power function at the project. The value of the benefits assigned to the deemed power function, for purposes of determining the value of...

18 CFR 11.12 - Determination of section 10(f) costs.

Code of Federal Regulations, 2014 CFR

2014-04-01

... costs of the project. (2) If power is not an authorized function of the headwater project, the section... costs designated as the joint-use power cost, derived by deeming a power function at the project. The value of the benefits assigned to the deemed power function, for purposes of determining the value of...

18 CFR 11.12 - Determination of section 10(f) costs.

Code of Federal Regulations, 2013 CFR

2013-04-01

... costs of the project. (2) If power is not an authorized function of the headwater project, the section... costs designated as the joint-use power cost, derived by deeming a power function at the project. The value of the benefits assigned to the deemed power function, for purposes of determining the value of...

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…

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.

7 CFR 1717.159 - Applications for RUS approvals of mergers.

Code of Federal Regulations, 2011 CFR

2011-01-01

... should consult with its assigned RUS general field representative, and a power supply borrower with the Director, Power Supply Division for general information prior to submitting the request. ...

7 CFR 1717.159 - Applications for RUS approvals of mergers.

Code of Federal Regulations, 2010 CFR

2010-01-01

... should consult with its assigned RUS general field representative, and a power supply borrower with the Director, Power Supply Division for general information prior to submitting the request. ...

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

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

PubMed Central

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

2011-01-01

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

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

PubMed

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

2011-01-18

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

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

The generalized pole assignment problem. [dynamic output feedback problems

NASA Technical Reports Server (NTRS)

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

1979-01-01

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

RF environment survey of Space Shuttle related EEE frequency bands

NASA Technical Reports Server (NTRS)

Simpson, J.; Prigel, B.; Postelle, J.

1977-01-01

Radio frequency assignments within the continental United States in frequency bands between 121 MHz abd 65 GHz were surveyed and analyzed in order to determine current utilization of anticipated frequency bands for the shuttle borne electromagnetic environment experiment. Data from both government and nongovernment files were used. Results are presented in both narrative form and in histograms which show the total number of unclassified assignments versus frequency and total assigned power versus frequency.

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.

Child-Level Predictors of Responsiveness to Evidence-Based Mathematics Intervention.

PubMed

Powell, Sarah R; Cirino, Paul T; Malone, Amelia S

2017-07-01

We identified child-level predictors of responsiveness to 2 types of mathematics (calculation and word-problem) intervention among 2nd-grade children with mathematics difficulty. Participants were 250 children in 107 classrooms in 23 schools pretested on mathematics and general cognitive measures and posttested on mathematics measures. We assigned classrooms randomly assigned to calculation intervention, word-problem intervention, or business-as-usual control. Intervention lasted 17 weeks. Path analyses indicated that scores on working memory and language comprehension assessments moderated responsiveness to calculation intervention. No moderators were identified for responsiveness to word-problem intervention. Across both intervention groups and the control group, attentive behavior predicted both outcomes. Initial calculation skill predicted the calculation outcome, and initial language comprehension predicted word-problem outcomes. These results indicate that screening for calculation intervention should include a focus on working memory, language comprehension, attentive behavior, and calculations. Screening for word-problem intervention should focus on attentive behavior and word problems.

47 CFR 73.601 - Scope of subpart.

Code of Federal Regulations, 2010 CFR

2010-10-01

... broadcast stations and, where indicated, low power TV and TV translator stations in the United States, its Territories and possessions. TV broadcast, low power TV, and TV translator stations are assigned channels 6...

Visual Communication: Integrating Visual Instruction into Business Communication Courses

ERIC Educational Resources Information Center

Baker, William H.

2006-01-01

Business communication courses are ideal for teaching visual communication principles and techniques. Many assignments lend themselves to graphic enrichment, such as flyers, handouts, slide shows, Web sites, and newsletters. Microsoft Publisher and Microsoft PowerPoint are excellent tools for these assignments, with Publisher being best for…

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

5 CFR 2422.21 - Duties and powers of the Hearing Officer.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Duties and powers of the Hearing Officer... Duties and powers of the Hearing Officer. (a) Duties of the Hearing Officer. The Hearing Officer will...) Powers of the Hearing Officer. During the period a case is assigned to a Hearing Officer by the Regional...

5 CFR 2422.21 - Duties and powers of the Hearing Officer.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 5 Administrative Personnel 3 2011-01-01 2011-01-01 false Duties and powers of the Hearing Officer... Duties and powers of the Hearing Officer. (a) Duties of the Hearing Officer. The Hearing Officer will...) Powers of the Hearing Officer. During the period a case is assigned to a Hearing Officer by the Regional...

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 group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments

NASA Astrophysics Data System (ADS)

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

2011-12-01

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

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…

Fully Parallel MHD Stability Analysis Tool

NASA Astrophysics Data System (ADS)

Svidzinski, Vladimir; Galkin, Sergei; Kim, Jin-Soo; Liu, Yueqiang

2015-11-01

Progress on full parallelization of the plasma stability code MARS will be reported. MARS calculates eigenmodes in 2D axisymmetric toroidal equilibria in MHD-kinetic plasma models. It is a powerful tool for studying MHD and MHD-kinetic instabilities and it is widely used by fusion community. Parallel version of MARS is intended for simulations on local parallel clusters. It will be an efficient tool for simulation of MHD instabilities with low, intermediate and high toroidal mode numbers within both fluid and kinetic plasma models, already implemented in MARS. Parallelization of the code includes parallelization of the construction of the matrix for the eigenvalue problem and parallelization of the inverse iterations algorithm, implemented in MARS for the solution of the formulated eigenvalue problem. Construction of the matrix is parallelized by distributing the load among processors assigned to different magnetic surfaces. Parallelization of the solution of the eigenvalue problem is made by repeating steps of the present MARS algorithm using parallel libraries and procedures. Results of MARS parallelization and of the development of a new fix boundary equilibrium code adapted for MARS input will be reported. Work is supported by the U.S. DOE SBIR program.

14 CFR 385.7 - Exercise of authority by superiors.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 4 2014-01-01 2014-01-01 false Exercise of authority by superiors. 385.7... Exercise of authority by superiors. Any assignment of authority to a staff member other than the Chief... Department's principle of management responsibility, the superior may choose to exercise the assigned power...

14 CFR 385.7 - Exercise of authority by superiors.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 14 Aeronautics and Space 4 2013-01-01 2013-01-01 false Exercise of authority by superiors. 385.7... Exercise of authority by superiors. Any assignment of authority to a staff member other than the Chief... Department's principle of management responsibility, the superior may choose to exercise the assigned power...

14 CFR 385.7 - Exercise of authority by superiors.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 14 Aeronautics and Space 4 2012-01-01 2012-01-01 false Exercise of authority by superiors. 385.7... Exercise of authority by superiors. Any assignment of authority to a staff member other than the Chief... Department's principle of management responsibility, the superior may choose to exercise the assigned power...

14 CFR 385.7 - Exercise of authority by superiors.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false Exercise of authority by superiors. 385.7... Exercise of authority by superiors. Any assignment of authority to a staff member other than the Chief... Department's principle of management responsibility, the superior may choose to exercise the assigned power...

14 CFR 385.7 - Exercise of authority by superiors.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Exercise of authority by superiors. 385.7... Exercise of authority by superiors. Any assignment of authority to a staff member other than the Chief... Department's principle of management responsibility, the superior may choose to exercise the assigned power...

Intraclass Correlation Values for Planning Group-Randomized Trials in Education

ERIC Educational Resources Information Center

Hedges, Larry V.; Hedberg, E. C.

2007-01-01

Experiments that assign intact groups to treatment conditions are increasingly common in social research. In educational research, the groups assigned are often schools. The design of group-randomized experiments requires knowledge of the intraclass correlation structure to compute statistical power and sample sizes required to achieve adequate…

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

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-04

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

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

ERIC Educational Resources Information Center

Lieberman, Daina S.

2017-01-01

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

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2012 CFR

2012-10-01

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

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2011 CFR

2011-10-01

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

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2014 CFR

2014-10-01

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

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2010 CFR

2010-10-01

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

49 CFR 821.35 - Assignment, duties and powers.

Code of Federal Regulations, 2013 CFR

2013-10-01

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

Coupled Monte Carlo neutronics and thermal hydraulics for power reactors

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

Bernnat, W.; Buck, M.; Mattes, M.

The availability of high performance computing resources enables more and more the use of detailed Monte Carlo models even for full core power reactors. The detailed structure of the core can be described by lattices, modeled by so-called repeated structures e.g. in Monte Carlo codes such as MCNP5 or MCNPX. For cores with mainly uniform material compositions, fuel and moderator temperatures, there is no problem in constructing core models. However, when the material composition and the temperatures vary strongly a huge number of different material cells must be described which complicate the input and in many cases exceed code ormore » memory limits. The second problem arises with the preparation of corresponding temperature dependent cross sections and thermal scattering laws. Only if these problems can be solved, a realistic coupling of Monte Carlo neutronics with an appropriate thermal-hydraulics model is possible. In this paper a method for the treatment of detailed material and temperature distributions in MCNP5 is described based on user-specified internal functions which assign distinct elements of the core cells to material specifications (e.g. water density) and temperatures from a thermal-hydraulics code. The core grid itself can be described with a uniform material specification. The temperature dependency of cross sections and thermal neutron scattering laws is taken into account by interpolation, requiring only a limited number of data sets generated for different temperatures. Applications will be shown for the stationary part of the Purdue PWR benchmark using ATHLET for thermal- hydraulics and for a generic Modular High Temperature reactor using THERMIX for thermal- hydraulics. (authors)« less

A demand assignment control in international business satellite communications network

NASA Astrophysics Data System (ADS)

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

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

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

PubMed

Ogden, Rob; Linacre, Adrian

2015-09-01

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

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…

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)

NASA Researchers Examine a Pratt and Whitney RL-10 Rocket Engine

NASA Image and Video Library

1962-04-21

Lead Test Engineer John Kobak (right) and a technician use an oscilloscope to test the installation of a Pratt and Whitney RL-10 engine in the Propulsion Systems Laboratory at the National Aeronautics and Space Administration (NASA) Lewis Research Center. In 1955 the military asked Pratt and Whitney to develop hydrogen engines specifically for aircraft. The program was canceled in 1958, but Pratt and Whitney decided to use the experience to develop a liquid-hydrogen rocket engine, the RL-10. Two of the 15,000-pound-thrust RL-10 engines were used to power the new Centaur second-stage rocket. Centaur was designed to carry the Surveyor spacecraft on its mission to soft-land on the Moon. Pratt and Whitney ran into problems while testing the RL-10 at their facilities. NASA Headquarters assigned Lewis the responsibility for investigating the RL-10 problems because of the center’s long history of liquid-hydrogen development. Lewis’ Chemical Rocket Division began a series of tests to study the RL-10 at its Propulsion Systems Laboratory in March 1960. The facility contained two test chambers that could study powerful engines in simulated altitude conditions. The first series of RL-10 tests in early 1961 involved gimballing the engine as it fired. Lewis researchers were able to yaw and pitch the engine to simulate its behavior during a real flight.

29 CFR 102.35 - Duties and powers of administrative law judges; stipulations of cases to administrative law...

Code of Federal Regulations, 2010 CFR

2010-07-01

... 29 Labor 2 2010-07-01 2010-07-01 false Duties and powers of administrative law judges; stipulations of cases to administrative law judges or to the Board; assignment and powers of settlement judges... Practices 1 Hearings § 102.35 Duties and powers of administrative law judges; stipulations of cases to...

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…

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.

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.

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.

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

USDA-ARS?s Scientific Manuscript database

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

Power Calculations for Moderators in Multi-Site Cluster Randomized Trials

ERIC Educational Resources Information Center

Spybrook, Jessaca; Kelcey, Ben; Dong, Nianbo

2016-01-01

Cluster randomized trials (CRTs), or studies in which intact groups of individuals are randomly assigned to a condition, are becoming more common in evaluation studies of educational programs. A specific type of CRT in which clusters are randomly assigned to treatment within blocks or sites, known as multisite cluster randomized trials (MSCRTs),…

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

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

PubMed

Kelly, M H

1992-04-01

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

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)

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,

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.

Strategic Deterrence in the Post-Start Era

DTIC Science & Technology

1992-04-15

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

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.

Probabilistic Scenario-based Seismic Risk Analysis for Critical Infrastructures Method and Application for a Nuclear Power Plant

NASA Astrophysics Data System (ADS)

Klügel, J.

2006-12-01

Deterministic scenario-based seismic hazard analysis has a long tradition in earthquake engineering for developing the design basis of critical infrastructures like dams, transport infrastructures, chemical plants and nuclear power plants. For many applications besides of the design of infrastructures it is of interest to assess the efficiency of the design measures taken. These applications require a method allowing to perform a meaningful quantitative risk analysis. A new method for a probabilistic scenario-based seismic risk analysis has been developed based on a probabilistic extension of proven deterministic methods like the MCE- methodology. The input data required for the method are entirely based on the information which is necessary to perform any meaningful seismic hazard analysis. The method is based on the probabilistic risk analysis approach common for applications in nuclear technology developed originally by Kaplan & Garrick (1981). It is based (1) on a classification of earthquake events into different size classes (by magnitude), (2) the evaluation of the frequency of occurrence of events, assigned to the different classes (frequency of initiating events, (3) the development of bounding critical scenarios assigned to each class based on the solution of an optimization problem and (4) in the evaluation of the conditional probability of exceedance of critical design parameters (vulnerability analysis). The advantage of the method in comparison with traditional PSHA consists in (1) its flexibility, allowing to use different probabilistic models for earthquake occurrence as well as to incorporate advanced physical models into the analysis, (2) in the mathematically consistent treatment of uncertainties, and (3) in the explicit consideration of the lifetime of the critical structure as a criterion to formulate different risk goals. The method was applied for the evaluation of the risk of production interruption losses of a nuclear power plant during its residual lifetime.

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

PubMed

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

2016-09-01

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

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.

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…

12 CFR 150.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2014 CFR

2014-01-01

... 12 Banks and Banking 1 2014-01-01 2014-01-01 false Who is responsible for the exercise of... and Facilities § 150.150 Who is responsible for the exercise of fiduciary powers? The exercise of your... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

12 CFR 150.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2012 CFR

2012-01-01

... 12 Banks and Banking 1 2012-01-01 2012-01-01 false Who is responsible for the exercise of... and Facilities § 150.150 Who is responsible for the exercise of fiduciary powers? The exercise of your... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

12 CFR 550.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2011 CFR

2011-01-01

... 12 Banks and Banking 5 2011-01-01 2011-01-01 false Who is responsible for the exercise of... Facilities § 550.150 Who is responsible for the exercise of fiduciary powers? The exercise of your fiduciary... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

12 CFR 550.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2012 CFR

2012-01-01

... 12 Banks and Banking 6 2012-01-01 2012-01-01 false Who is responsible for the exercise of... Facilities § 550.150 Who is responsible for the exercise of fiduciary powers? The exercise of your fiduciary... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

12 CFR 150.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2013 CFR

2013-01-01

... 12 Banks and Banking 1 2013-01-01 2013-01-01 false Who is responsible for the exercise of... and Facilities § 150.150 Who is responsible for the exercise of fiduciary powers? The exercise of your... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

47 CFR 101.147 - Frequency assignments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... pickup stations. The maximum power for the local television transmission service in the 14.2-14.4 GHz... authorized for low power, limited coverage systems subject to the provisions of paragraph (s)(8) of this... June 8, 2000, except for low power indoor stations in the band 18,820-18,870 MHz and 19,160-19,210 MHz...

47 CFR 73.702 - Assignment and use of frequencies.

Code of Federal Regulations, 2014 CFR

2014-10-01

... where a transmitter power of less than 100 kW is used. In this case, antenna gain on restricted azimuths... these restrictions. Permitted gain for transmitter powers less than 100 kW: ER10au05.065 Where: Gi = maximum gain permitted with reference to an isotropic radiator. Pa = Transmitter power employed in kW. (i...

47 CFR 73.702 - Assignment and use of frequencies.

Code of Federal Regulations, 2011 CFR

2011-10-01

... where a transmitter power of less than 100 kW is used. In this case, antenna gain on restricted azimuths... these restrictions. Permitted gain for transmitter powers less than 100 kW: ER10au05.065 Where: Gi = maximum gain permitted with reference to an isotropic radiator. Pa = Transmitter power employed in kW. (i...

47 CFR 73.702 - Assignment and use of frequencies.

Code of Federal Regulations, 2012 CFR

2012-10-01

... where a transmitter power of less than 100 kW is used. In this case, antenna gain on restricted azimuths... these restrictions. Permitted gain for transmitter powers less than 100 kW: ER10au05.065 Where: Gi = maximum gain permitted with reference to an isotropic radiator. Pa = Transmitter power employed in kW. (i...

47 CFR 73.702 - Assignment and use of frequencies.

Code of Federal Regulations, 2013 CFR

2013-10-01

... where a transmitter power of less than 100 kW is used. In this case, antenna gain on restricted azimuths... these restrictions. Permitted gain for transmitter powers less than 100 kW: ER10au05.065 Where: Gi = maximum gain permitted with reference to an isotropic radiator. Pa = Transmitter power employed in kW. (i...

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

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

Code of Federal Regulations, 2010 CFR

2010-10-01

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

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

PubMed

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

2018-01-01

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

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

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

Scheduling lessons learned from the Autonomous Power System

NASA Technical Reports Server (NTRS)

Ringer, Mark J.

1992-01-01

The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.

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.

77 FR 10524 - Information Collections Being Reviewed by the Federal Communications Commission Under Delegated...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-22

... or Permittee, or Assignment of License or Permit, for an FM or TV Translator Station, or a Low Power... permittee for an FM or TV translator station, or low power TV station. This collection also includes the...

Reading One Flew Over the Cuckoo's Nest in an undergraduate, US healthcare course.

PubMed

Metcalf, James

2006-01-01

One Flew Over the Cuckoo's Nest, a modern classic in American literature by Ken Kesey, was used to complement conventional assignments in Healthcare USA, an undergraduate survey of the American healthcare system at George Mason University. The book contrasts perceptions of reality between a group of psychiatric patients and the institutional staff. It also depicts a power struggle between patients and staff and illustrates how patients can be enslaved by the healthcare system itself. The purpose of the assignment was to prompt student reflection upon both the contrasting realities and the power conflicts between patients and staff. Several examples of student responses are presented.

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.

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.

Contextual priming: Where people vote affects how they vote

PubMed Central

Berger, Jonah; Meredith, Marc; Wheeler, S. Christian

2008-01-01

American voters are assigned to vote at a particular polling location (e.g., a church, school, etc.). We show these assigned polling locations can influence how people vote. Analysis of a recent general election demonstrates that people who were assigned to vote in schools were more likely to support a school funding initiative. This effect persisted even when controlling for voters' political views, demographics, and unobservable characteristics of individuals living near schools. A follow-up experiment using random assignment suggests that priming underlies these effects, and that they can occur outside of conscious awareness. These findings underscore the subtle power of situational context to shape important real-world decisions. PMID:18574152

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…

12 CFR 550.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2014 CFR

2014-01-01

... 12 Banks and Banking 6 2014-01-01 2012-01-01 true Who is responsible for the exercise of fiduciary... Facilities § 550.150 Who is responsible for the exercise of fiduciary powers? The exercise of your fiduciary... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

12 CFR 550.150 - Who is responsible for the exercise of fiduciary powers?

Code of Federal Regulations, 2013 CFR

2013-01-01

... 12 Banks and Banking 6 2013-01-01 2012-01-01 true Who is responsible for the exercise of fiduciary... Facilities § 550.150 Who is responsible for the exercise of fiduciary powers? The exercise of your fiduciary... responsibilities, the board may assign any function related to the exercise of fiduciary powers to any director...

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.

Color-quality control using color-difference formulas: progress and problems

NASA Astrophysics Data System (ADS)

Melgosa, M.; Gómez-Robledo, L.; García, P. A.; Morillas, S.; Fernández-Maloigne, C.; Richard, N.; Huang, M.; Li, C.; Cui, G.

2017-08-01

We report on some recent advances in industrial color-difference evaluation focused in three main fields: Development of reliable experimental visual datasets; proposal of new color spaces and color-difference formulas; tools to evaluate the merits of color-difference formulas. The use of fuzzy techniques to assign consistency degrees to color pairs in combined visual datasets is described. The CIE/ISO joint proposal of the CIEDE2000 color-difference formula as a standard will facilitate the communication among companies and users. The CIE recommendation of the STRESS index to assess observers' variability and relative merits of different color-difference formulas is reported. Power functions are an efficient method to improve the performance of modern color-difference formulas. We need of advanced color-difference formulas accounting for new materials with different kind of textures and gonioapparent effects.

Battery cars on superconducting magnetically levitated carriers: One commuting solution

NASA Technical Reports Server (NTRS)

Briggs, B. Mike; Oman, Henry

1992-01-01

Commuting to work in an urban-suburban metropolitan environment is becoming an unpleasant time-wasting process. We applied the technology of communication management to this commuting problem. Communication management is a system-engineering tool that produced today's efficient telephone network. The resulting best commuting option is magnetically levitated carriers of two-passenger, battery-powered, personally-owned local-travel cars. A commuter drives a car to a nearby station, selects a destination, drives on a waiting carrier, and enters an accelerating ramp. A central computer selects an optimum 100 miles-per-hour trunk route, considering existing and forecast traffic; assigns the commuter a travel slot, and subsequently orders switching-station actions. The commuter uses the expensive facilities for only a few minutes during each trip. The cost of travel could be less than 6 cents per mile.

Nurses' perceptions of individual and organizational political reasons for horizontal peer bullying.

PubMed

Katrinli, Alev; Atabay, Gulem; Gunay, Gonca; Cangarli, Burcu Guneri

2010-09-01

Nurses are exposed to bullying for various reasons. It has been argued that the reason for bullying can be political, meaning that the behavior occurs to serve the self-interests of the perpetrators. This study aims to identify how nurses perceive the relevance of individual and political reasons for bullying behaviors. In February 2009 a survey was conducted with nurses working in a research and training hospital located in Turkey. The results showed that the aim of influencing promotion, task assignments, performance appraisal, recruitment, dismissal, allocation of equipment and operational means, together with allocation of personal benefits and organizational structure decisions, were perceived as potential political reasons for bullying by nurses. Moreover, the reasons for the various bullying behaviors were perceived as relevant to individual characteristics, namely, the perpetrators' need for power, and their psychological and private life problems.

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…

75 FR 42790 - Exelon Generation Company, LLC; Clinton Power Station; Environmental Assessment and Finding of No...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-22

... functions, and replace a Mechanical Maintenance person with a NLO. The regulation at 10 CFR 50.54(q) states... assigned other functions, and replace a Mechanical Maintenance person with a NLO. According to the licensee... to plant personnel work assignments. No changes will be made to plant buildings or the site property...

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

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

Solving optimization problems on computational grids.

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

Wright, S. J.; Mathematics and Computer Science

2001-05-01

Multiprocessor computing platforms, which have become more and more widely available since the mid-1980s, are now heavily used by organizations that need to solve very demanding computational problems. Parallel computing is now central to the culture of many research communities. Novel parallel approaches were developed for global optimization, network optimization, and direct-search methods for nonlinear optimization. Activity was particularly widespread in parallel branch-and-bound approaches for various problems in combinatorial and network optimization. As the cost of personal computers and low-end workstations has continued to fall, while the speed and capacity of processors and networks have increased dramatically, 'cluster' platforms havemore » become popular in many settings. A somewhat different type of parallel computing platform know as a computational grid (alternatively, metacomputer) has arisen in comparatively recent times. Broadly speaking, this term refers not to a multiprocessor with identical processing nodes but rather to a heterogeneous collection of devices that are widely distributed, possibly around the globe. The advantage of such platforms is obvious: they have the potential to deliver enormous computing power. Just as obviously, however, the complexity of grids makes them very difficult to use. The Condor team, headed by Miron Livny at the University of Wisconsin, were among the pioneers in providing infrastructure for grid computations. More recently, the Globus project has developed technologies to support computations on geographically distributed platforms consisting of high-end computers, storage and visualization devices, and other scientific instruments. In 1997, we started the metaneos project as a collaborative effort between optimization specialists and the Condor and Globus groups. Our aim was to address complex, difficult optimization problems in several areas, designing and implementing the algorithms and the software infrastructure need to solve these problems on computational grids. This article describes some of the results we have obtained during the first three years of the metaneos project. Our efforts have led to development of the runtime support library MW for implementing algorithms with master-worker control structure on Condor platforms. This work is discussed here, along with work on algorithms and codes for integer linear programming, the quadratic assignment problem, and stochastic linear programmming. Our experiences in the metaneos project have shown that cheap, powerful computational grids can be used to tackle large optimization problems of various types. In an industrial or commercial setting, the results demonstrate that one may not have to buy powerful computational servers to solve many of the large problems arising in areas such as scheduling, portfolio optimization, or logistics; the idle time on employee workstations (or, at worst, an investment in a modest cluster of PCs) may do the job. For the optimization research community, our results motivate further work on parallel, grid-enabled algorithms for solving very large problems of other types. The fact that very large problems can be solved cheaply allows researchers to better understand issues of 'practical' complexity and of the role of heuristics.« less

Active Learning: A PowerPoint Tutorial

ERIC Educational Resources Information Center

Gareis, Elisabeth

2007-01-01

Individual or group presentations are common assignments in business communication courses, and many students use PowerPoint slides as audiovisual support. Frequently, curriculum constraints don't allow instructors much time to teach effective design and delivery of presentation graphics in their courses; guidelines in the form of minilectures or…

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.

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.

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

Teaching Physics to Environmental Science Majors Using a Flipped Course Approach

NASA Astrophysics Data System (ADS)

Hill, N. B.; Riha, S. J.; Wysocki, M. W.

2014-12-01

Coursework in physics provides a framework for quantitative reasoning and problem solving skill development in budding geoscientists. To make physical concepts more accessible and relevant to students majoring in environmental science, an environmental physics course was developed at Cornell University and offered for the first time during spring 2014. Principles of radiation, thermodynamics, and mechanics were introduced and applied to the atmosphere, hydrosphere, and lithosphere to describe energy and mass transfers in natural and built environments. Environmental physics was designed as a flipped course where students viewed online material outside of class and worked in groups in class to solve sustainability problems. Experiential learning, just-in-time teaching, and peer collaboration strategies were also utilized. In-class problems were drawn from both local and global environmental sustainability concerns. Problems included an investigation of Cornell's lake source cooling system, calculations on the energy consumed in irrigation with groundwater in the southwestern United States, and power generated by wind turbines at various locations around the world. Class attendance was high, with at least 84% of students present at each meeting. Survey results suggest that students enjoyed working in groups and found the in-class problems helpful for assimilating the assigned material. However, some students reported that the workload was too heavy and they preferred traditional lectures to the flipped classroom. The instructors were able to actively engage with students and quickly identify knowledge and skill gaps that needed to be addressed. Overall, the integration of current environmental problems and group work into an introductory physics course could help to inspire and motivate students as they advance their ability to analyze problems quantitatively.

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.

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

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.

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 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

Code of Federal Regulations, 2011 CFR

2011-10-01

... operation determine whether a station is within an “80 km circle.” (i) The maximum ERP for low power... ERP for low power operation on these frequencies is as follows: Operation Low side of frequency pair.... (2) Operation on these frequencies is limited to 6 watts ERP for base, mobile or operational fixed...

Internal radiation exposure of Ground Self-Defense Force members involved in the management of the Fukushima Nuclear Power Plant disaster.

PubMed

Naoi, Yutaka; Fujikawa, Akira; Kyoto, Yukishige; Kunishima, Naoaki; Ono, Masahiro; Watanabe, Yukie

2013-01-01

When the Great East Japan Earthquake occurred on March 11, 2011, the Ground Self-Defense Force (GSDF) was dispatched nationally to Northeast area in Japan. The highly trained GSDF members were simultaneously assigned to various missions for the Fukushima Nuclear Power Plants disaster. The missions of GSDF terminated on August 31, 2011. Special medical examinations were conducted for the members as they returned to each military unit. GSDF members who were assigned to the nuclear power plant were at risk of radiation exposure; therefore, pocket dosimeters were used to assess external radiation exposure. A few months after the mission was terminated, measurements of internal radiation exposure were performed. This is the first report of the internal exposure of GSDF members who worked in the restricted radiation contamination area. Here, we report the amounts of internal and external exposure of and the equipment used by the GSDF members.

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

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

Treesearch

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

2013-01-01

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

Beyond the Bridge Metaphor: Rethinking the Place of the Literacy Narrative in the Basic Writing Curriculum

ERIC Educational Resources Information Center

Hall, Anne-Marie; Minnix, Christopher

2012-01-01

Critical analysis of the literacy narrative assignment within the context of the other genres in a basic writing course complicates understandings of the political import of the assignment. While several advocates of the literacy narrative have argued that it has the power of what Jean-François Lyotard has called petits récits, the authors argue…

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

Curry, J J; Gallagher, D W; Modarres, M

Appendices are presented concerning isolation condenser makeup; vapor suppression system; station air system; reactor building closed cooling water system; turbine building secondary closed water system; service water system; emergency service water system; fire protection system; emergency ac power; dc power system; event probability estimation; methodology of accident sequence quantification; and assignment of dominant sequences to release categories.

47 CFR 27.1202 - Cable/BRS cross-ownership.

Code of Federal Regulations, 2010 CFR

2010-10-01

... MISCELLANEOUS WIRELESS COMMUNICATIONS SERVICES Broadband Radio Service and Educational Broadband Service § 27... modifications, assignments or transfers of control by cable operators of BRS stations shall include a showing... who holds or shares the power to vote such stock, to any person who has the sole power to sell such...

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

Credit risk identification and suggestions of electricity market

NASA Astrophysics Data System (ADS)

He, Chuan; Wang, Haichao; Chen, Zhongyuan; Hao, Yuxing; Jiang, Hailong; Qian, Hanhan; Wang, Meibao

2018-03-01

The power industry has a long history of credit problems, and the power industry has credit problems such as power users defaulting on electricity bills before the new electricity reform. With the reform of the power system, the credit problems in the power industry will be more complicated. How to effectively avoid the risk factors existing in the course of market operation and how to safeguard the fairness and standardization of market operation is an urgent problem to be solved. This paper first describes the credit risk in power market, and analyzes the components of credit risk identification in power market, puts forward suggestions on power market risk management.

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

PubMed

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

2017-07-19

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

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.

Preference option randomized design (PORD) for comparative effectiveness research: Statistical power for testing comparative effect, preference effect, selection effect, intent-to-treat effect, and overall effect.

PubMed

Heo, Moonseong; Meissner, Paul; Litwin, Alain H; Arnsten, Julia H; McKee, M Diane; Karasz, Alison; McKinley, Paula; Rehm, Colin D; Chambers, Earle C; Yeh, Ming-Chin; Wylie-Rosett, Judith

2017-01-01

Comparative effectiveness research trials in real-world settings may require participants to choose between preferred intervention options. A randomized clinical trial with parallel experimental and control arms is straightforward and regarded as a gold standard design, but by design it forces and anticipates the participants to comply with a randomly assigned intervention regardless of their preference. Therefore, the randomized clinical trial may impose impractical limitations when planning comparative effectiveness research trials. To accommodate participants' preference if they are expressed, and to maintain randomization, we propose an alternative design that allows participants' preference after randomization, which we call a "preference option randomized design (PORD)". In contrast to other preference designs, which ask whether or not participants consent to the assigned intervention after randomization, the crucial feature of preference option randomized design is its unique informed consent process before randomization. Specifically, the preference option randomized design consent process informs participants that they can opt out and switch to the other intervention only if after randomization they actively express the desire to do so. Participants who do not independently express explicit alternate preference or assent to the randomly assigned intervention are considered to not have an alternate preference. In sum, preference option randomized design intends to maximize retention, minimize possibility of forced assignment for any participants, and to maintain randomization by allowing participants with no or equal preference to represent random assignments. This design scheme enables to define five effects that are interconnected with each other through common design parameters-comparative, preference, selection, intent-to-treat, and overall/as-treated-to collectively guide decision making between interventions. Statistical power functions for testing all these effects are derived, and simulations verified the validity of the power functions under normal and binomial distributions.

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

PubMed

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

2011-03-01

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

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

Model of load distribution for earth observation satellite

NASA Astrophysics Data System (ADS)

Tu, Shumin; Du, Min; Li, Wei

2017-03-01

For the system of multiple types of EOS (Earth Observing Satellites), it is a vital issue to assure that each type of payloads carried by the group of EOS can be used efficiently and reasonably for in astronautics fields. Currently, most of researches on configuration of satellite and payloads focus on the scheduling for launched satellites. However, the assignments of payloads for un-launched satellites are bit researched, which are the same crucial as the scheduling of tasks. Moreover, the current models of satellite resources scheduling lack of more general characteristics. Referring the idea about roles-based access control (RBAC) of information system, this paper brings forward a model based on role-mining of RBAC to improve the generality and foresight of the method of assignments of satellite-payload. By this way, the assignment of satellite-payload can be mapped onto the problem of role-mining. A novel method will be introduced, based on the idea of biclique-combination in graph theory and evolutionary algorithm in intelligence computing, to address the role-mining problem of satellite-payload assignments. The simulation experiments are performed to verify the novel method. Finally, the work of this paper is concluded.

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.

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.

The Thinnest Path Problem

DTIC Science & Technology

2016-07-22

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

Bayesian modelling of uncertainties of Monte Carlo radiative-transfer simulations

NASA Astrophysics Data System (ADS)

Beaujean, Frederik; Eggers, Hans C.; Kerzendorf, Wolfgang E.

2018-07-01

One of the big challenges in astrophysics is the comparison of complex simulations to observations. As many codes do not directly generate observables (e.g. hydrodynamic simulations), the last step in the modelling process is often a radiative-transfer treatment. For this step, the community relies increasingly on Monte Carlo radiative transfer due to the ease of implementation and scalability with computing power. We consider simulations in which the number of photon packets is Poisson distributed, while the weight assigned to a single photon packet follows any distribution of choice. We show how to estimate the statistical uncertainty of the sum of weights in each bin from the output of a single radiative-transfer simulation. Our Bayesian approach produces a posterior distribution that is valid for any number of packets in a bin, even zero packets, and is easy to implement in practice. Our analytic results for large number of packets show that we generalize existing methods that are valid only in limiting cases. The statistical problem considered here appears in identical form in a wide range of Monte Carlo simulations including particle physics and importance sampling. It is particularly powerful in extracting information when the available data are sparse or quantities are small.

Two-Level Scheduling for Video Transmission over Downlink OFDMA Networks

PubMed Central

Tham, Mau-Luen

2016-01-01

This paper presents a two-level scheduling scheme for video transmission over downlink orthogonal frequency-division multiple access (OFDMA) networks. It aims to maximize the aggregate quality of the video users subject to the playback delay and resource constraints, by exploiting the multiuser diversity and the video characteristics. The upper level schedules the transmission of video packets among multiple users based on an overall target bit-error-rate (BER), the importance level of packet and resource consumption efficiency factor. Instead, the lower level renders unequal error protection (UEP) in terms of target BER among the scheduled packets by solving a weighted sum distortion minimization problem, where each user weight reflects the total importance level of the packets that has been scheduled for that user. Frequency-selective power is then water-filled over all the assigned subcarriers in order to leverage the potential channel coding gain. Realistic simulation results demonstrate that the proposed scheme significantly outperforms the state-of-the-art scheduling scheme by up to 6.8 dB in terms of peak-signal-to-noise-ratio (PSNR). Further test evaluates the suitability of equal power allocation which is the common assumption in the literature. PMID:26906398

Ubiquitous Green Computing Techniques for High Demand Applications in Smart Environments

PubMed Central

Zapater, Marina; Sanchez, Cesar; Ayala, Jose L.; Moya, Jose M.; Risco-Martín, José L.

2012-01-01

Ubiquitous sensor network deployments, such as the ones found in Smart cities and Ambient intelligence applications, require constantly increasing high computational demands in order to process data and offer services to users. The nature of these applications imply the usage of data centers. Research has paid much attention to the energy consumption of the sensor nodes in WSNs infrastructures. However, supercomputing facilities are the ones presenting a higher economic and environmental impact due to their very high power consumption. The latter problem, however, has been disregarded in the field of smart environment services. This paper proposes an energy-minimization workload assignment technique, based on heterogeneity and application-awareness, that redistributes low-demand computational tasks from high-performance facilities to idle nodes with low and medium resources in the WSN infrastructure. These non-optimal allocation policies reduce the energy consumed by the whole infrastructure and the total execution time. PMID:23112621

Self-adjoint elliptic operators with boundary conditions on not closed hypersurfaces

NASA Astrophysics Data System (ADS)

Mantile, Andrea; Posilicano, Andrea; Sini, Mourad

2016-07-01

The theory of self-adjoint extensions of symmetric operators is used to construct self-adjoint realizations of a second-order elliptic differential operator on Rn with linear boundary conditions on (a relatively open part of) a compact hypersurface. Our approach allows to obtain Kreĭn-like resolvent formulae where the reference operator coincides with the ;free; operator with domain H2 (Rn); this provides an useful tool for the scattering problem from a hypersurface. Concrete examples of this construction are developed in connection with the standard boundary conditions, Dirichlet, Neumann, Robin, δ and δ‧-type, assigned either on a (n - 1) dimensional compact boundary Γ = ∂ Ω or on a relatively open part Σ ⊂ Γ. Schatten-von Neumann estimates for the difference of the powers of resolvents of the free and the perturbed operators are also proven; these give existence and completeness of the wave operators of the associated scattering systems.

Comparing virtual reality exposure therapy to present-centered therapy with 11 U.S. Vietnam veterans with PTSD.

PubMed

Ready, David J; Gerardi, Robert J; Backscheider, Andrea G; Mascaro, Nathan; Rothbaum, Barbara Olasov

2010-02-01

Eleven Vietnam veterans with war-related posttraumatic stress disorder (PTSD) were randomly assigned to 10 sessions of either virtual reality exposure (VRE) therapy within a computer-generated virtual Vietnam environment or present-centered therapy (PCT) that avoided traumatic content and utilized a problem-solving approach. Participants were assessed at pretreatment, posttreatment, and 6 months posttreatment by an independent assessor blind to treatment condition. Nine participants completed treatment with one dropout per condition. No significant differences emerged between treatments, likely due to insufficient power. Although comparison of mean changes in PTSD symptoms for the VRE and PCT conditions yielded a moderate effect size (d = 0.56) in favor of VRE at 6 months posttreatment, changes in PTSD scores were more variable, and therefore less reliable, within the VRE condition. The utility of VRE with older veterans with PTSD is discussed.

Formation of the priority directions of innovative strategic energy management

NASA Astrophysics Data System (ADS)

Mottaeva, Asiiat; Minnullina, Anna

2017-10-01

Article is devoted to the matter of the ensuring long-term potential of dynamic growth of the Russian economy, its sustainable development in which the special role is assigned to the energy industry. Inclusion of the stage of management of the human capital, which becomes one of priority levers in the field of management of the industrial enterprises, into the in structure of strategy of planning subsequently represents one of innovative steps at the heart of power management. In work the algorithm of the development of the key performance indicators of the human capital on the basis of stage-by-stage problem definition of energy saving, search of the centers of responsibility in energy consumption and quality control of the involved productions is offered in the article. The application of the offered innovative algorithm might promote the formation of high culture of energy saving and the decrease in the level of resistance to organizational changes.

Ubiquitous green computing techniques for high demand applications in Smart environments.

PubMed

Zapater, Marina; Sanchez, Cesar; Ayala, Jose L; Moya, Jose M; Risco-Martín, José L

2012-01-01

Ubiquitous sensor network deployments, such as the ones found in Smart cities and Ambient intelligence applications, require constantly increasing high computational demands in order to process data and offer services to users. The nature of these applications imply the usage of data centers. Research has paid much attention to the energy consumption of the sensor nodes in WSNs infrastructures. However, supercomputing facilities are the ones presenting a higher economic and environmental impact due to their very high power consumption. The latter problem, however, has been disregarded in the field of smart environment services. This paper proposes an energy-minimization workload assignment technique, based on heterogeneity and application-awareness, that redistributes low-demand computational tasks from high-performance facilities to idle nodes with low and medium resources in the WSN infrastructure. These non-optimal allocation policies reduce the energy consumed by the whole infrastructure and the total execution time.

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.

Exploring Students' Engineering Designs through Open-Ended Assignments

ERIC Educational Resources Information Center

Puente, S. M. Gómez; Jansen, J. W.

2017-01-01

This paper aims at presenting the experience of the Power Conversion project in teaching students to design a proof-of-principle contactless energy transfer system for the charging of electrical vehicles. The Power Conversion is a second-year electrical engineering (EE) project in which students are to gather and apply EE knowledge to design and…

77 FR 28797 - Redundancy of Communications Systems: Backup Power Private Land Mobile Radio Services: Selection...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-16

... Systems: Backup Power Private Land Mobile Radio Services: Selection and Assignment of Frequencies, and... certain rule provisions that are without current legal effect and obsolete. These nonsubstantive revisions... current legal effect and is deleted as obsolete. 2. This Order also deletes a rule providing that UHF...

The Power of the Test for Treatment Effects in Three-Level Block Randomized Designs

ERIC Educational Resources Information Center

Konstantopoulos, Spyros

2008-01-01

Experiments that involve nested structures may assign treatment conditions either to subgroups (such as classrooms) or individuals within subgroups (such as students). The design of such experiments requires knowledge of the intraclass correlation structure to compute the sample sizes necessary to achieve adequate power to detect the treatment…

47 CFR 74.791 - Digital call signs.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Booster Stations § 74.791 Digital call signs. (a) Digital low power stations. Call signs for digital low power stations will be made up of a prefix consisting of the initial letter K or W followed by the channel number assigned to the station and two additional letters and a suffix consisting of the letters...

47 CFR 74.791 - Digital call signs.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Booster Stations § 74.791 Digital call signs. (a) Digital low power stations. Call signs for digital low power stations will be made up of a prefix consisting of the initial letter K or W followed by the channel number assigned to the station and two additional letters and a suffix consisting of the letters...

47 CFR 74.791 - Digital call signs.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Booster Stations § 74.791 Digital call signs. (a) Digital low power stations. Call signs for digital low power stations will be made up of a prefix consisting of the initial letter K or W followed by the channel number assigned to the station and two additional letters and a suffix consisting of the letters...

47 CFR 74.791 - Digital call signs.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Booster Stations § 74.791 Digital call signs. (a) Digital low power stations. Call signs for digital low power stations will be made up of a prefix consisting of the initial letter K or W followed by the channel number assigned to the station and two additional letters and a suffix consisting of the letters...

A More Powerful Test in Three-Level Cluster Randomized Designs

ERIC Educational Resources Information Center

Konstantopoulos, Spyros

2011-01-01

Field experiments that involve nested structures frequently assign treatment conditions to entire groups (such as schools). A key aspect of the design of such experiments includes knowledge of the clustering effects that are often expressed via intraclass correlation. This study provides methods for constructing a more powerful test for the…

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.

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.

Impacts of demand response and renewable generation in electricity power market

NASA Astrophysics Data System (ADS)

Zhao, Zhechong

This thesis presents the objective of the research which is to analyze the impacts of uncertain wind power and demand response on power systems operation and power market clearing. First, in order to effectively utilize available wind generation, it is usually given the highest priority by assigning zero or negative energy bidding prices when clearing the day-ahead electric power market. However, when congestion occurs, negative wind bidding prices would aggravate locational marginal prices (LMPs) to be negative in certain locations. A load shifting model is explored to alleviate possible congestions and enhance the utilization of wind generation, by shifting proper amount of load from peak hours to off peaks. The problem is to determine proper amount of load to be shifted, for enhancing the utilization of wind generation, alleviating transmission congestions, and making LMPs to be non-negative values. The second piece of work considered the price-based demand response (DR) program which is a mechanism for electricity consumers to dynamically manage their energy consumption in response to time-varying electricity prices. It encourages consumers to reduce their energy consumption when electricity prices are high, and thereby reduce the peak electricity demand and alleviate the pressure to power systems. However, it brings additional dynamics and new challenges on the real-time supply and demand balance. Specifically, price-sensitive DR load levels are constantly changing in response to dynamic real-time electricity prices, which will impact the economic dispatch (ED) schedule and in turn affect electricity market clearing prices. This thesis adopts two methods for examining the impacts of different DR price elasticity characteristics on the stability performance: a closed-loop iterative simulation method and a non-iterative method based on the contraction mapping theorem. This thesis also analyzes the financial stability of DR load consumers, by incorporating explicit LMP formulations and consumer payment requirements into the network-constrained unit commitment (NCUC) problem. The proposed model determines the proper amount of DR loads to be shifted from peak hours to off-peaks under ISO's direct load control, for reducing the operation cost and ensuring that consumer payments of DR loads will not deteriorate significantly after load shifting. Both MINLP and MILP models are discussed, and improved formulation strategies are presented.

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…

Effects of Cognitive Strategy Interventions and Cognitive Moderators on Word Problem Solving in Children at Risk for Problem Solving Difficulties

ERIC Educational Resources Information Center

Swanson, H. Lee; Lussier, Cathy; Orosco, Michael

2013-01-01

This study investigated the role of strategy instruction and cognitive abilities on word problem solving accuracy in children with math difficulties (MD). Elementary school children (N = 120) with and without MD were randomly assigned to 1 of 4 conditions: general-heuristic (e.g., underline question sentence), visual-schematic presentation…

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

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

PubMed

Overbeck, J R; Park, B

2001-10-01

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

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

ERIC Educational Resources Information Center

Price, Bennett J.

1989-01-01

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

Non-rigid image registration using graph-cuts.

PubMed

Tang, Tommy W H; Chung, Albert C S

2007-01-01

Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local minimum in a strong sense. Thus, it is interesting to see the effects of using graph-cuts in non-rigid image registration. In this paper, we formulate non-rigid image registration as a discrete labeling problem. Each pixel in the source image is assigned a displacement label (which is a vector) indicating which position in the floating image it is spatially corresponding to. A smoothness constraint based on first derivative is used to penalize sharp changes in displacement labels across pixels. The whole system can be optimized by using the graph-cuts method via alpha-expansions. We compare 2D and 3D registration results of our method with two state-of-the-art approaches. It is found that our method is more robust to different challenging non-rigid registration cases with higher registration accuracy.

A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

DOE PAGES

Song, Fengguang; Dongarra, Jack

2014-10-01

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU-GPU systems to solve dense linear algebra problems, in this paper we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasksmore » without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double-precision Cholesky factorization and QR factorization. Finally, our approach demonstrates a performance comparable to Intel MKL on shared-memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared-memory systems with multiple GPUs.« less

Minimum Interference Planar Geometric Topology in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Nguyen, Trac N.; Huynh, Dung T.

The approach of using topology control to reduce interference in wireless sensor networks has attracted attention of several researchers. There are at least two definitions of interference in the literature. In a wireless sensor network the interference at a node may be caused by an edge that is transmitting data [15], or it occurs because the node itself is within the transmission range of another [3], [1], [6]. In this paper we show that the problem of assigning power to nodes in the plane to yield a planar geometric graph whose nodes have bounded interference is NP-complete under both interference definitions. Our results provide a rigorous proof for a theorem in [15] whose proof is unconvincing. They also address one of the open issues raised in [6] where Halldórsson and Tokuyama were concerned with the receiver model of node interference, and derived an O(sqrt {Δ}) upper bound for the maximum node interference of a wireless ad hoc network in the plane (Δ is the maximum interference of the so-called uniform radius network). The question as to whether this problem is NP-complete in the 2-dimensional case was left open.

A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

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

Song, Fengguang; Dongarra, Jack

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU-GPU systems to solve dense linear algebra problems, in this paper we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasksmore » without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double-precision Cholesky factorization and QR factorization. Finally, our approach demonstrates a performance comparable to Intel MKL on shared-memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared-memory systems with multiple GPUs.« less

Power Quality Improvement by Unified Power Quality Conditioner Based on CSC Topology Using Synchronous Reference Frame Theory

PubMed Central

Dharmalingam, Rajasekaran; Dash, Subhransu Sekhar; Senthilnathan, Karthikrajan; Mayilvaganan, Arun Bhaskar; Chinnamuthu, Subramani

2014-01-01

This paper deals with the performance of unified power quality conditioner (UPQC) based on current source converter (CSC) topology. UPQC is used to mitigate the power quality problems like harmonics and sag. The shunt and series active filter performs the simultaneous elimination of current and voltage problems. The power fed is linked through common DC link and maintains constant real power exchange. The DC link is connected through the reactor. The real power supply is given by the photovoltaic system for the compensation of power quality problems. The reference current and voltage generation for shunt and series converter is based on phase locked loop and synchronous reference frame theory. The proposed UPQC-CSC design has superior performance for mitigating the power quality problems. PMID:25013854

Power quality improvement by unified power quality conditioner based on CSC topology using synchronous reference frame theory.

PubMed

Dharmalingam, Rajasekaran; Dash, Subhransu Sekhar; Senthilnathan, Karthikrajan; Mayilvaganan, Arun Bhaskar; Chinnamuthu, Subramani

2014-01-01

This paper deals with the performance of unified power quality conditioner (UPQC) based on current source converter (CSC) topology. UPQC is used to mitigate the power quality problems like harmonics and sag. The shunt and series active filter performs the simultaneous elimination of current and voltage problems. The power fed is linked through common DC link and maintains constant real power exchange. The DC link is connected through the reactor. The real power supply is given by the photovoltaic system for the compensation of power quality problems. The reference current and voltage generation for shunt and series converter is based on phase locked loop and synchronous reference frame theory. The proposed UPQC-CSC design has superior performance for mitigating the power quality problems.

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.

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

PubMed

Waples, Robin S

2010-07-01

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

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.

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

Marquez, Andres; Manzano Franco, Joseph B.; Song, Shuaiwen

With Exascale performance and its challenges in mind, one ubiquitous concern among architects is energy efficiency. Petascale systems projected to Exascale systems are unsustainable at current power consumption rates. One major contributor to system-wide power consumption is the number of memory operations leading to data movement and management techniques applied by the runtime system. To address this problem, we present the concept of the Architected Composite Data Types (ACDT) framework. The framework is made aware of data composites, assigning them a specific layout, transformations and operators. Data manipulation overhead is amortized over a larger number of elements and program performancemore » and power efficiency can be significantly improved. We developed the fundamentals of an ACDT framework on a massively multithreaded adaptive runtime system geared towards Exascale clusters. Showcasing the capability of ACDT, we exercised the framework with two representative processing kernels - Matrix Vector Multiply and the Cholesky Decomposition – applied to sparse matrices. As transformation modules, we applied optimized compress/decompress engines and configured invariant operators for maximum energy/performance efficiency. Additionally, we explored two different approaches based on transformation opaqueness in relation to the application. Under the first approach, the application is agnostic to compression and decompression activity. Such approach entails minimal changes to the original application code, but leaves out potential applicationspecific optimizations. The second approach exposes the decompression process to the application, hereby exposing optimization opportunities that can only be exploited with application knowledge. The experimental results show that the two approaches have their strengths in HW and SW respectively, where the SW approach can yield performance and power improvements that are an order of magnitude better than ACDT-oblivious, hand-optimized implementations.We consider the ACDT runtime framework an important component of compute nodes that will lead towards power efficient Exascale clusters.« less

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

Fair Package Assignment

NASA Astrophysics Data System (ADS)

Lahaie, Sébastien; Parkes, David C.

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

Symbolically Modeling Concurrent MCAPI Executions

NASA Technical Reports Server (NTRS)

Fischer, Topher; Mercer, Eric; Rungta, Neha

2011-01-01

Improper use of Inter-Process Communication (IPC) within concurrent systems often creates data races which can lead to bugs that are challenging to discover. Techniques that use Satisfiability Modulo Theories (SMT) problems to symbolically model possible executions of concurrent software have recently been proposed for use in the formal verification of software. In this work we describe a new technique for modeling executions of concurrent software that use a message passing API called MCAPI. Our technique uses an execution trace to create an SMT problem that symbolically models all possible concurrent executions and follows the same sequence of conditional branch outcomes as the provided execution trace. We check if there exists a satisfying assignment to the SMT problem with respect to specific safety properties. If such an assignment exists, it provides the conditions that lead to the violation of the property. We show how our method models behaviors of MCAPI applications that are ignored in previously published techniques.

47 CFR 73.702 - Assignment and use of frequencies.

Code of Federal Regulations, 2010 CFR

2010-10-01

... less than 100 kW is used. In this case, antenna gain on restricted azimuths shall not exceed that which... gain for transmitter powers less than 100 kW: ER10au05.065 Where: Gi = maximum gain permitted with... transmit to such zones or areas on each frequency, and the power, antenna gain, and antenna bearing it...

A Fuzzy Goal Programming for a Multi-Depot Distribution Problem

NASA Astrophysics Data System (ADS)

Nunkaew, Wuttinan; Phruksaphanrat, Busaba

2010-10-01

A fuzzy goal programming model for solving a Multi-Depot Distribution Problem (MDDP) is proposed in this research. This effective proposed model is applied for solving in the first step of Assignment First-Routing Second (AFRS) approach. Practically, a basic transportation model is firstly chosen to solve this kind of problem in the assignment step. After that the Vehicle Routing Problem (VRP) model is used to compute the delivery cost in the routing step. However, in the basic transportation model, only depot to customer relationship is concerned. In addition, the consideration of customer to customer relationship should also be considered since this relationship exists in the routing step. Both considerations of relationships are solved using Preemptive Fuzzy Goal Programming (P-FGP). The first fuzzy goal is set by a total transportation cost and the second fuzzy goal is set by a satisfactory level of the overall independence value. A case study is used for describing the effectiveness of the proposed model. Results from the proposed model are compared with the basic transportation model that has previously been used in this company. The proposed model can reduce the actual delivery cost in the routing step owing to the better result in the assignment step. Defining fuzzy goals by membership functions are more realistic than crisps. Furthermore, flexibility to adjust goals and an acceptable satisfactory level for decision maker can also be increased and the optimal solution can be obtained.

Development of parallel algorithms for electrical power management in space applications

NASA Technical Reports Server (NTRS)

Berry, Frederick C.

1989-01-01

The application of parallel techniques for electrical power system analysis is discussed. The Newton-Raphson method of load flow analysis was used along with the decomposition-coordination technique to perform load flow analysis. The decomposition-coordination technique enables tasks to be performed in parallel by partitioning the electrical power system into independent local problems. Each independent local problem represents a portion of the total electrical power system on which a loan flow analysis can be performed. The load flow analysis is performed on these partitioned elements by using the Newton-Raphson load flow method. These independent local problems will produce results for voltage and power which can then be passed to the coordinator portion of the solution procedure. The coordinator problem uses the results of the local problems to determine if any correction is needed on the local problems. The coordinator problem is also solved by an iterative method much like the local problem. The iterative method for the coordination problem will also be the Newton-Raphson method. Therefore, each iteration at the coordination level will result in new values for the local problems. The local problems will have to be solved again along with the coordinator problem until some convergence conditions are met.

Nurturing Students' Problem-Solving Skills and Engagement in Computer-Mediated Communications (CMC)

ERIC Educational Resources Information Center

Chen, Ching-Huei

2014-01-01

The present study sought to investigate how to enhance students' well- and ill-structured problem-solving skills and increase productive engagement in computer-mediated communication with the assistance of external prompts, namely procedural and reflection. Thirty-three graduate students were randomly assigned to two conditions: procedural and…

Flight Director works out problem during STS-61 simulations

NASA Image and Video Library

1993-09-01

Flight Director Robert E. Castle Jr. works out a problem during joint integrated simulations for the STS-61 mission. Astronauts assigned to extravehicular activity (EVA) tasks with the Hubble Space Telescope (HST) were simultaneously rehearsing in a neutral buoyancy tank at the Marshall Space Flight Center (MSFC) in Alabama.

Problems and Solutions in Evaluating Child Outcomes of Large-Scale Educational Programs.

ERIC Educational Resources Information Center

Abrams, Allan S.; And Others

1979-01-01

Evaluation of large-scale programs is problematical because of inherent bias in assignment of treatment and control groups, resulting in serious regression artifacts even with the use of analysis of covariance designs. Nonuniformity of program implementation across sites and classrooms is also a problem. (Author/GSK)

Effects of a Multifocused Prevention Program on Preschool Children's Competencies and Behavior Problems

ERIC Educational Resources Information Center

Stefan, Catrinel A.; Miclea, Mircea

2013-01-01

This study was designed to assess the effectiveness of a multifocused (child-, teacher- and parent-focused) prevention program for Romanian preschoolers, targeting social--emotional competence development, as well as reduction of behavior problems. Fourteen classrooms were randomly assigned to the intervention and control conditions. Subsequent…

Can Group Discussions and Individualized Assignments Help More Students Succeed in Developmental Mathematics?

ERIC Educational Resources Information Center

Jaafar, Reem

2015-01-01

Students taking developmental mathematics courses resist attempting word problems when they are presented to them. Although word problems can help students contextualize learning, develop better understanding of the concepts and apply world knowledge, they constitute an impediment to students' progress in developmental mathematics courses. A…

Mesh and Time-Step Independent Computational Fluid Dynamics (CFD) Solutions

ERIC Educational Resources Information Center

Nijdam, Justin J.

2013-01-01

A homework assignment is outlined in which students learn Computational Fluid Dynamics (CFD) concepts of discretization, numerical stability and accuracy, and verification in a hands-on manner by solving physically realistic problems of practical interest to engineers. The students solve a transient-diffusion problem numerically using the common…

Education's Role in National Development Plans: Ten Country Cases.

ERIC Educational Resources Information Center

Thomas, R. Murray, Ed.

The place education has been assigned in the national development programs of 10 nations is discussed, the problems that these countries have encountered in managing education are examined, and the measures adopted to solve educational problems are assessed. Included are the following papers: (1) "The Nature of National Development…

Writing Children's Books in Sociology Class: An Innovative Approach to Teaching Social Problems to Undergraduate Students

ERIC Educational Resources Information Center

Maples, James N.; Taylor, William V.

2013-01-01

In this instructional article, we describe a non-traditional course assignment in which we ask students in our social problems courses to write, illustrate, and present a children's book about a social problem as part of the process of learning. Over the course of the semester, students utilize guided handouts to create a children's book exploring…

The Big6: Not Just for Kids! Introduction to the Big6: Information Problem-Solving for Upper High School, College-Age, and Adult Students.

ERIC Educational Resources Information Center

Eisenberg, Mike; Spitzer, Kathy

1998-01-01

Explains the Big6 approach to information problem-solving based on exercises that were developed for college or upper high school students that can be completed during class sessions. Two of the exercises relate to personal information problems, and one relates Big6 skill areas to course assignments. (LRW)

Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

DTIC Science & Technology

2015-06-24

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

Patterning of pain and power with guided imagery.

PubMed

Lewandowski, Wendy A

2004-07-01

Using Martha Rogers' science of unitary human beings, changes in pain and power among 42 patients were examined in relation to the use of a guided imagery modality. Participants were randomly assigned to treatment and control groups and repeated measures MANCOVA was used to detect differences in pain and power over a 4-day period of time. The treatment group's pain decreased during the last 2 days of the study. No differences in power emerged. Guided imagery appeared to have potential as a useful nursing modality for chronic pain sufferers.

Presidential Claims of Executive Privilege: History, Law, Practice and Recent Developments

DTIC Science & Technology

2007-07-05

assigned area of constitutional duties” and in the separation of powers .29 But although it considered a president’s communications with his close advisors...exemption serves as an important boundary marking the separation of powers . When congressional oversight “is used CRS-11 61 Smith Letter/Watt, supra n...the Executive: Hearings Before the Subcommittee on Separation of Powers of the Senate Committee on the Judiciary, 92d Cong. 1st Sess. 424 (Rehnquist

The chemical effects of the Martian environment on power system component materials: A theoretical approach

NASA Technical Reports Server (NTRS)

Perez-Davis, Marla E.; Gaier, James R.

1990-01-01

In the foreseeable future, an expedition may be undertaken to explore the planet Mars. Some of the power source options being considered for such a mission are photovoltaics, regenerative fuel cells and nuclear reactors. In addition to electrical power requirements, environmental conditions en route to Mars, in the planetary orbit and on the Martian surface must be simulated and studied in order to anticipate and solve potential problems. Space power systems components such as photovoltaic arrays, radiators, and solar concentrators may be vulnerable to degradation in the Martian environment. Natural characteristics of Mars which may pose a threat to surface power systems include high velocity winds, dust, ultraviolet radiation, large daily variation in temperature, reaction to components of the soil, atmosphere and atmospheric condensates as well as synergistic combinations. Most of the current knowledge of the characteristics of the Martian atmosphere and soil composition was obtained from the Viking 1 and 2 missions in 1976. A theoretical study is presented which was used to assess the effects of the Martian atmospheric conditions on the power systems components. A computer program written at NASA-Lewis for combustion research that uses a free energy minimization technique was used to calculate chemical equilibrium for assigned thermodynamic states of temperature and pressure. The power system component materials selected for this study include: silicon dioxide, silicon, carbon, copper, and titanium. Combinations of environments and materials considered include: (1) Mars atmosphere with power surface material, (2) Mars atmosphere and dust component with power surface material, and (3) Mars atmosphere and hydrogen peroxide or superoxide or superoxide with power system material. The chemical equilibrium calculations were performed at a composition ratio (oxidant to reactant) of 100. The temperature for the silicon dioxide material and silicon, which simulate photovoltaic cells, were 300 and 400 K; for carbon, copper and titanium, which simulate radiator surfaces, 300, 500, and 1000 K. All of the systems were evaluated at pressures of 700, 800, and 900 Pa, which stimulate the Martian atmosphere.

All Seem to Need Immediate Attention--What Should I Do First? A Successful Principal in a New School Assignment at Secundaria Revolucion

ERIC Educational Resources Information Center

Torres-Arcadia, Celina; Flores-Kastanis, Eduardo

2012-01-01

This case provides emerging school administrators the opportunity to learn about the school system in Mexico. The case relates to a successful principal in her new school assignment. Martha Miramontes is an experienced and successful principal who quickly identified a number of challenges in her new campus. Even though each problem can be solved…

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

PubMed Central

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

2016-01-01

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

EEG based time and frequency dynamics analysis of visually induced motion sickness (VIMS).

PubMed

Arsalan Naqvi, Syed Ali; Badruddin, Nasreen; Jatoi, Munsif Ali; Malik, Aamir Saeed; Hazabbah, Wan; Abdullah, Baharudin

2015-12-01

3D movies are attracting the viewers as they can see the objects flying out of the screen. However, many viewers have reported various problems which are usually faced after watching 3D movies. These problems include visual fatigue, eye strain, headaches, dizziness, blurred vision or collectively may be termed as visually induced motion sickness (VIMS). This research focuses on the comparison between 3D passive technology with a conventional 2D technology to find that whether 3D is causing trouble in the viewers or not. For this purpose, an experiment was designed in which participants were randomly assigned to watch 2D or a 3D movie. The movie was specially designed to induce VIMS. The movie was shown for the duration of 10 min to every participant. The electroencephalogram (EEG) data was recorded throughout the session. At the end of the session, participants rated their feelings using simulator sickness questionnaire (SSQ). The SSQ data was analyzed and the ratings of 2D and 3D participants were compared statistically by using a two tailed t test. From the SSQ results, it was found that participants watching 3D movies reported significantly higher symptoms of VIMS (p value <0.05). EEG data was analyzed by using MATLAB and topographic plots are created from the data. A significant difference has been observed in the frontal-theta power which increases with the passage of time in 2D condition while decreases with time in 3D condition. Also, a decrease in beta power has been found in the temporal lobe of 3D group. Therefore, it is concluded that there are negative effects of 3D movies causing significant changes in the brain activity in terms of band powers. This condition leads to produce symptoms of VIMS in the viewers.

Effects of Small-Group Tutoring with and without Validated Classroom Instruction on At-Risk Students' Math Problem Solving: Are Two Tiers of Prevention Better Than One?

PubMed

Fuchs, Lynn S; Fuchs, Douglas; Craddock, Caitlin; Hollenbeck, Kurstin N; Hamlett, Carol L; Schatschneider, Christopher

2008-01-01

The purpose of this study was to assess the effects of small-group tutoring with and without validated classroom instruction on at-risk (AR) students' math problem solving. Stratifying within schools, 119 3(rd)-grade classes were randomly assigned to conventional or validated problem-solving instruction (Hot Math [schema-broadening instruction]). Students identified as AR (n = 243) were randomly assigned, within classroom conditions, to receive Hot Math tutoring or not. Students were tested on problem-solving and math applications measures before and after 16 weeks of intervention. Analyses of variance, which accounted for the nested structure of the data, revealed the tutored students who received validated classroom instruction achieved better than tutored students who received conventional classroom instruction (ES = 1.34). However, the advantage for tutoring over no tutoring was similar whether or not students received validated or conventional classroom instruction (ESs = 1.18 and 1.13). Tutoring, not validated classroom instruction reduced the prevalence of math difficulty. Implications for responsiveness-to-intervention prevention models and for enhancing math problem-solving instruction are discussed.

Run-time scheduling and execution of loops on message passing machines

NASA Technical Reports Server (NTRS)

Crowley, Kay; Saltz, Joel; Mirchandaney, Ravi; Berryman, Harry

1989-01-01

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Run-time scheduling and execution of loops on message passing machines

NASA Technical Reports Server (NTRS)

Saltz, Joel; Crowley, Kathleen; Mirchandaney, Ravi; Berryman, Harry

1990-01-01

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

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.

Effects of Small-Group Tutoring with and without Validated Classroom Instruction on At-Risk Students' Math Problem Solving: Are Two Tiers of Prevention Better Than One?

PubMed Central

Fuchs, Lynn S.; Fuchs, Douglas; Craddock, Caitlin; Hollenbeck, Kurstin N.; Hamlett, Carol L.; Schatschneider, Christopher

2008-01-01

The purpose of this study was to assess the effects of small-group tutoring with and without validated classroom instruction on at-risk (AR) students' math problem solving. Stratifying within schools, 119 3rd-grade classes were randomly assigned to conventional or validated problem-solving instruction (Hot Math [schema-broadening instruction]). Students identified as AR (n = 243) were randomly assigned, within classroom conditions, to receive Hot Math tutoring or not. Students were tested on problem-solving and math applications measures before and after 16 weeks of intervention. Analyses of variance, which accounted for the nested structure of the data, revealed the tutored students who received validated classroom instruction achieved better than tutored students who received conventional classroom instruction (ES = 1.34). However, the advantage for tutoring over no tutoring was similar whether or not students received validated or conventional classroom instruction (ESs = 1.18 and 1.13). Tutoring, not validated classroom instruction reduced the prevalence of math difficulty. Implications for responsiveness-to-intervention prevention models and for enhancing math problem-solving instruction are discussed. PMID:19122881

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

NASA Astrophysics Data System (ADS)

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

2009-09-01

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

Winners, losers, and posers: The effect of power poses on testosterone and risk-taking following competition.

PubMed

Smith, Kristopher M; Apicella, Coren L

2017-06-01

A contribution to a special issue on Hormones and Human Competition. The effect of postural power displays (i.e. power poses) on hormone levels and decision-making has recently been challenged. While Carney et al. (2010) found that holding brief postural displays of power leads to increased testosterone, decreased cortisol and greater economic risk taking, this failed to replicate in a recent high-powered study (Ranehill et al. 2015). It has been put forward that subtle differences in social context may account for the differences in results. Power displays naturally occur within the context of competitions, as do changes in hormones, and researchers have yet to examine the effects of poses within this ecologically relevant context. Using a large sample of 247 male participants, natural winners and losers of a physical competition were randomly assigned to hold a low, neutral or high-power postural display. We found no main effect of pose type on testosterone, cortisol, risk or feelings of power. Winners assigned to a high-power pose had a relative, albeit small, rise in testosterone compared to winners who held neutral or low-power poses. For losers, we found little evidence that high-power poses lead to increased testosterone relative to those holding neutral or low-powered poses. If anything, the reverse was observed - losers had a reduction in testosterone after holding high-power poses. To the extent that changes in testosterone modulate social behaviors adaptively, it is possible that the relative reduction in testosterone observed in losers taking high-powered poses is designed to inhibit further "winner-like" behavior that could result in continued defeat and harm. Still, effects were small, multiple comparisons were made, and the results ran counter to our predictions. We thus treat these conclusions as preliminary. Copyright © 2016 Elsevier Inc. All rights reserved.

Playing at Work: The Intersection of Race, Class, and Gender with Power Structures of Work and Production.

ERIC Educational Resources Information Center

Corrado, Marisa; Glasberg, Davita Silfen; Merenstein, Beth; Peele, Melanie R.

2000-01-01

Focuses on an exercise where students were assigned social roles based on gender, class, and race and then selected division of labor and reward structures in order to explore inequality in work and production. Offers a review of literature on the power structure of work and production and an evaluation of the exercise. (CMK)

Dynamics of Perceived Exertion in Constant-Power Cycling: Time- and Workload-Dependent Thresholds

ERIC Educational Resources Information Center

Balagué, Natàlia; Hristovski, Robert; García, Sergi; Aguirre, Cecilia; Vázquez, Pablo; Razon, Selen; Tenenbaum, Gershon

2015-01-01

Purpose: The purpose of this study was to test the dynamics of perceived exertion shifts (PES) as a function of time and workload during constant-power cycling. Method: Fifty-two participants assigned to 4 groups performed a cycling task at 4 different constant workloads corresponding to their individual rates of perceived exertion (RPEs = 13, 15,…

Statistical Power and Optimum Sample Allocation Ratio for Treatment and Control Having Unequal Costs Per Unit of Randomization

ERIC Educational Resources Information Center

Liu, Xiaofeng

2003-01-01

This article considers optimal sample allocation between the treatment and control condition in multilevel designs when the costs per sampling unit vary due to treatment assignment. Optimal unequal allocation may reduce the cost from that of a balanced design without sacrificing any power. The optimum sample allocation ratio depends only on the…

Environmental impact assessment for alternative-energy power plants in México.

PubMed

González-Avila, María E; Beltrán-Morales, Luis Felipe; Braker, Elizabeth; Ortega-Rubio, Alfredo

2006-07-01

Ten Environmental Impact Assessment Reports (EIAR) were reviewed for projects involving alternative power plants in Mexico developed during the last twelve years. Our analysis focused on the methods used to assess the impacts produced by hydroelectric and geothermal power projects. These methods used to assess impacts in EIARs ranged from the most simple, descriptive criteria, to quantitative models. These methods are not concordant with the level of the EIAR required by the environmental authority or even, with the kind of project developed. It is concluded that there is no correlation between the tools used to assess impacts and the assigned type of the EIAR. Because the methods to assess impacts produced by these power projects have not changed during 2000 years, we propose a quantitative method, based on ecological criteria and tools, to assess the impacts produced by hydroelectric and geothermal plants, according to the specific characteristics of the project. The proposed method is supported by environmental norms, and can assist environmental authorities in assigning the correct level and tools to be applied to hydroelectric and geothermal projects. The proposed method can be adapted to other production activities in Mexico and to other countries.

High Power Distance Enhances Employees' Preference for Likable Managers: A Resource Dependency Perspective

PubMed Central

Wei, Cong; Sun, Xiaomin; Liu, Jia; Zhou, Chunfang; Xue, Gang

2017-01-01

Is a manager's likability important from an employee's perspective? Research results in this field are scant and inconsistent. The current study explored employees' response to managers' likability and the moderating effect of power distance at both the cultural and individual levels. In study 1, following the countercultural priming experimental paradigm proposed by Van den Bos et al. (2013), 121 college students from China (a high power distance culture) and 99 college students from Denmark (a low power distance culture) were randomly assigned to either a countercultural (experimental) condition or a control condition. All participants were required to complete a manager selection task using the zero-acquaintance paradigm to measure their preference for likable managers. The results confirmed the moderating role of power distance at the cultural level. Study 2 further explored the moderating effect of power distance orientation at the individual level, as well as the boundary condition of the degree of resource dependence from the employee's perspective. One hundred and three Chinese participants with work experience were randomly assigned to either the subordinate perspective (high resource dependence) or the HR department perspective (low resource dependence) condition and completed the same task as in study 1. The results suggested that high power distance-oriented participants demonstrate stronger preference for likable manager candidates than do low power distance-oriented participants. In addition, these findings hold only when employees expect a high resource dependence relation with the manager. Theoretical and practical implications of the research findings and future research directions were discussed. PMID:28119654

Neural Meta-Memes Framework for Combinatorial Optimization

NASA Astrophysics Data System (ADS)

Song, Li Qin; Lim, Meng Hiot; Ong, Yew Soon

In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).

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.

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

NASA Astrophysics Data System (ADS)

Ming-Huang Chiang, David; Lin, Chia-Ping; Chen, Mu-Chen

2011-05-01

Among distribution centre operations, order picking has been reported to be the most labour-intensive activity. Sophisticated storage assignment policies adopted to reduce the travel distance of order picking have been explored in the literature. Unfortunately, previous research has been devoted to locating entire products from scratch. Instead, this study intends to propose an adaptive approach, a Data Mining-based Storage Assignment approach (DMSA), to find the optimal storage assignment for newly delivered products that need to be put away when there is vacant shelf space in a distribution centre. In the DMSA, a new association index (AIX) is developed to evaluate the fitness between the put away products and the unassigned storage locations by applying association rule mining. With AIX, the storage location assignment problem (SLAP) can be formulated and solved as a binary integer programming. To evaluate the performance of DMSA, a real-world order database of a distribution centre is obtained and used to compare the results from DMSA with a random assignment approach. It turns out that DMSA outperforms random assignment as the number of put away products and the proportion of put away products with high turnover rates increase.

78 FR 6804 - Codex Alimentarius Commission: Meeting of the Codex Committee on Food Labeling

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-31

...; (c) Studying specific labeling problems assigned to it by Codex; and (d) Studying problems associated... the Production, Processing, Labeling and Marketing of Organically Produced Foods. (a) Use of ethylene... Washington, DC on January 24, 2013. Mary Frances Lowe, U.S. Manager for Codex Alimentarius. [FR Doc. 2013...

Recalling Prerequisite Material in a Calculus II Course to Improve Student Success

ERIC Educational Resources Information Center

Mokry, Jeanette

2016-01-01

This article discusses preparation assignments used in a Calculus II course that cover material from prerequisite courses. Prior to learning new material, students work on problems outside of class involving concepts from algebra, trigonometry, and Calculus I. These problems are directly built upon in order to answer Calculus II questions,…

Concordancers and Dictionaries as Problem-Solving Tools for ESL Academic Writing

ERIC Educational Resources Information Center

Yoon, Choongil

2016-01-01

The present study investigated how 6 Korean ESL graduate students in Canada used a suite of freely available reference resources, consisting of Web-based corpus tools, Google search engines, and dictionaries, for solving linguistic problems while completing an authentic academic writing assignment in English. Using a mixed methods design, the…

Meanings Given to Algebraic Symbolism in Problem-Posing

ERIC Educational Resources Information Center

Cañadas, María C.; Molina, Marta; del Río, Aurora

2018-01-01

Some errors in the learning of algebra suggest that students might have difficulties giving meaning to algebraic symbolism. In this paper, we use problem posing to analyze the students' capacity to assign meaning to algebraic symbolism and the difficulties that students encounter in this process, depending on the characteristics of the algebraic…

Comparison of Family Therapy Outcome with Alcohol-Abusing, Runaway Adolescents

ERIC Educational Resources Information Center

Slesnick, Natasha; Prestopnik, Jillian L

2009-01-01

Treatment evaluation for alcohol problem, runaway adolescents and their families is rare. This study recruited primary alcohol problem adolescents (N = 119) and their primary caretakers from two runaway shelters and assigned them to (a) home-based ecologically based family therapy (EBFT), (b) office-based functional family therapy (FFT), or (c)…

Effectiveness of Word Solving: Integrating Morphological Problem-Solving within Comprehension Instruction for Middle School Students

ERIC Educational Resources Information Center

Goodwin, Amanda P.

2016-01-01

This study explores the effectiveness of integrating morphological instruction within comprehension strategy instruction. Participants were 203 students (N = 117 fifth-grade; 86 sixth-grade) from four urban schools who were randomly assigned to the intervention (N = 110; morphological problem-solving within comprehension strategy instruction) or…

Effect of Worked Examples on Mental Model Progression in a Computer-Based Simulation Learning Environment

ERIC Educational Resources Information Center

Darabi, Aubteen; Nelson, David W.; Meeker, Richard; Liang, Xinya; Boulware, Wilma

2010-01-01

In a diagnostic problem solving operation of a computer-simulated chemical plant, chemical engineering students were randomly assigned to two groups: one studying product-oriented worked examples, the other practicing conventional problem solving. Effects of these instructional strategies on the progression of learners' mental models were examined…

Turning Teaching Upside Down

ERIC Educational Resources Information Center

Seeley, Cathy L.

2017-01-01

The traditional method of teaching math--showing students how to do a procedure, then assigning problems that require them to use that exact procedure--leads to adults who don't know how to approach problems that don't look like those in their math book. Seeley describes an alternative teaching method (upside-down teaching) in which teachers give…

Results and Implications of a Problem-Solving Treatment Program for Obesity.

ERIC Educational Resources Information Center

Mahoney, B. K.; And Others

Data are from a large scale experimental study which was designed to evaluate a multimethod problem solving approach to obesity. Obese adult volunteers (N=90) were randomly assigned to three groups: maximal treatment, minimal treatment, and no treatment control. In the two treatment groups, subjects were exposed to bibliographic material and…

Evolution of Protein Lipograms: A Bioinformatics Problem

ERIC Educational Resources Information Center

White, Harold B., III; Dhurjati, Prasad

2006-01-01

A protein lacking one of the 20 common amino acids is a protein lipogram. This open-ended problem-based learning assignment deals with the evolution of proteins with biased amino acid composition. It has students query protein and metabolic databases to test the hypothesis that natural selection has reduced the frequency of each amino acid…

Congestion patterns of electric vehicles with limited battery capacity.

PubMed

Jing, Wentao; Ramezani, Mohsen; An, Kun; Kim, Inhi

2018-01-01

The path choice behavior of battery electric vehicle (BEV) drivers is influenced by the lack of public charging stations, limited battery capacity, range anxiety and long battery charging time. This paper investigates the congestion/flow pattern captured by stochastic user equilibrium (SUE) traffic assignment problem in transportation networks with BEVs, where the BEV paths are restricted by their battery capacities. The BEV energy consumption is assumed to be a linear function of path length and path travel time, which addresses both path distance limit problem and road congestion effect. A mathematical programming model is proposed for the path-based SUE traffic assignment where the path cost is the sum of the corresponding link costs and a path specific out-of-energy penalty. We then apply the convergent Lagrangian dual method to transform the original problem into a concave maximization problem and develop a customized gradient projection algorithm to solve it. A column generation procedure is incorporated to generate the path set. Finally, two numerical examples are presented to demonstrate the applicability of the proposed model and the solution algorithm.

Parent training plus contingency management for substance abusing families: A Complier Average Causal Effects (CACE) analysis*

PubMed Central

Stanger, Catherine; Ryan, Stacy R.; Fu, Hongyun; Budney, Alan J.

2011-01-01

Background Children of substance abusers are at risk for behavioral/emotional problems. To improve outcomes for these children, we developed and tested an intervention that integrated a novel contingency management (CM) program designed to enhance compliance with an empirically-validated parent training curriculum. CM provided incentives for daily monitoring of parenting and child behavior, completion of home practice assignments, and session attendance. Methods Forty-seven mothers with substance abuse or dependence were randomly assigned to parent training + incentives (PTI) or parent training without incentives (PT). Children were 55% male, ages 2-7 years. Results Homework completion and session attendance did not differ between PTI and PT mothers, but PTI mothers had higher rates of daily monitoring. PTI children had larger reductions in child externalizing problems in all models. Complier Average Causal Effects (CACE) analyses showed additional significant effects of PTI on child internalizing problems, parent problems and parenting. These effects were not significant in standard Intent-to-Treat analyses. Conclusion Results suggest our incentive program may offer a method for boosting outcomes. PMID:21466925

Congestion patterns of electric vehicles with limited battery capacity

PubMed Central

2018-01-01

The path choice behavior of battery electric vehicle (BEV) drivers is influenced by the lack of public charging stations, limited battery capacity, range anxiety and long battery charging time. This paper investigates the congestion/flow pattern captured by stochastic user equilibrium (SUE) traffic assignment problem in transportation networks with BEVs, where the BEV paths are restricted by their battery capacities. The BEV energy consumption is assumed to be a linear function of path length and path travel time, which addresses both path distance limit problem and road congestion effect. A mathematical programming model is proposed for the path-based SUE traffic assignment where the path cost is the sum of the corresponding link costs and a path specific out-of-energy penalty. We then apply the convergent Lagrangian dual method to transform the original problem into a concave maximization problem and develop a customized gradient projection algorithm to solve it. A column generation procedure is incorporated to generate the path set. Finally, two numerical examples are presented to demonstrate the applicability of the proposed model and the solution algorithm. PMID:29543875

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

Modelling voltage sag mitigation using dynamic voltage restorer and analyzing power quality issue

NASA Astrophysics Data System (ADS)

Ismail, Nor Laili; Hidzir, Hizrin Dayana Mohd; Thanakodi, Suresh; Nazar, Nazatul Shiema Moh; Ibrahim, Pungut; Ali, Che Ku Muhammad Sabri Che Ku

2018-02-01

Power quality problem which are arise due to a fault or a pulsed load can have caused an interruption of critical load. The modern power systems are becoming more sensitive to the quality of the power supplied by the utility company. Voltage sags and swells, flicker, interruptions, harmonic distortion and other distortion to the sinusoidal waveform are the examples of the power quality problems. The most affected due to these problems is industrial customers who use a lot of sensitive equipment. There has suffered a huge loss to these problems. Resulting of broken or damage equipment if voltage sag exceeds the sensitive threshold of the equipment. Thus, device such as Static Synchronous Compensator (STATCOM) and Dynamic Voltage Restorer (DVR) has been created to solve this problem among users. DVR is a custom power device that most effective and efficient. This paper intended to report the DVR operations during voltage sag compensation.

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.

Assessment of a novel group-centered testing schema in an upper-level undergraduate molecular biotechnology course.

PubMed

Srougi, Melissa C; Miller, Heather B; Witherow, D Scott; Carson, Susan

2013-01-01

Providing students with assignments that focus on critical thinking is an important part of their scientific and intellectual development. However, as class sizes increase, so does the grading burden, prohibiting many faculty from incorporating critical thinking assignments in the classroom. In an effort to continue to provide our students with meaningful critical thinking exercises, we implemented a novel group-centered, problem-based testing scheme. We wanted to assess how performing critical thinking problem sets as group work compares to performing the sets as individual work, in terms of student attitudes and learning outcomes. During two semesters of our recombinant DNA course, students had the same lecture material and similar assessments. In the Fall semester, student learning was assessed by two collaborative take-home exams, followed immediately by individual, closed-book in-class exams on the same content, as well as a final cumulative exam. Student teams on the take-home exams were instructor-assigned, and each team turned in one collaborative exam. In the Spring semester, the control group of students were required to turn in their own individual take-home exams, followed by the in-class exams and final cumulative exam. For the majority of students, learning outcomes were met, regardless of whether they worked in teams. In addition, collaborative learning was favorably received by students and grading was reduced for instructors. These data suggest that group-centered, problem-based learning is a useful model for achievement of student learning outcomes in courses where it would be infeasible to provide feedback on individual critical thinking assignments due to grading volume. Copyright © 2013 Wiley Periodicals, Inc.

40 CFR 57.806 - Presiding Officer.

Code of Federal Regulations, 2011 CFR

2011-07-01

... Technology § 57.806 Presiding Officer. (a) Assignment of Presiding Officer. (1) The Administrator shall, as... EPA employee who is an attorney to serve as presiding officer. (b) Powers and duties of Presiding...

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

PubMed

Middleton, John; Vaks, Jeffrey E

2007-04-01

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

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.

A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

NASA Astrophysics Data System (ADS)

Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

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

PubMed

Anderson, Cameron; Jennifer, Berdahl L

2002-12-01

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

The ANSS Station Information System: A Centralized Station Metadata Repository for Populating, Managing and Distributing Seismic Station Metadata

NASA Astrophysics Data System (ADS)

Thomas, V. I.; Yu, E.; Acharya, P.; Jaramillo, J.; Chowdhury, F.

2015-12-01

Maintaining and archiving accurate site metadata is critical for seismic network operations. The Advanced National Seismic System (ANSS) Station Information System (SIS) is a repository of seismic network field equipment, equipment response, and other site information. Currently, there are 187 different sensor models and 114 data-logger models in SIS. SIS has a web-based user interface that allows network operators to enter information about seismic equipment and assign response parameters to it. It allows users to log entries for sites, equipment, and data streams. Users can also track when equipment is installed, updated, and/or removed from sites. When seismic equipment configurations change for a site, SIS computes the overall gain of a data channel by combining the response parameters of the underlying hardware components. Users can then distribute this metadata in standardized formats such as FDSN StationXML or dataless SEED. One powerful advantage of SIS is that existing data in the repository can be leveraged: e.g., new instruments can be assigned response parameters from the Incorporated Research Institutions for Seismology (IRIS) Nominal Response Library (NRL), or from a similar instrument already in the inventory, thereby reducing the amount of time needed to determine parameters when new equipment (or models) are introduced into a network. SIS is also useful for managing field equipment that does not produce seismic data (eg power systems, telemetry devices or GPS receivers) and gives the network operator a comprehensive view of site field work. SIS allows users to generate field logs to document activities and inventory at sites. Thus, operators can also use SIS reporting capabilities to improve planning and maintenance of the network. Queries such as how many sensors of a certain model are installed or what pieces of equipment have active problem reports are just a few examples of the type of information that is available to SIS users.

Effectiveness of focused structural massage and relaxation massage for chronic low back pain: protocol for a randomized controlled trial.

PubMed

Cherkin, Daniel C; Sherman, Karen J; Kahn, Janet; Erro, Janet H; Deyo, Richard A; Haneuse, Sebastien J; Cook, Andrea J

2009-10-20

Chronic back pain is a major public health problem and the primary reason patients seek massage treatment. Despite the growing use of massage for chronic low back pain, there have been few studies of its effectiveness. This trial will be the first evaluation of the effectiveness of relaxation massage for chronic back pain and the first large trial of a focused structural form of massage for this condition. A total of 399 participants (133 in each of three arms) between the ages of 20 and 65 years of age who have low back pain lasting at least 3 months will be recruited from an integrated health care delivery system. They will be randomized to one of two types of massage ("focused structural massage" or "relaxation massage"), or continued usual medical care. Ten massage treatments will be provided over 10 weeks. The primary outcomes, standard measures of dysfunction and bothersomeness of low back pain, will be assessed at baseline and after 10, 26, and 52 weeks by telephone interviewers masked to treatment assignment. General health status, satisfaction with back care, days of back-related disability, perceived stress, and use and costs of healthcare services for back pain will also be measured. Outcomes across assigned treatment groups will be compared using generalized estimating equations, accounting for participant correlation and adjusted for baseline value, age, and sex. For both primary outcome measures, this trial will have at least 85% power to detect the presence of a minimal clinically significant difference among the three treatment groups and 91% power for pairwise comparisons. Secondary analyses will compare the proportions of participants in each group that improve by a clinically meaningful amount. Results of this trial will help clarify the value of two types of massage therapy for chronic low back pain.

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

NASA Astrophysics Data System (ADS)

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

2014-07-01

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

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

PubMed

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

2017-01-01

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

Being "SMART" About Adolescent Conduct Problems Prevention: Executing a SMART Pilot Study in a Juvenile Diversion Agency.

PubMed

August, Gerald J; Piehler, Timothy F; Bloomquist, Michael L

2016-01-01

The development of adaptive treatment strategies (ATS) represents the next step in innovating conduct problems prevention programs within a juvenile diversion context. Toward this goal, we present the theoretical rationale, associated methods, and anticipated challenges for a feasibility pilot study in preparation for implementing a full-scale SMART (i.e., sequential, multiple assignment, randomized trial) for conduct problems prevention. The role of a SMART design in constructing ATS is presented. The SMART feasibility pilot study includes a sample of 100 youth (13-17 years of age) identified by law enforcement as early stage offenders and referred for precourt juvenile diversion programming. Prior data on the sample population detail a high level of ethnic diversity and approximately equal representations of both genders. Within the SMART, youth and their families are first randomly assigned to one of two different brief-type evidence-based prevention programs, featuring parent-focused behavioral management or youth-focused strengths-building components. Youth who do not respond sufficiently to brief first-stage programming will be randomly assigned a second time to either an extended parent- or youth-focused second-stage programming. Measures of proximal intervention response and measures of potential candidate tailoring variables for developing ATS within this sample are detailed. Results of the described pilot study will include information regarding feasibility and acceptability of the SMART design. This information will be used to refine a subsequent full-scale SMART. The use of a SMART to develop ATS for prevention will increase the efficiency and effectiveness of prevention programing for youth with developing conduct problems.

Advanced Cloud Forecasting for Solar Energy’s Impact on Grid Modernization

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

Werth, D.; Nichols, R.

Solar energy production is subject to variability in the solar resource – clouds and aerosols will reduce the available solar irradiance and inhibit power production. The fact that solar irradiance can vary by large amounts at small timescales and in an unpredictable way means that power utilities are reluctant to assign to their solar plants a large portion of future energy demand – the needed power might be unavailable, forcing the utility to make costly adjustments to its daily portfolio. The availability and predictability of solar radiation therefore represent important research topics for increasing the power produced by renewable sources.

Client Contacts Improve Quality of Copywriting.

ERIC Educational Resources Information Center

McCann, Guy

1988-01-01

Discusses the advantages of using real-life clients for class assignments in copywriting courses. Presents suggestions for client sources and identifies possible problems which may be encountered. (MM)

Fragment assignment in the cloud with eXpress-D

PubMed Central

2013-01-01

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

Smart Power Supply for Battery-Powered Systems

NASA Technical Reports Server (NTRS)

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

2010-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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