A hybrid heuristic for the multiple choice multidimensional knapsack problem
NASA Astrophysics Data System (ADS)
Mansi, Raïd; Alves, Cláudio; Valério de Carvalho, J. M.; Hanafi, Saïd
2013-08-01
In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class has to be chosen. Both problems are NP-hard. However, the multiple choice multidimensional knapsack problem appears to be more difficult to solve in part because of its choice constraints. Many real applications lead to very large scale multiple choice multidimensional knapsack problems that can hardly be addressed using exact algorithms. A new hybrid heuristic is proposed that embeds several new procedures for this problem. The approach is based on the resolution of linear programming relaxations of the problem and reduced problems that are obtained by fixing some variables of the problem. The solutions of these problems are used to update the global lower and upper bounds for the optimal solution value. A new strategy for defining the reduced problems is explored, together with a new family of cuts and a reformulation procedure that is used at each iteration to improve the performance of the heuristic. An extensive set of computational experiments is reported for benchmark instances from the literature and for a large set of hard instances generated randomly. The results show that the approach outperforms other state-of-the-art methods described so far, providing the best known solution for a significant number of benchmark instances.
Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Smolinski, B.
The 0-1 multiple knapsack problem appears in many domains from financial portfolio management to cargo ship stowing. Methods for solving it range from approximate algorithms, such as greedy algorithms, to exact algorithms, such as branch and bound. Approximate algorithms have no bounds on how poorly they perform and exact algorithms can suffer from exponential time and space complexities with large data sets. This paper introduces a market model based on agent decomposition and market auctions for approximating the 0-1 multiple knapsack problem, and an algorithm that implements the model (M(x)). M(x) traverses the solution space rather than getting caught inmore » a local maximum, overcoming an inherent problem of many greedy algorithms. The use of agents ensures that infeasible solutions are not considered while traversing the solution space and that traversal of the solution space is not just random, but is also directed. M(x) is compared to a bound and bound algorithm (BB) and a simple greedy algorithm with a random shuffle (G(x)). The results suggest that M(x) is a good algorithm for approximating the 0-1 Multiple Knapsack problem. M(x) almost always found solutions that were close to optimal in a fraction of the time it took BB to run and with much less memory on large test data sets. M(x) usually performed better than G(x) on hard problems with correlated data.« less
A set partitioning reformulation for the multiple-choice multidimensional knapsack problem
NASA Astrophysics Data System (ADS)
Voß, Stefan; Lalla-Ruiz, Eduardo
2016-05-01
The Multiple-choice Multidimensional Knapsack Problem (MMKP) is a well-known ?-hard combinatorial optimization problem that has received a lot of attention from the research community as it can be easily translated to several real-world problems arising in areas such as allocating resources, reliability engineering, cognitive radio networks, cloud computing, etc. In this regard, an exact model that is able to provide high-quality feasible solutions for solving it or being partially included in algorithmic schemes is desirable. The MMKP basically consists of finding a subset of objects that maximizes the total profit while observing some capacity restrictions. In this article a reformulation of the MMKP as a set partitioning problem is proposed to allow for new insights into modelling the MMKP. The computational experimentation provides new insights into the problem itself and shows that the new model is able to improve on the best of the known results for some of the most common benchmark instances.
Multiple Choice Knapsack Problem: example of planning choice in transportation.
Zhong, Tao; Young, Rhonda
2010-05-01
Transportation programming, a process of selecting projects for funding given budget and other constraints, is becoming more complex as a result of new federal laws, local planning regulations, and increased public involvement. This article describes the use of an integer programming tool, Multiple Choice Knapsack Problem (MCKP), to provide optimal solutions to transportation programming problems in cases where alternative versions of projects are under consideration. In this paper, optimization methods for use in the transportation programming process are compared and then the process of building and solving the optimization problems is discussed. The concepts about the use of MCKP are presented and a real-world transportation programming example at various budget levels is provided. This article illustrates how the use of MCKP addresses the modern complexities and provides timely solutions in transportation programming practice. While the article uses transportation programming as a case study, MCKP can be useful in other fields where a similar decision among a subset of the alternatives is required. Copyright 2009 Elsevier Ltd. All rights reserved.
A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems
Tuo, Shouheng; Yong, Longquan; Deng, Fang'an
2014-01-01
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation) are employed to improve the performance of HS algorithm. Another improvement in HSTL method is that the dynamic strategies are adopted to change the parameters, which maintains the proper balance effectively between global exploration power and local exploitation power. Finally, simulation experiments with 13 knapsack problems show that the HSTL algorithm can be an efficient alternative for solving 0-1 knapsack problems. PMID:24574905
A novel harmony search algorithm based on teaching-learning strategies for 0-1 knapsack problems.
Tuo, Shouheng; Yong, Longquan; Deng, Fang'an
2014-01-01
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation) are employed to improve the performance of HS algorithm. Another improvement in HSTL method is that the dynamic strategies are adopted to change the parameters, which maintains the proper balance effectively between global exploration power and local exploitation power. Finally, simulation experiments with 13 knapsack problems show that the HSTL algorithm can be an efficient alternative for solving 0-1 knapsack problems.
Bruhn, Peter; Geyer-Schulz, Andreas
2002-01-01
In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling complementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brickell, E.F.; Simmons, G.J.
In the period since 1976, when Diffie and Hellman published the first discussion of two-key cryptography to appear in the open literature, only a handful of two-key cryptoalgorithms have been proposed - two of which are based on the knapsack problem. Consequently there was enormous interest when Shamir announced in early 1982 a cryptanalytic technique that could break many Merkle-Hellman knapsacks. In a rapid sequence of developments, Simmons and Brickell, Adleman, and Lagarias all announced other attacks on knapsack-based cryptosystems that were either computationally much more efficient or else directed at other knapsack schemes such as the Graham-Shamir or iteratedmore » systems. This paper analyzes the common features of knapsack-based cryptosystems and presents all of the cryptanalytic attacks made in 1982 from a unified viewpoint.« less
On the Hardness of Subset Sum Problem from Different Intervals
NASA Astrophysics Data System (ADS)
Kogure, Jun; Kunihiro, Noboru; Yamamoto, Hirosuke
The subset sum problem, which is often called as the knapsack problem, is known as an NP-hard problem, and there are several cryptosystems based on the problem. Assuming an oracle for shortest vector problem of lattice, the low-density attack algorithm by Lagarias and Odlyzko and its variants solve the subset sum problem efficiently, when the “density” of the given problem is smaller than some threshold. When we define the density in the context of knapsack-type cryptosystems, weights are usually assumed to be chosen uniformly at random from the same interval. In this paper, we focus on general subset sum problems, where this assumption may not hold. We assume that weights are chosen from different intervals, and make analysis of the effect on the success probability of above algorithms both theoretically and experimentally. Possible application of our result in the context of knapsack cryptosystems is the security analysis when we reduce the data size of public keys.
Granmo, Ole-Christoffer; Oommen, B John; Myrer, Svein Arild; Olsen, Morten Goodwin
2007-02-01
This paper considers the nonlinear fractional knapsack problem and demonstrates how its solution can be effectively applied to two resource allocation problems dealing with the World Wide Web. The novel solution involves a "team" of deterministic learning automata (LA). The first real-life problem relates to resource allocation in web monitoring so as to "optimize" information discovery when the polling capacity is constrained. The disadvantages of the currently reported solutions are explained in this paper. The second problem concerns allocating limited sampling resources in a "real-time" manner with the purpose of estimating multiple binomial proportions. This is the scenario encountered when the user has to evaluate multiple web sites by accessing a limited number of web pages, and the proportions of interest are the fraction of each web site that is successfully validated by an HTML validator. Using the general LA paradigm to tackle both of the real-life problems, the proposed scheme improves a current solution in an online manner through a series of informed guesses that move toward the optimal solution. At the heart of the scheme, a team of deterministic LA performs a controlled random walk on a discretized solution space. Comprehensive experimental results demonstrate that the discretization resolution determines the precision of the scheme, and that for a given precision, the current solution (to both problems) is consistently improved until a nearly optimal solution is found--even for switching environments. Thus, the scheme, while being novel to the entire field of LA, also efficiently handles a class of resource allocation problems previously not addressed in the literature.
Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; Schauer, Joachim
2014-03-16
In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one of its items (not previously selected) and includes it in the knapsack if there is enough capacity. The process ends when the remaining capacity is too small for including any item left. We look at the problem from a single agent point of view and show that finding an optimal sequence of items to select is an [Formula: see text]-hard problem. Therefore we propose two natural heuristic strategies and analyze their worst-case performance when (1) the opponent is able to play optimally and (2) the opponent adopts a greedy strategy. From a centralized perspective we observe that some known results on the approximation of the classical Subset Sum can be effectively adapted to the multi-agent version of the problem.
Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; Schauer, Joachim
2014-01-01
In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one of its items (not previously selected) and includes it in the knapsack if there is enough capacity. The process ends when the remaining capacity is too small for including any item left. We look at the problem from a single agent point of view and show that finding an optimal sequence of items to select is an NP-hard problem. Therefore we propose two natural heuristic strategies and analyze their worst-case performance when (1) the opponent is able to play optimally and (2) the opponent adopts a greedy strategy. From a centralized perspective we observe that some known results on the approximation of the classical Subset Sum can be effectively adapted to the multi-agent version of the problem. PMID:25844012
The generalized quadratic knapsack problem. A neuronal network approach.
Talaván, Pedro M; Yáñez, Javier
2006-05-01
The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved. This problem, denoted as the generalized quadratic knapsack problem (GQKP), includes as particular cases well-known problems such as the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). This new energy function generalizes those proposed by other authors. Through this energy function, any GQKP can be solved with an appropriate parameter setting procedure, which is detailed in this paper. As a particular case, and in order to test this generalized energy function, some computational experiments solving the traveling salesman problem are also included.
a Genetic Algorithm Based on Sexual Selection for the Multidimensional 0/1 Knapsack Problems
NASA Astrophysics Data System (ADS)
Varnamkhasti, Mohammad Jalali; Lee, Lai Soon
In this study, a new technique is presented for choosing mate chromosomes during sexual selection in a genetic algorithm. The population is divided into groups of males and females. During the sexual selection, the female chromosome is selected by the tournament selection while the male chromosome is selected based on the hamming distance from the selected female chromosome, fitness value or active genes. Computational experiments are conducted on the proposed technique and the results are compared with some selection mechanisms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.
NASA Astrophysics Data System (ADS)
Shiangjen, Kanokwatt; Chaijaruwanich, Jeerayut; Srisujjalertwaja, Wijak; Unachak, Prakarn; Somhom, Samerkae
2018-02-01
This article presents an efficient heuristic placement algorithm, namely, a bidirectional heuristic placement, for solving the two-dimensional rectangular knapsack packing problem. The heuristic demonstrates ways to maximize space utilization by fitting the appropriate rectangle from both sides of the wall of the current residual space layer by layer. The iterative local search along with a shift strategy is developed and applied to the heuristic to balance the exploitation and exploration tasks in the solution space without the tuning of any parameters. The experimental results on many scales of packing problems show that this approach can produce high-quality solutions for most of the benchmark datasets, especially for large-scale problems, within a reasonable duration of computational time.
Wang, Gai-Ge; Feng, Qingjiang; Zhao, Xiang-Jun
2014-01-01
An effective hybrid cuckoo search algorithm (CS) with improved shuffled frog-leaping algorithm (ISFLA) is put forward for solving 0-1 knapsack problem. First of all, with the framework of SFLA, an improved frog-leap operator is designed with the effect of the global optimal information on the frog leaping and information exchange between frog individuals combined with genetic mutation with a small probability. Subsequently, in order to improve the convergence speed and enhance the exploitation ability, a novel CS model is proposed with considering the specific advantages of Lévy flights and frog-leap operator. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Finally, numerical simulations are carried out on six different types of 0-1 knapsack instances, and the comparative results have shown the effectiveness of the proposed algorithm and its ability to achieve good quality solutions, which outperforms the binary cuckoo search, the binary differential evolution, and the genetic algorithm. PMID:25404940
On local search for bi-objective knapsack problems.
Liefooghe, Arnaud; Paquete, Luís; Figueira, José Rui
2013-01-01
In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight. First, an experimental study on a given structural property of connectedness of the efficient set is conducted. Based on this property, a local search algorithm is proposed and its performance is compared to exact algorithms in terms of runtime and quality metrics. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.
Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search
2017-01-01
Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA). It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA) to solve this problem. To evaluate the performance of IBBA, standard benchmark functions and zero-one knapsack problems have been employed. The numeric results obtained by benchmark functions experiment prove that the proposed approach greatly outperforms the original BBA and binary particle swarm optimization (BPSO). Compared with several other heuristic algorithms on zero-one knapsack problems, it also verifies that the proposed algorithm is more able to avoid local minima. PMID:28634487
Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search.
Huang, Xingwang; Zeng, Xuewen; Han, Rui
2017-01-01
Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA). It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA) to solve this problem. To evaluate the performance of IBBA, standard benchmark functions and zero-one knapsack problems have been employed. The numeric results obtained by benchmark functions experiment prove that the proposed approach greatly outperforms the original BBA and binary particle swarm optimization (BPSO). Compared with several other heuristic algorithms on zero-one knapsack problems, it also verifies that the proposed algorithm is more able to avoid local minima.
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.
NASA Astrophysics Data System (ADS)
Rahman, P. A.
2018-05-01
This scientific paper deals with the model of the knapsack optimization problem and method of its solving based on directed combinatorial search in the boolean space. The offered by the author specialized mathematical model of decomposition of the search-zone to the separate search-spheres and the algorithm of distribution of the search-spheres to the different cores of the multi-core processor are also discussed. The paper also provides an example of decomposition of the search-zone to the several search-spheres and distribution of the search-spheres to the different cores of the quad-core processor. Finally, an offered by the author formula for estimation of the theoretical maximum of the computational acceleration, which can be achieved due to the parallelization of the search-zone to the search-spheres on the unlimited number of the processor cores, is also given.
NASA Astrophysics Data System (ADS)
Quan, Zhe; Wu, Lei
2017-09-01
This article investigates the use of parallel computing for solving the disjunctively constrained knapsack problem. The proposed parallel computing model can be viewed as a cooperative algorithm based on a multi-neighbourhood search. The cooperation system is composed of a team manager and a crowd of team members. The team members aim at applying their own search strategies to explore the solution space. The team manager collects the solutions from the members and shares the best one with them. The performance of the proposed method is evaluated on a group of benchmark data sets. The results obtained are compared to those reached by the best methods from the literature. The results show that the proposed method is able to provide the best solutions in most cases. In order to highlight the robustness of the proposed parallel computing model, a new set of large-scale instances is introduced. Encouraging results have been obtained.
Making Unseen Privilege Visible in Mathematics Education Research
ERIC Educational Resources Information Center
Bartell, Tonya Gau; Johnson, Kate R.
2013-01-01
In this essay, the authors begin to "unpack the invisible knapsack" of mathematics education research privilege. They present short statements representing the multiplicity of their respective identities; acknowledging that efforts to understand privilege and oppression are often supported and constrained by identities. The authors then…
Li, Yanjie; Li, Yifan; Pan, Xiang; Li, Qing X; Chen, Ronghua; Li, Xuesheng; Pan, Canping; Song, Jianli
2018-02-01
Plant protection products (PPPs) are applied in China and many other developing countries with knapsack sprayers at high volumes with coarse spray quality, resulting in a high percentage of pesticide losses. In this study, a new air-assisted electric knapsack sprayer and two conventional knapsack sprayers were evaluated in terms of pesticide deposition, residues and loss into the soil. Artificial targets fixed to the upper side and underside of the leaf surface in six zones (at two depths and three heights) were used to collect the deposition, which were analyzed by liquid chromatography triple-quadrupole mass spectrometry. The air-assisted electric knapsack sprayer produced more deposition and better penetrability and uniformity than the two traditional spraying methods. In particular, the air-assisted electric knapsack sprayer reduced pesticide losses to the soil by roughly 37% to 75% and deposited 1.18 and 1.24 times more pesticide than the manual air-pressure and battery-powered knapsack sprayers, respectively. The residues of azoxystrobin and tebuconazole in tomato and cucumber were below the maximum residue limits (MRLs). In general, use of the the air-assisted electric knapsack sprayer in tomato and cucumber crops could improve the effectiveness of PPPs, reduce the risk of contamination and protect food safety. © 2017 Society of Chemical Industry. © 2017 Society of Chemical Industry.
An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems
Feng, Yanhong; Jia, Ke; He, Yichao
2014-01-01
Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution search over discrete space. Subsequently, the concept of confidence interval (CI) is introduced; hence, the new position updating is designed and genetic mutation with a small probability is introduced. The former enables the population to move towards the global best solution rapidly in every generation, and the latter can effectively prevent the ICS from trapping into the local optimum. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Experiments with a large number of KP instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions. PMID:24527026
Optimal Sensor Allocation for Fault Detection and Isolation
NASA Technical Reports Server (NTRS)
Azam, Mohammad; Pattipati, Krishna; Patterson-Hine, Ann
2004-01-01
Automatic fault diagnostic schemes rely on various types of sensors (e.g., temperature, pressure, vibration, etc) to measure the system parameters. Efficacy of a diagnostic scheme is largely dependent on the amount and quality of information available from these sensors. The reliability of sensors, as well as the weight, volume, power, and cost constraints, often makes it impractical to monitor a large number of system parameters. An optimized sensor allocation that maximizes the fault diagnosibility, subject to specified weight, volume, power, and cost constraints is required. Use of optimal sensor allocation strategies during the design phase can ensure better diagnostics at a reduced cost for a system incorporating a high degree of built-in testing. In this paper, we propose an approach that employs multiple fault diagnosis (MFD) and optimization techniques for optimal sensor placement for fault detection and isolation (FDI) in complex systems. Keywords: sensor allocation, multiple fault diagnosis, Lagrangian relaxation, approximate belief revision, multidimensional knapsack problem.
A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
NASA Astrophysics Data System (ADS)
Quan, Ning; Kim, Harrison M.
2018-03-01
The 0-1 quadratic knapsack problem (QKP) in wind farm layout optimization models possible turbine locations as nodes, and power loss due to wake effects between pairs of turbines as edges in a complete graph. The goal is to select up to a certain number of turbine locations such that the sum of selected node and edge coefficients is maximized. Finding the optimal solution to the QKP is difficult in general, but it is possible to obtain a tight upper bound on the QKP's optimal value which facilitates the use of heuristics to solve QKPs by giving a good estimate of the optimality gap of any feasible solution. This article applies an upper bound method that is especially well-suited to QKPs in wind farm layout optimization due to certain features of the formulation that reduce the computational complexity of calculating the upper bound. The usefulness of the upper bound was demonstrated by assessing the performance of the greedy algorithm for solving QKPs in wind farm layout optimization. The results show that the greedy algorithm produces good solutions within 4% of the optimal value for small to medium sized problems considered in this article.
Drake, John H; Özcan, Ender; Burke, Edmund K
2016-01-01
Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on a single candidate solution, and two candidate solutions are required for crossover, a mechanism is required to control the choice of the other solution. The frameworks we propose maintain a list of potential solutions for use in crossover. We investigate the use of such lists at two conceptual levels. First, crossover is controlled at the hyper-heuristic level where no problem-specific information is required. Second, it is controlled at the problem domain level where problem-specific information is used to produce good-quality solutions to use in crossover. A number of selection hyper-heuristics are compared using these frameworks over three benchmark libraries with varying properties for an NP-hard optimisation problem: the multidimensional 0-1 knapsack problem. It is shown that allowing crossover to be managed at the domain level outperforms managing crossover at the hyper-heuristic level in this problem domain.
Learning dominance relations in combinatorial search problems
NASA Technical Reports Server (NTRS)
Yu, Chee-Fen; Wah, Benjamin W.
1988-01-01
Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.
Development and Mining of a Volatile Organic Compound Database
Abdullah, Azian Azamimi; Ono, Naoaki; Sugiura, Tadao; Morita, Aki Hirai; Katsuragi, Tetsuo; Muto, Ai; Nishioka, Takaaki; Kanaya, Shigehiko
2015-01-01
Volatile organic compounds (VOCs) are small molecules that exhibit high vapor pressure under ambient conditions and have low boiling points. Although VOCs contribute only a small proportion of the total metabolites produced by living organisms, they play an important role in chemical ecology specifically in the biological interactions between organisms and ecosystems. VOCs are also important in the health care field as they are presently used as a biomarker to detect various human diseases. Information on VOCs is scattered in the literature until now; however, there is still no available database describing VOCs and their biological activities. To attain this purpose, we have developed KNApSAcK Metabolite Ecology Database, which contains the information on the relationships between VOCs and their emitting organisms. The KNApSAcK Metabolite Ecology is also linked with the KNApSAcK Core and KNApSAcK Metabolite Activity Database to provide further information on the metabolites and their biological activities. The VOC database can be accessed online. PMID:26495281
An adaptive evolutionary multi-objective approach based on simulated annealing.
Li, H; Landa-Silva, D
2011-01-01
A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a population of solutions. However, the performance of MOEA/D highly depends on the initial setting and diversity of the weight vectors. In this paper, we present an improved version of MOEA/D, called EMOSA, which incorporates an advanced local search technique (simulated annealing) and adapts the search directions (weight vectors) corresponding to various subproblems. In EMOSA, the weight vector of each subproblem is adaptively modified at the lowest temperature in order to diversify the search toward the unexplored parts of the Pareto-optimal front. Our computational results show that EMOSA outperforms six other well established multi-objective metaheuristic algorithms on both the (constrained) multi-objective knapsack problem and the (unconstrained) multi-objective traveling salesman problem. Moreover, the effects of the main algorithmic components and parameter sensitivities on the search performance of EMOSA are experimentally investigated.
Optimal reconfiguration strategy for a degradable multimodule computing system
NASA Technical Reports Server (NTRS)
Lee, Yann-Hang; Shin, Kang G.
1987-01-01
The present quantitative approach to the problem of reconfiguring a degradable multimode system assigns some modules to computation and arranges others for reliability. By using expected total reward as the optimal criterion, there emerges an active reconfiguration strategy based not only on the occurrence of failure but the progression of the given mission. This reconfiguration strategy requires specification of the times at which the system should undergo reconfiguration, and the configurations to which the system should change. The optimal reconfiguration problem is converted to integer nonlinear knapsack and fractional programming problems.
Solving a Class of Stochastic Mixed-Integer Programs With Branch and Price
2006-01-01
a two-dimensional knapsack problem, but for a given m, the objective value gi does not depend on the variance index v. This will be used in a final...optimization. Journal of Multicriteria Decision Analysis 11, 139–150 (2002) 29. Ford, L.R., Fulkerson, D.R.: A suggested computation for the maximal...for solution by a branch-and-price algorithm (B&P). We then survey a number of examples, and use a stochastic facility-location problem (SFLP) for a
Unpacking Teachers' Invisible Knapsacks: Social Identity and Privilege in Higher Education
ERIC Educational Resources Information Center
Barnett, Pamela E.
2013-01-01
Peggy McIntosh (1988) famously unpacked what she called an "invisible knapsack" of privileges socially conferred upon whites, men, and heterosexuals (1988). She argued that not only are women and minorities at a disadvantage, but those with social power enjoy benefits that are both unearned and unjustified. We often accept those…
Automating the packing heuristic design process with genetic programming.
Burke, Edmund K; Hyde, Matthew R; Kendall, Graham; Woodward, John
2012-01-01
The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming system to automatically generate a good quality heuristic for each instance. It is not necessary to change the methodology depending on the problem type (one-, two-, or three-dimensional knapsack and bin packing problems), and it therefore has a level of generality unmatched by other systems in the literature. We carry out an extensive suite of experiments and compare with the best human designed heuristics in the literature. Note that our heuristic design methodology uses the same parameters for all the experiments. The contribution of this paper is to present a more general packing methodology than those currently available, and to show that, by using this methodology, it is possible for a computer system to design heuristics which are competitive with the human designed heuristics from the literature. This represents the first packing algorithm in the literature able to claim human competitive results in such a wide variety of packing domains.
An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics
NASA Technical Reports Server (NTRS)
Baluja, Shumeet
1995-01-01
This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.
The cost-constrained traveling salesman problem
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sokkappa, P.R.
1990-10-01
The Cost-Constrained Traveling Salesman Problem (CCTSP) is a variant of the well-known Traveling Salesman Problem (TSP). In the TSP, the goal is to find a tour of a given set of cities such that the total cost of the tour is minimized. In the CCTSP, each city is given a value, and a fixed cost-constraint is specified. The objective is to find a subtour of the cities that achieves maximum value without exceeding the cost-constraint. Thus, unlike the TSP, the CCTSP requires both selection and sequencing. As a consequence, most results for the TSP cannot be extended to the CCTSP.more » We show that the CCTSP is NP-hard and that no K-approximation algorithm or fully polynomial approximation scheme exists, unless P = NP. We also show that several special cases are polynomially solvable. Algorithms for the CCTSP, which outperform previous methods, are developed in three areas: upper bounding methods, exact algorithms, and heuristics. We found that a bounding strategy based on the knapsack problem performs better, both in speed and in the quality of the bounds, than methods based on the assignment problem. Likewise, we found that a branch-and-bound approach using the knapsack bound was superior to a method based on a common branch-and-bound method for the TSP. In our study of heuristic algorithms, we found that, when selecting modes for inclusion in the subtour, it is important to consider the neighborhood'' of the nodes. A node with low value that brings the subtour near many other nodes may be more desirable than an isolated node of high value. We found two types of repetition to be desirable: repetitions based on randomization in the subtour buildings process, and repetitions encouraging the inclusion of different subsets of the nodes. By varying the number and type of repetitions, we can adjust the computation time required by our method to obtain algorithms that outperform previous methods.« less
Model for the design of distributed data bases
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ram, S.
This research focuses on developing a model to solve the File Allocation Problem (FAP). The model integrates two major design issues, namely Concurrently Control and Data Distribution. The central node locking mechanism is incorporated in developing a nonlinear integer programming model. Two solution algorithms are proposed, one of which was implemented in FORTRAN.V. The allocation of data bases and programs are examined using this heuristic. Several decision rules were also formulated based on the results of the heuristic. A second more comprehensive heuristic was proposed, based on the knapsack problem. The development and implementation of this algorithm has been leftmore » as a topic for future research.« less
Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System
NASA Astrophysics Data System (ADS)
Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang
2018-03-01
Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.
Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System
NASA Astrophysics Data System (ADS)
Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang
2017-12-01
Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.
An Auction-Based Spectrum Leasing Mechanism for Mobile Macro-Femtocell Networks of IoT.
Chen, Xin; Xing, Lei; Qiu, Tie; Li, Zhuo
2017-02-16
The Internet of Things (IoT) is a vision of the upcoming society. It can provide pervasive communication between two or more entities using 4G-LTE (Long Term Evolution) communication technology. In 4G-LTE networks, there are two important problems: helping manage the spectrum demands of IoT devices and achieving much more revenue with the limited resource. This paper proposes a pricing framework to investigate the spectrum leasing in mobile heterogeneous networks with single macrocell and multiple femtocells. We modeled the leasing procedure between the macrocell service provider (MSP) and femtocell holders (FHs) as an auction to motivate the MSP to lease its spectrum resource. All FHs act as the bidders, and the monopolist MSP acts as the auctioneer. In the auction, FHs submit their bids to rent the spectrum resource so that they can make a profit by selling it to their subscribers. The MSP determines the spectrum leasing amount and chooses the winning FHs by solving the dynamic programming-based 0-1 knapsack problem. In our proposed framework, we focus on the spectrum pricing strategy and revenue maximization of the MSP. The simulation results show that the proposed scheme provides effective motivation for the MSP to lease the spectrum to FHs, and both the MSP and FHs can benefit from spectrum leasing.
Zhang, Cuicui; Liang, Xuefeng; Matsuyama, Takashi
2014-12-08
Multi-camera networks have gained great interest in video-based surveillance systems for security monitoring, access control, etc. Person re-identification is an essential and challenging task in multi-camera networks, which aims to determine if a given individual has already appeared over the camera network. Individual recognition often uses faces as a trial and requires a large number of samples during the training phrase. This is difficult to fulfill due to the limitation of the camera hardware system and the unconstrained image capturing conditions. Conventional face recognition algorithms often encounter the "small sample size" (SSS) problem arising from the small number of training samples compared to the high dimensionality of the sample space. To overcome this problem, interest in the combination of multiple base classifiers has sparked research efforts in ensemble methods. However, existing ensemble methods still open two questions: (1) how to define diverse base classifiers from the small data; (2) how to avoid the diversity/accuracy dilemma occurring during ensemble. To address these problems, this paper proposes a novel generic learning-based ensemble framework, which augments the small data by generating new samples based on a generic distribution and introduces a tailored 0-1 knapsack algorithm to alleviate the diversity/accuracy dilemma. More diverse base classifiers can be generated from the expanded face space, and more appropriate base classifiers are selected for ensemble. Extensive experimental results on four benchmarks demonstrate the higher ability of our system to cope with the SSS problem compared to the state-of-the-art system.
Zhang, Cuicui; Liang, Xuefeng; Matsuyama, Takashi
2014-01-01
Multi-camera networks have gained great interest in video-based surveillance systems for security monitoring, access control, etc. Person re-identification is an essential and challenging task in multi-camera networks, which aims to determine if a given individual has already appeared over the camera network. Individual recognition often uses faces as a trial and requires a large number of samples during the training phrase. This is difficult to fulfill due to the limitation of the camera hardware system and the unconstrained image capturing conditions. Conventional face recognition algorithms often encounter the “small sample size” (SSS) problem arising from the small number of training samples compared to the high dimensionality of the sample space. To overcome this problem, interest in the combination of multiple base classifiers has sparked research efforts in ensemble methods. However, existing ensemble methods still open two questions: (1) how to define diverse base classifiers from the small data; (2) how to avoid the diversity/accuracy dilemma occurring during ensemble. To address these problems, this paper proposes a novel generic learning-based ensemble framework, which augments the small data by generating new samples based on a generic distribution and introduces a tailored 0–1 knapsack algorithm to alleviate the diversity/accuracy dilemma. More diverse base classifiers can be generated from the expanded face space, and more appropriate base classifiers are selected for ensemble. Extensive experimental results on four benchmarks demonstrate the higher ability of our system to cope with the SSS problem compared to the state-of-the-art system. PMID:25494350
Ikeda, Shun; Abe, Takashi; Nakamura, Yukiko; Kibinge, Nelson; Hirai Morita, Aki; Nakatani, Atsushi; Ono, Naoaki; Ikemura, Toshimichi; Nakamura, Kensuke; Altaf-Ul-Amin, Md; Kanaya, Shigehiko
2013-05-01
Biology is increasingly becoming a data-intensive science with the recent progress of the omics fields, e.g. genomics, transcriptomics, proteomics and metabolomics. The species-metabolite relationship database, KNApSAcK Core, has been widely utilized and cited in metabolomics research, and chronological analysis of that research work has helped to reveal recent trends in metabolomics research. To meet the needs of these trends, the KNApSAcK database has been extended by incorporating a secondary metabolic pathway database called Motorcycle DB. We examined the enzyme sequence diversity related to secondary metabolism by means of batch-learning self-organizing maps (BL-SOMs). Initially, we constructed a map by using a big data matrix consisting of the frequencies of all possible dipeptides in the protein sequence segments of plants and bacteria. The enzyme sequence diversity of the secondary metabolic pathways was examined by identifying clusters of segments associated with certain enzyme groups in the resulting map. The extent of diversity of 15 secondary metabolic enzyme groups is discussed. Data-intensive approaches such as BL-SOM applied to big data matrices are needed for systematizing protein sequences. Handling big data has become an inevitable part of biology.
NASA Astrophysics Data System (ADS)
Amalia; Budiman, M. A.; Sitepu, R.
2018-03-01
Cryptography is one of the best methods to keep the information safe from security attack by unauthorized people. At present, Many studies had been done by previous researchers to generate a more robust cryptographic algorithm to provide high security for data communication. To strengthen data security, one of the methods is hybrid cryptosystem method that combined symmetric and asymmetric algorithm. In this study, we observed a hybrid cryptosystem method contain Modification Playfair Cipher 16x16 algorithm as a symmetric algorithm and Knapsack Naccache-Stern as an asymmetric algorithm. We observe a running time of this hybrid algorithm with some of the various experiments. We tried different amount of characters to be tested which are 10, 100, 1000, 10000 and 100000 characters and we also examined the algorithm with various key’s length which are 10, 20, 30, 40 of key length. The result of our study shows that the processing time for encryption and decryption process each algorithm is linearly proportional, it means the longer messages character then, the more significant times needed to encrypt and decrypt the messages. The encryption running time of Knapsack Naccache-Stern algorithm takes a longer time than its decryption, while the encryption running time of modification Playfair Cipher 16x16 algorithm takes less time than its decryption.
A model for solving the prescribed burn planning problem.
Rachmawati, Ramya; Ozlen, Melih; Reinke, Karin J; Hearne, John W
2015-01-01
The increasing frequency of destructive wildfires, with a consequent loss of life and property, has led to fire and land management agencies initiating extensive fuel management programs. This involves long-term planning of fuel reduction activities such as prescribed burning or mechanical clearing. In this paper, we propose a mixed integer programming (MIP) model that determines when and where fuel reduction activities should take place. The model takes into account multiple vegetation types in the landscape, their tolerance to frequency of fire events, and keeps track of the age of each vegetation class in each treatment unit. The objective is to minimise fuel load over the planning horizon. The complexity of scheduling fuel reduction activities has led to the introduction of sophisticated mathematical optimisation methods. While these approaches can provide optimum solutions, they can be computationally expensive, particularly for fuel management planning which extends across the landscape and spans long term planning horizons. This raises the question of how much better do exact modelling approaches compare to simpler heuristic approaches in their solutions. To answer this question, the proposed model is run using an exact MIP (using commercial MIP solver) and two heuristic approaches that decompose the problem into multiple single-period sub problems. The Knapsack Problem (KP), which is the first heuristic approach, solves the single period problems, using an exact MIP approach. The second heuristic approach solves the single period sub problem using a greedy heuristic approach. The three methods are compared in term of model tractability, computational time and the objective values. The model was tested using randomised data from 711 treatment units in the Barwon-Otway district of Victoria, Australia. Solutions for the exact MIP could be obtained for up to a 15-year planning only using a standard implementation of CPLEX. Both heuristic approaches can solve significantly larger problems, involving 100-year or even longer planning horizons. Furthermore there are no substantial differences in the solutions produced by the three approaches. It is concluded that for practical purposes a heuristic method is to be preferred to the exact MIP approach.
An Auction-Based Spectrum Leasing Mechanism for Mobile Macro-Femtocell Networks of IoT
Chen, Xin; Xing, Lei; Qiu, Tie; Li, Zhuo
2017-01-01
The Internet of Things (IoT) is a vision of the upcoming society. It can provide pervasive communication between two or more entities using 4G-LTE (Long Term Evolution) communication technology. In 4G-LTE networks, there are two important problems: helping manage the spectrum demands of IoT devices and achieving much more revenue with the limited resource. This paper proposes a pricing framework to investigate the spectrum leasing in mobile heterogeneous networks with single macrocell and multiple femtocells. We modeled the leasing procedure between the macrocell service provider (MSP) and femtocell holders (FHs) as an auction to motivate the MSP to lease its spectrum resource. All FHs act as the bidders, and the monopolist MSP acts as the auctioneer. In the auction, FHs submit their bids to rent the spectrum resource so that they can make a profit by selling it to their subscribers. The MSP determines the spectrum leasing amount and chooses the winning FHs by solving the dynamic programming-based 0–1 knapsack problem. In our proposed framework, we focus on the spectrum pricing strategy and revenue maximization of the MSP. The simulation results show that the proposed scheme provides effective motivation for the MSP to lease the spectrum to FHs, and both the MSP and FHs can benefit from spectrum leasing. PMID:28212317
Particle swarm optimization algorithm for optimizing assignment of blood in blood banking system.
Olusanya, Micheal O; Arasomwan, Martins A; Adewumi, Aderemi O
2015-01-01
This paper reports the performance of particle swarm optimization (PSO) for the assignment of blood to meet patients' blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP) introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.
General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight
NASA Astrophysics Data System (ADS)
Fu, Xiang-Qun; Bao, Wan-Su; Wang, Xiang; Shi, Jian-Hong
2016-10-01
Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is \\sumj = 0d {(O(\\sqrt {Cn - k + 1d - j }) + O(C_kj log C_k^j))} with Σd i =0 Ck i memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm. Supported by the National Basic Research Program of China under Grant No. 2013CB338002 and the National Natural Science Foundation of China under Grant No. 61502526
Solving NP-Hard Problems with Physarum-Based Ant Colony System.
Liu, Yuxin; Gao, Chao; Zhang, Zili; Lu, Yuxiao; Chen, Shi; Liang, Mingxin; Tao, Li
2017-01-01
NP-hard problems exist in many real world applications. Ant colony optimization (ACO) algorithms can provide approximate solutions for those NP-hard problems, but the performance of ACO algorithms is significantly reduced due to premature convergence and weak robustness, etc. With these observations in mind, this paper proposes a Physarum-based pheromone matrix optimization strategy in ant colony system (ACS) for solving NP-hard problems such as traveling salesman problem (TSP) and 0/1 knapsack problem (0/1 KP). In the Physarum-inspired mathematical model, one of the unique characteristics is that critical tubes can be reserved in the process of network evolution. The optimized updating strategy employs the unique feature and accelerates the positive feedback process in ACS, which contributes to the quick convergence of the optimal solution. Some experiments were conducted using both benchmark and real datasets. The experimental results show that the optimized ACS outperforms other meta-heuristic algorithms in accuracy and robustness for solving TSPs. Meanwhile, the convergence rate and robustness for solving 0/1 KPs are better than those of classical ACS.
Quantification of emissions from knapsack sprayers: 'the weight method
NASA Astrophysics Data System (ADS)
Garcia-Santos, Glenda; Binder, Claudia R.
2010-05-01
Misuse of pesticides kill or seriously sicken thousands of people every year and poison the natural environment. Investigations of occupational and environmental risk have received considerable interest over the last decades. And yet, lack of staff and analytical equipments as well the costs of chemical analyses make difficult, if not impossible, the control of the pesticide contamination and residues in humans, air, water, and soils in developing countries. To assess emissions of pesticides (transport and deposition) during spray application and the risk for the human health and the environment, tracers can be useful tools. Uranine was used to quantify drift airborne and later deposition on the neighbouring field and clothes of the applicator after spraying with a knapsack sprayer in one of the biggest areas of potato production in Colombia. Keeping the same setup the amount of wet drift was measured by difference in the weight of high absorbent papers used to collect the tracer. Surprisingly this weight method (Weight-HAP) was able to explain 71% of the drift variance measured with the tracer. Therefore the weight method is presented as a suitable rapid low cost screening tool, complementary to toxicological tests, to assess air pollution, occupational and environmental exposure generated by the emissions from knapsack sprayers during pesticide application. This technique might be important in places were there is lack of analytical instruments.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brickell, E.F.; Davis, J.A.; Simmons, G.J.
A study of the algorithm and the underlying mathematical concepts of A Polynomial Time Algorithm for Breaking Merkle-Hellman Cryptosystems, by Adi Shamir, is presented. Ways of protecting the Merkle-Hellman knapsack from cryptanalysis are given with derivations. (GHT)
Tu, Zhi-bin; Cui, Meng-jing; Yao, Hong-yan; Hu, Guo-qing; Xiang, Hui-yun; Stallones, Lorann; Zhang, Xu-jun
2012-04-01
To explore the risk factors on cases regarding work-related acute pesticide poisoning among farmers of Jiangsu province. A population-based, 1:2 matched case-control study was carried out, with 121 patients as case-group paired by 242 persons with same gender, district and age less then difference of 3 years, as controls. Cases were the ones who had suffered from work-related acute pesticide poisoning. A unified questionnaire was used. Data base was established by EpiData 3.1, and SPSS 16.0 was used for both data single factor and multi-conditional logistics regression analysis. Results from the single factor logistic regression analysis showed that the related risk factors were: lack of safety guidance, lack of readable labels before praying pesticides, no regression during application, using hand to wipe sweat, using leaking knapsack, body contaminated during application and continuing to work when feeling ill after the contact of pesticides. Results from multi-conditional logistic regression analysis indicated that the lack of safety guidance (OR=2.25, 95%CI: 1.35-3.74), no readable labels before praying pesticides (OR=1.95, 95%CI: 1.19-3.18), wiping the sweat by hand during application (OR=1.97, 95%CI: 1.20-3.24) and using leaking knapsack during application (OR=1.82, 95%CI:1.10-3.01) were risk factors for the occurrence of work-related acute pesticide poisoning. The lack of safety guidance, no readable labels before praying pesticides, wiping the sweat by hand or using leaking knapsack during application were correlated to the occurrence of work-related acute pesticide poisoning.
Drift from the Use of Hand-Held Knapsack Pesticide Sprayers in Boyacá (Colombian Andes).
García-Santos, Glenda; Feola, Giuseppe; Nuyttens, David; Diaz, Jaime
2016-05-25
Offsite pesticide losses in tropical mountainous regions have been little studied. One example is measuring pesticide drift soil deposition, which can support pesticide risk assessment for surface water, soil, bystanders, and off-target plants and fauna. This is considered a serious gap, given the evidence of pesticide-related poisoning in those regions. Empirical data of drift deposition of a pesticide surrogate, Uranine tracer, within one of the highest potato-producing regions in Colombia, characterized by small plots and mountain orography, is presented. High drift values encountered in this study reflect the actual spray conditions using hand-held knapsack sprayers. Comparison between measured and predicted drift values using three existing empirical equations showed important underestimation. However, after their optimization based on measured drift information, the equations showed a strong predictive power for this study area and the study conditions. The most suitable curve to assess mean relative drift was the IMAG calculator after optimization.
Control of the white-pine weevil with insecticidal emulsions
David Crosby
1958-01-01
Excellent control of the white-pine weevil in young white pine plantations, by applying concentrated lead arsenate spray with knapsack sprayers, was demonstrated and reported several years ago. Since then, research has shown that a number of newer insecticides, used as emulsions, are also very effective.
Straight Privilege: Unpacking the (Still) Invisible Knapsack
ERIC Educational Resources Information Center
Tollefson, Kaia
2010-01-01
Several unearned benefits attending straight privilege are listed, prefaced by two main arguments. First, it is argued that the rampant heterosexism in the U.S. is largely attributable to many Americans' framing of heterosexism as a matter of religious freedom rather than as a form of bigotry. It is further argued that educators' elimination of…
Relatedness-based Multi-Entity Summarization
Gunaratna, Kalpa; Yazdavar, Amir Hossein; Thirunarayan, Krishnaprasad; Sheth, Amit; Cheng, Gong
2017-01-01
Representing world knowledge in a machine processable format is important as entities and their descriptions have fueled tremendous growth in knowledge-rich information processing platforms, services, and systems. Prominent applications of knowledge graphs include search engines (e.g., Google Search and Microsoft Bing), email clients (e.g., Gmail), and intelligent personal assistants (e.g., Google Now, Amazon Echo, and Apple’s Siri). In this paper, we present an approach that can summarize facts about a collection of entities by analyzing their relatedness in preference to summarizing each entity in isolation. Specifically, we generate informative entity summaries by selecting: (i) inter-entity facts that are similar and (ii) intra-entity facts that are important and diverse. We employ a constrained knapsack problem solving approach to efficiently compute entity summaries. We perform both qualitative and quantitative experiments and demonstrate that our approach yields promising results compared to two other stand-alone state-of-the-art entity summarization approaches. PMID:29051696
McIntosh as Synecdoche: How Teacher Education's Focus on White Privilege Undermines Antiracism
ERIC Educational Resources Information Center
Lensmire, Timothy J.; McManimon, Shannon K.; Tierney, Jessica Dockter; Lee-Nichols, Mary E.; Casey, Zachary A.; Lensmire, Audrey; Davis, Bryan M.
2013-01-01
In this article, members of the Midwest Critical Whiteness Collective argue that Peggy McIntosh's seminal "knapsack" article acts as a synecdoche, or as a stand-in, for all the antiracist work to be done in teacher education and that this limits our understanding and possibilities for action. The authors develop this argument by…
Ohtana, Yuki; Abdullah, Azian Azamimi; Altaf-Ul-Amin, Md; Huang, Ming; Ono, Naoaki; Sato, Tetsuo; Sugiura, Tadao; Horai, Hisayuki; Nakamura, Yukiko; Morita Hirai, Aki; Lange, Klaus W; Kibinge, Nelson K; Katsuragi, Tetsuo; Shirai, Tsuyoshi; Kanaya, Shigehiko
2014-12-01
Developing database systems connecting diverse species based on omics is the most important theme in big data biology. To attain this purpose, we have developed KNApSAcK Family Databases, which are utilized in a number of researches in metabolomics. In the present study, we have developed a network-based approach to analyze relationships between 3D structure and biological activity of metabolites consisting of four steps as follows: construction of a network of metabolites based on structural similarity (Step 1), classification of metabolites into structure groups (Step 2), assessment of statistically significant relations between structure groups and biological activities (Step 3), and 2-dimensional clustering of the constructed data matrix based on statistically significant relations between structure groups and biological activities (Step 4). Applying this method to a data set consisting of 2072 secondary metabolites and 140 biological activities reported in KNApSAcK Metabolite Activity DB, we obtained 983 statistically significant structure group-biological activity pairs. As a whole, we systematically analyzed the relationship between 3D-chemical structures of metabolites and biological activities. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Bas, Esra
2014-07-01
In this paper, an integrated methodology for Quality Function Deployment (QFD) and a 0-1 knapsack model is proposed for occupational safety and health as a systems thinking approach. The House of Quality (HoQ) in QFD methodology is a systematic tool to consider the inter-relationships between two factors. In this paper, three HoQs are used to consider the interrelationships between tasks and hazards, hazards and events, and events and preventive/protective measures. The final priority weights of events are defined by considering their project-specific preliminary weights, probability of occurrence, and effects on the victim and the company. The priority weights of the preventive/protective measures obtained in the last HoQ are fed into a 0-1 knapsack model for the investment decision. Then, the selected preventive/protective measures can be adapted to the task design. The proposed step-by-step methodology can be applied to any stage of a project to design the workplace for occupational safety and health, and continuous improvement for safety is endorsed by the closed loop characteristic of the integrated methodology. Copyright © 2013 Elsevier Ltd. All rights reserved.
Proceedings of the second SISAL users` conference
DOE Office of Scientific and Technical Information (OSTI.GOV)
Feo, J T; Frerking, C; Miller, P J
1992-12-01
This report contains papers on the following topics: A sisal code for computing the fourier transform on S{sub N}; five ways to fill your knapsack; simulating material dislocation motion in sisal; candis as an interface for sisal; parallelisation and performance of the burg algorithm on a shared-memory multiprocessor; use of genetic algorithm in sisal to solve the file design problem; implementing FFT`s in sisal; programming and evaluating the performance of signal processing applications in the sisal programming environment; sisal and Von Neumann-based languages: translation and intercommunication; an IF2 code generator for ADAM architecture; program partitioning for NUMA multiprocessor computer systems;more » mapping functional parallelism on distributed memory machines; implicit array copying: prevention is better than cure ; mathematical syntax for sisal; an approach for optimizing recursive functions; implementing arrays in sisal 2.0; Fol: an object oriented extension to the sisal language; twine: a portable, extensible sisal execution kernel; and investigating the memory performance of the optimizing sisal compiler.« less
Hybridization of decomposition and local search for multiobjective optimization.
Ke, Liangjun; Zhang, Qingfu; Battiti, Roberto
2014-10-01
Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: memetic algorithm based on decomposition (MOMAD). It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MOMAD evolves three populations: 1) population P(L) for recording the current solution to each subproblem; 2) population P(P) for storing starting solutions for Pareto local search; and 3) an external population P(E) for maintaining all the nondominated solutions found so far during the search. A problem-specific single objective heuristic can be applied to these subproblems to initialize the three populations. At each generation, a Pareto local search method is first applied to search a neighborhood of each solution in P(P) to update P(L) and P(E). Then a single objective local search is applied to each perturbed solution in P(L) for improving P(L) and P(E), and reinitializing P(P). The procedure is repeated until a stopping condition is met. MOMAD provides a generic hybrid multiobjective algorithmic framework in which problem specific knowledge, well developed single objective local search and heuristics and Pareto local search methods can be hybridized. It is a population based iterative method and thus an anytime algorithm. Extensive experiments have been conducted in this paper to study MOMAD and compare it with some other state-of-the-art algorithms on the multiobjective traveling salesman problem and the multiobjective knapsack problem. The experimental results show that our proposed algorithm outperforms or performs similarly to the best so far heuristics on these two problems.
Optimality and stability of symmetric evolutionary games with applications in genetic selection.
Huang, Yuanyuan; Hao, Yiping; Wang, Min; Zhou, Wen; Wu, Zhijun
2015-06-01
Symmetric evolutionary games, i.e., evolutionary games with symmetric fitness matrices, have important applications in population genetics, where they can be used to model for example the selection and evolution of the genotypes of a given population. In this paper, we review the theory for obtaining optimal and stable strategies for symmetric evolutionary games, and provide some new proofs and computational methods. In particular, we review the relationship between the symmetric evolutionary game and the generalized knapsack problem, and discuss the first and second order necessary and sufficient conditions that can be derived from this relationship for testing the optimality and stability of the strategies. Some of the conditions are given in different forms from those in previous work and can be verified more efficiently. We also derive more efficient computational methods for the evaluation of the conditions than conventional approaches. We demonstrate how these conditions can be applied to justifying the strategies and their stabilities for a special class of genetic selection games including some in the study of genetic disorders.
Hoechst and Wacker plan joint venture in PVC
DOE Office of Scientific and Technical Information (OSTI.GOV)
Young, I.
1992-12-02
Restructuring of Europe's petrochemical industry has taken a further step with the announcement that Hoechst (Frankfurt) and Wacker Chemie (Munich) are planning a joint venture in polyvinyl chloride (PVC). The venture would include production, R D, sales and marketing, plus both companies' PVC recycling activities. However, their vinyl chloride monomer (VCM) plants, and Hoechst's Kalle PVC film business, have been left out. Erich Schnitzler, head of Hoechst's PVC business unit, does not anticipate problems with the European Community's competition directorate. We are both among the middle-sized European PVC producers, and together we would have a 9%-10% market share. Our jointmore » venture would not limit competition. Both partners are hoping for approval from Brussels in first-quarter 1993. Hoechst has 255,000 m.t./year of PVC capacity at Gendorfand Knapsack, while Wacker has 365,000 m.t./year at Burghausen and Cologne. All the units, except Wacker's Cologne plant, are back integrated to VCM. The joint venture would buy VCM from the two parent companies and on the merchant market.« less
Commanders Responsibilities in the Operations Process During the 1864 Red River Expedition
2015-05-21
1999), 340. (Hereafter referred to as J.C.C.W.). 20 J.C.C.W., 278. 6 Major General Frederick Steele , 17,000 troops from the Department of the...Assistant Quartermaster Captain D .N. Welch noted “the navy is seizing all that cotton they can get hold of. Every gun -boat is loaded with cotton...then precipitated an increasing withdrawal, turned into an all-out rout, of the Union forces as “ Guns , knapsacks, blankets—everything was thrown away by
A Comparision of Heuristic Methods Used in Hierarchical Production Planning.
1979-03-01
literature: Equalization— of—Run—Out—Ti mes ( EROT ) (12], Winters ( 18 ] , Hex and Meal (lii, and Knap- sack [1] . Figure 2 displays a flow chart...forecast error mus t be greater than 24% for this difference to be noticed. Hax—Meal outperformed the EROT with forecast error between 18 and 23% by more...planning frame- work: the Equalization—of—Run—Out—Time approach (12], the Winters approach [ 18 ], the Hax—Meal approach [lii, and the Knapsack approach (1
Knapsack - TOPSIS Technique for Vertical Handover in Heterogeneous Wireless Network
2015-01-01
In a heterogeneous wireless network, handover techniques are designed to facilitate anywhere/anytime service continuity for mobile users. Consistent best-possible access to a network with widely varying network characteristics requires seamless mobility management techniques. Hence, the vertical handover process imposes important technical challenges. Handover decisions are triggered for continuous connectivity of mobile terminals. However, bad network selection and overload conditions in the chosen network can cause fallout in the form of handover failure. In order to maintain the required Quality of Service during the handover process, decision algorithms should incorporate intelligent techniques. In this paper, a new and efficient vertical handover mechanism is implemented using a dynamic programming method from the operation research discipline. This dynamic programming approach, which is integrated with the Technique to Order Preference by Similarity to Ideal Solution (TOPSIS) method, provides the mobile user with the best handover decisions. Moreover, in this proposed handover algorithm a deterministic approach which divides the network into zones is incorporated into the network server in order to derive an optimal solution. The study revealed that this method is found to achieve better performance and QoS support to users and greatly reduce the handover failures when compared to the traditional TOPSIS method. The decision arrived at the zone gateway using this operational research analytical method (known as the dynamic programming knapsack approach together with Technique to Order Preference by Similarity to Ideal Solution) yields remarkably better results in terms of the network performance measures such as throughput and delay. PMID:26237221
Knapsack--TOPSIS Technique for Vertical Handover in Heterogeneous Wireless Network.
Malathy, E M; Muthuswamy, Vijayalakshmi
2015-01-01
In a heterogeneous wireless network, handover techniques are designed to facilitate anywhere/anytime service continuity for mobile users. Consistent best-possible access to a network with widely varying network characteristics requires seamless mobility management techniques. Hence, the vertical handover process imposes important technical challenges. Handover decisions are triggered for continuous connectivity of mobile terminals. However, bad network selection and overload conditions in the chosen network can cause fallout in the form of handover failure. In order to maintain the required Quality of Service during the handover process, decision algorithms should incorporate intelligent techniques. In this paper, a new and efficient vertical handover mechanism is implemented using a dynamic programming method from the operation research discipline. This dynamic programming approach, which is integrated with the Technique to Order Preference by Similarity to Ideal Solution (TOPSIS) method, provides the mobile user with the best handover decisions. Moreover, in this proposed handover algorithm a deterministic approach which divides the network into zones is incorporated into the network server in order to derive an optimal solution. The study revealed that this method is found to achieve better performance and QoS support to users and greatly reduce the handover failures when compared to the traditional TOPSIS method. The decision arrived at the zone gateway using this operational research analytical method (known as the dynamic programming knapsack approach together with Technique to Order Preference by Similarity to Ideal Solution) yields remarkably better results in terms of the network performance measures such as throughput and delay.
Multi-Criteria Knapsack Problem for Disease Selection in an Observation Ward
NASA Astrophysics Data System (ADS)
Lurkittikul, N.; Kittithreerapronchai, O.
2014-06-01
The aging population and the introduction of Thailand universal healthcare have increased inpatients and outpatients to public hospitals, particularly to a hospital that provides special and comprehensive health services. Many inpatient wards have experienced large influx of inpatients as the hospitals have to admit all patients regardless their conditions. These overcrowding wards cause stress to medical staffs, block access between medical departments, hospital-acquired infections, and ineffective uses of resources. One way to manage such inundated inpatient is to select some patients whose conditions require less clinical attention or whose lengths of stay are predictable and short and, then, place them at an observation ward. This intermediate ward increases turnover of beds and reduces unnecessary paperwork as patients are considered to be outpatients. In this article, we studied inpatient data of a tertiary care hospital in which an observation ward was considered to alleviate the overcrowding problem at Internal Medicine Department. The analysis of data showed that the hospital can balance inpatient flow by managing a group of patients who is admitted because of treatments ordered by its special clinics. Having explored several alternatives, we suggested patient selection criteria and proposed a layout at an observation ward. The hospital should increase medical beds in a new building ward because the current observation ward can handle 27.3% of total short stay patients, while the observation ward is projected to handle 80% of total short stay patients.
Optimizing Medical Kits for Spaceflight
NASA Technical Reports Server (NTRS)
Keenan, A. B,; Foy, Millennia; Myers, G.
2014-01-01
The Integrated Medical Model (IMM) is a probabilistic model that estimates medical event occurrences and mission outcomes for different mission profiles. IMM simulation outcomes describing the impact of medical events on the mission may be used to optimize the allocation of resources in medical kits. Efficient allocation of medical resources, subject to certain mass and volume constraints, is crucial to ensuring the best outcomes of in-flight medical events. We implement a new approach to this medical kit optimization problem. METHODS We frame medical kit optimization as a modified knapsack problem and implement an algorithm utilizing a dynamic programming technique. Using this algorithm, optimized medical kits were generated for 3 different mission scenarios with the goal of minimizing the probability of evacuation and maximizing the Crew Health Index (CHI) for each mission subject to mass and volume constraints. Simulation outcomes using these kits were also compared to outcomes using kits optimized..RESULTS The optimized medical kits generated by the algorithm described here resulted in predicted mission outcomes more closely approached the unlimited-resource scenario for Crew Health Index (CHI) than the implementation in under all optimization priorities. Furthermore, the approach described here improves upon in reducing evacuation when the optimization priority is minimizing the probability of evacuation. CONCLUSIONS This algorithm provides an efficient, effective means to objectively allocate medical resources for spaceflight missions using the Integrated Medical Model.
Liquid Fertilizer Spraying Performance Using A Knapsack Power Sprayer On Soybean Field
NASA Astrophysics Data System (ADS)
Gatot, P.; Anang, R.
2018-05-01
An effort for increasing soybean production can be conducted by applying liquid fertilizer on soybean cultivation field. The objective of this research was to determine liquid fertilizer spraying performance using knapsack power sprayer TASCO TF-900 on a soybean cultivation field. Performances test were conducted in the Laboratory of Spraying Test and on a soybean cultivation field to determine (1) effective spraying width, (2) droplets diameter, (3) droplets density, (4) effective spraying discharge rate, and (5) effective field capacity of spraying. The research was conducted using 2 methods: (1) one-nozzle spraying, and (2) four- nozzles spraying. Results of the research showed that at a constant pressure of 900 kPa effective spraying width using one-nozzle spraying and four-nozzles spraying were 0.62 m and 1.10 m. A bigger effective spraying width was resulted in a bigger average effective spraying discharge rate and average effective spraying field capacity of 4.52 l/min and 83.92 m2/min on forward walking speed range of 0.94 m/s up to 1.77 m/s. On the contrary, bigger effective spraying width was result in bigger droplets diameter of 502.73 μm and a smaller droplets density of 98.39 droplets/cm2, whereas smaller effective spraying width was resulted in a smaller droplets diameter of 367.09 μm and a bigger droplets density of 350.53 droplets/cm2. One-nozzle spraying method produced a better spraying quality than four-nozzles spraying method, although four-nozzles spraying was resulted in a bigger effective field capacity of spraying.
Optimal reservoir operation policies using novel nested algorithms
NASA Astrophysics Data System (ADS)
Delipetrev, Blagoj; Jonoski, Andreja; Solomatine, Dimitri
2015-04-01
Historically, the two most widely practiced methods for optimal reservoir operation have been dynamic programming (DP) and stochastic dynamic programming (SDP). These two methods suffer from the so called "dual curse" which prevents them to be used in reasonably complex water systems. The first one is the "curse of dimensionality" that denotes an exponential growth of the computational complexity with the state - decision space dimension. The second one is the "curse of modelling" that requires an explicit model of each component of the water system to anticipate the effect of each system's transition. We address the problem of optimal reservoir operation concerning multiple objectives that are related to 1) reservoir releases to satisfy several downstream users competing for water with dynamically varying demands, 2) deviations from the target minimum and maximum reservoir water levels and 3) hydropower production that is a combination of the reservoir water level and the reservoir releases. Addressing such a problem with classical methods (DP and SDP) requires a reasonably high level of discretization of the reservoir storage volume, which in combination with the required releases discretization for meeting the demands of downstream users leads to computationally expensive formulations and causes the curse of dimensionality. We present a novel approach, named "nested" that is implemented in DP, SDP and reinforcement learning (RL) and correspondingly three new algorithms are developed named nested DP (nDP), nested SDP (nSDP) and nested RL (nRL). The nested algorithms are composed from two algorithms: 1) DP, SDP or RL and 2) nested optimization algorithm. Depending on the way we formulate the objective function related to deficits in the allocation problem in the nested optimization, two methods are implemented: 1) Simplex for linear allocation problems, and 2) quadratic Knapsack method in the case of nonlinear problems. The novel idea is to include the nested optimization algorithm into the state transition that lowers the starting problem dimension and alleviates the curse of dimensionality. The algorithms can solve multi-objective optimization problems, without significantly increasing the complexity and the computational expenses. The algorithms can handle dense and irregular variable discretization, and are coded in Java as prototype applications. The three algorithms were tested at the multipurpose reservoir Knezevo of the Zletovica hydro-system located in the Republic of Macedonia, with eight objectives, including urban water supply, agriculture, ensuring ecological flow, and generation of hydropower. Because the Zletovica hydro-system is relatively complex, the novel algorithms were pushed to their limits, demonstrating their capabilities and limitations. The nSDP and nRL derived/learned the optimal reservoir policy using 45 (1951-1995) years historical data. The nSDP and nRL optimal reservoir policy was tested on 10 (1995-2005) years historical data, and compared with nDP optimal reservoir operation in the same period. The nested algorithms and optimal reservoir operation results are analysed and explained.
Cascaded Optimization for a Persistent Data Ferrying Unmanned Aircraft
NASA Astrophysics Data System (ADS)
Carfang, Anthony
This dissertation develops and assesses a cascaded method for designing optimal periodic trajectories and link schedules for an unmanned aircraft to ferry data between stationary ground nodes. This results in a fast solution method without the need to artificially constrain system dynamics. Focusing on a fundamental ferrying problem that involves one source and one destination, but includes complex vehicle and Radio-Frequency (RF) dynamics, a cascaded structure to the system dynamics is uncovered. This structure is exploited by reformulating the nonlinear optimization problem into one that reduces the independent control to the vehicle's motion, while the link scheduling control is folded into the objective function and implemented as an optimal policy that depends on candidate motion control. This formulation is proven to maintain optimality while reducing computation time in comparison to traditional ferry optimization methods. The discrete link scheduling problem takes the form of a combinatorial optimization problem that is known to be NP-Hard. A derived necessary condition for optimality guides the development of several heuristic algorithms, specifically the Most-Data-First Algorithm and the Knapsack Adaptation. These heuristics are extended to larger ferrying scenarios, and assessed analytically and through Monte Carlo simulation, showing better throughput performance in the same order of magnitude of computation time in comparison to other common link scheduling policies. The cascaded optimization method is implemented with a novel embedded software system on a small, unmanned aircraft to validate the simulation results with field experiments. To address the sensitivity of results on trajectory tracking performance, a system that combines motion and link control with waypoint-based navigation is developed and assessed through field experiments. The data ferrying algorithms are further extended by incorporating a Gaussian process to opportunistically learn the RF environment. By continuously improving RF models, the cascaded planner can continually improve the ferrying system's overall performance.
Baharuddin, Mohd Rafee B; Sahid, Ismail B; Noor, Mohamad Azhar B Mohd; Sulaiman, Norela; Othman, Fadzil
2011-01-01
A cross-section analytical study was conducted to evaluate the risk of pesticide exposure to those applying the Class II pesticides 2,4-D and paraquat in the paddy-growing areas of Kerian, Perak, Malaysia. It investigated the influence of weather on exposure as well as documented health problems commonly related to pesticide exposure. Potential inhalation and dermal exposure for 140 paddy farmers (handlers of pesticides) were assessed. Results showed that while temperature and humidity affected exposure, windspeed had the strongest impact on pesticide exposure via inhalation. However, the degree of exposure to both herbicides via inhalation was below the permissible exposure limits set by United States National Institute of Occupational Safety and Health (NIOSH). Dermal Exposure Assessment Method (DREAM) readings showed that dermal exposure with manual spraying ranged from moderate to high. With motorized sprayers, however, the level of dermal exposure ranged from low to moderate. Dermal exposure was significantly negatively correlated with the usage of protective clothing. Various types of deleterious health effects were detected among users of manual knapsack sprayers. Long-term spraying activities were positively correlated with increasing levels of the gamma-glutamyl transpeptidase (GGT) liver enzyme. The type of spraying equipment, usage of proper protective clothing and adherence to correct spraying practices were found to be the most important factors influencing the degree of pesticide exposure among those applying pesticides.
Mass and Volume Optimization of Space Flight Medical Kits
NASA Technical Reports Server (NTRS)
Keenan, A. B.; Foy, Millennia Hope; Myers, Jerry
2014-01-01
Resource allocation is a critical aspect of space mission planning. All resources, including medical resources, are subject to a number of mission constraints such a maximum mass and volume. However, unlike many resources, there is often limited understanding in how to optimize medical resources for a mission. The Integrated Medical Model (IMM) is a probabilistic model that estimates medical event occurrences and mission outcomes for different mission profiles. IMM simulates outcomes and describes the impact of medical events in terms of lost crew time, medical resource usage, and the potential for medically required evacuation. Previously published work describes an approach that uses the IMM to generate optimized medical kits that maximize benefit to the crew subject to mass and volume constraints. We improve upon the results obtained previously and extend our approach to minimize mass and volume while meeting some benefit threshold. METHODS We frame the medical kit optimization problem as a modified knapsack problem and implement an algorithm utilizing dynamic programming. Using this algorithm, optimized medical kits were generated for 3 mission scenarios with the goal of minimizing the medical kit mass and volume for a specified likelihood of evacuation or Crew Health Index (CHI) threshold. The algorithm was expanded to generate medical kits that maximize likelihood of evacuation or CHI subject to mass and volume constraints. RESULTS AND CONCLUSIONS In maximizing benefit to crew health subject to certain constraints, our algorithm generates medical kits that more closely resemble the unlimited-resource scenario than previous approaches which leverage medical risk information generated by the IMM. Our work here demonstrates that this algorithm provides an efficient and effective means to objectively allocate medical resources for spaceflight missions and provides an effective means of addressing tradeoffs in medical resource allocations and crew mission success parameters.
Matsuda, Fumio; Nakabayashi, Ryo; Sawada, Yuji; Suzuki, Makoto; Hirai, Masami Y.; Kanaya, Shigehiko; Saito, Kazuki
2011-01-01
A novel framework for automated elucidation of metabolite structures in liquid chromatography–mass spectrometer metabolome data was constructed by integrating databases. High-resolution tandem mass spectra data automatically acquired from each metabolite signal were used for database searches. Three distinct databases, KNApSAcK, ReSpect, and the PRIMe standard compound database, were employed for the structural elucidation. The outputs were retrieved using the CAS metabolite identifier for identification and putative annotation. A simple metabolite ontology system was also introduced to attain putative characterization of the metabolite signals. The automated method was applied for the metabolome data sets obtained from the rosette leaves of 20 Arabidopsis accessions. Phenotypic variations in novel Arabidopsis metabolites among these accessions could be investigated using this method. PMID:22645535
"Parents a dead end life": The main experiences of parents of children with leukemia.
Jadidi, Rahmatollah; Hekmatpou, Davood; Eghbali, Aziz; Memari, Fereshteh; Anbari, Zohreh
2014-11-01
The quantitative studies show that due to the widespread prevalence, high death rate, high treatment expenses, and long hospital stay, leukemia influences the families and their children to a great extent. In this regard, no qualitative study has been conducted in Iran. So, this study was conducted in Arak in 2011 with the aim of expressing the experiences of the parents whose children suffered from leukemia. Using qualitative research approach, by applying content analysis method, 22 participants were interviewed in two educational hospitals during 2 months. The study was started by purposive sampling and continued by theoretical one. The data were analyzed based on the content analysis method. Data analysis showed that insolvency, knapsack problems, cancer secrecy, trust on God, self-sacrifice, adaptation, medical malpractice, and hospital facilities were the level 3 codes of parents' experiences and "parents a dead end life" was the main theme of this study. In this study, the experiences of the parents whose children suffered from cancer were studied deeply by the use of qualitative method, especially by the use of resources syncretism rather than studying quantitatively. Parents a dead end life emerged as the main theme of this study, emphasizing the necessity of paying further attention to the parents. On the other hand, making more use of parents' experiences and encouraging them helps make the treatment more effective. It is suggested that these experiences be shared with parents in the form of pamphlets distributed right at the beginning of the treatment process.
Zusammenarbeit aus Sicht eines outgesourcten Instandhalters
NASA Astrophysics Data System (ADS)
Grüßer, Stefan; Loeven, Heinz-Wilhelm
Dauerhafter Unternehmenserfolg ist nur mit einer fortschrittlichen Instandhaltung zu erzielen. Durch den enormen Kostendruck infolge der Globalisierung und die Innovationssprünge auf der technischen Seite wird auch die Frage nach der modernen Organisationsform für die Instandhaltung gestellt. Eine Möglichkeit der Kostenoptimierung ist das Outsourcing von Instandhaltungsleistungen. Hierbei ist es unerlässlich, dass sich die Mitarbeiter zum Dienstleister entwickeln. In diesem Beitrag wird die Entwicklung der InfraServ Knapsack von einer internen Instandhaltungsabteilung hin zu einem Industriellen Dienstleister beschrieben und Aspekte der Zusammenarbeit mit externen Kunden aus der Sicht des outgesourcten Instandhalters geschildert. Es werden die wichtigen Entwicklungsschritte zur Dienstleistungsorientierung der früheren Eigeninstandhaltung aufgezeigt. Dieser Beitrag ist nicht als "Königsweg“ zu verstehen, er soll vielmehr anhand der Erfahrungen einer outgesourcten Eigeninstandhaltung Anregungen für die Entwicklung der eigenen Instandhaltungsorganisation liefern.
Oesterlund, Anna H; Thomsen, Jane F; Sekimpi, Deogratias K; Maziina, James; Racheal, Apio; Jørs, Erik
2014-06-01
Over the past years there has been an increase in the use of pesticides in developing countries. This study describes pesticide use among small-scale farmers in Uganda and analyses predictors of pesticide poisoning (intoxication) symptoms. A cross-sectional study was conducted using a standardized questionnaire. Some 317 small-scale farmers in two districts in Uganda were interviewed about pesticide use, knowledge and attitude, symptoms of intoxication, personal protective equipment (PPE) and hygiene. The risk of reporting symptoms was analysed using logistic regression analysis. The most frequently used pesticides belonged to WHO class II. The farmers had poor knowledge about pesticide toxicity, and the majority did not use appropriate PPE nor good hygiene when handling pesticides. There was no significant association between the number of times of spraying with pesticides and self-reported symptoms of pesticide poisoning. The only significant association was between blowing and sucking the nozzle of the knapsack sprayer and self-reported symptoms of pesticide intoxication (OR: 2.13. 95% CI: 1.09 - 4.18). Unlike the practice in several other developing countries, small-scale farmers in Uganda do not use the most hazardous pesticides (WHO class 1a and 1b). However use of WHO class II pesticides and those of lower toxicity is seen in combination with inadequate knowledge and practice among the farmers. This poses a danger of acute intoxications, chronic health problems and environmental pollution. Training of farmers in Integrated Pest Management (IPM) methods, use of proper hygiene and personal protective equipment when handling pesticides should be promoted.
“Parents a dead end life”: The main experiences of parents of children with leukemia
Jadidi, Rahmatollah; Hekmatpou, Davood; Eghbali, Aziz; Memari, Fereshteh; Anbari, Zohreh
2014-01-01
Background: The quantitative studies show that due to the widespread prevalence, high death rate, high treatment expenses, and long hospital stay, leukemia influences the families and their children to a great extent. In this regard, no qualitative study has been conducted in Iran. So, this study was conducted in Arak in 2011 with the aim of expressing the experiences of the parents whose children suffered from leukemia. Materials and Methods: Using qualitative research approach, by applying content analysis method, 22 participants were interviewed in two educational hospitals during 2 months. The study was started by purposive sampling and continued by theoretical one. The data were analyzed based on the content analysis method. Resluts: Data analysis showed that insolvency, knapsack problems, cancer secrecy, trust on God, self-sacrifice, adaptation, medical malpractice, and hospital facilities were the level 3 codes of parents’ experiences and “parents a dead end life” was the main theme of this study. Conclusion: In this study, the experiences of the parents whose children suffered from cancer were studied deeply by the use of qualitative method, especially by the use of resources syncretism rather than studying quantitatively. Parents a dead end life emerged as the main theme of this study, emphasizing the necessity of paying further attention to the parents. On the other hand, making more use of parents’ experiences and encouraging them helps make the treatment more effective. It is suggested that these experiences be shared with parents in the form of pamphlets distributed right at the beginning of the treatment process. PMID:25558257
Stochastic search, optimization and regression with energy applications
NASA Astrophysics Data System (ADS)
Hannah, Lauren A.
Designing clean energy systems will be an important task over the next few decades. One of the major roadblocks is a lack of mathematical tools to economically evaluate those energy systems. However, solutions to these mathematical problems are also of interest to the operations research and statistical communities in general. This thesis studies three problems that are of interest to the energy community itself or provide support for solution methods: R&D portfolio optimization, nonparametric regression and stochastic search with an observable state variable. First, we consider the one stage R&D portfolio optimization problem to avoid the sequential decision process associated with the multi-stage. The one stage problem is still difficult because of a non-convex, combinatorial decision space and a non-convex objective function. We propose a heuristic solution method that uses marginal project values---which depend on the selected portfolio---to create a linear objective function. In conjunction with the 0-1 decision space, this new problem can be solved as a knapsack linear program. This method scales well to large decision spaces. We also propose an alternate, provably convergent algorithm that does not exploit problem structure. These methods are compared on a solid oxide fuel cell R&D portfolio problem. Next, we propose Dirichlet Process mixtures of Generalized Linear Models (DPGLM), a new method of nonparametric regression that accommodates continuous and categorical inputs, and responses that can be modeled by a generalized linear model. We prove conditions for the asymptotic unbiasedness of the DP-GLM regression mean function estimate. We also give examples for when those conditions hold, including models for compactly supported continuous distributions and a model with continuous covariates and categorical response. We empirically analyze the properties of the DP-GLM and why it provides better results than existing Dirichlet process mixture regression models. We evaluate DP-GLM on several data sets, comparing it to modern methods of nonparametric regression like CART, Bayesian trees and Gaussian processes. Compared to existing techniques, the DP-GLM provides a single model (and corresponding inference algorithms) that performs well in many regression settings. Finally, we study convex stochastic search problems where a noisy objective function value is observed after a decision is made. There are many stochastic search problems whose behavior depends on an exogenous state variable which affects the shape of the objective function. Currently, there is no general purpose algorithm to solve this class of problems. We use nonparametric density estimation to take observations from the joint state-outcome distribution and use them to infer the optimal decision for a given query state. We propose two solution methods that depend on the problem characteristics: function-based and gradient-based optimization. We examine two weighting schemes, kernel-based weights and Dirichlet process-based weights, for use with the solution methods. The weights and solution methods are tested on a synthetic multi-product newsvendor problem and the hour-ahead wind commitment problem. Our results show that in some cases Dirichlet process weights offer substantial benefits over kernel based weights and more generally that nonparametric estimation methods provide good solutions to otherwise intractable problems.
Paramedics on the job: dynamic trunk motion assessment at the workplace.
Prairie, Jérôme; Corbeil, Philippe
2014-07-01
Many paramedics' work accidents are related to physical aspects of the job, and the most affected body part is the low back. This study documents the trunk motion exposure of paramedics on the job. Nine paramedics were observed over 12 shifts (120 h). Trunk postures were recorded with the computer-assisted CUELA measurement system worn on the back like a knapsack. Average duration of an emergency call was 23.5 min. Sagittal trunk flexion of >40° and twisting rotation of >24° were observed in 21% and 17% of time-sampled postures. Medical care on the scene (44% of total time) involved prolonged flexed and twisted postures (∼ 10s). The highest extreme sagittal trunk flexion (63°) and twisting rotation (40°) were observed during lifting activities, which lasted 2% of the total time. Paramedics adopted trunk motions that may significantly increase the risk of low back disorders during medical care and patient-handling activities. Copyright © 2013. Published by Elsevier Ltd.
Spatial interpolation of pesticide drift from hand-held knapsack sprayers used in potato production
NASA Astrophysics Data System (ADS)
Garcia-Santos, Glenda; Pleschberger, Martin; Scheiber, Michael; Pilz, Jürgen
2017-04-01
Tropical mountainous regions in developing countries are often neglected in research and policy but represent key areas to be considered if sustainable agricultural and rural development is to be promoted. One example is the lack of information of pesticide drift soil deposition, which can support pesticide risk assessment for soil, surface water, bystanders and off-target plants and fauna. This is considered a serious gap, given the evidence of pesticide-related poisoning in those regions. Empirical data of drift deposition of a pesticide surrogate, Uranine tracer, were obtained within one of the highest potato producing regions in Colombia. Based on the empirical data, different spatial interpolation techniques i.e. Thiessen, inverse distance squared weighting, co-kriging, pair-copulas and drift curves depending on distance and wind speed were tested and optimized. Results of the best performing spatial interpolation methods, suitable curves to assess mean relative drift and implications on risk assessment studies will be presented.
Managing Multiple Health Problems: Living with Multiple Health Problems
... treatments affect people with multiple health problems. Guiding Principles on Caring for Older Adults with Multiple Health ... interactions and other side effects. Each of the principles above is intended to help improve the health ...
Tomenson, John A; Matthews, Graham A
2009-08-01
The present investigation looks in detail at the causes and types of health incidents reported by 6,300 mainly smallholder agrochemical users in 24 countries during 2005 and 2006. The investigation is based on a questionnaire survey of knowledge, attitude and practice that concentrated on the sequence of events from purchasing the pesticide to disposal. Information was also collected about health problems experienced while using agrochemicals. The survey targeted mainly smallholder knapsack spray operators who were expected to be at a highest risk of exposure. In the 12 months prior to interview, 1.2% of users reported an agrochemical-related incident that required hospital treatment, 5.8% reported an incident requiring at least trained medical treatment but not hospitalisation and 19.8% reported only a minor sign or symptom. Users who had experienced an incident involving agricultural equipment were 3.38 (95% CI 2.29-4.99) times more likely to experience an agrochemical-related health incident, but confident users who felt that their use of personal protective equipment while spraying was best practice were 0.60 (95% CI 0.44-0.84) times less likely to experience such an incident. Over 80% of product-related incidents were caused by insecticides and the incidence rate per spraying time for incidents linked to insecticides was significantly higher than that for fungicides or herbicides. Headache/dizziness and nausea/vomiting, often smell related, were the most common symptoms reported by users who listed agrochemical products that had caused them health problems (52 and 38% of product mentions, respectively). In most countries, the incidence of serious health effects was low; however, there was a high incidence of minor signs and symptoms in a few countries, especially in Africa. A disproportionate number of incidents occurred during insecticide use relative to the time that they were sprayed. Failure to exercise caution as indicated by whether users had incidents involving agricultural equipment or livestock, and lack of confidence in their practices were the most important predictors of agrochemical-related incidents.
Step by Step: Biology Undergraduates' Problem-Solving Procedures during Multiple-Choice Assessment
ERIC Educational Resources Information Center
Prevost, Luanna B.; Lemons, Paula P.
2016-01-01
This study uses the theoretical framework of domain-specific problem solving to explore the procedures students use to solve multiple-choice problems about biology concepts. We designed several multiple-choice problems and administered them on four exams. We trained students to produce written descriptions of how they solved the problem, and this…
Executive Functions Underlying Multiplicative Reasoning: Problem Type Matters
ERIC Educational Resources Information Center
Agostino, Alba; Johnson, Janice; Pascual-Leone, Juan
2010-01-01
We investigated the extent to which inhibition, updating, shifting, and mental-attentional capacity ("M"-capacity) contribute to children's ability to solve multiplication word problems. A total of 155 children in Grades 3-6 (8- to 13-year-olds) completed a set of multiplication word problems at two levels of difficulty: one-step and multiple-step…
The representation of multiplication and division facts in memory.
De Brauwer, Jolien; Fias, Wim
2011-01-01
Recently, using a training paradigm, Campbell and Agnew (2009) observed cross-operation response time savings with nonidentical elements (e.g., practice 3 + 2, test 5 - 2) for addition and subtraction, showing that a single memory representation underlies addition and subtraction performance. Evidence for cross-operation savings between multiplication and division have been described frequently (e.g., Campbell, Fuchs-Lacelle, & Phenix, 2006) but they have always been attributed to a mediation strategy (reformulating a division problem as a multiplication problem, e.g., Campbell et al., 2006). Campbell and Agnew (2009) therefore concluded that there exists a fundamental difference between addition and subtraction on the one hand and multiplication and division on the other hand. However, our results suggest that retrieval savings between inverse multiplication and division problems can be observed. Even for small problems (solved by direct retrieval) practicing a division problem facilitated the corresponding multiplication problem and vice versa. These findings indicate that shared memory representations underlie multiplication and division retrieval. Hence, memory and learning processes do not seem to differ fundamentally between addition-subtraction and multiplication-division.
Zhao, Yingfeng; Liu, Sanyang
2016-01-01
We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.
Algorithms for output feedback, multiple-model, and decentralized control problems
NASA Technical Reports Server (NTRS)
Halyo, N.; Broussard, J. R.
1984-01-01
The optimal stochastic output feedback, multiple-model, and decentralized control problems with dynamic compensation are formulated and discussed. Algorithms for each problem are presented, and their relationship to a basic output feedback algorithm is discussed. An aircraft control design problem is posed as a combined decentralized, multiple-model, output feedback problem. A control design is obtained using the combined algorithm. An analysis of the design is presented.
Robinson, Katherine M; Ninowski, Jerilyn E
2003-12-01
Problems of the form a + b - b have been used to assess conceptual understanding of the relationship between addition and subtraction. No study has investigated the same relationship between multiplication and division on problems of the form d x e / e. In both types of inversion problems, no calculation is required if the inverse relationship between the operations is understood. Adult participants solved addition/subtraction and multiplication/division inversion (e.g., 9 x 22 / 22) and standard (e.g., 2 + 27 - 28) problems. Participants started to use the inversion strategy earlier and more frequently on addition/subtraction problems. Participants took longer to solve both types of multiplication/division problems. Overall, conceptual understanding of the relationship between multiplication and division was not as strong as that between addition and subtraction. One explanation for this difference in performance is that the operation of division is more weakly represented and understood than the other operations and that this weakness affects performance on problems of the form d x e / e.
Partitioning problems in parallel, pipelined and distributed computing
NASA Technical Reports Server (NTRS)
Bokhari, S.
1985-01-01
The problem of optimally assigning the modules of a parallel program over the processors of a multiple computer system is addressed. A Sum-Bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple satellite system: partitioning multiple chain structured parallel programs, multiple arbitrarily structured serial programs and single tree structured parallel programs. In addition, the problems of partitioning chain structured parallel programs across chain connected systems and across shared memory (or shared bus) systems are also solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple computer architectures for a wide range of problems of practical interest.
Multiple-Solution Problems in a Statistics Classroom: An Example
ERIC Educational Resources Information Center
Chu, Chi Wing; Chan, Kevin L. T.; Chan, Wai-Sum; Kwong, Koon-Shing
2017-01-01
The mathematics education literature shows that encouraging students to develop multiple solutions for given problems has a positive effect on students' understanding and creativity. In this paper, we present an example of multiple-solution problems in statistics involving a set of non-traditional dice. In particular, we consider the exact…
Chen, Wenbin; Hendrix, William; Samatova, Nagiza F
2017-12-01
The problem of aligning multiple metabolic pathways is one of very challenging problems in computational biology. A metabolic pathway consists of three types of entities: reactions, compounds, and enzymes. Based on similarities between enzymes, Tohsato et al. gave an algorithm for aligning multiple metabolic pathways. However, the algorithm given by Tohsato et al. neglects the similarities among reactions, compounds, enzymes, and pathway topology. How to design algorithms for the alignment problem of multiple metabolic pathways based on the similarity of reactions, compounds, and enzymes? It is a difficult computational problem. In this article, we propose an algorithm for the problem of aligning multiple metabolic pathways based on the similarities among reactions, compounds, enzymes, and pathway topology. First, we compute a weight between each pair of like entities in different input pathways based on the entities' similarity score and topological structure using Ay et al.'s methods. We then construct a weighted k-partite graph for the reactions, compounds, and enzymes. We extract a mapping between these entities by solving the maximum-weighted k-partite matching problem by applying a novel heuristic algorithm. By analyzing the alignment results of multiple pathways in different organisms, we show that the alignments found by our algorithm correctly identify common subnetworks among multiple pathways.
Semantic Structures of One-Step Word Problems Involving Multiplication or Division.
ERIC Educational Resources Information Center
Schmidt, Siegbert; Weiser, Werner
1995-01-01
Proposes a four-category classification of semantic structures of one-step word problems involving multiplication and division: forming the n-th multiple of measures, combinatorial multiplication, composition of operators, and multiplication by formula. This classification is compatible with semantic structures of addition and subtraction word…
ERIC Educational Resources Information Center
Ozdemir, S.; Reis, Z. Ayvaz
2013-01-01
Mathematics is an important discipline, providing crucial tools, such as problem solving, to improve our cognitive abilities. In order to solve a problem, it is better to envision and represent through multiple means. Multiple representations can help a person to redefine a problem with his/her own words in that envisioning process. Dynamic and…
Problem Posing with the Multiplication Table
ERIC Educational Resources Information Center
Dickman, Benjamin
2014-01-01
Mathematical problem posing is an important skill for teachers of mathematics, and relates readily to mathematical creativity. This article gives a bit of background information on mathematical problem posing, lists further references to connect problem posing and creativity, and then provides 20 problems based on the multiplication table to be…
Protective factors associated with fewer multiple problem behaviors among homeless/runaway youth.
Lightfoot, Marguerita; Stein, Judith A; Tevendale, Heather; Preston, Kathleen
2011-01-01
Although homeless youth exhibit numerous problem behaviors, protective factors that can be targeted and modified by prevention programs to decrease the likelihood of involvement in risky behaviors are less apparent. The current study tested a model of protective factors for multiple problem behavior in a sample of 474 homeless youth (42% girls; 83% minority) ages 12 to 24 years. Higher levels of problem solving and planning skills were strongly related to lower levels of multiple problem behaviors in homeless youth, suggesting both the positive impact of preexisting personal assets of these youth and important programmatic targets for further building their resilience and decreasing problem behaviors. Indirect relationships between the background factors of self-esteem and social support and multiple problem behaviors were significantly mediated through protective skills. The model suggests that helping youth enhance their skills in goal setting, decision making, and self-reliant coping could lessen a variety of problem behaviors commonly found among homeless youth.
Protective Factors Associated with Fewer Multiple Problem Behaviors Among Homeless/Runaway Youth
Lightfoot, Marguerita; Stein, Judith A.; Tevendale, Heather; Preston, Kathleen
2015-01-01
Although homeless youth exhibit numerous problem behaviors, protective factors that can be targeted and modified by prevention programs to decrease the likelihood of involvement in risky behaviors are less apparent. The current study tested a model of protective factors for multiple problem behavior in a sample of 474 homeless youth (42% girls; 83% minority) ages 12 to 24 years. Higher levels of problem solving and planning skills were strongly related to lower levels of multiple problem behaviors in homeless youth, suggesting both the positive impact of preexisting personal assets of these youth and important programmatic targets for further building their resilience and decreasing problem behaviors. Indirect relationships between the background factors of self-esteem and social support and multiple problem behaviors were significantly mediated through protective skills. The model suggests that helping youth enhance their skills in goal setting, decision making, and self-reliant coping could lessen a variety of problem behaviors commonly found among homeless youth. PMID:22023279
NASA Astrophysics Data System (ADS)
Fasni, Nurli; Fatimah, Siti; Yulanda, Syerli
2017-05-01
This research aims to achieve some purposes such as: to know whether mathematical problem solving ability of students who have learned mathematics using Multiple Intelligences based teaching model is higher than the student who have learned mathematics using cooperative learning; to know the improvement of the mathematical problem solving ability of the student who have learned mathematics using Multiple Intelligences based teaching model., to know the improvement of the mathematical problem solving ability of the student who have learned mathematics using cooperative learning; to know the attitude of the students to Multiple Intelligences based teaching model. The method employed here is quasi-experiment which is controlled by pre-test and post-test. The population of this research is all of VII grade in SMP Negeri 14 Bandung even-term 2013/2014, later on two classes of it were taken for the samples of this research. A class was taught using Multiple Intelligences based teaching model and the other one was taught using cooperative learning. The data of this research were gotten from the test in mathematical problem solving, scale questionnaire of the student attitudes, and observation. The results show the mathematical problem solving of the students who have learned mathematics using Multiple Intelligences based teaching model learning is higher than the student who have learned mathematics using cooperative learning, the mathematical problem solving ability of the student who have learned mathematics using cooperative learning and Multiple Intelligences based teaching model are in intermediate level, and the students showed the positive attitude in learning mathematics using Multiple Intelligences based teaching model. As for the recommendation for next author, Multiple Intelligences based teaching model can be tested on other subject and other ability.
ERIC Educational Resources Information Center
Sun, Xuhua
2011-01-01
This article deals with the roles of variation problems ("one problem multiple solution" and "one problem multiple changes") as used in Chinese textbooks. It is argued that variation problems as an "indigenous" Chinese practice aim to discern and to compare the invariant feature of the relationship among concepts and…
ERIC Educational Resources Information Center
Veldkamp, Bernard P.; Verschoor, Angela J.; Eggen, Theo J. H. M.
2010-01-01
Overexposure and underexposure of items in the bank are serious problems in operational computerized adaptive testing (CAT) systems. These exposure problems might result in item compromise, or point at a waste of investments. The exposure control problem can be viewed as a test assembly problem with multiple objectives. Information in the test has…
ERIC Educational Resources Information Center
Bliss, Stacy L.; Skinner, Christopher H.; McCallum, Elizabeth; Saecker, Lee B.; Rowland-Bryant, Emily; Brown, Katie S.
2010-01-01
An adapted alternating treatments design was used to compare the effectiveness of a taped-problems (TP) intervention with TP and an additional immediate assessment (TP + AIA) on the multiplication fluency of six fifth-grade students. During TP, the students listened to a tape playing a series of multiplication problems and answers three times.…
ERIC Educational Resources Information Center
Aydogdu Iskenderoglu, Tuba
2018-01-01
It is important for pre-service teachers to know the conceptual difficulties they have experienced regarding the concepts of multiplication and division in fractions and problem posing is a way to learn these conceptual difficulties. Problem posing is a synthetic activity that fundamentally has multiple answers. The purpose of this study is to…
Turabián, J L; Pérez Franco, B
2016-01-01
Multiple morbidity seems to be "infinite" and so is not easy to make useful decisions. A new concept is introduced: the "master problems", as a qualitative method to facilitate the exit from this maze of multiple morbidity. Metaphors from the art world have been used to teach this concept. These "master problems" generally remain hidden and can only "unravel" between the interstices of multiple morbidity, when the details of the system that defines the problem are explained. A problem with "energy" or a "master problem" is complex, multiple and dramatic or theatrical--everything in the clinical history history make us look into that particular question. It is what gives us a blow to the stomach, which causes our hearts to beat faster, that moves us on many levels, which has a high "density of emotions", human elements, social symbols, and opens solutions in a patient. Copyright © 2015 Sociedad Española de Médicos de Atención Primaria (SEMERGEN). Publicado por Elsevier España, S.L.U. All rights reserved.
Wolitzky-Taylor, Kate; Guillot, Casey R.; Pang, Raina D.; Kirkpatrick, Matthew G.; Zvolensky, Michael J.; Buckner, Julia D.; Leventhal, Adam M.
2015-01-01
Background Multiple forms of anxiety psychopathology are associated with alcohol use problems in adolescents. Yet, the mechanisms underlying this association are unclear. Anxiety sensitivity (AS) and distress tolerance (DT) represent 2 distinct, conceptually relevant transdiagnostic constructs implicated in multiple manifestations of anxiety that may also underlie alcohol use problems and thereby explain why people with anxiety are more likely to have alcohol problems. Methods The current cross-sectional study examined whether AS and DT accounted for (i.e., statistically mediated) the relationship between manifest indicators of the 3 common anxiety phenotypes (generalized anxiety, social anxiety, and panic disorders) and alcohol problems in a sample of 534 high school students (14 to 15 years old). Results Multiple manifestations of anxiety were associated with greater alcohol use problems. AS statistically mediated multiple anxiety–alcohol associations, but DT did not. Conclusions These findings provide preliminary evidence suggesting AS may be an important transdiagnostic target for alcohol prevention programs for those in early adolescence that experience elevated anxiety symptoms. PMID:25706521
De Visscher, Alice; Vogel, Stephan E; Reishofer, Gernot; Hassler, Eva; Koschutnig, Karl; De Smedt, Bert; Grabner, Roland H
2018-05-15
In the development of math ability, a large variability of performance in solving simple arithmetic problems is observed and has not found a compelling explanation yet. One robust effect in simple multiplication facts is the problem size effect, indicating better performance for small problems compared to large ones. Recently, behavioral studies brought to light another effect in multiplication facts, the interference effect. That is, high interfering problems (receiving more proactive interference from previously learned problems) are more difficult to retrieve than low interfering problems (in terms of physical feature overlap, namely the digits, De Visscher and Noël, 2014). At the behavioral level, the sensitivity to the interference effect is shown to explain individual differences in the performance of solving multiplications in children as well as in adults. The aim of the present study was to investigate the individual differences in multiplication ability in relation to the neural interference effect and the neural problem size effect. To that end, we used a paradigm developed by De Visscher, Berens, et al. (2015) that contrasts the interference effect and the problem size effect in a multiplication verification task, during functional magnetic resonance imaging (fMRI) acquisition. Forty-two healthy adults, who showed high variability in an arithmetic fluency test, participated in our fMRI study. In order to control for the general reasoning level, the IQ was taken into account in the individual differences analyses. Our findings revealed a neural interference effect linked to individual differences in multiplication in the left inferior frontal gyrus, while controlling for the IQ. This interference effect in the left inferior frontal gyrus showed a negative relation with individual differences in arithmetic fluency, indicating a higher interference effect for low performers compared to high performers. This region is suggested in the literature to be involved in resolution of proactive interference. Besides, no correlation between the neural problem size effect and multiplication performance was found. This study supports the idea that the interference due to similarities/overlap of physical traits (the digits) is crucial in memorizing arithmetic facts and in determining individual differences in arithmetic. Copyright © 2018 Elsevier Inc. All rights reserved.
The Steiner Multigraph Problem: Wildlife corridor design for multiple species
Katherine J. Lai; Carla P. Gomes; Michael K. Schwartz; Kevin S. McKelvey; David E. Calkin; Claire A. Montgomery
2011-01-01
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We introduce the Steiner Multigraph Problem to model the problem of minimum-cost wildlife corridor design for multiple species with different landscape requirements. This problem can also model...
ERIC Educational Resources Information Center
Loeber, Rolf; Hipwell, Alison; Battista, Deena; Sembower, Mark; Stouthamer-Loeber, Magda
2009-01-01
Much of the research examining intergenerational continuity of problems from mother to offspring has focused on homotypic continuity (e.g., depression), despite the fact that different types of mental health problems tend to cluster in both adults and children. It remains unclear whether mothers with multiple mental health problems compared to…
The neural bases of the multiplication problem-size effect across countries
Prado, Jérôme; Lu, Jiayan; Liu, Li; Dong, Qi; Zhou, Xinlin; Booth, James R.
2013-01-01
Multiplication problems involving large numbers (e.g., 9 × 8) are more difficult to solve than problems involving small numbers (e.g., 2 × 3). Behavioral research indicates that this problem-size effect might be due to different factors across countries and educational systems. However, there is no neuroimaging evidence supporting this hypothesis. Here, we compared the neural correlates of the multiplication problem-size effect in adults educated in China and the United States. We found a greater neural problem-size effect in Chinese than American participants in bilateral superior temporal regions associated with phonological processing. However, we found a greater neural problem-size effect in American than Chinese participants in right intra-parietal sulcus (IPS) associated with calculation procedures. Therefore, while the multiplication problem-size effect might be a verbal retrieval effect in Chinese as compared to American participants, it may instead stem from the use of calculation procedures in American as compared to Chinese participants. Our results indicate that differences in educational practices might affect the neural bases of symbolic arithmetic. PMID:23717274
Interoperation transfer in Chinese-English bilinguals' arithmetic.
Campbell, Jamie I D; Dowd, Roxanne R
2012-10-01
We examined interoperation transfer of practice in adult Chinese-English bilinguals' memory for simple multiplication (6 × 8 = 48) and addition (6 + 8 = 14) facts. The purpose was to determine whether they possessed distinct number-fact representations in both Chinese (L1) and English (L2). Participants repeatedly practiced multiplication problems (e.g., 4 × 5 = ?), answering a subset in L1 and another subset in L2. Then separate groups answered corresponding addition problems (4 + 5 = ?) and control addition problems in either L1 (N = 24) or L2 (N = 24). The results demonstrated language-specific negative transfer of multiplication practice to corresponding addition problems. Specifically, large simple addition problems (sum > 10) presented a significant response time cost (i.e., retrieval-induced forgetting) after their multiplication counterparts were practiced in the same language, relative to practice in the other language. The results indicate that our Chinese-English bilinguals had multiplication and addition facts represented in distinct language-specific memory stores.
The M Word: Multicollinearity in Multiple Regression.
ERIC Educational Resources Information Center
Morrow-Howell, Nancy
1994-01-01
Notes that existence of substantial correlation between two or more independent variables creates problems of multicollinearity in multiple regression. Discusses multicollinearity problem in social work research in which independent variables are usually intercorrelated. Clarifies problems created by multicollinearity, explains detection of…
A multiple-drawer medication layout problem in automated dispensing cabinets.
Pazour, Jennifer A; Meller, Russell D
2012-12-01
In this paper we investigate the problem of locating medications in automated dispensing cabinets (ADCs) to minimize human selection errors. We formulate the multiple-drawer medication layout problem and show that the problem can be formulated as a quadratic assignment problem. As a way to evaluate various medication layouts, we develop a similarity rating for medication pairs. To solve industry-sized problem instances, we develop a heuristic approach. We use hospital ADC transaction data to conduct a computational experiment to test the performance of our developed heuristics, to demonstrate how our approach can aid in ADC design trade-offs, and to illustrate the potential improvements that can be made when applying an analytical process to the multiple-drawer medication layout problem. Finally, we present conclusions and future research directions.
ERIC Educational Resources Information Center
Williams, James H.; And Others
1996-01-01
Problem behavior theory predicts that adolescent problem behaviors are manifestations of a single behavioral syndrome. This study tested the validity of the theory across racial groups. Results indicate that multiple pathways are necessary to account for the problem behaviors and they support previous research indicating system response bias in…
Sequential Test Strategies for Multiple Fault Isolation
NASA Technical Reports Server (NTRS)
Shakeri, M.; Pattipati, Krishna R.; Raghavan, V.; Patterson-Hine, Ann; Kell, T.
1997-01-01
In this paper, we consider the problem of constructing near optimal test sequencing algorithms for diagnosing multiple faults in redundant (fault-tolerant) systems. The computational complexity of solving the optimal multiple-fault isolation problem is super-exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and Lagrangian relaxation, we present several static and dynamic (on-line or interactive) test sequencing algorithms for the multiple fault isolation problem that provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a static diagnostic directed graph (digraph), instead of a static diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. Computational results based on real-world systems indicate that the size of a static multiple fault strategy is strictly related to the structure of the system, and that the use of an on-line multiple fault strategy can diagnose faults in systems with as many as 10,000 failure sources.
Husnawati, Husnawati; Afendi, Farit Mochamad; Darusman, Latifah K.; Altaf-Ul-Amin, Md.; Sato, Tetsuo; Ono, Naoaki; Sugiura, Tadao; Kanaya, Shigehiko
2014-01-01
Indonesia has the largest medicinal plant species in the world and these plants are used as Jamu medicines. Jamu medicines are popular traditional medicines from Indonesia and we need to systemize the formulation of Jamu and develop basic scientific principles of Jamu to meet the requirement of Indonesian Healthcare System. We propose a new approach to predict the relation between plant and disease using network analysis and supervised clustering. At the preliminary step, we assigned 3138 Jamu formulas to 116 diseases of International Classification of Diseases (ver. 10) which belong to 18 classes of disease from National Center for Biotechnology Information. The correlation measures between Jamu pairs were determined based on their ingredient similarity. Networks are constructed and analyzed by selecting highly correlated Jamu pairs. Clusters were then generated by using the network clustering algorithm DPClusO. By using matching score of a cluster, the dominant disease and high frequency plant associated to the cluster are determined. The plant to disease relations predicted by our method were evaluated in the context of previously published results and were found to produce around 90% successful predictions. PMID:24804251
Analysis of oil-pipeline distribution of multiple products subject to delivery time-windows
NASA Astrophysics Data System (ADS)
Jittamai, Phongchai
This dissertation defines the operational problems of, and develops solution methodologies for, a distribution of multiple products into oil pipeline subject to delivery time-windows constraints. A multiple-product oil pipeline is a pipeline system composing of pipes, pumps, valves and storage facilities used to transport different types of liquids. Typically, products delivered by pipelines are petroleum of different grades moving either from production facilities to refineries or from refineries to distributors. Time-windows, which are generally used in logistics and scheduling areas, are incorporated in this study. The distribution of multiple products into oil pipeline subject to delivery time-windows is modeled as multicommodity network flow structure and mathematically formulated. The main focus of this dissertation is the investigation of operating issues and problem complexity of single-source pipeline problems and also providing solution methodology to compute input schedule that yields minimum total time violation from due delivery time-windows. The problem is proved to be NP-complete. The heuristic approach, a reversed-flow algorithm, is developed based on pipeline flow reversibility to compute input schedule for the pipeline problem. This algorithm is implemented in no longer than O(T·E) time. This dissertation also extends the study to examine some operating attributes and problem complexity of multiple-source pipelines. The multiple-source pipeline problem is also NP-complete. A heuristic algorithm modified from the one used in single-source pipeline problems is introduced. This algorithm can also be implemented in no longer than O(T·E) time. Computational results are presented for both methodologies on randomly generated problem sets. The computational experience indicates that reversed-flow algorithms provide good solutions in comparison with the optimal solutions. Only 25% of the problems tested were more than 30% greater than optimal values and approximately 40% of the tested problems were solved optimally by the algorithms.
NASA Astrophysics Data System (ADS)
Yahyaei, Mohsen; Bashiri, Mahdi
2017-12-01
The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of scenarios grows exponentially with the number of facilities. To alleviate this issue, two approaches are applied simultaneously. The first approach is to apply sample average approximation to approximate the two stochastic problem via sampling. Then, by applying the multiple cuts Benders decomposition approach, computational performance is enhanced. Numerical studies show the effective performance of the SAA in terms of optimality gap for small problem instances with numerous scenarios. Moreover, performance of multi-cut Benders decomposition is assessed through comparison with the classic version and the computational results reveal the superiority of the multi-cut approach regarding the computational time and number of iterations.
NASA Astrophysics Data System (ADS)
Hawthorne, Bryant; Panchal, Jitesh H.
2014-07-01
A bilevel optimization formulation of policy design problems considering multiple objectives and incomplete preferences of the stakeholders is presented. The formulation is presented for Feed-in-Tariff (FIT) policy design for decentralized energy infrastructure. The upper-level problem is the policy designer's problem and the lower-level problem is a Nash equilibrium problem resulting from market interactions. The policy designer has two objectives: maximizing the quantity of energy generated and minimizing policy cost. The stakeholders decide on quantities while maximizing net present value and minimizing capital investment. The Nash equilibrium problem in the presence of incomplete preferences is formulated as a stochastic linear complementarity problem and solved using expected value formulation, expected residual minimization formulation, and the Monte Carlo technique. The primary contributions in this article are the mathematical formulation of the FIT policy, the extension of computational policy design problems to multiple objectives, and the consideration of incomplete preferences of stakeholders for policy design problems.
Staiger, Tobias; Waldmann, Tamara; Oexle, Nathalie; Wigand, Moritz; Rüsch, Nicolas
2018-05-21
The everyday lives of unemployed people with mental health problems can be affected by multiple discrimination, but studies about double stigma-an overlap of identities and experiences of discrimination-in this group are lacking. We therefore studied multiple discrimination among unemployed people with mental health problems and its consequences for job- and help-seeking behaviors. Everyday discrimination and attributions of discrimination to unemployment and/or to mental health problems were examined among 301 unemployed individuals with mental health problems. Job search self-efficacy, barriers to care, and perceived need for treatment were compared among four subgroups, depending on attributions of experienced discrimination to unemployment and to mental health problems (group i); neither to unemployment nor to mental health problems (group ii); mainly to unemployment (group iii); or mainly to mental health problems (group iv). In multiple regressions among all participants, higher levels of discrimination predicted reduced job search self-efficacy and higher barriers to care; and attributions of discrimination to unemployment were associated with increased barriers to care. In ANOVAs for subgroup comparisons, group i participants, who attributed discrimination to both unemployment and mental health problems, reported lower job search self-efficacy, more perceived stigma-related barriers to care and more need for treatment than group iii participants, as well as more stigma-related barriers to care than group iv. Multiple discrimination may affect job search and help-seeking among unemployed individuals with mental health problems. Interventions to reduce public stigma and to improve coping with multiple discrimination for this group should be developed.
ERIC Educational Resources Information Center
Bogard, Treavor; Liu, Min; Chiang, Yueh-hui Vanessa
2013-01-01
This multiple-case study examined how advanced learners solved a complex problem, focusing on how their frequency and application of cognitive processes contributed to differences in performance outcomes, and developing a mental model of a problem. Fifteen graduate students with backgrounds related to the problem context participated in the study.…
A Multiple Ant Colony Metahuristic for the Air Refueling Tanker Assignment Problem
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
Role of Multiple Representations in Physics Problem Solving
ERIC Educational Resources Information Center
Maries, Alexandru
2013-01-01
This thesis explores the role of multiple representations in introductory physics students' problem solving performance through several investigations. Representations can help students focus on the conceptual aspects of physics and play a major role in effective problem solving. Diagrammatic representations can play a particularly important role…
Flexibility in Problem Solving: The Case of Equation Solving
ERIC Educational Resources Information Center
Star, Jon R.; Rittle-Johnson, Bethany
2008-01-01
A key learning outcome in problem-solving domains is the development of flexible knowledge, where learners know multiple strategies and adaptively choose efficient strategies. Two interventions hypothesized to improve flexibility in problem solving were experimentally evaluated: prompts to discover multiple strategies and direct instruction on…
Students' Difficulties With Multiple Representations in Introductory Mechanics
ERIC Educational Resources Information Center
Nguyen, Dong-Hai; Rebello, N. Sanjay
2011-01-01
Research in physics education indicates that the use of multiple representations in teaching and learning helps students become better problem-solvers. We report on a study to investigate students' difficulties in solving mechanics problems presented in multiple representations. We conducted teaching/learning interviews with 20 students in a…
Berteletti, Ilaria; Prado, Jérôme; Booth, James R
2014-08-01
Greater skill in solving single-digit multiplication problems requires a progressive shift from a reliance on numerical to verbal mechanisms over development. Children with mathematical learning disability (MD), however, are thought to suffer from a specific impairment in numerical mechanisms. Here we tested the hypothesis that this impairment might prevent MD children from transitioning toward verbal mechanisms when solving single-digit multiplication problems. Brain activations during multiplication problems were compared in MD and typically developing (TD) children (3rd to 7th graders) in numerical and verbal regions which were individuated by independent localizer tasks. We used small (e.g., 2 × 3) and large (e.g., 7 × 9) problems as these problems likely differ in their reliance on verbal versus numerical mechanisms. Results indicate that MD children have reduced activations in both the verbal (i.e., left inferior frontal gyrus and left middle temporal to superior temporal gyri) and the numerical (i.e., right superior parietal lobule including intra-parietal sulcus) regions suggesting that both mechanisms are impaired. Moreover, the only reliable activation observed for MD children was in the numerical region when solving small problems. This suggests that MD children could effectively engage numerical mechanisms only for the easier problems. Conversely, TD children showed a modulation of activation with problem size in the verbal regions. This suggests that TD children were effectively engaging verbal mechanisms for the easier problems. Moreover, TD children with better language skills were more effective at engaging verbal mechanisms. In conclusion, results suggest that the numerical- and language-related processes involved in solving multiplication problems are impaired in MD children. Published by Elsevier Ltd.
Multiple-variable neighbourhood search for the single-machine total weighted tardiness problem
NASA Astrophysics Data System (ADS)
Chung, Tsui-Ping; Fu, Qunjie; Liao, Ching-Jong; Liu, Yi-Ting
2017-07-01
The single-machine total weighted tardiness (SMTWT) problem is a typical discrete combinatorial optimization problem in the scheduling literature. This problem has been proved to be NP hard and thus provides a challenging area for metaheuristics, especially the variable neighbourhood search algorithm. In this article, a multiple variable neighbourhood search (m-VNS) algorithm with multiple neighbourhood structures is proposed to solve the problem. Special mechanisms named matching and strengthening operations are employed in the algorithm, which has an auto-revising local search procedure to explore the solution space beyond local optimality. Two aspects, searching direction and searching depth, are considered, and neighbourhood structures are systematically exchanged. Experimental results show that the proposed m-VNS algorithm outperforms all the compared algorithms in solving the SMTWT problem.
Impact of ageing on problem size and proactive interference in arithmetic facts solving.
Archambeau, Kim; De Visscher, Alice; Noël, Marie-Pascale; Gevers, Wim
2018-02-01
Arithmetic facts (AFs) are required when solving problems such as "3 × 4" and refer to calculations for which the correct answer is retrieved from memory. Currently, two important effects that modulate the performance in AFs have been highlighted: the problem size effect and the proactive interference effect. The aim of this study is to investigate possible age-related changes of the problem size effect and the proactive interference effect in AF solving. To this end, the performance of young and older adults was compared in a multiplication production task. Furthermore, an independent measure of proactive interference was assessed to further define the architecture underlying this effect in multiplication solving. The results indicate that both young and older adults were sensitive to the effects of interference and of the problem size. That is, both interference and problem size affected performance negatively: the time needed to solve a multiplication problem increases as the level of interference and the size of the problem increase. Regarding the effect of ageing, the problem size effect remains constant with age, indicating a preserved AF network in older adults. Interestingly, sensitivity to proactive interference in multiplication solving was less pronounced in older than in younger adults suggesting that part of the proactive interference has been overcome with age.
A Fiducial Approach to Extremes and Multiple Comparisons
ERIC Educational Resources Information Center
Wandler, Damian V.
2010-01-01
Generalized fiducial inference is a powerful tool for many difficult problems. Based on an extension of R. A. Fisher's work, we used generalized fiducial inference for two extreme value problems and a multiple comparison procedure. The first extreme value problem is dealing with the generalized Pareto distribution. The generalized Pareto…
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
NASA Astrophysics Data System (ADS)
Xu, Zhou; Rodrigues, Brian
As an important extension of the classical traveling salesman problem (TSP), the multiple depot multiple traveling salesman problem (MDMTSP) is to minimize the total length of a collection of tours for multiple vehicles to serve all the customers, where each vehicle must start or stay at its distinct depot. Due to the gap between the existing best approximation ratios for the TSP and for the MDMTSP in literature, which are 3/2 and 2, respectively, it is an open question whether or not a 3/2-approximation algorithm exists for the MDMTSP. We have partially addressed this question by developing a 3/2-approximation algorithm, which runs in polynomial time when the number of depots is a constant.
Schiff, Miriam; Pat-Horenczyk, Ruth; Ziv, Yuval; Brom, Danny
2017-09-01
This study examined whether maternal depression, mother-child relationships, and maternal perceived social support mediate the associations between child's exposure to multiple traumatic events and behavioral problems. We recruited a representative sample of 904 Israeli (Jewish and Arab) mothers and their 2- to 6-year-old children. Data collection was conducted through structured face-to-face interviews with the mothers between July and November 2011. All measures were completed by the mothers. We used the child's and mother's exposure to political violence questionnaires, Child Behavior Checklist (CBCL), a short version of the Parental Acceptance-Rejection Questionnaire (PARQ), the Center for Epidemiologic Studies Depression Scale (CES-D), and the Medical Outcomes Study (MOS) Social Support Survey. The research study model was tested using path analysis. The model showed a very good fit to the data, suggesting that maternal rejection, maternal depression, and social support play an important role in child's behavioral problems in the context of multiple traumatic events. Higher levels of maternal rejection were significantly associated with greater children behavior problems. Maternal rejection mediated the associations between maternal depressive symptoms and child's behavioral problems. Maternal perceived social support mediated the associations between child's exposure to multiple traumatic events and child's behavioral problems; child's exposure to multiple traumatic events was associated with lower levels of maternal perceived social support. In turn, lower levels of perceived social support were associated with higher levels of behavioral problems. In conclusion, in accordance with the "social stress framework," social support has a mediation role in the association between exposure to traumatic events and child's behavioral problems. Thus, enhancing social support to mothers to young children in the context of multiple traumatic events is essential for children resiliency.
Not Just Hats Anymore: Binomial Inversion and the Problem of Multiple Coincidences
ERIC Educational Resources Information Center
Hathout, Leith
2007-01-01
The well-known "hats" problem, in which a number of people enter a restaurant and check their hats, and then receive them back at random, is often used to illustrate the concept of derangements, that is, permutations with no fixed points. In this paper, the problem is extended to multiple items of clothing, and a general solution to the problem of…
Sonnemann, Eckart
2008-10-01
The introduction of sequentially rejective multiple test procedures (Einot and Gabriel, 1975; Naik, 1975; Holm, 1977; Holm, 1979) has caused considerable progress in the theory of multiple comparisons. Emphasizing the closure of multiple tests we give a survey of the general theory and its recent results in applications. Some new applications are given including a discussion of the connection with the theory of confidence regions.
Dynamical modelling of coordinated multiple robot systems
NASA Technical Reports Server (NTRS)
Hayati, Samad
1987-01-01
The state of the art in the modeling of the dynamics of coordinated multiple robot manipulators is summarized and various problems related to this subject are discussed. It is recognized that dynamics modeling is a component used in the design of controllers for multiple cooperating robots. As such, the discussion addresses some problems related to the control of multiple robots. The techniques used to date in the modeling of closed kinematic chains are summarized. Various efforts made to date for the control of coordinated multiple manipulators is summarized.
NASA Technical Reports Server (NTRS)
Denning, Peter J.; Tichy, Walter F.
1990-01-01
Highly parallel computing architectures are the only means to achieve the computation rates demanded by advanced scientific problems. A decade of research has demonstrated the feasibility of such machines and current research focuses on which architectures designated as multiple instruction multiple datastream (MIMD) and single instruction multiple datastream (SIMD) have produced the best results to date; neither shows a decisive advantage for most near-homogeneous scientific problems. For scientific problems with many dissimilar parts, more speculative architectures such as neural networks or data flow may be needed.
Some controversial multiple testing problems in regulatory applications.
Hung, H M James; Wang, Sue-Jane
2009-01-01
Multiple testing problems in regulatory applications are often more challenging than the problems of handling a set of mathematical symbols representing multiple null hypotheses under testing. In the union-intersection setting, it is important to define a family of null hypotheses relevant to the clinical questions at issue. The distinction between primary endpoint and secondary endpoint needs to be considered properly in different clinical applications. Without proper consideration, the widely used sequential gate keeping strategies often impose too many logical restrictions to make sense, particularly to deal with the problem of testing multiple doses and multiple endpoints, the problem of testing a composite endpoint and its component endpoints, and the problem of testing superiority and noninferiority in the presence of multiple endpoints. Partitioning the null hypotheses involved in closed testing into clinical relevant orderings or sets can be a viable alternative to resolving the illogical problems requiring more attention from clinical trialists in defining the clinical hypotheses or clinical question(s) at the design stage. In the intersection-union setting there is little room for alleviating the stringency of the requirement that each endpoint must meet the same intended alpha level, unless the parameter space under the null hypothesis can be substantially restricted. Such restriction often requires insurmountable justification and usually cannot be supported by the internal data. Thus, a possible remedial approach to alleviate the possible conservatism as a result of this requirement is a group-sequential design strategy that starts with a conservative sample size planning and then utilizes an alpha spending function to possibly reach the conclusion early.
A Decision Support System for Solving Multiple Criteria Optimization Problems
ERIC Educational Resources Information Center
Filatovas, Ernestas; Kurasova, Olga
2011-01-01
In this paper, multiple criteria optimization has been investigated. A new decision support system (DSS) has been developed for interactive solving of multiple criteria optimization problems (MOPs). The weighted-sum (WS) approach is implemented to solve the MOPs. The MOPs are solved by selecting different weight coefficient values for the criteria…
A Questioning Framework for Supporting Fraction Multiplication Understanding
ERIC Educational Resources Information Center
Johanning, Debra I.
2017-01-01
This research examined the role of the teacher in supporting students to make sense of fraction multiplication when using a problem solving approach. Using a qualitative approach, the teaching of four skillful experienced sixth-grade teachers was examined as they implemented a problem-based unit on fraction multiplication. This paper will present…
Students' Use of "Look Back" Strategies in Multiple Solution Methods
ERIC Educational Resources Information Center
Lee, Shin-Yi
2016-01-01
The purpose of this study was to investigate the relationship between both 9th-grade and 1st-year undergraduate students' use of "look back" strategies and problem solving performance in multiple solution methods, the difference in their use of look back strategies and problem solving performance in multiple solution methods, and the…
... muscular problems, such as multiple sclerosis, stroke, and cerebral palsy; motor neuron disorders such as polio, some forms ... muscular problems, such as multiple sclerosis, stroke, and cerebral palsy; motor neuron disorders such as polio, some forms ...
Colored Traveling Salesman Problem.
Li, Jun; Zhou, MengChu; Sun, Qirui; Dai, Xianzhong; Yu, Xiaolong
2015-11-01
The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set). However, it cannot represent some application problems where multiple traveling individuals not only have their own exclusive tasks but also share a group of tasks with each other. This work proposes a new MTSP called colored traveling salesman problem (CTSP) for handling such cases. Two types of city groups are defined, i.e., each group of exclusive cities of a single color for a salesman to visit and a group of shared cities of multiple colors allowing all salesmen to visit. Evidences show that CTSP is NP-hard and a multidepot MTSP and multiple single traveling salesman problems are its special cases. We present a genetic algorithm (GA) with dual-chromosome coding for CTSP and analyze the corresponding solution space. Then, GA is improved by incorporating greedy, hill-climbing (HC), and simulated annealing (SA) operations to achieve better performance. By experiments, the limitation of the exact solution method is revealed and the performance of the presented GAs is compared. The results suggest that SAGA can achieve the best quality of solutions and HCGA should be the choice making good tradeoff between the solution quality and computing time.
NASA Technical Reports Server (NTRS)
Tam, Christopher K. W.; Aganin, Alexei
2000-01-01
The transonic nozzle transmission problem and the open rotor noise radiation problem are solved computationally. Both are multiple length scales problems. For efficient and accurate numerical simulation, the multiple-size-mesh multiple-time-step Dispersion-Relation-Preserving scheme is used to calculate the time periodic solution. To ensure an accurate solution, high quality numerical boundary conditions are also needed. For the nozzle problem, a set of nonhomogeneous, outflow boundary conditions are required. The nonhomogeneous boundary conditions not only generate the incoming sound waves but also, at the same time, allow the reflected acoustic waves and entropy waves, if present, to exit the computation domain without reflection. For the open rotor problem, there is an apparent singularity at the axis of rotation. An analytic extension approach is developed to provide a high quality axis boundary treatment.
Thinking in Terms of Sensors: Personification of Self as an Object in Physics Problem Solving
ERIC Educational Resources Information Center
Tabor-Morris, A. E.
2015-01-01
How can physics teachers help students develop consistent problem solving techniques for both simple and complicated physics problems, such as those that encompass objects undergoing multiple forces (mechanical or electrical) as individually portrayed in free-body diagrams and/or phenomenon involving multiple objects, such as Doppler effect…
The Multiple Pendulum Problem via Maple[R
ERIC Educational Resources Information Center
Salisbury, K. L.; Knight, D. G.
2002-01-01
The way in which computer algebra systems, such as Maple, have made the study of physical problems of some considerable complexity accessible to mathematicians and scientists with modest computational skills is illustrated by solving the multiple pendulum problem. A solution is obtained for four pendulums with no restriction on the size of the…
Learning by Understanding: The Role of Multiple Representations in Learning Algebra.
ERIC Educational Resources Information Center
Brenner, Mary E.; Mayer, Richard E.; Moseley, Bryan; Brar, Theresa; Duran, Richard; Reed, Barbara Smith; Webb, David
1997-01-01
In posttest results, 76 prealgebra students who learned about functions in a unit emphasizing multiple formats, anchoring learning in a thematic context, and problem solving in cooperative groups were more successful at problem solving and problem representation than were 56 comparison students conventionally taught. Similar results were found for…
Visual Attention for Solving Multiple-Choice Science Problem: An Eye-Tracking Analysis
ERIC Educational Resources Information Center
Tsai, Meng-Jung; Hou, Huei-Tse; Lai, Meng-Lung; Liu, Wan-Yi; Yang, Fang-Ying
2012-01-01
This study employed an eye-tracking technique to examine students' visual attention when solving a multiple-choice science problem. Six university students participated in a problem-solving task to predict occurrences of landslide hazards from four images representing four combinations of four factors. Participants' responses and visual attention…
Crack problems for a rectangular plate and an infinite strip
NASA Technical Reports Server (NTRS)
Civelek, M. B.; Erdogan, F.
1980-01-01
The general plane problem for an infinite strip containing multiple cracks perpendicular to its boundaries is considered. The problem is reduced to a system of singular integral equations. Two specific problems of practical interest are then studied in detail. The first problem explores the interaction effect of multiple edge cracks in a plate or beam under tension or bending. The second problem is that of a rectangular plate containing an arbitrarily oriented crack in the plane of symmetry. Particular emphasis is placed on the problem of a plate containing an edge crack and subjected to concentrated forces.
A Multiple Period Problem in Distributed Energy Management Systems Considering CO2 Emissions
NASA Astrophysics Data System (ADS)
Muroda, Yuki; Miyamoto, Toshiyuki; Mori, Kazuyuki; Kitamura, Shoichi; Yamamoto, Takaya
Consider a special district (group) which is composed of multiple companies (agents), and where each agent responds to an energy demand and has a CO2 emission allowance imposed. A distributed energy management system (DEMS) optimizes energy consumption of a group through energy trading in the group. In this paper, we extended the energy distribution decision and optimal planning problem in DEMSs from a single period problem to a multiple periods one. The extension enabled us to consider more realistic constraints such as demand patterns, the start-up cost, and minimum running/outage times of equipment. At first, we extended the market-oriented programming (MOP) method for deciding energy distribution to the multiple periods problem. The bidding strategy of each agent is formulated by a 0-1 mixed non-linear programming problem. Secondly, we proposed decomposing the problem into a set of single period problems in order to solve it faster. In order to decompose the problem, we proposed a CO2 emission allowance distribution method, called an EP method. We confirmed that the proposed method was able to produce solutions whose group costs were close to lower-bound group costs by computational experiments. In addition, we verified that reduction in computational time was achieved without losing the quality of solutions by using the EP method.
ERIC Educational Resources Information Center
Nussbaum, Francis, Jr.
1988-01-01
Presents an algorithm for solving problems related to multiple allelic frequencies in populations at equilibrium. Considers sample problems and provides their solution using this tabular algorithm. (CW)
Fisher, Wayne W.; Greer, Brian D.; Fuhrman, Ashley M.; Querim, Angie C.
2016-01-01
Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects from one setting to the next and from one therapist to the next. With two children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. PMID:26384141
Campos, Claudia; Leon, Yanerys; Sleiman, Andressa; Urcuyo, Beatriz
2017-03-01
One potential limitation of functional communication training (FCT) is that after the functional communication response (FCR) is taught, the response may be emitted at high rates or inappropriate times. Thus, schedule thinning is often necessary. Previous research has demonstrated that multiple schedules can facilitate schedule thinning by establishing discriminative control of the communication response while maintaining low rates of problem behavior. To date, most applied research evaluating the clinical utility of multiple schedules has done so in the context of behavior maintained by positive reinforcement (e.g., attention or tangible items). This study examined the use of a multiple schedule with alternating Fixed Ratio (FR 1)/extinction (EXT) components for two individuals with developmental disabilities who emitted escape-maintained problem behavior. Although problem behavior remained low during all FCT and multiple schedule phases, the use of the multiple schedule alone did not result in discriminated manding.
Fisher, Wayne W; Greer, Brian D; Fuhrman, Ashley M; Querim, Angie C
2015-12-01
Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.
Exposure to child abuse and risk for mental health problems in women.
Schneider, Renee; Baumrind, Nikki; Kimerling, Rachel
2007-01-01
Risk for adult mental health problems associated with child sexual, physical, or emotional abuse and multiple types of child abuse was examined. Logistic regression analyses were used to test study hypotheses in a population-based sample of women (N = 3,936). As expected, child sexual, physical, and emotional abuse were independently associated with increased risk for mental health problems. History of multiple types of child abuse was also associated with elevated risk for mental health problems. In particular, exposure to all three types of child abuse was linked to a 23-fold increase in risk for probable posttraumatic stress disorder (PTSD). Findings underscore relations between child emotional abuse and adult mental health problems and highlight the need for mental health services for survivors of multiple types of child abuse.
An Approach to Economic Dispatch with Multiple Fuels Based on Particle Swarm Optimization
NASA Astrophysics Data System (ADS)
Sriyanyong, Pichet
2011-06-01
Particle Swarm Optimization (PSO), a stochastic optimization technique, shows superiority to other evolutionary computation techniques in terms of less computation time, easy implementation with high quality solution, stable convergence characteristic and independent from initialization. For this reason, this paper proposes the application of PSO to the Economic Dispatch (ED) problem, which occurs in the operational planning of power systems. In this study, ED problem can be categorized according to the different characteristics of its cost function that are ED problem with smooth cost function and ED problem with multiple fuels. Taking the multiple fuels into account will make the problem more realistic. The experimental results show that the proposed PSO algorithm is more efficient than previous approaches under consideration as well as highly promising in real world applications.
ERIC Educational Resources Information Center
Miller, Bridget; Taber-Doughty, Teresa
2014-01-01
Three students with mild to moderate intellectual and multiple disability, enrolled in a self-contained functional curriculum class were taught to use a self-monitoring checklist and science notebook to increase independence in inquiry problem-solving skills. Using a single-subject multiple-probe design, all students acquired inquiry…
ERIC Educational Resources Information Center
Racz, Sarah Jensen; McMahon, Robert J.; Luthar, Suniya S.
2011-01-01
Children of affluent parents are often excluded in psychological research as they are considered to be at "low risk"; however, research is beginning to suggest that this previously under-studied population may be at risk for developing multiple problem behaviors, including substance use and externalizing problems. The current study aimed to extend…
Children's Understanding of the Inverse Relation between Multiplication and Division
ERIC Educational Resources Information Center
Robinson, Katherine M.; Dube, Adam K.
2009-01-01
Children's understanding of the inversion concept in multiplication and division problems (i.e., that on problems of the form "d multiplied by e/e" no calculations are required) was investigated. Children in Grades 6, 7, and 8 completed an inversion problem-solving task, an assessment of procedures task, and a factual knowledge task of simple…
ERIC Educational Resources Information Center
Sole, Marla A.
2016-01-01
Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…
Zhao, Jing; Zong, Haili
2018-01-01
In this paper, we propose parallel and cyclic iterative algorithms for solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators. We also combine the process of cyclic and parallel iterative methods and propose two mixed iterative algorithms. Our several algorithms do not need any prior information about the operator norms. Under mild assumptions, we prove weak convergence of the proposed iterative sequences in Hilbert spaces. As applications, we obtain several iterative algorithms to solve the multiple-set split equality problem.
General Methodology for Designing Spacecraft Trajectories
NASA Technical Reports Server (NTRS)
Condon, Gerald; Ocampo, Cesar; Mathur, Ravishankar; Morcos, Fady; Senent, Juan; Williams, Jacob; Davis, Elizabeth C.
2012-01-01
A methodology for designing spacecraft trajectories in any gravitational environment within the solar system has been developed. The methodology facilitates modeling and optimization for problems ranging from that of a single spacecraft orbiting a single celestial body to that of a mission involving multiple spacecraft and multiple propulsion systems operating in gravitational fields of multiple celestial bodies. The methodology consolidates almost all spacecraft trajectory design and optimization problems into a single conceptual framework requiring solution of either a system of nonlinear equations or a parameter-optimization problem with equality and/or inequality constraints.
Rapid optimization of multiple-burn rocket flights.
NASA Technical Reports Server (NTRS)
Brown, K. R.; Harrold, E. F.; Johnson, G. W.
1972-01-01
Different formulations of the fuel optimization problem for multiple burn trajectories are considered. It is shown that certain customary idealizing assumptions lead to an ill-posed optimization problem for which no solution exists. Several ways are discussed for avoiding such difficulties by more realistic problem statements. An iterative solution of the boundary value problem is presented together with efficient coast arc computations, the right end conditions for various orbital missions, and some test results.
Using a derivative-free optimization method for multiple solutions of inverse transport problems
Armstrong, Jerawan C.; Favorite, Jeffrey A.
2016-01-14
Identifying unknown components of an object that emits radiation is an important problem for national and global security. Radiation signatures measured from an object of interest can be used to infer object parameter values that are not known. This problem is called an inverse transport problem. An inverse transport problem may have multiple solutions and the most widely used approach for its solution is an iterative optimization method. This paper proposes a stochastic derivative-free global optimization algorithm to find multiple solutions of inverse transport problems. The algorithm is an extension of a multilevel single linkage (MLSL) method where a meshmore » adaptive direct search (MADS) algorithm is incorporated into the local phase. Furthermore, numerical test cases using uncollided fluxes of discrete gamma-ray lines are presented to show the performance of this new algorithm.« less
Gambling involvement and increased risk of gambling problems.
Phillips, James G; Ogeil, Rowan; Chow, Yang-Wai; Blaszczynski, Alex
2013-12-01
The opportunity to gamble has undergone rapid expansion with technology allowing for access to gambling products 24 h a day. This increased online availability challenges governments' abilities to restrict access to gambling. Indeed, the ready access to multiple forms of gambling may potentially contribute to impaired control over urges for problem gamblers. The present study considered whether problem gamblers manifested a tendency to engage in multiple forms of gambling and identified forms of gambling which were more strongly related to problem gambling. In reanalyses of two surveys (Sample 1, N = 464, Sample 2, N = 1141), significant relationships accounting for between 11.3 and 13.5% of the variance were found between the numbers of forms of gambling accessed and degree of problem. Participation in online poker, playing cards and sports wagering were linked to problem gambling. Access to multiple forms of gambling may pose difficulties for the tracking and control of gambling.
... problem. What Should I Eat if I'm Pregnant With Multiples? If you're pregnant with multiples, ... Much Weight Should I Gain if I'm Pregnant With Multiples? Mothers carrying multiples are expected to ...
Step by Step: Biology Undergraduates’ Problem-Solving Procedures during Multiple-Choice Assessment
Prevost, Luanna B.; Lemons, Paula P.
2016-01-01
This study uses the theoretical framework of domain-specific problem solving to explore the procedures students use to solve multiple-choice problems about biology concepts. We designed several multiple-choice problems and administered them on four exams. We trained students to produce written descriptions of how they solved the problem, and this allowed us to systematically investigate their problem-solving procedures. We identified a range of procedures and organized them as domain general, domain specific, or hybrid. We also identified domain-general and domain-specific errors made by students during problem solving. We found that students use domain-general and hybrid procedures more frequently when solving lower-order problems than higher-order problems, while they use domain-specific procedures more frequently when solving higher-order problems. Additionally, the more domain-specific procedures students used, the higher the likelihood that they would answer the problem correctly, up to five procedures. However, if students used just one domain-general procedure, they were as likely to answer the problem correctly as if they had used two to five domain-general procedures. Our findings provide a categorization scheme and framework for additional research on biology problem solving and suggest several important implications for researchers and instructors. PMID:27909021
Multiple shooting algorithms for jump-discontinuous problems in optimal control and estimation
NASA Technical Reports Server (NTRS)
Mook, D. J.; Lew, Jiann-Shiun
1991-01-01
Multiple shooting algorithms are developed for jump-discontinuous two-point boundary value problems arising in optimal control and optimal estimation. Examples illustrating the origin of such problems are given to motivate the development of the solution algorithms. The algorithms convert the necessary conditions, consisting of differential equations and transversality conditions, into algebraic equations. The solution of the algebraic equations provides exact solutions for linear problems. The existence and uniqueness of the solution are proved.
What Students Choose to Do and Have to Say about Use of Multiple Representations in College Algebra
ERIC Educational Resources Information Center
Herman, Marlena
2007-01-01
This report summarizes findings on strategies chosen by students (n=38) when solving algebra problems related to various functions with the freedom to use a TI-83 graphing calculator, influences on student problem-solving strategy choices, student ability to approach algebra problems with use of multiple representations, and student beliefs on how…
ERIC Educational Resources Information Center
Ngu, Bing Hiong; Yeung, Alexander Seeshing
2012-01-01
Holyoak and Koh (1987) and Holyoak (1984) propose four critical tasks for analogical transfer to occur in problem solving. A study was conducted to test this hypothesis by comparing a multiple components (MC) approach against worked examples (WE) in helping students to solve algebra word problems in chemistry classes. The MC approach incorporated…
NASA Technical Reports Server (NTRS)
Giesy, D. P.
1978-01-01
A technique is presented for the calculation of Pareto-optimal solutions to a multiple-objective constrained optimization problem by solving a series of single-objective problems. Threshold-of-acceptability constraints are placed on the objective functions at each stage to both limit the area of search and to mathematically guarantee convergence to a Pareto optimum.
ERIC Educational Resources Information Center
van der Heide, D. C.; van der Putten, A. A. J.; van den Berg, P. B.; Taxis, K.; Vlaskamp, C.
2009-01-01
Background: Persons with profound intellectual and multiple disabilities (PIMD) suffer from a wide range of health problems and use a wide range of different drugs. This study investigated for frequently used medication whether there was a health problem documented in the medical notes for the drug prescribed. Method: Persons with PIMD with an…
van der Put, Claudia E; Lanctôt, Nadine; de Ruiter, Corine; van Vugt, Eveline
2015-08-01
This study examined differences in offending behavior and psychosocial problems between juvenile offenders who have been sexually abused (n=231), physically abused (n=1,568), neglected (n=1,555), exposed to multiple forms of maltreatment (n=1,767), and non-victims (n=8,492). In addition, the moderating effect of gender in the association between type of maltreatment and offending behavior/psychosocial problems was examined. Results showed that violent offenses were more common in victims of physical abuse and victims of multiple forms of abuse than in non-victims, both in boys and girls. In boys, sexual offenses were far more common in victims of sexual abuse than in victims of other or multiple forms of maltreatment or in non-victims. In girls, no group differences were found in sexual offending behavior. For both boys and girls, externalizing problems were relatively common in victims of physical abuse and neglect whereas internalizing problems were relatively common in victims of sexual abuse. In victims of multiple forms of maltreatment, both internalizing and externalizing problems were relatively common. Implications for clinical practice are discussed. Copyright © 2015 Elsevier Ltd. All rights reserved.
SYSTEMATIC PROCEDURE FOR DESIGNING PROCESSES WITH MULTIPLE ENVIRONMENTAL OBJECTIVES
Evaluation of multiple objectives is very important in designing environmentally benign processes. It requires a systematic procedure for solving multiobjective decision-making problems, due to the complex nature of the problems, the need for complex assessments, and complicated ...
Extended H2 synthesis for multiple degree-of-freedom controllers
NASA Technical Reports Server (NTRS)
Hampton, R. David; Knospe, Carl R.
1992-01-01
H2 synthesis techniques are developed for a general multiple-input-multiple-output (MIMO) system subject to both stochastic and deterministic disturbances. The H2 synthesis is extended by incorporation of anticipated disturbances power-spectral-density information into the controller-design process, as well as by frequency weightings of generalized coordinates and control inputs. The methodology is applied to a simple single-input-multiple-output (SIMO) problem, analogous to the type of vibration isolation problem anticipated in microgravity research experiments.
Choi, Sun Hee; Park, Young Sil; Shim, Kye Shik; Choi, Yong Sung; Chang, Ji Young; Hahn, Won Ho; Bae, Chong-Woo
2010-08-01
The aim of this study was to survey multiple birth data and to analyze the recent trends of multiple births and its consequences on perinatal problems in Korea from 1991 to 2008. Data were obtained from the Korean Statistical Information Service. The total number of multiple births showed increasing trends. The multiple birth rate was maintained within less than 10.0 for the decade from 1981 to 1990. However, it increased gradually to reach 27.5 in 2008. The maternal age for multiple births was higher than for total live births. The mean birth weight of the total live births was 3.23 kg; for the multiple births it was 2.40 kg in 2008. The incidence of low birth weight infants (LBWI) among total live births was 3.8% in 2000 and 4.9% in 2008. For multiple births it was 49.2% and 53.0% during the same years. The incidence of preterm births among total live births was 3.8% in 2000 and 5.5% in 2008; for the multiple births it was 38.3% and 51.5% during the same years. The incidence of multiple births and its consequences on perinatal problems (preterm, LBWI, and advanced-maternal age) have been increased steadily over the last two decades in Korea.
ERIC Educational Resources Information Center
O'Brien, Aileen; Cabral, Sheryl Ann
This is a project in an emerging line of research investigating children's informed knowledge of mathematics questions. The purpose of this study was to analyze the ability of students who had not received multiplication or division instruction to solve multiplication and division word problems. The study consisted of videotaped interviews with 89…
On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity
NASA Astrophysics Data System (ADS)
Hanum, F.; Hartono, A. P.; Bakhtiar, T.
2018-03-01
This current manuscript concerns with the optimization problem arising in a route determination of products distribution. The problem is formulated in the form of multiple depots and time windowed vehicle routing problem with heterogeneous capacity and velocity of fleet. Model includes a number of constraints such as route continuity, multiple depots availability and serving time in addition to generic constraints. In dealing with the unique feature of heterogeneous velocity, we generate a number of velocity profiles along the road segments, which then converted into traveling-time tables. An illustrative example of rice distribution among villages by bureau of logistics is provided. Exact approach is utilized to determine the optimal solution in term of vehicle routes and starting time of service.
Solution of a cauchy problem for a diffusion equation in a Hilbert space by a Feynman formula
NASA Astrophysics Data System (ADS)
Remizov, I. D.
2012-07-01
The Cauchy problem for a class of diffusion equations in a Hilbert space is studied. It is proved that the Cauchy problem in well posed in the class of uniform limits of infinitely smooth bounded cylindrical functions on the Hilbert space, and the solution is presented in the form of the so-called Feynman formula, i.e., a limit of multiple integrals against a gaussian measure as the multiplicity tends to infinity. It is also proved that the solution of the Cauchy problem depends continuously on the diffusion coefficient. A process reducing an approximate solution of an infinite-dimensional diffusion equation to finding a multiple integral of a real function of finitely many real variables is indicated.
Data matching for free-surface multiple attenuation by multidimensional deconvolution
NASA Astrophysics Data System (ADS)
van der Neut, Joost; Frijlink, Martijn; van Borselen, Roald
2012-09-01
A common strategy for surface-related multiple elimination of seismic data is to predict multiples by a convolutional model and subtract these adaptively from the input gathers. Problems can be posed by interfering multiples and primaries. Removing multiples by multidimensional deconvolution (MDD) (inversion) does not suffer from these problems. However, this approach requires data to be consistent, which is often not the case, especially not at interpolated near-offsets. A novel method is proposed to improve data consistency prior to inversion. This is done by backpropagating first-order multiples with a time-gated reference primary event and matching these with early primaries in the input gather. After data matching, multiple elimination by MDD can be applied with a deterministic inversion scheme.
Identifying multiple influential spreaders based on generalized closeness centrality
NASA Astrophysics Data System (ADS)
Liu, Huan-Li; Ma, Chuang; Xiang, Bing-Bing; Tang, Ming; Zhang, Hai-Feng
2018-02-01
To maximize the spreading influence of multiple spreaders in complex networks, one important fact cannot be ignored: the multiple spreaders should be dispersively distributed in networks, which can effectively reduce the redundance of information spreading. For this purpose, we define a generalized closeness centrality (GCC) index by generalizing the closeness centrality index to a set of nodes. The problem converts to how to identify multiple spreaders such that an objective function has the minimal value. By comparing with the K-means clustering algorithm, we find that the optimization problem is very similar to the problem of minimizing the objective function in the K-means method. Therefore, how to find multiple nodes with the highest GCC value can be approximately solved by the K-means method. Two typical transmission dynamics-epidemic spreading process and rumor spreading process are implemented in real networks to verify the good performance of our proposed method.
The Research of Multiple Attenuation Based on Feedback Iteration and Independent Component Analysis
NASA Astrophysics Data System (ADS)
Xu, X.; Tong, S.; Wang, L.
2017-12-01
How to solve the problem of multiple suppression is a difficult problem in seismic data processing. The traditional technology for multiple attenuation is based on the principle of the minimum output energy of the seismic signal, this criterion is based on the second order statistics, and it can't achieve the multiple attenuation when the primaries and multiples are non-orthogonal. In order to solve the above problems, we combine the feedback iteration method based on the wave equation and the improved independent component analysis (ICA) based on high order statistics to suppress the multiple waves. We first use iterative feedback method to predict the free surface multiples of each order. Then, in order to predict multiples from real multiple in amplitude and phase, we design an expanded pseudo multi-channel matching filtering method to get a more accurate matching multiple result. Finally, we present the improved fast ICA algorithm which is based on the maximum non-Gauss criterion of output signal to the matching multiples and get better separation results of the primaries and the multiples. The advantage of our method is that we don't need any priori information to the prediction of the multiples, and can have a better separation result. The method has been applied to several synthetic data generated by finite-difference model technique and the Sigsbee2B model multiple data, the primaries and multiples are non-orthogonal in these models. The experiments show that after three to four iterations, we can get the perfect multiple results. Using our matching method and Fast ICA adaptive multiple subtraction, we can not only effectively preserve the effective wave energy in seismic records, but also can effectively suppress the free surface multiples, especially the multiples related to the middle and deep areas.
He, Dan; Kuhn, David; Parida, Laxmi
2016-06-15
Given a set of biallelic molecular markers, such as SNPs, with genotype values encoded numerically on a collection of plant, animal or human samples, the goal of genetic trait prediction is to predict the quantitative trait values by simultaneously modeling all marker effects. Genetic trait prediction is usually represented as linear regression models. In many cases, for the same set of samples and markers, multiple traits are observed. Some of these traits might be correlated with each other. Therefore, modeling all the multiple traits together may improve the prediction accuracy. In this work, we view the multitrait prediction problem from a machine learning angle: as either a multitask learning problem or a multiple output regression problem, depending on whether different traits share the same genotype matrix or not. We then adapted multitask learning algorithms and multiple output regression algorithms to solve the multitrait prediction problem. We proposed a few strategies to improve the least square error of the prediction from these algorithms. Our experiments show that modeling multiple traits together could improve the prediction accuracy for correlated traits. The programs we used are either public or directly from the referred authors, such as MALSAR (http://www.public.asu.edu/~jye02/Software/MALSAR/) package. The Avocado data set has not been published yet and is available upon request. dhe@us.ibm.com. © The Author 2016. Published by Oxford University Press.
A SYSTEMATIC PROCEDURE FOR DESIGNING PROCESSES WITH MULTIPLE ENVIRONMENTAL OBJECTIVES
Evaluation and analysis of multiple objectives are very important in designing environmentally benign processes. They require a systematic procedure for solving multi-objective decision-making problems due to the complex nature of the problems and the need for complex assessment....
NASA Astrophysics Data System (ADS)
Alami, Y.; Sinaga, P.; Setiawan, A.
2018-05-01
Based on recommendations from the Physics Education literature recommend the use of multiple representations to help students solve problems. The use of some good representations is considered important to study physics, so many good motivations to learn how students use multiple representations while solving problems and to learn how to solve problems using multiple representations. This study aims to explore the profile of high school students’ problem solving abilities and this study is part of a larger research focus on improving this ability in students in physics. The data is needed to determine the appropriate treatment to be used in subsequent research. A purposive sampling technique was used in this study and a survey was conducted to collect data. 74 students from one high school in Bandung were involved in this research.
Coderre, Sylvain P; Harasym, Peter; Mandin, Henry; Fick, Gordon
2004-11-05
Pencil-and-paper examination formats, and specifically the standard, five-option multiple-choice question, have often been questioned as a means for assessing higher-order clinical reasoning or problem solving. This study firstly investigated whether two paper formats with differing number of alternatives (standard five-option and extended-matching questions) can test problem-solving abilities. Secondly, the impact of the alternatives number on psychometrics and problem-solving strategies was examined. Think-aloud protocols were collected to determine the problem-solving strategy used by experts and non-experts in answering Gastroenterology questions, across the two pencil-and-paper formats. The two formats demonstrated equal ability in testing problem-solving abilities, while the number of alternatives did not significantly impact psychometrics or problem-solving strategies utilized. These results support the notion that well-constructed multiple-choice questions can in fact test higher order clinical reasoning. Furthermore, it can be concluded that in testing clinical reasoning, the question stem, or content, remains more important than the number of alternatives.
Multiple Imputation for Multivariate Missing-Data Problems: A Data Analyst's Perspective.
ERIC Educational Resources Information Center
Schafer, Joseph L.; Olsen, Maren K.
1998-01-01
The key ideas of multiple imputation for multivariate missing data problems are reviewed. Software programs available for this analysis are described, and their use is illustrated with data from the Adolescent Alcohol Prevention Trial (W. Hansen and J. Graham, 1991). (SLD)
Improving Predictions of Multiple Binary Models in ILP
2014-01-01
Despite the success of ILP systems in learning first-order rules from small number of examples and complexly structured data in various domains, they struggle in dealing with multiclass problems. In most cases they boil down a multiclass problem into multiple black-box binary problems following the one-versus-one or one-versus-rest binarisation techniques and learn a theory for each one. When evaluating the learned theories of multiple class problems in one-versus-rest paradigm particularly, there is a bias caused by the default rule toward the negative classes leading to an unrealistic high performance beside the lack of prediction integrity between the theories. Here we discuss the problem of using one-versus-rest binarisation technique when it comes to evaluating multiclass data and propose several methods to remedy this problem. We also illustrate the methods and highlight their link to binary tree and Formal Concept Analysis (FCA). Our methods allow learning of a simple, consistent, and reliable multiclass theory by combining the rules of the multiple one-versus-rest theories into one rule list or rule set theory. Empirical evaluation over a number of data sets shows that our proposed methods produce coherent and accurate rule models from the rules learned by the ILP system of Aleph. PMID:24696657
Multiple-solution problems in a statistics classroom: an example
NASA Astrophysics Data System (ADS)
Chu, Chi Wing; Chan, Kevin L. T.; Chan, Wai-Sum; Kwong, Koon-Shing
2017-11-01
The mathematics education literature shows that encouraging students to develop multiple solutions for given problems has a positive effect on students' understanding and creativity. In this paper, we present an example of multiple-solution problems in statistics involving a set of non-traditional dice. In particular, we consider the exact probability mass distribution for the sum of face values. Four different ways of solving the problem are discussed. The solutions span various basic concepts in different mathematical disciplines (sample space in probability theory, the probability generating function in statistics, integer partition in basic combinatorics and individual risk model in actuarial science) and thus promotes upper undergraduate students' awareness of knowledge connections between their courses. All solutions of the example are implemented using the R statistical software package.
Multiplicative noise removal via a learned dictionary.
Huang, Yu-Mei; Moisan, Lionel; Ng, Michael K; Zeng, Tieyong
2012-11-01
Multiplicative noise removal is a challenging image processing problem, and most existing methods are based on the maximum a posteriori formulation and the logarithmic transformation of multiplicative denoising problems into additive denoising problems. Sparse representations of images have shown to be efficient approaches for image recovery. Following this idea, in this paper, we propose to learn a dictionary from the logarithmic transformed image, and then to use it in a variational model built for noise removal. Extensive experimental results suggest that in terms of visual quality, peak signal-to-noise ratio, and mean absolute deviation error, the proposed algorithm outperforms state-of-the-art methods.
Application of decentralized cooperative problem solving in dynamic flexible scheduling
NASA Astrophysics Data System (ADS)
Guan, Zai-Lin; Lei, Ming; Wu, Bo; Wu, Ya; Yang, Shuzi
1995-08-01
The object of this study is to discuss an intelligent solution to the problem of task-allocation in shop floor scheduling. For this purpose, the technique of distributed artificial intelligence (DAI) is applied. Intelligent agents (IAs) are used to realize decentralized cooperation, and negotiation is realized by using message passing based on the contract net model. Multiple agents, such as manager agents, workcell agents, and workstation agents, make game-like decisions based on multiple criteria evaluations. This procedure of decentralized cooperative problem solving makes local scheduling possible. And by integrating such multiple local schedules, dynamic flexible scheduling for the whole shop floor production can be realized.
Breathing Problems - Multiple Languages
... List of All Topics All Breathing Problems - Multiple Languages To use the sharing features on this page, please enable JavaScript. Arabic (العربية) ... Bethesda, MD 20894 U.S. Department of Health and Human Services National Institutes of Health Page last updated on 2 May 2018
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
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.
Considerations for multiple hypothesis correlation on tactical platforms
NASA Astrophysics Data System (ADS)
Thomas, Alan M.; Turpen, James E.
2013-05-01
Tactical platforms benefit greatly from the fusion of tracks from multiple sources in terms of increased situation awareness. As a necessary precursor to this track fusion, track-to-track association, or correlation, must first be performed. The related measurement-to-track fusion problem has been well studied with multiple hypothesis tracking and multiple frame assignment methods showing the most success. The track-to-track problem differs from this one in that measurements themselves are not available but rather track state update reports from the measuring sensors. Multiple hypothesis, multiple frame correlation systems have previously been considered; however, their practical implementation under the constraints imposed by tactical platforms is daunting. The situation is further exacerbated by the inconvenient nature of reports from legacy sensor systems on bandwidth- limited communications networks. In this paper, consideration is given to the special difficulties encountered when attempting the correlation of tracks from legacy sensors on tactical aircraft. Those difficulties include the following: covariance information from reporting sensors is frequently absent or incomplete; system latencies can create temporal uncertainty in data; and computational processing is severely limited by hardware and architecture. Moreover, consideration is given to practical solutions for dealing with these problems in a multiple hypothesis correlator.
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.
Kahle, L R; Kulka, R A; Klingel, D M
1980-09-01
This article reports the results of a study that annually monitored the self-esteem and interpersonal problems of over 100 boys during their sophomore, junior, and senior years of high school. Cross-lagged panel correlation differences show that low self-esteem leads to interpersonal problems in all three time lags when multiple interpersonal problems constitute the dependent variable but not when single interpersonal problem criteria constitute the dependent variable. These results are interpreted as supporting social-adaptation theory rather than self-perception theory. Implications for the conceptual status of personality variables as causal antecedents and for the assessment of individual differences are discussed.
The Challenge of Educational Technology for Students with Multiple Impairments in the Classroom.
ERIC Educational Resources Information Center
Molloy, Paul; Baskin, Barbara
1995-01-01
Discussion of assistive technologies that help students with multiple impairments focuses on procedures and equipment used by a college student with Usher's Syndrome, involving vision and hearing impairments. Highlights include federal legislation; problems and possible solutions at various educational levels; specific learning problems; and…
Analysis of Multiple Manding Topographies during Functional Communication Training
ERIC Educational Resources Information Center
Harding, Jay W.; Wacker, David P.; Berg, Wendy K.; Winborn-Kemmerer, Lisa; Lee, John F.; Ibrahimovic, Muska
2009-01-01
We evaluated the effects of reinforcing multiple manding topographies during functional communication training (FCT) to decrease problem behavior for three preschool-age children. During Phase 1, a functional analysis identified conditions that maintained problem behavior for each child. During Phase 2, the children's parents taught them to…
ERIC Educational Resources Information Center
Keebaugh, Alaine; Darrow, Lyndsey; Tan, David; Jamerson, Heather
2009-01-01
Previous research has highlighted the effectiveness of Problem-Based Learning (PBL) in multiple disciplinary settings, including medicine, teacher education, business, allied health, and the social sciences. Yet interdisciplinary educators have very little information about how to implement PBL in classrooms where multiple disciplines are…
NASA Astrophysics Data System (ADS)
Ullah Manzoor, Habib; Manzoor, Tareq; Hussain, Masroor; Manzoor, Sanaullah; Nazar, Kashif
2018-04-01
Surface electromagnetic waves are the solution of Maxwell’s frequency domain equations at the interface of two dissimilar materials. In this article, two canonical boundary-value problems have been formulated to analyze the multiplicity of electromagnetic surface waves at the interface between two dissimilar materials in the visible region of light. In the first problem, the interface between two semi-infinite rugate filters having symmetric refractive index profiles is considered and in the second problem, to enhance the multiplicity of surface electromagnetic waves, a homogeneous dielectric slab of 400 nm is included between two semi-infinite symmetric rugate filters. Numerical results show that multiple Bloch surface waves of different phase speeds, different polarization states, different degrees of localization and different field profiles are propagated at the interface between two semi-infinite rugate filters. Having two interfaces when a homogeneous dielectric layer is placed between two semi-infinite rugate filters has increased the multiplicity of electromagnetic surface waves.
Tracking Multiple People Online and in Real Time
2015-12-21
NO. 0704-0188 3. DATES COVERED (From - To) - UU UU UU UU 21-12-2015 Approved for public release; distribution is unlimited. Tracking multiple people ...online and in real time We cast the problem of tracking several people as a graph partitioning problem that takes the form of an NP-hard binary...PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. Duke University 2200 West Main Street Suite 710 Durham, NC 27705 -4010 ABSTRACT Tracking multiple
A Two-Dimensional Helmholtz Equation Solution for the Multiple Cavity Scattering Problem
2013-02-01
obtained by using the block Gauss – Seidel iterative meth- od. To show the convergence of the iterative method, we define the error between two...models to the general multiple cavity setting. Numerical examples indicate that the convergence of the Gauss – Seidel iterative method depends on the...variational approach. A block Gauss – Seidel iterative method is introduced to solve the cou- pled system of the multiple cavity scattering problem, where
NASA Astrophysics Data System (ADS)
Saad, Shakila; Wan Jaafar, Wan Nurhadani; Jamil, Siti Jasmida
2013-04-01
The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented.
Child abuse, drug addiction and mental health problems of incarcerated women in Israel.
Chen, Gila; Gueta, Keren
2015-01-01
The mental health problems and pathways to drug addiction and crime among female inmates have long been of interest to researchers and practitioners. The purpose of the current study was to examine the possible association between multiple types of childhood abuse, mental health problems, and drug addiction and the incarceration of 50 Israeli women in prison. The findings indicated that female inmates come from risky families with a high prevalence of family mental health problems, parental drug addiction and crime, and sibling drug addiction and crime. Furthermore, they revealed that incarcerated women from risky families were victims of multiple types of childhood abuse and neglect by their parents, as well as their siblings. Overall, the results suggest that the adverse consequences of a family's mental health problems are much more dramatic than we assumed to date, and that women are more likely than men to be the victims of multiple types of childhood abuse and neglect, as well as suffering more severe psychiatric problems, depression, and drug addiction. The implications of these findings are discussed. Copyright © 2015 Elsevier Ltd. All rights reserved.
... as Parkinson's disease Diseases such as arthritis or multiple sclerosis Vision or balance problems Treatment of walking problems depends on the cause. Physical therapy, surgery, or mobility aids may help.
Resolvent-Techniques for Multiple Exercise Problems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Christensen, Sören, E-mail: christensen@math.uni-kiel.de; Lempa, Jukka, E-mail: jukka.lempa@hioa.no
2015-02-15
We study optimal multiple stopping of strong Markov processes with random refraction periods. The refraction periods are assumed to be exponentially distributed with a common rate and independent of the underlying dynamics. Our main tool is using the resolvent operator. In the first part, we reduce infinite stopping problems to ordinary ones in a general strong Markov setting. This leads to explicit solutions for wide classes of such problems. Starting from this result, we analyze problems with finitely many exercise rights and explain solution methods for some classes of problems with underlying Lévy and diffusion processes, where the optimal characteristicsmore » of the problems can be identified more explicitly. We illustrate the main results with explicit examples.« less
Association of TV watching with sleep problems in a church-going population.
Serrano, Salim; Lee, Jerry W; Dehom, Salem; Tonstad, Serena
2014-01-01
Sensory stimuli/inactivity may affect sleep. Sleep problems are associated with multiple health problems. We assessed TV habits in the Adventist Health Study-2 at baseline and sleep problems in the Biopsychosocial Religion and Health Study 1 to 4 years later. After exclusions, 3914 subjects split equally into TV watchers less than 2 hours per day or 2 or more hours per day. Watching TV 2 or more hours per day predicted problems falling asleep, middle of the night awakening, and waking early with inability to sleep again in multiple logistic regression. Excess TV watching disturbed sleep induction and quality, though the relationship may be bidirectional. TV habits should be considered in individuals with sleep problems.
Evidence-Based Assessment of Conduct Problems in Children and Adolescents
ERIC Educational Resources Information Center
McMahon, Robert J.; Frick, Paul J.
2005-01-01
This article provides a summary of research in 4 areas that have direct and important implications for evidence-based assessment of children and adolescents with conduct problems (CP): (a) the heterogeneity in types and severity of CP, (b) common comorbid conditions, (c) multiple risk factors associated with CP, and (d) multiple developmental…
Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem.
Zhao, Ying; Shi, Luoyi
2017-01-01
This paper introduces a new extragradient-type method to solve the multiple-sets split equality problem (MSSEP). Under some suitable conditions, the strong convergence of an algorithm can be verified in the infinite-dimensional Hilbert spaces. Moreover, several numerical results are given to show the effectiveness of our algorithm.
ERIC Educational Resources Information Center
Alimovic, S.
2013-01-01
Background: Children with multiple impairments have more complex developmental problems than children with a single impairment. Method: We compared children, aged 4 to 11 years, with intellectual disability (ID) and visual impairment to children with single ID, single visual impairment and typical development on "Child Behavior Check…
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…
ERIC Educational Resources Information Center
Mrug, Sylvie; Windle, Michael
2010-01-01
Background: Violence exposure within each setting of community, school, or home has been linked with internalizing and externalizing problems. Although many children experience violence in multiple contexts, the effects of such cross-contextual exposure have not been studied. This study addresses this gap by examining independent and interactive…
The Use of Procedural Knowledge in Simple Addition and Subtraction Problems
ERIC Educational Resources Information Center
Fayol, Michel; Thevenot, Catherine
2012-01-01
In a first experiment, adults were asked to solve one-digit additions, subtractions and multiplications. When the sign appeared 150 ms before the operands, addition and subtraction were solved faster than when the sign and the operands appeared simultaneously on screen. This priming effect was not observed for multiplication problems. A second…
Effects of Prompting Multiple Solutions for Modelling Problems on Students' Performance
ERIC Educational Resources Information Center
Schukajlow, Stanislaw; Krug, André; Rakoczy, Katrin
2015-01-01
Prompting students to construct multiple solutions for modelling problems with vague conditions has been found to be an effective way to improve students' performance on interest-oriented measures. In the current study, we investigated the influence of this teaching element on students' performance. To assess the impact of prompting multiple…
Prevalence of Multiply Controlled Problem Behavior
ERIC Educational Resources Information Center
Beavers, Gracie A.; Iwata, Brian A.
2011-01-01
We examined articles in the "Journal of Applied Behavior Analysis" in which results of functional analyses indicated that problem behavior was maintained by multiple sources of reinforcement. Data for 88 (16.9%) of 521 subjects reported in 168 studies met the criteria for multiple control. Data for 11 subjects (2.1%) involved a single response…
Phunchongharn, Phond; Hossain, Ekram; Camorlinga, Sergio
2011-11-01
We study the multiple access problem for e-Health applications (referred to as secondary users) coexisting with medical devices (referred to as primary or protected users) in a hospital environment. In particular, we focus on transmission scheduling and power control of secondary users in multiple spatial reuse time-division multiple access (STDMA) networks. The objective is to maximize the spectrum utilization of secondary users and minimize their power consumption subject to the electromagnetic interference (EMI) constraints for active and passive medical devices and minimum throughput guarantee for secondary users. The multiple access problem is formulated as a dual objective optimization problem which is shown to be NP-complete. We propose a joint scheduling and power control algorithm based on a greedy approach to solve the problem with much lower computational complexity. To this end, an enhanced greedy algorithm is proposed to improve the performance of the greedy algorithm by finding the optimal sequence of secondary users for scheduling. Using extensive simulations, the tradeoff in performance in terms of spectrum utilization, energy consumption, and computational complexity is evaluated for both the algorithms.
Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
NASA Astrophysics Data System (ADS)
Shen, Kaiming; Yu, Wei
2018-05-01
This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic transform technique for tackling the multiple-ratio concave-convex FP problem--in contrast to conventional FP techniques that mostly can only deal with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are important for the optimization of communication networks, because system-level design often involves multiple signal-to-interference-plus-noise ratio terms. This paper considers the applications of FP to solving continuous problems in communication system design, particularly for power control, beamforming, and energy efficiency maximization. These application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems. This FP-based problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point. The paper further demonstrates close connections between the proposed FP approach and other well-known algorithms in the literature, such as the fixed-point iteration and the weighted minimum mean-square-error beamforming. The optimization of discrete problems is discussed in Part II of this paper.
Step by Step: Biology Undergraduates' Problem-Solving Procedures during Multiple-Choice Assessment.
Prevost, Luanna B; Lemons, Paula P
2016-01-01
This study uses the theoretical framework of domain-specific problem solving to explore the procedures students use to solve multiple-choice problems about biology concepts. We designed several multiple-choice problems and administered them on four exams. We trained students to produce written descriptions of how they solved the problem, and this allowed us to systematically investigate their problem-solving procedures. We identified a range of procedures and organized them as domain general, domain specific, or hybrid. We also identified domain-general and domain-specific errors made by students during problem solving. We found that students use domain-general and hybrid procedures more frequently when solving lower-order problems than higher-order problems, while they use domain-specific procedures more frequently when solving higher-order problems. Additionally, the more domain-specific procedures students used, the higher the likelihood that they would answer the problem correctly, up to five procedures. However, if students used just one domain-general procedure, they were as likely to answer the problem correctly as if they had used two to five domain-general procedures. Our findings provide a categorization scheme and framework for additional research on biology problem solving and suggest several important implications for researchers and instructors. © 2016 L. B. Prevost and P. P. Lemons. CBE—Life Sciences Education © 2016 The American Society for Cell Biology. This article is distributed by The American Society for Cell Biology under license from the author(s). It is available to the public under an Attribution–Noncommercial–Share Alike 3.0 Unported Creative Commons License (http://creativecommons.org/licenses/by-nc-sa/3.0).
Optimal Resource Allocation for NOMA-TDMA Scheme with α-Fairness in Industrial Internet of Things.
Sun, Yanjing; Guo, Yiyu; Li, Song; Wu, Dapeng; Wang, Bin
2018-05-15
In this paper, a joint non-orthogonal multiple access and time division multiple access (NOMA-TDMA) scheme is proposed in Industrial Internet of Things (IIoT), which allowed multiple sensors to transmit in the same time-frequency resource block using NOMA. The user scheduling, time slot allocation, and power control are jointly optimized in order to maximize the system α -fair utility under transmit power constraint and minimum rate constraint. The optimization problem is nonconvex because of the fractional objective function and the nonconvex constraints. To deal with the original problem, we firstly convert the objective function in the optimization problem into a difference of two convex functions (D.C.) form, and then propose a NOMA-TDMA-DC algorithm to exploit the global optimum. Numerical results show that the NOMA-TDMA scheme significantly outperforms the traditional orthogonal multiple access scheme in terms of both spectral efficiency and user fairness.
Decreasing Multicollinearity: A Method for Models with Multiplicative Functions.
ERIC Educational Resources Information Center
Smith, Kent W.; Sasaki, M. S.
1979-01-01
A method is proposed for overcoming the problem of multicollinearity in multiple regression equations where multiplicative independent terms are entered. The method is not a ridge regression solution. (JKS)
NASA Astrophysics Data System (ADS)
Zou, Xueli
In the past three decades, physics education research has primarily focused on student conceptual understanding; little work has been conducted to investigate student difficulties in problem solving. In cognitive science and psychology, however, extensive studies have explored the differences in problem solving between experts and naive students. A major finding indicates that experts often apply qualitative representations in problem solving, but that novices use an equation-centered method. This dissertation describes investigations into the use of multiple representations and visualizations in student understanding and problem solving with the concepts of work and energy. A multiple-representation strategy was developed to help students acquire expertise in solving work-energy problems. In this approach, a typical work-energy problem is considered as a physical process. The process is first described in words-the verbal representation of the process. Next, a sketch or a picture, called a pictorial representation, is used to represent the process. This is followed by work-energy bar charts-a physical representation of the same processes. Finally, this process is represented mathematically by using a generalized work-energy equation. In terms of the multiple representations, the goal of solving a work- energy problem is to represent the physical process the more intuitive pictorial and diagrammatic physical representations. Ongoing assessment of student learning indicates that this multiple-representation technique is more effective than standard instruction methods in student problem solving. visualize this difficult-to-understand concept, a guided- inquiry learning activity using a pair of model carts and an experiment problem using a sandbag were developed. Assessment results have shown that these research-based materials are effective in helping students visualize this concept and give a pictorial idea of ``where the kinetic energy goes'' during inelastic collisions. The research and curriculum development was conducted in the context of the introductory calculus-based physics course. Investigations were carried out using common physics education research tools, including open-ended surveys, written test questions, and individual student interviews.
Lincoln, Nadina B; das Nair, Roshan; Bradshaw, Lucy; Constantinescu, Cris S; Drummond, Avril E R; Erven, Alexandra; Evans, Amy L; Fitzsimmons, Deborah; Montgomery, Alan A; Morgan, Miriam
2015-12-08
People with multiple sclerosis have problems with memory and attention. Cognitive rehabilitation is a structured set of therapeutic activities designed to retrain an individual's memory and other cognitive functions. Cognitive rehabilitation may be provided to teach people strategies to cope with these problems, in order to reduce the impact on everyday life. The effectiveness of cognitive rehabilitation for people with multiple sclerosis has not been established. This is a multi-centre, randomised controlled trial investigating the clinical and cost-effectiveness of a group-based cognitive rehabilitation programme for attention and memory problems for people with multiple sclerosis. Four hundred people with multiple sclerosis will be randomised from at least four centres. Participants will be eligible if they have memory problems, are 18 to 69 years of age, are able to travel to attend group sessions and give informed consent. Participants will be randomised in a ratio of 6:5 to the group rehabilitation intervention plus usual care or usual care alone. Intervention groups will receive 10 weekly sessions of a manualised cognitive rehabilitation programme. The intervention will include both restitution strategies to retrain impaired attention and memory functions and compensation strategies to enable participants to cope with their cognitive problems. All participants will receive a follow-up questionnaire and an assessment by a research assistant at 6 and 12 months after randomisation. The primary outcome is the Multiple Sclerosis Impact Scale (MSIS) Psychological subscale at 12 months. Secondary outcomes include the Everyday Memory Questionnaire, General Health Questionnaire-30, EQ-5D and a service use questionnaire from participants, and the Everyday Memory Questionnaire-relative version and Carer Strain Index from a relative or friend. The primary analysis will be based on intention to treat. A mixed-model regression analysis of the MSIS Psychological subscale at 12 months will be used to estimate the effect of the group cognitive rehabilitation programme. The study will provide evidence regarding the clinical and cost-effectiveness of a group-based cognitive rehabilitation programme for attention and memory problems in people with multiple sclerosis. ISRCTN09697576 . Registered 14 August 2014.
2015-09-25
Multiple Approaches for Testing Novel Coatings in the Laboratory and in Pearl Harbor, Hawaii with Emphasis on the Global, Problem-Fouling Invertebrates 5a...on the Global, Problem-Fouling Invertebrates ONR AWARD NUMBER: N00014-11-1-0167 PRINCIPLE INVESTIGATOR: Michael G. Hadfield, Ph.D...luteoviolacea a phage tail-like component that is capable of inducing the metamorphosis of a marine invertebrate . However, our continued studies in the
Multiple cranial neuropathy: a common diagnostic problem.
Garg, R K; Karak, B
1999-10-01
Syndrome of multiple cranial palsies is a common clinical problem routinely encountered in neurological practice. Anatomical patterns of cranial nerves involvement help in localizing the lesion. Various infections, malignant neoplasms and autoimmune vasculitis are common disorders leading to various syndromes of multiple cranial nerve palsies. A large number of diffuse neurological disorders (e.g. Gullian-Barre syndrome, myopathies) may also present with syndrome of multiple cranial nerve palsies. Despite extensive biochemical and radiological work-up the accurate diagnosis may not be established. Few such patients represent "idiopathic" variety of multiple cranial nerve involvement and show good response to corticosteroids. Widespread and sequential involvements of cranial nerves frequently suggest possibility of malignant infiltration of meninges, however, confirmation of diagnosis may not be possible before autopsy.
Bae, Seongryu; Lee, Sangyoon; Lee, Sungchul; Jung, Songee; Makino, Keitaro; Park, Hyuntae; Shimada, Hiroyuki
2018-06-01
We examined the role of social frailty in the association between hearing problems and mild cognitive impairment (MCI), and investigated which cognitive impairment domains are most strongly involved. Participants were 4251 older adults (mean age 72.5 ± 5.2 years, 46.1% male) who met the study inclusion criteria. Hearing problems were measured using the Hearing Handicap Inventory for the Elderly. Social frailty was identified using responses to five questions. Participants were divided into four groups depending on the presence of social frailty and hearing problems: control, social frailty, hearing problem, and co-occurrence. We assessed memory, attention, executive function, and processing speed using the National Center for Geriatrics and Gerontology-Functional Assessment Tool. Participants were categorized into normal cognition, single- and multiple-domain MCI, depending on the number of impaired cognitive domains. Participants with multiple-domain MCI exhibited the highest odds ratios (OR) of the co-occurrence group (OR: 3.89, 95% confidence intervals [CI]: 1.96-7.72), followed by the social frailty (OR: 2.65, 95% CI: 1.49-4.67), and hearing problem (OR: 1.90, 95% CI: 1.08-3.34) groups, compared with the control group. However, single-domain MCI was not significantly associated with any group. Cognitive domain analysis revealed that impaired executive function and processing speed were associated with the co-occurrence, hearing problem, and social frailty groups, respectively. Social frailty and hearing problems were independently associated with multiple-domain MCI. Comorbid conditions were more strongly associated with multiple-domain MCI. Longitudinal studies are needed to elucidate the causal role of social frailty in the association between hearing impairment and MCI. Copyright © 2018 Elsevier B.V. All rights reserved.
Soltani, Atousa; Hewage, Kasun; Reza, Bahareh; Sadiq, Rehan
2015-01-01
Municipal Solid Waste Management (MSWM) is a complicated process that involves multiple environmental and socio-economic criteria. Decision-makers look for decision support frameworks that can guide in defining alternatives, relevant criteria and their weights, and finding a suitable solution. In addition, decision-making in MSWM problems such as finding proper waste treatment locations or strategies often requires multiple stakeholders such as government, municipalities, industries, experts, and/or general public to get involved. Multi-criteria Decision Analysis (MCDA) is the most popular framework employed in previous studies on MSWM; MCDA methods help multiple stakeholders evaluate the often conflicting criteria, communicate their different preferences, and rank or prioritize MSWM strategies to finally agree on some elements of these strategies and make an applicable decision. This paper reviews and brings together research on the application of MCDA for solving MSWM problems with more focus on the studies that have considered multiple stakeholders and offers solutions for such problems. Results of this study show that AHP is the most common approach in consideration of multiple stakeholders and experts and governments/municipalities are the most common participants in these studies. Copyright © 2014 Elsevier Ltd. All rights reserved.
Rosenberg-Lee, Miriam; Ashkenazi, Sarit; Chen, Tianwen; Young, Christina B.; Geary, David C.; Menon, Vinod
2014-01-01
Developmental dyscalculia (DD) is marked by specific deficits in processing numerical and mathematical information despite normal intelligence (IQ) and reading ability. We examined how brain circuits used by young children with DD to solve simple addition and subtraction problems differ from those used by typically developing (TD) children who were matched on age, IQ, reading ability, and working memory. Children with DD were slower and less accurate during problem solving than TD children, and were especially impaired on their ability to solve subtraction problems. Children with DD showed significantly greater activity in multiple parietal, occipito-temporal and prefrontal cortex regions while solving addition and subtraction problems. Despite poorer performance during subtraction, children with DD showed greater activity in multiple intra-parietal sulcus (IPS) and superior parietal lobule subdivisions in the dorsal posterior parietal cortex as well as fusiform gyrus in the ventral occipito-temporal cortex. Critically, effective connectivity analyses revealed hyper-connectivity, rather than reduced connectivity, between the IPS and multiple brain systems including the lateral fronto-parietal and default mode networks in children with DD during both addition and subtraction. These findings suggest the IPS and its functional circuits are a major locus of dysfunction during both addition and subtraction problem solving in DD, and that inappropriate task modulation and hyper-connectivity, rather than under-engagement and under-connectivity, are the neural mechanisms underlying problem solving difficulties in children with DD. We discuss our findings in the broader context of multiple levels of analysis and performance issues inherent in neuroimaging studies of typical and atypical development. PMID:25098903
Rosenberg-Lee, Miriam; Ashkenazi, Sarit; Chen, Tianwen; Young, Christina B; Geary, David C; Menon, Vinod
2015-05-01
Developmental dyscalculia (DD) is marked by specific deficits in processing numerical and mathematical information despite normal intelligence (IQ) and reading ability. We examined how brain circuits used by young children with DD to solve simple addition and subtraction problems differ from those used by typically developing (TD) children who were matched on age, IQ, reading ability, and working memory. Children with DD were slower and less accurate during problem solving than TD children, and were especially impaired on their ability to solve subtraction problems. Children with DD showed significantly greater activity in multiple parietal, occipito-temporal and prefrontal cortex regions while solving addition and subtraction problems. Despite poorer performance during subtraction, children with DD showed greater activity in multiple intra-parietal sulcus (IPS) and superior parietal lobule subdivisions in the dorsal posterior parietal cortex as well as fusiform gyrus in the ventral occipito-temporal cortex. Critically, effective connectivity analyses revealed hyper-connectivity, rather than reduced connectivity, between the IPS and multiple brain systems including the lateral fronto-parietal and default mode networks in children with DD during both addition and subtraction. These findings suggest the IPS and its functional circuits are a major locus of dysfunction during both addition and subtraction problem solving in DD, and that inappropriate task modulation and hyper-connectivity, rather than under-engagement and under-connectivity, are the neural mechanisms underlying problem solving difficulties in children with DD. We discuss our findings in the broader context of multiple levels of analysis and performance issues inherent in neuroimaging studies of typical and atypical development. © 2014 John Wiley & Sons Ltd.
ERIC Educational Resources Information Center
Poitras, Eric G.; Doleck, Tenzin; Lajoie, Susanne P.
2018-01-01
Ill-structured problems, by definition, have multiple paths to a solution and are multifaceted making automated assessment and feedback a difficult challenge. Diagnostic reasoning about medical cases meet the criteria of ill-structured problem solving since there are multiple solution paths. The goal of this study was to develop an adaptive…
ERIC Educational Resources Information Center
Yilmaz, Yasemin; Durmus, Soner; Yaman, Hakan
2018-01-01
This study investigated the pattern problems posed by middle school mathematics preservice teachers using multiple representations to determine both their pattern knowledge levels and their abilities to transfer this knowledge to students. The design of the study is the survey method, one of the quantitative research methods. The study group was…
ERIC Educational Resources Information Center
Abad, Francisco J.; Olea, Julio; Ponsoda, Vicente
2009-01-01
This article deals with some of the problems that have hindered the application of Samejima's and Thissen and Steinberg's multiple-choice models: (a) parameter estimation difficulties owing to the large number of parameters involved, (b) parameter identifiability problems in the Thissen and Steinberg model, and (c) their treatment of omitted…
Cummings, E Mark; Koss, Kalsea J; Davies, Patrick T
2015-04-01
Conflict in specific family systems (e.g., interparental, parent-child) has been implicated in the development of a host of adjustment problems in adolescence, but little is known about the impact of family conflict involving multiple family systems. Furthermore, questions remain about the effects of family conflict on symptoms of specific disorders and adjustment problems and the processes mediating these effects. The present study prospectively examines the impact of family conflict and emotional security about the family system on adolescent symptoms of specific disorders and adjustment problems, including the development of symptoms of anxiety, depression, conduct problems, and peer problems. Security in the family system was examined as a mediator of these relations. Participants included 295 mother-father-adolescent families (149 girls) participating across three annual time points (grades 7-9). Including auto-regressive controls for initial levels of emotional insecurity and multiple adjustment problems (T1), higher-order emotional insecurity about the family system (T2) mediated relations between T1 family conflict and T3 peer problems, anxiety, and depressive symptoms. Further analyses supported specific patterns of emotional security/insecurity (i.e., security, disengagement, preoccupation) as mediators between family conflict and specific domains of adolescent adjustment. Family conflict was thus found to prospectively predict the development of symptoms of multiple specific adjustment problems, including symptoms of depression, anxiety, conduct problems, and peer problems, by elevating in in adolescent's emotional insecurity about the family system. The clinical implications of these findings are considered.
Disease-modifying treatments for early and advanced multiple sclerosis: a new treatment paradigm.
Giovannoni, Gavin
2018-06-01
The treatment of multiple sclerosis is evolving rapidly with 11 classes of disease-modifying therapies (DMTs). This article provides an overview of a new classification system for DMTs and treatment paradigm for using these DMTs effectively and safely. A summary of research into the use of more active approaches to early and effective treatment of multiple sclerosis with defined treatment targets of no evident disease activity (NEDA). New insights are discussed that is allowing the field to begin to tackle more advanced multiple sclerosis, including people with multiple sclerosis using wheelchairs. However, the need to modify expectations of what can be achieved in more advanced multiple sclerosis are discussed; in particular, the focus on neuronal systems with reserve capacity, for example, upper limb, bulbar and visual function. The review describes a new more active way of managing multiple sclerosis and concludes with a call to action in solving the problem of slow adoption of innovations and the global problem of untreated, or undertreated, multiple sclerosis.
Line spring model and its applications to part-through crack problems in plates and shells
NASA Technical Reports Server (NTRS)
Erdogan, Fazil; Aksel, Bulent
1988-01-01
The line spring model is described and extended to cover the problem of interaction of multiple internal and surface cracks in plates and shells. The shape functions for various related crack geometries obtained from the plane strain solution and the results of some multiple crack problems are presented. The problems considered include coplanar surface cracks on the same or opposite sides of a plate, nonsymmetrically located coplanar internal elliptic cracks, and in a very limited way the surface and corner cracks in a plate of finite width and a surface crack in a cylindrical shell with fixed end.
Line Spring Model and Its Applications to Part-Through Crack Problems in Plates and Shells
NASA Technical Reports Server (NTRS)
Erdogan, F.; Aksel, B.
1986-01-01
The line spring model is described and extended to cover the problem of interaction of multiple internal and surface cracks in plates and shells. The shape functions for various related crack geometries obtained from the plane strain solution and the results of some multiple crack problems are presented. The problems considered include coplanar surface cracks on the same or opposite sides of a plate, nonsymmetrically located coplanar internal elliptic cracks, and in a very limited way the surface and corner cracks in a plate of finite width and a surface crack in a cylindrical shell with fixed end.
Slinning, Kari; Moe, Vibeke; Walhovd, Kristine B.
2016-01-01
Multiple studies have found that children born to mothers with opioid or poly-substance use during pregnancy have more behavior and attention problems and lower cognitive functioning than non-exposed children. The present study aimed to investigate whether behavior and attention problems are more prominent than general cognitive deficits in this risk group and whether the problems wane or increase over time. This prospective longitudinal cross-informant study compared 72 children who were prenatally exposed to heroin and multiple drugs with a group of 58 children without known prenatal risk factors. Group differences in caregivers’ and teachers’ reports of the children’s behavior and attention problems based on the Child Behavior Check List and the ADHD Rating Scale were compared based on group differences in general cognitive functioning at 4 ½ and 8 ½ years of age. Both parent and teacher reports suggest that the exposed group has significantly more problems in several behavioral areas than the comparison group, particularly with regard to attention problems. The preschool teachers had already reported these problems when the children were 4 ½ years old, whereas the caregivers reported these problems mainly when the children were 8 ½ years old. The group differences in behavioral and attentional problems were not significantly greater and some were even significantly smaller than the group differences in general cognitive abilities. These findings suggest that children subject to prenatally drug exposure have increasing problems in multiple areas related to behavior from preschool age to 8 ½ years but that these problems do not seem to be specific; i.e., they are not more severe than the problems with general cognitive abilities found for this group. PMID:27336798
Nygaard, Egil; Slinning, Kari; Moe, Vibeke; Walhovd, Kristine B
2016-01-01
Multiple studies have found that children born to mothers with opioid or poly-substance use during pregnancy have more behavior and attention problems and lower cognitive functioning than non-exposed children. The present study aimed to investigate whether behavior and attention problems are more prominent than general cognitive deficits in this risk group and whether the problems wane or increase over time. This prospective longitudinal cross-informant study compared 72 children who were prenatally exposed to heroin and multiple drugs with a group of 58 children without known prenatal risk factors. Group differences in caregivers' and teachers' reports of the children's behavior and attention problems based on the Child Behavior Check List and the ADHD Rating Scale were compared based on group differences in general cognitive functioning at 4 ½ and 8 ½ years of age. Both parent and teacher reports suggest that the exposed group has significantly more problems in several behavioral areas than the comparison group, particularly with regard to attention problems. The preschool teachers had already reported these problems when the children were 4 ½ years old, whereas the caregivers reported these problems mainly when the children were 8 ½ years old. The group differences in behavioral and attentional problems were not significantly greater and some were even significantly smaller than the group differences in general cognitive abilities. These findings suggest that children subject to prenatally drug exposure have increasing problems in multiple areas related to behavior from preschool age to 8 ½ years but that these problems do not seem to be specific; i.e., they are not more severe than the problems with general cognitive abilities found for this group.
Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problem
NASA Astrophysics Data System (ADS)
Cui, Yaodong; Cui, Yi-Ping; Zhao, Zhigang
2015-09-01
A pattern-set generation algorithm (PSG) for the one-dimensional multiple stock sizes cutting stock problem (1DMSSCSP) is presented. The solution process contains two stages. In the first stage, the PSG solves the residual problems repeatedly to generate the patterns in the pattern set, where each residual problem is solved by the column-generation approach, and each pattern is generated by solving a single large object placement problem. In the second stage, the integer linear programming model of the 1DMSSCSP is solved using a commercial solver, where only the patterns in the pattern set are considered. The computational results of benchmark instances indicate that the PSG outperforms existing heuristic algorithms and rivals the exact algorithm in solution quality.
An adaptive tracker for ShipIR/NTCS
NASA Astrophysics Data System (ADS)
Ramaswamy, Srinivasan; Vaitekunas, David A.
2015-05-01
A key component in any image-based tracking system is the adaptive tracking algorithm used to segment the image into potential targets, rank-and-select the best candidate target, and the gating of the selected target to further improve tracker performance. This paper will describe a new adaptive tracker algorithm added to the naval threat countermeasure simulator (NTCS) of the NATO-standard ship signature model (ShipIR). The new adaptive tracking algorithm is an optional feature used with any of the existing internal NTCS or user-defined seeker algorithms (e.g., binary centroid, intensity centroid, and threshold intensity centroid). The algorithm segments the detected pixels into clusters, and the smallest set of clusters that meet the detection criterion is obtained by using a knapsack algorithm to identify the set of clusters that should not be used. The rectangular area containing the chosen clusters defines an inner boundary, from which a weighted centroid is calculated as the aim-point. A track-gate is then positioned around the clusters, taking into account the rate of change of the bounding area and compensating for any gimbal displacement. A sequence of scenarios is used to test the new tracking algorithm on a generic unclassified DDG ShipIR model, with and without flares, and demonstrate how some of the key seeker signals are impacted by both the ship and flare intrinsic signatures.
Dynamic electrical impedance imaging with the interacting multiple model scheme.
Kim, Kyung Youn; Kim, Bong Seok; Kim, Min Chan; Kim, Sin; Isaacson, David; Newell, Jonathan C
2005-04-01
In this paper, an effective dynamical EIT imaging scheme is presented for on-line monitoring of the abruptly changing resistivity distribution inside the object, based on the interacting multiple model (IMM) algorithm. The inverse problem is treated as a stochastic nonlinear state estimation problem with the time-varying resistivity (state) being estimated on-line with the aid of the IMM algorithm. In the design of the IMM algorithm multiple models with different process noise covariance are incorporated to reduce the modeling uncertainty. Simulations and phantom experiments are provided to illustrate the proposed algorithm.
Multiple utility constrained multi-objective programs using Bayesian theory
NASA Astrophysics Data System (ADS)
Abbasian, Pooneh; Mahdavi-Amiri, Nezam; Fazlollahtabar, Hamed
2018-03-01
A utility function is an important tool for representing a DM's preference. We adjoin utility functions to multi-objective optimization problems. In current studies, usually one utility function is used for each objective function. Situations may arise for a goal to have multiple utility functions. Here, we consider a constrained multi-objective problem with each objective having multiple utility functions. We induce the probability of the utilities for each objective function using Bayesian theory. Illustrative examples considering dependence and independence of variables are worked through to demonstrate the usefulness of the proposed model.
An evaluation of exact methods for the multiple subset maximum cardinality selection problem.
Brusco, Michael J; Köhn, Hans-Friedrich; Steinley, Douglas
2016-05-01
The maximum cardinality subset selection problem requires finding the largest possible subset from a set of objects, such that one or more conditions are satisfied. An important extension of this problem is to extract multiple subsets, where the addition of one more object to a larger subset would always be preferred to increases in the size of one or more smaller subsets. We refer to this as the multiple subset maximum cardinality selection problem (MSMCSP). A recently published branch-and-bound algorithm solves the MSMCSP as a partitioning problem. Unfortunately, the computational requirement associated with the algorithm is often enormous, thus rendering the method infeasible from a practical standpoint. In this paper, we present an alternative approach that successively solves a series of binary integer linear programs to obtain a globally optimal solution to the MSMCSP. Computational comparisons of the methods using published similarity data for 45 food items reveal that the proposed sequential method is computationally far more efficient than the branch-and-bound approach. © 2016 The British Psychological Society.
NASA Astrophysics Data System (ADS)
Yanti, Y. R.; Amin, S. M.; Sulaiman, R.
2018-01-01
This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.
The Challenges of Measuring Glycemic Variability
Rodbard, David
2012-01-01
This commentary reviews several of the challenges encountered when attempting to quantify glycemic variability and correlate it with risk of diabetes complications. These challenges include (1) immaturity of the field, including problems of data accuracy, precision, reliability, cost, and availability; (2) larger relative error in the estimates of glycemic variability than in the estimates of the mean glucose; (3) high correlation between glycemic variability and mean glucose level; (4) multiplicity of measures; (5) correlation of the multiple measures; (6) duplication or reinvention of methods; (7) confusion of measures of glycemic variability with measures of quality of glycemic control; (8) the problem of multiple comparisons when assessing relationships among multiple measures of variability and multiple clinical end points; and (9) differing needs for routine clinical practice and clinical research applications. PMID:22768904
ERIC Educational Resources Information Center
Ramful, Ajay
2012-01-01
In line with continuing efforts to explain the demanding nature of multiplicative reasoning among middle-school students, this study explores the fine-grained knowledge elements that two pairs of 7th and 8th graders deployed in their attempt to coordinate the known and unknown quantities in the gear-wheel problem. Failure to conceptualize the…
ERIC Educational Resources Information Center
Van Dooren, Wim; De Bock, Dirk; Verschaffel, Lieven
2010-01-01
This study builds on two lines of research that have so far developed largely separately: the use of additive methods to solve proportional word problems and the use of proportional methods to solve additive word problems. We investigated the development with age of both kinds of erroneous solution methods. We gave a test containing missing-value…
A Quantitative and Combinatorial Approach to Non-Linear Meanings of Multiplication
ERIC Educational Resources Information Center
Tillema, Erik; Gatza, Andrew
2016-01-01
We provide a conceptual analysis of how combinatorics problems have the potential to support students to establish non-linear meanings of multiplication (NLMM). The problems we analyze we have used in a series of studies with 6th, 8th, and 10th grade students. We situate the analysis in prior work on students' quantitative and multiplicative…
ERIC Educational Resources Information Center
Hino, Keiko
2015-01-01
The purpose of this study is to enhance our understanding of how students listen and attend to multiple solutions proposed by their classmates during the activity of comparison. This study examines ten consecutive lessons in each of the two eighth-grade classrooms in Tokyo that are organized in the style of "structured problem solving".…
ERIC Educational Resources Information Center
Boekaerts, Monique; Rozendaal, Jeroen S.
2010-01-01
The present study used multiple calibration indices to capture the complex picture of fifth graders' calibration of feeling of confidence in mathematics. Specifically, the effects of gender, type of mathematical problem, instruction method, and time of measurement (before and after problem solving) on calibration skills were investigated. Fourteen…
Navigation Solution for a Multiple Satellite and Multiple Ground Architecture
2014-09-14
Primer Vector Theory . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.2.6 The Traveling Salesman Problem . . . . . . . . . . . . . . . . . . 12...the Traveling Salesman problem [42]. It is framed as a nonlinear programming, complete combinatorial optimization where the orbital debris pieces relate...impulsive maneuvers and applies his findings to a Hohmann transfer with the addition of mid-course burns and wait times. 2.2.6 The Traveling Salesman
Maximum margin multiple instance clustering with applications to image and text clustering.
Zhang, Dan; Wang, Fei; Si, Luo; Li, Tao
2011-05-01
In multiple instance learning problems, patterns are often given as bags and each bag consists of some instances. Most of existing research in the area focuses on multiple instance classification and multiple instance regression, while very limited work has been conducted for multiple instance clustering (MIC). This paper formulates a novel framework, maximum margin multiple instance clustering (M(3)IC), for MIC. However, it is impractical to directly solve the optimization problem of M(3)IC. Therefore, M(3)IC is relaxed in this paper to enable an efficient optimization solution with a combination of the constrained concave-convex procedure and the cutting plane method. Furthermore, this paper presents some important properties of the proposed method and discusses the relationship between the proposed method and some other related ones. An extensive set of empirical results are shown to demonstrate the advantages of the proposed method against existing research for both effectiveness and efficiency.
Establishing versus preserving impressions: Predicting success in the multiple audience problem.
Nichols, Austin Lee; Cottrell, Catherine A
2015-12-01
People sometimes seek to convey discrepant impressions of themselves to different audiences simultaneously. Research suggests people are generally successful in this "multiple audience problem." Adding to previous research, the current research sought to examine factors that may limit this success by measuring social anxiety and placing participants into situations requiring them to either establish or preserve multiple impressions simultaneously. In general, participants were more successful when preserving previously conveyed impressions than when establishing impressions for the first time. In contrast, social anxiety did not affect multiple audience success. In all, this research offers valuable insight into potential challenges that people face in many social situations. © 2015 International Union of Psychological Science.
Resonance transition periodic orbits in the circular restricted three-body problem
NASA Astrophysics Data System (ADS)
Lei, Hanlun; Xu, Bo
2018-04-01
This work studies a special type of cislunar periodic orbits in the circular restricted three-body problem called resonance transition periodic orbits, which switch between different resonances and revolve about the secondary with multiple loops during one period. In the practical computation, families of multiple periodic orbits are identified first, and then the invariant manifolds emanating from the unstable multiple periodic orbits are taken to generate resonant homoclinic connections, which are used to determine the initial guesses for computing the desired periodic orbits by means of multiple-shooting scheme. The obtained periodic orbits have potential applications for the missions requiring long-term continuous observation of the secondary and tour missions in a multi-body environment.
Perfect quantum multiple-unicast network coding protocol
NASA Astrophysics Data System (ADS)
Li, Dan-Dan; Gao, Fei; Qin, Su-Juan; Wen, Qiao-Yan
2018-01-01
In order to realize long-distance and large-scale quantum communication, it is natural to utilize quantum repeater. For a general quantum multiple-unicast network, it is still puzzling how to complete communication tasks perfectly with less resources such as registers. In this paper, we solve this problem. By applying quantum repeaters to multiple-unicast communication problem, we give encoding-decoding schemes for source nodes, internal ones and target ones, respectively. Source-target nodes share EPR pairs by using our encoding-decoding schemes over quantum multiple-unicast network. Furthermore, quantum communication can be accomplished perfectly via teleportation. Compared with existed schemes, our schemes can reduce resource consumption and realize long-distance transmission of quantum information.
Investigation of Problem-Solving and Problem-Posing Abilities of Seventh-Grade Students
ERIC Educational Resources Information Center
Arikan, Elif Esra; Ünal, Hasan
2015-01-01
This study aims to examine the effect of multiple problem-solving skills on the problem-posing abilities of gifted and non-gifted students and to assess whether the possession of such skills can predict giftedness or affect problem-posing abilities. Participants' metaphorical images of problem posing were also explored. Participants were 20 gifted…
Worst-Case Energy Efficiency Maximization in a 5G Massive MIMO-NOMA System.
Chinnadurai, Sunil; Selvaprabhu, Poongundran; Jeong, Yongchae; Jiang, Xueqin; Lee, Moon Ho
2017-09-18
In this paper, we examine the robust beamforming design to tackle the energy efficiency (EE) maximization problem in a 5G massive multiple-input multiple-output (MIMO)-non-orthogonal multiple access (NOMA) downlink system with imperfect channel state information (CSI) at the base station. A novel joint user pairing and dynamic power allocation (JUPDPA) algorithm is proposed to minimize the inter user interference and also to enhance the fairness between the users. This work assumes imperfect CSI by adding uncertainties to channel matrices with worst-case model, i.e., ellipsoidal uncertainty model (EUM). A fractional non-convex optimization problem is formulated to maximize the EE subject to the transmit power constraints and the minimum rate requirement for the cell edge user. The designed problem is difficult to solve due to its nonlinear fractional objective function. We firstly employ the properties of fractional programming to transform the non-convex problem into its equivalent parametric form. Then, an efficient iterative algorithm is proposed established on the constrained concave-convex procedure (CCCP) that solves and achieves convergence to a stationary point of the above problem. Finally, Dinkelbach's algorithm is employed to determine the maximum energy efficiency. Comprehensive numerical results illustrate that the proposed scheme attains higher worst-case energy efficiency as compared with the existing NOMA schemes and the conventional orthogonal multiple access (OMA) scheme.
Worst-Case Energy Efficiency Maximization in a 5G Massive MIMO-NOMA System
Jeong, Yongchae; Jiang, Xueqin; Lee, Moon Ho
2017-01-01
In this paper, we examine the robust beamforming design to tackle the energy efficiency (EE) maximization problem in a 5G massive multiple-input multiple-output (MIMO)-non-orthogonal multiple access (NOMA) downlink system with imperfect channel state information (CSI) at the base station. A novel joint user pairing and dynamic power allocation (JUPDPA) algorithm is proposed to minimize the inter user interference and also to enhance the fairness between the users. This work assumes imperfect CSI by adding uncertainties to channel matrices with worst-case model, i.e., ellipsoidal uncertainty model (EUM). A fractional non-convex optimization problem is formulated to maximize the EE subject to the transmit power constraints and the minimum rate requirement for the cell edge user. The designed problem is difficult to solve due to its nonlinear fractional objective function. We firstly employ the properties of fractional programming to transform the non-convex problem into its equivalent parametric form. Then, an efficient iterative algorithm is proposed established on the constrained concave-convex procedure (CCCP) that solves and achieves convergence to a stationary point of the above problem. Finally, Dinkelbach’s algorithm is employed to determine the maximum energy efficiency. Comprehensive numerical results illustrate that the proposed scheme attains higher worst-case energy efficiency as compared with the existing NOMA schemes and the conventional orthogonal multiple access (OMA) scheme. PMID:28927019
A novel multi-item joint replenishment problem considering multiple type discounts.
Cui, Ligang; Zhang, Yajun; Deng, Jie; Xu, Maozeng
2018-01-01
In business replenishment, discount offers of multi-item may either provide different discount schedules with a single discount type, or provide schedules with multiple discount types. The paper investigates the joint effects of multiple discount schemes on the decisions of multi-item joint replenishment. In this paper, a joint replenishment problem (JRP) model, considering three discount (all-unit discount, incremental discount, total volume discount) offers simultaneously, is constructed to determine the basic cycle time and joint replenishment frequencies of multi-item. To solve the proposed problem, a heuristic algorithm is proposed to find the optimal solutions and the corresponding total cost of the JRP model. Numerical experiment is performed to test the algorithm and the computational results of JRPs under different discount combinations show different significance in the replenishment cost reduction.
Morrison, Heather; Roscoe, Eileen M; Atwell, Amy
2011-01-01
We evaluated antecedent exercise for treating the automatically reinforced problem behavior of 4 individuals with autism. We conducted preference assessments to identify leisure and exercise items that were associated with high levels of engagement and low levels of problem behavior. Next, we conducted three 3-component multiple-schedule sequences: an antecedent-exercise test sequence, a noncontingent leisure-item control sequence, and a social-interaction control sequence. Within each sequence, we used a 3-component multiple schedule to evaluate preintervention, intervention, and postintervention effects. Problem behavior decreased during the postintervention component relative to the preintervention component for 3 of the 4 participants during the exercise-item assessment; however, the effects could not be attributed solely to exercise for 1 of these participants. PMID:21941383
Multiple crack detection in 3D using a stable XFEM and global optimization
NASA Astrophysics Data System (ADS)
Agathos, Konstantinos; Chatzi, Eleni; Bordas, Stéphane P. A.
2018-02-01
A numerical scheme is proposed for the detection of multiple cracks in three dimensional (3D) structures. The scheme is based on a variant of the extended finite element method (XFEM) and a hybrid optimizer solution. The proposed XFEM variant is particularly well-suited for the simulation of 3D fracture problems, and as such serves as an efficient solution to the so-called forward problem. A set of heuristic optimization algorithms are recombined into a multiscale optimization scheme. The introduced approach proves effective in tackling the complex inverse problem involved, where identification of multiple flaws is sought on the basis of sparse measurements collected near the structural boundary. The potential of the scheme is demonstrated through a set of numerical case studies of varying complexity.
On the interrelation of multiplication and division in secondary school children.
Huber, Stefan; Fischer, Ursula; Moeller, Korbinian; Nuerk, Hans-Christoph
2013-01-01
Each division problem can be transformed into as a multiplication problem and vice versa. Recent research has indicated strong developmental parallels between multiplication and division in primary school children. In this study, we were interested in (i) whether these developmental parallels persist into secondary school, (ii) whether similar developmental parallels can be observed for simple and complex problems, (iii) whether skill level modulates this relationship, and (iv) whether the correlations are specific and not driven by general cognitive or arithmetic abilities. Therefore, we assessed performance of 5th and 6th graders attending two secondary school types of the German educational system in simple and complex multiplication as well as division while controlling for non-verbal intelligence, short-term memory, and other arithmetic abilities. Accordingly, we collected data from students differing in skills levels due to either age (5th < 6th grade) or school type (general < intermediate secondary school). We observed moderate to strong bivariate and partial correlations between multiplication and division with correlations being higher for simple tasks but nevertheless reliable for complex tasks. Moreover, the association between simple multiplication and division depended on students' skill levels as reflected by school types, but not by age. Partial correlations were higher for intermediate than for general secondary school children. In sum, these findings emphasize the importance of the inverse relationship between multiplication and division which persists into later developmental stages. However, evidence for skill-related differences in the relationship between multiplication and division was restricted to the differences for school types.
Choi, Ji Young; Oh, Kyung Ja
2013-02-01
The purpose of the present study was to explore the effects of multiple interpersonal traumas on psychiatric diagnosis and behavior problems of sexually abused children in Korea. With 495 children (ages 4-13 years) referred to a public counseling center for sexual abuse in Korea, we found significant differences in the rate of psychiatric diagnoses (r = .23) and severity of behavioral problems (internalizing d = 0.49, externalizing d = 0.40, total d = 0.52) between children who were victims of sexual abuse only (n = 362) and youth who were victims of interpersonal trauma experiences in addition to sexual abuse (n = 133). The effects of multiple interpersonal trauma experiences on single versus multiple diagnoses remained significant in the logistic regression analysis where demographic variables, family environmental factors, sexual abuse characteristics, and postincident factors were considered together, odds ratio (OR) = 0.44, 95% confidence interval (CI) = [0.25, 0.77], p < .01. Similarly, multiple regression analyses revealed a significant effect of multiple interpersonal trauma experiences on severity of behavioral problems above and beyond all aforementioned variables (internalizing β =.12, p = .019, externalizing β = .11, p = .036, total β = .14, p =.008). The results suggested that children with multiple interpersonal traumas are clearly at a greater risk for negative consequences following sexual abuse. Copyright © 2013 International Society for Traumatic Stress Studies.
Predicate calculus for an architecture of multiple neural networks
NASA Astrophysics Data System (ADS)
Consoli, Robert H.
1990-08-01
Future projects with neural networks will require multiple individual network components. Current efforts along these lines are ad hoc. This paper relates the neural network to a classical device and derives a multi-part architecture from that model. Further it provides a Predicate Calculus variant for describing the location and nature of the trainings and suggests Resolution Refutation as a method for determining the performance of the system as well as the location of needed trainings for specific proofs. 2. THE NEURAL NETWORK AND A CLASSICAL DEVICE Recently investigators have been making reports about architectures of multiple neural networksL234. These efforts are appearing at an early stage in neural network investigations they are characterized by architectures suggested directly by the problem space. Touretzky and Hinton suggest an architecture for processing logical statements1 the design of this architecture arises from the syntax of a restricted class of logical expressions and exhibits syntactic limitations. In similar fashion a multiple neural netword arises out of a control problem2 from the sequence learning problem3 and from the domain of machine learning. 4 But a general theory of multiple neural devices is missing. More general attempts to relate single or multiple neural networks to classical computing devices are not common although an attempt is made to relate single neural devices to a Turing machines and Sun et a!. develop a multiple neural architecture that performs pattern classification.
Thinking in terms of sensors: personification of self as an object in physics problem solving
NASA Astrophysics Data System (ADS)
Tabor-Morris, A. E.
2015-03-01
How can physics teachers help students develop consistent problem solving techniques for both simple and complicated physics problems, such as those that encompass objects undergoing multiple forces (mechanical or electrical) as individually portrayed in free-body diagrams and/or phenomenon involving multiple objects, such as Doppler effect reflection applications in echoes and ultrasonic cardiac monitoring for sound, or police radar for light? These problems can confuse novice physics students, and to sort out problem parts, the suggestion is made here to guide the student to personify self as the object in question, that is, to imagine oneself as the object undergoing outside influences such as forces and then qualify and quantify those for the problem at hand. This personification does NOT, as according to the three traditional definitions of the term (animism, anthropomorphism and teleology), empower the object to act, but instead just to detect its environment. By having students use their imagination to put themselves in the place of the object, they can ‘sense’ the influences the object is experiencing to analyze these individually, hopefully reducing the student’s feeling of being overwhelmed with information, and also imbuing the student with a sense of having experienced the situation. This can be especially useful in problems that involve both multiple forces AND multiple objects (for example, Atwood’s machine), since objects acted upon need to be considered separately and consecutively, with the idea that one cannot be two objects at once. This personification technique, documented to have been used by both Einstein and Feynman, is recommended here for secondary-school teen and university-level adult learners with discussions on specific physics and astronomy classroom strategies.
On the interrelation of multiplication and division in secondary school children
Huber, Stefan; Fischer, Ursula; Moeller, Korbinian; Nuerk, Hans-Christoph
2013-01-01
Multiplication and division are conceptually inversely related: Each division problem can be transformed into as a multiplication problem and vice versa. Recent research has indicated strong developmental parallels between multiplication and division in primary school children. In this study, we were interested in (i) whether these developmental parallels persist into secondary school, (ii) whether similar developmental parallels can be observed for simple and complex problems, (iii) whether skill level modulates this relationship, and (iv) whether the correlations are specific and not driven by general cognitive or arithmetic abilities. Therefore, we assessed performance of 5th and 6th graders attending two secondary school types of the German educational system in simple and complex multiplication as well as division while controlling for non-verbal intelligence, short-term memory, and other arithmetic abilities. Accordingly, we collected data from students differing in skills levels due to either age (5th < 6th grade) or school type (general < intermediate secondary school). We observed moderate to strong bivariate and partial correlations between multiplication and division with correlations being higher for simple tasks but nevertheless reliable for complex tasks. Moreover, the association between simple multiplication and division depended on students' skill levels as reflected by school types, but not by age. Partial correlations were higher for intermediate than for general secondary school children. In sum, these findings emphasize the importance of the inverse relationship between multiplication and division which persists into later developmental stages. However, evidence for skill-related differences in the relationship between multiplication and division was restricted to the differences for school types. PMID:24133476
Cummings, E. Mark; Koss, Kalsea J.; Davies, Patrick T.
2018-01-01
Conflict in specific family systems (e.g., interparental, parent-child) has been implicated in the development of a host of adjustment problems in adolescence, but little is known about the impact of family conflict involving multiple family systems. Furthermore, questions remain about the effects of family conflict on symptoms of specific disorders and adjustment problems and the processes mediating these effects. The present study prospectively examines the impact of family conflict and emotional security about the family system on adolescent symptoms of specific disorders and adjustment problems, including the development of symptoms of anxiety, depression, conduct problems, and peer problems. Security in the family system was examined as a mediator of these relations. Participants included 295 mother-father-adolescent families (149 girls) participating across three annual time points (grades 7–9). Including auto-regressive controls for initial levels of emotional insecurity and multiple adjustment problems (T1), higher-order emotional insecurity about the family system (T2) mediated relations between T1 family conflict and T3 peer problems, anxiety, and depressive symptoms. Further analyses supported specific patterns of emotional security/insecurity (i.e., security, disengagement, preoccupation) as mediators between family conflict and specific domains of adolescent adjustment. Family conflict was thus found to prospectively predict the development of symptoms of multiple specific adjustment problems, including symptoms of depression, anxiety, conduct problems, and peer problems, by elevating in in adolescent’s emotional insecurity about the family system. The clinical implications of these findings are considered. PMID:25131144
The problem with multiple robots
NASA Technical Reports Server (NTRS)
Huber, Marcus J.; Kenny, Patrick G.
1994-01-01
The issues that can arise in research associated with multiple, robotic agents are discussed. Two particular multi-robot projects are presented as examples. This paper was written in the hope that it might ease the transition from single to multiple robot research.
NASA Astrophysics Data System (ADS)
Zeng, Wenhui; Yi, Jin; Rao, Xiao; Zheng, Yun
2017-11-01
In this article, collision-avoidance path planning for multiple car-like robots with variable motion is formulated as a two-stage objective optimization problem minimizing both the total length of all paths and the task's completion time. Accordingly, a new approach based on Pythagorean Hodograph (PH) curves and Modified Harmony Search algorithm is proposed to solve the two-stage path-planning problem subject to kinematic constraints such as velocity, acceleration, and minimum turning radius. First, a method of path planning based on PH curves for a single robot is proposed. Second, a mathematical model of the two-stage path-planning problem for multiple car-like robots with variable motion subject to kinematic constraints is constructed that the first-stage minimizes the total length of all paths and the second-stage minimizes the task's completion time. Finally, a modified harmony search algorithm is applied to solve the two-stage optimization problem. A set of experiments demonstrate the effectiveness of the proposed approach.
Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport
NASA Technical Reports Server (NTRS)
Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon C.; Zhu, Zhifan; Jeong, Myeongsook; Kim, Hyounkong; Oh, Eunmi; Hong, Sungkwon
2017-01-01
This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).
Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport
NASA Technical Reports Server (NTRS)
Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon Chul; Zhu, Zhifan; Jeong, Myeong-Sook; Kim, Hyoun Kyoung; Oh, Eunmi; Hong, Sungkwon
2017-01-01
This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).
Cooperative path following control of multiple nonholonomic mobile robots.
Cao, Ke-Cai; Jiang, Bin; Yue, Dong
2017-11-01
Cooperative path following control problem of multiple nonholonomic mobile robots has been considered in this paper. Based on the framework of decomposition, the cooperative path following problem has been transformed into path following problem and cooperative control problem; Then cascaded theory of non-autonomous system has been employed in the design of controllers without resorting to feedback linearization. One time-varying coordinate transformation based on dilation has been introduced to solve the uncontrollable problem of nonholonomic robots when the whole group's reference converges to stationary point. Cooperative path following controllers for nonholonomic robots have been proposed under persistent reference or reference target that converges to stationary point respectively. Simulation results using Matlab have illustrated the effectiveness of the obtained theoretical results. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Taboo Search: An Approach to the Multiple Minima Problem
NASA Astrophysics Data System (ADS)
Cvijovic, Djurdje; Klinowski, Jacek
1995-02-01
Described here is a method, based on Glover's taboo search for discrete functions, of solving the multiple minima problem for continuous functions. As demonstrated by model calculations, the algorithm avoids entrapment in local minima and continues the search to give a near-optimal final solution. Unlike other methods of global optimization, this procedure is generally applicable, easy to implement, derivative-free, and conceptually simple.
ERIC Educational Resources Information Center
Eissa, Mourad Ali; Mostafa, Amaal Ahmed
2013-01-01
This study investigated the effect of using differentiated instruction by integrating multiple intelligences and learning styles on solving problems, achievement in, and attitudes towards math in six graders with learning disabilities in cooperative groups. A total of 60 students identified with LD were invited to participate. The sample was…
Beam transport results on the multi-beam MABE accelerator
DOE Office of Scientific and Technical Information (OSTI.GOV)
Coleman, P.D.; Alexander, J.A.; Hasti, D.E.
1985-10-01
MABE is a multistage, electron beam linear accelerator. The accelerator has been operated in single beam (60 kA, 7 Mev) and multiple beam configurations. This paper deals with the multiple beam configuration in which typically nine approx. = 25 kA injected beams are transported through three accelerating gaps. Experimental results from the machine are discussed, including problems encountered and proposed solutions to those problems.
ERIC Educational Resources Information Center
Waalkens, Maaike; Aleven, Vincent; Taatgen, Niels
2013-01-01
Intelligent tutoring systems (ITS) support students in learning a complex problem-solving skill. One feature that makes an ITS architecturally complex, and hard to build, is support for strategy freedom, that is, the ability to let students pursue multiple solution strategies within a given problem. But does greater freedom mean that students…
Impact of insects on multiple-use values of north-central forests: an experimental rating scheme.
Norton D. Addy; Harold O. Batzer; William J. Mattson; William E. Miller
1971-01-01
Ranking or assigning priorities to problems is an essential step in research problem selection. Up to now, no rigorous basis for ranking forest insects has been available. We evaluate and rank forest insects with a systematic numerical scheme that considers insect impact on the multiple-use values of timber, wildlife, recreation, and water. The result is a better...
ERIC Educational Resources Information Center
Digital Equipment Corp., Maynard, MA.
The curriculum materials and computer programs in this booklet introduce the idea of a matrix. They go on to discuss matrix operations of addition, subtraction, multiplication by a scalar, and matrix multiplication. The last section covers several contemporary applications of matrix multiplication, including problems of communication…
Language-specific memory for everyday arithmetic facts in Chinese-English bilinguals.
Chen, Yalin; Yanke, Jill; Campbell, Jamie I D
2016-04-01
The role of language in memory for arithmetic facts remains controversial. Here, we examined transfer of memory training for evidence that bilinguals may acquire language-specific memory stores for everyday arithmetic facts. Chinese-English bilingual adults (n = 32) were trained on different subsets of simple addition and multiplication problems. Each operation was trained in one language or the other. The subsequent test phase included all problems with addition and multiplication alternating across trials in two blocks, one in each language. Averaging over training language, the response time (RT) gains for trained problems relative to untrained problems were greater in the trained language than in the untrained language. Subsequent analysis showed that English training produced larger RT gains for trained problems relative to untrained problems in English at test relative to the untrained Chinese language. In contrast, there was no evidence with Chinese training that problem-specific RT gains differed between Chinese and the untrained English language. We propose that training in Chinese promoted a translation strategy for English arithmetic (particularly multiplication) that produced strong cross-language generalization of practice, whereas training in English strengthened relatively weak, English-language arithmetic memories and produced little generalization to Chinese (i.e., English training did not induce an English translation strategy for Chinese language trials). The results support the existence of language-specific strengthening of memory for everyday arithmetic facts.
A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs
Liu, Wan-Yu; Chou, Chun-Hung
2014-01-01
This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems. PMID:24982990
Hoglund, Wendy L; Leadbeater, Bonnie J
2004-07-01
This study tested the independent and interactive influences of classroom (concentrations of peer prosocial behaviors and victimization), family (household moves, mothers' education), and school (proportion of students receiving income assistance) ecologies on changes in children's social competence (e.g., interpersonal skills, leadership abilities), emotional problems (e.g., anxious, withdrawn behaviors), and behavioral problems (e.g., disruptiveness, aggressiveness) in first grade. Higher classroom concentrations of prosocial behaviors and victimization predicted increases in social competence, and greater school disadvantage predicted decreases. Multiple household moves and greater school disadvantage predicted increases in behavioral problems. Multiple household moves and low levels of mothers' education predicted increases in emotional problems for children in classrooms with few prosocial behaviors. Greater school disadvantage predicted increases in emotional problems for children in classrooms with low prosocial behaviors and high victimization. Policy implications of these findings are considered. Copyright 2004 APA, all rights reserved
Zemali, El-Amine; Boukra, Abdelmadjid
2015-08-01
The multiple sequence alignment (MSA) is one of the most challenging problems in bioinformatics, it involves discovering similarity between a set of protein or DNA sequences. This paper introduces a new method for the MSA problem called biogeography-based optimization with multiple populations (BBOMP). It is based on a recent metaheuristic inspired from the mathematics of biogeography named biogeography-based optimization (BBO). To improve the exploration ability of BBO, we have introduced a new concept allowing better exploration of the search space. It consists of manipulating multiple populations having each one its own parameters. These parameters are used to build up progressive alignments allowing more diversity. At each iteration, the best found solution is injected in each population. Moreover, to improve solution quality, six operators are defined. These operators are selected with a dynamic probability which changes according to the operators efficiency. In order to test proposed approach performance, we have considered a set of datasets from Balibase 2.0 and compared it with many recent algorithms such as GAPAM, MSA-GA, QEAMSA and RBT-GA. The results show that the proposed approach achieves better average score than the previously cited methods.
NASA Astrophysics Data System (ADS)
Ikelle, Luc T.; Osen, Are; Amundsen, Lasse; Shen, Yunqing
2004-12-01
The classical linear solutions to the problem of multiple attenuation, like predictive deconvolution, τ-p filtering, or F-K filtering, are generally fast, stable, and robust compared to non-linear solutions, which are generally either iterative or in the form of a series with an infinite number of terms. These qualities have made the linear solutions more attractive to seismic data-processing practitioners. However, most linear solutions, including predictive deconvolution or F-K filtering, contain severe assumptions about the model of the subsurface and the class of free-surface multiples they can attenuate. These assumptions limit their usefulness. In a recent paper, we described an exception to this assertion for OBS data. We showed in that paper that a linear and non-iterative solution to the problem of attenuating free-surface multiples which is as accurate as iterative non-linear solutions can be constructed for OBS data. We here present a similar linear and non-iterative solution for attenuating free-surface multiples in towed-streamer data. For most practical purposes, this linear solution is as accurate as the non-linear ones.
Adaptive Connectivity Restoration from Node Failure(s) in Wireless Sensor Networks
Wang, Huaiyuan; Ding, Xu; Huang, Cheng; Wu, Xiaobei
2016-01-01
Recently, there is a growing interest in the applications of wireless sensor networks (WSNs). A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex) will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple). Collaborative Single Node Failure Restoration algorithm (CSFR) is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA) is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s). In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA. PMID:27690030
Assari, Shervin
2018-05-17
Less is known about the multiplicative effects of social and psychological risk and protective factors of suicidality on college campuses. The current study aimed to investigate the multiplicative effects of social (identifying oneself as gay/lesbian, financial difficulty, violence victimization, and religiosity) and psychological (anxiety, depression, problem alcohol use, drug use) and risk/protective factors on suicidal behaviors among college students in the United States. Using a cross-sectional design, the Healthy Mind Study (HMS; 2016⁻2017), is a national online survey of college students in the United States. Social (identifying oneself as gay/lesbian, violence victimization, financial difficulty, and religiosity) and psychological (anxiety, depression, problem alcohol use, and drug use) risk/protective factors were assessed among 27,961 individuals. Three aspects of suicidality, including ideation, plan, and attempt, were also assessed. Logistic regression models were used for data analysis. Financial difficulty, violence victimization, identifying oneself as gay/lesbian, anxiety, depression, and drug use increased, while religiosity reduced the odds of suicidal behaviors. Multiplicative effects were found between the following social and psychological risk factors: (1) financial difficulty and anxiety; (2) financial difficulty and depression; (3) depression and drug use; (4) problem alcohol use and drug use; and (5) depression and problem alcohol use. There is a considerable overlap in the social and psychological processes, such as financial stress, mood disorders, and substance use problems, on risk of suicide in college students. As social and psychological risk factors do not operate independently, comprehensive suicidal risk evaluations that simultaneously address multiple social and psychological risk factors may be superior to programs that only address a single risk factor.
Spatial and Temporal Scaling of Thermal Infrared Remote Sensing Data
NASA Technical Reports Server (NTRS)
Quattrochi, Dale A.; Goel, Narendra S.
1995-01-01
Although remote sensing has a central role to play in the acquisition of synoptic data obtained at multiple spatial and temporal scales to facilitate our understanding of local and regional processes as they influence the global climate, the use of thermal infrared (TIR) remote sensing data in this capacity has received only minimal attention. This results from some fundamental challenges that are associated with employing TIR data collected at different space and time scales, either with the same or different sensing systems, and also from other problems that arise in applying a multiple scaled approach to the measurement of surface temperatures. In this paper, we describe some of the more important problems associated with using TIR remote sensing data obtained at different spatial and temporal scales, examine why these problems appear as impediments to using multiple scaled TIR data, and provide some suggestions for future research activities that may address these problems. We elucidate the fundamental concept of scale as it relates to remote sensing and explore how space and time relationships affect TIR data from a problem-dependency perspective. We also describe how linearity and non-linearity observation versus parameter relationships affect the quantitative analysis of TIR data. Some insight is given on how the atmosphere between target and sensor influences the accurate measurement of surface temperatures and how these effects will be compounded in analyzing multiple scaled TIR data. Last, we describe some of the challenges in modeling TIR data obtained at different space and time scales and discuss how multiple scaled TIR data can be used to provide new and important information for measuring and modeling land-atmosphere energy balance processes.
Cui, Zhihua; Zhang, Yi
2014-02-01
As a promising and innovative research field, bioinformatics has attracted increasing attention recently. Beneath the enormous number of open problems in this field, one fundamental issue is about the accurate and efficient computational methodology that can deal with tremendous amounts of data. In this paper, we survey some applications of swarm intelligence to discover patterns of multiple sequences. To provide a deep insight, ant colony optimization, particle swarm optimization, artificial bee colony and artificial fish swarm algorithm are selected, and their applications to multiple sequence alignment and motif detecting problem are discussed.
Wang, Chunyong; Li, Qingguo; Zhou, Xiaoqiang; Yang, Tian
2014-01-01
We investigate the multiple attribute decision-making (MADM) problems with hesitant triangular fuzzy information. Firstly, definition and some operational laws of hesitant triangular fuzzy elements are introduced. Then, we develop some hesitant triangular fuzzy aggregation operators based on Bonferroni means and discuss their basic properties. Some existing operators can be viewed as their special cases. Next, we apply the proposed operators to deal with multiple attribute decision-making problems under hesitant triangular fuzzy environment. Finally, an illustrative example is given to show the developed method and demonstrate its practicality and effectiveness.
Smallwood, D. O.
1996-01-01
It is shown that the usual method for estimating the coherence functions (ordinary, partial, and multiple) for a general multiple-input! multiple-output problem can be expressed as a modified form of Cholesky decomposition of the cross-spectral density matrix of the input and output records. The results can be equivalently obtained using singular value decomposition (SVD) of the cross-spectral density matrix. Using SVD suggests a new form of fractional coherence. The formulation as a SVD problem also suggests a way to order the inputs when a natural physical order of the inputs is absent.
Zhou, Xiaoqiang; Yang, Tian
2014-01-01
We investigate the multiple attribute decision-making (MADM) problems with hesitant triangular fuzzy information. Firstly, definition and some operational laws of hesitant triangular fuzzy elements are introduced. Then, we develop some hesitant triangular fuzzy aggregation operators based on Bonferroni means and discuss their basic properties. Some existing operators can be viewed as their special cases. Next, we apply the proposed operators to deal with multiple attribute decision-making problems under hesitant triangular fuzzy environment. Finally, an illustrative example is given to show the developed method and demonstrate its practicality and effectiveness. PMID:25140338
The Convergence Problems of Eigenfunction Expansions of Elliptic Differential Operators
NASA Astrophysics Data System (ADS)
Ahmedov, Anvarjon
2018-03-01
In the present research we investigate the problems concerning the almost everywhere convergence of multiple Fourier series summed over the elliptic levels in the classes of Liouville. The sufficient conditions for the almost everywhere convergence problems, which are most difficult problems in Harmonic analysis, are obtained. The methods of approximation by multiple Fourier series summed over elliptic curves are applied to obtain suitable estimations for the maximal operator of the spectral decompositions. Obtaining of such estimations involves very complicated calculations which depends on the functional structure of the classes of functions. The main idea on the proving the almost everywhere convergence of the eigenfunction expansions in the interpolation spaces is estimation of the maximal operator of the partial sums in the boundary classes and application of the interpolation Theorem of the family of linear operators. In the present work the maximal operator of the elliptic partial sums are estimated in the interpolation classes of Liouville and the almost everywhere convergence of the multiple Fourier series by elliptic summation methods are established. The considering multiple Fourier series as an eigenfunction expansions of the differential operators helps to translate the functional properties (for example smoothness) of the Liouville classes into Fourier coefficients of the functions which being expanded into such expansions. The sufficient conditions for convergence of the multiple Fourier series of functions from Liouville classes are obtained in terms of the smoothness and dimensions. Such results are highly effective in solving the boundary problems with periodic boundary conditions occurring in the spectral theory of differential operators. The investigations of multiple Fourier series in modern methods of harmonic analysis incorporates the wide use of methods from functional analysis, mathematical physics, modern operator theory and spectral decomposition. New method for the best approximation of the square-integrable function by multiple Fourier series summed over the elliptic levels are established. Using the best approximation, the Lebesgue constant corresponding to the elliptic partial sums is estimated. The latter is applied to obtain an estimation for the maximal operator in the classes of Liouville.
Gaussian quadrature for multiple orthogonal polynomials
NASA Astrophysics Data System (ADS)
Coussement, Jonathan; van Assche, Walter
2005-06-01
We study multiple orthogonal polynomials of type I and type II, which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the eigenvalue problem of a banded lower Hessenberg matrix Ln, containing the recurrence coefficients. As a consequence, we easily find that the multiple orthogonal polynomials of type I and type II satisfy a generalized Christoffel-Darboux identity. Furthermore, we explain the notion of multiple Gaussian quadrature (for proper multi-indices), which is an extension of the theory of Gaussian quadrature for orthogonal polynomials and was introduced by Borges. In particular, we show that the quadrature points and quadrature weights can be expressed in terms of the eigenvalue problem of Ln.
Differential evolution-simulated annealing for multiple sequence alignment
NASA Astrophysics Data System (ADS)
Addawe, R. C.; Addawe, J. M.; Sueño, M. R. K.; Magadia, J. C.
2017-10-01
Multiple sequence alignments (MSA) are used in the analysis of molecular evolution and sequence structure relationships. In this paper, a hybrid algorithm, Differential Evolution - Simulated Annealing (DESA) is applied in optimizing multiple sequence alignments (MSAs) based on structural information, non-gaps percentage and totally conserved columns. DESA is a robust algorithm characterized by self-organization, mutation, crossover, and SA-like selection scheme of the strategy parameters. Here, the MSA problem is treated as a multi-objective optimization problem of the hybrid evolutionary algorithm, DESA. Thus, we name the algorithm as DESA-MSA. Simulated sequences and alignments were generated to evaluate the accuracy and efficiency of DESA-MSA using different indel sizes, sequence lengths, deletion rates and insertion rates. The proposed hybrid algorithm obtained acceptable solutions particularly for the MSA problem evaluated based on the three objectives.
Hybrid Optimization Parallel Search PACKage
DOE Office of Scientific and Technical Information (OSTI.GOV)
2009-11-10
HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework provides a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, amore » useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.« less
Extending substructure based iterative solvers to multiple load and repeated analyses
NASA Technical Reports Server (NTRS)
Farhat, Charbel
1993-01-01
Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.
A Case Study of an Expert Problem Poser for Mathematics Competitions
ERIC Educational Resources Information Center
Kontorovich, Igor'; Koichu, Boris
2016-01-01
This paper is concerned with organizational principles of a pool of familiar problems of expert problem posers and the ways by which they are utilized for creating new problems. The presented case of Leo is part of a multiple-case study with expert problem posers for mathematics competitions. We present and inductively analyze the data collected…
An Exploration of Strategies Used by Students To Solve Problems with Multiple Ways of Solution.
ERIC Educational Resources Information Center
Santos-Trigo, Manuel
1996-01-01
Describes a study that provides information about the extent to which students actually use their mathematical resources and strategies to solve problems. Interviews were used to analyze the problem solving abilities of high school students (N=35) as they solved five problems. (DDR)
Solving Complex Problems: A Convergent Approach to Cognitive Load Measurement
ERIC Educational Resources Information Center
Zheng, Robert; Cook, Anne
2012-01-01
The study challenged the current practices in cognitive load measurement involving complex problem solving by manipulating the presence of pictures in multiple rule-based problem-solving situations and examining the cognitive load resulting from both off-line and online measures associated with complex problem solving. Forty-eight participants…
A Comparison of Two Mathematics Problem-Solving Strategies: Facilitate Algebra-Readiness
ERIC Educational Resources Information Center
Xin, Yan Ping; Zhang, Dake; Park, Joo Young; Tom, Kinsey; Whipple, Amanda; Si, Luo
2011-01-01
The authors compared a conceptual model-based problem-solving (COMPS) approach with a general heuristic instructional approach for teaching multiplication-division word-problem solving to elementary students with learning problems (LP). The results indicate that only the COMPS group significantly improved, from pretests to posttests, their…
Greater involvement and diversity of Internet gambling as a risk factor for problem gambling
Russell, Alex; Blaszczynski, Alex; Hing, Nerilee
2015-01-01
Background: Concerns that Internet gambling has elevated the prevalence of problem gambling have not been substantiated; however, evidence suggests a subgroup of Internet gamblers do experience higher rates of gambling harms. Greater overall involvement in gambling appears to be predictive of harms. The purpose of this study was to examine differences between Internet gamblers with a single or multiple online gambling accounts, including their gambling behaviours, factors influencing their online gambling and risk of experiencing gambling problems. Methods: Internet gamblers (3178) responding to an online survey that assessed their gambling behaviour, and use of single or multiple online gambling accounts. Results: Results revealed that multiple account holders were more involved gamblers, gambling on more activities and more frequently, and had higher rates of gambling problems than single account holders. Multiple account holders selected gambling sites based on price, betting options, payout rates and game experience, whereas single account holders prioritized legality and consumer protection features. Conclusion: Results suggest two different types of Internet gamblers: one motivated to move between sites to optimize preferred experiences with a tendency to gamble in a more volatile manner; and a smaller, but more stable group less influenced by promotions and experiences, and seeking a reputable and safe gambling experience. As the majority of Internet gamblers use multiple accounts, more universal responsible gambling strategies are needed to assist gamblers to track and control their expenditure to reduce risks of harm. PMID:25745873
NASA Astrophysics Data System (ADS)
Tang, Qiuhua; Li, Zixiang; Zhang, Liping; Floudas, C. A.; Cao, Xiaojun
2015-09-01
Due to the NP-hardness of the two-sided assembly line balancing (TALB) problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints (TALB-MC). Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization (TLBO) algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost function. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search (VNS) is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm (LAHC) for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.
File concepts for parallel I/O
NASA Technical Reports Server (NTRS)
Crockett, Thomas W.
1989-01-01
The subject of input/output (I/O) was often neglected in the design of parallel computer systems, although for many problems I/O rates will limit the speedup attainable. The I/O problem is addressed by considering the role of files in parallel systems. The notion of parallel files is introduced. Parallel files provide for concurrent access by multiple processes, and utilize parallelism in the I/O system to improve performance. Parallel files can also be used conventionally by sequential programs. A set of standard parallel file organizations is proposed, organizations are suggested, using multiple storage devices. Problem areas are also identified and discussed.
The Relationship Between Non-Symbolic Multiplication and Division in Childhood
McCrink, Koleen; Shafto, Patrick; Barth, Hilary
2016-01-01
Children without formal education in addition and subtraction are able to perform multi-step operations over an approximate number of objects. Further, their performance improves when solving approximate (but not exact) addition and subtraction problems that allow for inversion as a shortcut (e.g., a + b − b = a). The current study examines children’s ability to perform multi-step operations, and the potential for an inversion benefit, for the operations of approximate, non-symbolic multiplication and division. Children were trained to compute a multiplication and division scaling factor (*2 or /2, *4 or /4), and then tested on problems that combined two of these factors in a way that either allowed for an inversion shortcut (e.g., 8 * 4 / 4) or did not (e.g., 8 * 4 / 2). Children’s performance was significantly better than chance for all scaling factors during training, and they successfully computed the outcomes of the multi-step testing problems. They did not exhibit a performance benefit for problems with the a * b / b structure, suggesting they did not draw upon inversion reasoning as a logical shortcut to help them solve the multi-step test problems. PMID:26880261
Emotional Desensitization to Violence Contributes to Adolescents' Violent Behavior.
Mrug, Sylvie; Madan, Anjana; Windle, Michael
2016-01-01
Many adolescents are exposed to violence in their schools, communities and homes. Exposure to violence at high levels or across multiple contexts has been linked with emotional desensitization, indicated by low levels of internalizing symptoms. However, the long-term consequences of such desensitization are unknown. This study examined emotional desensitization to violence, together with externalizing problems, as mediators of the relationship between exposure to violence in pre-adolescence and violent behavior in late adolescence. A community sample of youth (N = 704; 48% female; 76% African American, 22% Caucasian) reported on their exposure to violence in multiple settings at ages 11, 13 and 18. Internalizing and externalizing problems were assessed at ages 11 and 13; violent behavior was measured at age 18. Structural Equation Modeling showed that exposure to high levels of violence at age 11 was associated with lower levels of internalizing problems (quadratic effect) at age 13, as was exposure to violence across multiple contexts (linear effect). In turn, fewer internalizing problems and more externalizing problems at age 13 predicted more violent behavior at age 18. The results suggest that emotional desensitization to violence in early adolescence contributes to serious violence in late adolescence.
Emotional Desensitization to Violence Contributes to Adolescents’ Violent Behavior
Mrug, Sylvie; Madan, Anjana; Windle, Michael
2015-01-01
Many adolescents are exposed to violence in their schools, communities and homes. Exposure to violence at high levels or across multiple contexts has been linked with emotional desensitization, indicated by low levels of internalizing symptoms. However, the long-term consequences of such desensitization are unknown. This study examined emotional desensitization to violence, together with externalizing problems, as mediators of the relationship between exposure to violence in pre-adolescence and violent behavior in late adolescence. A community sample of youth (N=704; 48% female; 76% African American, 22% Caucasian) reported on their exposure to violence in multiple settings at ages 11, 13 and 18. Internalizing and externalizing problems were assessed at ages 11 and 13; violent behavior was measured at age 18. Structural Equation Modeling showed that exposure to high levels of violence at age 11 was associated with lower levels of internalizing problems (quadratic effect) at age 13, as was exposure to violence across multiple contexts (linear effect). In turn, fewer internalizing problems and more externalizing problems at age 13 predicted more violent behavior at age 18. The results suggest that emotional desensitization to violence in early adolescence contributes to serious violence in late adolescence. PMID:25684447
Rondon, Ana T; Hilton, Dane C; Jarrett, Matthew A; Ollendick, Thomas H
2018-02-01
We compared clinic-referred youth with ADHD + sluggish cognitive tempo (SCT; n = 34), ADHD Only ( n = 108), and SCT Only ( n = 22) on demographics, co-occurring symptomatology, comorbid diagnoses, and social functioning. In total, 164 youth (age = 6-17 years, M = 9.97) and their parent(s) presented to an outpatient clinic for a psychoeducational assessment. Between-group analyses and regressions were used to examine study variables. SCT groups were older and exhibited more parent-reported internalizing problems, externalizing problems, sleep problems, and social withdrawal on the Child Behavior Checklist. No significant differences emerged between groups on the Teacher Report Form. Regression analyses involving multiple covariates revealed that SCT symptoms were uniquely related to social withdrawal but not general social problems. Based on parent report, SCT symptoms have a unique relationship with internalizing problems, sleep problems, and social withdrawal. Future research should explore correlates of SCT in youth using multiple informants.
ERIC Educational Resources Information Center
Sternberg, Kathleen J.; Baradaran, Laila P.; Abbott, Craig B.; Lamb, Michael E.; Guterman, Eva
2006-01-01
A mega-analytic study was designed to exploit the power of a large data set combining raw data from multiple studies (n=1870) to examine the effects of type of family violence, age, and gender on children's behavior problems assessed using the Child Behavior Checklist (CBCL). Our findings confirmed that children who experienced multiple forms of…
[The suffering of professionals working at home with families with multiple problems].
Lamour, Martine; Barraco-De Pinto, Marthe
2015-01-01
The management of families with multiple problems often adversely affects the many people involved in their case. This suffering at work affects particularly professionals carrying out home visits. Acknowledging this suffering, enabling these professionals to express and give meaning to their feelings is essential in order to enable them to draw on their skills and creativity. Copyright © 2015 Elsevier Masson SAS. All rights reserved.
A framework for multi-stakeholder decision-making and ...
We propose a decision-making framework to compute compromise solutions that balance conflicting priorities of multiple stakeholders on multiple objectives. In our setting, we shape the stakeholder dis-satisfaction distribution by solving a conditional-value-at-risk (CVaR) minimization problem. The CVaR problem is parameterized by a probability level that shapes the tail of the dissatisfaction distribution. The proposed approach allows us to compute a family of compromise solutions and generalizes multi-stakeholder settings previously proposed in the literature that minimize average and worst-case dissatisfactions. We use the concept of the CVaR norm to give a geometric interpretation to this problem +and use the properties of this norm to prove that the CVaR minimization problem yields Pareto optimal solutions for any choice of the probability level. We discuss a broad range of potential applications of the framework that involve complex decision-making processes. We demonstrate the developments using a biowaste facility location case study in which we seek to balance stakeholder priorities on transportation, safety, water quality, and capital costs. This manuscript describes the methodology of a new decision-making framework that computes compromise solutions that balance conflicting priorities of multiple stakeholders on multiple objectives as needed for SHC Decision Science and Support Tools project. A biowaste facility location is employed as the case study
Ishihara, Koji; Morimoto, Jun
2018-03-01
Humans use multiple muscles to generate such joint movements as an elbow motion. With multiple lightweight and compliant actuators, joint movements can also be efficiently generated. Similarly, robots can use multiple actuators to efficiently generate a one degree of freedom movement. For this movement, the desired joint torque must be properly distributed to each actuator. One approach to cope with this torque distribution problem is an optimal control method. However, solving the optimal control problem at each control time step has not been deemed a practical approach due to its large computational burden. In this paper, we propose a computationally efficient method to derive an optimal control strategy for a hybrid actuation system composed of multiple actuators, where each actuator has different dynamical properties. We investigated a singularly perturbed system of the hybrid actuator model that subdivided the original large-scale control problem into smaller subproblems so that the optimal control outputs for each actuator can be derived at each control time step and applied our proposed method to our pneumatic-electric hybrid actuator system. Our method derived a torque distribution strategy for the hybrid actuator by dealing with the difficulty of solving real-time optimal control problems. Copyright © 2017 The Author(s). Published by Elsevier Ltd.. All rights reserved.
Multi-target detection and positioning in crowds using multiple camera surveillance
NASA Astrophysics Data System (ADS)
Huang, Jiahu; Zhu, Qiuyu; Xing, Yufeng
2018-04-01
In this study, we propose a pixel correspondence algorithm for positioning in crowds based on constraints on the distance between lines of sight, grayscale differences, and height in a world coordinates system. First, a Gaussian mixture model is used to obtain the background and foreground from multi-camera videos. Second, the hair and skin regions are extracted as regions of interest. Finally, the correspondences between each pixel in the region of interest are found under multiple constraints and the targets are positioned by pixel clustering. The algorithm can provide appropriate redundancy information for each target, which decreases the risk of losing targets due to a large viewing angle and wide baseline. To address the correspondence problem for multiple pixels, we construct a pixel-based correspondence model based on a similar permutation matrix, which converts the correspondence problem into a linear programming problem where a similar permutation matrix is found by minimizing an objective function. The correct pixel correspondences can be obtained by determining the optimal solution of this linear programming problem and the three-dimensional position of the targets can also be obtained by pixel clustering. Finally, we verified the algorithm with multiple cameras in experiments, which showed that the algorithm has high accuracy and robustness.
Genetic Algorithms for Multiple-Choice Problems
NASA Astrophysics Data System (ADS)
Aickelin, Uwe
2010-04-01
This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems.It shows that such information can significantly enhance performance, but that the choice of information and the way it is included are important factors for success.Two multiple-choice problems are considered.The first is constructing a feasible nurse roster that considers as many requests as possible.In the second problem, shops are allocated to locations in a mall subject to constraints and maximising the overall income.Genetic algorithms are chosen for their well-known robustness and ability to solve large and complex discrete optimisation problems.However, a survey of the literature reveals room for further research into generic ways to include constraints into a genetic algorithm framework.Hence, the main theme of this work is to balance feasibility and cost of solutions.In particular, co-operative co-evolution with hierarchical sub-populations, problem structure exploiting repair schemes and indirect genetic algorithms with self-adjusting decoder functions are identified as promising approaches.The research starts by applying standard genetic algorithms to the problems and explaining the failure of such approaches due to epistasis.To overcome this, problem-specific information is added in a variety of ways, some of which are designed to increase the number of feasible solutions found whilst others are intended to improve the quality of such solutions.As well as a theoretical discussion as to the underlying reasons for using each operator,extensive computational experiments are carried out on a variety of data.These show that the indirect approach relies less on problem structure and hence is easier to implement and superior in solution quality.
Sensor Compromise Detection in Multiple-Target Tracking Systems
Doucette, Emily A.; Curtis, Jess W.
2018-01-01
Tracking multiple targets using a single estimator is a problem that is commonly approached within a trusted framework. There are many weaknesses that an adversary can exploit if it gains control over the sensors. Because the number of targets that the estimator has to track is not known with anticipation, an adversary could cause a loss of information or a degradation in the tracking precision. Other concerns include the introduction of false targets, which would result in a waste of computational and material resources, depending on the application. In this work, we study the problem of detecting compromised or faulty sensors in a multiple-target tracker, starting with the single-sensor case and then considering the multiple-sensor scenario. We propose an algorithm to detect a variety of attacks in the multiple-sensor case, via the application of finite set statistics (FISST), one-class classifiers and hypothesis testing using nonparametric techniques. PMID:29466314
ERIC Educational Resources Information Center
Badeau, Ryan; White, Daniel R.; Ibrahim, Bashirah; Ding, Lin; Heckler, Andrew F.
2017-01-01
The ability to solve physics problems that require multiple concepts from across the physics curriculum--"synthesis" problems--is often a goal of physics instruction. Three experiments were designed to evaluate the effectiveness of two instructional methods employing worked examples on student performance with synthesis problems; these…
Bidirectional associations in multiplication memory: conditions of negative and positive transfer.
Campbell, Jamie I D; Robert, Nicole D
2008-05-01
A variety of experimental evidence indicates that the memory representation for multiplication facts (e.g., 6 x 9 = 54) incorporates bidirectional links with a forward association from factors to product and a reverse association from product to factors. Surprisingly, the authors did not find evidence in Experiment 1 of facilitative transfer-of-practice from multiplication (6 x 9 = ?) to factoring (54 = ? x ?); in fact, multiplication practice produced item-specific interference with factoring. Similarly, the authors found no evidence in Experiment 2 that repetition of specific factoring problems (54 = ? x ?) facilitated performance of corresponding multiplication problems (6 x 9 = ?). In Experiment 3, participants practiced both multiplication and factoring and presented facilitative transfer in both directions. Thus, bidirectional facilitation occurred if both operations were practiced, but interference occurred when only one operation was practiced. We propose that this seemingly paradoxical behavior occurs because it is adaptive for the bidirectional retrieval structure to retain operational flexibility in the context of practicing both operations, whereas it is adaptive to specialize the memory representation for the practiced operation (i.e., factoring or multiplication) when only one operation is practiced.
Multiple-hypothesis multiple-model line tracking
NASA Astrophysics Data System (ADS)
Pace, Donald W.; Owen, Mark W.; Cox, Henry
2000-07-01
Passive sonar signal processing generally includes tracking of narrowband and/or broadband signature components observed on a Lofargram or on a Bearing-Time-Record (BTR) display. Fielded line tracking approaches to date have been recursive and single-hypthesis-oriented Kalman- or alpha-beta filters, with no mechanism for considering tracking alternatives beyond the most recent scan of measurements. While adaptivity is often built into the filter to handle changing track dynamics, these approaches are still extensions of single target tracking solutions to multiple target tracking environment. This paper describes an application of multiple-hypothesis, multiple target tracking technology to the sonar line tracking problem. A Multiple Hypothesis Line Tracker (MHLT) is developed which retains the recursive minimum-mean-square-error tracking behavior of a Kalman Filter in a maximum-a-posteriori delayed-decision multiple hypothesis context. Multiple line track filter states are developed and maintained using the interacting multiple model (IMM) state representation. Further, the data association and assignment problem is enhanced by considering line attribute information (line bandwidth and SNR) in addition to beam/bearing and frequency fit. MHLT results on real sonar data are presented to demonstrate the benefits of the multiple hypothesis approach. The utility of the system in cluttered environments and particularly in crossing line situations is shown.
NASA Astrophysics Data System (ADS)
Wenfeng, Liu; Zhaomeng, Wang; Hongmei, Hou
2018-05-01
The dilemma of the “Building wastes Besieged City” has gradually become a national problem. Historical experience in the world shows that establishing a systematic and complete legal system is an effective way and powerful weapon to ensure the comprehensive utilization of building wastes resources. Based on the domestic conditions, the state focuses on the problems and learns from the legislation experience of Chinese and foreign construction wastes recycling laws and regulations, to design the legal system form multiple fields, multiple angles, and multiple levels as much as possible to achieve maximum environmental, social, and economic benefits. This article mainly summarizes the characteristics and outstanding experience of the legislation of the comprehensive utilization of construction wastes as resources in foreign countries, as well as the existing problems of Chinese relevant legal regulations, and provides reference for future research and implementation of relevant legislation.
BARGH, JOHN A.
2009-01-01
Priming or nonconscious activation of social knowledge structures has produced a plethora of rather amazing findings over the past 25 years: priming a single social concept such as aggressive can have multiple effects across a wide array of psychological systems, such as perception, motivation, behavior, and evaluation. But we may have reached childhood’s end, so to speak, and need now to move on to research questions such as how these multiple effects of single primes occur (the generation problem); next, how these multiple simultaneous priming influences in the environment get distilled into nonconscious social action that has to happen serially, in real time (the reduction problem). It is suggested that models of complex conceptual structures (Lakoff & Johnson, 1980), language use in real-life conversational settings (Clark, 1996), and speech production (Dell, 1986) might hold the key for solving these two important ‘second-generation’ research problems. PMID:19844598
A space-frequency multiplicative regularization for force reconstruction problems
NASA Astrophysics Data System (ADS)
Aucejo, M.; De Smet, O.
2018-05-01
Dynamic forces reconstruction from vibration data is an ill-posed inverse problem. A standard approach to stabilize the reconstruction consists in using some prior information on the quantities to identify. This is generally done by including in the formulation of the inverse problem a regularization term as an additive or a multiplicative constraint. In the present article, a space-frequency multiplicative regularization is developed to identify mechanical forces acting on a structure. The proposed regularization strategy takes advantage of one's prior knowledge of the nature and the location of excitation sources, as well as that of their spectral contents. Furthermore, it has the merit to be free from the preliminary definition of any regularization parameter. The validity of the proposed regularization procedure is assessed numerically and experimentally. It is more particularly pointed out that properly exploiting the space-frequency characteristics of the excitation field to identify can improve the quality of the force reconstruction.
Multiple regression for physiological data analysis: the problem of multicollinearity.
Slinker, B K; Glantz, S A
1985-07-01
Multiple linear regression, in which several predictor variables are related to a response variable, is a powerful statistical tool for gaining quantitative insight into complex in vivo physiological systems. For these insights to be correct, all predictor variables must be uncorrelated. However, in many physiological experiments the predictor variables cannot be precisely controlled and thus change in parallel (i.e., they are highly correlated). There is a redundancy of information about the response, a situation called multicollinearity, that leads to numerical problems in estimating the parameters in regression equations; the parameters are often of incorrect magnitude or sign or have large standard errors. Although multicollinearity can be avoided with good experimental design, not all interesting physiological questions can be studied without encountering multicollinearity. In these cases various ad hoc procedures have been proposed to mitigate multicollinearity. Although many of these procedures are controversial, they can be helpful in applying multiple linear regression to some physiological problems.
Multiple sclerosis lesion segmentation using dictionary learning and sparse coding.
Weiss, Nick; Rueckert, Daniel; Rao, Anil
2013-01-01
The segmentation of lesions in the brain during the development of Multiple Sclerosis is part of the diagnostic assessment for this disease and gives information on its current severity. This laborious process is still carried out in a manual or semiautomatic fashion by clinicians because published automatic approaches have not been universal enough to be widely employed in clinical practice. Thus Multiple Sclerosis lesion segmentation remains an open problem. In this paper we present a new unsupervised approach addressing this problem with dictionary learning and sparse coding methods. We show its general applicability to the problem of lesion segmentation by evaluating our approach on synthetic and clinical image data and comparing it to state-of-the-art methods. Furthermore the potential of using dictionary learning and sparse coding for such segmentation tasks is investigated and various possibilities for further experiments are discussed.
Liu, Tian; Spincemaille, Pascal; de Rochefort, Ludovic; Kressler, Bryan; Wang, Yi
2009-01-01
Magnetic susceptibility differs among tissues based on their contents of iron, calcium, contrast agent, and other molecular compositions. Susceptibility modifies the magnetic field detected in the MR signal phase. The determination of an arbitrary susceptibility distribution from the induced field shifts is a challenging, ill-posed inverse problem. A method called "calculation of susceptibility through multiple orientation sampling" (COSMOS) is proposed to stabilize this inverse problem. The field created by the susceptibility distribution is sampled at multiple orientations with respect to the polarization field, B(0), and the susceptibility map is reconstructed by weighted linear least squares to account for field noise and the signal void region. Numerical simulations and phantom and in vitro imaging validations demonstrated that COSMOS is a stable and precise approach to quantify a susceptibility distribution using MRI.
Lesson study on 2nd grader of elementary school to improve the student’s numeracy skill
NASA Astrophysics Data System (ADS)
Prabowo, A.; Asih; Jumardi
2018-03-01
The purpose of this research is to find the most appropriate learning media of multiplication and division for the 2nd graders of elementary school. The study used the steps in the lesson study, Plan-Do-See. Data were taken using observation instruments, video documentation, and learning evaluation tools. Initially, teachers used gravel as media of multiplication and division. Students can solve numeracy problems when they learn by those media. In test, 80% of students were failure when the teacher evaluates them. By involving experts and partner teachers at school, classroom teachers can solve problems by discover multiplication and division media with the drawing media created by the students themselves. At the end of the lesson, 100% of students have mastered multiplication and division with the media.
Online two-stage association method for robust multiple people tracking
NASA Astrophysics Data System (ADS)
Lv, Jingqin; Fang, Jiangxiong; Yang, Jie
2011-07-01
Robust multiple people tracking is very important for many applications. It is a challenging problem due to occlusion and interaction in crowded scenarios. This paper proposes an online two-stage association method for robust multiple people tracking. In the first stage, short tracklets generated by linking people detection responses grow longer by particle filter based tracking, with detection confidence embedded into the observation model. And, an examining scheme runs at each frame for the reliability of tracking. In the second stage, multiple people tracking is achieved by linking tracklets to generate trajectories. An online tracklet association method is proposed to solve the linking problem, which allows applications in time-critical scenarios. This method is evaluated on the popular CAVIAR dataset. The experimental results show that our two-stage method is robust.
Developing Multiplicative Thinking from Additive Reasoning
ERIC Educational Resources Information Center
Tobias, Jennifer M.; Andreasen, Janet B.
2013-01-01
As students progress through elementary school, they encounter mathematics concepts that shift from additive to multiplicative situations (NCTM 2000). When they encounter fraction problems that require multiplicative thinking, they tend to incorrectly extend additive properties from whole numbers (Post et al. 1985). As a result, topics such as …
ERIC Educational Resources Information Center
Jaccard, James; And Others
1990-01-01
Issues in the detection and interpretation of interaction effects between quantitative variables in multiple regression analysis are discussed. Recent discussions associated with problems of multicollinearity are reviewed in the context of the conditional nature of multiple regression with product terms. (TJH)
Paradigms and Problem-Solving: A Literature Review.
ERIC Educational Resources Information Center
Berner, Eta S.
1984-01-01
Thomas Kuhn's conceptions of the influence of paradigms on the progress of science form the framework for analyzing how medical educators have approached research on medical problem solving. A new paradigm emphasizing multiple types of problems with varied solution strategies is proposed. (Author/MLW)
Efficient RNA structure comparison algorithms.
Arslan, Abdullah N; Anandan, Jithendar; Fry, Eric; Monschke, Keith; Ganneboina, Nitin; Bowerman, Jason
2017-12-01
Recently proposed relative addressing-based ([Formula: see text]) RNA secondary structure representation has important features by which an RNA structure database can be stored into a suffix array. A fast substructure search algorithm has been proposed based on binary search on this suffix array. Using this substructure search algorithm, we present a fast algorithm that finds the largest common substructure of given multiple RNA structures in [Formula: see text] format. The multiple RNA structure comparison problem is NP-hard in its general formulation. We introduced a new problem for comparing multiple RNA structures. This problem has more strict similarity definition and objective, and we propose an algorithm that solves this problem efficiently. We also develop another comparison algorithm that iteratively calls this algorithm to locate nonoverlapping large common substructures in compared RNAs. With the new resulting tools, we improved the RNASSAC website (linked from http://faculty.tamuc.edu/aarslan ). This website now also includes two drawing tools: one specialized for preparing RNA substructures that can be used as input by the search tool, and another one for automatically drawing the entire RNA structure from a given structure sequence.
Pasalich, Dave S; Fleming, Charles B; Oxford, Monica L; Zheng, Yao; Spieker, Susan J
2016-08-01
Multiple placement changes disrupt continuity in caregiving and undermine well-being in children in child welfare. This study conducted secondary data analysis of a randomized controlled trial to examine whether a relationship-based intervention, Promoting First Relationships(©) (PFR), reduced risk for a maladaptive cascade from placement instability to less secure attachment to elevated externalizing problems. Participants included caregivers (birth or foster/kin) of toddlers (10-24 months) recently transitioned to their care because of child welfare placement decisions. Although main effects of PFR on security and externalizing problems were not previously observed, this study's results revealed that PFR attenuated the association between multiple placement changes (baseline) and less security (postintervention) and that the indirect effect of placement instability on greater externalizing problems (6-month follow-up) via less security was evident only in toddlers in the comparison condition. These findings shed light on how a history of multiple caregiver changes may influence toddlers' risk for poor adjustment in subsequent placements, and the promise of supporting caregivers through a parenting intervention to prevent such risk. © The Author(s) 2016.
The Need for Screening, Assessment, and Treatment for Cognitive Dysfunction in Multiple Sclerosis
Benedict, Ralph H.B.; Gromisch, Elizabeth S.; DeLuca, John
2012-01-01
Cognitive dysfunction is observed in about half of people with multiple sclerosis (MS), and MS health-care professionals face the challenge of screening, assessing, and treating patients for cognitive problems. Considering the inconsistent or limited empirical evidence to assist in this task, a multidisciplinary consensus conference of MS experts, sponsored by the Consortium of Multiple Sclerosis Centers (CMSC), was held on September 24, 2010, to address these issues. Key articles from the literature on these topics were distributed prior to the meeting, and CMSC member professionals were surveyed on clinical practices related to screening, assessment, and treatment for cognitive problems. The purpose of the meeting was threefold: 1) to achieve a multidisciplinary perspective on practices for screening, monitoring, evaluating, and treating MS patients for cognitive problems; 2) to propose consensus candidate measures for screening and/or monitoring for cognitive problems in MS that neurologists or nurses might administer on a regular basis; and 3) to propose consensus treatment approaches from a multidisciplinary perspective. This article summarizes the conclusions of the conference participants and provides preliminary suggestions for screening and brief assessment. PMID:24453735
Pasalich, Dave S.; Fleming, Charles B.; Oxford, Monica L.; Zheng, Yao; Spieker, Susan J.
2016-01-01
Multiple placement changes disrupt continuity in caregiving and undermine well-being in children in child welfare. This study conducted secondary data analysis of a randomized controlled trial to examine whether a relationship-based intervention, Promoting First Relationships© (PFR), reduced risk for a maladaptive cascade from placement instability to less secure attachment to elevated externalizing problems. Participants included caregivers (birth or foster/kin) of toddlers (10–24 months) recently transitioned to their care because of child welfare placement decisions. Although main effects of PFR on security and externalizing problems were not previously observed, this study’s results revealed that PFR attenuated the association between multiple placement changes (baseline) and less security (postintervention), and that the indirect effect of placement instability on greater externalizing problems (6-month follow-up) via less security was evident only in toddlers in the comparison condition. These findings shed light on how a history of multiple caregiver changes may influence toddlers’ risk for poor adjustment in subsequent placements, and the promise of supporting caregivers through a parenting intervention to prevent such risk. PMID:27381935
Tang, Catherine So-Kum; Wu, Anise M S
2010-12-01
A multiple mediation model was proposed to integrate core concepts of the social axioms framework and the social cognitive theory in order to understand gambling behavior. It was hypothesized that the influence of general fate control belief on problem gambling and negative mood would be mediated by gambling-specific beliefs. Data from 773 Chinese college recreational gamblers were collected. The bootstrapping procedure was used to test the multiple mediation hypotheses. Significant indirect effects of fate control belief on problem gambling and negative mood through two gambling-specific mediators were found. Gambling expectancy bias was a more salient mediator than gambling self-efficacy. Fate control belief was also found to have a significant direct effect on negative mood. In general, a high level of general fate control belief was related to greater gambling expectancy bias and lower self-efficacy in resisting gambling, which were in turn related to problem gambling and negative mood. Limitations and implications of the study were discussed.
On optimal control of linear systems in the presence of multiplicative noise
NASA Technical Reports Server (NTRS)
Joshi, S. M.
1976-01-01
This correspondence considers the problem of optimal regulator design for discrete time linear systems subjected to white state-dependent and control-dependent noise in addition to additive white noise in the input and the observations. A pseudo-deterministic problem is first defined in which multiplicative and additive input disturbances are present, but noise-free measurements of the complete state vector are available. This problem is solved via discrete dynamic programming. Next is formulated the problem in which the number of measurements is less than that of the state variables and the measurements are contaminated with state-dependent noise. The inseparability of control and estimation is brought into focus, and an 'enforced separation' solution is obtained via heuristic reasoning in which the control gains are shown to be the same as those in the pseudo-deterministic problem. An optimal linear state estimator is given in order to implement the controller.
Field balancing in the real world
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bracher, B.
Field balancing can achieve significant results when other problems are present in the frequency spectrum and multiple vibrations are evident in the waveform. Many references suggest eliminating other problems before attempting to balance. That`s great - if you can do it. There are valid reasons for this approach, and it would be much easier to balance machinery when other problems have been corrected. It is the theoretical ideal in field balancing. However, in the real world of machinery maintained for years by reacting to immediate problems, the classic vibration signature for unbalance is rarely seen. Maintenance personnel make most ofmore » their decisions with limited information. The decision to balance or not to balance is usually made the same way. This paper will demonstrate significant results of field balancing in the presence of multiple problems. By examining the data available and analyzing the probabilities, a reasonable chance for success can be assured.« less
Approximate solution of the multiple watchman routes problem with restricted visibility range.
Faigl, Jan
2010-10-01
In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron weights that evolves in W, while obstacles are considered by approximation of the shortest path. The adaptation procedure considers a coverage of W by the ring in order to attract nodes toward uncovered parts of W. The proposed procedure is experimentally verified in a set of environments and several visibility ranges. Performance of the procedure is compared with the decoupled approach based on solutions of the art gallery problem and the consecutive traveling salesman problem. The experimental results show the suitability of the proposed procedure based on relatively simple supporting geometrical structures, enabling application of the SOM principles to watchman route problems in W.
Painful and involuntary Multiple Sclerosis
Bagnato, Francesca; Centonze, Diego; Galgani, Simonetta; Grasso, Maria Grazia; Haggiag, Shalom; Strano, Stefano
2010-01-01
Importance of the field Pain, dysphagia, respiratory problems, sexual and cardiovascular dysfunctions may occur in patients with multiple sclerosis (MS). Areas covered in the field In the present review we attempt to summarize the current knowledge on the impact that pain, dysphagia, respiratory problems, sexual and cardiovascular dysfunctions have in patients with MS. What the reader will gain The current understanding on pain, dysphagia, respiratory problems, sexual and cardiovascular dysfunctions and future research perspectives to expand the knowledge of this field. Take home message To effectively manage MS it is essential that these symptoms are recognised as early as possible and treated by a rehabilitative multidisciplinary approach, based on proven scientific evidence. PMID:21323633
Decision net, directed graph, and neural net processing of imaging spectrometer data
NASA Technical Reports Server (NTRS)
Casasent, David; Liu, Shiaw-Dong; Yoneyama, Hideyuki; Barnard, Etienne
1989-01-01
A decision-net solution involving a novel hierarchical classifier and a set of multiple directed graphs, as well as a neural-net solution, are respectively presented for large-class problem and mixture problem treatments of imaging spectrometer data. The clustering method for hierarchical classifier design, when used with multiple directed graphs, yields an efficient decision net. New directed-graph rules for reducing local maxima as well as the number of perturbations required, and the new starting-node rules for extending the reachability and reducing the search time of the graphs, are noted to yield superior results, as indicated by an illustrative 500-class imaging spectrometer problem.
Open-Phylo: a customizable crowd-computing platform for multiple sequence alignment
2013-01-01
Citizen science games such as Galaxy Zoo, Foldit, and Phylo aim to harness the intelligence and processing power generated by crowds of online gamers to solve scientific problems. However, the selection of the data to be analyzed through these games is under the exclusive control of the game designers, and so are the results produced by gamers. Here, we introduce Open-Phylo, a freely accessible crowd-computing platform that enables any scientist to enter our system and use crowds of gamers to assist computer programs in solving one of the most fundamental problems in genomics: the multiple sequence alignment problem. PMID:24148814
Efficient Inversion of Mult-frequency and Multi-Source Electromagnetic Data
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gary D. Egbert
2007-03-22
The project covered by this report focused on development of efficient but robust non-linear inversion algorithms for electromagnetic induction data, in particular for data collected with multiple receivers, and multiple transmitters, a situation extremely common in eophysical EM subsurface imaging methods. A key observation is that for such multi-transmitter problems each step in commonly used linearized iterative limited memory search schemes such as conjugate gradients (CG) requires solution of forward and adjoint EM problems for each of the N frequencies or sources, essentially generating data sensitivities for an N dimensional data-subspace. These multiple sensitivities allow a good approximation to themore » full Jacobian of the data mapping to be built up in many fewer search steps than would be required by application of textbook optimization methods, which take no account of the multiplicity of forward problems that must be solved for each search step. We have applied this idea to a develop a hybrid inversion scheme that combines features of the iterative limited memory type methods with a Newton-type approach using a partial calculation of the Jacobian. Initial tests on 2D problems show that the new approach produces results essentially identical to a Newton type Occam minimum structure inversion, while running more rapidly than an iterative (fixed regularization parameter) CG style inversion. Memory requirements, while greater than for something like CG, are modest enough that even in 3D the scheme should allow 3D inverse problems to be solved on a common desktop PC, at least for modest (~ 100 sites, 15-20 frequencies) data sets. A secondary focus of the research has been development of a modular system for EM inversion, using an object oriented approach. This system has proven useful for more rapid prototyping of inversion algorithms, in particular allowing initial development and testing to be conducted with two-dimensional example problems, before approaching more computationally cumbersome three-dimensional problems.« less
ERIC Educational Resources Information Center
Berg, Craig; Boote, Stacy
2017-01-01
Prior graphing research has demonstrated that clinical interviews and free-response instruments produce very different results than multiple-choice instruments, indicating potential validity problems when using multiple-choice instruments to assess graphing skills (Berg & Smith in "Science Education," 78(6), 527-554, 1994). Extending…
Validating MMI Scores: Are We Measuring Multiple Attributes?
ERIC Educational Resources Information Center
Oliver, Tom; Hecker, Kent; Hausdorf, Peter A.; Conlon, Peter
2014-01-01
The multiple mini-interview (MMI) used in health professional schools' admission processes is reported to assess multiple non-cognitive constructs such as ethical reasoning, oral communication, or problem evaluation. Though validation studies have been performed with total MMI scores, there is a paucity of information regarding how well MMI…
Why We (Usually) Don't Have to Worry about Multiple Comparisons
ERIC Educational Resources Information Center
Gelman, Andrew; Hill, Jennifer; Yajima, Masanao
2012-01-01
Applied researchers often find themselves making statistical inferences in settings that would seem to require multiple comparisons adjustments. We challenge the Type I error paradigm that underlies these corrections. Moreover we posit that the problem of multiple comparisons can disappear entirely when viewed from a hierarchical Bayesian…
Greater involvement and diversity of Internet gambling as a risk factor for problem gambling.
Gainsbury, Sally M; Russell, Alex; Blaszczynski, Alex; Hing, Nerilee
2015-08-01
Concerns that Internet gambling has elevated the prevalence of problem gambling have not been substantiated; however, evidence suggests a subgroup of Internet gamblers do experience higher rates of gambling harms. Greater overall involvement in gambling appears to be predictive of harms. The purpose of this study was to examine differences between Internet gamblers with a single or multiple online gambling accounts, including their gambling behaviours, factors influencing their online gambling and risk of experiencing gambling problems. Internet gamblers (3178) responding to an online survey that assessed their gambling behaviour, and use of single or multiple online gambling accounts. Results revealed that multiple account holders were more involved gamblers, gambling on more activities and more frequently, and had higher rates of gambling problems than single account holders. Multiple account holders selected gambling sites based on price, betting options, payout rates and game experience, whereas single account holders prioritized legality and consumer protection features. Results suggest two different types of Internet gamblers: one motivated to move between sites to optimize preferred experiences with a tendency to gamble in a more volatile manner; and a smaller, but more stable group less influenced by promotions and experiences, and seeking a reputable and safe gambling experience. As the majority of Internet gamblers use multiple accounts, more universal responsible gambling strategies are needed to assist gamblers to track and control their expenditure to reduce risks of harm. © The Author 2015. Published by Oxford University Press on behalf of the European Public Health Association. All rights reserved.
... Read More Brain aneurysm repair Brain surgery Laryngectomy Multiple sclerosis Oral cancer Parkinson disease Stroke Throat or larynx ... Jejunostomy feeding tube Mouth and neck radiation - discharge Multiple sclerosis - discharge Stroke - discharge Review Date 5/11/2016 ...
Emotion dysregulation, problem-solving, and hopelessness.
Vatan, Sevginar; Lester, David; Gunn, John F
2014-04-01
A sample of 87 Turkish undergraduate students was administered scales to measure hopelessness, problem-solving skills, emotion dysregulation, and psychiatric symptoms. All of the scores from these scales were strongly associated. In a multiple regression, hopelessness scores were predicted by poor problem-solving skills and emotion dysregulation.
Managing Stress for At-Risk Students
ERIC Educational Resources Information Center
Spiegel, Ellen J.
2017-01-01
The BRIDGE Alternative Middle School in Lowell, Massachusetts, serves students ages 12-16 who have exhibited behavioral problems in traditional school settings, including problems such as truancy, multiple suspensions, mental health issues, peer conflicts, family dysfunction, academic problems, and gang involvement. Students referred to BRIDGE are…
Radatz, Dana L; Wright, Emily M
2015-06-10
In this study, we used data from life histories of 424 non-incarcerated (n = 266) and incarcerated (n = 158) women to examine the extent to which women are exposed to multiple forms of victimization, including child abuse, intimate partner violence, sexual assault, and traumatic life events. We assessed the effects of polyvictimization (e.g., multiple victimizations) on women's health-related outcomes (e.g., attempted suicide, drug and alcohol problems) as well as whether the prevalence rates and effects of victimization were significantly different between the subsamples of women. Results indicate that incarcerated women experience significantly more victimization than non-incarcerated women, and while polyvictimization was associated with a higher likelihood of alcohol problems, drug problems, and attempted suicide among non-incarcerated women, it was only marginally associated with an increased likelihood of alcohol problems among incarcerated women. Finally, low levels of polyvictimization affected alcohol and drug problems among incarcerated and non-incarcerated women differently. © The Author(s) 2015.
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.
Using Video Prompting to Teach Mathematical Problem Solving of Real-World Video-Simulation Problems
ERIC Educational Resources Information Center
Saunders, Alicia F.; Spooner, Fred; Ley Davis, Luann
2018-01-01
Mathematical problem solving is necessary in many facets of everyday life, yet little research exists on how to teach students with more severe disabilities higher order mathematics like problem solving. Using a multiple probe across participants design, three middle school students with moderate intellectual disability (ID) were taught to solve…
DOE Office of Scientific and Technical Information (OSTI.GOV)
Soltani, Atousa; Hewage, Kasun; Reza, Bahareh
2015-01-15
Highlights: • We review Municipal Solid Waste Management studies with focus on multiple stakeholders. • We focus on studies with multi-criteria decision analysis methods and discover their trends. • Most studies do not offer solutions for situations where stakeholders compete for more benefits or have unequal voting powers. • Governments and experts are the most participated stakeholders and AHP is the most dominant method. - Abstract: Municipal Solid Waste Management (MSWM) is a complicated process that involves multiple environmental and socio-economic criteria. Decision-makers look for decision support frameworks that can guide in defining alternatives, relevant criteria and their weights, andmore » finding a suitable solution. In addition, decision-making in MSWM problems such as finding proper waste treatment locations or strategies often requires multiple stakeholders such as government, municipalities, industries, experts, and/or general public to get involved. Multi-criteria Decision Analysis (MCDA) is the most popular framework employed in previous studies on MSWM; MCDA methods help multiple stakeholders evaluate the often conflicting criteria, communicate their different preferences, and rank or prioritize MSWM strategies to finally agree on some elements of these strategies and make an applicable decision. This paper reviews and brings together research on the application of MCDA for solving MSWM problems with more focus on the studies that have considered multiple stakeholders and offers solutions for such problems. Results of this study show that AHP is the most common approach in consideration of multiple stakeholders and experts and governments/municipalities are the most common participants in these studies.« less
Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms
NASA Astrophysics Data System (ADS)
Kwok, Kwan S.; Driessen, Brian J.; Phillips, Cynthia A.; Tovey, Craig A.
1997-09-01
This work considers the problem of maximum utilization of a set of mobile robots with limited sensor-range capabilities and limited travel distances. The robots are initially in random positions. A set of robots properly guards or covers a region if every point within the region is within the effective sensor range of at least one vehicle. We wish to move the vehicles into surveillance positions so as to guard or cover a region, while minimizing the maximum distance traveled by any vehicle. This problem can be formulated as an assignment problem, in which we must optimally decide which robot to assign to which slot of a desired matrix of grid points. The cost function is the maximum distance traveled by any robot. Assignment problems can be solved very efficiently. Solution times for one hundred robots took only seconds on a silicon graphics crimson workstation. The initial positions of all the robots can be sampled by a central base station and their newly assigned positions communicated back to the robots. Alternatively, the robots can establish their own coordinate system with the origin fixed at one of the robots and orientation determined by the compass bearing of another robot relative to this robot. This paper presents example solutions to the multiple-target-multiple-agent scenario using a matching algorithm. Two separate cases with one hundred agents in each were analyzed using this method. We have found these mobile robot problems to be a very interesting application of network optimization methods, and we expect this to be a fruitful area for future research.
Proactive Problem Avoidance and Quality of Service (QOS) Guarantees for Large Heterogeneous Networks
2002-03-01
host, and can be used to monitor and provide problem response data to multiple network elements. A blowup of the components of an RA is shown in...developed based on stati signal processing and learning. T ts to stical here are two salient features on the intelligent gents developed: (1) an...For multiple routers, the physical connections between interfaces along with the respective health of terface are represented. in In addition to
Mei, Jie; Ren, Wei; Li, Bing; Ma, Guangfu
2015-09-01
In this paper, we consider the distributed containment control problem for multiagent systems with unknown nonlinear dynamics. More specifically, we focus on multiple second-order nonlinear systems and networked Lagrangian systems. We first study the distributed containment control problem for multiple second-order nonlinear systems with multiple dynamic leaders in the presence of unknown nonlinearities and external disturbances under a general directed graph that characterizes the interaction among the leaders and the followers. A distributed adaptive control algorithm with an adaptive gain design based on the approximation capability of neural networks is proposed. We present a necessary and sufficient condition on the directed graph such that the containment error can be reduced as small as desired. As a byproduct, the leaderless consensus problem is solved with asymptotical convergence. Because relative velocity measurements between neighbors are generally more difficult to obtain than relative position measurements, we then propose a distributed containment control algorithm without using neighbors' velocity information. A two-step Lyapunov-based method is used to study the convergence of the closed-loop system. Next, we apply the ideas to deal with the containment control problem for networked unknown Lagrangian systems under a general directed graph. All the proposed algorithms are distributed and can be implemented using only local measurements in the absence of communication. Finally, simulation examples are provided to show the effectiveness of the proposed control algorithms.
NASA Astrophysics Data System (ADS)
Ramadhani, T.; Hertono, G. F.; Handari, B. D.
2017-07-01
The Multiple Traveling Salesman Problem (MTSP) is the extension of the Traveling Salesman Problem (TSP) in which the shortest routes of m salesmen all of which start and finish in a single city (depot) will be determined. If there is more than one depot and salesmen start from and return to the same depot, then the problem is called Fixed Destination Multi-depot Multiple Traveling Salesman Problem (MMTSP). In this paper, MMTSP will be solved using the Ant Colony Optimization (ACO) algorithm. ACO is a metaheuristic optimization algorithm which is derived from the behavior of ants in finding the shortest route(s) from the anthill to a form of nourishment. In solving the MMTSP, the algorithm is observed with respect to different chosen cities as depots and non-randomly three parameters of MMTSP: m, K, L, those represents the number of salesmen, the fewest cities that must be visited by a salesman, and the most number of cities that can be visited by a salesman, respectively. The implementation is observed with four dataset from TSPLIB. The results show that the different chosen cities as depots and the three parameters of MMTSP, in which m is the most important parameter, affect the solution.
Cang, Tao; Sun, Caixia; Zhao, Hua; Tang, Tao; Zhang, Changpeng; Yu, Ruixian; Wang, Xinquan; Wang, Qiang; Dai, Fen; Zhao, Xueping
2018-02-01
A risk assessment for imidacloprid applied on strawberries under different conditions was performed after residue determination using the quick, cheap, effective, rugged, and safe (QuEChERS) method. The application conditions were varied according to the applied dosage, addition of a plant oil or organosilicon surfactant, water volume, and sprayer type. The degradation dynamics of imidacloprid on strawberries followed first-order kinetics. At applied doses of 30-60 g a.i. ha -1 , the half-lives of imidacloprid were 2.89-3.46, 1.98-3.65, and 2.57-2.77 days after application without a surfactant or with a plant oil or organosilicon surfactant, respectively. For water volumes of 112.5, 225, 450, 675, and 900 L ha -1 , the half-lives of imidacloprid applied in the presence of the plant oil surfactant were 3.30, 7.70, 5.33, 7.70, and 6.30 days, respectively. The half-lives after application with a knapsack mist duster, electric sprayer, and manual sprayer were 2.16, 5.77, and 7.70 days, respectively. The health risk assessment revealed risk quotients less than 1 in all cases, indicating that the application of imidacloprid poses a low health risk to humans after a pre-harvest interval of 10 days under our application conditions. The risk assessment results can provide reference data for setting a reasonable maximum residue limit for imidacloprid on strawberries in China.
Discovering Motifs in Biological Sequences Using the Micron Automata Processor.
Roy, Indranil; Aluru, Srinivas
2016-01-01
Finding approximately conserved sequences, called motifs, across multiple DNA or protein sequences is an important problem in computational biology. In this paper, we consider the (l, d) motif search problem of identifying one or more motifs of length l present in at least q of the n given sequences, with each occurrence differing from the motif in at most d substitutions. The problem is known to be NP-complete, and the largest solved instance reported to date is (26,11). We propose a novel algorithm for the (l,d) motif search problem using streaming execution over a large set of non-deterministic finite automata (NFA). This solution is designed to take advantage of the micron automata processor, a new technology close to deployment that can simultaneously execute multiple NFA in parallel. We demonstrate the capability for solving much larger instances of the (l, d) motif search problem using the resources available within a single automata processor board, by estimating run-times for problem instances (39,18) and (40,17). The paper serves as a useful guide to solving problems using this new accelerator technology.
Student Credit Card Debt in the 21st Century: Options for Financial Aid Administrators.
ERIC Educational Resources Information Center
Oleson, Mark
2001-01-01
Provides multiple workable solutions financial aid offices can offer students throughout their college experience to deal with debt: preventive solutions for avoiding problems with credit card debt, holistic solutions for other related problems, and remedial solutions for existing problems. (EV)
... a brain or spinal cord injury. People with multiple sclerosis also have problems with their bowels. Those with ... PA: Elsevier Saunders; 2016:chap 18. Read More Multiple sclerosis Recovering after stroke Patient Instructions Constipation - self-care ...
Developing image processing meta-algorithms with data mining of multiple metrics.
Leung, Kelvin; Cunha, Alexandre; Toga, A W; Parker, D Stott
2014-01-01
People often use multiple metrics in image processing, but here we take a novel approach of mining the values of batteries of metrics on image processing results. We present a case for extending image processing methods to incorporate automated mining of multiple image metric values. Here by a metric we mean any image similarity or distance measure, and in this paper we consider intensity-based and statistical image measures and focus on registration as an image processing problem. We show how it is possible to develop meta-algorithms that evaluate different image processing results with a number of different metrics and mine the results in an automated fashion so as to select the best results. We show that the mining of multiple metrics offers a variety of potential benefits for many image processing problems, including improved robustness and validation.
An Improved Wake Vortex Tracking Algorithm for Multiple Aircraft
NASA Technical Reports Server (NTRS)
Switzer, George F.; Proctor, Fred H.; Ahmad, Nashat N.; LimonDuparcmeur, Fanny M.
2010-01-01
The accurate tracking of vortex evolution from Large Eddy Simulation (LES) data is a complex and computationally intensive problem. The vortex tracking requires the analysis of very large three-dimensional and time-varying datasets. The complexity of the problem is further compounded by the fact that these vortices are embedded in a background turbulence field, and they may interact with the ground surface. Another level of complication can arise, if vortices from multiple aircrafts are simulated. This paper presents a new technique for post-processing LES data to obtain wake vortex tracks and wake intensities. The new approach isolates vortices by defining "regions of interest" (ROI) around each vortex and has the ability to identify vortex pairs from multiple aircraft. The paper describes the new methodology for tracking wake vortices and presents application of the technique for single and multiple aircraft.
Tang, Fengyan; Jang, Heejung; Lingler, Jennifer; Tamres, Lisa K; Erlen, Judith A
2015-01-01
Caring for an older adult with memory loss is stressful. Caregiver stress could produce negative outcomes such as depression. Previous research is limited in examining multiple intermediate pathways from caregiver stress to depressive symptoms. This study addresses this limitation by examining the role of self-efficacy, social support, and problem solving in mediating the relationships between caregiver stressors and depressive symptoms. Using a sample of 91 family caregivers, we tested simultaneously multiple mediators between caregiver stressors and depression. Results indicate that self-efficacy mediated the pathway from daily hassles to depression. Findings point to the importance of improving self-efficacy in psychosocial interventions for caregivers of older adults with memory loss.
NASA Astrophysics Data System (ADS)
Udomsungworagul, A.; Charnsethikul, P.
2018-03-01
This article introduces methodology to solve large scale two-phase linear programming with a case of multiple time period animal diet problems under both nutrients in raw materials and finished product demand uncertainties. Assumption of allowing to manufacture multiple product formulas in the same time period and assumption of allowing to hold raw materials and finished products inventory have been added. Dantzig-Wolfe decompositions, Benders decomposition and Column generations technique has been combined and applied to solve the problem. The proposed procedure was programmed using VBA and Solver tool in Microsoft Excel. A case study was used and tested in term of efficiency and effectiveness trade-offs.
ERIC Educational Resources Information Center
Smith, Carla M.; Smith, Richard G.; Dracobly, Joseph D.; Pace, Amy Peterson
2012-01-01
We evaluated interrater agreement across multiple respondents on anecdotal assessments and compared cases in which agreement was obtained with outcomes of functional analyses. Experiment 1 evaluated agreement among multiple respondents on the function of problem behavior for 27 individuals across 42 target behaviors using the Motivation Assessment…
ERIC Educational Resources Information Center
Rau, M. A.; Aleven, V.; Rummel, N.; Pardos, Z.
2014-01-01
Providing learners with multiple representations of learning content has been shown to enhance learning outcomes. When multiple representations are presented across consecutive problems, we have to decide in what sequence to present them. Prior research has demonstrated that interleaving "tasks types" (as opposed to blocking them) can…
ERIC Educational Resources Information Center
Raskauskas, Juliana
2010-01-01
Research has indicated that children exposed to multiple risks often report worse mental health and academic performance than those experiencing only one risk. The present research examines whether exposure to more than one form of peer victimization (multiple peer victimization) at school is related to reports of negative outcomes. Eighty-six…
Multiple Choice Items: How to Gain the Most out of Them.
ERIC Educational Resources Information Center
Talmir, Pinchas
1991-01-01
Describes how multiple-choice items can be designed and used as an effective diagnostic tool by avoiding their pitfalls and by taking advantage of their potential benefits. The following issues are discussed: correct' versus best answers; construction of diagnostic multiple-choice items; the problem of guessing; the use of justifications of…
Comparison of Difficulties and Reliabilities of Math-Completion and Multiple-Choice Item Formats.
ERIC Educational Resources Information Center
Oosterhof, Albert C.; Coats, Pamela K.
Instructors who develop classroom examinations that require students to provide a numerical response to a mathematical problem are often very concerned about the appropriateness of the multiple-choice format. The present study augments previous research relevant to this concern by comparing the difficulty and reliability of multiple-choice and…
Automated simultaneous multiple feature classification of MTI data
NASA Astrophysics Data System (ADS)
Harvey, Neal R.; Theiler, James P.; Balick, Lee K.; Pope, Paul A.; Szymanski, John J.; Perkins, Simon J.; Porter, Reid B.; Brumby, Steven P.; Bloch, Jeffrey J.; David, Nancy A.; Galassi, Mark C.
2002-08-01
Los Alamos National Laboratory has developed and demonstrated a highly capable system, GENIE, for the two-class problem of detecting a single feature against a background of non-feature. In addition to the two-class case, however, a commonly encountered remote sensing task is the segmentation of multispectral image data into a larger number of distinct feature classes or land cover types. To this end we have extended our existing system to allow the simultaneous classification of multiple features/classes from multispectral data. The technique builds on previous work and its core continues to utilize a hybrid evolutionary-algorithm-based system capable of searching for image processing pipelines optimized for specific image feature extraction tasks. We describe the improvements made to the GENIE software to allow multiple-feature classification and describe the application of this system to the automatic simultaneous classification of multiple features from MTI image data. We show the application of the multiple-feature classification technique to the problem of classifying lava flows on Mauna Loa volcano, Hawaii, using MTI image data and compare the classification results with standard supervised multiple-feature classification techniques.
ERIC Educational Resources Information Center
Lee, Kerry; Ng, Ee Lynn; Ng, Swee Fong
2009-01-01
Solving algebraic word problems involves multiple cognitive phases. The authors used a multitask approach to examine the extent to which working memory and executive functioning are associated with generating problem models and producing solutions. They tested 255 11-year-olds on working memory (Counting Recall, Letter Memory, and Keep Track),…
A Meta-Analysis of the Taped Problems Intervention
ERIC Educational Resources Information Center
Kleinert, Whitney L.; Codding, Robin S.; Minami, Takuya; Gould, Kaitlin
2018-01-01
Taped problems is an intervention strategy for addressing mathematics fluency that has been evaluated in multiple single-case design studies. Although its efficacy has been supported in individual studies, no comprehensive quantitative synthesis has been conducted on taped problems. The purpose of this study was to synthesize the literature that…
ERIC Educational Resources Information Center
Nelson, Tenneisha; Squires, Vicki
2017-01-01
Organizations are faced with solving increasingly complex problems. Addressing these issues requires effective leadership that can facilitate a collaborative problem solving approach where multiple perspectives are leveraged. In this conceptual paper, we critique the effectiveness of earlier leadership models in tackling complex organizational…
ERIC Educational Resources Information Center
Chan, David W.
2003-01-01
A study involving 639 Chinese gifted students (grades 4-12) found that intense emotional involvement, perfectionism, unchallenging schoolwork, multipotentiality, and parental expectations were relatively common adjustment problems. Poor interpersonal relationships were not. Results also indicated that conventional intelligence increased…
Using Data Analysis Problems in a Large General Microbiology Course.
ERIC Educational Resources Information Center
Deutch, Charles E.
1997-01-01
Argues that data analysis problems can be used successfully in large introductory microbiology courses, even when exams consist entirely of multiple-choice questions and out-of-class contact with the instructor is limited. Discusses course organization, problem structure, student performance and response, advantages of using data analysis…
The Role of Problem Solving in Complex Intraverbal Repertoires
ERIC Educational Resources Information Center
Sautter, Rachael A.; LeBlanc, Linda A.; Jay, Allison A.; Goldsmith, Tina R.; Carr, James E.
2011-01-01
We examined whether typically developing preschoolers could learn to use a problem-solving strategy that involved self-prompting with intraverbal chains to provide multiple responses to intraverbal categorization questions. Teaching the children to use the problem-solving strategy did not produce significant increases in target responses until…
The Effectiveness of "Pencasts" in Physics Courses
ERIC Educational Resources Information Center
Weliweriya, Nandana; Sayre, Eleanor C.; Zollman, Dean A.
2018-01-01
Pencasts are videos of problem solving with narration by the problem solver. Pedagogically, students can create pencasts to illustrate their own problem solving to the instructor or to their peers. Pencasts have implications for teaching at multiple levels from elementary grades through university courses. In this article, we describe the use of…
Trauma Focused CBT for Children with Co-Occurring Trauma and Behavior Problems
ERIC Educational Resources Information Center
Cohen, Judith A.; Berliner, Lucy; Mannarino, Anthony
2010-01-01
Objective: Childhood trauma impacts multiple domains of functioning including behavior. Traumatized children commonly have behavioral problems that therapists must effectively evaluate and manage in the context of providing trauma-focused treatment. This manuscript describes practical strategies for managing behavior problems in the context of…
Working Memory Components and Problem-Solving Accuracy: Are There Multiple Pathways?
ERIC Educational Resources Information Center
Swanson, H. Lee; Fung, Wenson
2016-01-01
This study determined the working memory (WM) components (executive, phonological short-term memory [STM], and visual-spatial sketchpad) that best predicted mathematical word problem-solving accuracy in elementary schoolchildren (N = 392). The battery of tests administered to assess mediators between WM and problem-solving included measures of…
REACTT: an algorithm for solving spatial equilibrium problems.
D.J. Brooks; J. Kincaid
1987-01-01
The problem of determining equilibrium prices and quantities in spatially separated markets is reviewed. Algorithms that compute spatial equilibria are discussed. A computer program using the reactive programming algorithm for solving spatial equilibrium problems that involve multiple commodities is presented, along with detailed documentation. A sample data set,...
Middle School Engineering Problem Solving Using Traditional vs. E-PBL Module Instruction
ERIC Educational Resources Information Center
Baele, Loren C.
2017-01-01
This multiple methods (Denzin, 1978) study investigated two instructional approaches, traditional module and electronic Problem-Based Learning instruction (e-PBL), used within a middle school engineering classroom focused on the variables of engagement, content knowledge, student self-assessment and teacher assessment of problem solving solutions.…
ERIC Educational Resources Information Center
Ibrahim, Bashirah; Ding, Lin; Heckler, Andrew F.; White, Daniel R.; Badeau, Ryan
2017-01-01
We examine students' mathematical performance on quantitative "synthesis problems" with varying mathematical complexity. Synthesis problems are tasks comprising multiple concepts typically taught in different chapters. Mathematical performance refers to the formulation, combination, and simplification of equations. Generally speaking,…
SGML-Based Markup for Literary Texts: Two Problems and Some Solutions.
ERIC Educational Resources Information Center
Barnard, David; And Others
1988-01-01
Identifies the Standard Generalized Markup Language (SGML) as the best basis for a markup standard for encoding literary texts. Outlines solutions to problems using SGML and discusses the problem of maintaining multiple views of a document. Examines several ways of reducing the burden of markups. (GEA)
Munchausen Syndrome as Dermatitis Simulata
Hariharasubramony, Ambika; Chankramath, Sujatha; Srinivasa, Seema
2012-01-01
Psychiatric comorbidity is associated with many dermatological disorders. It may be the cause for skin problem or may be the effect of a skin problem as skin being a visual organ. A 28-year-old female presented with multiple red lesions on the skin with unusual morphology and was diagnosed as dermatitis simulata. She gave history of multiple episodes of similar illnesses with admissions in various hospitals and being evaluated and dropping off in between treatments. After detailed psychological evaluation, patient was diagnosed as case of Munchausen syndrome. PMID:22661819
DOE Office of Scientific and Technical Information (OSTI.GOV)
Plotnikov, Mikhail G
2011-02-11
Multiple Walsh series (S) on the group G{sup m} are studied. It is proved that every at most countable set is a uniqueness set for series (S) under convergence over cubes. The recovery problem is solved for the coefficients of series (S) that converge outside countable sets or outside sets of Dirichlet type. A number of analogues of the de la Vallee Poussin theorem are established for series (S). Bibliography: 28 titles.
Wave excitation at Lindblad resonances using the method of multiple scales
NASA Astrophysics Data System (ADS)
Horák, Jiří
2017-12-01
In this note, the method of multiple scales is adopted to the problem of excitation of non–axisymmetric acoustic waves in vertically integrated disk by tidal gravitational fields. We derive a formula describing a waveform of exited wave that is uniformly valid in a whole disk as long as only a single Lindblad resonance is present. Our formalism is subsequently applied to two classical problems: trapped p–mode oscillations in relativistic accretion disks and the excitation of waves in infinite disks.
Unstable and Multiple Child Care Arrangements and Young Children’s Behavior
Pilarz, Alejandra Ros; Hill, Heather D.
2015-01-01
Growing evidence suggests that child care instability is associated with child behavior problems, but existing studies confound different types of instability; use small, convenience samples; and/or control insufficiently for selection into child care arrangements. This study uses survey and calendar data from the Fragile Families and Child Well-Being Study to estimate the associations between three different types of child care instability—long-term instability, multiplicity, and the use of back-up arrangements—and children’s internalizing, externalizing, and prosocial behaviors at age 3, controlling for a large number of child and family background characteristics. Long-term instability between birth and age 3, as measured in both the survey and calendar data, is associated with higher levels of externalizing behavior problems. Current multiplicity at age 3 (as measured by survey data) is associated with higher levels of both externalizing and internalizing behavior problems, but stable multiplicity over time (as measured using calendar data) is not. Finally, the use of back-up arrangements at age 3 is associated with higher levels of internalizing behaviors. We find no consistent differences in these results by the timing of instability, child gender, family income, or type of care. PMID:25635158
Packing Boxes into Multiple Containers Using Genetic Algorithm
NASA Astrophysics Data System (ADS)
Menghani, Deepak; Guha, Anirban
2016-07-01
Container loading problems have been studied extensively in the literature and various analytical, heuristic and metaheuristic methods have been proposed. This paper presents two different variants of a genetic algorithm framework for the three-dimensional container loading problem for optimally loading boxes into multiple containers with constraints. The algorithms are designed so that it is easy to incorporate various constraints found in real life problems. The algorithms are tested on data of standard test cases from literature and are found to compare well with the benchmark algorithms in terms of utilization of containers. This, along with the ability to easily incorporate a wide range of practical constraints, makes them attractive for implementation in real life scenarios.
A centralized audio presentation manager
DOE Office of Scientific and Technical Information (OSTI.GOV)
Papp, A.L. III; Blattner, M.M.
1994-05-16
The centralized audio presentation manager addresses the problems which occur when multiple programs running simultaneously attempt to use the audio output of a computer system. Time dependence of sound means that certain auditory messages must be scheduled simultaneously, which can lead to perceptual problems due to psychoacoustic phenomena. Furthermore, the combination of speech and nonspeech audio is examined; each presents its own problems of perceptibility in an acoustic environment composed of multiple auditory streams. The centralized audio presentation manager receives abstract parameterized message requests from the currently running programs, and attempts to create and present a sonic representation in themore » most perceptible manner through the use of a theoretically and empirically designed rule set.« less
Simplified computational methods for elastic and elastic-plastic fracture problems
NASA Technical Reports Server (NTRS)
Atluri, Satya N.
1992-01-01
An overview is given of some of the recent (1984-1991) developments in computational/analytical methods in the mechanics of fractures. Topics covered include analytical solutions for elliptical or circular cracks embedded in isotropic or transversely isotropic solids, with crack faces being subjected to arbitrary tractions; finite element or boundary element alternating methods for two or three dimensional crack problems; a 'direct stiffness' method for stiffened panels with flexible fasteners and with multiple cracks; multiple site damage near a row of fastener holes; an analysis of cracks with bonded repair patches; methods for the generation of weight functions for two and three dimensional crack problems; and domain-integral methods for elastic-plastic or inelastic crack mechanics.
Interactive Reference Point Procedure Based on the Conic Scalarizing Function
2014-01-01
In multiobjective optimization methods, multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions. The conic scalarizing function is a general characterization of Benson proper efficient solutions of non-convex multiobjective problems in terms of saddle points of scalar Lagrangian functions. This approach preserves convexity. The conic scalarizing function, as a part of a posteriori or a priori methods, has successfully been applied to several real-life problems. In this paper, we propose a conic scalarizing function based interactive reference point procedure where the decision maker actively takes part in the solution process and directs the search according to her or his preferences. An algorithmic framework for the interactive solution of multiple objective optimization problems is presented and is utilized for solving some illustrative examples. PMID:24723795
Local search heuristic for the discrete leader-follower problem with multiple follower objectives
NASA Astrophysics Data System (ADS)
Kochetov, Yury; Alekseeva, Ekaterina; Mezmaz, Mohand
2016-10-01
We study a discrete bilevel problem, called as well as leader-follower problem, with multiple objectives at the lower level. It is assumed that constraints at the upper level can include variables of both levels. For such ill-posed problem we define feasible and optimal solutions for pessimistic case. A central point of this work is a two stage method to get a feasible solution under the pessimistic case, given a leader decision. The target of the first stage is a follower solution that violates the leader constraints. The target of the second stage is a pessimistic feasible solution. Each stage calls a heuristic and a solver for a series of particular mixed integer programs. The method is integrated inside a local search based heuristic that is designed to find near-optimal leader solutions.
MANGO: a new approach to multiple sequence alignment.
Zhang, Zefeng; Lin, Hao; Li, Ming
2007-01-01
Multiple sequence alignment is a classical and challenging task for biological sequence analysis. The problem is NP-hard. The full dynamic programming takes too much time. The progressive alignment heuristics adopted by most state of the art multiple sequence alignment programs suffer from the 'once a gap, always a gap' phenomenon. Is there a radically new way to do multiple sequence alignment? This paper introduces a novel and orthogonal multiple sequence alignment method, using multiple optimized spaced seeds and new algorithms to handle these seeds efficiently. Our new algorithm processes information of all sequences as a whole, avoiding problems caused by the popular progressive approaches. Because the optimized spaced seeds are provably significantly more sensitive than the consecutive k-mers, the new approach promises to be more accurate and reliable. To validate our new approach, we have implemented MANGO: Multiple Alignment with N Gapped Oligos. Experiments were carried out on large 16S RNA benchmarks showing that MANGO compares favorably, in both accuracy and speed, against state-of-art multiple sequence alignment methods, including ClustalW 1.83, MUSCLE 3.6, MAFFT 5.861, Prob-ConsRNA 1.11, Dialign 2.2.1, DIALIGN-T 0.2.1, T-Coffee 4.85, POA 2.0 and Kalign 2.0.
Brooks, Brian L; Mannix, Rebekah; Maxwell, Bruce; Zafonte, Ross; Berkner, Paul D; Iverson, Grant L
2016-12-01
There is increasing concern about the possible long-term effects of multiple concussions, particularly on the developing adolescent brain. Whether the effect of multiple concussions is detectable in high school football players has not been well studied, although the public health implications are great in this population. To determine if there are measureable differences in cognitive functioning or symptom reporting in high school football players with a history of multiple concussions. Cross-sectional study; Level of evidence, 3. Participants included 5232 male adolescent football players (mean [±SD] age, 15.5 ± 1.2 years) who completed baseline testing between 2009 and 2014. On the basis of injury history, athletes were grouped into 0 (n = 4183), 1 (n = 733), 2 (n = 216), 3 (n = 67), or ≥4 (n = 33) prior concussions. Cognitive functioning was measured by the Immediate Post-Concussion Assessment and Cognitive Testing (ImPACT) battery, and symptom ratings were obtained from the Post-Concussion Symptom Scale. There were no statistically significant differences between groups (based on the number of reported concussions) regarding cognitive functioning. Athletes with ≥3 prior concussions reported more symptoms than did athletes with 0 or 1 prior injury. In multivariate analyses, concussion history was independently related to symptom reporting but less so than developmental problems (eg, attention or learning problems) or other health problems (eg, past treatment for psychiatric problems, headaches, or migraines). In the largest study to date, high school football players with multiple past concussions performed the same on cognitive testing as those with no prior concussions. Concussion history was one of several factors that were independently related to symptom reporting. © 2016 The Author(s).
Multiple Past Concussions in High School Football Players
Brooks, Brian L.; Mannix, Rebekah; Maxwell, Bruce; Zafonte, Ross; Berkner, Paul D.; Iverson, Grant L.
2017-01-01
Background There is increasing concern about the possible long-term effects of multiple concussions, particularly on the developing adolescent brain. Whether the effect of multiple concussions is detectable in high school football players has not been well studied, although the public health implications are great in this population. Purpose To determine if there are measureable differences in cognitive functioning or symptom reporting in high school football players with a history of multiple concussions. Study Design Cross-sectional study; Level of evidence, 3. Methods Participants included 5232 male adolescent football players (mean [±SD] age, 15.5 ± 1.2 years) who completed baseline testing between 2009 and 2014. On the basis of injury history, athletes were grouped into 0 (n = 4183), 1 (n = 733), 2 (n = 216), 3 (n = 67), or ≥4 (n = 33) prior concussions. Cognitive functioning was measured by the Immediate Post-Concussion Assessment and Cognitive Testing (ImPACT) battery, and symptom ratings were obtained from the Post-Concussion Symptom Scale. Results There were no statistically significant differences between groups (based on the number of reported concussions) regarding cognitive functioning. Athletes with ≥3 prior concussions reported more symptoms than did athletes with 0 or 1 prior injury. In multivariate analyses, concussion history was independently related to symptom reporting but less so than developmental problems (eg, attention or learning problems) or other health problems (eg, past treatment for psychiatric problems, headaches, or migraines). Conclusion In the largest study to date, high school football players with multiple past concussions performed the same on cognitive testing as those with no prior concussions. Concussion history was one of several factors that were independently related to symptom reporting. PMID:27474382
Yu, Hualong; Hong, Shufang; Yang, Xibei; Ni, Jun; Dan, Yuanyuan; Qin, Bin
2013-01-01
DNA microarray technology can measure the activities of tens of thousands of genes simultaneously, which provides an efficient way to diagnose cancer at the molecular level. Although this strategy has attracted significant research attention, most studies neglect an important problem, namely, that most DNA microarray datasets are skewed, which causes traditional learning algorithms to produce inaccurate results. Some studies have considered this problem, yet they merely focus on binary-class problem. In this paper, we dealt with multiclass imbalanced classification problem, as encountered in cancer DNA microarray, by using ensemble learning. We utilized one-against-all coding strategy to transform multiclass to multiple binary classes, each of them carrying out feature subspace, which is an evolving version of random subspace that generates multiple diverse training subsets. Next, we introduced one of two different correction technologies, namely, decision threshold adjustment or random undersampling, into each training subset to alleviate the damage of class imbalance. Specifically, support vector machine was used as base classifier, and a novel voting rule called counter voting was presented for making a final decision. Experimental results on eight skewed multiclass cancer microarray datasets indicate that unlike many traditional classification approaches, our methods are insensitive to class imbalance.
Metcalfe, Arron W S; Campbell, Jamie I D
2011-05-01
Accurate measurement of cognitive strategies is important in diverse areas of psychological research. Strategy self-reports are a common measure, but C. Thevenot, M. Fanget, and M. Fayol (2007) proposed a more objective method to distinguish different strategies in the context of mental arithmetic. In their operand recognition paradigm, speed of recognition memory for problem operands after solving a problem indexes strategy (e.g., direct memory retrieval vs. a procedural strategy). Here, in 2 experiments, operand recognition time was the same following simple addition or multiplication, but, consistent with a wide variety of previous research, strategy reports indicated much greater use of procedures (e.g., counting) for addition than multiplication. Operation, problem size (e.g., 2 + 3 vs. 8 + 9), and operand format (digits vs. words) had interactive effects on reported procedure use that were not reflected in recognition performance. Regression analyses suggested that recognition time was influenced at least as much by the relative difficulty of the preceding problem as by the strategy used. The findings indicate that the operand recognition paradigm is not a reliable substitute for strategy reports and highlight the potential impact of difficulty-related carryover effects in sequential cognitive tasks.
Multiple graph regularized protein domain ranking.
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-11-19
Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Multiple graph regularized protein domain ranking
2012-01-01
Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331
Inference of emission rates from multiple sources using Bayesian probability theory.
Yee, Eugene; Flesch, Thomas K
2010-03-01
The determination of atmospheric emission rates from multiple sources using inversion (regularized least-squares or best-fit technique) is known to be very susceptible to measurement and model errors in the problem, rendering the solution unusable. In this paper, a new perspective is offered for this problem: namely, it is argued that the problem should be addressed as one of inference rather than inversion. Towards this objective, Bayesian probability theory is used to estimate the emission rates from multiple sources. The posterior probability distribution for the emission rates is derived, accounting fully for the measurement errors in the concentration data and the model errors in the dispersion model used to interpret the data. The Bayesian inferential methodology for emission rate recovery is validated against real dispersion data, obtained from a field experiment involving various source-sensor geometries (scenarios) consisting of four synthetic area sources and eight concentration sensors. The recovery of discrete emission rates from three different scenarios obtained using Bayesian inference and singular value decomposition inversion are compared and contrasted.
Dense fog on the highway: Visual range monitoring in cars?
NASA Technical Reports Server (NTRS)
Hahn, W.; Krichbaumer, W.; Streicher, J.; Werner, CH.
1992-01-01
This paper reports on the development of a new sensor. Laser range-finders are currently installed in cars and trucks to measure the distance to a proceeding car (LEICA). A modification of such a sensor to measure visibility was made. The problems that had to be solved were: (1) choice of wavelength with relation to the human eye for visibility measurements; (2) dependency of the wavelength on atmospheric turbidity; (3) laser eye-safety; and (4) influence of multiple scattering at visibilities smaller than 200 m. The wavelength used for lidar sensors in the near infrared presents no real problems because the object to be sensed is fog appearing white which means that scattering from fog is wavelength independent. There are however differences in backscatter-to-extinction ratio for different fog and weather situations. The two solutions to these problems are polarization and multiple scattering. As known from airport operations of a laser ceilometer, one can use this multiple scattering contribution to determine the visibility.
Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment
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
Alcohol Use Problems and Sexual Risk among Young Adult African American Mothers
Swartzendruber, Andrea; Sales, Jessica M.; Rose, Eve S.; DiClemente, Ralph J.
2015-01-01
Studies have documented high levels of alcohol use and sexual risk among young mothers. We examined parenting satisfaction and self-efficacy in relation to alcohol use problems and sexual risk among 346 young African American women enrolled in an HIV prevention trial, 41% (n=141) of whom were mothers. Among mothers, greater parenting satisfaction was associated with a reduced likelihood of problematic alcohol use, having multiple sex partners, and testing positive for Trichomonas vaginalis. Relative to non-parenting women, mothers reported lower condom use. Compared to non-parenting women, mothers with the highest parenting satisfaction reported fewer alcohol use problems; mothers with the lowest parenting satisfaction reported lower condom use and were more likely to have multiple partners and test positive for T. vaginalis. Parenting self-efficacy was not associated with the outcomes examined. Future research investigating relationships between parenting satisfaction, alcohol use and sexual risk may be useful for improving multiple maternal health outcomes. PMID:26499334
Analysis of Slope Limiters on Irregular Grids
NASA Technical Reports Server (NTRS)
Berger, Marsha; Aftosmis, Michael J.
2005-01-01
This paper examines the behavior of flux and slope limiters on non-uniform grids in multiple dimensions. Many slope limiters in standard use do not preserve linear solutions on irregular grids impacting both accuracy and convergence. We rewrite some well-known limiters to highlight their underlying symmetry, and use this form to examine the proper - ties of both traditional and novel limiter formulations on non-uniform meshes. A consistent method of handling stretched meshes is developed which is both linearity preserving for arbitrary mesh stretchings and reduces to common limiters on uniform meshes. In multiple dimensions we analyze the monotonicity region of the gradient vector and show that the multidimensional limiting problem may be cast as the solution of a linear programming problem. For some special cases we present a new directional limiting formulation that preserves linear solutions in multiple dimensions on irregular grids. Computational results using model problems and complex three-dimensional examples are presented, demonstrating accuracy, monotonicity and robustness.
Algorithmic Perspectives on Problem Formulations in MDO
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia M.; Lewis, Robert Michael
2000-01-01
This work is concerned with an approach to formulating the multidisciplinary optimization (MDO) problem that reflects an algorithmic perspective on MDO problem solution. The algorithmic perspective focuses on formulating the problem in light of the abilities and inabilities of optimization algorithms, so that the resulting nonlinear programming problem can be solved reliably and efficiently by conventional optimization techniques. We propose a modular approach to formulating MDO problems that takes advantage of the problem structure, maximizes the autonomy of implementation, and allows for multiple easily interchangeable problem statements to be used depending on the available resources and the characteristics of the application problem.
Multiple Learning Tracks: For Training Multinational Managers
ERIC Educational Resources Information Center
Harvey, Michael G.; Kerin, Roger A.
1977-01-01
The problem of identifying and training college students to be effective multinational marketing managers is investigated in three parts: (1) Identification of multinational manager attributes, (2) selection of multinational managers, and (3) multiple "track" training programs. (TA)
Developing Image Processing Meta-Algorithms with Data Mining of Multiple Metrics
Cunha, Alexandre; Toga, A. W.; Parker, D. Stott
2014-01-01
People often use multiple metrics in image processing, but here we take a novel approach of mining the values of batteries of metrics on image processing results. We present a case for extending image processing methods to incorporate automated mining of multiple image metric values. Here by a metric we mean any image similarity or distance measure, and in this paper we consider intensity-based and statistical image measures and focus on registration as an image processing problem. We show how it is possible to develop meta-algorithms that evaluate different image processing results with a number of different metrics and mine the results in an automated fashion so as to select the best results. We show that the mining of multiple metrics offers a variety of potential benefits for many image processing problems, including improved robustness and validation. PMID:24653748
Li, Guo; Lv, Fei; Guan, Xu
2014-01-01
This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment.
NASA Technical Reports Server (NTRS)
Deepak, A.; Fluellen, A.
1978-01-01
An efficient numerical method of multiple quadratures, the Conroy method, is applied to the problem of computing multiple scattering contributions in the radiative transfer through realistic planetary atmospheres. A brief error analysis of the method is given and comparisons are drawn with the more familiar Monte Carlo method. Both methods are stochastic problem-solving models of a physical or mathematical process and utilize the sampling scheme for points distributed over a definite region. In the Monte Carlo scheme the sample points are distributed randomly over the integration region. In the Conroy method, the sample points are distributed systematically, such that the point distribution forms a unique, closed, symmetrical pattern which effectively fills the region of the multidimensional integration. The methods are illustrated by two simple examples: one, of multidimensional integration involving two independent variables, and the other, of computing the second order scattering contribution to the sky radiance.
MSClique: Multiple Structure Discovery through the Maximum Weighted Clique Problem.
Sanroma, Gerard; Penate-Sanchez, Adrian; Alquézar, René; Serratosa, Francesc; Moreno-Noguer, Francesc; Andrade-Cetto, Juan; González Ballester, Miguel Ángel
2016-01-01
We present a novel approach for feature correspondence and multiple structure discovery in computer vision. In contrast to existing methods, we exploit the fact that point-sets on the same structure usually lie close to each other, thus forming clusters in the image. Given a pair of input images, we initially extract points of interest and extract hierarchical representations by agglomerative clustering. We use the maximum weighted clique problem to find the set of corresponding clusters with maximum number of inliers representing the multiple structures at the correct scales. Our method is parameter-free and only needs two sets of points along with their tentative correspondences, thus being extremely easy to use. We demonstrate the effectiveness of our method in multiple-structure fitting experiments in both publicly available and in-house datasets. As shown in the experiments, our approach finds a higher number of structures containing fewer outliers compared to state-of-the-art methods.
Lv, Fei; Guan, Xu
2014-01-01
This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment. PMID:24892104
ERIC Educational Resources Information Center
Milburn, Kristine M.
2011-01-01
Problem: An increasing number of high-achieving American high school students are enrolling in multiple Advanced Placement (AP) courses. As a result, high schools face a growing need to understand the impact of taking multiple AP courses concurrently on the social-emotional lives of high-achieving students. Procedures: This phenomenological…
Missing Data and Multiple Imputation in the Context of Multivariate Analysis of Variance
ERIC Educational Resources Information Center
Finch, W. Holmes
2016-01-01
Multivariate analysis of variance (MANOVA) is widely used in educational research to compare means on multiple dependent variables across groups. Researchers faced with the problem of missing data often use multiple imputation of values in place of the missing observations. This study compares the performance of 2 methods for combining p values in…
Lexicographic goal programming and assessment tools for a combinatorial production problem.
DOT National Transportation Integrated Search
2008-01-01
NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques including : heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate : comparison of these solution technique...
The Eyes Have It: A Problem-Based Learning Exercise in Molecular Evolution
ERIC Educational Resources Information Center
White, Harold B.
2007-01-01
Molecular evolution provides an interesting context in which to use problem-based learning because it integrates a variety of topics in biology, biochemistry, and molecular biology. This three-stage problem for advanced students deals with the structure, multiple functions, and properties of lactate dehydrogenase isozymes, and the related…
Developing a Problem-Based Learning Simulation: An Economics Unit on Trade
ERIC Educational Resources Information Center
Maxwell, Nan L.; Mergendoller, John R.; Bellisimo, Yolanda
2004-01-01
This article argues that the merger of simulations and problem-based learning (PBL) can enhance both active-learning strategies. Simulations benefit by using a PBL framework to promote student-directed learning and problem-solving skills to explain a simulated dilemma with multiple solutions. PBL benefits because simulations structure the…
Recent advances in applying decision science to managing national forests
Bruce G. Marcot; Matthew P. Thompson; Michael C. Runge; Frank R. Thompson; Steven McNulty; David Cleaves; Monica Tomosy; Larry A. Fisher; Andrew Bliss
2012-01-01
Management of federal public forests to meet sustainability goals and multiple use regulations is an immense challenge. To succeed, we suggest use of formal decision science procedures and tools in the context of structured decision making (SDM). SDM entails four stages: problem structuring (framing the problem and defining objectives and evaluation criteria), problem...
The Legacy of Hobbs and Gray: Research on the Development and Prevention of Conduct Problems.
ERIC Educational Resources Information Center
Dodge, Kenneth A.
1996-01-01
Describes research on the development of chronic conduct problems in childhood and adolescence, examining a multiple risk-factor model that includes biological predispositions, ecological context, family processes, peer influences, academic performance, and social information processing as factors leading to conduct problems. The paper describes a…
ERIC Educational Resources Information Center
Rispoli, Mandy; Camargo, Síglia; Machalicek, Wendy; Lang, Russell; Sigafoos, Jeff
2014-01-01
This study evaluated the assessment and treatment of problem behaviors related to rituals for children with autism. After functional analyses, we used a multiple-probe design to examine the effects of functional communication training (FCT) plus extinction and schedule thinning as a treatment package for problem behavior and appropriate…
Using Quotitive Division Problems to Promote Place-Value Understanding
ERIC Educational Resources Information Center
Bicknell, Brenda; Young-Loveridge, Jenny; Simpson, Jackie
2017-01-01
A robust understanding of place value is essential. Using a problem-based approach set within meaningful contexts, students' attention may be drawn to the multiplicative structure of place value. By using quotitive division problems through a concrete-representational-abstract lesson structure, this study showed a powerful strengthening of Year 3…
Preservice Middle and High School Mathematics Teachers' Strategies When Solving Proportion Problems
ERIC Educational Resources Information Center
Arican, Muhammet
2018-01-01
The purpose of this study was to investigate eight preservice middle and high school mathematics teachers' solution strategies when solving single and multiple proportion problems. Real-world missing-value word problems were used in an interview setting to collect information about preservice teachers' (PSTs) reasoning about proportional…
An Introduction to Multilinear Formula Score Theory. Measurement Series 84-4.
ERIC Educational Resources Information Center
Levine, Michael V.
Formula score theory (FST) associates each multiple choice test with a linear operator and expresses all of the real functions of item response theory as linear combinations of the operator's eigenfunctions. Hard measurement problems can then often be reformulated as easier, standard mathematical problems. For example, the problem of estimating…
Analytical Derivation: An Epistemic Game for Solving Mathematically Based Physics Problems
ERIC Educational Resources Information Center
Bajracharya, Rabindra R.; Thompson, John R.
2016-01-01
Problem solving, which often involves multiple steps, is an integral part of physics learning and teaching. Using the perspective of the epistemic game, we documented a specific game that is commonly pursued by students while solving mathematically based physics problems: the "analytical derivation" game. This game involves deriving an…
Developing Procedural Flexibility: Are Novices Prepared to Learn from Comparing Procedures?
ERIC Educational Resources Information Center
Rittle-Johnson, Bethany; Star, Jon R.; Durkin, Kelley
2012-01-01
Background: A key learning outcome in problem-solving domains is the development of procedural flexibility, where learners know multiple procedures and use them appropriately to solve a range of problems (e.g., Verschaffel, Luwel, Torbeyns, & Van Dooren, 2009). However, students often fail to become flexible problem solvers in mathematics. To…
Wraparound: As a Tertiary Level Intervention for Students with Emotional/Behavioral Needs
ERIC Educational Resources Information Center
Eber, Lucille; Breen, Kimberli; Rose, Jennifer; Unizycki, Renee M.; London, Tasha H.
2008-01-01
If a student has multiple behavior problems that escalate over time and across different settings, school-based problem-solving teams can become quickly overwhelmed, especially when educators identify "setting events" for problem behaviors that have occurred outside of school and are beyond the control of school personnel. Instead of resorting to…
Peer Relationship Problems of Children with AD/HD: Risk Factors and New Directions in Interventions
ERIC Educational Resources Information Center
Ozdemir, Selda
2009-01-01
This review integrates and evaluates research conducted on possible contributing factors to peer relationship problems of children with attention deficit/hyperactivity disorder (AD/HD). Substantial evidence suggests that children with AD/HD have serious problems in multiple aspects of their relationships with peers. Difficulties resulting from…
Miranda, Jenniffer K; de la Osa, Nuria; Granero, Roser; Ezpeleta, Lourdes
2013-09-01
The aim of the study was to examine whether maternal depression, mothers' and fathers' parenting, child physical punishment and negative life events (NLE) mediate the effect of maternal childhood abuse (CA), intimate partner violence (IPV) and cumulative violence (both CA and IPV) on Spanish children's and adolescents' psychopathology. Furthermore, multiple mediator models examine whether IPV mediates the effect of CA on the contextual and family factors mentioned above. Three hundred and eighteen Spanish outpatients aged 7 to 18 and their parents were assessed using a structured interview and other instruments for measuring the study variables. Structural equation models (SEMs) showed multiple pathways explaining psychopathological problems among offspring of mothers who suffered CA, IPV and both of these violent experiences. In particular, mothers' depression mediated the link between maternal CA, IPV, cumulative violence and children's externalizing, and total behavior problems. Child NLE was an important pathway between maternal CA and total behavior problems, as well as between cumulative violence and both externalizing and total problems. IPV contributed to explaining the link between maternal CA and contextual and family factors, such as child physical punishment and NLE, which were in turn, associated with children's behavior problems. Findings show the complex interconnections between different types of violence and their harmful effects on the mental health of women and their offspring, as well as the need to extend our knowledge on this subject.
Psidium guajava: A Single Plant for Multiple Health Problems of Rural Indian Population
Daswani, Poonam G.; Gholkar, Manasi S.; Birdi, Tannaz J.
2017-01-01
The rural population in India faces a number of health problems and often has to rely on local remedies. Psidium guajava Linn. (guava), a tropical plant which is used as food and medicine can be used by rural communities due to its several medicinal properties. A literature search was undertaken to gauge the rural health scenario in India and compile the available literature on guava so as to reflect its usage in the treatment of multiple health conditions prevalent in rural communities. Towards this, electronic databases such as Pubmed, Science Direct, google scholar were scanned. Information on clinical trials on guava was obtained from Cochrane Central Register of Controlled Trials and Clinicaltrial.gov. The literature survey revealed that guava possesses various medicinal properties which have been reported from across the globe in the form of ethnobotanical/ethnopharmacological surveys, laboratory investigations and clinical trials. Besides documenting the safety of guava, the available literature shows that guava is efficacious against the following conditions which rural communities would encounter. (a) Gastrointestinal infections; (b) Malaria; (c)Respiratory infections; (d) Oral/dental infections; (e) Skin infections; (f) Diabetes; (g) Cardiovascular/hypertension; (h) Cancer; (i) Malnutrition; (j) Women problems; (k) Pain; (l) Fever; (m) Liver problems; (n) Kidney problems. In addition, guava can also be useful for treatment of animals and explored for its commercial applications. In conclusion, popularization of guava, can have multiple applications for rural communities. PMID:28989253
Tang, Fengyan; Jang, Heejung; Lingler, Jennifer; Tamres, Lisa K.; Erlen, Judith A.
2016-01-01
Caring for an older adult with memory loss is stressful. Caregiver stress could produce negative outcomes such as depression. Previous research is limited in examining multiple intermediate pathways from caregiver stress to depressive symptoms. This study addresses this limitation by examining the role of self-efficacy, social support, and problem-solving in mediating the relationships between caregiver stressors and depressive symptoms. Using a sample of 91 family caregivers, we tested simultaneously multiple mediators between caregiver stressors and depression. Results indicate that self-efficacy mediated the pathway from daily hassles to depression. Findings point to the importance of improving self-efficacy in psychosocial interventions for caregivers of older adults with memory loss. PMID:26317766
Multiple object tracking using the shortest path faster association algorithm.
Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin
2014-01-01
To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.
Multiple Object Tracking Using the Shortest Path Faster Association Algorithm
Liu, Heping; Liu, Huaping; Yang, Bin
2014-01-01
To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322
Alimovic, S
2013-02-01
Children with multiple impairments have more complex developmental problems than children with a single impairment. We compared children, aged 4 to 11 years, with intellectual disability (ID) and visual impairment to children with single ID, single visual impairment and typical development on 'Child Behavior Check List/4-18' (CBCL/4-18), Parent Report. Children with ID and visual impairment had more emotional and behavioural problems than other groups of children: with single impairment and with typical development (F = 23.81; d.f.1/d.f.2 = 3/156; P < 0.001). All children with special needs had more emotional and behavioural problems than children with typical development. The highest difference was found in attention problems syndrome (F = 30.45; d.f.1/d.f.2 = 3/156; P < 0.001) where all groups of children with impairments had more problems. Children with visual impairment, with and without ID, had more somatic complaints than children with normal vision. Intellectual disability had greater influence on prevalence and kind of emotional and behavioural problems in children than visual impairment. © 2012 The Author. Journal of Intellectual Disability Research © 2012 Blackwell Publishing Ltd.
Francoeur, Richard B
2015-01-01
Background The majority of patients with advanced cancer experience symptom pairs or clusters among pain, fatigue, and insomnia. Improved methods are needed to detect and interpret interactions among symptoms or diesease markers to reveal influential pairs or clusters. In prior work, I developed and validated sequential residual centering (SRC), a method that improves the sensitivity of multiple regression to detect interactions among predictors, by conditioning for multicollinearity (shared variation) among interactions and component predictors. Materials and methods Using a hypothetical three-way interaction among pain, fatigue, and sleep to predict depressive affect, I derive and explain SRC multiple regression. Subsequently, I estimate raw and SRC multiple regressions using real data for these symptoms from 268 palliative radiation outpatients. Results Unlike raw regression, SRC reveals that the three-way interaction (pain × fatigue/weakness × sleep problems) is statistically significant. In follow-up analyses, the relationship between pain and depressive affect is aggravated (magnified) within two partial ranges: 1) complete-to-some control over fatigue/weakness when there is complete control over sleep problems (ie, a subset of the pain–fatigue/weakness symptom pair), and 2) no control over fatigue/weakness when there is some-to-no control over sleep problems (ie, a subset of the pain–fatigue/weakness–sleep problems symptom cluster). Otherwise, the relationship weakens (buffering) as control over fatigue/weakness or sleep problems diminishes. Conclusion By reducing the standard error, SRC unmasks a three-way interaction comprising a symptom pair and cluster. Low-to-moderate levels of the moderator variable for fatigue/weakness magnify the relationship between pain and depressive affect. However, when the comoderator variable for sleep problems accompanies fatigue/weakness, only frequent or unrelenting levels of both symptoms magnify the relationship. These findings suggest that a countervailing mechanism involving depressive affect could account for the effectiveness of a cognitive behavioral intervention to reduce the severity of a pain, fatigue, and sleep disturbance cluster in a previous randomized trial. PMID:25565865
Francoeur, Richard B
2015-01-01
The majority of patients with advanced cancer experience symptom pairs or clusters among pain, fatigue, and insomnia. Improved methods are needed to detect and interpret interactions among symptoms or diesease markers to reveal influential pairs or clusters. In prior work, I developed and validated sequential residual centering (SRC), a method that improves the sensitivity of multiple regression to detect interactions among predictors, by conditioning for multicollinearity (shared variation) among interactions and component predictors. Using a hypothetical three-way interaction among pain, fatigue, and sleep to predict depressive affect, I derive and explain SRC multiple regression. Subsequently, I estimate raw and SRC multiple regressions using real data for these symptoms from 268 palliative radiation outpatients. Unlike raw regression, SRC reveals that the three-way interaction (pain × fatigue/weakness × sleep problems) is statistically significant. In follow-up analyses, the relationship between pain and depressive affect is aggravated (magnified) within two partial ranges: 1) complete-to-some control over fatigue/weakness when there is complete control over sleep problems (ie, a subset of the pain-fatigue/weakness symptom pair), and 2) no control over fatigue/weakness when there is some-to-no control over sleep problems (ie, a subset of the pain-fatigue/weakness-sleep problems symptom cluster). Otherwise, the relationship weakens (buffering) as control over fatigue/weakness or sleep problems diminishes. By reducing the standard error, SRC unmasks a three-way interaction comprising a symptom pair and cluster. Low-to-moderate levels of the moderator variable for fatigue/weakness magnify the relationship between pain and depressive affect. However, when the comoderator variable for sleep problems accompanies fatigue/weakness, only frequent or unrelenting levels of both symptoms magnify the relationship. These findings suggest that a countervailing mechanism involving depressive affect could account for the effectiveness of a cognitive behavioral intervention to reduce the severity of a pain, fatigue, and sleep disturbance cluster in a previous randomized trial.
Duncombe, Melissa E; Havighurst, Sophie S; Holland, Kerry A; Frankling, Emma J
2012-10-01
The goal of this study was to examine the impact of different parenting characteristics on child disruptive behavior and emotional regulation among a sample of at-risk children. The sample consisted of 373 Australian 5- to 9-year-old children who were screened for serious behavior problems. Seven parenting variables based on self-report were evaluated, involving parenting practices, emotion beliefs and behaviors, emotion expressiveness, and mental health. Outcome variables based on parent/teacher report were child disruptive behavior problems and emotion regulatory ability. When entered simultaneously in a multiple regression analysis, inconsistent discipline, negative parental emotional expressiveness, and parent mental health demonstrated the strongest relationship to disruptive behavior problems and problems with emotion regulation. The data presented here elucidate multiple risk pathways to disruptive behavior disorders and can inform the design of prevention and early intervention programs.
Multi-trip vehicle routing and scheduling problem with time window in real life
NASA Astrophysics Data System (ADS)
Sze, San-Nah; Chiew, Kang-Leng; Sze, Jeeu-Fong
2012-09-01
This paper studies a manpower scheduling problem with multiple maintenance operations and vehicle routing considerations. Service teams located at a common service centre are required to travel to different customer sites. All customers must be served within given time window, which are known in advance. The scheduling process must take into consideration complex constraints such as a meal break during the team's shift, multiple travelling trips, synchronisation of service teams and working shifts. The main objective of this study is to develop a heuristic that can generate high quality solution in short time for large problem instances. A Two-stage Scheduling Heuristic is developed for different variants of the problem. Empirical results show that the proposed solution performs effectively and efficiently. In addition, our proposed approximation algorithm is very flexible and can be easily adapted to different scheduling environments and operational requirements.
Analysis of Classes of Singular Steady State Reaction Diffusion Equations
NASA Astrophysics Data System (ADS)
Son, Byungjae
We study positive radial solutions to classes of steady state reaction diffusion problems on the exterior of a ball with both Dirichlet and nonlinear boundary conditions. We study both Laplacian as well as p-Laplacian problems with reaction terms that are p-sublinear at infinity. We consider both positone and semipositone reaction terms and establish existence, multiplicity and uniqueness results. Our existence and multiplicity results are achieved by a method of sub-supersolutions and uniqueness results via a combination of maximum principles, comparison principles, energy arguments and a-priori estimates. Our results significantly enhance the literature on p-sublinear positone and semipositone problems. Finally, we provide exact bifurcation curves for several one-dimensional problems. In the autonomous case, we extend and analyze a quadrature method, and in the nonautonomous case, we employ shooting methods. We use numerical solvers in Mathematica to generate the bifurcation curves.
Hughes, James Alexander; Houghten, Sheridan; Ashlock, Daniel
2016-12-01
DNA Fragment assembly - an NP-Hard problem - is one of the major steps in of DNA sequencing. Multiple strategies have been used for this problem, including greedy graph-based algorithms, deBruijn graphs, and the overlap-layout-consensus approach. This study focuses on the overlap-layout-consensus approach. Heuristics and computational intelligence methods are combined to exploit their respective benefits. These algorithm combinations were able to produce high quality results surpassing the best results obtained by a number of competitive algorithms specially designed and tuned for this problem on thirteen of sixteen popular benchmarks. This work also reinforces the necessity of using multiple search strategies as it is clearly observed that algorithm performance is dependent on problem instance; without a deeper look into many searches, top solutions could be missed entirely. Copyright © 2016. Published by Elsevier Ireland Ltd.
NASA Technical Reports Server (NTRS)
Fymat, A. L.
1976-01-01
The paper studies the inversion of the radiative transfer equation describing the interaction of electromagnetic radiation with atmospheric aerosols. The interaction can be considered as the propagation in the aerosol medium of two light beams: the direct beam in the line-of-sight attenuated by absorption and scattering, and the diffuse beam arising from scattering into the viewing direction, which propagates more or less in random fashion. The latter beam has single scattering and multiple scattering contributions. In the former case and for single scattering, the problem is reducible to first-kind Fredholm equations, while for multiple scattering it is necessary to invert partial integrodifferential equations. A nonlinear minimization search method, applicable to the solution of both types of problems has been developed, and is applied here to the problem of monitoring aerosol pollution, namely the complex refractive index and size distribution of aerosol particles.
Renal cortex segmentation using optimal surface search with novel graph construction.
Li, Xiuli; Chen, Xinjian; Yao, Jianhua; Zhang, Xing; Tian, Jie
2011-01-01
In this paper, we propose a novel approach to solve the renal cortex segmentation problem, which has rarely been studied. In this study, the renal cortex segmentation problem is handled as a multiple-surfaces extraction problem, which is solved using the optimal surface search method. We propose a novel graph construction scheme in the optimal surface search to better accommodate multiple surfaces. Different surface sub-graphs are constructed according to their properties, and inter-surface relationships are also modeled in the graph. The proposed method was tested on 17 clinical CT datasets. The true positive volume fraction (TPVF) and false positive volume fraction (FPVF) are 74.10% and 0.08%, respectively. The experimental results demonstrate the effectiveness of the proposed method.
How did you guess? Or, what do multiple-choice questions measure?
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.
Stencils and problem partitionings: Their influence on the performance of multiple processor systems
NASA Technical Reports Server (NTRS)
Reed, D. A.; Adams, L. M.; Patrick, M. L.
1986-01-01
Given a discretization stencil, partitioning the problem domain is an important first step for the efficient solution of partial differential equations on multiple processor systems. Partitions are derived that minimize interprocessor communication when the number of processors is known a priori and each domain partition is assigned to a different processor. This partitioning technique uses the stencil structure to select appropriate partition shapes. For square problem domains, it is shown that non-standard partitions (e.g., hexagons) are frequently preferable to the standard square partitions for a variety of commonly used stencils. This investigation is concluded with a formalization of the relationship between partition shape, stencil structure, and architecture, allowing selection of optimal partitions for a variety of parallel systems.
Large neighborhood search for the double traveling salesman problem with multiple stacks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bent, Russell W; Van Hentenryck, Pascal
This paper considers a complex real-life short-haul/long haul pickup and delivery application. The problem can be modeled as double traveling salesman problem (TSP) in which the pickups and the deliveries happen in the first and second TSPs respectively. Moreover, the application features multiple stacks in which the items must be stored and the pickups and deliveries must take place in reserve (LIFO) order for each stack. The goal is to minimize the total travel time satisfying these constraints. This paper presents a large neighborhood search (LNS) algorithm which improves the best-known results on 65% of the available instances and ismore » always within 2% of the best-known solutions.« less
Identification Problems in Personality Psychology1
Borghans, Lex; Golsteyn, Bart H. H.; Heckman, James; Humphries, John Eric
2011-01-01
This paper discusses and illustrates identification problems in personality psychology. The measures used by psychologists to infer traits are based on behaviors, broadly defined. These behaviors are produced from multiple traits interacting with incentives in situations. In general, measures are determined by these multiple traits and do not identify any particular trait unless incentives and other traits are controlled for. Using two data sets, we show, as an example, that substantial portions of the variance in achievement test scores and grades, which are often used as measures of cognition, are explained by personality variables. PMID:21731170
Research on air and missile defense task allocation based on extended contract net protocol
NASA Astrophysics Data System (ADS)
Zhang, Yunzhi; Wang, Gang
2017-10-01
Based on the background of air and missile defense distributed element corporative engagement, the interception task allocation problem of multiple weapon units with multiple targets under network condition is analyzed. Firstly, a mathematical model of task allocation is established by combat task decomposition. Secondly, the initialization assignment based on auction contract and the adjustment allocation scheme based on swap contract were introduced to the task allocation. Finally, through the simulation calculation of typical situation, the model can be used to solve the task allocation problem in complex combat environment.
Effect of multiplicative noise on stationary stochastic process
NASA Astrophysics Data System (ADS)
Kargovsky, A. V.; Chikishev, A. Yu.; Chichigina, O. A.
2018-03-01
An open system that can be analyzed using the Langevin equation with multiplicative noise is considered. The stationary state of the system results from a balance of deterministic damping and random pumping simulated as noise with controlled periodicity. The dependence of statistical moments of the variable that characterizes the system on parameters of the problem is studied. A nontrivial decrease in the mean value of the main variable with an increase in noise stochasticity is revealed. Applications of the results in several physical, chemical, biological, and technical problems of natural and humanitarian sciences are discussed.
NASA Astrophysics Data System (ADS)
Li, L. L.; Jin, C. L.; Ge, X.
2018-01-01
In this paper, the output regulation problem with dissipative property for a class of switched stochastic delay systems is investigated, based on an error-dependent switching law. Under the assumption that none subsystem is solvable for the problem, a sufficient condition is derived by structuring multiple Lyapunov-Krasovskii functionals with respect to multiple supply rates, via designing error feedback regulators. The condition is also established when dissipative property reduces to passive property. Finally, two numerical examples are given to demonstrate the feasibility and efficiency of the present method.
2015-12-15
UXO community . NAME Total Number: PERCENT_SUPPORTEDNAME FTE Equivalent: Total Number: Irma Shamatava 0.50 0.50 1 Resolving and Discriminating...Distinguishing an object of interest from innocuous items is the main problem that the UXO community is facing currently. This inverse problem...innocuous items is the main problem that the UXO community is facing currently. This inverse problem demands fast and accurate representation of
2014-03-27
asymptotically equal. Carlsson shows that the problem is solved by treating each subregion Ri as a traveling salesman problem (TSP) with a set of points that...terminal state to the goal. If no- travel zones are repre- sented as the union of regions Akx > Bk, the coverage problem can be expressed as an IP [14...3 1.2 Problem Statement
Optimal Rate Schedules with Data Sharing in Energy Harvesting Communication Systems.
Wu, Weiwei; Li, Huafan; Shan, Feng; Zhao, Yingchao
2017-12-20
Despite the abundant research on energy-efficient rate scheduling polices in energy harvesting communication systems, few works have exploited data sharing among multiple applications to further enhance the energy utilization efficiency, considering that the harvested energy from environments is limited and unstable. In this paper, to overcome the energy shortage of wireless devices at transmitting data to a platform running multiple applications/requesters, we design rate scheduling policies to respond to data requests as soon as possible by encouraging data sharing among data requests and reducing the redundancy. We formulate the problem as a transmission completion time minimization problem under constraints of dynamical data requests and energy arrivals. We develop offline and online algorithms to solve this problem. For the offline setting, we discover the relationship between two problems: the completion time minimization problem and the energy consumption minimization problem with a given completion time. We first derive the optimal algorithm for the min-energy problem and then adopt it as a building block to compute the optimal solution for the min-completion-time problem. For the online setting without future information, we develop an event-driven online algorithm to complete the transmission as soon as possible. Simulation results validate the efficiency of the proposed algorithm.
Optimal Rate Schedules with Data Sharing in Energy Harvesting Communication Systems
Wu, Weiwei; Li, Huafan; Shan, Feng; Zhao, Yingchao
2017-01-01
Despite the abundant research on energy-efficient rate scheduling polices in energy harvesting communication systems, few works have exploited data sharing among multiple applications to further enhance the energy utilization efficiency, considering that the harvested energy from environments is limited and unstable. In this paper, to overcome the energy shortage of wireless devices at transmitting data to a platform running multiple applications/requesters, we design rate scheduling policies to respond to data requests as soon as possible by encouraging data sharing among data requests and reducing the redundancy. We formulate the problem as a transmission completion time minimization problem under constraints of dynamical data requests and energy arrivals. We develop offline and online algorithms to solve this problem. For the offline setting, we discover the relationship between two problems: the completion time minimization problem and the energy consumption minimization problem with a given completion time. We first derive the optimal algorithm for the min-energy problem and then adopt it as a building block to compute the optimal solution for the min-completion-time problem. For the online setting without future information, we develop an event-driven online algorithm to complete the transmission as soon as possible. Simulation results validate the efficiency of the proposed algorithm. PMID:29261135
A Design Study to Develop Young Children's Understanding of Multiplication and Division
ERIC Educational Resources Information Center
Bicknell, Brenda; Young-Loveridge, Jenny; Nguyen, Nhung
2016-01-01
This design study investigated the use of multiplication and division problems to help 5-year-old children develop an early understanding of multiplication and division. One teacher and her class of 15 5-year-old children were involved in a collaborative partnership with the researchers. The design study was conducted over two 4-week periods in…
ERIC Educational Resources Information Center
Codding, Robin S.; Archer, Jillian; Connell, James
2010-01-01
The purpose of this study was to replicate and extend a previous study by Burns ("Education and Treatment of Children" 28: 237-249, 2005) examining the effectiveness of incremental rehearsal on computation performance. A multiple-probe design across multiplication problem sets was employed for one participant to examine digits correct per minute…
A design study to develop young children's understanding of multiplication and division
NASA Astrophysics Data System (ADS)
Bicknell, Brenda; Young-Loveridge, Jenny; Nguyen, Nhung
2016-12-01
This design study investigated the use of multiplication and division problems to help 5-year-old children develop an early understanding of multiplication and division. One teacher and her class of 15 5-year-old children were involved in a collaborative partnership with the researchers. The design study was conducted over two 4-week periods in May-June and October-November. The focus in this article is on three key aspects of classroom teaching: instructional tasks, the use of representations, and discourse, including the mathematics register. Results from selected pre- and post-assessment tasks within a diagnostic interview showed that there were improvements in addition and subtraction as well as multiplication and division, even though the teaching had used multiplication and division problems. Students made progress on all four operational domains, with effect sizes ranging from approximately two thirds of a standard deviation to 2 standard deviations. Most of the improvement in students' number strategies was in moving from `counting all' to `counting on' and `skip counting'. The findings challenge the idea that learning experiences in addition and subtraction should precede those in multiplication and division as suggested in some curriculum documents.
NASA Astrophysics Data System (ADS)
Kodali, Anuradha
In this thesis, we develop dynamic multiple fault diagnosis (DMFD) algorithms to diagnose faults that are sporadic and coupled. Firstly, we formulate a coupled factorial hidden Markov model-based (CFHMM) framework to diagnose dependent faults occurring over time (dynamic case). Here, we implement a mixed memory Markov coupling model to determine the most likely sequence of (dependent) fault states, the one that best explains the observed test outcomes over time. An iterative Gauss-Seidel coordinate ascent optimization method is proposed for solving the problem. A soft Viterbi algorithm is also implemented within the framework for decoding dependent fault states over time. We demonstrate the algorithm on simulated and real-world systems with coupled faults; the results show that this approach improves the correct isolation rate as compared to the formulation where independent fault states are assumed. Secondly, we formulate a generalization of set-covering, termed dynamic set-covering (DSC), which involves a series of coupled set-covering problems over time. The objective of the DSC problem is to infer the most probable time sequence of a parsimonious set of failure sources that explains the observed test outcomes over time. The DSC problem is NP-hard and intractable due to the fault-test dependency matrix that couples the failed tests and faults via the constraint matrix, and the temporal dependence of failure sources over time. Here, the DSC problem is motivated from the viewpoint of a dynamic multiple fault diagnosis problem, but it has wide applications in operations research, for e.g., facility location problem. Thus, we also formulated the DSC problem in the context of a dynamically evolving facility location problem. Here, a facility can be opened, closed, or can be temporarily unavailable at any time for a given requirement of demand points. These activities are associated with costs or penalties, viz., phase-in or phase-out for the opening or closing of a facility, respectively. The set-covering matrix encapsulates the relationship among the rows (tests or demand points) and columns (faults or locations) of the system at each time. By relaxing the coupling constraints using Lagrange multipliers, the DSC problem can be decoupled into independent subproblems, one for each column. Each subproblem is solved using the Viterbi decoding algorithm, and a primal feasible solution is constructed by modifying the Viterbi solutions via a heuristic. The proposed Viterbi-Lagrangian relaxation algorithm (VLRA) provides a measure of suboptimality via an approximate duality gap. As a major practical extension of the above problem, we also consider the problem of diagnosing faults with delayed test outcomes, termed delay-dynamic set-covering (DDSC), and experiment with real-world problems that exhibit masking faults. Also, we present simulation results on OR-library datasets (set-covering formulations are predominantly validated on these matrices in the literature), posed as facility location problems. Finally, we implement these algorithms to solve problems in aerospace and automotive applications. Firstly, we address the diagnostic ambiguity problem in aerospace and automotive applications by developing a dynamic fusion framework that includes dynamic multiple fault diagnosis algorithms. This improves the correct fault isolation rate, while minimizing the false alarm rates, by considering multiple faults instead of the traditional data-driven techniques based on single fault (class)-single epoch (static) assumption. The dynamic fusion problem is formulated as a maximum a posteriori decision problem of inferring the fault sequence based on uncertain outcomes of multiple binary classifiers over time. The fusion process involves three steps: the first step transforms the multi-class problem into dichotomies using error correcting output codes (ECOC), thereby solving the concomitant binary classification problems; the second step fuses the outcomes of multiple binary classifiers over time using a sliding window or block dynamic fusion method that exploits temporal data correlations over time. We solve this NP-hard optimization problem via a Lagrangian relaxation (variational) technique. The third step optimizes the classifier parameters, viz., probabilities of detection and false alarm, using a genetic algorithm. The proposed algorithm is demonstrated by computing the diagnostic performance metrics on a twin-spool commercial jet engine, an automotive engine, and UCI datasets (problems with high classification error are specifically chosen for experimentation). We show that the primal-dual optimization framework performed consistently better than any traditional fusion technique, even when it is forced to give a single fault decision across a range of classification problems. Secondly, we implement the inference algorithms to diagnose faults in vehicle systems that are controlled by a network of electronic control units (ECUs). The faults, originating from various interactions and especially between hardware and software, are particularly challenging to address. Our basic strategy is to divide the fault universe of such cyber-physical systems in a hierarchical manner, and monitor the critical variables/signals that have impact at different levels of interactions. The proposed diagnostic strategy is validated on an electrical power generation and storage system (EPGS) controlled by two ECUs in an environment with CANoe/MATLAB co-simulation. Eleven faults are injected with the failures originating in actuator hardware, sensor, controller hardware and software components. Diagnostic matrix is established to represent the relationship between the faults and the test outcomes (also known as fault signatures) via simulations. The results show that the proposed diagnostic strategy is effective in addressing the interaction-caused faults.
Multiple task performance as a predictor of the potential of air traffic controller trainees.
DOT National Transportation Integrated Search
1972-01-01
Two hundred and twenty-nine air traffic controller trainees were tested on the CAMI Multiple Task Performance Battery. The battery provides objective measures of monitoring, arithmetical skills, visual discrimination, and group problem solving. The c...
ERIC Educational Resources Information Center
Glenn, Margaret K.; Diaz, Sebastian R.; Hawley, Carolyn
2009-01-01
Professionals in the field of addictions view problems associated with recovery management across multiple domains. This exploratory study utilized concept mapping and pattern matching methodology to conceptualize the resulting 7 domains of concern for treatment and aftercare of problem and pathological gamblers. The information can be used by…
Multiple Solutions of a Problem: Find the Best Point of the Shot
ERIC Educational Resources Information Center
Zelenskiy, Alexander S.
2013-01-01
In a recent issue of "Australian Senior Mathematics Journal" there has been published an interesting article by Galbraith and Lockwood (2010). In that article the problem of finding the most favorable points for a shot at goal in Australian football is considered from different points of view. A similar problem was considered by…
ERIC Educational Resources Information Center
Steif, Paul S.; Fu, Luoting; Kara, Levent Burak
2016-01-01
Problems faced by engineering students involve multiple pathways to solution. Students rarely receive effective formative feedback on handwritten homework. This paper examines the potential for computer-based formative assessment of student solutions to multipath engineering problems. In particular, an intelligent tutor approach is adopted and…
ERIC Educational Resources Information Center
Nokkala, Terhi
2016-01-01
Policy texts present problems, propose solutions to those problems and persuade multiple audiences of the legitimacy of the proposed problems and solutions. The rhetorical analysis of two decades of higher education and science and technology discourse in Finland, Germany, UK, Portugal and USA highlights the discursive elements that contribute to…
Modeling atmospheric effects - an assessment of the problems
Douglas G. Fox
1976-01-01
Our ability to simulate atmospheric processes that affect the life cycle of pollution is reviewed. The transport process is considered on three scales (a) the near-source or single-plume dispersion problem, (b) the multiple-source dispersion problem, and (c) the long-range transport. Modeling the first of these is shown to be well within the capability of generally...
ERIC Educational Resources Information Center
Yakubova, Gulnoza; Hughes, Elizabeth M.; Hornberger, Erin
2015-01-01
The purpose of this study was to determine the effectiveness of a point-of-view video modeling intervention to teach mathematics problem-solving when working on word problems involving subtracting mixed fractions with uncommon denominators. Using a multiple-probe across students design of single-case methodology, three high school students with…
ERIC Educational Resources Information Center
Langberg, Joshua M.; Molitor, Stephen J.; Oddo, Lauren E.; Eadeh, Hana-May; Dvorsky, Melissa R.; Becker, Stephen P.
2017-01-01
Objective: The primary objective of this study was to evaluate the prevalence of multiple types of sleep problems in young adolescents with ADHD. Method: 262 adolescents comprehensively diagnosed with ADHD and their caregivers completed well-validated measures of sleep problems and daytime sleepiness. Participants also completed measures related…
Using Additional Analyses to Clarify the Functions of Problem Behavior: An Analysis of Two Cases
ERIC Educational Resources Information Center
Payne, Steven W.; Dozier, Claudia L.; Neidert, Pamela L.; Jowett, Erica S.; Newquist, Matthew H.
2014-01-01
Functional analyses (FA) have proven useful for identifying contingencies that influence problem behavior. Research has shown that some problem behavior may only occur in specific contexts or be influenced by multiple or idiosyncratic variables. When these contexts or sources of influence are not assessed in an FA, further assessment may be…
ERIC Educational Resources Information Center
Hegde, Balasubrahmanya; Meera, B. N.
2012-01-01
A perceived difficulty is associated with physics problem solving from a learner's viewpoint, arising out of a multitude of reasons. In this paper, we have examined the microstructure of students' thought processes during physics problem solving by combining the analysis of responses to multiple-choice questions and semistructured student…
ERIC Educational Resources Information Center
Sharp, Emily; Shih Dennis, Minyi
2017-01-01
This study used a multiple probe across participants design to examine the effects of a model drawing strategy (MDS) intervention package on fraction comparing and ordering word problem-solving performance of three Grade 4 students. MDS is a form of cognitive strategy instruction for teaching word problem solving that includes explicit instruction…
Learning Analysis of K-12 Students' Online Problem Solving: A Three-Stage Assessment Approach
ERIC Educational Resources Information Center
Hu, Yiling; Wu, Bian; Gu, Xiaoqing
2017-01-01
Problem solving is considered a fundamental human skill. However, large-scale assessment of problem solving in K-12 education remains a challenging task. Researchers have argued for the development of an enhanced assessment approach through joint effort from multiple disciplines. In this study, a three-stage approach based on an evidence-centered…
ERIC Educational Resources Information Center
Koyuncu, Ilhan; Akyuz, Didem; Cakiroglu, Erdinc
2015-01-01
This study aims to investigate plane geometry problem-solving strategies of prospective mathematics teachers using dynamic geometry software (DGS) and paper-and-pencil (PPB) environments after receiving an instruction with GeoGebra (GGB). Four plane geometry problems were used in a multiple case study design to understand the solution strategies…
ERIC Educational Resources Information Center
Dembo, Richard; Wareham, Jennifer; Schmeidler, James; Winters, Ken C.
2016-01-01
Research on samples of truant adolescents is limited, with little known about mental health problems among truant youths. This study provided an exploratory, multilevel examination of mental health problems for a sample of 300 truant adolescents. Confirmatory factor analysis indicated a single factor of multiple mental health problems at the…
The bilinear complexity and practical algorithms for matrix multiplication
NASA Astrophysics Data System (ADS)
Smirnov, A. V.
2013-12-01
A method for deriving bilinear algorithms for matrix multiplication is proposed. New estimates for the bilinear complexity of a number of problems of the exact and approximate multiplication of rectangular matrices are obtained. In particular, the estimate for the boundary rank of multiplying 3 × 3 matrices is improved and a practical algorithm for the exact multiplication of square n × n matrices is proposed. The asymptotic arithmetic complexity of this algorithm is O( n 2.7743).
Diabetic Eye Problems - Multiple Languages
... Eye Problems - العربية (Arabic) Bilingual PDF Health Information Translations Diabetic Retinopathy - العربية (Arabic) Bilingual PDF Health Information Translations Chinese, Simplified (Mandarin dialect) (简体中文) Expand Section Diabetic ...
Systematic procedure for designing processes with multiple environmental objectives.
Kim, Ki-Joo; Smith, Raymond L
2005-04-01
Evaluation of multiple objectives is very important in designing environmentally benign processes. It requires a systematic procedure for solving multiobjective decision-making problems due to the complex nature of the problems, the need for complex assessments, and the complicated analysis of multidimensional results. In this paper, a novel systematic procedure is presented for designing processes with multiple environmental objectives. This procedure has four steps: initialization, screening, evaluation, and visualization. The first two steps are used for systematic problem formulation based on mass and energy estimation and order of magnitude analysis. In the third step, an efficient parallel multiobjective steady-state genetic algorithm is applied to design environmentally benign and economically viable processes and to provide more accurate and uniform Pareto optimal solutions. In the last step a new visualization technique for illustrating multiple objectives and their design parameters on the same diagram is developed. Through these integrated steps the decision-maker can easily determine design alternatives with respect to his or her preferences. Most importantly, this technique is independent of the number of objectives and design parameters. As a case study, acetic acid recovery from aqueous waste mixtures is investigated by minimizing eight potential environmental impacts and maximizing total profit. After applying the systematic procedure, the most preferred design alternatives and their design parameters are easily identified.
Continuous Timescale Long-Short Term Memory Neural Network for Human Intent Understanding
Yu, Zhibin; Moirangthem, Dennis S.; Lee, Minho
2017-01-01
Understanding of human intention by observing a series of human actions has been a challenging task. In order to do so, we need to analyze longer sequences of human actions related with intentions and extract the context from the dynamic features. The multiple timescales recurrent neural network (MTRNN) model, which is believed to be a kind of solution, is a useful tool for recording and regenerating a continuous signal for dynamic tasks. However, the conventional MTRNN suffers from the vanishing gradient problem which renders it impossible to be used for longer sequence understanding. To address this problem, we propose a new model named Continuous Timescale Long-Short Term Memory (CTLSTM) in which we inherit the multiple timescales concept into the Long-Short Term Memory (LSTM) recurrent neural network (RNN) that addresses the vanishing gradient problem. We design an additional recurrent connection in the LSTM cell outputs to produce a time-delay in order to capture the slow context. Our experiments show that the proposed model exhibits better context modeling ability and captures the dynamic features on multiple large dataset classification tasks. The results illustrate that the multiple timescales concept enhances the ability of our model to handle longer sequences related with human intentions and hence proving to be more suitable for complex tasks, such as intention recognition. PMID:28878646
The effects of preference assessment type on problem behavior.
Tung, Sara Beth; Donaldson, Jeanne M; Kahng, SungWoo
2017-10-01
Individuals with intellectual and developmental disabilities who engage in problem behavior maintained by access to tangibles may exhibit more problem behavior during certain preference assessments. We compared three common preference assessments to determine which resulted in fewer problem behaviors. The paired stimulus and multiple-stimulus without replacement assessments produced higher rates of problem behavior than the free operant (FO) assessment, suggesting that the FO assessment may be the most appropriate assessment for individuals who engage in problem behavior maintained by access to tangibles. © 2017 Society for the Experimental Analysis of Behavior.
NASA Astrophysics Data System (ADS)
Wen, Fang-Qing; Zhang, Gong; Ben, De
2015-11-01
This paper addresses the direction of arrival (DOA) estimation problem for the co-located multiple-input multiple-output (MIMO) radar with random arrays. The spatially distributed sparsity of the targets in the background makes compressive sensing (CS) desirable for DOA estimation. A spatial CS framework is presented, which links the DOA estimation problem to support recovery from a known over-complete dictionary. A modified statistical model is developed to accurately represent the intra-block correlation of the received signal. A structural sparsity Bayesian learning algorithm is proposed for the sparse recovery problem. The proposed algorithm, which exploits intra-signal correlation, is capable being applied to limited data support and low signal-to-noise ratio (SNR) scene. Furthermore, the proposed algorithm has less computation load compared to the classical Bayesian algorithm. Simulation results show that the proposed algorithm has a more accurate DOA estimation than the traditional multiple signal classification (MUSIC) algorithm and other CS recovery algorithms. Project supported by the National Natural Science Foundation of China (Grant Nos. 61071163, 61271327, and 61471191), the Funding for Outstanding Doctoral Dissertation in Nanjing University of Aeronautics and Astronautics, China (Grant No. BCXJ14-08), the Funding of Innovation Program for Graduate Education of Jiangsu Province, China (Grant No. KYLX 0277), the Fundamental Research Funds for the Central Universities, China (Grant No. 3082015NP2015504), and the Priority Academic Program Development of Jiangsu Higher Education Institutions (PADA), China.
Hestetun, Ingebjørg; Svendsen, Martin Veel; Oellingrath, Inger Margaret
2015-03-01
Overweight and mental health problems represent two major challenges related to child and adolescent health. More knowledge of a possible relationship between the two problems and the influence of peer problems on the mental health of overweight children is needed. It has previously been hypothesized that peer problems may be an underlying factor in the association between overweight and mental health problems. The purpose of the present study was to investigate the associations between overweight, peer problems, and indications of mental health problems in a sample of 12-13-year-old Norwegian schoolchildren. Children aged 12-13 years were recruited from the seventh grade of primary schools in Telemark County, Norway. Parents gave information about mental health and peer problems by completing the extended version of the Strength and Difficulties Questionnaire (SDQ). Height and weight were objectively measured. Complete data were obtained for 744 children. Fisher's exact probability test and multiple logistic regressions were used. Most children had normal good mental health. Multiple logistic regression analysis showed that overweight children were more likely to have indications of psychiatric disorders (adjusted OR: 1.8, CI: 1.0-3.2) and peer problems (adjusted OR: 2.6, CI: 1.6-4.2) than normal-weight children, when adjusted for relevant background variables. When adjusted for peer problems, the association between overweight and indications of any psychiatric disorder was no longer significant. The results support the hypothesis that peer problems may be an important underlying factor for mental health problems in overweight children.
The Multiple Control of Verbal Behavior
Michael, Jack; Palmer, David C; Sundberg, Mark L
2011-01-01
Amid the novel terms and original analyses in Skinner's Verbal Behavior, the importance of his discussion of multiple control is easily missed, but multiple control of verbal responses is the rule rather than the exception. In this paper we summarize and illustrate Skinner's analysis of multiple control and introduce the terms convergent multiple control and divergent multiple control. We point out some implications for applied work and discuss examples of the role of multiple control in humor, poetry, problem solving, and recall. Joint control and conditional discrimination are discussed as special cases of multiple control. We suggest that multiple control is a useful analytic tool for interpreting virtually all complex behavior, and we consider the concepts of derived relations and naming as cases in point. PMID:22532752
Multiple grid problems on concurrent-processing computers
NASA Technical Reports Server (NTRS)
Eberhardt, D. S.; Baganoff, D.
1986-01-01
Three computer codes were studied which make use of concurrent processing computer architectures in computational fluid dynamics (CFD). The three parallel codes were tested on a two processor multiple-instruction/multiple-data (MIMD) facility at NASA Ames Research Center, and are suggested for efficient parallel computations. The first code is a well-known program which makes use of the Beam and Warming, implicit, approximate factored algorithm. This study demonstrates the parallelism found in a well-known scheme and it achieved speedups exceeding 1.9 on the two processor MIMD test facility. The second code studied made use of an embedded grid scheme which is used to solve problems having complex geometries. The particular application for this study considered an airfoil/flap geometry in an incompressible flow. The scheme eliminates some of the inherent difficulties found in adapting approximate factorization techniques onto MIMD machines and allows the use of chaotic relaxation and asynchronous iteration techniques. The third code studied is an application of overset grids to a supersonic blunt body problem. The code addresses the difficulties encountered when using embedded grids on a compressible, and therefore nonlinear, problem. The complex numerical boundary system associated with overset grids is discussed and several boundary schemes are suggested. A boundary scheme based on the method of characteristics achieved the best results.
A pricing approach for mitigating congestion in multimodal transportation systems.
DOT National Transportation Integrated Search
2010-02-19
The problem addressed in this research is to determine usage prices for a system with : multiple modes of transportation with the objective of reducing congestion. With multiple : modes, these prices can take on several forms. On road networks, the u...
Potential exposure to human prescription pharmaceutical residues from wastewater
Pharmaceuticals in the environment (PiE) pose a complicated problem, involving multiple dissimilar compounds, multiple routes of potential exposure, and a range of potentially affected organisms that span the tree of life. Key uncertainties include not knowing which of the thous...
Reyes, Antonio Jose; Ramcharan, Kanterpersad; Sharma, Sharda
2016-01-28
A 29-year-old previously healthy woman, a doctor, was diagnosed with remitting relapsing multiple sclerosis after fulfilling McDonald's criteria for the diagnosis of definite multiple sclerosis. Despite 22 months of immunomodulatory treatment, the feasibility of continuing to train in a stressful specialty of medicine became an ethical and practical dilemma. Fitness for practice and career advancement among doctors with illnesses or having cognitive and physical decline from disease and/or ageing is a global problem. The need for addressing this issue in a compassionate and comprehensive manner is discussed. Cognitive and physical fitness are required in doctors and other healthcare workers since medical errors/adverse events are commonplace in medical practice. The public welfare is equally important in this global problem. 2016 BMJ Publishing Group Ltd.
Simplification of multiple Fourier series - An example of algorithmic approach
NASA Technical Reports Server (NTRS)
Ng, E. W.
1981-01-01
This paper describes one example of multiple Fourier series which originate from a problem of spectral analysis of time series data. The example is exercised here with an algorithmic approach which can be generalized for other series manipulation on a computer. The generalized approach is presently pursued towards applications to a variety of multiple series and towards a general purpose algorithm for computer algebra implementation.
Iterative pass optimization of sequence data
NASA Technical Reports Server (NTRS)
Wheeler, Ward C.
2003-01-01
The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.
Cooperative Robots to Observe Moving Targets: Review.
Khan, Asif; Rinner, Bernhard; Cavallaro, Andrea
2018-01-01
The deployment of multiple robots for achieving a common goal helps to improve the performance, efficiency, and/or robustness in a variety of tasks. In particular, the observation of moving targets is an important multirobot application that still exhibits numerous open challenges, including the effective coordination of the robots. This paper reviews control techniques for cooperative mobile robots monitoring multiple targets. The simultaneous movement of robots and targets makes this problem particularly interesting, and our review systematically addresses this cooperative multirobot problem for the first time. We classify and critically discuss the control techniques: cooperative multirobot observation of multiple moving targets, cooperative search, acquisition, and track, cooperative tracking, and multirobot pursuit evasion. We also identify the five major elements that characterize this problem, namely, the coordination method, the environment, the target, the robot and its sensor(s). These elements are used to systematically analyze the control techniques. The majority of the studied work is based on simulation and laboratory studies, which may not accurately reflect real-world operational conditions. Importantly, while our systematic analysis is focused on multitarget observation, our proposed classification is useful also for related multirobot applications.
Reconstruction From Multiple Particles for 3D Isotropic Resolution in Fluorescence Microscopy.
Fortun, Denis; Guichard, Paul; Hamel, Virginie; Sorzano, Carlos Oscar S; Banterle, Niccolo; Gonczy, Pierre; Unser, Michael
2018-05-01
The imaging of proteins within macromolecular complexes has been limited by the low axial resolution of optical microscopes. To overcome this problem, we propose a novel computational reconstruction method that yields isotropic resolution in fluorescence imaging. The guiding principle is to reconstruct a single volume from the observations of multiple rotated particles. Our new operational framework detects particles, estimates their orientation, and reconstructs the final volume. The main challenge comes from the absence of initial template and a priori knowledge about the orientations. We formulate the estimation as a blind inverse problem, and propose a block-coordinate stochastic approach to solve the associated non-convex optimization problem. The reconstruction is performed jointly in multiple channels. We demonstrate that our method is able to reconstruct volumes with 3D isotropic resolution on simulated data. We also perform isotropic reconstructions from real experimental data of doubly labeled purified human centrioles. Our approach revealed the precise localization of the centriolar protein Cep63 around the centriole microtubule barrel. Overall, our method offers new perspectives for applications in biology that require the isotropic mapping of proteins within macromolecular assemblies.
A multiple criteria analysis for household solid waste management in the urban community of Dakar.
Kapepula, Ka-Mbayu; Colson, Gerard; Sabri, Karim; Thonart, Philippe
2007-01-01
Household solid waste management is a severe problem in big cities of developing countries. Mismanaged solid waste dumpsites produce bad sanitary, ecological and economic consequences for the whole population, especially for the poorest urban inhabitants. Dealing with this problem, this paper utilizes field data collected in the urban community of Dakar, in view of ranking nine areas of the city with respect to multiple criteria of nuisance. Nine criteria are built and organized in three families that represent three classical viewpoints: the production of wastes, their collection and their treatment. Thanks to the method PROMETHEE and the software ARGOS, we do a pair-wise comparison of the nine areas, which allows their multiple criteria rankings according to each viewpoint and then globally. Finding the worst and best areas in terms of nuisance for a better waste management in the city is our final purpose, fitting as well as possible the needs of the urban community. Based on field knowledge and on the literature, we suggest applying general and area-specific remedies to the household solid waste problems.
Concurrent adversities among adolescents with conduct problems: the NAAHS study.
Reigstad, Bjørn; Kvernmo, Siv
2016-10-01
Several studies have confirmed that maltreatment and abuse in childhood are related to conduct problems. Less is known about such relationships with concurrent adversities in adolescence and, also, when compared with other severe adversities and possible multiple additive effects. The study encompassed a community population of 4881 adolescents 15-16 years of age 50.1 % boys and 49.9 % girls. Youth with and without conduct problem scores within the deviant range on the Strength and Difficulties Questionnaire (SDQ) was compared on 12 concurrent adversities. Based on self-reports, 4.4 % of the adolescents had conduct problem scores within the deviant range and more girls (5.1 %) than boys (3.7 %). In the deviant conduct problem group, 65.1 % had experienced two or more concurrent adversities compared with 26.3 % of youths in the non-deviant group (OR 5.23, 95 % CI 3.91-7.01). Likewise, the deviant conduct problem group was from 1.71 to 8.43 times more at the risk of experiencing the different adversities. Parental mental health problems and experiences of violence were multivariately strongest associated with conduct problem scores within the deviant range on the SDQ. A strong multiple additive relationship with adversities was found. Two-thirds of youth with SDQ conduct problem scores within the deviant range reported two or more concurrent adversities. Clinicians should seek information about kinds and amount of possible traumatic adversities in youth with conduct problems and offer evidence based treatment.
Mental health of adolescents before and after the death of a parent or sibling.
Stikkelbroek, Yvonne; Bodden, Denise H M; Reitz, Ellen; Vollebergh, Wilma A M; van Baar, Anneloes L
2016-01-01
The death of a parent or sibling (family bereavement) is associated with mental health problems in approximately, 25 % of the affected children. However, it is still unknown whether mental health problems of family-bereaved adolescents are predicted by pre-existing mental health problems, pre-loss family functioning, or multiple bereavements. In this study, a prospective longitudinal assessment of change in mental health following bereavement was done in a large representative sample from the 'Tracking Adolescents Individual Lives Survey' (TRAILS). This is a four-wave prospective cohort study of Dutch adolescents (n = 2230) of whom 131 (5.9 %) had experienced family bereavement at the last wave (T4). Family-bereaved adolescents reported more internalizing problems, within 2 years after family bereavement, compared to the non-bereaved peers, while taking into account the level of internalizing problems before the bereavement. A clinically relevant finding was that 22 % new cases were found in family-bereaved, in comparison to 5.5 % new cases in non-bereaved. Low SES predicted more internalizing problems in family-bereaved but not in non-bereaved adolescents. Family functioning, reported by the adolescent, did not predict mental health problems within 2 years. Multiple family bereavements predicted fewer externalizing problems. In conclusion, internalizing problems increase in adolescents after family bereavement in comparison to non-bereaved and these can be predicted by pre-loss factors. Awareness among professionals regarding the risks for aggravation of mental health problems after family loss is needed.
Meunier, Jean Christophe; Bisceglia, Rossana; Jenkins, Jennifer M
2012-07-01
In this study the associations between mothers' and fathers' differential parenting and children's oppositional and emotional problems were examined. A curvilinear relationship between differential parenting and children's outcomes was hypothesized, as well as the combined effect of mothers' and fathers' parenting. Data came from a community sample of 599 two-parent families with multiple children per family and were analyzed using a cross-classified multilevel model. Results showed that both family average parenting and differential parenting explained unique variance in children's outcomes. The curvilinear hypothesis was supported for oppositional behavior but not for emotional problems. The effects of mother and father positivity were found to be additive for both family average parenting and differential parenting, but for negativity there was evidence for multiplicative effects.
Heleniak, Charlotte; King, Kevin M.; Monahan, Kathryn C.; McLaughlin, Katie A.
2017-01-01
Although community violence is an established risk factor for youth aggression, less research has examined its relation with internalizing psychopathology. This study examined associations of community violence exposure with internalizing symptoms, and state and trait emotion dysregulation as mechanisms underlying these associations, in 287 adolescents aged 16–17 (45.6% male; 40.8% White). Community violence exposure was associated with internalizing symptoms, negative affect during peer evaluation, trait emotional reactivity, and infrequent problem solving. Multiple emotion dysregulation indices were also associated with internalizing symptoms. In simultaneous multiple mediator models, indirect effects of community violence on internalizing problems were significantly explained by state and trait emotion dysregulation. Findings implicate emotion dysregulation as one mechanism linking community violence exposure to adolescent internalizing symptoms. PMID:28646545
ERIC Educational Resources Information Center
Kahveci, Gül; Ataman, Aysegül
2017-01-01
Individuals with disabilities display problem behaviors frequently. This case study presents an analysis of the extent to which one student's pattern of multiple problem behaviors and the potential efficacy of Conjoint Behavioral Consultation (CBC) as a model for linking families, schools, and special education settings to address educational…
ERIC Educational Resources Information Center
Danseco, Evangeline R.; Marques, Paul R.
2002-01-01
The Problem-Oriented Screening Instrument for Teenagers (POSIT) screens for multiple problems among adolescents at risk for substance use. A shortened version of the POSIT was developed, using factor analysis, and correlational and reliability analyses. The POSIT-SF shows potential for a reliable and cost-efficient screen for youth with substance…
ERIC Educational Resources Information Center
Klein-Tasman, B. P.; Lee, K.
2017-01-01
Background: There is sparse literature about problem behaviour in young children with Williams syndrome (WS) and little consideration of the perspectives of multiple respondents. Methods: Problem behaviour of 35 children with WS ages 2 to 6 was examined based on both parent and teacher report using the Achenbach preschool forms. Results: The most…
An American Vital Interest: Preserving the Nuclear Enterprise Supplier Base
2012-02-15
not present significant problems since multiple sources are available and the suppliers are mostly small 7 companies that rely on Honeywell for...business. However, these vendors do present occasional problems in delivering incorrect parts, quantities or documentation. Honeywell continually...rectify vendor issues that require multi-agency involvement.8 Pantex also experiences similar problems with parts they procure separately from their
ERIC Educational Resources Information Center
Albanese, Mark A.; Jacobs, Richard M.
1990-01-01
The reliability and validity of a procedure to measure diagnostic-reasoning and problem-solving skills taught in predoctoral orthodontic education were studied using 68 second year dental students. The procedure includes stimulus material and 33 multiple-choice items. It is a feasible way of assessing problem-solving skills in dentistry education…
ERIC Educational Resources Information Center
Freeman-Green, Shaqwana M.; O'Brien, Chris; Wood, Charles L.; Hitt, Sara Beth
2015-01-01
This study examined the effects of explicit instruction in the SOLVE Strategy on the mathematical problem solving skills of six Grade 8 students with specific learning disabilities. The SOLVE Strategy is an explicit instruction, mnemonic-based learning strategy designed to help students in solving mathematical word problems. Using a multiple probe…
ERIC Educational Resources Information Center
Twombly, Eric C.; Holtz, Kristen D.
2008-01-01
The misuse of prescription drugs by teens in the United States is a growing public health problem. This article provides a systematic synthesis of multiple strands of literature to recommend effective prevention methods. Using a social-ecological framework, we review the scope of the problem of prescription drug use among teens. Then, we analyze…
Forslund, Tommie; Brocki, Karin C; Bohlin, Gunilla; Granqvist, Pehr; Eninger, Lilianne
2016-09-01
This study examined the contributions of several important domains of functioning to attention-deficit/hyperactivity disorder (ADHD) symptoms and conduct problems. Specifically, we investigated whether cognitive inhibition, emotion regulation, emotionality, and disorganized attachment made independent and specific contributions to these externalizing behaviour problems from a multiple pathways perspective. The study included laboratory measures of cognitive inhibition and disorganized attachment in 184 typically developing children (M age = 6 years, 10 months, SD = 1.7). Parental ratings provided measures of emotion regulation, emotionality, and externalizing behaviour problems. Results revealed that cognitive inhibition, regulation of positive emotion, and positive emotionality were independently and specifically related to ADHD symptoms. Disorganized attachment and negative emotionality formed independent and specific relations to conduct problems. Our findings support the multiple pathways perspective on ADHD, with poor regulation of positive emotion and high positive emotionality making distinct contributions to ADHD symptoms. More specifically, our results support the proposal of a temperamentally based pathway to ADHD symptoms. The findings also indicate that disorganized attachment and negative emotionality constitute pathways specific to conduct problems rather than to ADHD symptoms. © 2016 The British Psychological Society.
Wireless Sensor Network Optimization: Multi-Objective Paradigm.
Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad
2015-07-20
Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks.
Improving Multiple Fault Diagnosability using Possible Conflicts
NASA Technical Reports Server (NTRS)
Daigle, Matthew J.; Bregon, Anibal; Biswas, Gautam; Koutsoukos, Xenofon; Pulido, Belarmino
2012-01-01
Multiple fault diagnosis is a difficult problem for dynamic systems. Due to fault masking, compensation, and relative time of fault occurrence, multiple faults can manifest in many different ways as observable fault signature sequences. This decreases diagnosability of multiple faults, and therefore leads to a loss in effectiveness of the fault isolation step. We develop a qualitative, event-based, multiple fault isolation framework, and derive several notions of multiple fault diagnosability. We show that using Possible Conflicts, a model decomposition technique that decouples faults from residuals, we can significantly improve the diagnosability of multiple faults compared to an approach using a single global model. We demonstrate these concepts and provide results using a multi-tank system as a case study.
Multiple Reaction Equilibria--With Pencil and Paper: A Class Problem on Coal Methanation.
ERIC Educational Resources Information Center
Helfferich, Friedrich G.
1989-01-01
Points out a different and much simpler approach for the study of equilibria of multiple and heterogeneous chemical reactions. A simulation on coal methanation is used to teach the technique. An example and the methodology used are provided. (MVL)
ERIC Educational Resources Information Center
Shaw, David D.; Pease, Leonard F., III.
2014-01-01
Grading can be accelerated to make time for more effective instruction. This article presents specific time management strategies selected to decrease administrative time required of faculty and teaching assistants, including a multiple answer multiple choice interface for exams, a three-tier grading system for open ended problem solving, and a…
Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication
ERIC Educational Resources Information Center
Wolf, Michael Maclean
2009-01-01
Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific…
The Golden Ratio: A Golden Opportunity to Investigate Multiple Representations of a Problem.
ERIC Educational Resources Information Center
Dickey, Edwin M.
1993-01-01
This article explores the multiple representations (verbal, algebraic, graphical, and numerical) that can be used to study the golden ratio. Emphasis is placed on using technology (both calculators and computers) to investigate the algebraic, graphical, and numerical representations. (JAF)